stakach-algorithms 1.0.6 → 1.0.7

data/spec/stack_spec.rb

@@ -0,0 +1,59 @@
+require 'helper'
+
+describe "empty stack" do
+  before(:each) do
+    @stack = Algorithms::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 = Algorithms::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,12 @@
+require 'helper'
+
+describe "string algorithms" do
+  it "should do levenshtein distance" do    
+    Algorithms::Algorithms::String.levenshtein_dist("Hello", "Hel").should eql(2)
+    Algorithms::Algorithms::String.levenshtein_dist("Hello", "").should eql(5)
+    Algorithms::Algorithms::String.levenshtein_dist("", "Hello").should eql(5)
+    Algorithms::Algorithms::String.levenshtein_dist("Hello", "Hello").should eql(0)
+    Algorithms::Algorithms::String.levenshtein_dist("Hello", "ello").should eql(1)
+    Algorithms::Algorithms::String.levenshtein_dist("Hello", "Mello").should eql(1)
+  end
+end

data/spec/suffix_array_spec.rb

@@ -0,0 +1,39 @@
+require 'helper'
+
+describe "empty suffix array" do
+  it "should not initialize with empty string" do
+    lambda { Algorithms::Containers::SuffixArray.new("") }.should raise_error
+  end
+end
+
+describe "non-empty suffix array" do
+  before(:each) do
+    @s_array = Algorithms::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 = Algorithms::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,58 @@
+require 'helper'
+
+describe "empty trie" do
+  before(:each) do
+    @trie = Algorithms::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 = Algorithms::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

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: stakach-algorithms
 version: !ruby/object:Gem::Version
-  version: 1.0.6
+  version: 1.0.7
   prerelease: 
 platform: ruby
 authors:
@@ -10,8 +10,24 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-07-27 00:00:00.000000000 Z
-dependencies: []
+date: 2012-11-12 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 description: A library of algorithms and containers.
 email:
 - kanwei@gmail.com
@@ -76,6 +92,26 @@ files:
 - ext/containers/rbtree_map/rbtree.c
 - ext/containers/splaytree_map/extconf.rb
 - ext/containers/splaytree_map/splaytree.c
+- 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/helper.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/stakach/algorithms
 licenses: []
 post_install_message: 
@@ -107,4 +143,24 @@ rubygems_version: 1.8.24
 signing_key: 
 specification_version: 3
 summary: A library of algorithms and containers.
-test_files: []
+test_files:
+- 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/helper.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