FTP Search

Directory

Content Search

avltree

In-memory index w/ binary and string keys and key counts

/Main/NetBSD/1.5.2/vax/

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.

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 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." Soviet Math. Doclady 3, 1962, pp. 1259-1263. 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.

Info:

Homepage:	-
Package version:	-
Architecture:	vax
Distribution:	NetBSD 1.5.2
Filename:	avltree-1.1.tgz

Browse inside avltree-1.1.tgz:

pkg://avltree-1.1.tgz:14239/  downloads

[DIR]man/  65535+ twin directories
[DIR]lib/  65535+ twin directories
[DIR]include/  65535+ twin directories
6 B  2001-04-27+SIZE_PKG  view  25016+ mirrors
6 B  2001-04-27+SIZE_ALL  view  5185+ mirrors
7.39 KB  2001-04-27+MTREE_DIRS  view  1213+ mirrors
799 B  2001-04-27+DESC  view  122 mirrors
822 B  2001-04-27+CONTENTS  view  197 mirrors
57 B  2001-04-27+COMMENT  view  7604+ mirrors
583 B  2001-04-27+BUILD_VERSION  view  74 mirrors
582 B  2001-04-27+BUILD_INFO  view  19 mirrors

Download avltree-1.1.tgz:

2000-11-05  ftp://ftp.ps.pl/dsk0/ftp.netbsd.org/NetBSD/packages/1.5.2/vax/All/avltree-1.1.tgz