rubytree 0.2.3 → 0.2.4

data/ChangeLog

@@ -0,0 +1,21 @@
+2007-06-23  Anupam Sengupta  <anupamsg@gmail.com>
+
+	* Rakefile: Added the LICENSE and ChangeLog to the extra RDoc files.
+
+	* lib/tree.rb: Minor updates to the comments.
+
+	* test/testtree.rb: Added the Copyright and License header.
+
+	* test/person.rb: Added the Copyright and License header.
+
+	* lib/tree.rb: Added the Copyright and License header.
+
+	* Rakefile: Added the LICENSE and Changelog to be part of the RDoc task.
+
+	* README: Added documentation in the README, including install
+	instructions and an example.
+
+	* LICENSE: Added the BSD LICENSE file.
+
+	* Changelog: Added the Changelog file.
+

data/LICENSE

@@ -0,0 +1,31 @@
+RUBYTREE - http://rubytree.rubyforge.org
+========================================
+
+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.

data/README

@@ -1,6 +1,140 @@
-= Tree Implementation
+= RubyTree
 
+  (c) 2006, 2007 Anupam Sengupta
+  http://rubytree.rubyforge.org
 
-Hello 
+  Document Revision: $Revision: 1.4 $
+
+== License
+
+RubyTree has been released under the BSD License. See the file LICENSE for
+details.
 
 == Introduction
+
+RubyTree is a simple implementation of the generic Tree data structure.  This
+implementation is node-centric, where the individual nodes on the tree are the
+primary objects and drive the structure.
+
+== Getting RubyTree
+
+RubyTree is an open source project and is hosted at
+http://rubyforge.org/projects/rubytree
+
+The project home page is: http://rubytree.rubyforge.org
+
+RubyTree can be downloaded as a Ruby Gem or as a tar/zip file from:
+
+http://rubyforge.org/frs/?group_id=1215&release_id=8817
+
+The file name is one of:
+
+    rubytree-<VERSION>.gem
+    rubytree-<VERSION>.tgz
+    rubytree-<VERSION>.zip
+
+Download the appropriate file-type.
+
+== Installing RubyTree
+
+It is recommended to install RubyTree as a Ruby Gem, as this is an easy way to
+keep the version updated, and keep multiple versions of the library available on
+your system.
+
+=== Installing the Gem
+To Install the Gem, from a Terminal/CLI command prompt, issue the command:
+
+   gem install rubytree
+
+This should install the gem file for RubyTree. Note that you may need to be a
+super-user (root) to successfully install the gem.
+
+=== Installing from the tgz/zip file
+
+Extract the archive file (tgz or zip) and run the 'rake' command from the
+top-level source directory.
+
+== Documentation
+
+The primary class for this implementation is Tree::TreeNode. See the
+class documentation for an usage example.
+
+From a command line/terminal prompt, you can issue the following command to view
+the text mode ri documentation:
+
+    ri Tree::TreeNode
+
+== Example
+
+ The following code-snippet implements this tree structure:
+
+                   +------------+
+                   |    ROOT    |
+                   +-----+------+
+           +-------------+------------+
+           |                          |
+   +-------+-------+          +-------+-------+
+   |  CHILD 1      |          |  CHILD 2      |
+   +-------+-------+          +---------------+
+           |
+           |
+   +-------+-------+
+   | GRANDCHILD 1  |
+   +---------------+
+
+ require 'tree'
+
+ myTreeRoot = Tree::TreeNode.new("ROOT", "Root Content")
+
+ myTreeRoot << Tree::TreeNode.new("CHILD1", "Child1 Content") << Tree::TreeNode.new("GRANDCHILD1", "GrandChild1 Content")
+
+ myTreeRoot << Tree::TreeNode.new("CHILD2", "Child2 Content")
+
+ myTreeRoot.printTree
+
+ child1 = myTreeRoot["CHILD1"]
+
+ grandChild1 = myTreeRoot["CHILD1"]["GRANDCHILD1"]
+
+ siblingsOfChild1Array = child1.siblings
+
+ immediateChildrenArray = myTreeRoot.children
+
+ # Process all nodes
+
+ myTreeRoot.each { |node| node.content.reverse }
+
+ myTreeRoot.remove!(child1) # Remove the child
+
+== LICENSE
+
+RubyTree is licensed under BSD license.
+
+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.

data/Rakefile

@@ -1,3 +1,36 @@
+# Rakefile
+#
+# Revision: $Revision: 1.8 $
+#
+# 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.
+
 require 'rubygems'
 require 'rake/clean'
 require 'rake/gempackagetask'
@@ -7,7 +40,7 @@ require 'rake/rdoctask'
 desc "Default Task"
 task :default => :gem
 
-PKG_VERSION = '0.2.3'
+PKG_VERSION = '0.2.4'
 PKG_FILES = FileList[
                 '[A-Z]*',
                 'lib/**/*.rb',
@@ -23,13 +56,15 @@ spec = Gem::Specification.new do |s|
     s.summary = "Ruby implementation of the Tree data structure."
 
     s.description = <<-END
-    Provides a generic tree data structure with ability to
-    store keyed node elements in the tree. The implementation
+    Provides a generic tree data-structure with ability to
+    store keyed node-elements in the tree. The implementation
     mixes in the Enumerable module.
+
+    Website:  http://rubytree.rubyforge.org/
     END
 
     s.has_rdoc = true
-    s.extra_rdoc_files = ['README']
+    s.extra_rdoc_files = ['README', 'LICENSE', 'ChangeLog']
     s.autorequire = "tree"
     s.files = PKG_FILES.to_a
     s.test_files = Dir.glob('test/test*.rb')
@@ -47,7 +82,7 @@ Rake::TestTask.new do |t|
 end
 
 Rake::RDocTask.new do |rd|
-    rd.rdoc_files.include("README", "lib/**/*.rb")
+    rd.rdoc_files.include("README", "LICENSE", "ChangeLog", "lib/**/*.rb")
 end
 
 

data/TAGS

@@ -0,0 +1,66 @@
+
+./lib/tree.rb,1809
+module Tree::Tree
11,250
+    class TreeNode::Tree::TreeNode
40,1061
+        attr_reader :content, :name, :parent::Tree::TreeNode#content
43,1112
+        attr_reader :content, :name, :parent::Tree::TreeNode#name
43,1112
+        attr_reader :content, :name, :parent::Tree::TreeNode#parent
43,1112
+        attr_writer :content::Tree::TreeNode#content
44,1157
+        def initialize::Tree::TreeNode#Tree::TreeNode.new
55,1473
+        def to_s::Tree::TreeNode#to_s
69,1866
+        def parent=::Tree::TreeNode#parent=
79,2266
+        def <<::Tree::TreeNode#<<
87,2532
+        def add::Tree::TreeNode#add
95,2825
+        def remove!::Tree::TreeNode#remove!
109,3285
+        def removeFromParent!::Tree::TreeNode#removeFromParent!
118,3601
+        def removeAll!::Tree::TreeNode#removeAll!
123,3749
+        def hasContent?::Tree::TreeNode#hasContent?
133,4013
+        def setAsRoot!::Tree::TreeNode#setAsRoot!
138,4139
+        def isRoot?::Tree::TreeNode#isRoot?
144,4327
+        def hasChildren?::Tree::TreeNode#hasChildren?
149,4461
+        def children::Tree::TreeNode#children
155,4655
+        def each::Tree::TreeNode#each
165,4932
+        def []::Tree::TreeNode#[]
177,5366
+        def size::Tree::TreeNode#size
189,5712
+        def length::Tree::TreeNode#length
194,5850
+        def printTree::Tree::TreeNode#printTree
199,5957
+        def root::Tree::TreeNode#root
205,6149
+        def siblings::Tree::TreeNode#siblings
214,6454
+        def <=>::Tree::TreeNode#<=>
230,6982
+        def freezeTree!::Tree::TreeNode#freezeTree!
236,7148
+        def createDumpRep::Tree::TreeNode#createDumpRep
241,7273
+        def _dump::Tree::TreeNode#_dump
247,7487
+        def TreeNode.loadDumpRep::Tree::TreeNode.loadDumpRep
253,7639
+        def TreeNode._load::Tree::TreeNode._load
270,8265
+
+./test/person.rb,305
+class Person::Person
1,0
+    attr_reader :first, :last
+    attr_reader :first, :last
+    attr_writer :first, :last
+    attr_writer :first, :last
+    def initialize::Person#Person.new
4,80
+    def to_s::Person#to_s
9,182
+
+./test/testtree.rb,1164
+class TC_TreeTest::TC_TreeTest
8,106
+    def setup::TC_TreeTest#setup
10,161
+    def loadChildren::TC_TreeTest#loadChildren
20,503
+    def teardown::TC_TreeTest#teardown
26,615
+    def test_root_setup::TC_TreeTest#test_root_setup
30,668
+    def test_root::TC_TreeTest#test_root
44,1348
+    def test_siblings::TC_TreeTest#test_siblings
52,1591
+    def test_add::TC_TreeTest#test_add
71,2221
+    def test_remove::TC_TreeTest#test_remove
90,2743
+    def test_removeAll::TC_TreeTest#test_removeAll
117,3521
+    def test_removeFromParent::TC_TreeTest#test_removeFromParent
126,3789
+    def test_children::TC_TreeTest#test_children
142,4413
+    def test_find::TC_TreeTest#test_find
167,5289
+    def test_each::TC_TreeTest#test_each
181,5859
+    def test_parent::TC_TreeTest#test_parent
198,6530
+    def test_indexed_access::TC_TreeTest#test_indexed_access
207,6939
+    def test_printTree::TC_TreeTest#test_printTree
215,7233
+    def test_dump::TC_TreeTest#test_dump
221,7320
+    def test_collect::TC_TreeTest#test_collect
237,7901
+    def test_freezeTree::TC_TreeTest#test_freezeTree
246,8152
+    def test_content::TC_TreeTest#test_content
255,8444

data/lib/tree.rb

@@ -1,3 +1,6 @@
+# tree.rb
+#
+# Revision: $Revision: 1.6 $
 #
 # = tree.rb - Generic Tree implementation
 #
@@ -8,12 +11,59 @@
 # Author:: Anupam Sengupta (anupamsg@gmail.com)
 #
 
+# 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.
+
+
 module Tree
 
     # The Tree node class implementation. Mixes in the Enumerable
     # module.
+    #
     # == Example
     #
+    #  The following code-snippet implements this tree structure:
+    #
+    #                    +------------+
+    #                    |    ROOT    |
+    #                    +-----+------+
+    #            +-------------+------------+
+    #            |                          |
+    #    +-------+-------+          +-------+-------+
+    #    |  CHILD 1      |          |  CHILD 2      |
+    #    +-------+-------+          +---------------+
+    #            |
+    #            |
+    #    +-------+-------+
+    #    | GRANDCHILD 1  |
+    #    +---------------+
+    #
     # require 'tree'
     #
     # myTreeRoot = Tree::TreeNode.new("ROOT", "Root Content")
@@ -45,17 +95,17 @@ module Tree
 
         @@fieldSep = '|'
         @@recordSep = "\n"
-        
+
         # Constructor which expects the name of the node
         #
-        # name of the node is expected to be unique across the
+        # Name of the node is expected to be unique across the
         # tree.
         #
         # The content can be of any type, and is defaulted to _nil_.
         def initialize(name, content = nil)
-                
+
                 raise "Node name HAS to be provided" if name == nil
-                
+
                 @name = name
                 @content = content
 
@@ -80,7 +130,7 @@ module Tree
             @parent = parent
         end
 
-        # Convenience synonym for Tree#add method. 
+        # Convenience synonym for Tree#add method.
         # This method allows a convenient method to add
         # children hierarchies in the tree.
         # E.g. root << child << grand_child
@@ -118,7 +168,7 @@ module Tree
         def removeFromParent!
             @parent.remove!(self) unless isRoot?
         end
-        
+
         # Removes all children from the receiver node.
         def removeAll!
             for child in @children
@@ -169,14 +219,14 @@ 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]
             else
@@ -201,7 +251,7 @@ module Tree
             children {|child| child.printTree(tab + 4)}
         end
 
-        # Returns the root for this node.
+        # Returns the root for this tree.
         def root
             root = self
             root = root.parent while !root.isRoot?
@@ -215,7 +265,7 @@ module Tree
             return nil if isRoot?
             if block_given?
                 for sibling in parent.children
-		              yield sibling if sibling != self
+                              yield sibling if sibling != self
                 end
             else
                 siblings = []
@@ -236,20 +286,21 @@ module Tree
         def freezeTree!
             each {|node| node.freeze}
         end
-        
-        # Creates a dump representation
+
+        # Creates a dump representation and returns the same as a string
         def createDumpRep
             strRep = String.new
             strRep << @name << @@fieldSep << (isRoot? ? @name : @parent.name)
             strRep << @@fieldSep << Marshal.dump(@content) << @@recordSep
         end
-        
+
         def _dump(depth)
             strRep = String.new
             each {|node| strRep << node.createDumpRep}
             strRep
         end
-        
+
+        # Loads a dump representation of the tree from the specified string
         def TreeNode.loadDumpRep(str)
             nodeHash = Hash.new
             rootNode = nil
@@ -266,13 +317,14 @@ module Tree
             end
             rootNode
         end
-        
+
+        # Loads a dump representation of the tree from the specified string.
         def TreeNode._load(str)
             loadDumpRep(str)
         end
-        
+
         protected :parent=, :setAsRoot!
         private_class_method :loadDumpRep
-        
+
     end
-end
+end

data/test/person.rb

@@ -1,3 +1,37 @@
+# person.rb
+#
+# Revision: $Revision: 1.4 $
+#
+# 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
@@ -5,9 +39,9 @@ class Person
         @first = first
         @last = last
     end
-    
+
     def to_s
         "#@first, #@last"
     end
-    
+
 end

data/test/testtree.rb

@@ -1,5 +1,38 @@
 #!/usr/bin/env ruby
 
+# testtree.rb
+#
+# Revision: $Revision: 1.5 $
+#
+# 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.
+
 require 'test/unit'
 require 'tree'
 require 'person'

metadata

@@ -1,17 +1,17 @@
 --- !ruby/object:Gem::Specification 
-rubygems_version: 0.9.0
+rubygems_version: 0.9.4
 specification_version: 1
 name: rubytree
 version: !ruby/object:Gem::Version 
-  version: 0.2.3
-date: 2007-01-05 00:00:00 -07:00
+  version: 0.2.4
+date: 2007-06-23 00:00:00 -07:00
 summary: Ruby implementation of the Tree data structure.
 require_paths: 
 - lib
 email: anupamsg@gmail.com
 homepage: 
 rubyforge_project: 
-description: Provides a generic tree data structure with ability to store keyed node elements in the tree. The implementation mixes in the Enumerable module.
+description: "Provides a generic tree data-structure with ability to store keyed node-elements in the tree. The implementation mixes in the Enumerable module.  Website:  http://rubytree.rubyforge.org/"
 autorequire: tree
 default_executable: 
 bindir: bin
@@ -29,8 +29,11 @@ post_install_message:
 authors: 
 - Anupam Sengupta
 files: 
+- ChangeLog
+- LICENSE
 - Rakefile
 - README
+- TAGS
 - lib/tree.rb
 - test/person.rb
 - test/testtree.rb
@@ -40,6 +43,8 @@ rdoc_options: []
 
 extra_rdoc_files: 
 - README
+- LICENSE
+- ChangeLog
 executables: []
 
 extensions: []