- New port devel/py-rbtree

An RBTree is a fast, balanced efficient data structure with the
following properties:

get          O(log n)
set          O(log n)
delete       O(log n)
min          O(log n)
max          O(log n)
contains     O(log n)

Because the worst case timing is minimal across the range of standard
dict and ordered data operations it makes sense to use this when you
have volatile/dynamic sorted data.

In common usage its nearly as fast as the Python dict impl but has a
slightly more expensive usage of the compare function as the keys are
ordered and not hashed.

WWW:	http://www.python.org/pypi/RBTree/

1 files changed, 1 insertions, 0 deletions

diff --git a/devel/Makefile b/devel/Makefile
index e065ccb26c8a..0ff5b2fb1309 100644
--- a/devel/Makefile
+++ b/devel/Makefile
@@ -1498,6 +1498,7 @@
     SUBDIR += py-px
     SUBDIR += py-pydasm
     SUBDIR += py-pytz
+    SUBDIR += py-rbtree
     SUBDIR += py-repl
     SUBDIR += py-resourcepackage
     SUBDIR += py-reverse