| 1 |
Tree::RedBlack version 0.4 |
| 2 |
------------------------------------------------------------------------ |
| 3 |
This program is free software; you can redistribute it and/or modify |
| 4 |
it under the terms of the Artistic License, a copy of which can be |
| 5 |
found with perl. |
| 6 |
|
| 7 |
This program is distributed in the hope that it will be useful, |
| 8 |
but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 9 |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 10 |
Artistic License for more details. |
| 11 |
------------------------------------------------------------------------ |
| 12 |
|
| 13 |
*** This is beta software -- use at your own risk *** |
| 14 |
|
| 15 |
Introduction |
| 16 |
------------ |
| 17 |
|
| 18 |
Tree::RedBlack is a pure perl implementation of the Red/Black balanced tree |
| 19 |
algorithm from the book "Algorithms" by Cormen, Leiserson & Rivest. It |
| 20 |
supports insertion, searching, finding minima, maxima, predecessors and |
| 21 |
successors, and deletion (deletion definitely has bugs right now). Each node |
| 22 |
in the tree consists of a key and a value. Both can be any Perl scalar, even a |
| 23 |
complex structure. By default, keys in the tree are ordered lexically, but the |
| 24 |
ordering can be overriden by providing the tree with a comparison subroutine. |
| 25 |
|
| 26 |
Installation |
| 27 |
------------ |
| 28 |
|
| 29 |
Installation follows the normal module installation procedure: |
| 30 |
|
| 31 |
1. Uncompress and untar the distribution |
| 32 |
2. In the root of the distribution, execute |
| 33 |
$ perl Makefile.PL |
| 34 |
$ make |
| 35 |
$ make install |
| 36 |
|
| 37 |
(sorry, no test suite yet) |
| 38 |
|
| 39 |
Feedback |
| 40 |
-------- |
| 41 |
|
| 42 |
Please report any bugs or feature requests to Benjamin Holzman at |
| 43 |
<[email protected]> |