rubytree 0.9.5pre6 → 0.9.5pre7

data/test/test_subclassed_node.rb

@@ -64,6 +64,11 @@ module TestTree
 
     end
 
+    def test_subclassed_detached_copy_is_same_class
+      root = MyNode.new("Root")
+      assert_equal(MyNode, root.detached_copy.class)
+    end
+
   end
 end
 

data/test/test_tree.rb

@@ -1018,6 +1018,9 @@ module TestTree
       end
 
       assert_equal(2, @child4.node_depth, "Child 4 should have depth 2")
+
+      @root << @child5 << @child3
+      assert_equal(3, @child4.node_depth, "Child 4 should have depth 3 after Child 5 inserted above")
     end
 
     # Test the level method.  Since this is an alias of node_depth, we just test for equivalence
@@ -1657,6 +1660,76 @@ module TestTree
       assert_nil(root1["2"]["4"])                    # This is on the old tree
 
     end
+
+    # Test the path_as_string method.
+    def test_path_as_string
+      j = Tree::TreeNode.new("j")
+      f = Tree::TreeNode.new("f")
+      k = Tree::TreeNode.new("k")
+      a = Tree::TreeNode.new("a")
+      d = Tree::TreeNode.new("d")
+      h = Tree::TreeNode.new("h")
+      z = Tree::TreeNode.new("z")
+      p = Tree::TreeNode.new("p")
+      t = Tree::TreeNode.new("t")
+      e = Tree::TreeNode.new("e")
+
+      # Create the following Tree
+      #        j         <-- level 0 (Root)
+      #      /   \
+      #     f      k     <-- level 1
+      #   /   \      \
+      #  a     h      z  <-- level 2
+      #   \   / \
+      #    d p   t       <-- level 3
+      #   /
+      #  e               <-- level 4
+      j << f << a << d << e
+      f << h
+      h << p
+      h << t
+      j << k << z
+
+      assert_equal(t.path_as_string(), 'j=>f=>h=>t') # Check the default sep.
+
+      assert_equal(t.path_as_string(' => '), 'j => f => h => t')
+      assert_equal(z.path_as_string(' => '), 'j => k => z')
+      assert_equal(a.path_as_string(' => '), 'j => f => a')
+    end
+
+    # Test the path_as_array method.
+    def test_path_as_array
+      j = Tree::TreeNode.new("j")
+      f = Tree::TreeNode.new("f")
+      k = Tree::TreeNode.new("k")
+      a = Tree::TreeNode.new("a")
+      d = Tree::TreeNode.new("d")
+      h = Tree::TreeNode.new("h")
+      z = Tree::TreeNode.new("z")
+      p = Tree::TreeNode.new("p")
+      t = Tree::TreeNode.new("t")
+      e = Tree::TreeNode.new("e")
+
+      # Create the following Tree
+      #        j         <-- level 0 (Root)
+      #      /   \
+      #     f      k     <-- level 1
+      #   /   \      \
+      #  a     h      z  <-- level 2
+      #   \   / \
+      #    d p   t       <-- level 3
+      #   /
+      #  e               <-- level 4
+      j << f << a << d << e
+      f << h
+      h << p
+      h << t
+      j << k << z
+
+      assert_equal(e.path_as_array, ['j', 'f', 'a', 'd', 'e'])
+      assert_equal(p.path_as_array, ['j', 'f' , 'h', 'p'])
+      assert_equal(k.path_as_array, ['j', 'k'])
+    end
   end
 end
 

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rubytree
 version: !ruby/object:Gem::Version
-  version: 0.9.5pre6
+  version: 0.9.5pre7
 platform: ruby
 authors:
 - Anupam Sengupta
@@ -16,14 +16,14 @@ dependencies:
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '0.1'
+        version: '0.2'
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '0.1'
+        version: '0.2'
 - !ruby/object:Gem::Dependency
   name: json
   requirement: !ruby/object:Gem::Requirement
@@ -139,6 +139,7 @@ files:
 - TAGS
 - TODO.org
 - examples/example_basic.rb
+- gem_graph.png
 - lib/rubytree.rb
 - lib/tree.rb
 - lib/tree/binarytree.rb
@@ -147,9 +148,12 @@ files:
 - lib/tree/utils/hash_converter.rb
 - lib/tree/utils/json_converter.rb
 - lib/tree/utils/metrics_methods.rb
+- lib/tree/utils/path_methods.rb
 - lib/tree/utils/tree_merge_handler.rb
 - lib/tree/utils/utils.rb
 - lib/tree/version.rb
+- rubytree.gemspec
+- setup.rb
 - test/run_test.rb
 - test/test_binarytree.rb
 - test/test_rubytree_require.rb
@@ -186,7 +190,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: 1.3.1
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.4.3
+rubygems_version: 2.4.6
 signing_key: 
 specification_version: 4
 summary: A generic tree data structure.