rubytree 0.8.2 → 0.8.3

data/lib/tree/binarytree.rb

@@ -1,7 +1,5 @@
 # binarytree.rb - This file is part of the RubyTree package.
 #
-# $Revision$ by $Author$ on $Date$
-#
 # = binarytree.rb - An implementation of the binary tree data structure.
 #
 # Provides a binary tree data structure with ability to
@@ -10,7 +8,7 @@
 # Author:: Anupam Sengupta (anupamsg@gmail.com)
 #
 
-# Copyright (c) 2007, 2008, 2009, 2010 Anupam Sengupta
+# Copyright (c) 2007, 2008, 2009, 2010, 2012 Anupam Sengupta
 #
 # All rights reserved.
 #
@@ -69,7 +67,8 @@ module Tree
       super(child)
     end
 
-    # Returns the left child of the receiver node. Note that left Child == first Child.
+    # @!attribute [rw] left_child
+    # Left child of the receiver node. Note that left Child == first Child.
     #
     # @return [Tree::BinaryTreeNode] The left most (or first) child.
     #
@@ -78,7 +77,8 @@ module Tree
       children.first
     end
 
-    # Returns the right child of the receiver node. Note that right child == last child unless there is only one child.
+    # @!attribute [rw] right_child
+    # Right child of the receiver node. Note that right child == last child unless there is only one child.
     #
     # Returns +nil+ if the right child does not exist.
     #
@@ -150,8 +150,6 @@ module Tree
     end
 
     # Swaps the left and right child nodes of the receiver node with each other.
-    #
-    # @todo Define the return value.
     def swap_children
       self.left_child, self.right_child = self.right_child, self.left_child
     end

data/lib/tree/tree_deps.rb

@@ -0,0 +1,41 @@
+# rubytree_deps.rb - This file is part of the RubyTree package.
+#
+# = rubytree_deps.rb - Dependencies for RubyTree
+#
+# Centralizes and lists the dependencies forthe RubyTree gem.
+#
+# Author:: Anupam Sengupta (anupamsg@gmail.com)
+#
+
+# Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011, 2012 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 'structured_warnings'
+require 'json'

data/lib/tree/version.rb

@@ -0,0 +1,41 @@
+#--
+# version.rb - This file is part of the RubyTree package.
+#
+# This file provides the version number for Rubytree.
+#
+# Author:: Anupam Sengupta (anupamsg@gmail.com)
+#
+# Copyright (c) 2012 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
+  # Rubytree Package Version
+  VERSION = '0.8.3'
+end

data/test/test_binarytree.rb

@@ -2,9 +2,8 @@
 
 # test_binarytree.rb - This file is part of the RubyTree package.
 #
-# $Revision$ by $Author$ on $Date$
 #
-# Copyright (c) 2006, 2007, 2008, 2009, 2010 Anupam Sengupta
+# Copyright (c) 2006, 2007, 2008, 2009, 2010, 2012 Anupam Sengupta
 #
 # All rights reserved.
 #

data/test/test_rubytree_require.rb

@@ -0,0 +1,48 @@
+#!/usr/bin/env ruby
+
+# test_rubytree_require.rb - This file is part of the RubyTree package.
+#
+# Copyright (c) 2012 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 'rubytree'
+
+module TestTree
+
+  # Test class for checking whether require 'rubytree' works.
+  class TestRequireRubytree < Test::Unit::TestCase
+
+    # A simple test.  We are just checking whether the require worked.
+    def test_create_a_simple_node
+      assert_not_nil(Tree::TreeNode.new("Root", "A Root node"))
+    end
+  end
+end

data/test/test_tree.rb

@@ -1,10 +1,8 @@
 #!/usr/bin/env ruby
 
-# testtree.rb - This file is part of the RubyTree package.
+# test_tree.rb - This file is part of the RubyTree package.
 #
-# $Revision$ by $Author$ on $Date$
-#
-# Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011 Anupam Sengupta
+# Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011, 2012 Anupam Sengupta
 #
 # All rights reserved.
 #
@@ -35,7 +33,6 @@
 #
 
 require 'test/unit'
-require 'rubygems'
 require 'json'
 require 'tree'
 
@@ -88,6 +85,11 @@ module TestTree
       @root = nil
     end
 
+    # Test for presence of the VERSION constant
+    def test_has_version_number
+      assert_not_nil(Tree::VERSION)
+    end
+
     # This test is for the root alone - without any children being linked
     def test_root_setup
       assert_not_nil(@root        , "Root cannot be nil")
@@ -99,7 +101,7 @@ module TestTree
       assert(!@root.has_children? , "Cannot have any children")
       assert(@root.has_content?   , "This root should have content")
       assert_equal(1              , @root.size, "Number of nodes should be one")
-      assert_nil(@root.siblings   , "This root does not have any children")
+      assert_equal(0, @root.siblings.length, "This root does not have any children")
       assert_equal(0, @root.in_degree, "Root should have an in-degree of 0")
       assert_equal(0, @root.node_height, "Root's height before adding any children is 0")
       assert_raise(ArgumentError) { Tree::TreeNode.new(nil) }
@@ -137,6 +139,9 @@ module TestTree
 
     # Test the <=> operator.
     def test_spaceship
+      require 'structured_warnings'
+      StandardWarning.disable   # Disable the warnings for using integers as node names
+
       first_node  = Tree::TreeNode.new(1)
       second_node = Tree::TreeNode.new(2)
 
@@ -155,6 +160,8 @@ module TestTree
 
       second_node = Tree::TreeNode.new("ABC")
       assert_equal(first_node <=> second_node, 0)
+
+      StandardWarning.enable
     end
 
     # Test the to_s method.  This is probably a little fragile right now.
@@ -199,6 +206,7 @@ module TestTree
       assert_same(@child1, @child1.first_sibling, "Child1's first sibling is itself")
       assert_same(@child1, @child2.first_sibling, "Child2's first sibling should be child1")
       assert_same(@child1, @child3.first_sibling, "Child3's first sibling should be child1")
+      assert_same(@child4, @child4.first_sibling, "Child4's first sibling should be itself")
       assert_not_same(@child1, @child4.first_sibling, "Child4's first sibling is itself")
     end
 
@@ -206,7 +214,6 @@ module TestTree
     def test_is_first_sibling_eh
       setup_test_tree
 
-      # TODO: Need to fix the first_sibling method to return nil for nodes with no siblings.
       assert(@root.is_first_sibling?, "Root's first sibling is itself")
       assert( @child1.is_first_sibling?, "Child1's first sibling is itself")
       assert(!@child2.is_first_sibling?, "Child2 is not the first sibling")
@@ -218,7 +225,6 @@ module TestTree
     def test_is_last_sibling_eh
       setup_test_tree
 
-      # TODO: Need to fix the last_sibling method to return nil for nodes with no siblings.
       assert(@root.is_last_sibling?, "Root's last sibling is itself")
       assert(!@child1.is_last_sibling?, "Child1 is not the last sibling")
       assert(!@child2.is_last_sibling?, "Child2 is not the last sibling")
@@ -230,11 +236,11 @@ module TestTree
     def test_last_sibling
       setup_test_tree
 
-      # TODO: Need to fix the last_sibling method to return nil for nodes with no siblings.
       assert_same(@root, @root.last_sibling, "Root's last sibling is itself")
       assert_same(@child3, @child1.last_sibling, "Child1's last sibling should be child3")
       assert_same(@child3, @child2.last_sibling, "Child2's last sibling should be child3")
       assert_same(@child3, @child3.last_sibling, "Child3's last sibling should be itself")
+      assert_same(@child4, @child4.last_sibling, "Child4's last sibling should be itself")
       assert_not_same(@child3, @child4.last_sibling, "Child4's last sibling is itself")
     end
 
@@ -260,7 +266,7 @@ module TestTree
 
       siblings.clear
       siblings = @root.siblings
-      assert_nil(siblings, "Root should not have any siblings")
+      assert_equal(0, siblings.length, "Root should not have any siblings")
     end
 
     # Test the is_only_child? method.
@@ -1070,6 +1076,62 @@ module TestTree
 
     end
 
+    # Test usage of integers as node names
+    def test_integer_node_names
+
+      require 'structured_warnings'
+      assert_warn(StandardWarning) do
+        @n_root = Tree::TreeNode.new(0, "Root Node")
+        @n_child1 = Tree::TreeNode.new(1, "Child Node 1")
+        @n_child2 = Tree::TreeNode.new(2, "Child Node 2")
+        @n_child3 = Tree::TreeNode.new("three", "Child Node 3")
+      end
+
+      @n_root << @n_child1
+      @n_root << @n_child2
+      @n_root << @n_child3
+
+      # Node[n] is really accessing the nth child with a zero-base
+      assert_not_equal(@n_root[1].name, 1) # This is really the second child
+      assert_equal(@n_root[0].name, 1)     # This will work, as it is the first child
+      assert_equal(@n_root[1, true].name, 1)     # This will work, as the flag is now enabled
+
+      # Sanity check for the "normal" string name cases. Both cases should work.
+      assert_equal(@n_root["three", false].name, "three")
+
+      StandardWarning.disable
+      assert_equal(@n_root["three", true].name, "three")
+
+      # Also ensure that the warning is actually being thrown
+      StandardWarning.enable
+      assert_warn(StandardWarning) {assert_equal(@n_root["three", true].name, "three") }
+    end
+
+    # Test the addition of a node to itself as a child
+    def test_add_node_to_self_as_child
+      root =  Tree::TreeNode.new("root")
+
+      # Lets check the direct parentage scenario
+      assert_raise(ArgumentError) {root << root}
+
+      # And now a scenario where the node addition is done down the hierarchy
+      # @todo This scenario is not yet fixed.
+      child =  Tree::TreeNode.new("child")
+      root << child << root
+      # puts root                 # This will throw a stack trace
+    end
+
+    # Test whether the tree_leaf method works correctly
+    def test_single_node_becomes_leaf
+      setup_test_tree
+
+      leafs = @root.each_leaf
+      parents = leafs.collect {|leaf| leaf.parent }
+      leafs.each {|leaf| leaf.remove_from_parent!}
+      parents.each {|parent| assert(parent.is_leaf?) if not parent.has_children?}
+
+    end
+
   end
 end
 

metadata

@@ -1,139 +1,187 @@
---- !ruby/object:Gem::Specification 
+--- !ruby/object:Gem::Specification
 name: rubytree
-version: !ruby/object:Gem::Version 
-  hash: 59
+version: !ruby/object:Gem::Version
+  version: 0.8.3
   prerelease: 
-  segments: 
-  - 0
-  - 8
-  - 2
-  version: 0.8.2
 platform: ruby
-authors: 
+authors:
 - Anupam Sengupta
 autorequire: 
 bindir: bin
 cert_chain: []
-
-date: 2011-12-16 00:00:00 Z
-dependencies: 
-- !ruby/object:Gem::Dependency 
-  name: hoe-yard
+date: 2012-08-21 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: structured_warnings
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 0.1.3
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 0.1.3
+- !ruby/object:Gem::Dependency
+  name: json
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 1.7.5
+  type: :runtime
   prerelease: false
-  requirement: &id001 !ruby/object:Gem::Requirement 
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 1.7.5
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
     none: false
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        hash: 31
-        segments: 
-        - 0
-        - 1
-        - 2
-        version: 0.1.2
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 0.9.2.2
   type: :development
-  version_requirements: *id001
-- !ruby/object:Gem::Dependency 
-  name: hoe
   prerelease: false
-  requirement: &id002 !ruby/object:Gem::Requirement 
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 0.9.2.2
+- !ruby/object:Gem::Dependency
+  name: yard
+  requirement: !ruby/object:Gem::Requirement
     none: false
-    requirements: 
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 0.8.2.1
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 0.8.2.1
+- !ruby/object:Gem::Dependency
+  name: rtagstask
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 0.0.4
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 0.0.4
+- !ruby/object:Gem::Dependency
+  name: rcov
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
     - - ~>
-      - !ruby/object:Gem::Version 
-        hash: 27
-        segments: 
-        - 2
-        - 12
-        version: "2.12"
+      - !ruby/object:Gem::Version
+        version: 0.9.0
   type: :development
-  version_requirements: *id002
-description: |-
-  RubyTree is a Ruby implementation of the generic tree data structure.  It provides a node-based model to store keyed
-  node-elements in the tree and simple APIs to access, modify and traverse the structure.  RubyTree is node-centric, where
-  individual nodes on the tree are the primary compositional and structural elements.
-  
-  This implementation also mixes in the Enumerable module to allow standard access to the tree as a collection.
-email: 
-- anupamsg@gmail.com
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 0.9.0
+description: ! "    RubyTree is a Ruby implementation of the generic tree data structure.\n
+  \   It provides a node-based model to store uniquely identifiable node-elements
+  in\n    the tree and simple APIs to access, modify and traverse the structure.\n
+  \   RubyTree is node-centric, where individual nodes on the tree are the primary\n
+  \   compositional and structural elements.\n\n    This implementation also mixes
+  in the Enumerable module to allow standard\n    access to the tree as a collection.\n"
+email: anupamsg@gmail.com
 executables: []
-
 extensions: []
-
-extra_rdoc_files: 
-- History.txt
-- Manifest.txt
-- COPYING
-- API-CHANGES
-files: 
-- COPYING
-- History.txt
-- Manifest.txt
-- README
-- API-CHANGES
-- Rakefile
-- TODO
-- lib/tree.rb
+extra_rdoc_files:
+- README.rdoc
+- COPYING.rdoc
+- API-CHANGES.rdoc
+- History.rdoc
+files:
+- lib/rubytree.rb
 - lib/tree/binarytree.rb
-- setup.rb
+- lib/tree/tree_deps.rb
+- lib/tree/version.rb
+- lib/tree.rb
+- API-CHANGES.rdoc
+- COPYING.rdoc
+- Gemfile
+- Gemfile.lock
+- History.rdoc
+- Rakefile
+- README.rdoc
+- TODO.org
 - test/test_binarytree.rb
+- test/test_rubytree_require.rb
 - test/test_tree.rb
+- .dir-locals.el
 - .gemtest
 homepage: http://rubytree.rubyforge.org
-licenses: []
-
-post_install_message: |
-  ========================================================================
-  
-   Thank you for installing rubytree.
-  
-                WARNING: SIGNIFICANT API CHANGE in 0.8.0 !
-                ------------------------------------------
-  
-   Please note that as of 0.8.0 the CamelCase method names are DEPRECATED.
-  
-   The new method names follow the ruby_convention (separated by '_').
-  
-   The old CamelCase methods still work (a warning will be displayed),
-   but may go away in the future.
-  
-   Details of the API changes are documented in the API-CHANGES file.
-  
-  ========================================================================
-
-rdoc_options: 
-- --files
-- COPYING,API-CHANGES
+licenses:
+- BSD
+post_install_message: ! "    ========================================================================\n
+  \                   Thank you for installing rubytree.\n\n    Note that the TreeNode#siblings
+  method has changed in 0.8.3.\n    It now returns an empty array for the root node.\n\n
+  \                WARNING: SIGNIFICANT API CHANGE in 0.8.0 !\n                 ------------------------------------------\n\n
+  \   Please note that as of 0.8.0 the CamelCase method names are DEPRECATED.\n    The
+  new method names follow the ruby_convention (separated by '_').\n\n    The old CamelCase
+  methods still work (a warning will be displayed),\n    but may go away in the future.\n\n
+  \   Details of the API changes are documented in the API-CHANGES file.\n    ========================================================================\n"
+rdoc_options:
 - --title
 - Rubytree Documentation
 - --quiet
-require_paths: 
+require_paths:
 - lib
-required_ruby_version: !ruby/object:Gem::Requirement 
+required_ruby_version: !ruby/object:Gem::Requirement
   none: false
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      hash: 3
-      segments: 
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+      segments:
       - 0
-      version: "0"
-required_rubygems_version: !ruby/object:Gem::Requirement 
+      hash: -2468456900520768695
+required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      hash: 3
-      segments: 
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+      segments:
       - 0
-      version: "0"
+      hash: -2468456900520768695
 requirements: []
-
 rubyforge_project: rubytree
-rubygems_version: 1.8.10
+rubygems_version: 1.8.24
 signing_key: 
 specification_version: 3
-summary: RubyTree is a Ruby implementation of the generic tree data structure
-test_files: 
+summary: A generic tree data structure.
+test_files:
 - test/test_binarytree.rb
+- test/test_rubytree_require.rb
 - test/test_tree.rb