rubytree 0.4.1 → 0.4.2

data/ChangeLog

@@ -1,5 +1,24 @@
+2007-10-01  Anupam Sengupta  <anupamsg@gmail.com>
+
+	* Rakefile: Added an optional task for rcov code coverage.
+	  Added a dependency for rake in the Gem Specification.
+
+	* test/test_binarytree.rb: Removed the unnecessary dependency on "Person" class.
+
+	* test/test_tree.rb: Removed dependency on the redundant "Person" class.
+	(TC_TreeTest::test_comparator): Added a new test for the spaceship operator.
+	(TC_TreeTest::test_hasContent): Added tests for hasContent? and length methods.
+
 2007-08-30  Anupam Sengupta  <anupamsg@gmail.com>
 
+	* test/test_tree.rb (TC_TreeTest::test_preordered_each, TC_TreeTest::test_breadth_each, TC_TreeTest::test_detached_copy):
+	Added new tests for the new functions added to tree.rb.
+
+	* lib/tree.rb (Tree::TreeNode::detached_copy, Tree::TreeNode::preordered_each, Tree::TreeNode::breadth_each):
+	Added new functions for returning a detached copy of the node and
+	for performing breadth first traversal. Also added the pre-ordered
+	traversal function which is an alias of the existing 'each' method.
+
 	* test/test_binarytree.rb (TC_BinaryTreeTest::test_swap_children):
 	Added a test case for the children swap function.
 

data/README

@@ -1,9 +1,9 @@
-= Rubytree 0.4.1
+= Rubytree 0.4.2
 
 (c) 2006, 2007 Anupam Sengupta
   http://rubytree.rubyforge.org
 
-  Document Revision: $Revision: 1.10 $ by $Author: anupamsg $
+  Document Revision: $Revision: 1.11 $ by $Author: anupamsg $
 
 == License
 

data/Rakefile

@@ -1,6 +1,6 @@
 # Rakefile
 #
-# $Revision: 1.21 $ by $Author: anupamsg $
+# $Revision: 1.23 $ by $Author: anupamsg $
 # $Name:  $
 #
 # Copyright (c) 2006, 2007 Anupam Sengupta
@@ -61,6 +61,7 @@ spec = Gem::Specification.new do |s|
   s.homepage = "http://rubytree.rubyforge.org/"
   s.rubyforge_project = 'rubytree'
   s.summary = "Ruby implementation of the Tree data structure."
+  s.add_dependency('rake', '>= 0.7.2')
 
   s.description = <<-END
     Provides a generic tree data-structure with ability to
@@ -110,7 +111,18 @@ begin
   rescue LoadError
 end
 
-# $Log: Rakefile,v $
+# Optional RCOV Task
+# Needs http://eigenclass.org/hiki/rcov
+begin
+  require 'rcov/rcovtask'
+  Rcov::RcovTask.new do |t|
+    t.test_files = FileList['test/test*.rb']
+   # t.verbose = true     # uncomment to see the executed commands
+  end
+  rescue LoadError
+end
+
+#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.

data/TAGS

@@ -0,0 +1,120 @@
+
+lib/tree/binarytree.rb,572
+module Tree::Tree
47,1886
+  class BinaryTreeNode::Tree::BinaryTreeNode
52,2117
+    def add::Tree::BinaryTreeNode#add
59,2502
+    def leftChild::Tree::BinaryTreeNode#leftChild
67,2705
+    def rightChild::Tree::BinaryTreeNode#rightChild
74,2917
+    def leftChild=::Tree::BinaryTreeNode#leftChild=
79,3021
+    def rightChild=::Tree::BinaryTreeNode#rightChild=
85,3231
+    def isLeftChild?::Tree::BinaryTreeNode#isLeftChild?
92,3498
+    def isRightChild?::Tree::BinaryTreeNode#isRightChild?
99,3702
+    def swap_children::Tree::BinaryTreeNode#swap_children
105,3831
+
+lib/tree.rb,2700
+module Tree::Tree
48,2030
+  class TreeNode::Tree::TreeNode
105,3833
+    attr_reader :content, :name, :parent::Tree::TreeNode#content
108,3876
+    attr_reader :content, :name, :parent::Tree::TreeNode#name
108,3876
+    attr_reader :content, :name, :parent::Tree::TreeNode#parent
108,3876
+    attr_writer :content::Tree::TreeNode#content
109,3917
+    def initialize::Tree::TreeNode#Tree::TreeNode.new
120,4189
+    def detached_copy::Tree::TreeNode#detached_copy
134,4514
+    def to_s::Tree::TreeNode#to_s
139,4653
+    def parentage::Tree::TreeNode#parentage
151,5042
+    def parent=::Tree::TreeNode#parent=
166,5378
+    def <<::Tree::TreeNode#<<
174,5618
+    def add::Tree::TreeNode#add
181,5877
+    def remove!::Tree::TreeNode#remove!
196,6290
+    def removeFromParent!::Tree::TreeNode#removeFromParent!
205,6566
+    def removeAll!::Tree::TreeNode#removeAll!
210,6688
+    def hasContent?::Tree::TreeNode#hasContent?
220,6902
+    def setAsRoot!::Tree::TreeNode#setAsRoot!
225,7010
+    def isRoot?::Tree::TreeNode#isRoot?
231,7176
+    def hasChildren?::Tree::TreeNode#hasChildren?
236,7292
+    def isLeaf?::Tree::TreeNode#isLeaf?
242,7430
+    def children::Tree::TreeNode#children
248,7595
+    def firstChild::Tree::TreeNode#firstChild
258,7823
+    def lastChild::Tree::TreeNode#lastChild
264,7964
+    def each::Tree::TreeNode#each
271,8188
+    def preordered_each::Tree::TreeNode#preordered_each
278,8385
+    def breadth_each::Tree::TreeNode#breadth_each
284,8572
+    def each_leaf::Tree::TreeNode#each_leaf
299,9143
+    def []::Tree::TreeNode#[]
308,9521
+    def size::Tree::TreeNode#size
320,9859
+    def length::Tree::TreeNode#length
325,9979
+    def printTree::Tree::TreeNode#printTree
330,10068
+    def root::Tree::TreeNode#root
348,10495
+    def firstSibling::Tree::TreeNode#firstSibling
356,10694
+    def isFirstSibling?::Tree::TreeNode#isFirstSibling?
365,10862
+    def lastSibling::Tree::TreeNode#lastSibling
371,11013
+    def isLastSibling?::Tree::TreeNode#isLastSibling?
380,11176
+    def siblings::Tree::TreeNode#siblings
387,11395
+    def isOnlyChild?::Tree::TreeNode#isOnlyChild?
401,11768
+    def nextSibling::Tree::TreeNode#nextSibling
407,11931
+    def previousSibling::Tree::TreeNode#previousSibling
415,12163
+    def <=>::Tree::TreeNode#<=>
424,12428
+    def freezeTree!::Tree::TreeNode#freezeTree!
430,12570
+    def createDumpRep::Tree::TreeNode#createDumpRep
435,12702
+    def _dump::Tree::TreeNode#_dump
441,12882
+    def TreeNode.loadDumpRep::Tree::TreeNode.loadDumpRep
448,13072
+    def TreeNode._load::Tree::TreeNode._load
466,13649
+    def depth::Tree::TreeNode#depth
472,13809
+    def breadth::Tree::TreeNode#breadth
479,14010
+
+test/test_binarytree.rb,750
+class TC_BinaryTreeTest::TC_BinaryTreeTest
42,1721
+  def setup::TC_BinaryTreeTest#setup
44,1780
+  def teardown::TC_BinaryTreeTest#teardown
52,2034
+  def test_initialize::TC_BinaryTreeTest#test_initialize
58,2144
+  def test_add::TC_BinaryTreeTest#test_add
62,2239
+  def test_left::TC_BinaryTreeTest#test_left
80,2877
+  def test_right::TC_BinaryTreeTest#test_right
87,3136
+  def test_left_assignment::TC_BinaryTreeTest#test_left_assignment
94,3408
+  def test_right_assignment::TC_BinaryTreeTest#test_right_assignment
110,4173
+  def test_isLeftChild?::TC_BinaryTreeTest#test_isLeftChild?
127,5052
+  def test_isRightChild?::TC_BinaryTreeTest#test_isRightChild?
141,5524
+  def test_swap_children::TC_BinaryTreeTest#test_swap_children
154,6004
+
+test/test_tree.rb,2386
+class TC_TreeTest::TC_TreeTest
42,1710
+  def setup::TC_TreeTest#setup
46,1802
+  def loadChildren::TC_TreeTest#loadChildren
74,2708
+  def teardown::TC_TreeTest#teardown
80,2804
+  def test_root_setup::TC_TreeTest#test_root_setup
84,2849
+  def test_root::TC_TreeTest#test_root
99,3548
+  def test_hasContent::TC_TreeTest#test_hasContent
107,3773
+  def test_length::TC_TreeTest#test_length
117,4141
+  def test_comparator::TC_TreeTest#test_comparator
123,4288
+  def test_to_s::TC_TreeTest#test_to_s
143,4828
+  def test_firstSibling::TC_TreeTest#test_firstSibling
151,5112
+  def test_isFirstSibling::TC_TreeTest#test_isFirstSibling
161,5590
+  def test_isLastSibling::TC_TreeTest#test_isLastSibling
171,5998
+  def test_lastSibling::TC_TreeTest#test_lastSibling
181,6394
+  def test_siblings::TC_TreeTest#test_siblings
191,6863
+  def test_isOnlyChild?::TC_TreeTest#test_isOnlyChild?
210,7450
+  def test_nextSibling::TC_TreeTest#test_nextSibling
219,7762
+  def test_previousSibling::TC_TreeTest#test_previousSibling
228,8128
+  def test_add::TC_TreeTest#test_add
237,8512
+  def test_remove::TC_TreeTest#test_remove
256,8994
+  def test_removeAll::TC_TreeTest#test_removeAll
283,9704
+  def test_removeFromParent::TC_TreeTest#test_removeFromParent
292,9948
+  def test_children::TC_TreeTest#test_children
309,10578
+  def test_firstChild::TC_TreeTest#test_firstChild
335,11439
+  def test_lastChild::TC_TreeTest#test_lastChild
344,11714
+  def test_find::TC_TreeTest#test_find
353,11979
+  def test_parentage::TC_TreeTest#test_parentage
367,12514
+  def test_each::TC_TreeTest#test_each
375,12798
+  def test_each_leaf::TC_TreeTest#test_each_leaf
392,13420
+  def test_parent::TC_TreeTest#test_parent
406,13890
+  def test_indexed_access::TC_TreeTest#test_indexed_access
415,14271
+  def test_printTree::TC_TreeTest#test_printTree
423,14541
+  def test_dump::TC_TreeTest#test_dump
429,14612
+  def test_collect::TC_TreeTest#test_collect
442,15085
+  def test_freezeTree::TC_TreeTest#test_freezeTree
451,15304
+  def test_content::TC_TreeTest#test_content
460,15568
+  def test_depth::TC_TreeTest#test_depth
466,15722
+  def test_breadth::TC_TreeTest#test_breadth
484,16216
+  def test_breadth_each::TC_TreeTest#test_breadth_each
502,16810
+  def test_preordered_each::TC_TreeTest#test_preordered_each
542,17749
+  def test_detached_copy::TC_TreeTest#test_detached_copy
575,18593

data/lib/tree.rb

@@ -1,6 +1,6 @@
 # tree.rb
 #
-# $Revision: 1.18 $ by $Author: anupamsg $
+# $Revision: 1.19 $ by $Author: anupamsg $
 # $Name:  $
 #
 # = tree.rb - Generic Multi-way Tree implementation
@@ -47,7 +47,7 @@
 # This module mixes in the Enumerable module.
 module Tree
 
-  VERSION = '0.4.1'
+  VERSION = '0.4.2'
 
   # == TreeNode Class Description
   #
@@ -130,6 +130,11 @@ module Tree
       @children = []
     end
 
+    # Returns a copy of this node, with the parent and children links removed.
+    def detached_copy
+      Tree::TreeNode.new(@name, @content ? @content.clone : nil)
+    end
+
     # Print the string representation of this node.
     def to_s
 
@@ -261,14 +266,36 @@ module Tree
     end
 
     # Returns every node (including the receiver node) from the tree to the
-    # specified block. The traversal is depth first and from left to right.
+    # specified block. The traversal is depth first and from left to right in
+    # pre-ordered sequence.
     def each &block
       yield self
       children { |child| child.each(&block) }
     end
 
-    # Yields all leaf nodes from this node to the specified block. May yield this
-    # node as well if this is a leaf node.  Leaf traversal is left to right.
+    # Traverses the tree in a pre-ordered sequence. This is equivalent to
+    # TreeNode#each
+    def preordered_each &block
+      each &block
+    end
+
+    # Performs breadth first traversal of the tree rooted at this node. The
+    # traversal in a given level is from left to right.
+    def breadth_each &block
+      node_queue = [self]       # Create a queue with self as the initial entry
+
+      # Use a queue to do breadth traversal
+      until node_queue.empty?
+        node_to_traverse = node_queue.shift
+        yield node_to_traverse
+        # Enqueue the children from left to right.
+        node_to_traverse.children { |child| node_queue.push child }
+      end
+    end
+
+    # Yields all leaf nodes from this node to the specified block. May yield
+    # this node as well if this is a leaf node.  Leaf traversal depth first and
+    # left to right.
     def each_leaf &block
       self.each { |node| yield(node) if node.isLeaf? }
     end
@@ -461,6 +488,10 @@ module Tree
 end
 
 # $Log: tree.rb,v $
+# Revision 1.19  2007/08/31 01:16:27  anupamsg
+# Added breadth and pre-order traversals for the tree. Also added a method
+# to return the detached copy of a node from the tree.
+#
 # 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.

data/test/test_binarytree.rb

@@ -2,7 +2,7 @@
 
 # testtree.rb
 #
-# $Revision: 1.2 $ by $Author: anupamsg $
+# $Revision: 1.3 $ by $Author: anupamsg $
 # $Name:  $
 #
 # Copyright (c) 2006, 2007 Anupam Sengupta
@@ -37,7 +37,6 @@
 
 require 'test/unit'
 require 'tree/binarytree'
-require 'person'
 
 # Test class for the Tree node.
 class TC_BinaryTreeTest < Test::Unit::TestCase
@@ -171,6 +170,13 @@ class TC_BinaryTreeTest < Test::Unit::TestCase
 end
 
 # $Log: test_binarytree.rb,v $
+# Revision 1.3  2007/10/02 03:07:30  anupamsg
+# * Rakefile: Added an optional task for rcov code coverage.
+#
+# * test/test_binarytree.rb: Removed the unnecessary dependency on "Person" class.
+#
+# * test/test_tree.rb: Removed dependency on the redundant "Person" class.
+#
 # 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.

data/test/test_tree.rb

@@ -2,7 +2,7 @@
 
 # testtree.rb
 #
-# $Revision: 1.1 $ by $Author: anupamsg $
+# $Revision: 1.4 $ by $Author: anupamsg $
 # $Name:  $
 #
 # Copyright (c) 2006, 2007 Anupam Sengupta
@@ -37,11 +37,12 @@
 
 require 'test/unit'
 require 'tree'
-require 'person'
 
 # Test class for the Tree node.
 class TC_TreeTest < Test::Unit::TestCase
 
+  Person = Struct::new(:First, :last)
+
   def setup
     @root = Tree::TreeNode.new("ROOT", "Root Node")
 
@@ -88,6 +89,7 @@ class TC_TreeTest < Test::Unit::TestCase
     assert_equal("Root Node", @root.content, "Content should be 'Root Node'")
     assert(@root.isRoot?, "Should identify as root")
     assert(!@root.hasChildren?, "Cannot have any children")
+    assert(@root.hasContent?, "This root should have content")
     assert_equal(1, @root.size, "Number of nodes should be one")
     assert_nil(@root.siblings, "Root cannot have any children")
 
@@ -102,6 +104,50 @@ class TC_TreeTest < Test::Unit::TestCase
     assert_same(@root, @child4.root, "Root should be ROOT")
   end
 
+  def test_hasContent
+    aNode = Tree::TreeNode.new("A Node")
+    assert_nil(aNode.content, "The node should not have content")
+    assert(!aNode.hasContent?, "The node should not have content")
+
+    aNode.content = "Something"
+    assert_not_nil(aNode.content, "The node should now have content")
+    assert(aNode.hasContent?, "The node should now have content")
+  end
+
+  def test_length
+    loadChildren
+
+    assert_equal(@root.size, @root.length, "Length and size methods should return the same result")
+  end
+
+  def test_comparator
+    firstNode  = Tree::TreeNode.new(1)
+    secondNode = Tree::TreeNode.new(2)
+
+    assert_equal(firstNode <=> nil, +1)
+    assert_equal(firstNode <=> secondNode, -1)
+
+    secondNode = Tree::TreeNode.new(1)
+    assert_equal(firstNode <=> secondNode, 0)
+
+    firstNode  = Tree::TreeNode.new("ABC")
+    secondNode = Tree::TreeNode.new("XYZ")
+
+    assert_equal(firstNode <=> nil, +1)
+    assert_equal(firstNode <=> secondNode, -1)
+
+    secondNode = Tree::TreeNode.new("ABC")
+    assert_equal(firstNode <=> secondNode, 0)
+  end
+
+  def test_to_s
+    aNode = Tree::TreeNode.new("A Node", "Some Content")
+
+    expectedString = "Node Name: A Node Content: Some Content Parent: <None> Children: 0 Total Nodes: 1"
+
+    assert_equal(expectedString, aNode.to_s, "The string representation should be same")
+  end
+
   def test_firstSibling
     loadChildren
 
@@ -383,9 +429,6 @@ class TC_TreeTest < Test::Unit::TestCase
   def test_dump
     loadChildren
 
-    pers = Person.new("John", "Doe")
-    #@root.content = pers
-
     data = Marshal.dump(@root)
 
     newRoot = Marshal.load(data)
@@ -415,7 +458,7 @@ class TC_TreeTest < Test::Unit::TestCase
   end
 
   def test_content
-    pers = Person.new("John", "Doe")
+    pers = Person::new("John", "Doe")
     @root.content = pers
     assert_same(pers, @root.content, "Content should be the same")
   end
@@ -439,27 +482,133 @@ class TC_TreeTest < Test::Unit::TestCase
   end
 
   def test_breadth
-  assert_equal(1, @root.breadth, "A single node's breadth is 1")
+    assert_equal(1, @root.breadth, "A single node's breadth is 1")
 
-  @root << @child1
-  assert_equal(1, @root.breadth, "This should be of breadth 1")
+    @root << @child1
+    assert_equal(1, @root.breadth, "This should be of breadth 1")
 
-  @root << @child2
-  assert_equal(2, @child1.breadth, "This should be of breadth 2")
-  assert_equal(2, @child2.breadth, "This should be of breadth 2")
+    @root << @child2
+    assert_equal(2, @child1.breadth, "This should be of breadth 2")
+    assert_equal(2, @child2.breadth, "This should be of breadth 2")
 
-  @root << @child3
-  assert_equal(3, @child1.breadth, "This should be of breadth 3")
-  assert_equal(3, @child2.breadth, "This should be of breadth 3")
+    @root << @child3
+    assert_equal(3, @child1.breadth, "This should be of breadth 3")
+    assert_equal(3, @child2.breadth, "This should be of breadth 3")
+
+    @child3 << @child4
+    assert_equal(1, @child4.breadth, "This should be of breadth 1")
+  end
+
+  def test_breadth_each
+    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")
+
+    # The expected order of response
+    expected_array = [j,
+                      f, k,
+                      a, h, z,
+                      d]
+
+    # Create the following Tree
+    #        j         <-- level 0 (Root)
+    #      /   \
+    #     f      k     <-- level 1
+    #   /   \      \
+    #  a     h      z  <-- level 2
+    #   \
+    #    d             <-- level 3
+    j << f << a << d
+    f << h
+    j << k << z
+
+    result_array = []
+
+    # Create the response
+    j.breadth_each { |node| result_array << node.detached_copy }
+
+    expected_array.each_index do |i|
+      # Match only the names.
+      assert_equal(expected_array[i].name, result_array[i].name)
+    end
+
+  end
+
+
+  def test_preordered_each
+    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")
+
+    # The expected order of response
+    expected_array = [j, f, a, d, h, k, z]
+
+    # Create the following Tree
+    #        j         <-- level 0 (Root)
+    #      /   \
+    #     f      k     <-- level 1
+    #   /   \      \
+    #  a     h      z  <-- level 2
+    #   \
+    #    d             <-- level 3
+    j << f << a << d
+    f << h
+    j << k << z
+
+    result_array = []
+    j.preordered_each { |node| result_array << node.detached_copy}
+
+    expected_array.each_index do |i|
+      # Match only the names.
+      assert_equal(expected_array[i].name, result_array[i].name)
+    end
+  end
+
+  def test_detached_copy
+    loadChildren
+
+    assert(@root.hasChildren?, "The root should have children")
+    copy_of_root = @root.detached_copy
+    assert(!copy_of_root.hasChildren?, "The copy should not have children")
+    assert_equal(@root.name, copy_of_root.name, "The names should be equal")
+
+    # Try the same test with a child node
+    assert(!@child3.isRoot?, "Child 3 is not a root")
+    assert(@child3.hasChildren?, "Child 3 has children")
+    copy_of_child3 = @child3.detached_copy
+    assert(copy_of_child3.isRoot?, "Child 3's copy is a root")
+    assert(!copy_of_child3.hasChildren?, "Child 3's copy does not have children")
+  end
 
-  @child3 << @child4
-  assert_equal(1, @child4.breadth, "This should be of breadth 1")
-end
 end
 
 __END__
 
 # $Log: test_tree.rb,v $
+# Revision 1.4  2007/10/02 03:38:11  anupamsg
+# Removed dependency on the redundant "Person" class.
+# (TC_TreeTest::test_comparator): Added a new test for the spaceship operator.
+# (TC_TreeTest::test_hasContent): Added tests for hasContent? and length methods.
+#
+# Revision 1.3  2007/10/02 03:07:30  anupamsg
+# * Rakefile: Added an optional task for rcov code coverage.
+#
+# * test/test_binarytree.rb: Removed the unnecessary dependency on "Person" class.
+#
+# * test/test_tree.rb: Removed dependency on the redundant "Person" class.
+#
+# Revision 1.2  2007/08/31 01:16:28  anupamsg
+# Added breadth and pre-order traversals for the tree. Also added a method
+# to return the detached copy of a node from the tree.
+#
 # Revision 1.1  2007/07/21 04:52:38  anupamsg
 # Renamed the test files.
 #

metadata

@@ -1,10 +1,10 @@
 --- !ruby/object:Gem::Specification 
-rubygems_version: 0.9.2
+rubygems_version: 0.9.4
 specification_version: 1
 name: rubytree
 version: !ruby/object:Gem::Version 
-  version: 0.4.1
-date: 2007-08-30 00:00:00 -07:00
+  version: 0.4.2
+date: 2007-10-01 00:00:00 -07:00
 summary: Ruby implementation of the Tree data structure.
 require_paths: 
 - lib
@@ -31,13 +31,11 @@ authors:
 files: 
 - ChangeLog
 - COPYING
-- lib
 - Rakefile
 - README
-- test
+- TAGS
 - lib/tree/binarytree.rb
 - lib/tree.rb
-- test/person.rb
 - test/test_binarytree.rb
 - test/test_tree.rb
 test_files: 
@@ -55,5 +53,13 @@ extensions: []
 
 requirements: []
 
-dependencies: []
-
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: rake
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Version::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: 0.7.2
+    version: 

data/test/person.rb

@@ -1,54 +0,0 @@
-# person.rb
-#
-# $Revision: 1.8 $ by $Author: anupamsg $
-# $Name:  $
-#
-# Copyright (c) 2006, 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.
-#
-
-# Define a simple class for testing the RubyTree implementation
-class Person
-    attr_reader :first, :last
-    attr_writer :first, :last
-    def initialize(first, last)
-        @first = first
-        @last = last
-    end
-
-    def to_s
-        "#@first, #@last"
-    end
-
-end
-
-# $Log: person.rb,v $
-# Revision 1.8  2007/07/17 03:39:28  anupamsg
-# Moved the CVS Log keyword to end of the files.
-#