Disk based sorted associative array C library.
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.
28 September 2015
Leaders and contributors
Resources and communication
|VCS Repository Webview||https://cvs.savannah.gnu.org/viewvc/wb/|
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.