This message announces the availability of wb1a2.

WB is a disk based, sorted associative array C library.  These
associative arrays consist of variable length (less that 256 bytes)
keys and values.  WB comes with an interface to the Scheme
implementation SCM.

Basic operations are creation, destruction, opening and closing of
diskfiles and arrays, insertion, deletion, retrieval, successor, and
predecessor (with respect to dictionary order of keys).  Functional
application of find-next, deletion, and modification over a range of
consecutive key values is supported.

Multiple associative arrays can be stored in one disk file.
Simultaneous access to multiple disk files is supported.  A structure
checker, garbage collector are included.  A repair program and
ram-disk type file (for temporary structures) are in developement.

The current WB implementation has a file size limit of 2^32 * block
size (default 2048) = 2^43 bytes (8796 Gbytes).  We currently run WB
with file sizes of several hundred Megabytes.  WB does its own memory
and disk management.

Documentation of the Scheme interface is provided.  Also included is
are notes describing our major design decisions, algorithims, and data
formats for WB's underlying modified B-tree structure.

WB is available via FTP from:
altdorf.ai.mit.edu:archive/scm/wb1a2.tar.z
nexus.yorku.ca:pub/scheme/new/wb1a2.tar.z

WB is actually written in Scheme and is compiled into C (compiler
included).  This first distribution of WB-tree requires the SCM and
SLIB packages for compilation.

SCM can be obtained via FTP from:
altdorf.ai.mit.edu:archive/scm/scm4c3.tar.z
nexus.yorku.ca:pub/scheme/new/scm4c3.tar.z

SLIB is a portable Scheme library which SCM uses:
altdorf.ai.mit.edu:archive/scm/slib1d3.tar.z
nexus.yorku.ca:pub/scheme/new/slib1d3.tar.z
