RubyGems - rubytree - Versions diffs - 0.9.2 → 0.9.3pre - Mend

rubytree 0.9.2 → 0.9.3pre

Files changed (9) hide show

checksums.yaml CHANGED Viewed

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 04cb1c44d2c9f5c11c5f9202b0e24202e287579a
-  data.tar.gz: a6b6581c4b1bcc106896889a092ece86a93e3bb5
+  metadata.gz: 3dd9b9757055ea2f6896146448b13996c7e099cf
+  data.tar.gz: 96f4a3cce558178889c67e64984778ad2192f42f
 SHA512:
-  metadata.gz: 9dcc9b36d0ca03c71c11658e637086ee9f2decbbe1429f296ea38afbc73c2902b5375387429c882329a64d2740ad43eb3abb0de34be03a4b58413c0098e36722
-  data.tar.gz: 33dc63cd509b22d768c29cca9dd7c75744add483b6003577df13ce3990541d38113420a17ad5b74c72993796b80e692164c1d7e580b91ccdf301505b4a1fb36a
+  metadata.gz: 32066b906cf88e1cba0ebc79c3b824e2f074ca884d90ddbbff76ee128ecc9f13c584fa362231f58c81ffc733574a4a780700e3d7b458b95476fe81920f17a71f
+  data.tar.gz: 7d1eef090b839f6c8a3335d0fc5b8820aea6a614d2c7e2f6de3b784dd318f39fe99ef6bdec5d7105cb4c17c1c403bf69524b1f7411ee7f8d07aba843dc211a34

data/Gemfile.lock CHANGED Viewed

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    rubytree (0.9.2)
+    rubytree (0.9.3pre)
       json (~> 1.8)
       structured_warnings (~> 0.1)
@@ -14,12 +14,13 @@ GEM
       simplecov (>= 0.7)
       term-ansicolor
       thor
-    docile (1.1.1)
+    docile (1.1.2)
     json (1.8.1)
     mime-types (2.0)
-    multi_json (1.8.2)
+    multi_json (1.8.4)
     rake (10.1.1)
-    rdoc (4.1.0)
+    rdoc (4.1.1)
+      json (~> 1.4)
     rest-client (1.6.7)
       mime-types (>= 1.16)
     rtags (0.98)

data/TAGS ADDED Viewed

@@ -0,0 +1,222 @@
+lib/rubytree.rb,0
+lib/tree/binarytree.rb,727
+module Tree::Tree43,1900
+  class BinaryTreeNode::Tree::BinaryTreeNode52,2209
+    def left_child::Tree::BinaryTreeNode#left_child62,2492
+    def right_child::Tree::BinaryTreeNode#right_child74,2883
+    def is_left_child?::Tree::BinaryTreeNode#is_left_child?83,3159
+    def is_right_child?::Tree::BinaryTreeNode#is_right_child?93,3490
+    def add::Tree::BinaryTreeNode#add110,4147
+    def inordered_each::Tree::BinaryTreeNode#inordered_each128,4666
+    def set_child_at::Tree::BinaryTreeNode#set_child_at159,5602
+    def left_child=::Tree::BinaryTreeNode#left_child=178,6270
+    def right_child=::Tree::BinaryTreeNode#right_child=190,6639
+    def swap_children::Tree::BinaryTreeNode#swap_children195,6785
+lib/tree/tree_deps.rb,0
+lib/tree/utils/camel_case_method_handler.rb,324
+module Tree::Tree41,1848
+  module CamelCaseMethodHandler::Tree::CamelCaseMethodHandler44,2004
+    def self.included::Tree::CamelCaseMethodHandler.included45,2038
+      def method_missing::Tree::CamelCaseMethodHandler#method_missing49,2186
+      def to_snake_case::Tree::CamelCaseMethodHandler#to_snake_case66,2798
+lib/tree/utils/json_converter.rb,258
+module Tree::Tree42,1899
+  def self.included::Tree.included44,1936
+  def as_json::Tree#as_json61,2387
+  def to_json::Tree#to_json89,3095
+  module ClassMethods::Tree::ClassMethods94,3245
+    def json_create::Tree::ClassMethods#json_create113,3960
+lib/tree/utils/metrics_methods.rb,718
+module Tree::Tree41,1833
+  module TreeMetricsHandler::Tree::TreeMetricsHandler43,1918
+    def self.included::Tree::TreeMetricsHandler.included44,1948
+      def size::Tree::TreeMetricsHandler#size56,2317
+      def length::Tree::TreeMetricsHandler#length67,2661
+      def node_height::Tree::TreeMetricsHandler#node_height80,3078
+      def node_depth::Tree::TreeMetricsHandler#node_depth96,3689
+      def level::Tree::TreeMetricsHandler#level105,3875
+      def depth::Tree::TreeMetricsHandler#depth124,4560
+      def breadth::Tree::TreeMetricsHandler#breadth140,5197
+      def in_degree::Tree::TreeMetricsHandler#in_degree154,5660
+      def out_degree::Tree::TreeMetricsHandler#out_degree165,5973
+lib/tree/utils/tree_merge_handler.rb,214
+module Tree::Tree40,1769
+  def merge::Tree#merge57,2500
+  def merge!::Tree#merge!72,3134
+  def check_merge_prerequisites::Tree#check_merge_prerequisites85,3441
+  def merge_trees::Tree#merge_trees102,4086
+lib/tree/utils/utils.rb,27
+module Tree::Tree39,1838
+lib/tree/version.rb,27
+module Tree::Tree38,1723
+lib/tree.rb,2676
+module Tree::Tree48,2158
+  class TreeNode::Tree::TreeNode85,3731
+    attr_reader   :name::Tree::TreeNode#name108,4483
+    attr_accessor :content::Tree::TreeNode#content115,4682
+    attr_reader   :parent::Tree::TreeNode#parent119,4798
+    def root::Tree::TreeNode#root126,5010
+    def is_root?::Tree::TreeNode#is_root?137,5316
+    def has_content?::Tree::TreeNode#has_content?145,5499
+    def is_leaf?::Tree::TreeNode#is_leaf?156,5753
+    def parentage::Tree::TreeNode#parentage168,6128
+    def has_children?::Tree::TreeNode#has_children?186,6554
+    def initialize::Tree::TreeNode#Tree::TreeNode.new209,7380
+    def detached_copy::Tree::TreeNode#detached_copy227,7997
+    def detached_subtree_copy::Tree::TreeNode#detached_subtree_copy237,8283
+    alias :dup::Tree::TreeNode#dup246,8544
+    def marshal_dump::Tree::TreeNode#marshal_dump251,8722
+    def create_dump_rep::Tree::TreeNode#create_dump_rep257,8890
+    def marshal_load::Tree::TreeNode#marshal_load272,9428
+    def to_s::Tree::TreeNode#to_s297,10212
+    def <<::Tree::TreeNode#<<320,10983
+    def add::Tree::TreeNode#add355,12489
+    def insertion_range::Tree::TreeNode#insertion_range375,13549
+    def remove!::Tree::TreeNode#remove!397,14336
+    def parent=::Tree::TreeNode#parent=412,14739
+    def remove_from_parent!::Tree::TreeNode#remove_from_parent!425,15124
+    def remove_all!::Tree::TreeNode#remove_all!436,15496
+    def set_as_root!::Tree::TreeNode#set_as_root!447,15725
+    def freeze_tree!::Tree::TreeNode#freeze_tree!457,16051
+    def []::Tree::TreeNode#[]497,17569
+    def each::Tree::TreeNode#each522,18536
+    def preordered_each::Tree::TreeNode#preordered_each550,19496
+    def postordered_each::Tree::TreeNode#postordered_each562,19908
+    def breadth_each::Tree::TreeNode#breadth_each598,21334
+    def children::Tree::TreeNode#children624,22272
+    def each_leaf::Tree::TreeNode#each_leaf645,22893
+    def first_child::Tree::TreeNode#first_child662,23315
+    def last_child::Tree::TreeNode#last_child670,23526
+    def first_sibling::Tree::TreeNode#first_sibling686,23973
+    def is_first_sibling?::Tree::TreeNode#is_first_sibling?696,24247
+    def last_sibling::Tree::TreeNode#last_sibling710,24663
+    def is_last_sibling?::Tree::TreeNode#is_last_sibling?720,24933
+    def siblings::Tree::TreeNode#siblings736,25486
+    def is_only_child?::Tree::TreeNode#is_only_child?755,26038
+    def next_sibling::Tree::TreeNode#next_sibling768,26441
+    def previous_sibling::Tree::TreeNode#previous_sibling784,26915
+    def <=>::Tree::TreeNode#<=>800,27426
+    def print_tree::Tree::TreeNode#print_tree808,27655
+test/run_test.rb,0
+test/test_binarytree.rb,1192
+module TestTree::TestTree39,1717
+  class TestBinaryTreeNode::TestTree::TestBinaryTreeNode41,1776
+    def setup::TestTree::TestBinaryTreeNode#setup44,1868
+    def teardown::TestTree::TestBinaryTreeNode#teardown52,2171
+    def test_initialize::TestTree::TestBinaryTreeNode#test_initialize59,2330
+    def test_add::TestTree::TestBinaryTreeNode#test_add67,2719
+    def test_inordered_each::TestTree::TestBinaryTreeNode#test_inordered_each90,3633
+    def test_left_child::TestTree::TestBinaryTreeNode#test_left_child134,5101
+    def test_right_child::TestTree::TestBinaryTreeNode#test_right_child142,5414
+    def test_left_child_equals::TestTree::TestBinaryTreeNode#test_left_child_equals150,5727
+    def test_right_child_equals::TestTree::TestBinaryTreeNode#test_right_child_equals169,6717
+    def test_is_left_child_eh::TestTree::TestBinaryTreeNode#test_is_left_child_eh189,7834
+    def test_is_right_child_eh::TestTree::TestBinaryTreeNode#test_is_right_child_eh204,8373
+    def test_swap_children::TestTree::TestBinaryTreeNode#test_swap_children218,8919
+    def test_old_camelCase_method_names::TestTree::TestBinaryTreeNode#test_old_camelCase_method_names236,9802
+test/test_rubytree_require.rb,203
+module TestTree::TestTree38,1678
+  class TestRequireRubytree::TestTree::TestRequireRubytree41,1759
+    def test_create_a_simple_node::TestTree::TestRequireRubytree#test_create_a_simple_node44,1884
+test/test_subclassed_node.rb,389
+module TestTree::TestTree39,1688
+  class TestSubclassedTreeNode::TestTree::TestSubclassedTreeNode42,1741
+    class MyNode::TestTree::TestSubclassedTreeNode::MyNode45,1868
+      def my_dummy_method::TestTree::TestSubclassedTreeNode::MyNode#my_dummy_method47,1967
+    def test_subclassed_camelcase_methods::TestTree::TestSubclassedTreeNode#test_subclassed_camelcase_methods52,2026
+test/test_thread_and_fiber.rb,422
+module TestTree::TestTree39,1695
+  class TestFiberAndThreadOnNode::TestTree::TestFiberAndThreadOnNode41,1747
+    def create_long_depth_trees::TestTree::TestFiberAndThreadOnNode#create_long_depth_trees44,1843
+    def test_fiber_for_recursion::TestTree::TestFiberAndThreadOnNode#test_fiber_for_recursion59,2260
+    def test_thread_for_recursion::TestTree::TestFiberAndThreadOnNode#test_thread_for_recursion73,2807
+test/test_tree.rb,5684
+module TestTree::TestTree39,1725
+  class TestTreeNode::TestTree::TestTreeNode41,1777
+    def setup::TestTree::TestTreeNode#setup65,2610
+    def setup_test_tree::TestTree::TestTreeNode#setup_test_tree77,3030
+    def teardown::TestTree::TestTreeNode#teardown84,3180
+    def test_has_version_number::TestTree::TestTreeNode#test_has_version_number89,3272
+    def test_root_setup::TestTree::TestTreeNode#test_root_setup94,3423
+    def test_root::TestTree::TestTreeNode#test_root111,4473
+    def test_has_content_eh::TestTree::TestTreeNode#test_has_content_eh124,5023
+    def test_length_is_size::TestTree::TestTreeNode#test_length_is_size135,5481
+    def test_spaceship::TestTree::TestTreeNode#test_spaceship141,5671
+    def test_is_comparable::TestTree::TestTreeNode#test_is_comparable167,6454
+    def test_to_s::TestTree::TestTreeNode#test_to_s185,7236
+    def test_first_sibling::TestTree::TestTreeNode#test_first_sibling218,8954
+    def test_is_first_sibling_eh::TestTree::TestTreeNode#test_is_first_sibling_eh231,9682
+    def test_is_last_sibling_eh::TestTree::TestTreeNode#test_is_last_sibling_eh242,10165
+    def test_last_sibling::TestTree::TestTreeNode#test_last_sibling253,10633
+    def test_siblings::TestTree::TestTreeNode#test_siblings265,11287
+    def test_is_only_child_eh::TestTree::TestTreeNode#test_is_only_child_eh293,12210
+    def test_next_sibling::TestTree::TestTreeNode#test_next_sibling304,12646
+    def test_previous_sibling::TestTree::TestTreeNode#test_previous_sibling315,13146
+    def test_add::TestTree::TestTreeNode#test_add326,13675
+    def test_add_duplicate::TestTree::TestTreeNode#test_add_duplicate347,14357
+    def test_add_at_specific_position::TestTree::TestTreeNode#test_add_at_specific_position378,15292
+    def test_remove_bang::TestTree::TestTreeNode#test_remove_bang442,18345
+    def test_remove_all_bang::TestTree::TestTreeNode#test_remove_all_bang474,19308
+    def test_remove_from_parent_bang::TestTree::TestTreeNode#test_remove_from_parent_bang484,19614
+    def test_children::TestTree::TestTreeNode#test_children503,20329
+    def test_first_child::TestTree::TestTreeNode#test_first_child539,21918
+    def test_last_child::TestTree::TestTreeNode#test_last_child548,22246
+    def test_find::TestTree::TestTreeNode#test_find557,22562
+    def test_parentage::TestTree::TestTreeNode#test_parentage572,23157
+    def test_each::TestTree::TestTreeNode#test_each581,23489
+    def test_each_leaf::TestTree::TestTreeNode#test_each_leaf600,24173
+    def test_parent::TestTree::TestTreeNode#test_parent627,25368
+    def test_indexed_access::TestTree::TestTreeNode#test_indexed_access638,25787
+    def test_print_tree::TestTree::TestTreeNode#test_print_tree649,26160
+    def test_marshal_dump::TestTree::TestTreeNode#test_marshal_dump656,26320
+    alias test_marshal_load::TestTree::TestTreeNode#test_marshal_load698,28442
+    def test_collect::TestTree::TestTreeNode#test_collect701,28563
+    def test_freeze_tree_bang::TestTree::TestTreeNode#test_freeze_tree_bang711,28829
+    def test_content::TestTree::TestTreeNode#test_content725,29351
+    def test_depth::TestTree::TestTreeNode#test_depth733,29742
+    def do_deprecated_depth::TestTree::TestTreeNode#do_deprecated_depth744,30115
+    def test_node_height::TestTree::TestTreeNode#test_node_height762,30683
+    def test_node_depth::TestTree::TestTreeNode#test_node_depth787,31892
+    def test_level::TestTree::TestTreeNode#test_level800,32329
+    def test_breadth::TestTree::TestTreeNode#test_breadth815,32872
+    def test_breadth_each::TestTree::TestTreeNode#test_breadth_each834,33519
+    def test_preordered_each::TestTree::TestTreeNode#test_preordered_each875,34825
+    def test_postordered_each::TestTree::TestTreeNode#test_postordered_each914,36079
+    def test_detached_copy::TestTree::TestTreeNode#test_detached_copy953,37334
+    def test_detached_subtree_copy::TestTree::TestTreeNode#test_detached_subtree_copy970,38062
+    def test_has_children_eh::TestTree::TestTreeNode#test_has_children_eh1004,40314
+    def test_is_leaf_eh::TestTree::TestTreeNode#test_is_leaf_eh1010,40476
+    def test_is_root_eh::TestTree::TestTreeNode#test_is_root_eh1017,40682
+    def test_content_equals::TestTree::TestTreeNode#test_content_equals1023,40845
+    def test_size::TestTree::TestTreeNode#test_size1031,41110
+    def test_lt2::TestTree::TestTreeNode#test_lt21040,41374
+    def test_index::TestTree::TestTreeNode#test_index1051,41866
+    def test_in_degree::TestTree::TestTreeNode#test_in_degree1072,42962
+    def test_out_degree::TestTree::TestTreeNode#test_out_degree1083,43429
+    def test_json_serialization::TestTree::TestTreeNode#test_json_serialization1094,43916
+    def test_json_deserialization::TestTree::TestTreeNode#test_json_deserialization1118,44716
+    def test_json_roundtrip::TestTree::TestTreeNode#test_json_roundtrip1146,45902
+    def test_old_camelCase_method_names::TestTree::TestTreeNode#test_old_camelCase_method_names1162,46643
+    def test_integer_node_names::TestTree::TestTreeNode#test_integer_node_names1193,47711
+    def test_add_node_to_self_as_child::TestTree::TestTreeNode#test_add_node_to_self_as_child1224,48941
+    def test_single_node_becomes_leaf::TestTree::TestTreeNode#test_single_node_becomes_leaf1236,49367
+    def test_unique_node_names::TestTree::TestTreeNode#test_unique_node_names1248,49788
+    def setup_other_test_tree::TestTree::TestTreeNode#setup_other_test_tree1262,50143
+    def test_merge::TestTree::TestTreeNode#test_merge1290,51132
+    def test_merge_bang::TestTree::TestTreeNode#test_merge_bang1319,52570

data/TODO.org CHANGED Viewed

@@ -224,7 +224,10 @@
 * Unplanned / Not assigned to any release
 *** TODO Create a cycle-detection/validation mechanism to prevent cyclic graphs of nodes.
-*** TODO Revert the forced install of rubygem 2.1.11 from [[file:.travis.yml][.travis.yml]]
+*** DONE Revert the forced install of rubygem 2.1.11 from [[file:.travis.yml][.travis.yml]]
+    CLOSED: [2014-01-12 Sun 19:06]
+    The issue seems to have been resolved with the 2.2.1 release of Rubygems.
 *** TODO Create a generic validation method to check for various issues in the created tree.
 *** TODO Add a FAQ document to the project.
 *** TODO The semantic of length is probably unclear.  Should return the node_depth instead (or remove the method)

data/lib/tree.rb CHANGED Viewed

@@ -9,7 +9,7 @@
 # Author:: Anupam Sengupta (anupamsg@gmail.com)
 #
-# Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 Anupam Sengupta
+# Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014 Anupam Sengupta
 #
 # All rights reserved.
 #
@@ -40,11 +40,6 @@
 #
 require 'tree/tree_deps'
-require 'tree/version'
-require 'tree/utils/metrics_methods'
-require 'tree/utils/camel_case_method_handler'
-require 'tree/utils/json_converter'
-require 'tree/utils/tree_merge_handler'
 # This module provides a *TreeNode* class whose instances are the primary objects
 # for representing nodes in the tree.
@@ -57,8 +52,8 @@ module Tree
   # This class models the nodes for an *N-ary* tree data structure. The
   # nodes are *named*, and have a place-holder for the node data (i.e.,
   # _content_ of the node). The node names are required to be *unique*
-  # within the tree (as the name is implicitly used as an _ID_ within
-  # the data structure).
+  # amongst the sibling/peer nodes. Note that the name is implicitly
+  # used as an _ID_ within the data structure).
   #
   # The node's _content_ is *not* required to be unique across
   # different nodes in the tree, and can be +nil+ as well.
@@ -360,9 +355,10 @@ module Tree
     def add(child, at_index = -1)
       raise ArgumentError, "Attempting to add a nil node" unless child # Only handles the immediate child scenario
       raise ArgumentError, "Attempting add node to itself" if self == child
+      raise ArgumentError, "Attempting to add root as a child" if self.root == child
       # Lazy mans unique test, won't test if children of child are unique in this tree too.
-      self.root.each { |node| raise "Child #{child.name} already added!" if node.name == child.name }
+      #self.root.each { |node| raise "Child #{child.name} already added!" if node.name == child.name }
+      self.children.each { |node| raise "Child #{child.name} already added!" if node.name == child.name }
       if insertion_range.include?(at_index)
         @children.insert(at_index, child)

data/lib/tree/tree_deps.rb CHANGED Viewed

@@ -7,7 +7,7 @@
 # Author:: Anupam Sengupta (anupamsg@gmail.com)
 #
-# Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011, 2012 Anupam Sengupta
+# Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2014 Anupam Sengupta
 #
 # All rights reserved.
 #
@@ -39,3 +39,9 @@
 require 'structured_warnings'
 require 'json'
+require 'tree/version'
+require 'tree/utils/metrics_methods'
+require 'tree/utils/camel_case_method_handler'
+require 'tree/utils/json_converter'
+require 'tree/utils/tree_merge_handler'

data/lib/tree/version.rb CHANGED Viewed

@@ -37,5 +37,5 @@
 #
 module Tree
   # Rubytree Package Version
-  VERSION = '0.9.2'
+  VERSION = '0.9.3pre'
 end

data/test/test_tree.rb CHANGED Viewed

@@ -2,7 +2,7 @@
 # test_tree.rb - This file is part of the RubyTree package.
 #
-# Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 Anupam Sengupta
+# Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014 Anupam Sengupta
 #
 # All rights reserved.
 #
@@ -339,13 +339,41 @@ module TestTree
       assert_equal(5, @root.size, "Should have five nodes")
       assert_equal(2, @child3.size, "Should have two nodes")
-      # Test the addition of a duplicate node (duplicate being defined as a node with the same name).
-      assert_raise(RuntimeError) { @root.add(Tree::TreeNode.new(@child1.name)) }
       # Test the addition of a nil node.
       assert_raise(ArgumentError) { @root.add(nil) }
     end
+    # Test the addition of a duplicate node (duplicate being defined as a node with the same name).
+    def test_add_duplicate
+      # We need to allow duplicate nodes which are not *siblings*.
+      # Example (see https://github.com/evolve75/RubyTree/issues/24):
+      #
+      # * root
+      # |---+ one
+      # |   +---> deep
+      # +---+ two
+      #     +---> deep
+      #
+      # In this case, the two 'deep' nodes should not be considered duplicates
+      root = Tree::TreeNode.new("root")
+      one  = Tree::TreeNode.new("one")
+      two  = Tree::TreeNode.new("two")
+      deep = Tree::TreeNode.new("deep")
+      root << one << deep
+      # The same child cannot be added under any circumstance
+      assert_raise(RuntimeError) { root.add(Tree::TreeNode.new(one.name)) }
+      assert_raise(RuntimeError) { root.add(one) }
+      begin
+        root << two << deep
+      rescue RuntimeError => e
+        fail("Error! The RuntimeError should not have been thrown.")
+      end
+    end
     # Test Addition at a specific position
     def test_add_at_specific_position
       assert(!@root.has_children?, "Should not have any children")
@@ -1201,7 +1229,7 @@ module TestTree
       # And now a scenario where the node addition is done down the hierarchy
       child =  Tree::TreeNode.new("child")
-      assert_raise(RuntimeError) { root << child << root }
+      assert_raise(ArgumentError) { root << child << root }
     end
     # Test whether the tree_leaf method works correctly
@@ -1215,12 +1243,19 @@ module TestTree
     end
-    # Test if node names are really unique in the whole tree
+    # Test if node names are really unique in the child array.
+    # Note that this does not prevent duplicates elsewhere in the tree.
     def test_unique_node_names
       setup_test_tree
       assert_raise(RuntimeError) { @root << @child1 }
-      assert_raise(RuntimeError) { @root.first_child << @child2 }
+      begin
+        @root.first_child << @child2
+      rescue RuntimeError => e
+        fail("No error should have been raised for adding a non-sibling duplicate.")
+      end
     end
     # Setup function to build some extra trees to play with.

metadata CHANGED Viewed

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rubytree
 version: !ruby/object:Gem::Version
-  version: 0.9.2
+  version: 0.9.3pre
 platform: ruby
 authors:
 - Anupam Sengupta
@@ -136,6 +136,7 @@ files:
 - LICENSE.md
 - README.md
 - Rakefile
+- TAGS
 - TODO.org
 - examples/example_basic.rb
 - lib/rubytree.rb
@@ -189,12 +190,12 @@ required_ruby_version: !ruby/object:Gem::Requirement
       version: 1.8.7
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - ">="
+  - - ">"
     - !ruby/object:Gem::Version
-      version: '0'
+      version: 1.3.1
 requirements: []
 rubyforge_project: rubytree
-rubygems_version: 2.2.0.rc.1
+rubygems_version: 2.2.1
 signing_key:
 specification_version: 4
 summary: A generic tree data structure.