[Lunar-commits] r18893 - moonbase/trunk/devel/bdb-ruby

[Auke Kok]

Author: sofar
Date: 2006-02-26 19:24:18 +0000 (Sun, 26 Feb 2006)
New Revision: 18893

Modified:
   moonbase/trunk/devel/bdb-ruby/DETAILS
Log:
Version bump - needed for db-4.4


Modified: moonbase/trunk/devel/bdb-ruby/DETAILS
===================================================================
--- moonbase/trunk/devel/bdb-ruby/DETAILS	2006-02-26 17:38:52 UTC (rev 18892)
+++ moonbase/trunk/devel/bdb-ruby/DETAILS	2006-02-26 19:24:18 UTC (rev 18893)
@@ -1,17 +1,29 @@
           MODULE=bdb-ruby
              MOD=bdb
-         VERSION=0.5.5
+         VERSION=0.5.8
           SOURCE=$MOD-$VERSION.tar.gz
 SOURCE_DIRECTORY=$BUILD_DIRECTORY/$MOD-$VERSION
       SOURCE_URL=ftp://moulon.inra.fr/pub/ruby/
+      SOURCE_VFY=sha1:f01d20dfa54ad7e5e3b41247329037318439e8c7
         WEB_SITE=http://moulon.inra.fr/ruby/bdb.html
            SHORT="Ruby API for Berkeley DB"
          ENTERED=20020718
-         UPDATED=20050514
+         UPDATED=20060226
 cat << EOF
-Developers may choose to store data in any of several different storage structures to satisfy the requirements of a particular application. In database terminology, these storage structures and the code that operates on them are called access methods. The library includes support for the following access methods: 
+Developers may choose to store data in any of several different storage
+structures to satisfy the requirements of a particular application. In
+database terminology, these storage structures and the code that
+operates on them are called access methods. 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. 
+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