Looking for the latest version? Download avl_file-0.5.0.tar.gz (300.3 kB)
Home
Name Modified Size Downloads / Week Status
Totals: 2 Items   302.8 kB 10
README 2010-12-02 2.4 kB 0
avl_file-0.5.0.tar.gz 2009-11-26 300.3 kB 1010 weekly downloads
avl_file summary ================ avl_file is a library for file-based threaded AVL-trees (height balanced binary trees) with multiple keys and concurrent access, using fixed length records in single files. Install instructions ==================== To install, copy the gzipped tar file to "/usr/local/src". Then do, as root: # gunzip avl_file-0.5.0.tar.gz # tar -xvf avl_file-0.5.0.tar # cd avl_file-0.5.0 # ./configure # make # make install Usage ===== The 'man' page for avl_file, "avl_file.3", has instructions for using the library functions. It begin like this: AVL_FILE(3) AVL_FILE(3) NAME AVL_FILE - file-based AVL-tree functions. SYNOPSIS #include <avl_file.h> AVL_FILE *avl_file_open (char *fname, int32_t len, int32_t n_keys, avl_file_cmp_fn *cmp); void avl_file_close (AVL_FILE *ap); int32_t avl_file_insert (AVL_FILE *ap, void *data); int32_t avl_file_delete (AVL_FILE *ap, void *data); int32_t avl_file_update (AVL_FILE *ap, void *data); int32_t avl_file_find (AVL_FILE *ap, void *data, int32_t key); int32_t avl_file_startlt (AVL_FILE *ap, void *data, int32_t key); int32_t avl_file_startge (AVL_FILE *ap, void *data, int32_t key); int32_t avl_file_prev (AVL_FILE *ap, void *data, int32_t key); int32_t avl_file_next (AVL_FILE *ap, void *data, int32_t key); void avl_file_startseq (AVL_FILE *ap); int32_t avl_file_readseq (AVL_FILE *ap, void *data); void avl_file_lock (AVL_FILE *ap); void avl_file_unlock (AVL_FILE *ap); int64_t avl_file_getnum (AVL_FILE *ap); void avl_file_squash (AVL_FILE *ap); int32_t avl_file_scan (AVL_FILE *ap, int32_t key, off_t off, int64_t *count); DESCRIPTION These routines implement file-based threaded AVL-trees (height balanced binary trees) with multiple keys and concurrent access, using fixed length records in single files. The keys are part of the record structures, and so are not passed separately. A comparison function must be supplied that takes as parameters two record structure pointers and also a key index, to be used by these functions for the AVL-tree operations of inserting, searching, and deleting. ... The complete 'man' page is installed with the library routines.
Source: README, updated 2010-12-02