rubytree 0.4.0 → 0.4.1

data/ChangeLog

@@ -1,5 +1,17 @@
+2007-08-30  Anupam Sengupta  <anupamsg@gmail.com>
+
+	* test/test_binarytree.rb (TC_BinaryTreeTest::test_swap_children):
+	Added a test case for the children swap function.
+
+	* lib/tree/binarytree.rb (Tree::BinaryTreeNode::swap_children):
+	Added new function to swap the children. Other minor changes in
+	comments and code.
+
 2007-07-18  Anupam Sengupta  <anupamsg@gmail.com>
 
+	* lib/tree/binarytree.rb (Tree::BinaryTreeNode::leftChild /
+	rightChild): Minor cosmetic change on the parameter name.
+
 	* test/testbinarytree.rb (TC_BinaryTreeTest::test_isLeftChild):
 	Minor syntax correction.
 
@@ -21,7 +33,7 @@
 
 	* lib/tree/binarytree.rb: Added the binary tree implementation.
 
- 2007-07-17  Anupam Sengupta  <anupamsg@gmail.com>
+2007-07-17  Anupam Sengupta  <anupamsg@gmail.com>
 
 	* lib/tree.rb (Tree::TreeNode::parentage): Renamed 'ancestors'
 	method to 'parentage' to avoid clobbering Module.ancestors
@@ -42,7 +54,7 @@
 2007-06-24  Anupam Sengupta  <anupamsg@gmail.com>
 
 	* test/testtree.rb, lib/tree.rb: Added the each_leaf traversal method.
-v
+
 	* README: Replaced all occurrances of LICENSE with COPYING
 	and lowercased all instances of the word 'RubyTree'.
 

data/README

@@ -1,9 +1,9 @@
-= Rubytree 0.4.0
+= Rubytree 0.4.1
 
-  (c) 2006, 2007 Anupam Sengupta
+(c) 2006, 2007 Anupam Sengupta
   http://rubytree.rubyforge.org
 
-  Document Revision: $Revision: 1.9 $ by $Author: anupamsg $
+  Document Revision: $Revision: 1.10 $ by $Author: anupamsg $
 
 == License
 
@@ -21,9 +21,9 @@ primary objects and drive the structure.
 Rubytree is an open source project and is hosted at
 http://rubyforge.org/projects/rubytree
 
-The project home page is: http://rubytree.rubyforge.org
+The project home page is http://rubytree.rubyforge.org
 
-Rubytree can be downloaded as a Ruby Gem or as a tar/zip file from:
+Rubytree can be downloaded as a Rubygem or as a tar/zip file from:
 
 http://rubyforge.org/frs/?group_id=1215&release_id=8817
 
@@ -66,25 +66,25 @@ the text mode ri documentation:
 
 Documentation on the web is available at:
 
-http://rubytree.rubyforge.org/rdoc/
+http://rubytree.rubyforge.org/rdoc
 
 == Example
 
- The following code-snippet implements this tree structure:
-
-                   +------------+
-                   |    ROOT    |
-                   +-----+------+
-           +-------------+------------+
-           |                          |
-   +-------+-------+          +-------+-------+
-   |  CHILD 1      |          |  CHILD 2      |
-   +-------+-------+          +---------------+
-           |
-           |
-   +-------+-------+
-   | GRANDCHILD 1  |
-   +---------------+
+The following code-snippet implements this tree structure:
+
+                 +------------+
+                 |    ROOT    |
+                 +-----+------+
+         +-------------+------------+
+         |                          |
+ +-------+-------+          +-------+-------+
+ |  CHILD 1      |          |  CHILD 2      |
+ +-------+-------+          +---------------+
+         |
+         |
+ +-------+-------+
+ | GRANDCHILD 1  |
+ +---------------+
 
  require 'tree'
 
@@ -132,7 +132,7 @@ are permitted provided that the following conditions are met:
   be used to endorse or promote products derived from this software without
   specific prior written permission.
 
-  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR

data/Rakefile

@@ -1,6 +1,6 @@
 # Rakefile
 #
-# $Revision: 1.18 $ by $Author: anupamsg $
+# $Revision: 1.21 $ by $Author: anupamsg $
 # $Name:  $
 #
 # Copyright (c) 2006, 2007 Anupam Sengupta
@@ -39,10 +39,13 @@ require 'rake/gempackagetask'
 require 'rake/testtask'
 require 'rake/rdoctask'
 
+require './lib/tree.rb'         # To read the version information.
+
 desc "Default Task"
 task :default => :gem
 
-PKG_VERSION = '0.4.0'
+PKG_VERSION = Tree::VERSION
+
 PKG_FILES = FileList[
                      '[A-Z]*',
                      'lib/**/*.rb',
@@ -85,15 +88,16 @@ Rake::TestTask.new do |t|
   t.verbose = true
 end
 
-Rake::RDocTask.new do |rd|
+Rake::RDocTask.new(:rdoc) do |rd|
   rd.rdoc_files.include("README", "COPYING", "ChangeLog", "lib/**/*.rb")
   rd.title = "Rubytree Documentation"
-end
 
-Rake::RDocTask.new(:rdoc_www) do |rd|
-  rd.rdoc_files.include("README", "COPYING", "ChangeLog", "lib/**/*.rb")
-  rd.title = "Rubytree Documentation"
-  rd.template = "rubytree-template.rb"
+  # Use the template only if it is present, otherwise, the standard template is
+  # used.
+  template = "../allison/allison.rb"
+  rd.template = template if File.file?(template)
+
+  rd.options << '--line-numbers' << '--inline-source'
 end
 
 # Optional TAGS Task.
@@ -107,6 +111,16 @@ begin
 end
 
 # $Log: Rakefile,v $
+# Revision 1.21  2007/07/21 05:14:43  anupamsg
+# Added a VERSION constant to the Tree module,
+# and using the same in the Rakefile.
+#
+# Revision 1.20  2007/07/21 03:24:25  anupamsg
+# Minor edits to parameter names. User visible functionality does not change.
+#
+# Revision 1.19  2007/07/19 02:16:01  anupamsg
+# Release 0.4.0 (and minor fix in Rakefile).
+#
 # Revision 1.18  2007/07/18 20:15:06  anupamsg
 # Added two predicate methods in BinaryTreeNode to determine whether a node
 # is a left or a right node.

data/lib/tree.rb

@@ -1,6 +1,6 @@
 # tree.rb
 #
-# $Revision: 1.16 $ by $Author: anupamsg $
+# $Revision: 1.18 $ by $Author: anupamsg $
 # $Name:  $
 #
 # = tree.rb - Generic Multi-way Tree implementation
@@ -47,6 +47,8 @@
 # This module mixes in the Enumerable module.
 module Tree
 
+  VERSION = '0.4.1'
+
   # == TreeNode Class Description
   #
   # The node class for the tree representation. the nodes are named and have a
@@ -160,7 +162,7 @@ module Tree
       @parent = parent
     end
 
-    # Convenience synonym for Tree#add method.  This method allows a convenient
+    # Convenience synonym for TreeNode#add method.  This method allows a convenient
     # method to add children hierarchies in the tree.
     #
     # E.g. root << child << grand_child
@@ -273,16 +275,16 @@ module Tree
 
     # Returns the requested node from the set of immediate children.
     #
-    # If the key is _numeric_, then the in-sequence array of children is
-    # accessed (see Tree#children).  If the key is not _numeric_, then it is
-    # assumed to be the *name* of the child node to be returned.
-    def [](key)
-      raise "Key needs to be provided" if key == nil
-
-      if key.kind_of?(Integer)
-        @children[key]
+    # If the parameter is _numeric_, then the in-sequence array of children is
+    # accessed (see Tree#children).  If the parameter is not _numeric_, then it
+    # is assumed to be the *name* of the child node to be returned.
+    def [](name_or_index)
+      raise "Name_or_index needs to be provided" if name_or_index == nil
+
+      if name_or_index.kind_of?(Integer)
+        @children[name_or_index]
       else
-        @childrenHash[key]
+        @childrenHash[name_or_index]
       end
     end
 
@@ -308,8 +310,6 @@ module Tree
         print(isLastSibling? ? "+" : "|")
         print "---"
         print(hasChildren? ? "+" : ">")
-
-#        print((' ' * level)  + "|--" + (hasChildren? ? "+" : ">"))
       end
 
       puts " #{name}"
@@ -461,6 +461,13 @@ module Tree
 end
 
 # $Log: tree.rb,v $
+# Revision 1.18  2007/07/21 05:14:44  anupamsg
+# Added a VERSION constant to the Tree module,
+# and using the same in the Rakefile.
+#
+# Revision 1.17  2007/07/21 03:24:25  anupamsg
+# Minor edits to parameter names. User visible functionality does not change.
+#
 # Revision 1.16  2007/07/18 23:38:55  anupamsg
 # Minor updates to tree.rb
 #

data/lib/tree/binarytree.rb

@@ -1,114 +1,128 @@
-# binarytree.rb
-#
-# $Revision: 1.2 $ by $Author: anupamsg $
-# $Name:  $
-#
-# = binarytree.rb - Binary Tree implementation
-#
-# Provides a generic tree data structure with ability to
-# store keyed node elements in the tree. The implementation
-# mixes in the Enumerable module.
-#
-# Author:: Anupam Sengupta (anupamsg@gmail.com)
-#
-
-# Copyright (c) 2007 Anupam Sengupta
-#
-# All rights reserved.
-#
-# Redistribution and use in source and binary forms, with or without modification,
-# are permitted provided that the following conditions are met:
-#
-# - Redistributions of source code must retain the above copyright notice, this
-#   list of conditions and the following disclaimer.
-#
-# - Redistributions in binary form must reproduce the above copyright notice, this
-#   list of conditions and the following disclaimer in the documentation and/or
-#   other materials provided with the distribution.
-#
-# - Neither the name of the organization nor the names of its contributors may
-#   be used to endorse or promote products derived from this software without
-#   specific prior written permission.
-#
-#   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
-# ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
-# ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-#
-
-require 'tree'
-
-module Tree
-
-  # Provides a Binary tree implementation. This tree node allows only two child
-  # nodes (left and right childs). It also provides direct access to the left
-  # and right children, including assignment to the same.
-  class BinaryTreeNode < TreeNode
-
-    # Adds the specified child node to the receiver node.  The child node's
-    # parent is set to be the receiver.  The child nodes are added in the order
-    # of addition, i.e., the first child added becomes the left node, and the
-    # second child will be the second node.
-    # If only one child is present, then this will be the left child.
-    def add(child)
-      raise "Already has two child nodes" if @children.size == 2
-
-      super(child)
-    end
-
-    # Returns the left child node. Note that
-    # left Child == first Child
-    def leftChild
-      children.first
-    end
-
-    # Returns the right child node. Note that
-    # right child == last child unless there is only one child.
-    def rightChild
-      children.last
-    end
-
-    # Sets the left child. If a previous child existed, it is replaced.
-    def leftChild=(leftChild)
-      @children[0] = leftChild
-      @childrenHash[leftChild.name] = leftChild
-    end
-
-    # Sets the right child. If a previous child existed, it is replaced.
-    def rightChild=(rightChild)
-      @children[1] = rightChild
-      @childrenHash[rightChild.name] = rightChild
-    end
-
-    # Returns true if this is the left child of its parent. Always returns false
-    # if this is the root node.
-    def isLeftChild?
-      return nil if isRoot?
-      self == parent.leftChild
-    end
-
-    # Returns true if this is the right child of its parent. Always returns false
-    # if this is the root node.
-    def isRightChild?
-      return nil if isRoot?
-      self == parent.rightChild
-    end
-
-  end
-
-end
-
+# binarytree.rb
+#
+# $Revision: 1.4 $ by $Author: anupamsg $
+# $Name:  $
+#
+# = binarytree.rb - Binary Tree implementation
+#
+# Provides a generic tree data structure with ability to
+# store keyed node elements in the tree. The implementation
+# mixes in the Enumerable module.
+#
+# Author:: Anupam Sengupta (anupamsg@gmail.com)
+#
+
+# Copyright (c) 2007 Anupam Sengupta
+#
+# All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without modification,
+# are permitted provided that the following conditions are met:
+#
+# - Redistributions of source code must retain the above copyright notice, this
+#   list of conditions and the following disclaimer.
+#
+# - Redistributions in binary form must reproduce the above copyright notice, this
+#   list of conditions and the following disclaimer in the documentation and/or
+#   other materials provided with the distribution.
+#
+# - Neither the name of the organization nor the names of its contributors may
+#   be used to endorse or promote products derived from this software without
+#   specific prior written permission.
+#
+#   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+# ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+# ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+#
+
+require 'tree'
+
+module Tree
+
+  # Provides a Binary tree implementation. This tree node allows only two child
+  # nodes (left and right childs). It also provides direct access to the left
+  # and right children, including assignment to the same.
+  class BinaryTreeNode < TreeNode
+
+    # Adds the specified child node to the receiver node.  The child node's
+    # parent is set to be the receiver.  The child nodes are added in the order
+    # of addition, i.e., the first child added becomes the left node, and the
+    # second child will be the second node.
+    # If only one child is present, then this will be the left child.
+    def add(child)
+      raise "Already has two child nodes" if @children.size == 2
+
+      super(child)
+    end
+
+    # Returns the left child node. Note that
+    # left Child == first Child
+    def leftChild
+      children.first
+    end
+
+    # Returns the right child node. Note that
+    # right child == last child unless there is only one child.
+    # Returns nil if the right child does not exist.
+    def rightChild
+      children[1]
+    end
+
+    # Sets the left child. If a previous child existed, it is replaced.
+    def leftChild=(child)
+      @children[0] = child
+      @childrenHash[child.name] = child if child # Assign the name mapping
+    end
+
+    # Sets the right child. If a previous child existed, it is replaced.
+    def rightChild=(child)
+      @children[1] = child
+      @childrenHash[child.name] = child if child # Assign the name mapping
+    end
+
+    # Returns true if this is the left child of its parent. Always returns false
+    # if this is the root node.
+    def isLeftChild?
+      return nil if isRoot?
+      self == parent.leftChild
+    end
+
+    # Returns true if this is the right child of its parent. Always returns false
+    # if this is the root node.
+    def isRightChild?
+      return nil if isRoot?
+      self == parent.rightChild
+    end
+
+    # Swaps the left and right childs
+    def swap_children
+      tempChild = leftChild
+      self.leftChild= rightChild
+      self.rightChild= tempChild
+    end
+  end
+
+end
+
 # $Log: binarytree.rb,v $
+# Revision 1.4  2007/08/30 22:08:58  anupamsg
+# Added a new swap_children method for Binary Tree. Also added minor
+# documentation and test updates.
+#
+# Revision 1.3  2007/07/21 03:24:25  anupamsg
+# Minor edits to parameter names. User visible functionality does not change.
+#
 # Revision 1.2  2007/07/18 20:15:06  anupamsg
 # Added two predicate methods in BinaryTreeNode to determine whether a node
 # is a left or a right node.
-#
-# Revision 1.1  2007/07/18 19:33:27  anupamsg
-# Added a new binary tree implementation.
-#
+#
+# Revision 1.1  2007/07/18 19:33:27  anupamsg
+# Added a new binary tree implementation.
+#

data/test/{testbinarytree.rb → test_binarytree.rb}

@@ -2,7 +2,7 @@
 
 # testtree.rb
 #
-# $Revision: 1.4 $ by $Author: anupamsg $
+# $Revision: 1.2 $ by $Author: anupamsg $
 # $Name:  $
 #
 # Copyright (c) 2006, 2007 Anupam Sengupta
@@ -46,7 +46,7 @@ class TC_BinaryTreeTest < Test::Unit::TestCase
     @root = Tree::BinaryTreeNode.new("ROOT", "Root Node")
 
     @left_child1  = Tree::BinaryTreeNode.new("A Child at Left", "Child Node @ left")
-    @right_child1 = Tree::BinaryTreeNode.new("B Child at right", "Child Node @ right")
+    @right_child1 = Tree::BinaryTreeNode.new("B Child at Right", "Child Node @ right")
 
   end
 
@@ -99,6 +99,13 @@ class TC_BinaryTreeTest < Test::Unit::TestCase
 
     @root.leftChild = Tree::BinaryTreeNode.new("New Left Child")
     assert_equal("New Left Child", @root.leftChild.name, "The left child should now be the new child")
+    assert_equal("B Child at Right", @root.lastChild.name, "The last child should now be the right child")
+
+    # Now set the left child as nil, and retest
+    @root.leftChild = nil
+    assert_nil(@root.leftChild, "The left child should now be nil")
+    assert_nil(@root.firstChild, "The first child is now nil")
+    assert_equal("B Child at Right", @root.lastChild.name, "The last child should now be the right child")
   end
 
   def test_right_assignment
@@ -108,6 +115,14 @@ class TC_BinaryTreeTest < Test::Unit::TestCase
 
     @root.rightChild = Tree::BinaryTreeNode.new("New Right Child")
     assert_equal("New Right Child", @root.rightChild.name, "The right child should now be the new child")
+    assert_equal("A Child at Left", @root.firstChild.name, "The first child should now be the left child")
+    assert_equal("New Right Child", @root.lastChild.name, "The last child should now be the right child")
+
+    # Now set the right child as nil, and retest
+    @root.rightChild = nil
+    assert_nil(@root.rightChild, "The right child should now be nil")
+    assert_equal("A Child at Left", @root.firstChild.name, "The first child should now be the left child")
+    assert_nil(@root.lastChild, "The first child is now nil")
   end
 
   def test_isLeftChild?
@@ -117,6 +132,10 @@ class TC_BinaryTreeTest < Test::Unit::TestCase
     assert(@left_child1.isLeftChild?, "left_child1 should be the left child")
     assert(!@right_child1.isLeftChild?, "left_child1 should be the left child")
 
+    # Now set the right child as nil, and retest
+    @root.rightChild = nil
+    assert(@left_child1.isLeftChild?, "left_child1 should be the left child")
+
     assert(!@root.isLeftChild?, "Root is neither left child nor right")
   end
 
@@ -126,11 +145,39 @@ class TC_BinaryTreeTest < Test::Unit::TestCase
 
     assert(@right_child1.isRightChild?, "right_child1 should be the right child")
     assert(!@left_child1.isRightChild?, "right_child1 should be the right child")
+
+    # Now set the left child as nil, and retest
+    @root.leftChild = nil
+    assert(@right_child1.isRightChild?, "right_child1 should be the right child")
     assert(!@root.isRightChild?, "Root is neither left child nor right")
   end
+
+  def test_swap_children
+    @root << @left_child1
+    @root << @right_child1
+
+    assert(@right_child1.isRightChild?, "right_child1 should be the right child")
+    assert(!@left_child1.isRightChild?, "right_child1 should be the right child")
+
+    @root.swap_children
+    assert(@right_child1.isLeftChild?, "right_child1 should now be the left child")
+    assert(@left_child1.isRightChild?, "left_child1 should now be the right child")
+    assert_equal(@right_child1, @root.firstChild, "right_child1 should now be the first child")
+    assert_equal(@left_child1, @root.lastChild, "left_child1 should now be the last child")
+    assert_equal(@right_child1, @root[0], "right_child1 should now be the first child")
+    assert_equal(@left_child1, @root[1], "left_child1 should now be the last child")
+
+  end
 end
 
-# $Log: testbinarytree.rb,v $
+# $Log: test_binarytree.rb,v $
+# Revision 1.2  2007/08/30 22:06:13  anupamsg
+# Added a new swap_children method for the Binary Tree class.
+# Also made minor documentation updates and test additions.
+#
+# Revision 1.1  2007/07/21 04:52:37  anupamsg
+# Renamed the test files.
+#
 # Revision 1.4  2007/07/19 02:03:57  anupamsg
 # Minor syntax correction.
 #

data/test/{testtree.rb → test_tree.rb}

@@ -2,7 +2,7 @@
 
 # testtree.rb
 #
-# $Revision: 1.13 $ by $Author: anupamsg $
+# $Revision: 1.1 $ by $Author: anupamsg $
 # $Name:  $
 #
 # Copyright (c) 2006, 2007 Anupam Sengupta
@@ -459,7 +459,10 @@ end
 
 __END__
 
-# $Log: testtree.rb,v $
+# $Log: test_tree.rb,v $
+# Revision 1.1  2007/07/21 04:52:38  anupamsg
+# Renamed the test files.
+#
 # Revision 1.13  2007/07/18 22:11:50  anupamsg
 # Added depth and breadth methods for the TreeNode.
 #

metadata

@@ -1,10 +1,10 @@
 --- !ruby/object:Gem::Specification 
-rubygems_version: 0.9.4
+rubygems_version: 0.9.2
 specification_version: 1
 name: rubytree
 version: !ruby/object:Gem::Version 
-  version: 0.4.0
-date: 2007-07-18 00:00:00 -07:00
+  version: 0.4.1
+date: 2007-08-30 00:00:00 -07:00
 summary: Ruby implementation of the Tree data structure.
 require_paths: 
 - lib
@@ -31,17 +31,18 @@ authors:
 files: 
 - ChangeLog
 - COPYING
+- lib
 - Rakefile
 - README
-- TAGS
+- test
 - lib/tree/binarytree.rb
 - lib/tree.rb
 - test/person.rb
-- test/testbinarytree.rb
-- test/testtree.rb
+- test/test_binarytree.rb
+- test/test_tree.rb
 test_files: 
-- test/testbinarytree.rb
-- test/testtree.rb
+- test/test_binarytree.rb
+- test/test_tree.rb
 rdoc_options: []
 
 extra_rdoc_files: 

data/TAGS

@@ -1,123 +0,0 @@
-
-lib/tree.rb,2410
-module Tree::Tree
48,2020
-  class TreeNode::Tree::TreeNode
103,3802
-    attr_reader :content, :name, :parent::Tree::TreeNode#content
106,3845
-    attr_reader :content, :name, :parent::Tree::TreeNode#name
106,3845
-    attr_reader :content, :name, :parent::Tree::TreeNode#parent
106,3845
-    attr_writer :content::Tree::TreeNode#content
107,3886
-    def initialize::Tree::TreeNode#Tree::TreeNode.new
118,4158
-    def to_s::Tree::TreeNode#to_s
132,4447
-    def parentage::Tree::TreeNode#parentage
144,4836
-    def parent=::Tree::TreeNode#parent=
159,5172
-    def <<::Tree::TreeNode#<<
167,5408
-    def add::Tree::TreeNode#add
174,5667
-    def remove!::Tree::TreeNode#remove!
189,6080
-    def removeFromParent!::Tree::TreeNode#removeFromParent!
198,6356
-    def removeAll!::Tree::TreeNode#removeAll!
203,6478
-    def hasContent?::Tree::TreeNode#hasContent?
213,6692
-    def setAsRoot!::Tree::TreeNode#setAsRoot!
218,6800
-    def isRoot?::Tree::TreeNode#isRoot?
224,6966
-    def hasChildren?::Tree::TreeNode#hasChildren?
229,7082
-    def isLeaf?::Tree::TreeNode#isLeaf?
235,7220
-    def children::Tree::TreeNode#children
241,7385
-    def firstChild::Tree::TreeNode#firstChild
251,7613
-    def lastChild::Tree::TreeNode#lastChild
257,7754
-    def each::Tree::TreeNode#each
263,7948
-    def each_leaf::Tree::TreeNode#each_leaf
270,8204
-    def []::Tree::TreeNode#[]
279,8570
-    def size::Tree::TreeNode#size
291,8848
-    def length::Tree::TreeNode#length
296,8968
-    def printTree::Tree::TreeNode#printTree
301,9057
-    def root::Tree::TreeNode#root
321,9553
-    def firstSibling::Tree::TreeNode#firstSibling
329,9752
-    def isFirstSibling?::Tree::TreeNode#isFirstSibling?
338,9920
-    def lastSibling::Tree::TreeNode#lastSibling
344,10071
-    def isLastSibling?::Tree::TreeNode#isLastSibling?
353,10234
-    def siblings::Tree::TreeNode#siblings
360,10453
-    def isOnlyChild?::Tree::TreeNode#isOnlyChild?
374,10826
-    def nextSibling::Tree::TreeNode#nextSibling
380,10989
-    def previousSibling::Tree::TreeNode#previousSibling
388,11221
-    def <=>::Tree::TreeNode#<=>
397,11486
-    def freezeTree!::Tree::TreeNode#freezeTree!
403,11628
-    def createDumpRep::Tree::TreeNode#createDumpRep
408,11760
-    def _dump::Tree::TreeNode#_dump
414,11940
-    def TreeNode.loadDumpRep::Tree::TreeNode.loadDumpRep
421,12130
-    def TreeNode._load::Tree::TreeNode._load
439,12707
-
-test/person.rb,322
-class Person::Person
37,1683
-    attr_reader :first, :last::Person#first
38,1700
-    attr_reader :first, :last::Person#last
38,1700
-    attr_writer :first, :last::Person#first
39,1730
-    attr_writer :first, :last::Person#last
39,1730
-    def initialize::Person#Person.new
40,1760
-    def to_s::Person#to_s
45,1853
-
-test/testtree.rb,1847
-class TC_TreeTest::TC_TreeTest
43,1728
-  def setup::TC_TreeTest#setup
45,1781
-  def loadChildren::TC_TreeTest#loadChildren
73,2687
-  def teardown::TC_TreeTest#teardown
79,2783
-  def test_root_setup::TC_TreeTest#test_root_setup
83,2828
-  def test_root::TC_TreeTest#test_root
97,3464
-  def test_firstSibling::TC_TreeTest#test_firstSibling
105,3691
-  def test_isFirstSibling::TC_TreeTest#test_isFirstSibling
115,4169
-  def test_isLastSibling::TC_TreeTest#test_isLastSibling
125,4577
-  def test_lastSibling::TC_TreeTest#test_lastSibling
135,4973
-  def test_siblings::TC_TreeTest#test_siblings
145,5442
-  def test_isOnlyChild?::TC_TreeTest#test_isOnlyChild?
164,6029
-  def test_nextSibling::TC_TreeTest#test_nextSibling
173,6341
-  def test_previousSibling::TC_TreeTest#test_previousSibling
182,6707
-  def test_add::TC_TreeTest#test_add
191,7091
-  def test_remove::TC_TreeTest#test_remove
210,7573
-  def test_removeAll::TC_TreeTest#test_removeAll
237,8283
-  def test_removeFromParent::TC_TreeTest#test_removeFromParent
246,8527
-  def test_children::TC_TreeTest#test_children
263,9157
-  def test_firstChild::TC_TreeTest#test_firstChild
289,10018
-  def test_lastChild::TC_TreeTest#test_lastChild
298,10293
-  def test_find::TC_TreeTest#test_find
307,10558
-  def test_parentage::TC_TreeTest#test_parentage
321,11093
-  def test_each::TC_TreeTest#test_each
329,11377
-  def test_each_leaf::TC_TreeTest#test_each_leaf
346,11999
-  def test_parent::TC_TreeTest#test_parent
360,12469
-  def test_indexed_access::TC_TreeTest#test_indexed_access
369,12850
-  def test_printTree::TC_TreeTest#test_printTree
377,13120
-  def test_dump::TC_TreeTest#test_dump
383,13191
-  def test_collect::TC_TreeTest#test_collect
399,13728
-  def test_freezeTree::TC_TreeTest#test_freezeTree
408,13947
-  def test_content::TC_TreeTest#test_content
417,14211
-
-test/testtree.rb.~1.11.~,1847
-class TC_TreeTest::TC_TreeTest
43,1728
-  def setup::TC_TreeTest#setup
45,1781
-  def loadChildren::TC_TreeTest#loadChildren
73,2687
-  def teardown::TC_TreeTest#teardown
79,2783
-  def test_root_setup::TC_TreeTest#test_root_setup
83,2828
-  def test_root::TC_TreeTest#test_root
97,3464
-  def test_firstSibling::TC_TreeTest#test_firstSibling
105,3691
-  def test_isFirstSibling::TC_TreeTest#test_isFirstSibling
115,4169
-  def test_isLastSibling::TC_TreeTest#test_isLastSibling
125,4577
-  def test_lastSibling::TC_TreeTest#test_lastSibling
135,4973
-  def test_siblings::TC_TreeTest#test_siblings
145,5442
-  def test_isOnlyChild?::TC_TreeTest#test_isOnlyChild?
164,6029
-  def test_nextSibling::TC_TreeTest#test_nextSibling
173,6341
-  def test_previousSibling::TC_TreeTest#test_previousSibling
182,6707
-  def test_add::TC_TreeTest#test_add
191,7091
-  def test_remove::TC_TreeTest#test_remove
210,7573
-  def test_removeAll::TC_TreeTest#test_removeAll
237,8283
-  def test_removeFromParent::TC_TreeTest#test_removeFromParent
246,8527
-  def test_children::TC_TreeTest#test_children
263,9157
-  def test_firstChild::TC_TreeTest#test_firstChild
289,10018
-  def test_lastChild::TC_TreeTest#test_lastChild
298,10293
-  def test_find::TC_TreeTest#test_find
307,10558
-  def test_ancestors::TC_TreeTest#test_ancestors
321,11093
-  def test_each::TC_TreeTest#test_each
329,11377
-  def test_each_leaf::TC_TreeTest#test_each_leaf
346,11999
-  def test_parent::TC_TreeTest#test_parent
360,12469
-  def test_indexed_access::TC_TreeTest#test_indexed_access
369,12850
-  def test_printTree::TC_TreeTest#test_printTree
377,13120
-  def test_dump::TC_TreeTest#test_dump
383,13191
-  def test_collect::TC_TreeTest#test_collect
399,13728
-  def test_freezeTree::TC_TreeTest#test_freezeTree
408,13947
-  def test_content::TC_TreeTest#test_content
417,14211