Date: Sat, 28 Jul 2018 12:07:10 +0000 (UTC) From: Martin Wilke <miwi@FreeBSD.org> To: ports-committers@freebsd.org, svn-ports-all@freebsd.org, svn-ports-head@freebsd.org Subject: svn commit: r475532 - in head/devel: . py-intbitset Message-ID: <201807281207.w6SC7AZm066711@repo.freebsd.org>
next in thread | raw e-mail | index | archive | help
Author: miwi Date: Sat Jul 28 12:07:10 2018 New Revision: 475532 URL: https://svnweb.freebsd.org/changeset/ports/475532 Log: 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/ PR: 229448 Submitted by: freebsd_ports@k-worx.org Sponsored by: iXsystems Inc. Added: head/devel/py-intbitset/ head/devel/py-intbitset/Makefile (contents, props changed) head/devel/py-intbitset/distinfo (contents, props changed) head/devel/py-intbitset/pkg-descr (contents, props changed) Modified: head/devel/Makefile Modified: head/devel/Makefile ============================================================================== --- head/devel/Makefile Sat Jul 28 12:05:28 2018 (r475531) +++ head/devel/Makefile Sat Jul 28 12:07:10 2018 (r475532) @@ -4609,6 +4609,7 @@ SUBDIR += py-iniparse SUBDIR += py-initgroups SUBDIR += py-instant + SUBDIR += py-intbitset SUBDIR += py-interface SUBDIR += py-intervaltree SUBDIR += py-invoke Added: head/devel/py-intbitset/Makefile ============================================================================== --- /dev/null 00:00:00 1970 (empty, because file is newly added) +++ head/devel/py-intbitset/Makefile Sat Jul 28 12:07:10 2018 (r475532) @@ -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 <bsd.port.mk> Added: head/devel/py-intbitset/distinfo ============================================================================== --- /dev/null 00:00:00 1970 (empty, because file is newly added) +++ head/devel/py-intbitset/distinfo Sat Jul 28 12:07:10 2018 (r475532) @@ -0,0 +1,3 @@ +TIMESTAMP = 1530193455 +SHA256 (intbitset-2.3.0.tar.gz) = 589aff5117f2660767e04499dabb6288ef88e05566d3ac1d9fa3bb7cac4d5ef5 +SIZE (intbitset-2.3.0.tar.gz) = 139490 Added: head/devel/py-intbitset/pkg-descr ============================================================================== --- /dev/null 00:00:00 1970 (empty, because file is newly added) +++ head/devel/py-intbitset/pkg-descr Sat Jul 28 12:07:10 2018 (r475532) @@ -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/
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?201807281207.w6SC7AZm066711>