Bug 229448 - [NEW PORT] devel/py-intbitset: C-based extension implementing fast integer bit sets
Summary: [NEW PORT] devel/py-intbitset: C-based extension implementing fast integer bi...
Status: Closed FIXED
Alias: None
Product: Ports & Packages
Classification: Unclassified
Component: Individual Port(s) (show other bugs)
Version: Latest
Hardware: Any Any
: --- Affects Only Me
Assignee: Martin Wilke
URL: https://pypi.org/project/intbitset/
Keywords:
Depends on:
Blocks:
 
Reported: 2018-07-01 12:45 UTC by Kai Knoblich
Modified: 2018-07-28 12:07 UTC (History)
2 users (show)

See Also:


Attachments
py-intbitset.patch (3.25 KB, patch)
2018-07-01 12:45 UTC, Kai Knoblich
no flags Details | Diff

Note You need to log in before you can comment on or make changes to this bug.
Description Kai Knoblich freebsd_committer 2018-07-01 12:45:04 UTC
Created attachment 194811 [details]
py-intbitset.patch

Hello,

attached is the patch that adds the Python package devel/py-intbitset, which 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.


QA:
~~~
- poudriere (11.2-RELEASE amd64 + i386) for each py27 + py36 flavor -> OK
- portlint -> OK

make test results:
> Ran 50 tests in 42.287s
> 
> OK
Comment 1 commit-hook freebsd_committer 2018-07-28 12:07:18 UTC
A commit references this bug:

Author: miwi
Date: Sat Jul 28 12:07:11 UTC 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.

Changes:
  head/devel/Makefile
  head/devel/py-intbitset/
  head/devel/py-intbitset/Makefile
  head/devel/py-intbitset/distinfo
  head/devel/py-intbitset/pkg-descr