DSA 0.0.1

data/test/binary_search_tree_test.rb

@@ -0,0 +1,287 @@
+require 'test/unit'
+require 'DSA'
+require 'benchmark'
+
+class MyTest < Test::Unit::TestCase
+
+  # Called before every test method runs. Can be used
+  # to set up fixture information.
+  def setup
+    # Do nothing
+  end
+
+  # Called after every test method runs. Can be used to tear
+  # down fixture information.
+
+  def teardown
+    # Do nothing
+  end
+
+  def test_bst
+    bst = DSA::BasicBinarySearchTree.new
+    bst[50] = 'string: 50'
+    bst[90] = 'string: 90'
+    bst[80] = 'string: 80'
+    bst[70] = 'string: 70'
+    bst[25] = 'string: 25'
+    bst[30] = 'string: 30'
+    bst[95] = 'string: 95'
+    bst.bfs_print
+    assert_equal 'string: 95', bst.max, 'max failed'
+    assert_equal 'string: 25', bst.min, 'min failed'
+    assert_equal 'string: 80', bst[80], 'get value by key failed'
+    assert_equal nil, bst[55], 'get value by key failed'
+    assert_equal 'string: 80', bst.delete(80), 'delete failed'
+    bst.bfs_print
+    bst.delete 70
+    bst.bfs_print
+    bst.delete 50
+    bst.bfs_print
+    bst[50] = 'string: 50'
+
+    10.times do
+      key = Random.rand 200
+      value = 'string: ' + key.to_s
+      bst[key] = value
+    end
+    bst.bfs_print
+    bst.each do |key, value|
+      printf "<#{key}-#{value}>\t"
+    end
+    puts
+
+    enum = bst.each
+    loop do
+      key, value = enum.next
+      printf "<#{key}-#{value}>\t"
+    end
+    puts
+
+    bst.gt(50) do |key, value|
+      printf "<#{key}-#{value}>\t"
+    end
+    puts
+
+    enum = bst.gt(50)
+    loop do
+      key, value = enum.next
+      printf "<#{key}-#{value}>\t"
+    end
+    puts
+
+    bst.ge(50) do |key, value|
+      printf "<#{key}-#{value}>\t"
+    end
+    puts
+
+    enum = bst.ge(50)
+    loop do
+      key, value = enum.next
+      printf "<#{key}-#{value}>\t"
+    end
+    puts
+
+    bst.lt(50) do |key, value|
+      printf "<#{key}-#{value}>\t"
+    end
+    puts
+
+    enum = bst.lt(50)
+    loop do
+      key, value = enum.next
+      printf "<#{key}-#{value}>\t"
+    end
+    puts
+
+    bst.le(50) do |key, value|
+      printf "<#{key}-#{value}>\t"
+    end
+    puts
+
+    enum = bst.le(50)
+    loop do
+      key, value = enum.next
+      printf "<#{key}-#{value}>\t"
+    end
+    puts
+
+  end
+
+  def test_rb
+    rb = DSA::RedBlackTree.new
+    rb[100] = 'string_100'
+    rb[50] = 'string_50'
+    rb[1] = 'string_1'
+    rb.bfs_print
+    rb[120] = 'string_120'
+    rb.bfs_print
+    rb[150] = 'string_150'
+    rb.bfs_print
+
+    5.times do
+      key = Random.rand 200
+      value = "string_#{key}"
+      puts "inserting #{key}"
+      rb[key] = value
+      rb.bfs_print
+    end
+
+    100.times do
+      key = Random.rand 200
+      value = "string_#{key}"
+      rb[key] = value
+    end
+    rb.bfs_print
+    rb.gt(50) do |key, value|
+      printf "<#{key}-#{value}>\t"
+    end
+  end
+
+
+  def test_rb_deletion
+    rb = DSA::RedBlackTree.new
+    rb[100] = 'string_100'
+    rb[50] = 'string_50'
+    rb[1] = 'string_1'
+    rb[120] = 'string_120'
+    rb[150] = 'string_150'
+    rb.bfs_print
+    rb.delete 100
+    rb.bfs_print
+    rb[20] = 'string_20'
+    rb.bfs_print
+    rb.delete 1
+    rb.bfs_print
+    rb[180] = 'string_180'
+    rb[170] = 'string_170'
+    rb[190] = 'string_190'
+
+    rb.bfs_print
+    assert_equal 'string_120', rb.delete(120), 'deletion failed'
+    rb.bfs_print
+
+    rb[18] = 'string_18'
+    rb[174] = 'string_174'
+    rb[113] = 'string_113'
+    rb[92] = 'string_92'
+    rb[108] = 'string_108'
+    rb[193] = 'string_193'
+    rb[42] = 'string_42'
+    rb[35] = 'string_35'
+    rb[82] = 'string_82'
+    rb[31] = 'string_31'
+    rb[61] = 'string_61'
+    rb[37] = 'string_37'
+    rb[179] = 'string_179'
+    rb[23] = 'string_23'
+    rb[10] = 'string_10'
+    rb[1] = 'string_1'
+    rb[28] = 'string_28'
+    rb[187] = 'string_187'
+    rb[170] = 'string_170'
+    rb[77] = 'string_77'
+    rb.bfs_print
+
+    rb.delete 92
+
+    rb[177] = 'string_177'
+    rb[95] = 'string_95'
+    rb[71] = 'string_71'
+    rb[18] = 'string_18'
+    rb[33] = 'string_33'
+    rb[87] = 'string_87'
+    rb[94] = 'string_94'
+    rb[109] = 'string_109'
+    rb.bfs_print
+    rb[38] = 'string_38'
+    rb[190] = 'string_190'
+    rb[101] = 'string_101'
+    rb[90] = 'string_90'
+    rb[35] = 'string_35'
+    rb[73] = 'string_73'
+    rb[27] = 'string_27'
+    rb[58] = 'string_58'
+    rb.bfs_print
+    rb[101] = 'string_101'
+    rb[135] = 'string_135'
+    rb.bfs_print
+    rb[18] = 'string_18'
+    rb[159] = 'string_159'
+    rb[32] = 'string_32'
+    rb[127] = 'string_127'
+    rb.bfs_print
+    rb[152] = 'string_152'
+    rb[160] = 'string_160'
+    rb.bfs_print
+    rb[11] = 'string_11'
+    rb[5] = 'string_5'
+    rb[97] = 'string_97'
+    rb[79] = 'string_79'
+    rb[11] = 'string_11'
+    rb[148] = 'string_148'
+    rb[132] = 'string_132'
+    rb.bfs_print
+    rb[37] = 'string_37'
+    rb[17] = 'string_17'
+    rb[20] = 'string_20'
+    rb[26] = 'string_26'
+    rb[23] = 'string_23'
+    rb.bfs_print
+    rb[101] = 'string_101'
+    rb.bfs_print
+    rb[172] = 'string_172'
+    rb[192] = 'string_192'
+    rb[193] = 'string_193'
+    rb[131] = 'string_131'
+    rb[150] = 'string_150'
+    rb[151] = 'string_151'
+    rb[130] = 'string_130'
+    rb[119] = 'string_119'
+    rb[110] = 'string_110'
+    rb[26] = 'string_26'
+    rb[31] = 'string_31'
+    rb[110] = 'string_110'
+    rb[63] = 'string_63'
+
+    rb.bfs_print
+    rb.delete 87
+    rb.bfs_print
+
+    200.times do
+      key = Random.rand 200
+      value = "string_#{key}"
+      puts "rb[#{key}] = '#{value}'"
+      rb[key] = value
+    end
+
+    100.times do
+      key = Random.rand 200
+      puts "deleting #{key}"
+      rb.delete key
+      rb.bfs_print
+    end
+
+    rb.each do |key, value|
+      printf "<#{key}-#{value}>\t"
+    end
+
+  end
+
+  def test_performance
+    puts
+    rb = DSA::RedBlackTree.new
+    hash = Hash.new
+    value = 10**5
+    Benchmark.bm(20) do |x|
+      x.report('RedBlack') { value.times { rb[Random.rand(value)] = 'whatever' } }
+      x.report('RedBlack Find') { value.times { rb[Random.rand(value)] } }
+      x.report('RedBlack Find gt') { value.times { rb.gt(Random.rand(value)) } }
+      x.report('RedBlack Deletion') { (value/2).times { rb.delete Random.rand(value) } }
+      x.report('Built-In Hash') { value.times { hash[Random.rand(value)] = 'whatever' } }
+      x.report('Built-In Hash Find') { value.times { hash[Random.rand(value)] } }
+      x.report('Built-In Hash Deletion') { (value/2).times { hash.delete Random.rand(value) } }
+    end
+  end
+
+
+end

data/test/list_test.rb

@@ -0,0 +1,84 @@
+require 'test/unit'
+require 'benchmark'
+require 'DSA'
+
+class MyTest < Test::Unit::TestCase
+
+  # Called before every test method runs. Can be used
+  # to set up fixture information.
+  def setup
+    # Do nothing
+  end
+
+  # Called after every test method runs. Can be used to tear
+  # down fixture information.
+
+  def teardown
+    # Do nothing
+  end
+
+  class DSA::List
+    def print_me
+      printf 'Head --> '
+      each do |e|
+        printf e.to_s + ' --> '
+      end
+      puts 'Tail'
+    end
+  end
+
+  def test_list
+    l = DSA::List.new
+    l.push 1
+    l.push 10
+    l.push 20
+    l.insert_at 1, 30
+    assert_equal 10, l[2], '[] failed'
+    assert_equal 1, l.first, 'first failed'
+    assert_equal 20, l.last, 'last failed'
+    l.unshift 40
+    l.unshift 50
+    l.unshift 60
+    l.print_me
+    assert_equal 20, l.pop, 'pop failed'
+    l.print_me
+    assert_equal 60, l.shift, 'shift failed'
+    l.print_me
+    assert_equal 1, l.remove_at(2), 'remove failed'
+    l.print_me
+
+    li = l.begin_iterator
+    loop do
+      puts li.next
+    end
+    li = l.end_iterator
+    assert_equal 10, li.previous, 'iteration failed'
+    li.insert 60
+    l.print_me
+    li.previous
+    li.previous
+    assert_equal 30, li.remove, 'remove failed'
+    l.print_me
+
+  end
+
+  def test_performance
+    value = 10**6
+    a = Array.new
+    b = DSA::List.new
+    puts 'test construction'
+    Benchmark.bm(20) do |x|
+      x.report('Array') { value.times{ |i| a.push i } }
+      x.report('List') { value.times{ |i| b.push i } }
+    end
+
+    puts 'test insertion'
+
+    value = 10**3
+    li = b.begin_iterator
+    Benchmark.bm(20) do |x|
+      x.report('Array') { value.times{ |i| a.insert(value, i) } }
+      x.report('List') { value.times{ li.next }; value.times{ |i| li.insert(i) }; }
+    end
+  end
+end

data/test/priority_queue_test.rb

@@ -0,0 +1,49 @@
+require 'test/unit'
+require 'DSA'
+
+class MyTest < Test::Unit::TestCase
+
+  # Called before every test method runs. Can be used
+  # to set up fixture information.
+  def setup
+    # Do nothing
+  end
+
+  # Called after every test method runs. Can be used to tear
+  # down fixture information.
+
+  def teardown
+    # Do nothing
+  end
+
+  class DSA::PriorityQueue
+    def print_me
+      printf 'Start --> '
+      @data.each do |e|
+        printf e.element.to_s + ' --> '
+      end
+      puts 'End'
+    end
+  end
+
+  def test_priority_queue
+    pq = DSA::PriorityQueue.new
+    10.times do
+      number = Random.rand(50..100)
+      pq.add( number, 'job:'+number.to_s )
+    end
+    pq.print_me
+    pq.add 10, 'job:10'
+    pq.add 20, 'job:20'
+    assert_equal 'job:10', pq.top
+    pq.print_me
+    assert_equal 'job:10', pq.pop
+    pq.print_me
+    pq.pop
+    pq.print_me
+    pq.pop
+    pq.print_me
+    pq.pop
+    pq.print_me
+  end
+end

data/test/stack_and_queue_test.rb

@@ -0,0 +1,96 @@
+require 'test/unit'
+require 'DSA'
+
+class MyTest < Test::Unit::TestCase
+
+  # Called before every test method runs. Can be used
+  # to set up fixture information.
+  def setup
+    # Do nothing
+  end
+
+  # Called after every test method runs. Can be used to tear
+  # down fixture information.
+
+  def teardown
+    # Do nothing
+  end
+
+  def test_stack
+    s = DSA::ArrayStack.new
+    s.push 1
+    s.push 2
+    assert_equal 2, s.pop, 'failed pop'
+    assert_equal false, s.empty?, 'failed empty?'
+    assert_equal 1, s.top, 'failed top'
+    assert_equal 1, s.length, 'failed length'
+
+    s = DSA::ListStack.new
+    s.push 1
+    s.push 2
+    assert_equal 2, s.pop, 'failed pop'
+    assert_equal false, s.empty?, 'failed empty?'
+    assert_equal 1, s.top, 'failed top'
+    assert_equal 1, s.length, 'failed length'
+  end
+
+  class DSA::ArrayQueue
+    def print_me
+      print @data.join(' --> ')
+      puts
+    end
+  end
+
+  class DSA::ListQueue
+    def print_me
+      printf 'Head --> '
+      @data.each do |e|
+        printf e.to_s + ' --> '
+      end
+      puts 'Tail'
+    end
+  end
+
+  def test_queue
+    puts
+    q = DSA::ArrayQueue.new
+    q.print_me
+    assert_equal true, q.empty?, 'failed empty?'
+    q.enqueue 1
+    q.enqueue 2
+    q.enqueue 3
+    assert_equal 3, q.length, 'failed length'
+    q.print_me
+    q.dequeue
+    q.dequeue
+    assert_equal 3, q.first, 'failed first'
+    q.print_me
+    25.times { |i| q.enqueue i }
+    q.print_me
+    10.times { q.dequeue }
+    q.print_me
+    assert_equal 9, q.first, 'failed first'
+    assert_equal 16, q.length, 'failed length'
+
+
+    puts
+    q = DSA::ListQueue.new
+    q.print_me
+    assert_equal true, q.empty?, 'failed empty?'
+    q.enqueue 1
+    q.enqueue 2
+    q.enqueue 3
+    assert_equal 3, q.length, 'failed length'
+    q.print_me
+    q.dequeue
+    q.dequeue
+    assert_equal 3, q.first, 'failed first'
+    q.print_me
+    25.times { |i| q.enqueue i }
+    q.print_me
+    10.times { q.dequeue }
+    q.print_me
+    assert_equal 9, q.first, 'failed first'
+    assert_equal 16, q.length, 'failed length'
+  end
+end