---
name: avltree
version: 1.1_1
origin: devel/avltree
comment: An in-memory index w/ binary and string keys and key counts
arch: freebsd:9:x86:64
www: UNKNOWN
maintainer: ports@FreeBSD.org
prefix: /usr/local
licenselogic: single
flatsize: 13100
desc: |
  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
categories: [devel]
files:
  /usr/local/include/avltree.h: c25e21569b84d07e4af5b6bf3619a096723e98b704c9bbb9ba6f3d5c4b65f8b4
  /usr/local/lib/libavltree.a: 9d8898da00a63a60614521dfd414cea64d00612ce14507df8e0dbbb848125f1c
  /usr/local/man/man3/avltree.3.gz: 7ca884aae7210180b865e89a8ad64f085136f17d6ef7ec8da000b23e7b70b7be
scripts: {}
