algorithms 0.6.1-java

data/spec/stack_spec.rb

@@ -0,0 +1,60 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
+
+describe "empty stack" do
+  before(:each) do
+    @stack = Containers::Stack.new
+  end
+
+  it "should return nil when sent #pop" do
+    @stack.pop.should be_nil
+  end
+
+  it "should return a size of 1 when sent #push" do
+    @stack.push(1)
+    @stack.size.should eql(1)
+  end
+
+  it "should return nil when sent #next" do
+    @stack.next.should be_nil
+  end
+
+  it "should return empty?" do
+    @stack.empty?.should be_true
+  end
+end
+
+describe "non-empty stack" do
+  before(:each) do
+    @stack = Containers::Stack.new
+    @stack.push(10)
+    @stack.push("10")
+  end
+
+  it "should return last pushed object" do
+    @stack.pop.should eql("10")
+  end
+
+  it "should return the size" do
+    @stack.size.should eql(2)
+  end
+
+  it "should not return empty?" do
+    @stack.empty?.should be_false
+  end
+
+
+  it "should iterate in LIFO order" do
+    arr = []
+    @stack.each { |obj| arr << obj }
+    arr.should eql(["10", 10])
+  end
+
+  it "should return nil after all pops" do
+    @stack.pop
+    @stack.pop
+    @stack.pop.should be_nil
+    @stack.next.should be_nil
+  end
+
+end

data/spec/string_spec.rb

@@ -0,0 +1,15 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
+
+if defined? Algorithms::String
+  describe "string algorithms" do
+    it "should do levenshtein distance" do    
+      Algorithms::String.levenshtein_dist("Hello", "Hel").should eql(2)
+      Algorithms::String.levenshtein_dist("Hello", "").should eql(5)
+      Algorithms::String.levenshtein_dist("", "Hello").should eql(5)
+      Algorithms::String.levenshtein_dist("Hello", "Hello").should eql(0)
+      Algorithms::String.levenshtein_dist("Hello", "ello").should eql(1)
+      Algorithms::String.levenshtein_dist("Hello", "Mello").should eql(1)
+    end
+  end
+end

data/spec/suffix_array_spec.rb

@@ -0,0 +1,40 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
+
+describe "empty suffix array" do
+  it "should not initialize with empty string" do
+    lambda { Containers::SuffixArray.new("") }.should raise_error
+  end
+end
+
+describe "non-empty suffix array" do
+  before(:each) do
+    @s_array = Containers::SuffixArray.new("abracadabra")
+  end
+
+  it "should has_substring? each possible substring" do
+    @s_array.has_substring?("a").should be_true
+    @s_array.has_substring?("abra").should be_true
+    @s_array.has_substring?("abracadabra").should be_true
+    @s_array.has_substring?("acadabra").should be_true
+    @s_array.has_substring?("adabra").should be_true
+    @s_array.has_substring?("bra").should be_true
+    @s_array.has_substring?("bracadabra").should be_true
+    @s_array.has_substring?("cadabra").should be_true
+    @s_array.has_substring?("dabra").should be_true
+    @s_array.has_substring?("ra").should be_true
+    @s_array.has_substring?("racadabra").should be_true
+  end
+
+  it "should not has_substring? substrings it does not have" do
+    @s_array.has_substring?("nope").should be_false
+    @s_array.has_substring?(nil).should be_false
+  end
+
+  it "should work with numbers (calls to_s)" do
+    number = Containers::SuffixArray.new(123456789)
+    number[1].should be_true
+    number.has_substring?(12).should be_true
+    number.has_substring?(13).should be_false
+  end
+end

data/spec/trie_spec.rb

@@ -0,0 +1,59 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
+
+describe "empty trie" do
+  before(:each) do
+    @trie = Containers::Trie.new
+  end
+
+  it "should not get or has_key?" do
+    @trie.get("anything").should be_nil
+    @trie.has_key?("anything").should be_false
+  end
+
+  it "should not have longest_prefix or match wildcards" do
+    @trie.wildcard("an*thing").should eql([])
+    @trie.longest_prefix("an*thing").should eql("")
+  end
+end
+
+describe "non-empty trie" do
+  before(:each) do
+    @trie = Containers::Trie.new
+    @trie.push("Hello", "World")
+    @trie.push("Hilly", "World")
+    @trie.push("Hello, brother", "World")
+    @trie.push("Hello, bob", "World")
+  end
+
+  it "should has_key? keys it has" do
+    @trie.has_key?("Hello").should be_true
+    @trie.has_key?("Hello, brother").should be_true
+    @trie.has_key?("Hello, bob").should be_true
+  end
+
+  it "should not has_key? keys it doesn't have" do
+    @trie.has_key?("Nope").should be_false
+  end
+
+  it "should get values" do
+    @trie.get("Hello").should eql("World")
+  end
+
+  it "should overwrite values" do
+    @trie.push("Hello", "John")
+    @trie.get("Hello").should eql("John")
+  end
+
+  it "should return longest prefix" do
+    @trie.longest_prefix("Hello, brandon").should eql("Hello")
+    @trie.longest_prefix("Hel").should eql("")
+    @trie.longest_prefix("Hello").should eql("Hello")
+    @trie.longest_prefix("Hello, bob").should eql("Hello, bob")
+  end
+
+  it "should match wildcards" do
+    @trie.wildcard("H*ll.").should eql(["Hello", "Hilly"])
+    @trie.wildcard("Hel").should eql([])
+  end
+end

metadata

@@ -0,0 +1,106 @@
+--- !ruby/object:Gem::Specification
+name: algorithms
+version: !ruby/object:Gem::Version
+  prerelease:
+  version: 0.6.1
+platform: java
+authors:
+- Kanwei Li
+autorequire:
+bindir: bin
+cert_chain: []
+date: 2013-01-22 00:00:00.000000000 Z
+dependencies: []
+description: Heap, Priority Queue, Deque, Stack, Queue, Red-Black Trees, Splay Trees, sorting algorithms, and more
+email: kanwei@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- Gemfile
+- CHANGELOG.markdown
+- Manifest
+- README.markdown
+- Rakefile
+- algorithms.gemspec
+- benchmarks/deque.rb
+- benchmarks/sorts.rb
+- benchmarks/treemaps.rb
+- ext/algorithms/string/extconf.rb
+- ext/algorithms/string/string.c
+- ext/containers/bst/bst.c
+- ext/containers/bst/extconf.rb
+- ext/containers/deque/deque.c
+- ext/containers/deque/extconf.rb
+- ext/containers/rbtree_map/extconf.rb
+- ext/containers/rbtree_map/rbtree.c
+- ext/containers/splaytree_map/extconf.rb
+- ext/containers/splaytree_map/splaytree.c
+- lib/algorithms.rb
+- lib/algorithms/search.rb
+- lib/algorithms/sort.rb
+- lib/algorithms/string.rb
+- lib/containers/deque.rb
+- lib/containers/heap.rb
+- lib/containers/kd_tree.rb
+- lib/containers/priority_queue.rb
+- lib/containers/queue.rb
+- lib/containers/rb_tree_map.rb
+- lib/containers/splay_tree_map.rb
+- lib/containers/stack.rb
+- lib/containers/suffix_array.rb
+- lib/containers/trie.rb
+- spec/bst_gc_mark_spec.rb
+- spec/bst_spec.rb
+- spec/deque_gc_mark_spec.rb
+- spec/deque_spec.rb
+- spec/heap_spec.rb
+- spec/kd_expected_out.txt
+- spec/kd_test_in.txt
+- spec/kd_tree_spec.rb
+- spec/map_gc_mark_spec.rb
+- spec/priority_queue_spec.rb
+- spec/queue_spec.rb
+- spec/rb_tree_map_spec.rb
+- spec/search_spec.rb
+- spec/sort_spec.rb
+- spec/splay_tree_map_spec.rb
+- spec/stack_spec.rb
+- spec/string_spec.rb
+- spec/suffix_array_spec.rb
+- spec/trie_spec.rb
+homepage: https://github.com/kanwei/algorithms
+licenses:
+- MIT
+post_install_message:
+rdoc_options:
+- "--line-numbers"
+- "--inline-source"
+- "--title"
+- Algorithms
+- "--main"
+- README.markdown
+require_paths:
+- lib
+- ext
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: !binary |-
+        MA==
+  none: false
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: !binary |-
+        MA==
+  none: false
+requirements: []
+rubyforge_project: algorithms
+rubygems_version: 1.8.24
+signing_key:
+specification_version: 3
+summary: Useful algorithms and data structures for Ruby. Optional C extensions.
+test_files: []