kanwei-algorithms 0.2.0

data/spec/search_spec.rb

@@ -0,0 +1,28 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
+
+class String; include Algorithms::Search; end
+
+describe "search algorithms" do
+  it "should binary search sorted arrays" do
+    n = 1000
+    @rand_array = Array.new(n) { rand(n) }.sort
+    
+    Algorithms::Search.binary_search(@rand_array, @rand_array.first).should eql(@rand_array.first)
+    Algorithms::Search.binary_search(@rand_array, 999999).should be_nil
+    Algorithms::Search.binary_search(@rand_array, nil).should be_nil
+  end
+  
+  it "should use kmp_search to find substrings it has" do
+    string = "ABC ABCDAB ABCDABCDABDE"
+    Algorithms::Search.kmp_search(string, "ABCDABD").should eql(15)
+    Algorithms::Search.kmp_search(string, "ABCDEF").should be_nil
+    Algorithms::Search.kmp_search(string, nil).should be_nil
+    Algorithms::Search.kmp_search(string, "").should be_nil
+    Algorithms::Search.kmp_search(nil, "ABCD").should be_nil
+  end
+  
+  it "should let you include Search in String to enable instance methods" do
+    "ABC ABCDAB ABCDABCDABDE".kmp_search("ABCDABD").should eql(15)
+  end
+end

data/spec/sort_spec.rb

@@ -0,0 +1,28 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
+include Algorithms
+
+describe "sort algorithms" do
+  before(:each) do
+    @sorts = %w(bubble_sort comb_sort selection_sort heapsort insertion_sort shell_sort quicksort mergesort)
+  end
+
+  it "should work for empty containers" do
+    empty_array = []
+    @sorts.each { |sort| Sort.send(sort, empty_array).should eql([]) }
+  end
+
+  it "should work for a container of size 1" do
+    one_array = [1]
+    @sorts.each { |sort| Sort.send(sort, one_array).should eql(one_array) }
+  end
+
+  it "should work for random arrays of numbers" do
+    n = 500
+    rand_array = Array.new(n) { rand(n) }
+    sorted_array = rand_array.sort
+
+    @sorts.each { |sort| Sort.send(sort, rand_array.dup).should eql(sorted_array) }
+  end    
+
+end

data/spec/splay_tree_map_spec.rb

@@ -0,0 +1,102 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
+  
+describe "empty splaytree", :shared => true do
+  it "should let you push stuff in" do
+    100.times { |x| @tree[x] = x }
+    @tree.size.should eql(100)
+  end
+  
+  it "should return 0 for size" do
+    @tree.size.should eql(0)
+  end
+  
+  it "should return nil for #min and #max" do
+    @tree.min.should be_nil
+    @tree.max.should be_nil
+  end
+  
+  it "should return nil for #delete" do
+    @tree.delete(:non_existing).should be_nil
+  end
+end
+
+describe "non-empty splaytree", :shared => true do
+  before(:each) do
+    @num_items = 100
+    @random_array = []
+    @num_items.times { @random_array << rand(@num_items) }
+    @random_array.each { |x| @tree[x] = x }
+  end
+  
+  it "should return correct size (uniqify items first)" do
+    @tree.size.should eql(@random_array.uniq.size)
+  end
+  
+  it "should have correct height (worst case is when items are inserted in order, and height = num items inserted)" do
+    @tree.clear
+    10.times { |x| @tree[x] = x }
+    @tree.height.should eql(10)
+  end
+  
+  it "should return correct max and min keys" do
+    @tree.min[0].should eql(@random_array.min)
+    @tree.max[0].should eql(@random_array.max)
+  end
+  
+  it "should not #has_key? keys it doesn't have" do
+    @tree.has_key?(10000).should be_false
+  end
+  
+  it "should #has_key? keys it does have" do
+    @tree.has_key?(@random_array[0]).should be_true
+  end
+  
+  it "should remove any key" do
+    random_key = @random_array[rand(@num_items)]
+    @tree.has_key?(random_key).should be_true
+    @tree.delete(random_key).should eql(random_key)
+    @tree.has_key?(random_key).should be_false
+  end
+  
+  it "should let you iterate with #each" do
+    counter = 0
+    sorted_array = @random_array.uniq.sort
+    @tree.each do |key, val|
+      key.should eql(sorted_array[counter])
+      counter += 1
+    end
+  end
+end
+
+describe "empty splaytreemap" do
+  before(:each) do
+    @tree = Containers::RubySplayTreeMap.new
+  end
+  it_should_behave_like "empty splaytree"
+end
+
+describe "full splaytreemap" do
+  before(:each) do
+    @tree = Containers::RubySplayTreeMap.new
+  end
+  it_should_behave_like "non-empty splaytree"
+end
+
+begin
+  Containers::CSplayTreeMap
+  describe "empty csplaytreemap" do
+    before(:each) do
+      @tree = Containers::CSplayTreeMap.new
+    end
+    it_should_behave_like "empty splaytree"
+  end
+
+  describe "full csplaytreemap" do
+    before(:each) do
+      @tree = Containers::CSplayTreeMap.new
+    end
+    it_should_behave_like "non-empty splaytree"
+  end
+rescue Exception
+end

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/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,120 @@
+--- !ruby/object:Gem::Specification 
+name: kanwei-algorithms
+version: !ruby/object:Gem::Version 
+  version: 0.2.0
+platform: ruby
+authors: 
+- Kanwei Li
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2009-03-29 00:00:00 -07:00
+default_executable: 
+dependencies: []
+
+description: A library of algorithms and containers.
+email: kanwei@gmail.com
+executables: []
+
+extensions: 
+- ext/containers/deque/extconf.rb
+- ext/containers/rbtree_map/extconf.rb
+- ext/containers/splaytree_map/extconf.rb
+extra_rdoc_files: 
+- 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/search.rb
+- lib/algorithms/sort.rb
+- lib/algorithms.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
+- README.markdown
+files: 
+- algorithms.gemspec
+- benchmarks/deque.rb
+- benchmarks/sorts.rb
+- benchmarks/treemaps.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
+- History.txt
+- lib/algorithms/search.rb
+- lib/algorithms/sort.rb
+- lib/algorithms.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
+- Manifest
+- Rakefile
+- README.markdown
+- spec/deque_gc_mark_spec.rb
+- spec/deque_spec.rb
+- spec/heap_spec.rb
+- spec/kd_tree_spec.rb
+- spec/priority_queue_spec.rb
+- spec/queue_spec.rb
+- spec/rb_tree_map_gc_mark_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/suffix_array_spec.rb
+- spec/trie_spec.rb
+has_rdoc: true
+homepage: http://rubyforge.org/projects/algorithms/
+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: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "1.2"
+  version: 
+requirements: []
+
+rubyforge_project: algorithms
+rubygems_version: 1.2.0
+signing_key: 
+specification_version: 2
+summary: A library of algorithms and containers.
+test_files: []
+