1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58
|
Tree::RedBlack version 0.3
------------------------------------------------------------------------
This program is free software; you can redistribute it and/or modify
it under the terms of the Artistic License, a copy of which can be
found with perl.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Artistic License for more details.
------------------------------------------------------------------------
*** This is beta software -- use at your own risk ***
Introduction
------------
Tree::RedBlack is a pure perl implementation of the Red/Black balanced tree
algorithm from the book "Algorithms" by Cormen, Leiserson & Rivest. It
supports insertion, searching, finding minima, maxima, predecessors and
successors, and deletion (deletion definitely has bugs right now). Each node
in the tree consists of a key and a value. Both can be any Perl scalar, even a
complex structure. By default, keys in the tree are ordered lexically, but the
ordering can be overriden by providing the tree with a comparison subroutine.
Installation
------------
Installation follows the normal module installation procedure:
1. Uncompress and untar the distribution
2. In the root of the distribution, execute
$ perl Makefile.PL
$ make
$ make install
(sorry, no test suite yet)
Changes
-------
Version 0.3
Fixed memory leak since nodes pointed to their parents. Now,
DESTROY does a tree-traversal. Still haven't fixed delete.
I don't think the interface is going to change, so I've upgraded this
module to beta status.
Version 0.2
Major mess-up in Makefile.PL made it un-installable.
Changed how delete works a touch, but it hasn't been fixed yet
Version 0.1
First public alpha release
Feedback
--------
Please report any bugs or feature requests to Benjamin Holzman at
<bholzman@earthlink.net>
|