Difference between revisions of "Wb"
(Created page with "{{Entry |Name=WB |Short description=Disk based, sorted associative array C library |Full description="WB" is a disk based (sorted) associative-array database package pr...") |
m (cleaning) |
||
(9 intermediate revisions by 4 users not shown) | |||
Line 1: | Line 1: | ||
{{Entry | {{Entry | ||
− | |Name=WB | + | |Name=GNU WB |
|Short description=Disk based, sorted associative array C library | |Short description=Disk based, sorted associative array C library | ||
− | |Full description= | + | |Full description='''WB''' is a disk based, sorted associative array (B-tree) library for [[SCM]]. Using WB, large databases can be created and managed from SCM. |
+ | |||
+ | 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; | * 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); | + | * 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. | * 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. | ||
+ | |Homepage URL=http://people.csail.mit.edu/jaffer/WB | ||
|User level=intermediate | |User level=intermediate | ||
+ | |VCS checkout command=cvs -d:pserver:anonymous@cvs.sv.gnu.org:/sources/wb co . | ||
+ | |Computer languages=C, C#, Java, or SCM | ||
+ | |Documentation note=User manuals: | ||
+ | |||
+ | * [https://people.csail.mit.edu/jaffer/wb/ HTML Manual] | ||
+ | * [https://people.csail.mit.edu/jaffer/wb.pdf PDF Manual] | ||
+ | |Related projects=SCM,slib | ||
+ | |Keywords=key,scheme,PUT,value,disk based,sorted,associative array,slib,rem,RWB-ISAM,binary encoding | ||
+ | |Version identifier=2b3 | ||
+ | |Version date=2015/01/14 | ||
+ | |Version status=beta | ||
+ | |Version download=https://groups.csail.mit.edu/mac/ftpdir/scm/wb-2b3.zip | ||
+ | |Last review by=Genium | ||
+ | |Last review date=2015/09/28 | ||
|Submitted by=Database conversion | |Submitted by=Database conversion | ||
|Submitted date=2011-04-01 | |Submitted date=2011-04-01 | ||
− | | | + | |Status= |
− | | | + | |Is GNU=Yes |
− | | | + | |GNU package identifier=wb |
− | | | + | |License verified date=2010-07-12 |
− | | | + | }} |
− | | | + | {{Project license |
+ | |License=GPLv2orlater with exception | ||
+ | |License verified by=Kelly Hopkins | ||
+ | |License verified date=2010-07-12 | ||
+ | }} | ||
+ | {{Project license | ||
+ | |License=LGPLv3orlater | ||
+ | |License verified by=Genium | ||
+ | |License verified date=2015/09/28 | ||
+ | }} | ||
+ | {{Person | ||
+ | |Real name=Aubrey Jaffer | ||
+ | |Role=Maintainer | ||
+ | |Resource URL= | ||
+ | }} | ||
+ | {{Resource | ||
+ | |Resource audience=Developer | ||
+ | |Resource kind=VCS Repository Webview | ||
+ | |Resource URL=http://cvs.savannah.gnu.org/viewvc/?root=wb | ||
+ | }} | ||
+ | {{Resource | ||
+ | |Resource audience=General | ||
+ | |Resource kind=Mailing List Info/Archive | ||
+ | |Resource URL=http://lists.gnu.org/mailman/listinfo/wb-discuss | ||
+ | }} | ||
+ | {{Resource | ||
+ | |Resource audience=Bugs | ||
+ | |Resource kind=Bug Tracking | ||
+ | |Resource URL=https://savannah.gnu.org/bugs/?group=wb | ||
+ | }} | ||
+ | {{Resource | ||
+ | |Resource audience=User | ||
+ | |Resource kind=Download | ||
+ | |Resource URL=https://groups.csail.mit.edu/mac/ftpdir/scm/ | ||
}} | }} | ||
{{Software category | {{Software category | ||
|Interface=library | |Interface=library | ||
}} | }} | ||
− | {{ | + | {{Featured}} |
− | |||
− | |||
− | |||
− | }} |
Revision as of 23:53, 28 September 2015
WB
https://www.gnu.org/software/wb/
Disk based sorted associative array C library.
WB is a disk based, sorted associative array (B-tree) library for SCM. Using WB, large databases can be created and managed from SCM.
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.
Licensing
License
Verified by
Verified on
Notes
Leaders and contributors
Contact(s) | Role |
---|---|
Aubrey Jaffer | Maintainer |
Resources and communication
Audience | Resource type | URI |
---|---|---|
General | https://savannah.gnu.org/people/ | |
Savannah (Ref) | https://savannah.gnu.org/projects/wb/ | |
Download | https://ftp.gnu.org/gnu/wb/ | |
Download | https://alpha.gnu.org/gnu/wb/ | |
Mailing List | https://lists.gnu.org/mailman/listinfo/gnu-system-discuss/ | |
Mailing List | https://lists.gnu.org/mailman/listinfo/wb-discuss/ | |
VCS Repository Webview | https://cvs.savannah.gnu.org/viewvc/wb/ | |
Download | https://groups.csail.mit.edu/mac/ftpdir/scm/ | |
Homepage | https://people.csail.mit.edu/jaffer/WB |
Software prerequisites
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.