RubyGems - datastructures - Versions diffs - 0.2.1 → 0.3.0 - Mend

@@ -0,0 +1,72 @@
+<!DOCTYPE html>
+<html xmlns='http://www.w3.org/1999/xhtml'>
+  <head>
+    <title>Code coverage for Test</title>
+    <meta http-equiv="content-type" content="text/html; charset=utf-8" />
+    <script src='./assets/0.7.1/application.js' type='text/javascript'></script>
+    <link href='./assets/0.7.1/application.css' media='screen, projection, print' rel='stylesheet' type='text/css'>
+    <link rel="shortcut icon" type="image/png" href="./assets/0.7.1/favicon_green.png" />
+    <link rel="icon" type="image/png" href="./assets/0.7.1/favicon.png" />
+  </head>
+  <body>
+    <div id="loading">
+      <img src="./assets/0.7.1/loading.gif" alt="loading"/>
+    </div>
+    <div id="wrapper" style="display:none;">
+      <div class="timestamp">Generated <abbr class="timeago" title="2013-08-26T20:50:25+01:00">2013-08-26T20:50:25+01:00</abbr></div>
+      <ul class="group_tabs"></ul>
+      <div id="content">
+        <div class="file_list_container" id="AllFiles">
+  <h2>
+    <span class="group_name">All Files</span>
+    (<span class="covered_percent"><span class="green">100.0%</span></span>
+     covered at
+     <span class="covered_strength">
+       <span class="red">
+         0.0
+       </span>
+    </span> hits/line)
+  </h2>
+  <a name="AllFiles"></a>
+  <div>
+    <b>0</b> files in total.
+    <b>0.0</b> relevant lines.
+    <span class="green"><b>0.0</b> lines covered</span> and
+    <span class="red"><b>0.0</b> lines missed </span>
+  </div>
+  <table class="file_list">
+    <thead>
+      <tr>
+        <th>File</th>
+        <th>% covered</th>
+        <th>Lines</th>
+        <th>Relevant Lines</th>
+        <th>Lines covered</th>
+        <th>Lines missed</th>
+        <th>Avg. Hits / Line</th>
+      </tr>
+    </thead>
+    <tbody>
+    </tbody>
+  </table>
+</div>
+      </div>
+      <div id="footer">
+        Generated by <a href="http://github.com/colszowka/simplecov">simplecov</a> v0.7.1
+        and simplecov-html v0.7.1<br/>
+        using Unit Tests
+      </div>
+      <div class="source_files">
+      </div>
+    </div>
+  </body>
+</html>

data/test/test_adjacency_list.rb ADDED

@@ -0,0 +1,79 @@
+require 'test_datastructures'
+class TestAdjacencyList < Test::Unit::TestCase
+  context "AdjacencyList" do
+    setup do
+      @al = DataStructures::AdjacencyList.new
+    end
+    should "allow handling nodes by name" do
+      @al = DataStructures::AdjacencyList.new(true)
+      a = {
+        :one => ['content 1', [:two]],
+        :two => ['content 2', [:three]],
+        :three => ['content 3', [:one]]
+      }
+      a.each_pair do |name, data|
+        value, edges = data
+        @al.add(value, name, edges)
+      end
+      a.each_pair do |name, data|
+        value, edges = data
+        assert_equal value, @al.get_node_value(name), "node #{name} should know its value"
+        assert_equal @al.neighbours(name), edges, "edges set should be in neighbours for node #{name}"
+        assert @al.adjacent?(name, edges.first), "node #{name} is adjacent to neighbour"
+      end
+      @al.delete_edge(:one, :two)
+      assert_equal @al.neighbours(:one), [], "deleting edge removes neighbour"
+      assert !@al.adjacent?(:one, :two), "deleting edge removes adjacency"
+    end
+    should "allow handling nodes by index" do
+      a = {
+        1 => ['content 1', [2]],
+        2 => ['content 2', [3]],
+        3 => ['content 3', [1]]
+      }
+      a.each_pair do |name, data|
+        value, edges = data
+        @al.add(value, name, edges)
+      end
+      a.each_pair do |name, data|
+        value, edges = data
+        assert_equal value, @al.get_node_value(name), "node #{name} should know its value"
+        assert_equal @al.neighbours(name), edges, "edges set should be in neighbours for node #{name}"
+        assert @al.adjacent?(name, edges.first), "node #{name} is adjacent to neighbour"
+      end
+      @al.delete_edge(1, 2)
+      assert_equal @al.neighbours(1), [], "deleting edge removes neighbour"
+      assert !@al.adjacent?(1, 2), "deleting edge removes adjacency"
+    end
+    should "allow node manipulation" do
+      @al.add('test node', 1)
+      assert_equal 'test node', @al.get_node_value(1), "node starts with assigned value"
+      @al.set_node_value(1, 'changed value')
+      assert_equal 'changed value', @al.get_node_value(1), "setting node value changes it"
+      assert_equal [], @al.neighbours(1), "node starts with no neighbours"
+      @al.add_edge(1, 2)
+      assert_equal [2], @al.neighbours(1), "adding an edge makes target a neighbour"
+      @al.delete(1)
+      assert_raise NoMethodError, "accessing a deleted node throws an error" do
+        @al.get_node_value(1)
+      end
+    end
+  end # AdjacencyList context
+end # TestAdjacencyList

data/test/test_datastructures.rb CHANGED

@@ -8,5 +8,9 @@ SimpleCov.formatter = SimpleCov::Formatter::MultiFormatter[
 SimpleCov.start
 require 'test/unit'
-require 'shoulda'
+begin; require 'turn/autorun'; rescue LoadError; end
+require 'shoulda-context'
 require 'datastructures'
+Turn.config.format = :pretty
+Turn.config.trace = 1

data/test/test_linked_list.rb ADDED

@@ -0,0 +1,96 @@
+require 'test_datastructures'
+class TestLinkedList < Test::Unit::TestCase
+  context "LinkedList" do
+    setup do
+      @ll = DataStructures::LinkedList.new
+    end
+    should "start empty" do
+      assert @ll.empty?, "should start empty"
+      assert_equal [].to_s, @ll.to_s, "string representation of empty list matches empty array"
+    end
+    should "be able to create with a single element" do
+      @ll = DataStructures::LinkedList.new('test')
+      assert_equal 1, @ll.size, "should have size 1 after adding 1"
+    end
+    should "be able to create with multiple elements" do
+      @ll = DataStructures::LinkedList.new(1,2,3,4)
+      assert_equal 4, @ll.size, "should have size 4 after adding 4"
+    end
+    should "allow enumeration with a block" do
+      a = [1, 2, 3, 4]
+      @ll = DataStructures::LinkedList.new(*a)
+      i = 0
+      @ll.each do |value|
+        assert_equal a[i], value, "enumeration elements at #{i} should match"
+        i += 1
+      end
+    end
+    should "allow assignment, insertion, retrieval and deletion" do
+      @ll << 'test'
+      assert_equal 'test', @ll.first.data, 'single element is first'
+      assert_equal 'test', @ll.last.data, 'single element is last'
+      @ll[1] = 'another test'
+      @ll[3] = 'yet another'
+      assert_equal 'another test', @ll[1], "indexed assignment and retrieval match"
+      assert_equal 0, @ll.index('test'), "correct index gets returned for pushed item"
+      assert_equal 1, @ll.index('another test'), "correct index gets returned for assigned item"
+      assert @ll[2].nil?, "assignment > highest index should fill in with nil"
+      @ll[2] = 'replacement'
+      assert_equal 'replacement', @ll[2], "filled-in nils can be replaced with values"
+      @ll.insert(1, 'inserted data')
+      assert_equal @ll[1], 'inserted data', "insertion set the value at index"
+      assert_equal @ll[2], 'another test', "insertion moves existing values along"
+      @ll.delete(2)
+      assert_equal 'replacement', @ll[2], 'deletion moves subsequent elements back one'
+    end
+    should "allow chained assignment" do
+      @ll.push(1).push(2).push(3).push(4)
+      assert_equal [1,2,3,4], @ll.to_a
+    end
+    should "act as a queue" do
+      a = [1, 2, 3, 4]
+      @ll.push(*a)
+      4.times do |i|
+        assert_equal a[i], @ll.shift, "#{i}th item in should be #{i}th in queue"
+      end
+    end
+    should "act as a stack" do
+      a = [1, 2, 3, 4]
+      @ll.push(*a)
+      4.times do |i|
+        assert_equal a[3 - i], @ll.pop, "#{i}th item in should be #{3 - i}th in stack"
+      end
+    end
+    should "act as an inverse stack" do
+      a = [1, 2, 3, 4]
+      @ll.unshift(*a)
+      4.times do |i|
+        assert_equal a[3 - i], @ll.shift, "#{i}th item in should be #{3 - i}th in inverse stack"
+      end
+    end
+    should "fail to find index for non-contained data" do
+      @ll.push(1,2,3,4)
+      assert @ll.index(5).nil?, "index should be nil when data not found"
+    end
+  end # LinkedList context
+end # TestLinkedList

data/test/test_stack.rb CHANGED

@@ -2,7 +2,7 @@ require 'test_datastructures'
 class TestStack < Test::Unit::TestCase
-  context "stack" do
+  context "Stack" do
     setup do
       @stack = DataStructures::Stack.new

data/test/test_tree.rb ADDED

@@ -0,0 +1,77 @@
+require 'test_datastructures'
+class TestTreeNode < Test::Unit::TestCase
+  context "TestTreeNode" do
+    setup do
+      @tree = DataStructures::TreeNode.new('grandmother')
+    end
+    should "be able to create a new instance" do
+      @tree = DataStructures::TreeNode.new('')
+    end
+    should "begin empty" do
+      assert @tree.empty?, "knows it's empty"
+      assert @tree.child_count == 0, "0 children in empty tree"
+      assert @tree.is_leaf?, "an empty tree is a leaf"
+    end
+    should "be able to add, recognise and remove children" do
+      child = DataStructures::TreeNode.new('child')
+      assert @tree.is_leaf?, "should start out as leaf"
+      @tree.add_child child
+      assert_equal @tree.child_count, 1, "child count should be 1"
+      assert !@tree.is_leaf?, "should no longer be leaf"
+      assert_equal @tree.children.first, child, "only child should be the one just added"
+      @tree.remove_child! child
+      assert_not_include @tree.children, child, "deleted child is forgotten by parent"
+    end
+    should "know its family tree" do
+      # make a happy family
+      mother = DataStructures::TreeNode.new('the mother')
+      daughter = DataStructures::TreeNode.new('the daughter')
+      son = DataStructures::TreeNode.new('the son')
+      mother.add_child daughter
+      mother.add_child son
+      uncle = DataStructures::TreeNode.new('the uncle')
+      cousin = DataStructures::TreeNode.new('the cousin')
+      uncle << cousin
+      @tree << mother
+      @tree << uncle
+      assert_equal @tree.siblings, nil, "grandmother has no siblings :("
+      [mother, daughter, son, uncle, cousin].each do |descendent|
+        assert_include @tree.descendents, descendent, "should recognise #{descendent.data} as descendent"
+      end
+      assert_not_include mother.siblings, mother, "mother not her own sibling"
+      assert_not_include son.siblings, son, "son not his own sibling"
+      assert_equal uncle, mother.siblings.first, "mother sees uncle as sibling"
+      assert_equal mother, uncle.siblings.first, "uncle sees mother as sibling"
+      assert_equal son, daughter.siblings.first, "daughter sees son as sibling"
+      assert_equal daughter, son.siblings.first, "son sees daughter as sibling"
+      assert_equal daughter.parent, mother, "daughter recogises her own mother"
+      assert_equal mother.parent, @tree, "mother knows grandmother is her mother"
+      assert_equal cousin.parent.parent, @tree, "cousin recognises her own grandmother"
+      assert son.is_leaf?
+      assert !mother.is_leaf?
+      assert !@tree.is_leaf?
+      assert @tree.is_root?
+      @tree.clear
+      assert @tree.empty?
+      assert @tree.is_leaf?
+    end
+  end # Tree context
+end # TestTree

metadata CHANGED

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: datastructures
 version: !ruby/object:Gem::Version
-  version: 0.2.1
+  version: 0.3.0
   prerelease:
 platform: ruby
 authors:
@@ -9,10 +9,26 @@ authors:
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2013-08-20 00:00:00.000000000 Z
+date: 2013-08-26 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rake
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: turn
   requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
@@ -83,17 +99,66 @@ extensions: []
 extra_rdoc_files: []
 files:
 - Rakefile
+- lib/datastructures/adjacency_list.rb
+- lib/datastructures/linked_list.rb
 - lib/datastructures/queue.rb
 - lib/datastructures/stack.rb
+- lib/datastructures/tree_node.rb
 - lib/datastructures/version.rb
 - lib/datastructures.rb
+- test/benchmarks.rb
+- test/coverage/assets/0.7.1/application.css
+- test/coverage/assets/0.7.1/application.js
+- test/coverage/assets/0.7.1/fancybox/blank.gif
+- test/coverage/assets/0.7.1/fancybox/fancy_close.png
+- test/coverage/assets/0.7.1/fancybox/fancy_loading.png
+- test/coverage/assets/0.7.1/fancybox/fancy_nav_left.png
+- test/coverage/assets/0.7.1/fancybox/fancy_nav_right.png
+- test/coverage/assets/0.7.1/fancybox/fancy_shadow_e.png
+- test/coverage/assets/0.7.1/fancybox/fancy_shadow_n.png
+- test/coverage/assets/0.7.1/fancybox/fancy_shadow_ne.png
+- test/coverage/assets/0.7.1/fancybox/fancy_shadow_nw.png
+- test/coverage/assets/0.7.1/fancybox/fancy_shadow_s.png
+- test/coverage/assets/0.7.1/fancybox/fancy_shadow_se.png
+- test/coverage/assets/0.7.1/fancybox/fancy_shadow_sw.png
+- test/coverage/assets/0.7.1/fancybox/fancy_shadow_w.png
+- test/coverage/assets/0.7.1/fancybox/fancy_title_left.png
+- test/coverage/assets/0.7.1/fancybox/fancy_title_main.png
+- test/coverage/assets/0.7.1/fancybox/fancy_title_over.png
+- test/coverage/assets/0.7.1/fancybox/fancy_title_right.png
+- test/coverage/assets/0.7.1/fancybox/fancybox-x.png
+- test/coverage/assets/0.7.1/fancybox/fancybox-y.png
+- test/coverage/assets/0.7.1/fancybox/fancybox.png
+- test/coverage/assets/0.7.1/favicon_green.png
+- test/coverage/assets/0.7.1/favicon_red.png
+- test/coverage/assets/0.7.1/favicon_yellow.png
+- test/coverage/assets/0.7.1/loading.gif
+- test/coverage/assets/0.7.1/magnify.png
+- test/coverage/assets/0.7.1/smoothness/images/ui-bg_flat_0_aaaaaa_40x100.png
+- test/coverage/assets/0.7.1/smoothness/images/ui-bg_flat_75_ffffff_40x100.png
+- test/coverage/assets/0.7.1/smoothness/images/ui-bg_glass_55_fbf9ee_1x400.png
+- test/coverage/assets/0.7.1/smoothness/images/ui-bg_glass_65_ffffff_1x400.png
+- test/coverage/assets/0.7.1/smoothness/images/ui-bg_glass_75_dadada_1x400.png
+- test/coverage/assets/0.7.1/smoothness/images/ui-bg_glass_75_e6e6e6_1x400.png
+- test/coverage/assets/0.7.1/smoothness/images/ui-bg_glass_95_fef1ec_1x400.png
+- test/coverage/assets/0.7.1/smoothness/images/ui-bg_highlight-soft_75_cccccc_1x100.png
+- test/coverage/assets/0.7.1/smoothness/images/ui-icons_222222_256x240.png
+- test/coverage/assets/0.7.1/smoothness/images/ui-icons_2e83ff_256x240.png
+- test/coverage/assets/0.7.1/smoothness/images/ui-icons_454545_256x240.png
+- test/coverage/assets/0.7.1/smoothness/images/ui-icons_888888_256x240.png
+- test/coverage/assets/0.7.1/smoothness/images/ui-icons_cd0a0a_256x240.png
+- test/coverage/index.html
+- test/test_adjacency_list.rb
 - test/test_datastructures.rb
+- test/test_linked_list.rb
 - test/test_queue.rb
 - test/test_stack.rb
+- test/test_tree.rb
 - README.md
 - LICENSE
 homepage: https://github.com/Blahah/datastructures
-licenses: []
+licenses:
+- MIT
 post_install_message:
 rdoc_options: []
 require_paths: