stakach-algorithms 1.0.7 → 1.0.8

data/lib/algorithms/version.rb

@@ -1,3 +1,3 @@
 module Algorithms
-	VERSION = "1.0.7"
+	VERSION = "1.0.8"
 end

data/lib/containers/heap.rb

@@ -9,7 +9,9 @@
     
     This library implements a Fibonacci heap, which allows O(1) complexity for most methods.
 =end
-class Containers::Heap
+module Algorithms
+  module Containers
+class Heap
   include Enumerable
   
   # call-seq:
@@ -418,7 +420,7 @@ class Containers::Heap
 end
 
 # A MaxHeap is a heap where the items are returned in descending order of key value.
-class Containers::MaxHeap < Containers::Heap
+class MaxHeap < Heap
   
   # call-seq:
   #     MaxHeap.new(ary) -> new_heap
@@ -460,7 +462,7 @@ class Containers::MaxHeap < Containers::Heap
 end
 
 # A MinHeap is a heap where the items are returned in ascending order of key value.
-class Containers::MinHeap < Containers::Heap
+class MinHeap < Heap
   
   # call-seq:
   #     MinHeap.new(ary) -> new_heap
@@ -499,4 +501,6 @@ class Containers::MinHeap < Containers::Heap
   def min!
     self.pop
   end
+end
+end
 end

data/spec/deque_spec.rb

@@ -1,6 +1,6 @@
 require 'helper'
 
-shared_examples "(empty deque)" do
+shared_examples_for "(empty deque)" do
   it "should return nil when popping objects" do
     @deque.pop_front.should be_nil
     @deque.pop_back.should be_nil
@@ -30,7 +30,7 @@ shared_examples "(empty deque)" do
   end
 end
 
-shared_examples "(non-empty deque)" do
+shared_examples_for "(non-empty deque)" do
   before(:each) do
     @deque.push_back(10)
     @deque.push_back("10")
@@ -76,30 +76,30 @@ end
 
 describe "empty rubydeque" do
   before(:each) do
-    @deque = Containers::RubyDeque.new
+    @deque = Algorithms::Containers::RubyDeque.new
   end
   it_should_behave_like "(empty deque)"
 end
 
 describe "full rubydeque" do
   before(:each) do
-    @deque = Containers::RubyDeque.new
+    @deque = Algorithms::Containers::RubyDeque.new
   end
   it_should_behave_like "(non-empty deque)"
 end
 
 begin
-  Containers::CDeque
+  Algorithms::Containers::CDeque
   describe "empty cdeque" do
     before(:each) do
-      @deque = Containers::CDeque.new
+      @deque = Algorithms::Containers::CDeque.new
     end
     it_should_behave_like "(empty deque)"
   end
 
   describe "full cdeque" do
     before(:each) do
-      @deque = Containers::CDeque.new
+      @deque = Algorithms::Containers::CDeque.new
     end
     it_should_behave_like "(non-empty deque)"
   end

data/spec/rb_tree_map_spec.rb

@@ -1,6 +1,6 @@
 require 'helper'
 
-shared_examples "empty rbtree" do
+shared_examples_for "empty rbtree" do
   it "should let you push stuff in" do
     100.times { |x| @tree[x] = x }
     @tree.size.should eql(100)
@@ -30,7 +30,7 @@ shared_examples "empty rbtree" do
   end
 end
 
-shared_examples "non-empty rbtree" do
+shared_examples_for "non-empty rbtree" do
   before(:each) do
     @num_items = 1000
     @random_array = Array.new(@num_items) { rand(@num_items) }
@@ -91,30 +91,29 @@ end
 
 describe "empty rbtreemap" do
   before(:each) do
-    @tree = Containers::RubyRBTreeMap.new
+    @tree = Algorithms::Containers::RubyRBTreeMap.new
   end
   it_should_behave_like "empty rbtree"
 end
 
 describe "full rbtreemap" do
   before(:each) do
-    @tree = Containers::RubyRBTreeMap.new
+    @tree = Algorithms::Containers::RubyRBTreeMap.new
   end
   it_should_behave_like "non-empty rbtree"
 end
 
 begin
-  Containers::CRBTreeMap
   describe "empty crbtreemap" do
     before(:each) do
-      @tree = Containers::CRBTreeMap.new
+      @tree = Algorithms::Containers::CRBTreeMap.new
     end
     it_should_behave_like "empty rbtree"
   end
 
   describe "full crbtreemap" do
     before(:each) do
-      @tree = Containers::CRBTreeMap.new
+      @tree = Algorithms::Containers::CRBTreeMap.new
     end
     it_should_behave_like "non-empty rbtree"
   end

data/spec/splay_tree_map_spec.rb

@@ -1,6 +1,6 @@
 require 'helper'
-  
-shared_examples "empty splaytree" do
+
+shared_examples_for "empty splaytree" do
   it "should let you push stuff in" do
     100.times { |x| @tree[x] = x }
     @tree.size.should eql(100)
@@ -24,7 +24,7 @@ shared_examples "empty splaytree" do
   end
 end
 
-shared_examples "non-empty splaytree" do
+shared_examples_for "non-empty splaytree" do
   before(:each) do
     @num_items = 100
     @random_array = []
@@ -74,30 +74,30 @@ end
 
 describe "empty splaytreemap" do
   before(:each) do
-    @tree = Containers::RubySplayTreeMap.new
+    @tree = Algorithms::Containers::RubySplayTreeMap.new
   end
   it_should_behave_like "empty splaytree"
 end
 
 describe "full splaytreemap" do
   before(:each) do
-    @tree = Containers::RubySplayTreeMap.new
+    @tree = Algorithms::Containers::RubySplayTreeMap.new
   end
   it_should_behave_like "non-empty splaytree"
 end
 
 begin
-  Containers::CSplayTreeMap
+  Algorithms::Containers::CSplayTreeMap
   describe "empty csplaytreemap" do
     before(:each) do
-      @tree = Containers::CSplayTreeMap.new
+      @tree = Algorithms::Containers::CSplayTreeMap.new
     end
     it_should_behave_like "empty splaytree"
   end
 
   describe "full csplaytreemap" do
     before(:each) do
-      @tree = Containers::CSplayTreeMap.new
+      @tree = Algorithms::Containers::CSplayTreeMap.new
     end
     it_should_behave_like "non-empty splaytree"
   end

data/spec/string_spec.rb

@@ -2,11 +2,11 @@ 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)
+    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

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: stakach-algorithms
 version: !ruby/object:Gem::Version
-  version: 1.0.7
+  version: 1.0.8
   prerelease: 
 platform: ruby
 authors: