digital_trees_and_sets 0.4.0

data/test/all.rb

@@ -0,0 +1,9 @@
+# this performs all judy test
+
+libdir = File.expand_path(File.join(File.dirname(__FILE__), '..'))
+$LOAD_PATH.unshift(libdir) unless $LOAD_PATH.include?(libdir)
+libdir = File.expand_path(File.join(File.dirname(__FILE__), '../ext'))
+$LOAD_PATH.unshift(libdir) unless $LOAD_PATH.include?(libdir)
+
+require 'test/judy_set'
+require 'test/judy_hash'

data/test/judy_bench.rb

@@ -0,0 +1,64 @@
+require "rubygems"
+require 'digital_trees_and_sets'
+
+def bench
+  GC.disable
+  start = Time.now
+  yield
+  t = Time.now - start
+  GC.enable
+  t
+end
+# just to get a uniform interface with sets
+Hash.class_eval do
+  def add i
+    self[i] = i + 1
+  end
+  #we know this is just used to get the first, so i is always 0
+  def by_count i
+    first
+  end
+end
+JudyHash.class_eval do
+  def add i
+    self[i] = i + 1
+  end
+end
+def put_row row
+  puts "| " + row.collect{|o|o.to_s.center(12)}.join("|") + "|"
+end
+def test clazz  , dens
+  puts ""
+  puts "Testing #{clazz} with a key density of 1 per #{dens}"
+  puts ""
+  rows = [["2**", "Insert","Iterate","Get","Delete","mem/key","no.keys"]]
+  10.upto(20) do |power|
+    max = 2**power
+    judy = clazz.new
+    const = bench {1.upto(max) {|i| i } }
+    insert = bench {1.upto(max) {|i| judy.add( (i*dens).to_i ) } }
+    memory = judy.mem_used
+    iterate = bench {judy.each {|k,v| k } }
+    get = bench {1.upto(max) {|i| judy[  (i*dens).to_i ]  }}
+    delete = bench {1.upto(max) {|i| judy.delete( (i*dens).to_i) } }
+    result = [power] + [insert,iterate,get,delete].collect{|n| (1000000*(n-const)/max).round(3)} + [ (memory.to_f/max).round(3) , max]
+    rows << result
+  end
+# for the web it is better to transpose, but on the screen not
+  rows = rows.transpose
+  header = rows.delete_at(0)
+  put_row header
+  put_row ["-"*12]*header.length
+  rows.each do |row|
+    put_row row
+  end
+end
+
+puts "Times in microseconds per action , memory in bytes/insert"
+
+density = 1000
+test Hash     , density
+test JudyHash , density
+test JudySet  , density
+
+

data/test/judy_hash.rb

@@ -0,0 +1,129 @@
+require 'test/unit'
+require 'digital_trees_and_sets.so'
+
+class JudyHashLTest < Test::Unit::TestCase
+  def setup
+    @array = JudyHash.new
+  end
+
+  def fill(array)
+    0.upto(2**12 - 1) { |i| @array[i] = i }
+  end
+
+  def test_set
+    assert_equal(222, (@array[1] = 222))
+    assert_equal(333, (@array.set(:some_sym , 333)))
+    assert_equal(:sym, (@array.set(2 , :sym)))
+    assert_raise  ArgumentError do @array["string"] = "not allowed" end
+  end
+
+  def test_delete
+    @array[1] = 222
+    assert( ! @array.delete(0))
+    assert( @array.delete(1))
+  end
+
+  def test_get
+    assert_nil(@array[0])
+    assert_nil(@array.get(22))
+    @array[0] = 42
+    assert_equal(42, @array[0])
+    assert_equal(42, @array.get(0))
+  end
+
+  def test_count
+    assert_equal(0, @array.count)
+    fill(@array)
+    assert_equal(2**12, @array.count)
+  end
+
+  def test_by_count
+    @array[1] = 333
+    @array[3] = 444
+    @array[5] = 555
+    @array[7] = 666
+    assert_equal(333, @array.by_count(1))
+    assert_equal(444, @array.by_count(2))
+    assert_equal(555, @array.by_count(3))
+    assert_equal(666, @array.by_count(4))
+    assert_nil(@array.by_count(5))
+    assert_nil(@array.by_count(0))
+  end
+
+  def test_free_array
+    assert_equal(JudyHash, @array.clear.class)
+    0.upto(100) { |i| @array[i] = i }
+    GC.start
+    assert(@array.clear)
+    assert(@array.mem_used == 0)
+  end
+
+  def test_mem_used
+    assert_equal(0, @array.mem_used)
+    1.upto(2**12) { |i| @array[i] = i }
+    assert(0 < @array.mem_used)
+    @array.clear
+    assert_equal(0, @array.mem_used)
+  end
+
+  def test_indexes
+    assert_nil(@array.last_index)
+    assert_nil(@array.first_index)
+    @array[1] = 333
+    @array[3] = 444
+    assert_equal(1, @array.first_index)
+    assert_equal(3, @array.last_index)
+  end
+
+  def test_each_key
+    1.upto(100) { |i| @array[i] = i  }
+    sum = 0
+    @array.each_key { |v| sum += v }
+    assert_equal(5050, sum)
+  end
+
+  def test_each
+    1.upto(100) { |i| @array[i] = i }
+    keys = 0
+    vals = 0
+    @array.each { |key , val |
+      keys += key
+      vals += val
+      assert_equal(key, val)
+    }
+    assert_equal(5050, keys)
+    assert_equal(5050, vals)
+  end
+
+  def test_clear
+    0.upto(100) { |i| @array[i] = i }
+    assert_equal(101, @array.length)
+    @array.clear
+    assert_equal(0, @array.length)
+  end
+
+  def test_empty?
+    assert(@array.empty?)
+    @array[0] = 0
+    assert(!@array.empty?)
+  end
+
+  def test_length
+    0.upto(100) { |i| @array[i] = i }
+    assert_equal(101, @array.length)
+  end
+
+  def test_include?
+    1.upto(99) { |i| @array[i] = i }
+    assert(@array.include?(99))
+    assert(!@array.include?(0))
+    assert(!@array.include?(100))
+  end
+
+  def ttest_to_a
+    @array[55] = 55
+    ar = @array.to_a
+    assert_equal 1 , ar.length
+    assert_equal [[55 , 55 ]] , ar
+  end
+end

data/test/judy_set.rb

@@ -0,0 +1,91 @@
+require 'test/unit'
+require 'digital_trees_and_sets.so'
+
+class JudySetTest < Test::Unit::TestCase
+  def setup
+    @array = JudySet.new
+  end
+
+  def load
+    1.upto(100) { |i| @array.add(i)}
+    assert_equal(100, @array.length)
+  end
+  def test_test
+    assert_equal(true,  @array.add(0))
+    assert_equal(true,  @array.get(0))
+    assert_equal(true,  @array.unset(0))
+    assert_equal(false, @array.get(0))
+  end
+
+  def test_del_with_each
+    load
+    1.upto(100) { |i| @array.delete(i)}
+    assert_equal(0, @array.length)
+    @array.each do |i|
+      assert false
+    end
+  end
+
+  def test_length
+    load
+#    1.upto(100) { |i| @array.add(i)}
+    assert_equal(100, @array.length)
+  end
+
+  def test_by_count
+    load
+    assert_equal(2, @array.by_count(2))
+    assert_equal(42, @array.by_count(42))
+  end
+
+  def test_clear
+    load
+    assert_equal(100, @array.clear)
+    assert_equal(0, @array.length)
+  end
+
+  def test_mem_used
+    assert_equal(0, @array.mem_used)
+    0.upto(10) do |i|
+      @array.add(i)
+    end
+    assert(@array.mem_used > 0)
+  end
+
+  def test_indexes
+    load
+    assert_equal(1, @array.first_index)
+    assert_equal(44, @array.next_index(43))
+    assert_equal(66, @array.next_index(65))
+    assert_equal false , @array.next_index(400)
+    assert_equal(100, @array.last_index)
+  end
+
+  def test_each_index
+    load
+    sum = 0
+    @array.each_index do |i|
+      sum = sum + i
+      assert @array.get(i)
+    end
+    assert_equal(5050, sum)
+  end
+
+  def test_each
+    load
+    sum = 0
+    @array.each do |i|
+      assert @array.get(i)
+      sum = sum + i
+    end
+    assert_equal(5050, sum)
+  end
+
+  def test_to_a
+    assert_equal([], @array.to_a)
+    test_each
+    assert  @array.get(55)
+    assert_equal(1.upto(100).to_a, @array.to_a)
+  end
+
+end

metadata

@@ -0,0 +1,59 @@
+--- !ruby/object:Gem::Specification
+name: digital_trees_and_sets
+version: !ruby/object:Gem::Version
+  version: 0.4.0
+  prerelease: 
+platform: ruby
+authors:
+- Tosten Ruger
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-12-19 00:00:00.000000000 Z
+dependencies: []
+description: Fast and simple. A tree is an int to object , a set an int to bit mapping.
+  Highly scalable, very fast and incredibly small footprint
+email: torsten@villataika.fi
+executables: []
+extensions:
+- ext/extconf.rb
+extra_rdoc_files: []
+files:
+- README.md
+- ext/extconf.rb
+- ext/judy.h
+- ext/judy1.c
+- ext/judy_compat.h
+- ext/judy_hash.c
+- ext/judy_set.c
+- ext/judyl.c
+- test/all.rb
+- test/judy_bench.rb
+- test/judy_hash.rb
+- test/judy_set.rb
+homepage: https://github.com/dancinglightning/digital_trees_and_sets/
+licenses: []
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+- ext/
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: 1.9.3
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '1.6'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.24
+signing_key: 
+specification_version: 3
+summary: Digital trees and sets for ruby
+test_files: []