rejuicer 0.0.1

data/History.txt

@@ -0,0 +1,4 @@
+== 0.0.1 2010-04-05
+
+* 1 major enhancement:
+  * Initial release

data/Manifest.txt

@@ -0,0 +1,8 @@
+History.txt
+Manifest.txt
+README.rdoc
+Rakefile
+lib/rejuicer.rb
+ext/extconf.rb
+ext/rejuicer_set.h
+ext/rejuicer_set.c

data/README.rdoc

@@ -0,0 +1,191 @@
+= Rejuicer
+
+= Description
+ Rejuicer is easy search engine.
+
+= How to
+
+== Initialize and index target set
+ index = Rejuicer.new(:odd_flag, :remainder_3, :remainder_5)
+
+== Indexing
+ work = Struct.new(:id, :odd_flag, :remainder_3, :remainder_5)
+ mother = (0...10000).inject([]){|m, i| m << work.new(i, i % 2 == 0, i % 3, i % 5)}
+
+ index.set(mother)
+
+== Search
+ index.search(:odd_flag => false) #=> [1,3,5,7,9...,9997,9999]
+ index.search(:remainder_3 => 2, :remainder_5 => 4) #=> [14,29,44,59,...,9974,9989]
+
+== INSTALL:
+
+sudo gem install rejuicer
+
+== LICENSE:
+
+		   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.

data/Rakefile

@@ -0,0 +1,28 @@
+%w[rubygems rake rake/clean fileutils newgem rubigen].each { |f| require f }
+require File.dirname(__FILE__) + '/lib/rejuicer'
+
+# Generate all the Rake tasks
+# Run 'rake -T' to see list of generated tasks (from gem root directory)
+$hoe = Hoe.new('rejuicer', Rejuicer.version) do |p|
+  p.developer('Tsukasa OISHI', 'tsukasa.oishi@gmail.com')
+  p.changes              = p.paragraphs_of("History.txt", 0..1).join("\n\n")
+  p.rubyforge_name       = p.name # TODO this is default value
+  p.extra_dev_deps = [
+    ['newgem', ">= #{::Newgem::VERSION}"]
+  ]
+
+  pec_extras = {
+    :extensions => ['ext/extconf.rb'],
+  }
+
+  p.clean_globs |= %w[**/.DS_Store tmp *.log]
+  path = (p.rubyforge_name == p.name) ? p.rubyforge_name : "\#{p.rubyforge_name}/\#{p.name}"
+  p.remote_rdoc_dir = File.join(path.gsub(/^#{p.rubyforge_name}\/?/,''), 'rdoc')
+  p.rsync_args = '-av --delete --ignore-errors'
+end
+
+require 'newgem/tasks' # load /tasks/*.rake
+Dir['tasks/**/*.rake'].each { |t| load t }
+
+# TODO - want other tests/tasks run by default? Add them to the list
+# task :default => [:spec, :features]

data/ext/extconf.rb

@@ -0,0 +1,2 @@
+require "mkmf"
+create_makefile("rejuicer_set")

data/ext/rejuicer_set.c

@@ -0,0 +1,405 @@
+//************************************
+//         rejuicer.c
+//
+//       Tsukasa OISHI
+//
+//         2010/03/17
+//************************************
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ruby.h>
+#include "rejuicer_set.h"
+
+//
+// initialize
+//
+void init_root_node(root_node root)
+{
+    int i;
+
+    for(i = 0; i < ROOT_NODE_SIZE; i++) {
+        root->index[i] = (void*)NULL;
+    }
+    root->size = 0;
+    root->children_size = 0;
+}
+
+void *init_branch_node(int level, unsigned int value)
+{
+    return init_branch_node2(level, (value / INDEX_PER_SIZE[level - 1]));
+}
+
+void *init_branch_node2(int level, unsigned int num)
+{
+    int i;
+    branch_node branch;
+
+    if (!(branch = (branch_node)malloc(sizeof(struct _branch_node)))) {
+        rb_raise(rb_eStandardError, "memory is not enough");
+    }
+
+    for(i = 0; i < BRANCH_NODE_SIZE; i++) {
+        branch->index[i] = (void*)NULL;
+    }
+
+    branch->level = level;
+    branch->num = num;
+    branch->children_size = 0;
+
+    return (void*)branch;
+}
+
+void *init_leaf_node(unsigned int value)
+{
+    return init_leaf_node2(value / INDEX_PER_SIZE[LAST_BRANCH_LEVEL]);
+}
+
+void *init_leaf_node2(unsigned int num)
+{
+    leaf_node leaf;
+
+    if(!(leaf = (leaf_node)malloc(sizeof(struct _leaf_node)))) {
+        rb_raise(rb_eStandardError, "memory is not enough");
+    }
+
+    leaf->num = num;
+    leaf->data = 0;
+
+    return (void*)leaf;
+}
+
+//
+// insert element into set
+//
+void add_num(root_node root, unsigned int value)
+{
+    unsigned int quotient, remainder;
+
+    quotient = value / INDEX_PER_SIZE[0];
+    remainder = value % INDEX_PER_SIZE[0];
+
+    if(!(root->index[quotient])) {
+        root->index[quotient] = init_branch_node(1, quotient);
+        root->children_size++;
+    }
+
+    if (search_and_insert((branch_node)root->index[quotient], 1, remainder, value)) {
+        root->size++;
+    }
+}
+
+int search_and_insert(branch_node branch, int level, unsigned int value, unsigned int original)
+{
+    unsigned int quotient, remainder;
+
+    quotient = value / INDEX_PER_SIZE[level];
+    remainder = value % INDEX_PER_SIZE[level];
+
+    if(!(branch->index[quotient])) {
+        branch->children_size++;
+        if(level == LAST_BRANCH_LEVEL) {
+            branch->index[quotient] = init_leaf_node(original);
+        } else {
+            branch->index[quotient] = init_branch_node(level + 1, original);
+        }
+    }
+
+    if (level == LAST_BRANCH_LEVEL) {
+        return search_and_insert_at_leaf((leaf_node)branch->index[quotient], remainder);
+    } else {
+        return search_and_insert((branch_node)branch->index[quotient], level + 1, remainder, original);
+    }
+}
+
+int search_and_insert_at_leaf(leaf_node leaf, unsigned int value)
+{
+    int exist_flag = 0;
+    unsigned int target_bit;
+
+    target_bit = 1 << value; 
+
+    if (!(leaf->data & target_bit)) {
+        leaf->data |= target_bit;
+        exist_flag = 1;
+    }
+
+    return exist_flag;
+}
+
+//
+// output Array object from internal set
+//
+void to_array(root_node root, VALUE array)
+{
+    int i, count;
+
+    for(i = 0, count = 0; i < ROOT_NODE_SIZE || count < root->children_size; i++) {
+        if (root->index[i]) {
+            search_and_get_array((branch_node)root->index[i], array);
+            count++;
+        }
+    }
+}
+
+void search_and_get_array(branch_node branch, VALUE array)
+{
+    int i, count;
+
+    if (branch->level == LAST_BRANCH_LEVEL) {
+        for(i = 0, count = 0; i < BRANCH_NODE_SIZE || count < branch->children_size; i++) {
+            if (branch->index[i]) {
+                search_and_get_array_at_leaf((leaf_node)branch->index[i], array);
+                count++;
+            }
+        }
+    } else {
+        for(i = 0, count = 0; i < BRANCH_NODE_SIZE || count < branch->children_size; i++) {
+            if (branch->index[i]) {
+                search_and_get_array((branch_node)branch->index[i], array);
+                count++;
+            }
+        }
+    }
+}
+
+void search_and_get_array_at_leaf(leaf_node leaf, VALUE array)
+{
+    int i = 0;
+    unsigned int x;
+
+    x = leaf->data;
+
+    while(x) {
+        if (x & 1) {
+            rb_ary_push(array, UINT2NUM(leaf->num * INDEX_PER_SIZE[LAST_BRANCH_LEVEL] + i));
+        }
+        x = x >> 1;
+        i++;
+    }
+}
+
+//
+// intersection
+//
+void intersection(root_node ret_set, root_node set0, root_node set1)
+{
+    int i, count;
+    root_node base, other;
+
+    if (set0->size == 0 || set1->size == 0) {
+        return;
+    } else if (set0->size > set1->size) {
+        base = set1;
+        other = set0;
+    } else {
+        base = set0;
+        other = set1;
+    }
+
+    for (i = 0, count = 0; i < ROOT_NODE_SIZE || count < base->children_size; i++) {
+        if (base->index[i]) {
+            count++;
+            if (other->index[i]) {
+                ret_set->index[i] = init_branch_node2(((branch_node)base->index[i])->level, ((branch_node)base->index[i])->num);
+                intersection_branch_node(ret_set, (branch_node)ret_set->index[i], (branch_node)base->index[i], (branch_node)other->index[i]);
+            }
+        }
+    }
+}
+
+void intersection_branch_node(root_node root, branch_node ret_set, branch_node base, branch_node other)
+{
+    int i, count;
+
+    for (i = 0, count = 0; i < BRANCH_NODE_SIZE || count < base->children_size; i++) {
+        if (base->index[i]) {
+            count++;
+            if (other->index[i]) {
+                if (base->level == LAST_BRANCH_LEVEL) {
+                    ret_set->index[i] = init_leaf_node2(((leaf_node)base->index[i])->num);
+                    intersection_leaf_node(root, (leaf_node)ret_set->index[i], (leaf_node)base->index[i], (leaf_node)other->index[i]);
+                } else {
+                    ret_set->index[i] = init_branch_node2(((branch_node)base->index[i])->level, ((branch_node)base->index[i])->num);
+                    intersection_branch_node(root, (branch_node)ret_set->index[i], (branch_node)base->index[i], (branch_node)other->index[i]);
+                }
+            }
+        }
+    }
+}
+
+void intersection_leaf_node(root_node root, leaf_node ret_set, leaf_node base, leaf_node other)
+{
+    ret_set->data = base->data & other->data;
+    root->size += bit_count(ret_set->data);
+}
+
+unsigned int bit_count(unsigned int x)
+{
+    x = x - ((x >> 1) & 0x55555555);
+    x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
+    x = (x + (x >> 4)) & 0x0f0f0f0f;
+    x = x + (x >> 8);
+    x = x + (x >> 16);
+    return x & 0x0000003F;
+}
+
+//
+// memory free
+//
+void destroy_all(root_node root)
+{
+    int i, count;
+    
+    for(i = 0, count = 0; i < ROOT_NODE_SIZE || count < root->children_size; i++) {
+        if (root->index[i]) {
+            destroy_branch((branch_node)root->index[i]);
+            count++;
+        }
+    }
+    free(root);
+}
+
+void destroy_branch(branch_node branch)
+{
+    int i, count;
+
+    if (branch->level == LAST_BRANCH_LEVEL) {
+        for(i = 0, count = 0; i < BRANCH_NODE_SIZE || count < branch->children_size; i++) {
+            if (branch->index[i]) {
+                free((leaf_node)branch->index[i]);
+                count++;
+            }
+        }
+    } else {
+        for(i = 0, count = 0; i < BRANCH_NODE_SIZE || count < branch->children_size; i++) {
+            if (branch->index[i]) {
+                destroy_branch((branch_node)branch->index[i]);
+                count++;
+            }
+        }
+    }
+    free(branch);
+}
+
+//-----------------------------------------------------------
+// Ruby Methods
+// ----------------------------------------------------------
+
+/**
+ * new
+**/
+static VALUE t_new(int argc, VALUE *argv, VALUE klass)
+{
+    VALUE num;
+    VALUE obj;
+    root_node root;
+
+    obj = Data_Make_Struct(klass, struct _root_node, NULL, destroy_all, root);
+    init_root_node(root);
+
+    if (argc == 1) {
+        while((num = rb_ary_shift(argv[0])) != Qnil) {
+            add_num(root, NUM2UINT(num));
+        }
+    }
+
+    return obj;
+}
+
+/**
+ * add
+**/
+static VALUE t_add(VALUE self, VALUE value)
+{
+    root_node root;
+    unsigned int num;
+
+    Data_Get_Struct(self, struct _root_node, root);
+    if ((num = NUM2UINT(value)) != Qnil) {
+        add_num(root, num);
+    }
+
+    return self;
+}
+
+/**
+ * intersection
+**/
+static VALUE t_intersection(VALUE self, VALUE array)
+{
+    root_node set0, set1, ret_set;
+    VALUE ret;
+
+    ret = Data_Make_Struct(rb_cRejuicerSet, struct _root_node, NULL, destroy_all, ret_set);
+    init_root_node(ret_set);
+
+    Data_Get_Struct(self, struct _root_node, set0);
+    Data_Get_Struct(array, struct _root_node, set1);
+
+    intersection(ret_set, set0, set1);
+
+    return ret;
+}
+
+/**
+ * to_a
+**/ 
+static VALUE t_to_a(VALUE self)
+{
+    int i;
+    root_node root;
+    VALUE array;
+
+    Data_Get_Struct(self, struct _root_node, root);
+    array = rb_ary_new2(root->size);
+
+    to_array(root, array);
+
+    return array;
+}
+
+/**
+ * size
+**/
+static VALUE t_size(VALUE self)
+{
+    root_node root;
+
+    Data_Get_Struct(self, struct _root_node, root);
+
+    return INT2NUM(root->size);
+}
+
+/**
+ * empty?
+**/
+static VALUE t_empty(VALUE self)
+{
+    root_node root;
+
+    Data_Get_Struct(self, struct _root_node, root);
+
+    if (root->size == 0) {
+        return Qtrue;
+    } else {
+        return Qfalse;
+    }
+}
+
+/**
+ * define class
+**/
+void Init_rejuicer_set(void) {
+    rb_cRejuicerSet = rb_define_class("RejuicerSet", rb_cObject);
+    rb_define_singleton_method(rb_cRejuicerSet, "new", t_new, -1);
+    rb_define_method(rb_cRejuicerSet, "add", t_add, 1);
+    rb_define_method(rb_cRejuicerSet, "intersection", t_intersection, 1);
+    rb_define_method(rb_cRejuicerSet, "to_a", t_to_a, 0);
+    rb_define_method(rb_cRejuicerSet, "size", t_size, 0);
+    rb_define_method(rb_cRejuicerSet, "empty?", t_empty, 0);
+    rb_define_alias(rb_cRejuicerSet, "<<", "add");
+    rb_define_alias(rb_cRejuicerSet, "&", "intersection");
+    rb_define_alias(rb_cRejuicerSet, "length", "size");
+}

data/ext/rejuicer_set.h

@@ -0,0 +1,79 @@
+//************************************
+//         rejuicer.h
+//
+//       Tsukasa OISHI
+//
+//         2010/03/17
+//************************************
+
+// max children size at node
+#define ROOT_NODE_SIZE 8
+#define BRANCH_NODE_SIZE 256
+// tree bottom level
+#define LAST_BRANCH_LEVEL 3
+
+// RejuicerSet class object
+static VALUE rb_cRejuicerSet;
+
+// size of a child
+static unsigned int INDEX_PER_SIZE[] = {0x20000000, 0x200000, 0x2000, 0x20};
+
+// leaf node
+typedef struct _leaf_node {
+    unsigned int num;   // offset
+    unsigned int data;  // bit operation
+} *leaf_node;
+
+// branch node
+typedef struct _branch_node {
+    unsigned int num;               // offset
+    unsigned int level;
+    unsigned int children_size;
+    void *index[BRANCH_NODE_SIZE];  // children pointer
+} *branch_node;
+
+typedef struct _root_node {
+    unsigned int size;              // number of elements in set
+    unsigned int children_size;     
+    void *index[ROOT_NODE_SIZE];    // children pointer
+} *root_node;
+
+// initialize
+void init_root_node(root_node);
+void *init_branch_node(int, unsigned int);
+void *init_branch_node2(int, unsigned int);
+void *init_leaf_node(unsigned int);
+void *init_leaf_node2(unsigned int);
+
+// insert element into set
+void add_num(root_node, unsigned int);
+int search_and_insert(branch_node, int, unsigned int, unsigned int);
+int search_and_insert_at_leaf(leaf_node, unsigned int);
+
+// output Array object from internal set
+void to_array(root_node, VALUE);
+void search_and_get_array(branch_node, VALUE);
+void search_and_get_array_at_leaf(leaf_node, VALUE);
+
+// intersection
+void intersection(root_node, root_node, root_node);
+void intersection_branch_node(root_node, branch_node, branch_node, branch_node);
+void intersection_leaf_node(root_node, leaf_node, leaf_node, leaf_node);
+unsigned int bit_count(unsigned int);
+
+// memory free
+void destroy_all(root_node);
+void destroy_branch(branch_node);
+
+//-----------------------------------------------------------
+// Ruby Methods
+// ----------------------------------------------------------
+
+static VALUE t_new(int, VALUE *, VALUE);
+static VALUE t_add(VALUE, VALUE);
+static VALUE t_intersection(VALUE, VALUE);
+static VALUE t_to_a(VALUE);
+static VALUE t_size(VALUE);
+static VALUE t_empty(VALUE);
+void Init_rejuicer_set(void);
+

data/lib/rejuicer.rb

@@ -0,0 +1,70 @@
+require 'rejuicer_set'
+#
+# Rejuicer is easy search engine.
+# RejuicerSet is used to set operation.
+#
+# work = Struct.new(:id, :odd_flag, :remainder_3, :remainder_5)
+# mother = (0...10000).inject([]){|m, i| m << work.new(i, i % 2 == 0, i % 3, i % 5)}
+#
+# index = Rejuicer.new(:odd_flag, :remainder_3, :remainder_5)
+# index.set(mother)
+#
+# index.search(:odd_flag => false) #=> [1,3,5,7,9...,9997,9999]
+# index.search(:remainder_3 => 2, :remainder_5 => 4) #=> [14,29,44,59,...,9974,9989]
+#
+class Rejuicer
+  #
+  # args :
+  #   methods or attributes name
+  #   that index target
+  #
+  def initialize(*args)
+    @tree = args.inject({}){|t,i| t[i.to_sym] = {};t}
+  end
+
+  #
+  # indexing
+  #   array : objects
+  #   id_attr : index id
+  #
+  def set(array, id_attr = :id)
+    array.each{|a| add(a, id_attr)}
+  end
+
+  #
+  # indexing
+  #   obj : object
+  #   id_attr : index id
+  #
+  def add(obj, id_attr = :id)
+    @tree.keys.each do |k|
+      begin
+        at = obj.__send__(k)
+        obj_id = obj.__send__(id_attr)
+      rescue NoMethodError
+        next
+      end
+
+      @tree[k.to_sym][at] ||= RejuicerSet.new
+      @tree[k.to_sym][at] << obj_id
+    end
+  end
+  alias :<< :add
+
+  # 
+  # search
+  #  conditions: search target
+  #
+  def search(conditions)
+    raise ArgumentError if conditions.empty?
+
+    f_cond = conditions.shift
+    f_set = @tree[f_cond.first.to_sym][f_cond.last]
+    return f_set.to_a if conditions.empty?
+
+    ret = conditions.sort_by{|cond| @tree[cond.first.to_sym][cond.last].size}.inject(f_set) do |work, cond|
+      work & @tree[cond.first.to_sym][cond.last]
+    end
+    ret.to_a
+  end
+end

metadata

@@ -0,0 +1,86 @@
+--- !ruby/object:Gem::Specification 
+name: rejuicer
+version: !ruby/object:Gem::Version 
+  version: 0.0.1
+platform: ruby
+authors: 
+- Tsukasa OISHI
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2010-04-05 00:00:00 +09:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: newgem
+  type: :development
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: 1.2.3
+    version: 
+- !ruby/object:Gem::Dependency 
+  name: hoe
+  type: :development
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: 1.8.0
+    version: 
+description: Rejuicer.
+email: 
+- tsukasa.oishi@gmail.com
+executables: []
+
+extensions: 
+- ext/extconf.rb
+extra_rdoc_files: 
+- History.txt
+- Manifest.txt
+- README.rdoc
+files: 
+- History.txt
+- Manifest.txt
+- README.rdoc
+- Rakefile
+- lib/rejuicer.rb
+- ext/extconf.rb
+- ext/rejuicer_set.h
+- ext/rejuicer_set.c
+has_rdoc: true
+homepage: http://www.kaeruspoon.net/
+licenses: []
+
+post_install_message: 
+rdoc_options: 
+- --main
+- README.rdoc
+require_paths: 
+- lib
+- ext
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+requirements: []
+
+rubyforge_project: rejuicer
+rubygems_version: 1.3.5
+signing_key: 
+specification_version: 2
+summary: Rejuicer.
+test_files: []
+