rubytree 0.9.7 → 2.0.0

data/History.rdoc

@@ -1,303 +0,0 @@
-= History of Changes
-
-=== 0.9.7 / 2015-12-31
-
-* Released 0.9.6. This is a minor bug-fix release.
-
-* This release allows the {Tree::TreeNode#print_tree} method to be used on
-  non-root nodes. Thanks to {https://github.com/ojab Ojab}.
-
-* The spaceship operator ('<=>') now returns 'nil' if the object being compared
-  to is itself 'nil' or not another {Tree::TreeNode}.
-
-=== 0.9.6 / 2015-05-30
-
-* Released 0.9.6, which is same as 0.9.5, except for an update to the Gem release date.
-
-=== 0.9.5 / 2015-05-30
-
-* Released 0.9.5.
-
-=== 0.9.5pre7 / 2015-05-30
-
-* Added new methods for getting the path of a node as a string. These have been
-  added as a new mixin {Tree::Utils::TreePathHandler}. Thanks to
-  {https://github.com/MZic Marco Ziccardi}.
-
-=== 0.9.5pre5 / 2015-01-01
-
-* Fixed {issue 32}[https://github.com/evolve75/RubyTree/issues/32] and enabled
-  'move' semantics on the {Tree::TreeNode#add} method, so that a child being
-  added, that has an existing parent, will be removed from its old parent, prior
-  to being added to the new location.
-
-=== 0.9.5pre4 / 2014-12-17
-
-* Added performance improvements to {Tree::TreeNode#is_root?} and
-  {Tree::Utils::TreeMetricsHandler#node_depth}.
-  Thanks to {https://github.com/aidansteele Aidan Steel}.
-
-=== 0.9.5pre3 / 2014-12-16
-
-* Minor fix to correct the release date. This release is otherwise identical to
-  0.9.5pre2.
-
-=== 0.9.5pre2 / 2014-12-16
-
-* Added {Tree::TreeNode#rename} and {Tree::TreeNode#rename_child} methods by
-  merging in code from {https://github.com/evolve75/RubyTree/pull/35}. Thanks to
-  {http://github.com/packetmonkey Evan Sharp}.
-
-=== 0.9.5pre / 2014-11-01
-
-* Fixed {issue 13}[https://github.com/evolve75/RubyTree/issues/13] with the
-  patch provided by {Jen Hamon}[http://www.github.com/jhamon].
-
-* Fixed a bug in {Tree::TreeNode#print_tree} with the patch provided by
-  {https://github.com/packetmonkey Evan Sharp}.
-
-* Fixed {issue 31}[https://github.com/evolve75/RubyTree/issues/31], which was
-  causing incorrect behavior n {Tree::TreeNode#postordered_each} and
-  {Tree::TreeNode#breadth_each} methods when a block was not provided.
-
-=== 0.9.4 / 2014-07-04
-
-* Changed all references to {http://rubyforge.org}.
-
-=== 0.9.3 / 2014-02-01
-
-* Fixed the issue with globally unique node names. See Github issue #24.
-
-=== 0.9.2 / 2014-01-03
-
-* Yanked R0.9.1 as the History file was not updated.
-
-* Updated the gem description.
-
-* Changed the travis-ci build to include coverall support.
-
-=== 0.9.1 / 2014-01-03
-
-* Updated the Gem description.
-
-* Incorporated code coverage using the coverall gem.
-
-=== 0.9.0 / 2014-01-02
-
-This is a feature and bug-fix release.
-
-==== The Features
-
-* Rubytree now supports +postordered+ traversal via the
-  {Tree::TreeNode#postordered_each} method. Thanks to
-  {https://github.com/pdecourcel Paul de Courcel} for this.
-
-* The Binary tree now supports +inorder+ traversal via the
-  {Tree::BinaryTreeNode#inordered_each} method.
-
-* Ability to merge in another tree at a chosen node, or merge two trees to
-  create a third tree. Thanks to {https://github.com/dazoakley Darren Oakley}
-  for this ({https://github.com/evolve75/RubyTree/pull/2 pull request #2})
-
-* RubyTree now mixes in the {http://ruby-doc.org/core-1.8.7/Comparable.html
-  Comparable} module.
-
-==== The Fixes
-
-* (Partial) fix for preventing cyclic graphs in the tree
-
-* Refactored the {Tree::TreeNode#each} method to prevent stack errors while
-  navigating deep trees
-  ({https://github.com/evolve75/RubyTree/issues/12 issue #12})
-
-* Check to ensure that the added node's name is unique to the destination tree
-  ({https://github.com/evolve75/RubyTree/pull/9 merge #9}). Thanks to
-  {https://github.com/ysf Youssef Rebahi-Gilbert} for the idea and the initial
-  code
-
-* Fix for {issue 23}[https://github.com/evolve75/RubyTree/issues/23], where the
-  tree traversal on a binary tree would fail if the _left_ child was +nil+
-
-* The traversal methods ({Tree::TreeNode#each},
-  {Tree::TreeNode#preordered_each}, {Tree::TreeNode#postordered_each} and
-  {Tree::TreeNode#breadth_each}) now correctly return an
-  {http://ruby-doc.org/core-1.8.7/Enumerable.html Enumerator} as the
-  return value when no block is given, and return the receiver node if a block was
-  provided. This is consistent with how the standard Ruby collections work.
-
-==== Other Changes
-
-* Structural changes in the code to refactor out the non-core functions into
-  modules (mostly by extracting out non-core code as mixins).
-
-* Significant refactoring of the documentation. The {http://yardoc.org Yardoc}
-  tags are now extensively used.
-
-* Basic support built-in for including example code in the Gem. This will be
-  fully expanded in the next release.
-
-* Various changes to the {http://bundler.io bundler}, {https://travis-ci.org
-  travis-ci} and other Rakefile related changes.
-
-=== 0.8.3 / 2012-08-21
-
-This is a primarily a bug-fix release, with some packaging changes.
-
-* Have removed the dependency on Hoe[https://github.com/seattlerb/hoe]. The
-  build is now vanilla
-  {gemspec}[http://guides.rubygems.org/specification-reference/] based.
-
-* Included support for {gem-testers}[http://test.rubygems.org/].
-
-* Included support for {Bundler}[http://gembundler.com/].
-
-* Implemented the {Tree::Utils::JSONConverter#as_json} method to support Rails'
-  JSON encoding, by pulling in the changes by Eric Cline
-  (https://github.com/escline).
-
-* Partial fix for {Github Bug
-  #5}[https://github.com/evolve75/RubyTree/issues/5]. This is to
-  prevent infinite looping is an existing node is added again
-  elsewhere in the tree.
-
-* Fixed the issue with using +integers+ as node names, and its
-  interaction with the +Tree::TreeNode#[]+ access method as documented in
-  {Github Bug #6}[https://github.com/evolve75/RubyTree/issues/6].
-
-* Clarified the need to have unique node names {Github Bug
-  #7}[https://github.com/evolve75/RubyTree/issues/7] (documentation).
-
-* Fixed {Tree::TreeNode#siblings} method to return an empty array for the
-  root node as well (it returned +nil+ earlier).
-
-=== 0.8.2 / 2011-12-15
-
-* Minor bug-fix release to address bug #1215 ({Tree::TreeNode#to_s}
-  breaks if +@content+ or +@parent.name+ is not a string).
-
-=== 0.8.1 / 2010-10-02
-
-* This is the public release of +R0.8.0+, with additional bug-fixes.
-  Note that +R0.8.0+ will not be released separately as a publicly
-  available Rubygem. All changes as listed for +R0.8.0+ are available in
-  this release.
-
-* The main change in +R0.8.0+/+R0.8.1+ is conversion of all CamelCase
-  method names to snake_case. The old CamelCase method names will
-  still work (to ensure backwards compatibility), but will also
-  display a warning.
-
-* The {Tree::TreeNode#add} method now accepts an optional child insertion
-  point.
-
-* The subtree from the current node can now be cloned in its entirety
-  using the {Tree::TreeNode#detached_subtree_copy} method.
-
-* A major bug-fix for {bug #28613}[http://rubyforge.org/tracker/index.php?func=detail&aid=28613&group_id=1215&atid=4793]
-  which impacted the Binarytree implementation.
-
-* Minor code re-factoring driven by the code-smell checks using
-  {reek}[https://github.com/troessner/reek].
-
-* Inclusion of the +reek+ code-smell detection tool in the Rakefile.
-
-=== 0.8.0 / 2010-05-04
-
-* Updated the {Tree::TreeNode#add} method to allow the optional specification
-  of an insertion position in the child array.
-
-* Added a new method {Tree::TreeNode#detached_subtree_copy} to allow cloning
-  the entire tree (this method is also aliased as +dup+).
-
-* Converted all +CamelCase+ method names to the canonical +ruby_method_names+
-  (underscore separated). The +CamelCase+ methods _can still_ be invoked, but will
-  throw a {http://rug-b.rubyforge.org/structured_warnings/rdoc/ Deprecated
-  warning}.
-  The support for old CamelCase methods will go away some time in the future,
-  so the user is advised to convert all current method invocations
-  to the new names.
-
-=== 0.7.0 / 2010-05-03
-
-* Added new methods to report the degree statistics of a node.
-
-* Added a convenience method alias
-  {Tree::Utils::TreeMetricsHandler#level Tree::TreeNode#level} to +nodeDepth+.
-
-* Converted the exceptions thrown on invalid arguments to
-  {http://www.ruby-doc.org/core-2.0.0/ArgumentError.html ArgumentError}
-  instead of {http://www.ruby-doc.org/core-2.0.0/RuntimeError.html RuntimeError}.
-
-* Converted the documentation to {http://yardoc.org Yard} format.
-
-* Added new methods for converting from/to {http://www.json.org JSON} formats.
-  Thanks to Dirk Breuer[http://github.com/railsbros-dirk] for this
-  fork[http://github.com/galaxycats/].
-
-* Added a separate {file:API-CHANGES.rdoc} documentation file.
-
-* Added fixes for root related edge conditions to {Tree::TreeNode#is_only_child?
-  isOnlyChild?}, {Tree::TreeNode#next_sibling nextSibling},
-  {Tree::TreeNode#previous_sibling previousSibling} and
-  {Tree::TreeNode#remove! remove!} methods.
-
-* Removed the 'ChangeLog' file as this can now be generated from the git logs.
-
-* Other minor code cleanup.
-
-=== 0.6.2 / 2010-01-30
-
-* Updated the documentation.
-
-=== 0.6.1 / 2010-01-04
-
-* Changed the hard-dependency on the 'structured_warnings' RubyGem to a
-  soft-dependency - which lets Rubytree still work if this RubyGem is not
-  available. The rationale for this is that we should not require the user to
-  install a separate library just for one single edge-case function (in this
-  case, to indicate a deprecated method). However, if the library _is_ available
-  on the user's system, then it will get used.
-
-=== 0.6.0 / 2010-01-03
-
-* Fixed the
-  bug#22535[http://rubyforge.org/tracker/index.php?func=detail&aid=22535&group_id=1215&atid=4793]
-  where the {Tree::Utils::TreeMetricsHandler#depth Tree::TreeNode#depth} method
-  was actually returning height+1 (not the depth).
-
-* Marked the {Tree::Utils::TreeMetricsHandler#depth Tree::TreeNode#depth}
-  method as *deprecated* (and introduced the run-time dependency on
-  structured-warnings[http://github.com/schmidt/structured_warnings] gem).
-
-=== 0.5.3 / 2009-12-31
-
-* Cleanup of the build system to exclusively use Hoe.
-* Modifications and reformatting to the documentation.
-* No user visible changes.
-
-=== 0.5.2 / 2007-12-21
-
-* Added more test cases and enabled
-  {https://github.com/seattlerb/zentest ZenTest} compatibility for the test case
-  names.
-
-=== 0.5.1 / 2007-12-20
-
-* Minor code refactoring.
-
-=== 0.5.0 / 2007-12-18
-
-* Fixed the marshalling code to correctly handle non-string content.
-
-=== 0.4.3 / 2007-10-09
-
-* Changes to the build mechanism (now uses
-{http://www.zenspider.com/projects/hoe.html Hoe}).
-
-=== 0.4.2 / 2007-10-01
-
-* Minor code refactoring. Changes in the Rakefile.
-
-;; Local Variables:
-;; mode: rdoc
-;; End:

data/TAGS

@@ -1,248 +0,0 @@
-
-lib/rubytree.rb,0
-
-lib/tree/binarytree.rb,795
-module Tree::Tree
43,1906
-  class BinaryTreeNode::Tree::BinaryTreeNode
52,2215
-    def left_child::Tree::BinaryTreeNode#left_child
62,2498
-    def right_child::Tree::BinaryTreeNode#right_child
74,2889
-    def is_left_child?::Tree::BinaryTreeNode#is_left_child?
83,3165
-    def is_right_child?::Tree::BinaryTreeNode#is_right_child?
93,3496
-    def add::Tree::BinaryTreeNode#add
110,4153
-    def add_from_hash::Tree::BinaryTreeNode#add_from_hash
143,5539
-    def inordered_each::Tree::BinaryTreeNode#inordered_each
160,6096
-    def set_child_at::Tree::BinaryTreeNode#set_child_at
191,7032
-    def left_child=::Tree::BinaryTreeNode#left_child=
210,7700
-    def right_child=::Tree::BinaryTreeNode#right_child=
222,8069
-    def swap_children::Tree::BinaryTreeNode#swap_children
227,8215
-
-lib/tree/tree_deps.rb,0
-
-lib/tree/utils/camel_case_method_handler.rb,324
-module Tree::Tree
41,1848
-  module CamelCaseMethodHandler::Tree::CamelCaseMethodHandler
44,2004
-    def self.included::Tree::CamelCaseMethodHandler.included
45,2038
-      def method_missing::Tree::CamelCaseMethodHandler#method_missing
49,2186
-      def to_snake_case::Tree::CamelCaseMethodHandler#to_snake_case
66,2798
-
-lib/tree/utils/hash_converter.rb,265
-module Tree::Tree
40,1916
-  def self.included::Tree.included
42,1953
-  module ClassMethods::Tree::ClassMethods
49,2177
-    def from_hash::Tree::ClassMethods#from_hash
86,3823
-    def add_from_hash::Tree#add_from_hash
129,5519
-    def to_h::Tree#to_h
151,6367
-
-lib/tree/utils/json_converter.rb,258
-module Tree::Tree
42,1925
-  def self.included::Tree.included
44,1962
-  def as_json::Tree#as_json
61,2413
-  def to_json::Tree#to_json
89,3121
-  module ClassMethods::Tree::ClassMethods
94,3271
-    def json_create::Tree::ClassMethods#json_create
113,3986
-
-lib/tree/utils/metrics_methods.rb,718
-module Tree::Tree
41,1833
-  module TreeMetricsHandler::Tree::TreeMetricsHandler
43,1918
-    def self.included::Tree::TreeMetricsHandler.included
44,1948
-      def size::Tree::TreeMetricsHandler#size
56,2317
-      def length::Tree::TreeMetricsHandler#length
67,2661
-      def node_height::Tree::TreeMetricsHandler#node_height
80,3078
-      def node_depth::Tree::TreeMetricsHandler#node_depth
96,3689
-      def level::Tree::TreeMetricsHandler#level
105,3875
-      def depth::Tree::TreeMetricsHandler#depth
124,4560
-      def breadth::Tree::TreeMetricsHandler#breadth
140,5197
-      def in_degree::Tree::TreeMetricsHandler#in_degree
154,5660
-      def out_degree::Tree::TreeMetricsHandler#out_degree
165,5973
-
-lib/tree/utils/tree_merge_handler.rb,214
-module Tree::Tree
40,1769
-  def merge::Tree#merge
57,2500
-  def merge!::Tree#merge!
72,3134
-  def check_merge_prerequisites::Tree#check_merge_prerequisites
85,3441
-  def merge_trees::Tree#merge_trees
102,4086
-
-lib/tree/utils/utils.rb,27
-module Tree::Tree
39,1838
-
-lib/tree/version.rb,27
-module Tree::Tree
38,1723
-
-lib/tree.rb,2947
-module Tree::Tree
48,2158
-  class TreeNode::Tree::TreeNode
85,3731
-    attr_reader   :name::Tree::TreeNode#name
113,4634
-    attr_accessor :content::Tree::TreeNode#content
120,4833
-    attr_reader   :parent::Tree::TreeNode#parent
124,4949
-    def root::Tree::TreeNode#root
131,5161
-    def is_root?::Tree::TreeNode#is_root?
142,5467
-    def has_content?::Tree::TreeNode#has_content?
150,5650
-    def is_leaf?::Tree::TreeNode#is_leaf?
161,5904
-    def parentage::Tree::TreeNode#parentage
173,6279
-    def has_children?::Tree::TreeNode#has_children?
191,6705
-    def initialize::Tree::TreeNode#Tree::TreeNode.new
214,7531
-    def detached_copy::Tree::TreeNode#detached_copy
232,8148
-    def detached_subtree_copy::Tree::TreeNode#detached_subtree_copy
242,8434
-    alias :dup::Tree::TreeNode#dup
251,8695
-    def marshal_dump::Tree::TreeNode#marshal_dump
256,8873
-    def create_dump_rep::Tree::TreeNode#create_dump_rep
262,9041
-    def marshal_load::Tree::TreeNode#marshal_load
277,9579
-    def to_s::Tree::TreeNode#to_s
302,10363
-    def <<::Tree::TreeNode#<<
325,11134
-    def add::Tree::TreeNode#add
360,12662
-    def insertion_range::Tree::TreeNode#insertion_range
380,13624
-    def rename::Tree::TreeNode#rename
394,13993
-    def rename_child::Tree::TreeNode#rename_child
413,14502
-    def name=::Tree::TreeNode#name=
426,14986
-    def replace!::Tree::TreeNode#replace!
436,15333
-    def replace_with::Tree::TreeNode#replace_with
450,15706
-    def remove!::Tree::TreeNode#remove!
468,16438
-    def parent=::Tree::TreeNode#parent=
483,16841
-    def remove_from_parent!::Tree::TreeNode#remove_from_parent!
496,17234
-    def remove_all!::Tree::TreeNode#remove_all!
507,17606
-    def set_as_root!::Tree::TreeNode#set_as_root!
518,17835
-    def freeze_tree!::Tree::TreeNode#freeze_tree!
528,18161
-    def []::Tree::TreeNode#[]
568,19679
-    def each::Tree::TreeNode#each
593,20646
-    def preordered_each::Tree::TreeNode#preordered_each
621,21606
-    def postordered_each::Tree::TreeNode#postordered_each
633,22018
-    def breadth_each::Tree::TreeNode#breadth_each
669,23463
-    def children::Tree::TreeNode#children
695,24416
-    def each_leaf::Tree::TreeNode#each_leaf
716,25037
-    def first_child::Tree::TreeNode#first_child
733,25459
-    def last_child::Tree::TreeNode#last_child
741,25670
-    def first_sibling::Tree::TreeNode#first_sibling
757,26117
-    def is_first_sibling?::Tree::TreeNode#is_first_sibling?
767,26391
-    def last_sibling::Tree::TreeNode#last_sibling
781,26807
-    def is_last_sibling?::Tree::TreeNode#is_last_sibling?
791,27077
-    def siblings::Tree::TreeNode#siblings
807,27630
-    def is_only_child?::Tree::TreeNode#is_only_child?
826,28182
-    def next_sibling::Tree::TreeNode#next_sibling
839,28585
-    def previous_sibling::Tree::TreeNode#previous_sibling
855,29059
-    def <=>::Tree::TreeNode#<=>
871,29570
-    def print_tree::Tree::TreeNode#print_tree
881,29950
-
-test/run_test.rb,0
-
-test/test_binarytree.rb,1361
-module TestTree::TestTree
39,1717
-  class TestBinaryTreeNode::TestTree::TestBinaryTreeNode
41,1776
-    def setup::TestTree::TestBinaryTreeNode#setup
44,1868
-    def teardown::TestTree::TestBinaryTreeNode#teardown
52,2171
-    def test_initialize::TestTree::TestBinaryTreeNode#test_initialize
59,2330
-    def test_from_hash::TestTree::TestBinaryTreeNode#test_from_hash
66,2692
-    def test_add_from_hash::TestTree::TestBinaryTreeNode#test_add_from_hash
101,4024
-    def test_add::TestTree::TestBinaryTreeNode#test_add
134,5134
-    def test_inordered_each::TestTree::TestBinaryTreeNode#test_inordered_each
157,6048
-    def test_left_child::TestTree::TestBinaryTreeNode#test_left_child
201,7516
-    def test_right_child::TestTree::TestBinaryTreeNode#test_right_child
209,7829
-    def test_left_child_equals::TestTree::TestBinaryTreeNode#test_left_child_equals
217,8142
-    def test_right_child_equals::TestTree::TestBinaryTreeNode#test_right_child_equals
236,9132
-    def test_is_left_child_eh::TestTree::TestBinaryTreeNode#test_is_left_child_eh
256,10249
-    def test_is_right_child_eh::TestTree::TestBinaryTreeNode#test_is_right_child_eh
271,10788
-    def test_swap_children::TestTree::TestBinaryTreeNode#test_swap_children
285,11334
-    def test_old_camelCase_method_names::TestTree::TestBinaryTreeNode#test_old_camelCase_method_names
303,12217
-
-test/test_rubytree_require.rb,203
-module TestTree::TestTree
38,1678
-  class TestRequireRubytree::TestTree::TestRequireRubytree
41,1759
-    def test_create_a_simple_node::TestTree::TestRequireRubytree#test_create_a_simple_node
44,1884
-
-test/test_subclassed_node.rb,389
-module TestTree::TestTree
39,1688
-  class TestSubclassedTreeNode::TestTree::TestSubclassedTreeNode
42,1741
-    class MyNode::TestTree::TestSubclassedTreeNode::MyNode
45,1868
-      def my_dummy_method::TestTree::TestSubclassedTreeNode::MyNode#my_dummy_method
47,1967
-    def test_subclassed_camelcase_methods::TestTree::TestSubclassedTreeNode#test_subclassed_camelcase_methods
52,2026
-
-test/test_thread_and_fiber.rb,422
-module TestTree::TestTree
39,1695
-  class TestFiberAndThreadOnNode::TestTree::TestFiberAndThreadOnNode
41,1747
-    def create_long_depth_trees::TestTree::TestFiberAndThreadOnNode#create_long_depth_trees
44,1843
-    def test_fiber_for_recursion::TestTree::TestFiberAndThreadOnNode#test_fiber_for_recursion
59,2260
-    def test_thread_for_recursion::TestTree::TestFiberAndThreadOnNode#test_thread_for_recursion
73,2807
-
-test/test_tree.rb,6492
-module TestTree::TestTree
39,1725
-  class TestTreeNode::TestTree::TestTreeNode
41,1777
-    def setup::TestTree::TestTreeNode#setup
65,2610
-    def setup_test_tree::TestTree::TestTreeNode#setup_test_tree
77,3030
-    def teardown::TestTree::TestTreeNode#teardown
84,3180
-    def test_has_version_number::TestTree::TestTreeNode#test_has_version_number
89,3272
-    def test_root_setup::TestTree::TestTreeNode#test_root_setup
94,3423
-    def test_root::TestTree::TestTreeNode#test_root
111,4473
-    def test_from_hash::TestTree::TestTreeNode#test_from_hash
123,4974
-    def test_from_hash_with_nils::TestTree::TestTreeNode#test_from_hash_with_nils
175,6546
-    def test_add_from_hash::TestTree::TestTreeNode#test_add_from_hash
221,7902
-    def test_to_h::TestTree::TestTreeNode#test_to_h
253,8917
-    def test_to_h_from_hash_symmetry::TestTree::TestTreeNode#test_to_h_from_hash_symmetry
279,9496
-    def test_has_content_eh::TestTree::TestTreeNode#test_has_content_eh
295,9894
-    def test_length_is_size::TestTree::TestTreeNode#test_length_is_size
306,10352
-    def test_spaceship::TestTree::TestTreeNode#test_spaceship
312,10542
-    def test_is_comparable::TestTree::TestTreeNode#test_is_comparable
338,11325
-    def test_to_s::TestTree::TestTreeNode#test_to_s
356,12107
-    def test_first_sibling::TestTree::TestTreeNode#test_first_sibling
389,13825
-    def test_is_first_sibling_eh::TestTree::TestTreeNode#test_is_first_sibling_eh
402,14553
-    def test_is_last_sibling_eh::TestTree::TestTreeNode#test_is_last_sibling_eh
413,15036
-    def test_last_sibling::TestTree::TestTreeNode#test_last_sibling
424,15504
-    def test_siblings::TestTree::TestTreeNode#test_siblings
436,16158
-    def test_is_only_child_eh::TestTree::TestTreeNode#test_is_only_child_eh
464,17081
-    def test_next_sibling::TestTree::TestTreeNode#test_next_sibling
475,17517
-    def test_previous_sibling::TestTree::TestTreeNode#test_previous_sibling
486,18017
-    def test_add::TestTree::TestTreeNode#test_add
497,18546
-    def test_add_duplicate::TestTree::TestTreeNode#test_add_duplicate
518,19228
-    def test_add_at_specific_position::TestTree::TestTreeNode#test_add_at_specific_position
559,20656
-    def test_replace_bang::TestTree::TestTreeNode#test_replace_bang
623,23711
-    def test_replace_with::TestTree::TestTreeNode#test_replace_with
647,24756
-    def test_remove_bang::TestTree::TestTreeNode#test_remove_bang
665,25481
-    def test_remove_all_bang::TestTree::TestTreeNode#test_remove_all_bang
697,26444
-    def test_remove_from_parent_bang::TestTree::TestTreeNode#test_remove_from_parent_bang
707,26750
-    def test_children::TestTree::TestTreeNode#test_children
726,27465
-    def test_first_child::TestTree::TestTreeNode#test_first_child
762,29054
-    def test_last_child::TestTree::TestTreeNode#test_last_child
771,29382
-    def test_find::TestTree::TestTreeNode#test_find
780,29698
-    def test_parentage::TestTree::TestTreeNode#test_parentage
795,30293
-    def test_each::TestTree::TestTreeNode#test_each
804,30625
-    def test_each_leaf::TestTree::TestTreeNode#test_each_leaf
823,31309
-    def test_parent::TestTree::TestTreeNode#test_parent
850,32504
-    def test_indexed_access::TestTree::TestTreeNode#test_indexed_access
861,32923
-    def test_print_tree::TestTree::TestTreeNode#test_print_tree
872,33296
-    def test_marshal_dump::TestTree::TestTreeNode#test_marshal_dump
879,33456
-    alias test_marshal_load::TestTree::TestTreeNode#test_marshal_load
921,35578
-    def test_collect::TestTree::TestTreeNode#test_collect
924,35699
-    def test_freeze_tree_bang::TestTree::TestTreeNode#test_freeze_tree_bang
934,35965
-    def test_content::TestTree::TestTreeNode#test_content
948,36487
-    def test_depth::TestTree::TestTreeNode#test_depth
956,36878
-    def do_deprecated_depth::TestTree::TestTreeNode#do_deprecated_depth
967,37251
-    def test_node_height::TestTree::TestTreeNode#test_node_height
985,37819
-    def test_node_depth::TestTree::TestTreeNode#test_node_depth
1010,39028
-    def test_level::TestTree::TestTreeNode#test_level
1023,39465
-    def test_breadth::TestTree::TestTreeNode#test_breadth
1038,40008
-    def test_breadth_each::TestTree::TestTreeNode#test_breadth_each
1057,40655
-    def test_preordered_each::TestTree::TestTreeNode#test_preordered_each
1106,42240
-    def test_postordered_each::TestTree::TestTreeNode#test_postordered_each
1145,43494
-    def test_detached_copy::TestTree::TestTreeNode#test_detached_copy
1194,45031
-    def test_detached_subtree_copy::TestTree::TestTreeNode#test_detached_subtree_copy
1211,45759
-    def test_has_children_eh::TestTree::TestTreeNode#test_has_children_eh
1245,48011
-    def test_is_leaf_eh::TestTree::TestTreeNode#test_is_leaf_eh
1251,48173
-    def test_is_root_eh::TestTree::TestTreeNode#test_is_root_eh
1258,48379
-    def test_content_equals::TestTree::TestTreeNode#test_content_equals
1264,48542
-    def test_size::TestTree::TestTreeNode#test_size
1272,48807
-    def test_lt2::TestTree::TestTreeNode#test_lt2
1281,49071
-    def test_index::TestTree::TestTreeNode#test_index
1292,49563
-    def test_in_degree::TestTree::TestTreeNode#test_in_degree
1313,50659
-    def test_out_degree::TestTree::TestTreeNode#test_out_degree
1324,51126
-    def test_json_serialization::TestTree::TestTreeNode#test_json_serialization
1335,51613
-    def test_json_deserialization::TestTree::TestTreeNode#test_json_deserialization
1359,52413
-    def test_json_roundtrip::TestTree::TestTreeNode#test_json_roundtrip
1387,53599
-    def test_old_camelCase_method_names::TestTree::TestTreeNode#test_old_camelCase_method_names
1403,54340
-    def test_integer_node_names::TestTree::TestTreeNode#test_integer_node_names
1434,55408
-    def test_add_node_to_self_as_child::TestTree::TestTreeNode#test_add_node_to_self_as_child
1465,56638
-    def test_single_node_becomes_leaf::TestTree::TestTreeNode#test_single_node_becomes_leaf
1481,57151
-    def test_unique_node_names::TestTree::TestTreeNode#test_unique_node_names
1493,57572
-    def setup_other_test_tree::TestTree::TestTreeNode#setup_other_test_tree
1507,57927
-    def test_merge::TestTree::TestTreeNode#test_merge
1535,58916
-    def test_merge_bang::TestTree::TestTreeNode#test_merge_bang
1564,60354
-    def test_name_accessor::TestTree::TestTreeNode#test_name_accessor
1589,61441
-    def test_rename::TestTree::TestTreeNode#test_rename
1597,61657
-    def test_rename_child::TestTree::TestTreeNode#test_rename_child
1608,62028

data/lib/tree/utils/camel_case_method_handler.rb

@@ -1,79 +0,0 @@
-# camel_case_methods.rb - This file is part of the RubyTree package.
-#
-# = camel_case_methods.rb - Provides conversion from CamelCase to snake_case.
-#
-# Author::  Anupam Sengupta (anupamsg@gmail.com)
-#
-# Time-stamp: <2015-05-30 14:14:09 anupam>
-#
-# Copyright (C) 2012, 2013, 2015 Anupam Sengupta <anupamsg@gmail.com>
-#
-# 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'
-
-module Tree::Utils
-  # Provides utility functions to handle CamelCase methods, and redirect
-  # invocation of such methods to the snake_case equivalents.
-  module CamelCaseMethodHandler
-    def self.included(base)
-      # @!visibility private
-      # Allow the deprecated CamelCase method names.  Display a warning.
-      # :nodoc:
-      def method_missing(meth, *args, &blk)
-        if self.respond_to?(new_method_name = to_snake_case(meth))
-          warn DeprecatedMethodWarning,
-               "The camelCased methods are deprecated. "\
-               "Please use #{new_method_name} instead of #{meth}"
-          return send(new_method_name, *args, &blk)
-        else
-          super
-        end
-      end
-
-      private
-
-      # @!visibility private
-      # Convert a CamelCasedWord to a underscore separated camel_cased_word.
-      #
-      # @param [String] camel_cased_word The word to be converted to snake_case.
-      # @return [String] the snake_cased_word.
-      def to_snake_case(camel_cased_word)
-        word = camel_cased_word.to_s.dup
-        word.gsub!(/::/, '/')
-        word.gsub!(/([A-Z]+)([A-Z][a-z])/,'\1_\2')
-        word.gsub!(/([a-z\d])([A-Z])/,'\1_\2')
-        word.tr!("-", "_")
-        word.downcase!
-        word
-      end
-
-    end # self.included
-  end
-end