--- py-intbitset/Makefile (nonexistent) +++ py-intbitset/Makefile (working copy) @@ -0,0 +1,24 @@ +# $FreeBSD$ + +PORTNAME= intbitset +DISTVERSION= 2.3.0 +CATEGORIES= devel python +MASTER_SITES= CHEESESHOP +PKGNAMEPREFIX= ${PYTHON_PKGNAMEPREFIX} + +MAINTAINER= freebsd_ports@k-worx.org +COMMENT= C-based extension implementing fast integer bit sets + +LICENSE= LGPL3 +LICENSE_FILE= ${WRKSRC}/LICENSE + +RUN_DEPENDS= ${PYTHON_PKGNAMEPREFIX}six>=0:devel/py-six@${PY_FLAVOR} +TEST_DEPENDS= ${PYTHON_PKGNAMEPREFIX}nose>=0:devel/py-nose@${PY_FLAVOR} + +USES= python +USE_PYTHON= cython distutils autoplist + +do-test: + @cd ${WRKSRC} && ${PYTHON_CMD} ${PYDISTUTILS_SETUP} test + +.include --- py-intbitset/distinfo (nonexistent) +++ py-intbitset/distinfo (working copy) @@ -0,0 +1,3 @@ +TIMESTAMP = 1530193455 +SHA256 (intbitset-2.3.0.tar.gz) = 589aff5117f2660767e04499dabb6288ef88e05566d3ac1d9fa3bb7cac4d5ef5 +SIZE (intbitset-2.3.0.tar.gz) = 139490 --- py-intbitset/pkg-descr (nonexistent) +++ py-intbitset/pkg-descr (working copy) @@ -0,0 +1,19 @@ +The intbitset library provides a set implementation to store sorted unsigned +integers either 32-bits integers or an infinite range with fast set operations +implemented via bit vectors in a Python C extension for speed and reduced memory +usage. + +The inbitset class emulates the Python built-in set class interface with some +additional specific methods such as its own fast dump and load marshalling +functions. + +intbitset additionally support the pickle protocol, the iterator protocol and +can behave like a sequence that can be sliced. Because the integers are always +stored sorted, the first element of a non-empty set [0] is also the min() +integer and the last element [-1] is also the max() integer in the set. + +When compared to the standard library set class, intbitset set operations such +as intersection, union and difference can be up to 5000 faster for dense integer +sets. + +WWW: https://github.com/inveniosoftware/intbitset/