compsci 0.0.3.1 → 0.1.0.1

data/test/bench/tree.rb

@@ -13,14 +13,14 @@ describe "BinaryTree#push Benchmark" do
   end
 
   bench_performance_constant "BinaryTree#push (constant)" do |n|
-    tree = BinaryTree.new(ChildNode, 42)
+    tree = NaryTree.new(ChildNode, 42, child_slots: 2)
     n.times { tree.push rand 99 }
   end
 
   bench_performance_linear "BinaryTree#push (linear)" do |n|
     skip "this fails with r^2 around 0.91"
 
-    tree = BinaryTree.new ChildNode.new 42
+    tree = NaryTree.new(ChildNode, 42, child_slots: 2)
     n.times { tree.push rand 99 }
   end
 end

data/test/complete_tree.rb

@@ -0,0 +1,131 @@
+require 'compsci/complete_tree'
+require 'minitest/autorun'
+
+include CompSci
+
+describe CompleteNaryTree do
+  it "must calculate a parent index for N=2" do
+    valid = {
+      1 => 0,
+      2 => 0,
+      3 => 1,
+      4 => 1,
+      5 => 2,
+      6 => 2,
+      7 => 3,
+      8 => 3,
+      9 => 4,
+      10 => 4,
+    }
+
+    invalid = {
+      0 => -1,
+      -1 => -1,
+      -2 => -2,
+    }
+    valid.each { |idx, pidx|
+      CompleteNaryTree.parent_idx(idx, 2).must_equal pidx
+    }
+    invalid.each { |idx, pidx|
+      CompleteNaryTree.parent_idx(idx, 2).must_equal pidx
+    }
+  end
+
+  it "must calculate children indices for N=2" do
+    valid = {
+      0 => [1, 2],
+      1 => [3, 4],
+      2 => [5, 6],
+      3 => [7, 8],
+      4 => [9, 10],
+      5 => [11, 12],
+      6 => [13, 14],
+      7 => [15, 16],
+      8 => [17, 18],
+      9 => [19, 20],
+      10 => [21, 22],
+    }
+
+    invalid = {
+      -3 => [-5, -4],
+      -2 => [-3, -2],
+      -1 => [-1, 0],
+    }
+
+    valid.each { |idx, cidx|
+      CompleteNaryTree.children_idx(idx, 2).must_equal cidx
+    }
+    invalid.each { |idx, cidx|
+      CompleteNaryTree.children_idx(idx, 2).must_equal cidx
+    }
+  end
+
+  it "must calculate a parent index for N=3" do
+    valid = {
+      1 => 0,
+      2 => 0,
+      3 => 0,
+      4 => 1,
+      5 => 1,
+      6 => 1,
+      7 => 2,
+      8 => 2,
+      9 => 2,
+      10 => 3,
+    }
+
+    invalid = {
+      0 => -1,
+      -1 => -1,
+      -2 => -1,
+    }
+    valid.each { |idx, pidx|
+      CompleteNaryTree.parent_idx(idx, 3).must_equal pidx
+    }
+    invalid.each { |idx, pidx|
+      CompleteNaryTree.parent_idx(idx, 3).must_equal pidx
+    }
+  end
+
+  it "must calculate children indices for N=3" do
+    valid = {
+      0 => [1, 2, 3],
+      1 => [4, 5, 6],
+      2 => [7, 8, 9],
+      3 => [10, 11, 12],
+    }
+
+    invalid = {
+      -3 => [-8, -7, -6],
+      -2 => [-5, -4, -3],
+      -1 => [-2, -1,  0],
+    }
+
+    valid.each { |idx, cidx|
+      CompleteNaryTree.children_idx(idx, 3).must_equal cidx
+    }
+    invalid.each { |idx, cidx|
+      CompleteNaryTree.children_idx(idx, 3).must_equal cidx
+    }
+  end
+
+  describe "instance" do
+    before do
+      @array = (0..99).sort_by { rand }
+      @empty = CompleteNaryTree.new(child_slots: 5)
+      @nonempty = CompleteQuaternaryTree.new(array: @array)
+    end
+
+    it "must have a size" do
+      @empty.size.must_equal 0
+      @nonempty.size.must_equal @array.size
+    end
+
+    it "must have a last_idx, nil when empty" do
+      @empty.last_idx.nil?.must_equal true
+      @nonempty.last_idx.must_equal 99
+    end
+
+    # TODO: push, pop, display
+  end
+end

data/test/heap.rb

@@ -4,43 +4,130 @@ require 'minitest/autorun'
 include CompSci
 
 describe Heap do
-  before do
-    @maxheap = Heap.new
-    @minheap = Heap.new(minheap: true)
-    @inserts = (1..10).to_a
-    @inserts.each { |i|
-      @maxheap.push i
-      @minheap.push i
-    }
+  describe "MaxHeap" do
+    before do
+      @maxheap = Heap.new
+      @inserts = Array.new(10) { |i| i + 1 }.each { |i| @maxheap.push i }
+    end
+
+    it "must satisfy the heap property" do
+      @maxheap.heap?.must_equal true
+      @maxheap.array.wont_equal @inserts
+      @maxheap.array.wont_equal @inserts.reverse
+    end
+
+    it "must recognize heap violations" do
+      @maxheap.array.unshift 0
+      @maxheap.heap?.must_equal false
+      @maxheap.array.shift
+      @maxheap.heap?.must_equal true
+
+      @maxheap.array.push 10
+      @maxheap.heap?.must_equal false
+      @maxheap.sift_up @maxheap.last_idx
+      @maxheap.heap?.must_equal true
+    end
+
+    it "must pop" do
+      @maxheap.pop.must_equal 10
+      @maxheap.peek.wont_equal 10
+      @maxheap.heap?.must_equal true
+    end
+
+    it "must heapish?" do
+      @maxheap.array[0].must_be :>, @maxheap.array[1]
+      @maxheap.heapish?(0, 1).must_equal true
+    end
+
+    it "must heapiest" do
+      @maxheap.heapiest([1, 2]).must_equal 1
+      @maxheap.heapiest([3, 4]).must_equal 4
+      @maxheap.heapiest([5, 6]).must_equal 6
+      @maxheap.heapiest([7, 8]).must_equal 8
+    end
   end
 
-  it "must satisfy the heap property" do
-    @maxheap.heap?.must_equal true
-    @minheap.heap?.must_equal true
-    @minheap.store.must_equal @inserts
-    @maxheap.store.wont_equal @inserts
-    @maxheap.store.wont_equal @inserts.reverse
+  describe "MinHeap" do
+    before do
+      @minheap = Heap.new(minheap: true)
+      @inserts = Array.new(10) { |i| i + 1 }.each { |i| @minheap.push i }
+    end
+
+    it "must satisfy the heap property" do
+      @minheap.heap?.must_equal true
+      @minheap.array.must_equal @inserts
+    end
+
+    it "must recognize heap violations" do
+      @minheap.array.unshift 10
+      @minheap.heap?.must_equal false
+      @minheap.array.shift
+      @minheap.heap?.must_equal true
+
+      @minheap.array.push 0
+      @minheap.heap?.must_equal false
+      @minheap.sift_up @minheap.last_idx
+      @minheap.heap?.must_equal true
+    end
+
+    it "must pop" do
+      @minheap.pop.must_equal 1
+      @minheap.peek.wont_equal 1
+      @minheap.heap?.must_equal true
+    end
+
+    it "must heapish?" do
+      @minheap.array[0].must_be :<, @minheap.array[1]
+      @minheap.heapish?(0, 1).must_equal true
+    end
+
+    it "must heapiest" do
+      @minheap.heapiest([1, 2]).must_equal 1
+      @minheap.heapiest([3, 4]).must_equal 3
+      @minheap.heapiest([5, 6]).must_equal 5
+      @minheap.heapiest([7, 8]).must_equal 7
+    end
   end
 
-  it "must recognize heap violations" do
-    @minheap.store.push 0
-    @minheap.heap?.must_equal false
-    @minheap.sift_up @minheap.last_idx
-    @minheap.heap?.must_equal true
-
-    @minheap.store.unshift 10
-    @minheap.heap?.must_equal false
-    @minheap.sift_down 0
-    @minheap.heap?.must_equal true
-
-    @maxheap.store.push 10
-    @maxheap.heap?.must_equal false
-    @maxheap.sift_up @maxheap.last_idx
-    @maxheap.heap?.must_equal true
-
-    @maxheap.store.unshift 0
-    @maxheap.heap?.must_equal false
-    @maxheap.sift_down 0
-    @maxheap.heap?.must_equal true
+  describe "TernaryHeap" do
+    before do
+      @heap3 = Heap.new(child_slots: 3)
+      @inserts = Array.new(10) { |i| i + 1 }.each { |i| @heap3.push i }
+    end
+
+    it "must satisfy the heap property" do
+      @heap3.heap?.must_equal true
+      @heap3.array.wont_equal @inserts
+      @heap3.array.wont_equal @inserts.reverse
+    end
+
+    it "must recognize heap violations" do
+      @heap3.array.unshift 0
+      @heap3.heap?.must_equal false
+      @heap3.array.shift
+      @heap3.heap?.must_equal true
+
+      @heap3.array.push 10
+      @heap3.heap?.must_equal false
+      @heap3.sift_up @heap3.last_idx
+      @heap3.heap?.must_equal true
+    end
+
+    it "must pop" do
+      @heap3.pop.must_equal 10
+      @heap3.peek.wont_equal 10
+      @heap3.heap?.must_equal true
+    end
+
+    it "must heapish?" do
+      @heap3.array[0].must_be :>, @heap3.array[1]
+      @heap3.heapish?(0, 1).must_equal true
+    end
+
+    it "must heapiest" do
+      @heap3.heapiest([1, 2, 3]).must_equal 2
+      @heap3.heapiest([4, 5, 6]).must_equal 6
+      @heap3.heapiest([7, 8, 9]).must_equal 9
+    end
   end
 end

data/test/names.rb

@@ -0,0 +1,96 @@
+require 'compsci/names'
+require 'minitest/autorun'
+
+include CompSci
+
+describe Names do
+  describe "alphabetic constants" do
+    it "must have size 26" do
+      Names::WW1.size.must_equal 26
+      Names::WW2.size.must_equal 26
+      Names::NATO.size.must_equal 26
+      Names::ENGLISH_UPPER.size.must_equal 26
+      Names::ENGLISH_LOWER.size.must_equal 26
+    end
+  end
+
+  describe "Names.assign" do
+    it "must handle English / ASCII strings" do
+      upper_lower = Names::ENGLISH_UPPER + Names::ENGLISH_LOWER
+      Names.assign('cat', Names::ENGLISH_UPPER).must_equal 'C'
+      Names.assign('Cat', Names::ENGLISH_UPPER).must_equal 'C'
+      Names.assign('cat', Names::ENGLISH_LOWER).must_equal 'c'
+      Names.assign('Cat', Names::ENGLISH_LOWER).must_equal 'c'
+      Names.assign('Cat', upper_lower).must_equal 'C'
+      Names.assign('cat', upper_lower).must_equal 'c'
+      Names.assign('cat', Names::NATO).must_equal :charlie
+      Names.assign('Cat', Names::NATO).must_equal :charlie
+      Names.assign('Dog', Names::CRYPTO).must_equal :david
+      Names.assign('2', Names::PLANETS).must_equal :earth
+    end
+
+    it "must handle integers" do
+      upper_lower = Names::ENGLISH_UPPER + Names::ENGLISH_LOWER
+      Names.assign(36, upper_lower).must_equal 'k'
+      Names.assign(0, upper_lower).must_equal 'A'
+      Names.assign(0, Names::ENGLISH_UPPER).must_equal 'A'
+      Names.assign(3, Names::ENGLISH_LOWER).must_equal 'd'
+      Names.assign(3, Names::PLANETS).must_equal :mars
+    end
+  end
+
+  describe Names::Greek do
+    describe "greek alphabetic constants" do
+      it "must have size 24" do
+        Names::Greek::UPPER.size.must_equal 24
+        Names::Greek::LOWER.size.must_equal 24
+        Names::Greek::SYMBOLS.size.must_equal 24
+        Names::Greek::CHAR_MAP.size.must_equal 24
+      end
+    end
+
+    describe "SYMBOLS26" do
+      it "must work well with Names.assign" do
+        s26 = Names::Greek::SYMBOLS26
+        Names.assign('iota', s26).must_equal :iota
+        Names.assign('jota', s26).must_equal :xi
+        Names.assign('Query', s26).must_equal :xi
+        Names.assign('who', s26).must_equal :xi
+        Names.assign('zeta', s26).must_equal :omega
+        Names.assign(0, s26).must_equal :alpha
+        Names.assign('1', s26).must_equal :beta
+      end
+    end
+  end
+
+  describe "Greek.sym" do
+    it "must handle strings and integers" do
+      Names::Greek.sym('cat').must_equal :gamma
+      Names::Greek.sym('Cat').must_equal :gamma
+      Names::Greek.sym('zeta').must_equal :omega
+      Names::Greek.sym(0).must_equal :alpha
+      Names::Greek.sym('1').must_equal :beta
+      Names::Greek.sym(23).must_equal :omega
+    end
+  end
+
+  describe "Greek.lower" do
+    it "must handle strings and integers" do
+      third = Names::Greek::LOWER[2]
+      Names::Greek.lower('cat').must_equal third
+      Names::Greek.lower('Cat').must_equal third
+      Names::Greek.lower(2).must_equal third
+      Names::Greek.lower('2').must_equal third
+    end
+  end
+
+  describe "Greek.upper" do
+    it "must handle strings and integers" do
+      fourth = Names::Greek::UPPER[3]
+      Names::Greek.upper('dog').must_equal fourth
+      Names::Greek.upper('Dog').must_equal fourth
+      Names::Greek.upper(3).must_equal fourth
+      Names::Greek.upper('3').must_equal fourth
+    end
+  end
+end

data/test/node.rb

@@ -0,0 +1,89 @@
+require 'compsci/node'
+require 'minitest/autorun'
+
+include CompSci
+
+describe Node do
+  before do
+    @martin_sheen = Node.new 'martin'
+    @charlie_sheen = Node.new 'charlie'
+    @emilio_estevez = Node.new 'emilio'
+  end
+
+  it "must start with no children" do
+    [@martin_sheen, @charlie_sheen, @emilio_estevez].each { |n|
+      n.children.must_be_empty
+    }
+  end
+
+  it "must track children" do
+    @charlie_sheen.add_parent(@martin_sheen)
+    @martin_sheen.children.must_include @charlie_sheen
+
+    @martin_sheen.children.wont_include @emilio_estevez
+    @martin_sheen.add_child @emilio_estevez
+    @martin_sheen.children.must_include @emilio_estevez
+  end
+
+  it "must not respond to :parent" do
+    @martin_sheen.respond_to?(:parent).must_equal false
+  end
+
+  it "must create children from scalars" do
+    @martin_sheen.new_child 'fake_emilio'
+    @martin_sheen.children.size.must_equal 1
+    @martin_sheen.children.first.value.must_equal 'fake_emilio'
+    @martin_sheen.children.wont_include @emilio_estevez
+  end
+end
+
+describe ChildNode do
+  before do
+    @martin_sheen = ChildNode.new 'martin'
+    @charlie_sheen = ChildNode.new 'charlie'
+    @emilio_estevez = ChildNode.new 'emilio'
+  end
+
+  it "must start with neither parent nor children" do
+    [@martin_sheen, @charlie_sheen, @emilio_estevez].each { |n|
+      n.parent.nil?.must_equal true
+      n.children.must_be_empty
+    }
+  end
+
+  it "must track parent and children" do
+    @charlie_sheen.add_parent(@martin_sheen)
+    @charlie_sheen.parent.must_equal @martin_sheen
+    @martin_sheen.children.must_include @charlie_sheen
+
+    @martin_sheen.children.wont_include @emilio_estevez
+    @martin_sheen.add_child @emilio_estevez
+    @martin_sheen.children.must_include @emilio_estevez
+    @emilio_estevez.parent.must_equal @martin_sheen
+  end
+
+  it "must determine a node's generation" do
+    @emilio_estevez.gen.must_equal 0
+    @martin_sheen.add_child @emilio_estevez
+    @emilio_estevez.gen.must_equal 1
+  end
+
+  it "must create children from scalars" do
+    @martin_sheen.new_child 'fake_emilio'
+    @martin_sheen.children.size.must_equal 1
+    @martin_sheen.children.first.value.must_equal 'fake_emilio'
+    @martin_sheen.children.wont_include @emilio_estevez
+  end
+
+  it "must recognize siblings" do
+    @charlie_sheen.add_parent @martin_sheen
+    @emilio_estevez.add_parent @martin_sheen
+    @martin_sheen.new_child 'fake_emilio'
+
+    @charlie_sheen.siblings.must_include @emilio_estevez
+    @charlie_sheen.siblings.wont_include @martin_sheen
+    @emilio_estevez.siblings.must_include @charlie_sheen
+    @martin_sheen.siblings.must_be_empty
+    @emilio_estevez.siblings.find { |n| n.value == 'fake_emilio' }.wont_be_nil
+  end
+end