cvs commit: ports/devel Makefile ports/devel/py-rbtree Makefile distinfo pkg-descr ports/devel/py-rbtree/files patch-src__rbtree_impl.c

[Marcus Alves Grando]

mnag        2006-05-08 14:25:19 UTC

  FreeBSD ports repository

  Modified files:
    devel                Makefile 
  Added files:
    devel/py-rbtree      Makefile distinfo pkg-descr 
    devel/py-rbtree/files patch-src__rbtree_impl.c 
  Log:
  - 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/
  
  Revision  Changes    Path
  1.2196    +1 -0      ports/devel/Makefile
  1.1       +40 -0     ports/devel/py-rbtree/Makefile (new)
  1.1       +3 -0      ports/devel/py-rbtree/distinfo (new)
  1.1       +37 -0     ports/devel/py-rbtree/files/patch-src__rbtree_impl.c (new)
  1.1       +19 -0     ports/devel/py-rbtree/pkg-descr (new)