diff options
| author | jmmv <jmmv> | 2003-05-06 17:40:18 +0000 |
|---|---|---|
| committer | jmmv <jmmv> | 2003-05-06 17:40:18 +0000 |
| commit | 5a79423b6feb188f48299ebbaf981575b33d3f48 (patch) | |
| tree | 37ae7d212f46ef8018a7bd8c13edba7da1a47ed9 /devel/avltree | |
| parent | f58f4f25565243e0fcd6ee359261be2e3cfc7286 (diff) | |
| download | pkgsrc-5a79423b6feb188f48299ebbaf981575b33d3f48.tar.gz | |
Drop trailing whitespace. Ok'ed by wiz.
Diffstat (limited to 'devel/avltree')
| -rw-r--r-- | devel/avltree/DESCR | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/devel/avltree/DESCR b/devel/avltree/DESCR index e5677dfc1d3..20b38cb6ec0 100644 --- a/devel/avltree/DESCR +++ b/devel/avltree/DESCR @@ -1,4 +1,4 @@ -AVLtree is a small, malloc-based, in-memory index package generally +AVLtree is a small, malloc-based, in-memory index package generally like B-trees and hash tables. The interface resembles that of the BPLUS (B-tree) index package. @@ -6,17 +6,17 @@ Index creation options are: - fixed-length binary keys OR variable-length string keys - unique OR duplicate keys - - with duplicate keys: - standard (void *) pointers for each key OR + - with duplicate keys: + standard (void *) pointers for each key OR instance-counting (saves time and memory) Key insert/search time is O(log N). References: -Adelson-Velskii, G. M., and E. M. Landis. - "An Algorithm for the Organization of Information." +Adelson-Velskii, G. M., and E. M. Landis. + "An Algorithm for the Organization of Information." Soviet Math. Doclady 3, 1962, pp. 1259-1263. -Knuth, D. E. - The Art of Computer Programming, Volume 3: Sorting and Searching +Knuth, D. E. + The Art of Computer Programming, Volume 3: Sorting and Searching (2nd printing). Addison-Wesley, 1975, pp. 451-468. AVLtree was written by Gregory Tseytin, tseyting@acm.org. |