BSD Portsdevel/avltree 1.1nb1 NetBSD
In-memory index w/ binary and string keys and key counts
- System
- NetBSD
- Repository
- pkgsrc
- Maintainer
- [email protected]
- Categories
- devel
- Package size
- 11.2 KiB, 37.9 KiB installed
Description
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, [email protected].
Install
Binary package:
pkgin install avltreeFrom pkgsrc:
cd /usr/pkgsrc/devel/avltree && make install cleanPackages
The version each package repository carries. “-” means the repository builds no package of it, “n/a” that there is no such repository.
| Repository | Version |
|---|---|
| NetBSD 10.1 x86_64 | 1.1nb1 |
| NetBSD 10.1 aarch64 | 1.1nb1 |
| SmartOS / illumos x86_64 | 1.1nb1 |
| macOS 15 arm64 | 1.1nb1 |
Dependencies
No port depends on this one.