Rather than being implemented via hashing, WB uses B-trees, which are optimized for using the minimum number of disk operations. Functions are provided to:
- create, destroy, open and close disk-files and associative arrays;
- insert, delete, retrieve, find next, and find previous (with respect to dictionary order of keys);
- apply functions, delete, or modify values over a range of consecutive key values.
WB is thread safe (so long as HAND structures are not shared between threads). The `put' and `rem' operations allow associations to be used for thread mutexs.
This is a GNU package:wb
released on 14 January 2015
|License||Verified by||Verified on||Notes|
|LGPLv3orlater||Genium||28 September 2015|
|GPLv2orlater with exception||Kelly Hopkins||12 July 2010|
Leaders and contributors
Resources and communication
|General||Mailing List Info/Archive||http://lists.gnu.org/mailman/listinfo/wb-discuss|
|Developer||VCS Repository Webview||http://cvs.savannah.gnu.org/viewvc/?root=wb|
This entry (in part or in whole) was last reviewed on 28 September 2015.