ruby_odeum 0.2.1

data/ext/odeum_index/vista.c

@@ -0,0 +1,159 @@
+/*************************************************************************************************
+ * Implementation of Vista
+ *                                                      Copyright (C) 2000-2005 Mikio Hirabayashi
+ * This file is part of QDBM, Quick Database Manager.
+ * QDBM is free software; you can redistribute it and/or modify it under the terms of the GNU
+ * Lesser General Public License as published by the Free Software Foundation; either version
+ * 2.1 of the License or any later version.  QDBM is distributed in the hope that it will be
+ * useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public License for more
+ * details.
+ * You should have received a copy of the GNU Lesser General Public License along with QDBM; if
+ * not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
+ * 02111-1307 USA.
+ *************************************************************************************************/
+
+
+#define _VISTA_C
+#include "vista.h"
+#include "myconf.h"
+
+
+
+/*************************************************************************************************
+ * macros to convert Depot to Curia
+ *************************************************************************************************/
+
+
+#define DEPOT          CURIA
+
+#define DPCR_DNUM      16
+
+#define \
+  dpopen(name, omode, bnum) \
+  cropen(name, omode, ((bnum / DPCR_DNUM) * 2), DPCR_DNUM)
+
+#define \
+  dpclose(db) \
+  crclose(db)
+
+#define \
+  dpput(db, kbuf, ksiz, vbuf, vsiz, dmode) \
+  crput(db, kbuf, ksiz, vbuf, vsiz, dmode)
+
+#define \
+  dpout(db, kbuf, ksiz) \
+  crout(db, kbuf, ksiz)
+
+#define \
+  dpget(db, kbuf, ksiz, start, max, sp) \
+  crget(db, kbuf, ksiz, start, max, sp)
+
+#define \
+  dpgetwb(db, kbuf, ksiz, start, max, vbuf) \
+  crgetwb(db, kbuf, ksiz, start, max, vbuf)
+
+#define \
+  dpvsiz(db, kbuf, ksiz) \
+  crvsiz(db, kbuf, ksiz)
+
+#define \
+  dpiterinit(db) \
+  criterinit(db)
+
+#define \
+  dpiternext(db, sp) \
+  criternext(db, sp)
+
+#define \
+  dpsetalign(db, align) \
+  crsetalign(db, align)
+
+#define \
+  dpsync(db) \
+  crsync(db)
+
+#define \
+  dpoptimize(db, bnum) \
+  croptimize(db, bnum)
+
+#define \
+  dpname(db) \
+  crname(db)
+
+#define \
+  dpfsiz(db) \
+  crfsiz(db)
+
+#define \
+  dpbnum(db) \
+  crbnum(db)
+
+#define \
+  dpbusenum(db) \
+  crbusenum(db)
+
+#define \
+  dprnum(db) \
+  crrnum(db)
+
+#define \
+  dpwritable(db) \
+  crwritable(db)
+
+#define \
+  dpfatalerror(db) \
+  crfatalerror(db)
+
+#define \
+  dpinode(db) \
+  crinode(db)
+
+#define \
+  dpmtime(db) \
+  crmtime(db)
+
+#define \
+  dpfdesc(db) \
+  crfdesc(db)
+
+#define \
+  dpremove(db) \
+  crremove(db)
+
+#define \
+  dprepair(db) \
+  crrepair(db)
+
+#define \
+  dpexportdb(db, name) \
+  crexportdb(db, name)
+
+#define \
+  dpimportdb(db, name) \
+  crimportdb(db, name)
+
+#define \
+  dpmemsync(db) \
+  crmemsync(db)
+
+#define \
+  dpgetflags(db) \
+  crgetflags(db)
+
+#define \
+  dpsetflags(db, flags) \
+  crsetflags(db, flags)
+
+
+
+/*************************************************************************************************
+ * including real implementation
+ *************************************************************************************************/
+
+
+#include "villa.c"
+
+
+
+/* END OF FILE */

data/ext/odeum_index/vista.h

@@ -0,0 +1,111 @@
+/*************************************************************************************************
+ * The extended advanced API of QDBM
+ *                                                      Copyright (C) 2000-2005 Mikio Hirabayashi
+ * This file is part of QDBM, Quick Database Manager.
+ * QDBM is free software; you can redistribute it and/or modify it under the terms of the GNU
+ * Lesser General Public License as published by the Free Software Foundation; either version
+ * 2.1 of the License or any later version.  QDBM is distributed in the hope that it will be
+ * useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public License for more
+ * details.
+ * You should have received a copy of the GNU Lesser General Public License along with QDBM; if
+ * not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
+ * 02111-1307 USA.
+ *************************************************************************************************/
+
+
+#ifndef _VISTA_H                         /* duplication check */
+#define _VISTA_H
+
+#if defined(__cplusplus)                 /* export for C++ */
+extern "C" {
+#endif
+
+
+
+/*************************************************************************************************
+ * macros to borrow symbols from Villa
+ *************************************************************************************************/
+
+
+#include <depot.h>
+#include <curia.h>
+#include <cabin.h>
+#include <stdlib.h>
+
+#define VLREC          VSTREC
+#define VLIDX          VSTIDX
+#define VLLEAF         VSTLEAF
+#define VLNODE         VSTNODE
+#define VLCFUNC        VSTCFUNC
+
+#define VL_CMPLEX      VST_CMPLEX
+#define VL_CMPINT      VST_CMPINT
+#define VL_CMPNUM      VST_CMPNUM
+#define VL_CMPDEC      VST_CMPDEC
+
+#define VILLA          VISTA
+
+#define VL_OREADER     VST_OREADER
+#define VL_OWRITER     VST_OWRITER
+#define VL_OCREAT      VST_OCREAT
+#define VL_OTRUNC      VST_OTRUNC
+#define VL_ONOLCK      VST_ONOLCK
+#define VL_OZCOMP      VST_OZCOMP
+
+#define VL_DOVER       VST_DOVER
+#define VL_DKEEP       VST_DKEEP
+#define VL_DDUP        VST_DDUP
+
+#define VL_JFORWARD    VST_JFORWARD
+#define VL_JBACKWARD   VST_JBACKWARD
+
+#define vlopen         vstopen
+#define vlclose        vstclose
+#define vlput          vstput
+#define vlout          vstout
+#define vlget          vstget
+#define vlvnum         vstvnum
+#define vlputlist      vstputlist
+#define vloutlist      vstoutlist
+#define vlgetlist      vstgetlist
+#define vlcurfirst     vstcurfirst
+#define vlcurlast      vstcurlast
+#define vlcurprev      vstcurprev
+#define vlcurnext      vstcurnext
+#define vlcurjump      vstcurjump
+#define vlcurkey       vstcurkey
+#define vlcurval       vstcurval
+#define vlsettuning    vstsettuning
+#define vlsync         vstsync
+#define vloptimize     vstoptimize
+#define vlname         vstname
+#define vlfsiz         vstfsiz
+#define vllnum         vstlnum
+#define vlnnum         vstnnum
+#define vlrnum         vstrnum
+#define vlwritable     vstwritable
+#define vlfatalerror   vstfatalerror
+#define vlinode        vstinode
+#define vlmtime        vstmtime
+#define vltranbegin    vsttranbegin
+#define vltrancommit   vsttrancommit
+#define vltranabort    vsttranabort
+#define vlremove       vstremove
+#define vlrepair       vstrepair
+#define vlexportdb     vstexportdb
+#define vlimportdb     vstimportdb
+
+#ifndef _VISTA_C
+#include <villa.h>
+#endif
+
+
+#if defined(__cplusplus)                 /* export for C++ */
+}
+#endif
+
+#endif                                   /* duplication check */
+
+
+/* END OF FILE */

data/test/test_odeum.rb

@@ -0,0 +1,174 @@
+require 'odeum_index'
+require 'test/unit'
+
+
+class OdeumTest < Test::Unit::TestCase
+    
+    def setup
+        @odeum = Odeum::Index.new "testdata", Odeum::OCREAT | Odeum::OWRITER
+    end
+    
+    def teardown
+        @odeum.close
+        Odeum::remove("testdata")
+    end
+
+    def test_attributes
+        assert_equal "testdata", @odeum.name
+        @odeum.size
+        @odeum.bucket_count
+        @odeum.buckets_used
+        @odeum.doc_count
+        @odeum.word_count
+        assert @odeum.writable
+        assert(!@odeum.fatal_error)
+        @odeum.inode
+        @odeum.mtime
+    end
+    
+    def test_document_attr
+        doc = Odeum::Document.new "testfile"
+        
+        time = Time.now.to_s
+        doc["Author"] = "Zed A. Shaw"
+        doc["Date"]= time
+        
+        assert_equal "Zed A. Shaw", doc["Author"]
+        assert_equal time, doc["Date"]
+    end
+    
+    def test_document_words
+        awords_expected = ["This", "is", "a", "set", "of", "words", "that", "we", "work", "with."]
+        nwords_expected = ["this", "is", "a", "set", "of", "words", "that", "we", "work", "with"]
+
+        # the manual way
+        doc = Odeum::Document.new "testfile"
+        words = Odeum::breaktext("This is a set of words that we work with.")
+        words.each do |word|
+            norm = Odeum::normalizeword(word)
+            doc.addword(norm, word)
+        end
+        
+        assert_equal nwords_expected, doc.normal_words
+        assert_equal awords_expected, doc.asis_words
+        
+        # manual, but adding an array of words
+        doc = Odeum::Document.new "testfile"
+        doc.add_word_list awords_expected
+        
+        assert_equal nwords_expected, doc.normal_words
+        assert_equal awords_expected, doc.asis_words
+        
+        # the easy way
+        doc = Odeum::Document.new "testfile"
+        doc.add_content("This is a set of words that we work with.")
+        
+        assert_equal nwords_expected, doc.normal_words
+        assert_equal awords_expected, doc.asis_words
+    end
+    
+    def test_document_misc
+        doc = Odeum::Document.new "testfile"
+        doc.id
+        assert_equal doc.uri, "testfile"
+    end
+    
+    
+    def test_load_documents
+        10.times do |i| 
+            doc = Odeum::Document.new "doc#{i}"
+            # create a bunch of words
+            words = Odeum::breaktext("This is a set of words that we work with.")
+            words.each do |word|
+                norm = Odeum::normalizeword(word)
+                doc.addword(norm, word)
+            end
+
+            time = Time.now.to_s
+            doc["Author"] = "Zed A. Shaw"
+            doc["Date"] = time
+            
+            res = @odeum.put(doc, -1, 1);
+        end
+
+        # test the remaining methods
+        assert @odeum.sync
+        assert @odeum.optimize
+        
+        # documents should be loaded, try iterating through them
+        assert @odeum.word_count == 10
+    end
+ 
+    def test_retrieval_delete
+        test_load_documents
+        
+        # get all the docs
+        docs = []
+        @odeum.iterator
+        while (doc = @odeum.next)
+            docs << doc
+        end
+        
+        # now remove them by different methods
+        docs.length.times do |i|
+            # test grabbing the scores
+            scores = docs[i].scores(20, @odeum);
+            
+            # testing get by id
+            doc = @odeum.get_by_id(docs[i].id)
+            assert_equal doc.uri, docs[i].uri
+            assert_equal doc.id, docs[i].id
+            
+            # testing get 
+            doc = @odeum.get(docs[i].uri)
+            assert_equal doc.uri, docs[i].uri
+            assert_equal doc.id, docs[i].id
+            
+            # testing check
+            assert @odeum.check(docs[i].id)
+            
+            # testing getting the id by uri
+            assert_equal docs[i].id, @odeum.get_id_by_uri(docs[i].uri)
+            
+            # testing out by id
+            if i % 2 == 0
+                @odeum.delete(docs[i].uri)
+            else
+                @odeum.delete_by_id(docs[i].id)
+            end
+            
+            @odeum.sync
+            assert (not @odeum.check(docs[i].id))
+        end
+
+        assert_equal @odeum.doc_count, 0
+    end
+    
+    
+    def test_search
+        test_load_documents
+
+        awords = {}
+        nwords = {}
+        
+        # go through all the docs and build a list of words
+        @odeum.iterator
+        while (doc = @odeum.next)
+            doc.asis_words.each { |word| awords[word] = nil }
+            doc.normal_words.each { |word| nwords[word] = nil }
+        end
+        
+        # now try searching through and see if we get some results
+        awords.each do |word, value|
+            num = @odeum.search_doc_count(Odeum::normalizeword(word))
+            pairs = @odeum.search(Odeum::normalizeword(word), @odeum.doc_count)
+            assert_equal num, pairs.length
+        end
+        
+        nwords.each do |word, value|
+            num = @odeum.search_doc_count(word)
+            pairs = @odeum.search(word, @odeum.doc_count)
+            assert_equal num, pairs.length
+        end
+    end
+end

metadata

@@ -0,0 +1,138 @@
+--- !ruby/object:Gem::Specification 
+rubygems_version: 0.8.3
+specification_version: 1
+name: ruby_odeum
+version: !ruby/object:Gem::Version 
+  version: 0.2.1
+date: 2005-04-20
+summary: Ruby/Odeum is a simple full text reverse indexer that lets you index a set of files and then search through them very quickly.
+require_paths: 
+  - lib
+email: 
+homepage: 
+rubyforge_project: 
+description: 
+autorequire: 
+default_executable: 
+bindir: bin
+has_rdoc: true
+required_ruby_version: !ruby/object:Gem::Version::Requirement 
+  requirements: 
+    - 
+      - ">"
+      - !ruby/object:Gem::Version 
+        version: 0.0.0
+  version: 
+platform: ruby
+authors: 
+  - Zed A. Shaw
+files: 
+  - COPYING
+  - LICENSE
+  - README
+  - bin/odeum_mgr
+  - doc/rdoc
+  - doc/rdoc/files
+  - doc/rdoc/index.html
+  - doc/rdoc/rdoc-style.css
+  - doc/rdoc/fr_method_index.html
+  - doc/rdoc/fr_class_index.html
+  - doc/rdoc/fr_file_index.html
+  - doc/rdoc/created.rid
+  - doc/rdoc/classes
+  - doc/rdoc/files/ext
+  - doc/rdoc/files/test
+  - doc/rdoc/files/LICENSE.html
+  - doc/rdoc/files/README.html
+  - doc/rdoc/files/COPYING.html
+  - doc/rdoc/files/ext/odeum_index
+  - doc/rdoc/files/ext/odeum_index/odeum_index_c.html
+  - doc/rdoc/files/test/test_odeum_rb.html
+  - doc/rdoc/classes/Odeum
+  - doc/rdoc/classes/OdeumTest.src
+  - doc/rdoc/classes/OdeumTest.html
+  - doc/rdoc/classes/Odeum.html
+  - doc/rdoc/classes/Odeum.src
+  - doc/rdoc/classes/Odeum/Index.src
+  - doc/rdoc/classes/Odeum/Index.html
+  - doc/rdoc/classes/Odeum/Document.html
+  - doc/rdoc/classes/Odeum/Document.src
+  - doc/rdoc/classes/Odeum/Index.src/M000015.html
+  - doc/rdoc/classes/Odeum/Index.src/M000016.html
+  - doc/rdoc/classes/Odeum/Index.src/M000017.html
+  - doc/rdoc/classes/Odeum/Index.src/M000018.html
+  - doc/rdoc/classes/Odeum/Index.src/M000019.html
+  - doc/rdoc/classes/Odeum/Index.src/M000020.html
+  - doc/rdoc/classes/Odeum/Index.src/M000021.html
+  - doc/rdoc/classes/Odeum/Index.src/M000022.html
+  - doc/rdoc/classes/Odeum/Index.src/M000023.html
+  - doc/rdoc/classes/Odeum/Index.src/M000024.html
+  - doc/rdoc/classes/Odeum/Index.src/M000025.html
+  - doc/rdoc/classes/Odeum/Index.src/M000026.html
+  - doc/rdoc/classes/Odeum/Index.src/M000027.html
+  - doc/rdoc/classes/Odeum/Index.src/M000028.html
+  - doc/rdoc/classes/Odeum/Index.src/M000029.html
+  - doc/rdoc/classes/Odeum/Index.src/M000030.html
+  - doc/rdoc/classes/Odeum/Index.src/M000031.html
+  - doc/rdoc/classes/Odeum/Index.src/M000032.html
+  - doc/rdoc/classes/Odeum/Index.src/M000033.html
+  - doc/rdoc/classes/Odeum/Index.src/M000034.html
+  - doc/rdoc/classes/Odeum/Index.src/M000035.html
+  - doc/rdoc/classes/Odeum/Index.src/M000036.html
+  - doc/rdoc/classes/Odeum/Index.src/M000037.html
+  - doc/rdoc/classes/Odeum/Index.src/M000038.html
+  - doc/rdoc/classes/Odeum/Index.src/M000039.html
+  - doc/rdoc/classes/Odeum/Document.src/M000040.html
+  - doc/rdoc/classes/Odeum/Document.src/M000041.html
+  - doc/rdoc/classes/Odeum/Document.src/M000042.html
+  - doc/rdoc/classes/Odeum/Document.src/M000043.html
+  - doc/rdoc/classes/Odeum/Document.src/M000044.html
+  - doc/rdoc/classes/Odeum/Document.src/M000045.html
+  - doc/rdoc/classes/Odeum/Document.src/M000046.html
+  - doc/rdoc/classes/Odeum/Document.src/M000047.html
+  - doc/rdoc/classes/Odeum/Document.src/M000048.html
+  - doc/rdoc/classes/Odeum/Document.src/M000049.html
+  - doc/rdoc/classes/Odeum/Document.src/M000050.html
+  - doc/rdoc/classes/Odeum/Document.src/M000051.html
+  - doc/rdoc/classes/OdeumTest.src/M000008.html
+  - doc/rdoc/classes/OdeumTest.src/M000009.html
+  - doc/rdoc/classes/OdeumTest.src/M000001.html
+  - doc/rdoc/classes/OdeumTest.src/M000002.html
+  - doc/rdoc/classes/OdeumTest.src/M000003.html
+  - doc/rdoc/classes/OdeumTest.src/M000004.html
+  - doc/rdoc/classes/OdeumTest.src/M000005.html
+  - doc/rdoc/classes/OdeumTest.src/M000006.html
+  - doc/rdoc/classes/OdeumTest.src/M000007.html
+  - doc/rdoc/classes/Odeum.src/M000010.html
+  - doc/rdoc/classes/Odeum.src/M000011.html
+  - doc/rdoc/classes/Odeum.src/M000012.html
+  - doc/rdoc/classes/Odeum.src/M000013.html
+  - doc/rdoc/classes/Odeum.src/M000014.html
+  - test/test_odeum.rb
+  - ext/odeum_index/depot.h
+  - ext/odeum_index/curia.h
+  - ext/odeum_index/odeum.h
+  - ext/odeum_index/villa.h
+  - ext/odeum_index/vista.h
+  - ext/odeum_index/myconf.h
+  - ext/odeum_index/cabin.h
+  - ext/odeum_index/depot.c
+  - ext/odeum_index/curia.c
+  - ext/odeum_index/odeum.c
+  - ext/odeum_index/villa.c
+  - ext/odeum_index/vista.c
+  - ext/odeum_index/myconf.c
+  - ext/odeum_index/cabin.c
+  - ext/odeum_index/odeum_index.c
+  - ext/odeum_index/extconf.rb
+test_files: 
+  - test/test_odeum.rb
+rdoc_options: []
+extra_rdoc_files: 
+  - README
+executables: 
+  - odeum_mgr
+extensions: 
+  - ext/odeum_index/extconf.rb
+requirements: []
+dependencies: []