rbtree-jruby 0.1.0 → 0.2.0

data/Gemfile.lock

@@ -14,7 +14,7 @@ GEM
     json (1.7.5)
     json (1.7.5-java)
     multi_json (1.3.6)
-    rake (0.9.2.2)
+    rake (10.0.2)
     rcov (0.9.11)
     rcov (0.9.11-java)
     rdoc (3.12)

data/README.md

@@ -55,6 +55,17 @@ duplications of keys but MultiRBTree does.
   end                        # => ["a", 20] ["a", 40] ["c", 10]
 ```
 
+Benchmarks
+-----------
+
+Benchmark takes from headius' [redblack](https://github.com/headius/redblack) project.
+Compared to [rbtree-pure](https://github.com/pwnall/rbtree-pure) and
+[rbtree c extension](https://github.com/skade/rbtree).
+![benchmark result](https://raw.github.com/isaiah/rbtree-jruby/master/benchmark/result.png)
+
+It's interesting to see jruby with invokedynamic almost gets C extension speed, and
+jruby native extension is even faster than it's counterpart.
+For more details, checkout [benchmark directory](https://github.com/isaiah/rbtree-jruby/tree/master/benchmark).
 
 Requirement
 -----------

data/VERSION

@@ -1 +1 @@
-0.1.0
+0.2.0

data/benchmark/bm.rb

@@ -0,0 +1,26 @@
+#$:.unshift(File.join(File.dirname(__FILE__), "..", "lib"))
+require 'rbtree'
+require "benchmark"
+
+def rbt_bm
+  n = 1_000
+  a1 = []; n.times { a1 << rand(999_999) }
+  a2 = []; n.times { a2 << rand(999_999) }
+
+  start = Time.now
+  tree = RBTree.new
+  a1.each {|e| tree[e] = e }
+  a2.each {|e| tree[e] }
+  n.times do
+    tree.delete_if{|k, v| v == rand(999_999)}
+  end
+
+  return Time.now - start
+end
+
+N = (ARGV[0] || 5).to_i
+
+N.times do
+  puts rbt_bm.to_f
+  puts "GC.count = #{GC.count}" if GC.respond_to?(:count)
+end

data/benchmark/bm1.rb

@@ -0,0 +1,30 @@
+#$:.unshift(File.join(File.dirname(__FILE__), "..", "lib"))
+require 'rbtree'
+require "benchmark"
+
+def rbt_bm
+  n = 100_000
+  a1 = []; n.times { a1 << rand(999_999) }
+  a2 = []; n.times { a2 << rand(999_999) }
+
+  start = Time.now
+
+  tree = RBTree.new
+
+  n.times {|i| tree[i] = i }
+  n.times {|i| tree.delete(i) }
+
+  tree = RBTree.new
+  a1.each {|e| tree[e] = e }
+  a2.each {|e| tree[e] }
+  tree.each {|key, value| value + 1 }
+  tree.reverse_each {|key, value| value + 1 }
+  return Time.now - start
+end
+
+N = (ARGV[0] || 5).to_i
+
+N.times do
+  puts rbt_bm.to_f
+  #puts "GC.count = #{GC.count}" if GC.respond_to?(:count)
+end

data/benchmark/result.txt

@@ -0,0 +1,114 @@
+$ ruby -v && ruby bm1.rb 20
+ruby 1.9.3p327 (2012-11-10 revision 37606) [x86_64-linux]
+4.194673558
+4.134828053
+4.206916244
+4.1981704
+4.239772576
+4.126600891
+4.197231759
+4.182520993
+4.264266545
+4.175277231
+4.281924272
+4.180804353
+4.288204194
+4.219386288
+4.288127756
+4.174234309
+4.289359396
+4.186658554
+4.281877193
+4.17202375
+
+$ ruby -v && ruby --server bm1.rb 20
+jruby 1.7.0 (1.9.3p203) 2012-10-22 ff1ebbe on Java HotSpot(TM) 64-Bit Server VM 1.7.0_09-b05 [linux-amd64]
+3.936
+1.743
+1.854
+1.697
+1.678
+1.759
+1.772
+1.719
+1.697
+1.681
+1.646
+1.755
+1.72
+1.669
+1.719
+1.647
+1.771
+1.714
+1.658
+1.706
+
+$ ruby -v && ruby -Xcompile.invokedynamic=true bm1.rb 20
+jruby 1.7.0 (1.9.3p203) 2012-10-22 ff1ebbe on Java HotSpot(TM) 64-Bit Server VM 1.7.0_09-b05 [linux-amd64]
+4.489
+2.282
+1.76
+0.984
+0.928
+1.123
+0.988
+0.998
+0.915
+0.973
+0.981
+0.955
+0.95
+0.946
+0.979
+0.964
+0.955
+1.151
+1.142
+1.092
+
+$ ruby -v && ruby bm1.rb 20
+ruby 1.9.3p327 (2012-11-10 revision 37606) [x86_64-linux]
+0.719245967
+0.764002064
+0.721334569
+0.724404531
+0.759026423
+0.762418384
+0.862859985
+0.7481005
+0.733698733
+0.768279468
+0.740369856
+0.735618093
+0.752477701
+0.845850977
+0.742914898
+0.762281986
+0.816316566
+0.739624534
+0.79819584
+0.749143339
+
+$ ruby -v && ruby --server bm1.rb 20
+jruby 1.7.0 (1.9.3p203) 2012-10-22 ff1ebbe on Java HotSpot(TM) 64-Bit Server VM 1.7.0_09-b05 [linux-amd64]
+1.044
+0.37
+0.406
+0.349
+0.293
+0.332
+0.305
+0.424
+0.332
+0.314
+0.332
+0.335
+0.334
+0.347
+0.335
+0.304
+0.333
+0.302
+0.335
+0.315