algorithms 0.2.0 → 1.0.0

data/spec/stack_spec.rb

@@ -7,20 +7,20 @@ describe "empty stack" do
   end
 
   it "should return nil when sent #pop" do
-    @stack.pop.should be_nil
+    expect(@stack.pop).to be_nil
   end
 
   it "should return a size of 1 when sent #push" do
     @stack.push(1)
-    @stack.size.should eql(1)
+    expect(@stack.size).to eql(1)
   end
 
   it "should return nil when sent #next" do
-    @stack.next.should be_nil
+    expect(@stack.next).to be_nil
   end
 
   it "should return empty?" do
-    @stack.empty?.should be_true
+    expect(@stack.empty?).to be true
   end
 end
 
@@ -32,29 +32,29 @@ describe "non-empty stack" do
   end
 
   it "should return last pushed object" do
-    @stack.pop.should eql("10")
+    expect(@stack.pop).to eql("10")
   end
 
   it "should return the size" do
-    @stack.size.should eql(2)
+    expect(@stack.size).to eql(2)
   end
 
   it "should not return empty?" do
-    @stack.empty?.should be_false
+    expect(@stack.empty?).to be false
   end
 
 
   it "should iterate in LIFO order" do
     arr = []
     @stack.each { |obj| arr << obj }
-    arr.should eql(["10", 10])
+    expect(arr).to 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
+    expect(@stack.pop).to be_nil
+    expect(@stack.next).to 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    
+      expect(Algorithms::String.levenshtein_dist("Hello", "Hel")).to eql(2)
+      expect(Algorithms::String.levenshtein_dist("Hello", "")).to eql(5)
+      expect(Algorithms::String.levenshtein_dist("", "Hello")).to eql(5)
+      expect(Algorithms::String.levenshtein_dist("Hello", "Hello")).to eql(0)
+      expect(Algorithms::String.levenshtein_dist("Hello", "ello")).to eql(1)
+      expect(Algorithms::String.levenshtein_dist("Hello", "Mello")).to eql(1)
+    end
+  end
+end

data/spec/suffix_array_spec.rb

@@ -3,7 +3,7 @@ require 'algorithms'
 
 describe "empty suffix array" do
   it "should not initialize with empty string" do
-    lambda { Containers::SuffixArray.new("") }.should raise_error
+    expect { Containers::SuffixArray.new("") }.to raise_error(ArgumentError)
   end
 end
 
@@ -13,28 +13,28 @@ describe "non-empty suffix array" do
   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
+    expect(@s_array.has_substring?("a")).to be true
+    expect(@s_array.has_substring?("abra")).to be true
+    expect(@s_array.has_substring?("abracadabra")).to be true
+    expect(@s_array.has_substring?("acadabra")).to be true
+    expect(@s_array.has_substring?("adabra")).to be true
+    expect(@s_array.has_substring?("bra")).to be true
+    expect(@s_array.has_substring?("bracadabra")).to be true
+    expect(@s_array.has_substring?("cadabra")).to be true
+    expect(@s_array.has_substring?("dabra")).to be true
+    expect(@s_array.has_substring?("ra")).to be true
+    expect(@s_array.has_substring?("racadabra")).to 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
+    expect(@s_array.has_substring?("nope")).to be false
+    expect(@s_array.has_substring?(nil)).to 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
+    expect(number[1]).to be true
+    expect(number.has_substring?(12)).to be true
+    expect(number.has_substring?(13)).to be false
   end
 end

data/spec/trie_spec.rb

@@ -7,13 +7,13 @@ describe "empty trie" do
   end
 
   it "should not get or has_key?" do
-    @trie.get("anything").should be_nil
-    @trie.has_key?("anything").should be_false
+    expect(@trie.get("anything")).to be_nil
+    expect(@trie.has_key?("anything")).to 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("")
+    expect(@trie.wildcard("an*thing")).to eql([])
+    expect(@trie.longest_prefix("an*thing")).to eql("")
   end
 end
 
@@ -27,33 +27,33 @@ describe "non-empty trie" do
   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
+    expect(@trie.has_key?("Hello")).to be true
+    expect(@trie.has_key?("Hello, brother")).to be true
+    expect(@trie.has_key?("Hello, bob")).to be true
   end
 
   it "should not has_key? keys it doesn't have" do
-    @trie.has_key?("Nope").should be_false
+    expect(@trie.has_key?("Nope")).to be false
   end
 
   it "should get values" do
-    @trie.get("Hello").should eql("World")
+    expect(@trie.get("Hello")).to eql("World")
   end
 
   it "should overwrite values" do
     @trie.push("Hello", "John")
-    @trie.get("Hello").should eql("John")
+    expect(@trie.get("Hello")).to 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")
+    expect(@trie.longest_prefix("Hello, brandon")).to eql("Hello")
+    expect(@trie.longest_prefix("Hel")).to eql("")
+    expect(@trie.longest_prefix("Hello")).to eql("Hello")
+    expect(@trie.longest_prefix("Hello, bob")).to eql("Hello, bob")
   end
 
   it "should match wildcards" do
-    @trie.wildcard("H*ll.").should eql(["Hello", "Hilly"])
-    @trie.wildcard("Hel").should eql([])
+    expect(@trie.wildcard("H*ll.")).to eql(["Hello", "Hilly"])
+    expect(@trie.wildcard("Hel")).to eql([])
   end
 end

metadata

@@ -1,62 +1,50 @@
---- !ruby/object:Gem::Specification 
+--- !ruby/object:Gem::Specification
 name: algorithms
-version: !ruby/object:Gem::Version 
-  version: 0.2.0
+version: !ruby/object:Gem::Version
+  version: 1.0.0
 platform: ruby
-authors: 
+authors:
 - Kanwei Li
 autorequire: 
 bindir: bin
 cert_chain: []
-
-date: 2009-03-29 00:00:00 -04:00
-default_executable: 
+date: 2021-04-04 00:00:00.000000000 Z
 dependencies: []
-
-description: A library of algorithms and containers.
+description: Heap, Priority Queue, Deque, Stack, Queue, Red-Black Trees, Splay Trees,
+  sorting algorithms, and more
 email: kanwei@gmail.com
 executables: []
-
-extensions: 
+extensions:
+- ext/algorithms/string/extconf.rb
+- ext/containers/bst/extconf.rb
 - 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
+extra_rdoc_files: []
+files:
+- CHANGELOG.markdown
+- Gemfile
+- Manifest
 - README.markdown
-files: 
+- 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
-- History.txt
+- lib/algorithms.rb
 - lib/algorithms/search.rb
 - lib/algorithms/sort.rb
-- lib/algorithms.rb
+- lib/algorithms/string.rb
 - lib/containers/deque.rb
 - lib/containers/heap.rb
 - lib/containers/kd_tree.rb
@@ -67,54 +55,53 @@ files:
 - lib/containers/stack.rb
 - lib/containers/suffix_array.rb
 - lib/containers/trie.rb
-- Manifest
-- Rakefile
-- README.markdown
+- 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_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/string_spec.rb
 - spec/suffix_array_spec.rb
 - spec/trie_spec.rb
-has_rdoc: true
-homepage: http://rubyforge.org/projects/algorithms/
+homepage: https://github.com/kanwei/algorithms
+licenses:
+- MIT
+metadata: {}
 post_install_message: 
-rdoc_options: 
-- --line-numbers
-- --inline-source
-- --title
+rdoc_options:
+- "--line-numbers"
+- "--inline-source"
+- "--title"
 - Algorithms
-- --main
+- "--main"
 - README.markdown
-require_paths: 
+require_paths:
 - lib
 - ext
-required_ruby_version: !ruby/object:Gem::Requirement 
-  requirements: 
+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: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
   - - ">="
-    - !ruby/object:Gem::Version 
-      version: "1.2"
-  version: 
+    - !ruby/object:Gem::Version
+      version: '0'
 requirements: []
-
-rubyforge_project: algorithms
-rubygems_version: 1.3.1
+rubygems_version: 3.1.2
 signing_key: 
-specification_version: 2
-summary: A library of algorithms and containers.
+specification_version: 4
+summary: Useful algorithms and data structures for Ruby. Optional C extensions.
 test_files: []
-