./devel/py-bintrees, Provides Binary-, RedBlack- and AVL-Trees in Python and Cython

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]


Branch: CURRENT, Version: 2.2.0, Package name: py38-bintrees-2.2.0, Maintainer: khorben

This package provides Binary- RedBlack- and AVL-Trees written in Python and
Cython/C.

This Classes are much slower than the built-in *dict* class, but all
iterators/generators yielding data in sorted key order. Trees can be
uses as drop in replacement for *dicts* in most cases.


Master sites:

SHA1: 43085fb5f24ec5f61d216a701fcecfe28147181c
RMD160: 1522a48cbc2d36238c4355d0abb57d117f39a29d
Filesize: 105.735 KB

Version history: (Expand)


CVS history: (Expand)


   2021-03-09 07:00:47 by Adam Ciarcinski | Files touched by this commit (2) | Package updated
Log message:
py-bintrees: updated to 2.2.0

v2.2.0:
build c-extensions inplace for testing by github action
   2020-10-08 23:46:26 by Pierre Pronchery | Files touched by this commit (1)
Log message:
py-bintrees: remove redundant dependency on setuptools

While there, allow building with Python >= 3.5.
   2020-10-08 19:13:12 by Pierre Pronchery | Files touched by this commit (2) | Package updated
Log message:
py-bintrees: register additional missing dependencies

This restores building the *.so file submitted in the initial PLIST.

Bump PKGREVISION again.

Thanks wiz@ for the heads up!
   2020-10-05 23:22:39 by Thomas Klausner | Files touched by this commit (2) | Package updated
Log message:
py-bintrees: use egg.mk

Previously, this had a missing build dependency.
Now this does not install the *.so file listed in the PLIST, so perhaps
there are more optional dependencies. khorben@?

Bump PKGREVISION to be on the safe side.
   2020-09-29 04:19:06 by Pierre Pronchery | Files touched by this commit (4)
Log message:
py-bintrees: import version 2.1.0

This package provides Binary- RedBlack- and AVL-Trees written in Python and
Cython/C.

This Classes are much slower than the built-in *dict* class, but all
iterators/generators yielding data in sorted key order. Trees can be
uses as drop in replacement for *dicts* in most cases.