【使用cython编写的第三方库】

最新推荐文章于 2024-06-10 01:30:49 发布

Mr.Lee jack

最新推荐文章于 2024-06-10 01:30:49 发布

阅读量616

点赞数

分类专栏： python 文章标签： python cython python加速 cpython c++

本文链接：https://blog.csdn.net/xzpdxz/article/details/121522509

版权

Cython Python 代码优化编译执行效率

关键词由CSDN通过智能技术生成

python 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

目的

使用cython来封装你的第三方库，使其编译为c代码，有如下好处
- 加速代码执行效率–>变异为c代码
- 编译时，会优化代码的执行
- 加密代码为so

安装cython

pip3 install cython

编写自定义代码库

./cal/cal.pyx

from math import sqrt

def primes(n: int):
	"""
	primes(n: int=2) -> list
    求质数
    :param n: n
    :return: 返回列表
    """
    cdef int i, j
    results = [1, ]
    for i in range(2, n):
        for j in range(2, int(sqrt(i))):
            if i % j == 0:
                break
        else:
            results.append(i)
    return results

./cal/init.py

from .cal import primes

编写编译脚本setup.py

from distutils.core import setup, Extension
from Cython.Build import cythonize

setup(
    name='cal',
    version='1.0',
    ext_modules=cythonize(["./cal/*.pyx"]),
    package_data={'cal': ["*.so"]},
    packages=['cal', 'cal'],
)

编译库

[~]# python3 setup.py build_ext --inplace
running build_ext
building 'cal.cal' extension
gcc -Wno-unused-result -Wsign-compare -Wunreachable-code -DNDEBUG -g -fwrapv -O3 -Wall -Wstrict-prototypes -I/Users/rockontrol/opt/miniconda3/include -arch x86_64 -I/Users/rockontrol/opt/miniconda3/include -arch x86_64 -I/Users/rockontrol/Desktop/python_code/venv/include -I/Users/rockontrol/opt/miniconda3/include/python3.8 -c ./cal/cal.c -o build/temp.macosx-10.9-x86_64-3.8/./cal/cal.o
gcc -bundle -undefined dynamic_lookup -L/Users/rockontrol/opt/miniconda3/lib -arch x86_64 -L/Users/rockontrol/opt/miniconda3/lib -arch x86_64 -arch x86_64 build/temp.macosx-10.9-x86_64-3.8/./cal/cal.o -o /Users/rockontrol/Desktop/python_code/code/test/c_test_module/cal/cal.cpython-38-darwin.so

测试test.py

import cal
import time
from math import sqrt

t1 = time.time()
cal.primes(3000000)
print(time.time() - t1)


def primes(n: int):
	"""原生python实现"""
    results = [1, ]
    for i in range(2, n):
        for j in range(2, int(sqrt(i))):
            if i % j == 0:
                break
        else:
            results.append(i)
    return results


t1 = time.time()
primes(3000000)
print(time.time() - t1)