rubytree 0.9.3 → 0.9.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 2696640cc7392fcb9a3d373ad067d2e58c01d0a0
-  data.tar.gz: 7ebb55c5a07049ff8ee0faa621e198d9e30354aa
+  metadata.gz: eef38e74f8b74480e08fbe55be05ae1ce1fd3f18
+  data.tar.gz: ef1aa978ef83d54e4645a8d3cf5d7fc8fa77b547
 SHA512:
-  metadata.gz: 84b245a63875a6e70bf3e63a24717430981eaf7c6c2c7671e1ef5e46b95e82aeb9f5890ab85a48bc560ab023062c8cc8b0ed840f9850ba0bf1b627f12705cc02
-  data.tar.gz: f30e25b3626ec5f44214711b4d7b9392469d39410e6c399aca0b94bbd961840a33584c51b553f2cd7e5534af1b8602edf5a1c68d5fff031af41d2e0977ceef3f
+  metadata.gz: 1f4aef945397df03a11cc80ec577b00cc029c48974f005977782a60b8b6b0ac13e15555eab225b829f4170c6755e1f8a62b19e832cfc04163bdedbdbd2e06719
+  data.tar.gz: cc6a69fe2a88e2a2cbf67982f1547bfd0386efa2e93058de001be9cdacd14c3a7add097b72938880b78577b3e5f245df13b9e697a45cc7db302475d9ffec9e67

data/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    rubytree (0.9.3)
+    rubytree (0.9.4)
       json (~> 1.8)
       structured_warnings (~> 0.1)
 
@@ -14,11 +14,11 @@ GEM
       simplecov (>= 0.7)
       term-ansicolor
       thor
-    docile (1.1.2)
+    docile (1.1.5)
     json (1.8.1)
-    mime-types (2.0)
-    multi_json (1.8.4)
-    rake (10.1.1)
+    mime-types (2.3)
+    multi_json (1.10.1)
+    rake (10.3.2)
     rdoc (4.1.1)
       json (~> 1.4)
     rest-client (1.6.7)
@@ -32,11 +32,11 @@ GEM
       simplecov-html (~> 0.8.0)
     simplecov-html (0.8.0)
     structured_warnings (0.1.4)
-    term-ansicolor (1.2.2)
-      tins (~> 0.8)
-    thor (0.18.1)
-    tins (0.13.1)
-    yard (0.8.7.3)
+    term-ansicolor (1.3.0)
+      tins (~> 1.0)
+    thor (0.19.1)
+    tins (1.3.0)
+    yard (0.8.7.4)
 
 PLATFORMS
   ruby

data/History.rdoc

@@ -2,6 +2,10 @@
 
 = History of Changes
 
+=== 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.

data/LICENSE.md

@@ -34,4 +34,4 @@ OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
 ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 [BSD]:       http://opensource.org/licenses/bsd-license.php "BSD License"
-[RubyTree]:  http://rubytree.rubyforge.org/ "RubyTree Home Page"
+[RubyTree]:  http://rubytree.anupamsg.me/ "RubyTree Home Page"

data/README.md

@@ -37,7 +37,7 @@ This is a [BSD licensed][BSD] open source project, and is hosted at
 [github.com/evolve75/RubyTree][rt@github], and is available as a standard gem from
 [rubygems.org/gems/rubytree][rt_gem].
 
-The home page for **RubyTree** is at [rubytree.rubyforge.org][rt_site].
+The home page for **RubyTree** is at [rubytree.anupamsg.me][rt_site].
 
 ## WHAT'S NEW: ##
 
@@ -112,7 +112,7 @@ This example can also be found at
 
 ## REQUIREMENTS: ##
 
-* [Ruby][] 1.8.x, 1.9.x, 2.0.x, or 2.1.0x.
+* [Ruby][] 1.8.x, 1.9.x, 2.0.x, or 2.1.x.
 
 
 * Run-time Dependencies:
@@ -134,32 +134,6 @@ To install the [gem][rt_gem], run this command from a terminal/shell:
 This should install the gem file for **RubyTree**. Note that you might need to have
 super-user privileges (root/sudo) to successfully install the gem.
 
-### Installing from the tgz/zip file ###
-
-**RubyTree** also be downloaded as a `tar/zip` file (or as a `gem`) from:
-
-[rubyforge.org/frs/?group_id=1215&release_id=8817][rt@rubyforge]
-
-The file-name is one of:
-
-* `rubytree-<VERSION>.gem` - The rubygem
-
-* `rubytree-<VERSION>.tgz` - GZipped source files
-
-* `rubytree-<VERSION>.zip` - Zipped  source files
-
-Download the appropriate file-type for your system.
-
-Extract the archive file (`tgz` or `zip`) and run the following command from the
-top-level source directory:
-
-    $ ruby ./setup.rb
-
-You may need administrator/super-user privileges to complete the setup using
-this method. Note that the source code contains the `Rakefile` for building
-using [Rake][], which might an easier mechanism for building and installing the
-gem.
-
 ## DOCUMENTATION: ##
 
 The primary class **RubyTree** is {Tree::TreeNode}. See the class
@@ -172,7 +146,7 @@ command at the terminal to view the text mode ri documentation:
 
 Documentation for the latest released version is available at:
 
-[rubytree.rubyforge.org/rdoc][rt_doc]
+[rubytree.anupamsg.me/rdoc][rt_doc]
 
 Documentation for the latest git HEAD is available at:
 
@@ -243,6 +217,7 @@ A big thanks to the following contributors for helping improve **RubyTree**:
 [LICENSE.md](./LICENSE.md) for details.
 
 {include:file:LICENSE.md}
+
         __       _           _
        /__\_   _| |__  _   _| |_ _ __ ___  ___
       / \// | | | '_ \| | | | __| '__/ _ \/ _ \
@@ -256,7 +231,7 @@ A big thanks to the following contributors for helping improve **RubyTree**:
 [Comparable]:           http://ruby-doc.org/core-1.8.7/Comparable.html "Comparable mix-in"
 [Enumerable]:           http://ruby-doc.org/core-1.9.3/Enumerable.html "Enumerable mix-in"
 [JSON]:                 http://flori.github.com/json "JSON"
-[Rake]:                 http://rake.rubyforge.org "Rake"
+[Rake]:                 https://rubygems.org/gems/rake "Rake"
 [Ruby]:                 http://www.ruby-lang.org "Ruby Programming Language"
 [SCM]:                  http://en.wikipedia.org/wiki/Source_Code_Management "Source Code Management"
 [Yard]:                 http://yardoc.org "Yard Document Generator"
@@ -267,10 +242,9 @@ A big thanks to the following contributors for helping improve **RubyTree**:
 [post-order]:           http://en.wikipedia.org/wiki/Tree_traversal#Post-order "Post-ordered Traversal"
 [pre-order]:            http://en.wikipedia.org/wiki/Tree_traversal#Pre-order "Pre-ordered Traversal"
 [rt@github]:            http://github.com/evolve75/RubyTree "RubyTree Project Page on Github"
-[rt@rubyforge]:         http://rubyforge.org/frs/?group_id=1215&release_id=8817 "RubyTree at Rubyforge"
 [rt_doc@head]:          http://rdoc.info/projects/evolve75/RubyTree "RubyTree Documentation for VCS Head"
-[rt_doc]:               http://rubytree.rubyforge.org/rdoc "RubyTree Documentation"
+[rt_doc]:               http://rubytree.anupamsg.me/rdoc "RubyTree Documentation"
 [rt_gem]:               http://rubygems.org/gems/rubytree "RubyTree Gem"
-[rt_site]:              http://rubytree.rubyforge.org "RubyTree Site"
+[rt_site]:              http://rubytree.anupamsg.me "RubyTree Site"
 [structured_warnings]:  http://github.com/schmidt/structured_warnings "structured_warnings"
 [tree_data_structure]:  http://en.wikipedia.org/wiki/Tree_data_structure "Tree Data Structure"

data/TODO.org

@@ -117,7 +117,7 @@
 
 
 
-* R0.9.0
+* R0.9.0                                                                                  :ARCHIVE:
   DEADLINE: <2013-02-24 Sun>
 
   This release contains the following features and fixes:
@@ -184,7 +184,10 @@
     as root's root (no pun intended) makes accessing the root from anywhere in the tree much easier.
 
 
+
+
 * Next Release
+  DEADLINE: <2014-03-02 Sun>
 ** STARTED [#A] Resolve the infinite loop bug if a node is added to itself as a child     :Partial:
    [[Issue:5][Issue #5.]]
 
@@ -218,11 +221,12 @@
       restructure the internals to make better use of memory.
 ** TODO Expand the examples section, and add supporting documentation
 ** TODO Pull the =hash= converter code from [[https://github.com/markthomas/RubyTree/commits/master][Mark Thomas]] ([[Issue:13][Issue #13]]).
-
-
+** TODO Convert all documentation to markdown mode.
 
 
 * Unplanned / Not assigned to any release
+*** DONE [#A] Migrate the website and references from http://rubyforge.org/
+    CLOSED: [2014-07-04 Fri 22:18]
 *** TODO Create a cycle-detection/validation mechanism to prevent cyclic graphs of nodes.
 *** DONE Revert the forced install of rubygem 2.1.11 from [[file:.travis.yml][.travis.yml]]
     CLOSED: [2014-01-12 Sun 19:06]

data/lib/tree.rb

@@ -348,7 +348,7 @@ module Tree
     # @return [Tree::TreeNode] The added child node.
     #
     # @raise [RuntimeError] This exception is raised if another child node with the same
-    # name exists, or if an invalid insertion position is specified.
+    #                       name exists, or if an invalid insertion position is specified.
     # @raise [ArgumentError] This exception is raised if a +nil+ node is passed as the argument.
     #
     # @see #<<

data/lib/tree/version.rb

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

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rubytree
 version: !ruby/object:Gem::Version
-  version: 0.9.3
+  version: 0.9.4
 platform: ruby
 authors:
 - Anupam Sengupta
@@ -117,7 +117,7 @@ description: |2+
       http://github.com/evolve75/RubyTree, and is available as a standard gem from
       http://rubygems.org/gems/rubytree.
 
-      The home page for RubyTree is at http://rubytree.rubyforge.org.
+      The home page for RubyTree is at http://rubytree.anupamsg.me.
 
 email: anupamsg@gmail.com
 executables: []
@@ -136,7 +136,6 @@ files:
 - LICENSE.md
 - README.md
 - Rakefile
-- TAGS
 - TODO.org
 - examples/example_basic.rb
 - lib/rubytree.rb
@@ -155,7 +154,7 @@ files:
 - test/test_subclassed_node.rb
 - test/test_thread_and_fiber.rb
 - test/test_tree.rb
-homepage: http://rubytree.rubyforge.org
+homepage: http://rubytree.anupamsg.me
 licenses:
 - BSD
 metadata: {}
@@ -184,7 +183,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: rubytree
+rubyforge_project: 
 rubygems_version: 2.2.1
 signing_key: 
 specification_version: 4

data/TAGS

@@ -1,222 +0,0 @@
-
-lib/rubytree.rb,0
-
-lib/tree/binarytree.rb,727
-module Tree::Tree
43,1900
-  class BinaryTreeNode::Tree::BinaryTreeNode
52,2209
-    def left_child::Tree::BinaryTreeNode#left_child
62,2492
-    def right_child::Tree::BinaryTreeNode#right_child
74,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#add
110,4147
-    def inordered_each::Tree::BinaryTreeNode#inordered_each
128,4666
-    def set_child_at::Tree::BinaryTreeNode#set_child_at
159,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_children
195,6785
-
-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/json_converter.rb,258
-module Tree::Tree
42,1899
-  def self.included::Tree.included
44,1936
-  def as_json::Tree#as_json
61,2387
-  def to_json::Tree#to_json
89,3095
-  module ClassMethods::Tree::ClassMethods
94,3245
-    def json_create::Tree::ClassMethods#json_create
113,3960
-
-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,2676
-module Tree::Tree
48,2158
-  class TreeNode::Tree::TreeNode
85,3731
-    attr_reader   :name::Tree::TreeNode#name
108,4483
-    attr_accessor :content::Tree::TreeNode#content
115,4682
-    attr_reader   :parent::Tree::TreeNode#parent
119,4798
-    def root::Tree::TreeNode#root
126,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#parentage
168,6128
-    def has_children?::Tree::TreeNode#has_children?
186,6554
-    def initialize::Tree::TreeNode#Tree::TreeNode.new
209,7380
-    def detached_copy::Tree::TreeNode#detached_copy
227,7997
-    def detached_subtree_copy::Tree::TreeNode#detached_subtree_copy
237,8283
-    alias :dup::Tree::TreeNode#dup
246,8544
-    def marshal_dump::Tree::TreeNode#marshal_dump
251,8722
-    def create_dump_rep::Tree::TreeNode#create_dump_rep
257,8890
-    def marshal_load::Tree::TreeNode#marshal_load
272,9428
-    def to_s::Tree::TreeNode#to_s
297,10212
-    def <<::Tree::TreeNode#<<
320,10983
-    def add::Tree::TreeNode#add
355,12489
-    def insertion_range::Tree::TreeNode#insertion_range
375,13451
-    def remove!::Tree::TreeNode#remove!
397,14238
-    def parent=::Tree::TreeNode#parent=
412,14641
-    def remove_from_parent!::Tree::TreeNode#remove_from_parent!
425,15026
-    def remove_all!::Tree::TreeNode#remove_all!
436,15398
-    def set_as_root!::Tree::TreeNode#set_as_root!
447,15627
-    def freeze_tree!::Tree::TreeNode#freeze_tree!
457,15953
-    def []::Tree::TreeNode#[]
497,17471
-    def each::Tree::TreeNode#each
522,18438
-    def preordered_each::Tree::TreeNode#preordered_each
550,19398
-    def postordered_each::Tree::TreeNode#postordered_each
562,19810
-    def breadth_each::Tree::TreeNode#breadth_each
598,21236
-    def children::Tree::TreeNode#children
624,22174
-    def each_leaf::Tree::TreeNode#each_leaf
645,22795
-    def first_child::Tree::TreeNode#first_child
662,23217
-    def last_child::Tree::TreeNode#last_child
670,23428
-    def first_sibling::Tree::TreeNode#first_sibling
686,23875
-    def is_first_sibling?::Tree::TreeNode#is_first_sibling?
696,24149
-    def last_sibling::Tree::TreeNode#last_sibling
710,24565
-    def is_last_sibling?::Tree::TreeNode#is_last_sibling?
720,24835
-    def siblings::Tree::TreeNode#siblings
736,25388
-    def is_only_child?::Tree::TreeNode#is_only_child?
755,25940
-    def next_sibling::Tree::TreeNode#next_sibling
768,26343
-    def previous_sibling::Tree::TreeNode#previous_sibling
784,26817
-    def <=>::Tree::TreeNode#<=>
800,27328
-    def print_tree::Tree::TreeNode#print_tree
808,27557
-
-test/run_test.rb,0
-
-test/test_binarytree.rb,1192
-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_add::TestTree::TestBinaryTreeNode#test_add
67,2719
-    def test_inordered_each::TestTree::TestBinaryTreeNode#test_inordered_each
90,3633
-    def test_left_child::TestTree::TestBinaryTreeNode#test_left_child
134,5101
-    def test_right_child::TestTree::TestBinaryTreeNode#test_right_child
142,5414
-    def test_left_child_equals::TestTree::TestBinaryTreeNode#test_left_child_equals
150,5727
-    def test_right_child_equals::TestTree::TestBinaryTreeNode#test_right_child_equals
169,6717
-    def test_is_left_child_eh::TestTree::TestBinaryTreeNode#test_is_left_child_eh
189,7834
-    def test_is_right_child_eh::TestTree::TestBinaryTreeNode#test_is_right_child_eh
204,8373
-    def test_swap_children::TestTree::TestBinaryTreeNode#test_swap_children
218,8919
-    def test_old_camelCase_method_names::TestTree::TestBinaryTreeNode#test_old_camelCase_method_names
236,9802
-
-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,5684
-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_has_content_eh::TestTree::TestTreeNode#test_has_content_eh
124,5023
-    def test_length_is_size::TestTree::TestTreeNode#test_length_is_size
135,5481
-    def test_spaceship::TestTree::TestTreeNode#test_spaceship
141,5671
-    def test_is_comparable::TestTree::TestTreeNode#test_is_comparable
167,6454
-    def test_to_s::TestTree::TestTreeNode#test_to_s
185,7236
-    def test_first_sibling::TestTree::TestTreeNode#test_first_sibling
218,8954
-    def test_is_first_sibling_eh::TestTree::TestTreeNode#test_is_first_sibling_eh
231,9682
-    def test_is_last_sibling_eh::TestTree::TestTreeNode#test_is_last_sibling_eh
242,10165
-    def test_last_sibling::TestTree::TestTreeNode#test_last_sibling
253,10633
-    def test_siblings::TestTree::TestTreeNode#test_siblings
265,11287
-    def test_is_only_child_eh::TestTree::TestTreeNode#test_is_only_child_eh
293,12210
-    def test_next_sibling::TestTree::TestTreeNode#test_next_sibling
304,12646
-    def test_previous_sibling::TestTree::TestTreeNode#test_previous_sibling
315,13146
-    def test_add::TestTree::TestTreeNode#test_add
326,13675
-    def test_add_duplicate::TestTree::TestTreeNode#test_add_duplicate
347,14357
-    def test_add_at_specific_position::TestTree::TestTreeNode#test_add_at_specific_position
388,15785
-    def test_remove_bang::TestTree::TestTreeNode#test_remove_bang
452,18838
-    def test_remove_all_bang::TestTree::TestTreeNode#test_remove_all_bang
484,19801
-    def test_remove_from_parent_bang::TestTree::TestTreeNode#test_remove_from_parent_bang
494,20107
-    def test_children::TestTree::TestTreeNode#test_children
513,20822
-    def test_first_child::TestTree::TestTreeNode#test_first_child
549,22411
-    def test_last_child::TestTree::TestTreeNode#test_last_child
558,22739
-    def test_find::TestTree::TestTreeNode#test_find
567,23055
-    def test_parentage::TestTree::TestTreeNode#test_parentage
582,23650
-    def test_each::TestTree::TestTreeNode#test_each
591,23982
-    def test_each_leaf::TestTree::TestTreeNode#test_each_leaf
610,24666
-    def test_parent::TestTree::TestTreeNode#test_parent
637,25861
-    def test_indexed_access::TestTree::TestTreeNode#test_indexed_access
648,26280
-    def test_print_tree::TestTree::TestTreeNode#test_print_tree
659,26653
-    def test_marshal_dump::TestTree::TestTreeNode#test_marshal_dump
666,26813
-    alias test_marshal_load::TestTree::TestTreeNode#test_marshal_load
708,28935
-    def test_collect::TestTree::TestTreeNode#test_collect
711,29056
-    def test_freeze_tree_bang::TestTree::TestTreeNode#test_freeze_tree_bang
721,29322
-    def test_content::TestTree::TestTreeNode#test_content
735,29844
-    def test_depth::TestTree::TestTreeNode#test_depth
743,30235
-    def do_deprecated_depth::TestTree::TestTreeNode#do_deprecated_depth
754,30608
-    def test_node_height::TestTree::TestTreeNode#test_node_height
772,31176
-    def test_node_depth::TestTree::TestTreeNode#test_node_depth
797,32385
-    def test_level::TestTree::TestTreeNode#test_level
810,32822
-    def test_breadth::TestTree::TestTreeNode#test_breadth
825,33365
-    def test_breadth_each::TestTree::TestTreeNode#test_breadth_each
844,34012
-    def test_preordered_each::TestTree::TestTreeNode#test_preordered_each
885,35318
-    def test_postordered_each::TestTree::TestTreeNode#test_postordered_each
924,36572
-    def test_detached_copy::TestTree::TestTreeNode#test_detached_copy
963,37827
-    def test_detached_subtree_copy::TestTree::TestTreeNode#test_detached_subtree_copy
980,38555
-    def test_has_children_eh::TestTree::TestTreeNode#test_has_children_eh
1014,40807
-    def test_is_leaf_eh::TestTree::TestTreeNode#test_is_leaf_eh
1020,40969
-    def test_is_root_eh::TestTree::TestTreeNode#test_is_root_eh
1027,41175
-    def test_content_equals::TestTree::TestTreeNode#test_content_equals
1033,41338
-    def test_size::TestTree::TestTreeNode#test_size
1041,41603
-    def test_lt2::TestTree::TestTreeNode#test_lt2
1050,41867
-    def test_index::TestTree::TestTreeNode#test_index
1061,42359
-    def test_in_degree::TestTree::TestTreeNode#test_in_degree
1082,43455
-    def test_out_degree::TestTree::TestTreeNode#test_out_degree
1093,43922
-    def test_json_serialization::TestTree::TestTreeNode#test_json_serialization
1104,44409
-    def test_json_deserialization::TestTree::TestTreeNode#test_json_deserialization
1128,45209
-    def test_json_roundtrip::TestTree::TestTreeNode#test_json_roundtrip
1156,46395
-    def test_old_camelCase_method_names::TestTree::TestTreeNode#test_old_camelCase_method_names
1172,47136
-    def test_integer_node_names::TestTree::TestTreeNode#test_integer_node_names
1203,48204
-    def test_add_node_to_self_as_child::TestTree::TestTreeNode#test_add_node_to_self_as_child
1234,49434
-    def test_single_node_becomes_leaf::TestTree::TestTreeNode#test_single_node_becomes_leaf
1250,49947
-    def test_unique_node_names::TestTree::TestTreeNode#test_unique_node_names
1262,50368
-    def setup_other_test_tree::TestTree::TestTreeNode#setup_other_test_tree
1276,50723
-    def test_merge::TestTree::TestTreeNode#test_merge
1304,51712
-    def test_merge_bang::TestTree::TestTreeNode#test_merge_bang
1333,53150