ds 0.0.4 → 0.0.6

data/test/test_list_element.rb

@@ -1,56 +1,74 @@
 require 'help'
 
-describe "List Element" do
-
+describe 'List Element' do
   before do
     @empty_el = ListElement.new
     @el = ListElement.new(1)
   end
 
-  describe "not initialized" do
-
+  describe 'not initialized' do
     before do
       @empty_el = ListElement.new
     end
 
-    it "should have no elements." do
+    it 'should have no elements.' do
       @empty_el.data.must_be_nil
     end
 
-    it "should be tail." do
+    it 'should be tail.' do
       assert @empty_el.tail?
     end
 
-    it "#append should link element with another." do
-      @empty_el.append(2).must_be_instance_of ListElement
+    it 'should be head.' do
+      assert @empty_el.head?
+    end
+
+    it '#append should return appended element.' do
+      el = @empty_el.append(2)
+      el.must_be_instance_of ListElement
+      el.data.must_equal 2
+      el.must_equal @empty_el.next
+    end
+
+    it '#append should link element with another.' do
+      @next = @empty_el.append(2)
+      @next.must_be_instance_of ListElement
       @empty_el.next.wont_be_nil
       @empty_el.next.must_be_instance_of ListElement
       @empty_el.next.data.must_equal 2
+      @next.prev.wont_be_nil
+      @next.prev.must_be_instance_of ListElement
     end
   end
 
-
-  describe "initialized" do
-
+  describe 'initialized' do
     before do
       @el = ListElement.new(1)
     end
 
-    it "should have one element" do
+    it 'should have one element' do
       @el.data.must_equal 1
     end
 
-    it "should be tail." do
+    it 'should be tail.' do
       assert @el.tail?
     end
 
-    it "#append should link element with another." do
+    it 'should be head.' do
+      assert @el.head?
+    end
+
+    it '#append should link element with another.' do
+      @next = @el.append(2)
+      @next.must_be_instance_of ListElement
       @el.append(2).must_be_instance_of ListElement
       @el.next.wont_be_nil
       @el.next.must_be_instance_of ListElement
       @el.next.data.must_equal 2
-    end
 
+      @next.prev.wont_be_nil
+      @next.prev.must_be_instance_of ListElement
+      @next.prev.data.must_equal 1
+    end
   end
-
 end

data/test/test_pair.rb

@@ -1,26 +1,23 @@
 require 'help'
 
 describe Pair do
-
   before do
-    @pair = Pair.new(1,2)
+    @pair = Pair.new(1, 2)
   end
 
-  it "#first should return first element of a pair" do
+  it '#first should return first element of a pair' do
     @pair.first.must_equal 1
   end
 
-  it "#key should return first element of a pair" do
+  it '#key should return first element of a pair' do
     @pair.key.must_equal 1
   end
 
-  it "#second should return second element of a pair" do
+  it '#second should return second element of a pair' do
     @pair.second.must_equal 2
   end
 
-  it "#value should return second element of a pair" do
+  it '#value should return second element of a pair' do
     @pair.value.must_equal 2
   end
-  
 end
-

data/test/test_priority_queue.rb

@@ -1,49 +1,43 @@
 require 'help'
 
 describe PriorityQueue do
-
-  describe "Empty Priority Queue" do
-
+  describe 'Empty priority queue' do
     before do
       @empty_queue = PriorityQueue.new
     end
 
-    it "should be empty." do
+    it 'should be empty.' do
       assert @empty_queue.empty?
     end
 
-    it "should have zero elements." do
+    it 'should have zero elements.' do
       @empty_queue.length.must_equal 0
     end
   end
 
-
-  describe "Not empty priority queue" do
-
+  describe 'Not empty priority queue' do
     before do
       @queue = PriorityQueue.new
       @queue.enqueue :important, 2
       @queue.enqueue :not_important, 1
     end
 
-    it "should not be empty." do
+    it 'should not be empty.' do
       refute @queue.empty?
       @queue.length.must_equal 2
-
     end
 
-    it "#peek should return element with highest priority." do
+    it '#peek should return element with highest priority.' do
       @queue.peek.must_equal :important
     end
 
-
-    it "#enqueue and #push should add element to priority queue." do
+    it '#enqueue and #push should add element to priority queue.' do
       @queue.enqueue :very_important, 5
       @queue.push :nevermind, 0
       @queue.length.must_equal 4
     end
 
-    it "#dequeue and #shift should remove element with highest priority." do
+    it '#dequeue and #shift should remove element with highest priority.' do
       x = @queue.dequeue
       @queue.length.must_equal 1
       x.must_equal :important
@@ -53,37 +47,61 @@ describe PriorityQueue do
     end
   end
 
-  describe "Priority Queue with duplications" do
+  describe 'Not empty priority queue with custom order' do
+    before do
+      @queue = PriorityQueue.new { |a, b| a < b }
+      @queue.enqueue 'gamma', 'g'
+      @queue.enqueue 'alpha', 'a'
+      @queue.enqueue 'beta', 'b'
+    end
 
+    it 'should not be empty.' do
+      refute @queue.empty?
+      @queue.length.must_equal 3
+    end
+
+    it '#peek should return element with highest priority.' do
+      @queue.peek.must_equal 'alpha'
+    end
+
+    it '#dequeue and #shift should remove element with highest priority.' do
+      x = @queue.dequeue
+      @queue.length.must_equal 2
+      x.must_equal 'alpha'
+      @queue.dequeue.must_equal 'beta'
+      @queue.length.must_equal 1
+    end
+  end
+
+  describe 'PriorityQueue with duplications' do
     before do
-      @dup_queue = PriorityQueue.new
-      @dup_queue.enqueue :same_important, 2
+      @dup_queue = PriorityQueue.new(Pair.new(2, :same_important))
       @dup_queue.enqueue :important, 2
       @dup_queue.enqueue :not_important, 1
     end
 
-    it "should not be empty" do
+    it 'should not be empty' do
       refute @dup_queue.empty?
       @dup_queue.length.must_equal 3
     end
 
-    it "#peek should return element with highest priority." do
-      assert [:important,:same_important].include? @dup_queue.peek
+    it '#peek should return element with highest priority.' do
+      assert [:important, :same_important].include? @dup_queue.peek
       @dup_queue.dequeue
-      assert [:important,:same_important].include? @dup_queue.peek
+      assert [:important, :same_important].include? @dup_queue.peek
       @dup_queue.dequeue
       @dup_queue.peek.must_equal :not_important
     end
 
-    it "#enqueue and #push should add element to priority queue." do
+    it '#enqueue and #push should add element to priority queue.' do
       @dup_queue.push :nevermind, 0
       @dup_queue.push :another_important, 2
       @dup_queue.length.must_equal 5
     end
 
-    it "#dequeue and #shift should remove element with highest priority." do
-      x  = @dup_queue.dequeue
-      assert [:important,:same_important].include? x
+    it '#dequeue and #shift should remove element with highest priority.' do
+      x = @dup_queue.dequeue
+      assert [:important, :same_important].include? x
       @dup_queue.length.must_equal 2
 
       @dup_queue.enqueue :important, 2
@@ -92,43 +110,4 @@ describe PriorityQueue do
       @dup_queue.dequeue.must_equal :important
     end
   end
-
-
-  if ENV['BENCH']
-    describe "performance" do
-
-      before do
-        
-        @queue = PriorityQueue.new
-        10000.times do |n|
-          @queue.push :elem, rand(10)
-        end
-
-        @empty_queue = PriorityQueue.new
-      end
-
-
-      bench_performance_constant "#accessing max element should be const operation.", 0.999 do |n|
-        n.times do
-          @queue.peek
-        end
-      end
-
-
-      bench_performance_constant "#removing max element should be log operation.", 0.999 do |n|
-        n.times do
-          @queue.dequeue
-        end
-      end
-
-      bench_performance_constant "creating new priority queue should be linear operation.", 0.999 do |n|
-        n.times do
-          @empty_queue.push :elem, rand(10)
-        end
-      end
-
-
-
-    end
-  end
 end

data/test/test_queue.rb

@@ -1,36 +1,27 @@
 require 'help'
 
-describe Queue do
-
-  describe "Empty Queue" do
-
+describe SimpleQueue do
+  describe 'empty queue' do
     before do
-      @empty_queue = Queue.new
+      @empty_queue = SimpleQueue.new
     end
 
-    it "should be empty." do
+    it 'should be empty.' do
       assert @empty_queue.empty?
     end
 
-    it "should have zero elements." do
+    it 'should have zero elements.' do
       @empty_queue.length.must_equal 0
     end
   end
 
-
-  describe "Not empty queue" do
-
+  describe 'not empty queue' do
     before do
-      @queue = DS::Queue.new
-      @queue.enqueue 1
-      @queue.enqueue 2
-
-      @queue2 = DS::Queue.create
-      @queue2.enqueue 1
-      @queue2.enqueue 2
+      @queue = SimpleQueue.new(1, 2)
+      @queue2 = SimpleQueue.create(1, 2)
     end
 
-    it "should not be empty." do
+    it 'should not be empty.' do
       refute @queue.empty?
       @queue.length.must_equal 2
 
@@ -38,13 +29,12 @@ describe Queue do
       @queue2.length.must_equal 2
     end
 
-    it "#peek should return element from forehead of queue." do
+    it '#peek should return element from forehead of queue.' do
       @queue.peek.must_equal 1
       @queue2.peek.must_equal 1
     end
 
-
-    it "#enqueue and #push should add element to queue." do
+    it '#enqueue and #push should add element to queue.' do
       @queue.enqueue 3
       @queue.length.must_equal 3
 
@@ -58,7 +48,7 @@ describe Queue do
       @queue2.length.must_equal 4
     end
 
-    it "#dequeue and #shift should remove element from queue." do
+    it '#dequeue and #shift should remove element from queue.' do
       x = @queue.dequeue
       @queue.length.must_equal 1
       x.must_equal 1
@@ -67,44 +57,5 @@ describe Queue do
       @queue2.length.must_equal 1
       x.must_equal 1
     end
-
-
-    if ENV['BENCH']
-      describe "performance" do
-
-        before do
-          100000.times do |n|
-            @queue.push 4
-            @queue2.push 4
-          end
-        end
-
-
-        bench_performance_constant "#shift(array implementation) should be const operation.", 0.999 do |n|
-          n.times do
-            @queue.shift
-          end
-        end
-
-        bench_performance_constant "#shift(list implementation) should be const operation.", 0.999 do |n|
-          n.times do
-            @queue2.shift
-          end
-        end
-
-        bench_performance_constant "#push(array implementation) should be const operation.", 0.999 do |n|
-          n.times do
-            @queue.push 2
-          end
-        end
-
-        bench_performance_constant "#push(list implementation) should be const operation.", 0.999 do |n|
-          n.times do
-            @queue2.push 2
-          end
-        end
-      end
-    end
-
   end
 end

data/test/test_red_black_tree.rb

@@ -0,0 +1,46 @@
+require 'help'
+
+describe Tree do
+  before do
+    @tree = RedBlackTree.new
+    @tree.insert(:a, 1)
+    @tree.insert(:b, 2)
+  end
+
+  it '#new creates new RBT from hash' do
+    @dict = RedBlackTree.new(a: 1, b: 2, c: 3)
+    @dict[:a].must_equal 1
+    @dict[:b].must_equal 2
+    @dict[:c].must_equal 3
+  end
+
+  it '#insert add new element into tree' do
+    @tree.insert(:c, 3)
+    @tree.get(:c).must_equal 3
+  end
+
+  it '#get returns element if it is on tree' do
+    @tree.get(:b).must_equal 2
+    @tree.get(:x).must_equal nil
+  end
+
+  it 'has hash like methods' do
+    @tree[:c] = 3
+    @tree[:c].must_equal 3
+  end
+
+  it '#size returns tree size' do
+    @tree.size.must_equal(2)
+  end
+
+  it '#map returns nodes in order' do
+    @tree.insert(:e, 3)
+    @tree.insert(:d, 3)
+    @tree.insert(:c, 3)
+    @tree.map(&:key).must_equal [:a, :b, :c, :d, :e]
+  end
+
+  it '#to_h converts tree to Hash' do
+    @tree.to_h.must_equal a: 1, b: 2
+  end
+end