           SPELL=bdb
         VERSION=0.6.5
     SOURCE_HASH=sha512:542ee3c70f7edaab7e84e0a63614731d293ac171ade8499cea6a3d0e7fea77659b9f8b2329be55fe33c0bd3d419419d99fd8efe49b92d2606c2ca25df60b2af1
          SOURCE=${SPELL}-${VERSION}.tar.gz
SOURCE_DIRECTORY=${BUILD_DIRECTORY}/${SPELL}-${VERSION}
   SOURCE_URL[0]=ftp://moulon.inra.fr/pub/ruby/${SOURCE}
   SOURCE_URL[1]=ftp://ftp.idaemons.org/pub/distfiles/ruby/moulon.inra.fr/${SOURCE}
       WEB_SITE=http://moulon.inra.fr/ruby/bdb.html
         ENTERED=20041207
      LICENSE[0]=GPL
        KEYWORDS="db database"
           SHORT="Berkeley DB is an embedded database system"
cat << EOF
Berkeley DB is an embedded database system that supports keyed access to data.

The library includes support for the following access methods:
  * B+tree: Stores keys in sorted order, using a default function that does lexicographical ordering of keys.
  * Hashing: Stores records in a hash table for fast searches based on strict equality, using a default that hashes on the key as a bit string.  Extended Linear Hashing modifies the hash function used by the table as new records are inserted, in order to keep buckets underfull in the steady state.
  * Fixed and Variable-Length Records: Stores fixed- or variable-length records in sequential order.  Record numbers may be immutable, requiring that new records be added only at the end of the database, or mutable, permitting new records to be inserted between existing records.
EOF
