rubytree 0.9.3 → 0.9.4

Sign up to get free protection for your applications and to get access to all the features.
Files changed (10) hide show
  1. checksums.yaml +4 -4
  2. data/Gemfile.lock +10 -10
  3. data/History.rdoc +4 -0
  4. data/LICENSE.md +1 -1
  5. data/README.md +7 -33
  6. data/TODO.org +7 -3
  7. data/lib/tree.rb +1 -1
  8. data/lib/tree/version.rb +1 -1
  9. metadata +4 -5
  10. data/TAGS +0 -222
checksums.yaml CHANGED
@@ -1,7 +1,7 @@
1
1
  ---
2
2
  SHA1:
3
- metadata.gz: 2696640cc7392fcb9a3d373ad067d2e58c01d0a0
4
- data.tar.gz: 7ebb55c5a07049ff8ee0faa621e198d9e30354aa
3
+ metadata.gz: eef38e74f8b74480e08fbe55be05ae1ce1fd3f18
4
+ data.tar.gz: ef1aa978ef83d54e4645a8d3cf5d7fc8fa77b547
5
5
  SHA512:
6
- metadata.gz: 84b245a63875a6e70bf3e63a24717430981eaf7c6c2c7671e1ef5e46b95e82aeb9f5890ab85a48bc560ab023062c8cc8b0ed840f9850ba0bf1b627f12705cc02
7
- data.tar.gz: f30e25b3626ec5f44214711b4d7b9392469d39410e6c399aca0b94bbd961840a33584c51b553f2cd7e5534af1b8602edf5a1c68d5fff031af41d2e0977ceef3f
6
+ metadata.gz: 1f4aef945397df03a11cc80ec577b00cc029c48974f005977782a60b8b6b0ac13e15555eab225b829f4170c6755e1f8a62b19e832cfc04163bdedbdbd2e06719
7
+ data.tar.gz: cc6a69fe2a88e2a2cbf67982f1547bfd0386efa2e93058de001be9cdacd14c3a7add097b72938880b78577b3e5f245df13b9e697a45cc7db302475d9ffec9e67
data/Gemfile.lock CHANGED
@@ -1,7 +1,7 @@
1
1
  PATH
2
2
  remote: .
3
3
  specs:
4
- rubytree (0.9.3)
4
+ rubytree (0.9.4)
5
5
  json (~> 1.8)
6
6
  structured_warnings (~> 0.1)
7
7
 
@@ -14,11 +14,11 @@ GEM
14
14
  simplecov (>= 0.7)
15
15
  term-ansicolor
16
16
  thor
17
- docile (1.1.2)
17
+ docile (1.1.5)
18
18
  json (1.8.1)
19
- mime-types (2.0)
20
- multi_json (1.8.4)
21
- rake (10.1.1)
19
+ mime-types (2.3)
20
+ multi_json (1.10.1)
21
+ rake (10.3.2)
22
22
  rdoc (4.1.1)
23
23
  json (~> 1.4)
24
24
  rest-client (1.6.7)
@@ -32,11 +32,11 @@ GEM
32
32
  simplecov-html (~> 0.8.0)
33
33
  simplecov-html (0.8.0)
34
34
  structured_warnings (0.1.4)
35
- term-ansicolor (1.2.2)
36
- tins (~> 0.8)
37
- thor (0.18.1)
38
- tins (0.13.1)
39
- yard (0.8.7.3)
35
+ term-ansicolor (1.3.0)
36
+ tins (~> 1.0)
37
+ thor (0.19.1)
38
+ tins (1.3.0)
39
+ yard (0.8.7.4)
40
40
 
41
41
  PLATFORMS
42
42
  ruby
data/History.rdoc CHANGED
@@ -2,6 +2,10 @@
2
2
 
3
3
  = History of Changes
4
4
 
5
+ === 0.9.4 / 2014-07-04
6
+
7
+ * Changed all references to {http://rubyforge.org}.
8
+
5
9
  === 0.9.3 / 2014-02-01
6
10
 
7
11
  * Fixed the issue with globally unique node names. See Github issue #24.
data/LICENSE.md CHANGED
@@ -34,4 +34,4 @@ OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
34
34
  ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
35
35
 
36
36
  [BSD]: http://opensource.org/licenses/bsd-license.php "BSD License"
37
- [RubyTree]: http://rubytree.rubyforge.org/ "RubyTree Home Page"
37
+ [RubyTree]: http://rubytree.anupamsg.me/ "RubyTree Home Page"
data/README.md CHANGED
@@ -37,7 +37,7 @@ This is a [BSD licensed][BSD] open source project, and is hosted at
37
37
  [github.com/evolve75/RubyTree][rt@github], and is available as a standard gem from
38
38
  [rubygems.org/gems/rubytree][rt_gem].
39
39
 
40
- The home page for **RubyTree** is at [rubytree.rubyforge.org][rt_site].
40
+ The home page for **RubyTree** is at [rubytree.anupamsg.me][rt_site].
41
41
 
42
42
  ## WHAT'S NEW: ##
43
43
 
@@ -112,7 +112,7 @@ This example can also be found at
112
112
 
113
113
  ## REQUIREMENTS: ##
114
114
 
115
- * [Ruby][] 1.8.x, 1.9.x, 2.0.x, or 2.1.0x.
115
+ * [Ruby][] 1.8.x, 1.9.x, 2.0.x, or 2.1.x.
116
116
 
117
117
 
118
118
  * Run-time Dependencies:
@@ -134,32 +134,6 @@ To install the [gem][rt_gem], run this command from a terminal/shell:
134
134
  This should install the gem file for **RubyTree**. Note that you might need to have
135
135
  super-user privileges (root/sudo) to successfully install the gem.
136
136
 
137
- ### Installing from the tgz/zip file ###
138
-
139
- **RubyTree** also be downloaded as a `tar/zip` file (or as a `gem`) from:
140
-
141
- [rubyforge.org/frs/?group_id=1215&release_id=8817][rt@rubyforge]
142
-
143
- The file-name is one of:
144
-
145
- * `rubytree-<VERSION>.gem` - The rubygem
146
-
147
- * `rubytree-<VERSION>.tgz` - GZipped source files
148
-
149
- * `rubytree-<VERSION>.zip` - Zipped source files
150
-
151
- Download the appropriate file-type for your system.
152
-
153
- Extract the archive file (`tgz` or `zip`) and run the following command from the
154
- top-level source directory:
155
-
156
- $ ruby ./setup.rb
157
-
158
- You may need administrator/super-user privileges to complete the setup using
159
- this method. Note that the source code contains the `Rakefile` for building
160
- using [Rake][], which might an easier mechanism for building and installing the
161
- gem.
162
-
163
137
  ## DOCUMENTATION: ##
164
138
 
165
139
  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:
172
146
 
173
147
  Documentation for the latest released version is available at:
174
148
 
175
- [rubytree.rubyforge.org/rdoc][rt_doc]
149
+ [rubytree.anupamsg.me/rdoc][rt_doc]
176
150
 
177
151
  Documentation for the latest git HEAD is available at:
178
152
 
@@ -243,6 +217,7 @@ A big thanks to the following contributors for helping improve **RubyTree**:
243
217
  [LICENSE.md](./LICENSE.md) for details.
244
218
 
245
219
  {include:file:LICENSE.md}
220
+
246
221
  __ _ _
247
222
  /__\_ _| |__ _ _| |_ _ __ ___ ___
248
223
  / \// | | | '_ \| | | | __| '__/ _ \/ _ \
@@ -256,7 +231,7 @@ A big thanks to the following contributors for helping improve **RubyTree**:
256
231
  [Comparable]: http://ruby-doc.org/core-1.8.7/Comparable.html "Comparable mix-in"
257
232
  [Enumerable]: http://ruby-doc.org/core-1.9.3/Enumerable.html "Enumerable mix-in"
258
233
  [JSON]: http://flori.github.com/json "JSON"
259
- [Rake]: http://rake.rubyforge.org "Rake"
234
+ [Rake]: https://rubygems.org/gems/rake "Rake"
260
235
  [Ruby]: http://www.ruby-lang.org "Ruby Programming Language"
261
236
  [SCM]: http://en.wikipedia.org/wiki/Source_Code_Management "Source Code Management"
262
237
  [Yard]: http://yardoc.org "Yard Document Generator"
@@ -267,10 +242,9 @@ A big thanks to the following contributors for helping improve **RubyTree**:
267
242
  [post-order]: http://en.wikipedia.org/wiki/Tree_traversal#Post-order "Post-ordered Traversal"
268
243
  [pre-order]: http://en.wikipedia.org/wiki/Tree_traversal#Pre-order "Pre-ordered Traversal"
269
244
  [rt@github]: http://github.com/evolve75/RubyTree "RubyTree Project Page on Github"
270
- [rt@rubyforge]: http://rubyforge.org/frs/?group_id=1215&release_id=8817 "RubyTree at Rubyforge"
271
245
  [rt_doc@head]: http://rdoc.info/projects/evolve75/RubyTree "RubyTree Documentation for VCS Head"
272
- [rt_doc]: http://rubytree.rubyforge.org/rdoc "RubyTree Documentation"
246
+ [rt_doc]: http://rubytree.anupamsg.me/rdoc "RubyTree Documentation"
273
247
  [rt_gem]: http://rubygems.org/gems/rubytree "RubyTree Gem"
274
- [rt_site]: http://rubytree.rubyforge.org "RubyTree Site"
248
+ [rt_site]: http://rubytree.anupamsg.me "RubyTree Site"
275
249
  [structured_warnings]: http://github.com/schmidt/structured_warnings "structured_warnings"
276
250
  [tree_data_structure]: http://en.wikipedia.org/wiki/Tree_data_structure "Tree Data Structure"
data/TODO.org CHANGED
@@ -117,7 +117,7 @@
117
117
 
118
118
 
119
119
 
120
- * R0.9.0
120
+ * R0.9.0 :ARCHIVE:
121
121
  DEADLINE: <2013-02-24 Sun>
122
122
 
123
123
  This release contains the following features and fixes:
@@ -184,7 +184,10 @@
184
184
  as root's root (no pun intended) makes accessing the root from anywhere in the tree much easier.
185
185
 
186
186
 
187
+
188
+
187
189
  * Next Release
190
+ DEADLINE: <2014-03-02 Sun>
188
191
  ** STARTED [#A] Resolve the infinite loop bug if a node is added to itself as a child :Partial:
189
192
  [[Issue:5][Issue #5.]]
190
193
 
@@ -218,11 +221,12 @@
218
221
  restructure the internals to make better use of memory.
219
222
  ** TODO Expand the examples section, and add supporting documentation
220
223
  ** TODO Pull the =hash= converter code from [[https://github.com/markthomas/RubyTree/commits/master][Mark Thomas]] ([[Issue:13][Issue #13]]).
221
-
222
-
224
+ ** TODO Convert all documentation to markdown mode.
223
225
 
224
226
 
225
227
  * Unplanned / Not assigned to any release
228
+ *** DONE [#A] Migrate the website and references from http://rubyforge.org/
229
+ CLOSED: [2014-07-04 Fri 22:18]
226
230
  *** TODO Create a cycle-detection/validation mechanism to prevent cyclic graphs of nodes.
227
231
  *** DONE Revert the forced install of rubygem 2.1.11 from [[file:.travis.yml][.travis.yml]]
228
232
  CLOSED: [2014-01-12 Sun 19:06]
data/lib/tree.rb CHANGED
@@ -348,7 +348,7 @@ module Tree
348
348
  # @return [Tree::TreeNode] The added child node.
349
349
  #
350
350
  # @raise [RuntimeError] This exception is raised if another child node with the same
351
- # name exists, or if an invalid insertion position is specified.
351
+ # name exists, or if an invalid insertion position is specified.
352
352
  # @raise [ArgumentError] This exception is raised if a +nil+ node is passed as the argument.
353
353
  #
354
354
  # @see #<<
data/lib/tree/version.rb CHANGED
@@ -37,5 +37,5 @@
37
37
  #
38
38
  module Tree
39
39
  # Rubytree Package Version
40
- VERSION = '0.9.3'
40
+ VERSION = '0.9.4'
41
41
  end
metadata CHANGED
@@ -1,7 +1,7 @@
1
1
  --- !ruby/object:Gem::Specification
2
2
  name: rubytree
3
3
  version: !ruby/object:Gem::Version
4
- version: 0.9.3
4
+ version: 0.9.4
5
5
  platform: ruby
6
6
  authors:
7
7
  - Anupam Sengupta
@@ -117,7 +117,7 @@ description: |2+
117
117
  http://github.com/evolve75/RubyTree, and is available as a standard gem from
118
118
  http://rubygems.org/gems/rubytree.
119
119
 
120
- The home page for RubyTree is at http://rubytree.rubyforge.org.
120
+ The home page for RubyTree is at http://rubytree.anupamsg.me.
121
121
 
122
122
  email: anupamsg@gmail.com
123
123
  executables: []
@@ -136,7 +136,6 @@ files:
136
136
  - LICENSE.md
137
137
  - README.md
138
138
  - Rakefile
139
- - TAGS
140
139
  - TODO.org
141
140
  - examples/example_basic.rb
142
141
  - lib/rubytree.rb
@@ -155,7 +154,7 @@ files:
155
154
  - test/test_subclassed_node.rb
156
155
  - test/test_thread_and_fiber.rb
157
156
  - test/test_tree.rb
158
- homepage: http://rubytree.rubyforge.org
157
+ homepage: http://rubytree.anupamsg.me
159
158
  licenses:
160
159
  - BSD
161
160
  metadata: {}
@@ -184,7 +183,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
184
183
  - !ruby/object:Gem::Version
185
184
  version: '0'
186
185
  requirements: []
187
- rubyforge_project: rubytree
186
+ rubyforge_project:
188
187
  rubygems_version: 2.2.1
189
188
  signing_key:
190
189
  specification_version: 4
data/TAGS DELETED
@@ -1,222 +0,0 @@
1
-
2
- lib/rubytree.rb,0
3
-
4
- lib/tree/binarytree.rb,727
5
- module Tree::Tree43,1900
6
- class BinaryTreeNode::Tree::BinaryTreeNode52,2209
7
- def left_child::Tree::BinaryTreeNode#left_child62,2492
8
- def right_child::Tree::BinaryTreeNode#right_child74,2883
9
- def is_left_child?::Tree::BinaryTreeNode#is_left_child?83,3159
10
- def is_right_child?::Tree::BinaryTreeNode#is_right_child?93,3490
11
- def add::Tree::BinaryTreeNode#add110,4147
12
- def inordered_each::Tree::BinaryTreeNode#inordered_each128,4666
13
- def set_child_at::Tree::BinaryTreeNode#set_child_at159,5602
14
- def left_child=::Tree::BinaryTreeNode#left_child=178,6270
15
- def right_child=::Tree::BinaryTreeNode#right_child=190,6639
16
- def swap_children::Tree::BinaryTreeNode#swap_children195,6785
17
-
18
- lib/tree/tree_deps.rb,0
19
-
20
- lib/tree/utils/camel_case_method_handler.rb,324
21
- module Tree::Tree41,1848
22
- module CamelCaseMethodHandler::Tree::CamelCaseMethodHandler44,2004
23
- def self.included::Tree::CamelCaseMethodHandler.included45,2038
24
- def method_missing::Tree::CamelCaseMethodHandler#method_missing49,2186
25
- def to_snake_case::Tree::CamelCaseMethodHandler#to_snake_case66,2798
26
-
27
- lib/tree/utils/json_converter.rb,258
28
- module Tree::Tree42,1899
29
- def self.included::Tree.included44,1936
30
- def as_json::Tree#as_json61,2387
31
- def to_json::Tree#to_json89,3095
32
- module ClassMethods::Tree::ClassMethods94,3245
33
- def json_create::Tree::ClassMethods#json_create113,3960
34
-
35
- lib/tree/utils/metrics_methods.rb,718
36
- module Tree::Tree41,1833
37
- module TreeMetricsHandler::Tree::TreeMetricsHandler43,1918
38
- def self.included::Tree::TreeMetricsHandler.included44,1948
39
- def size::Tree::TreeMetricsHandler#size56,2317
40
- def length::Tree::TreeMetricsHandler#length67,2661
41
- def node_height::Tree::TreeMetricsHandler#node_height80,3078
42
- def node_depth::Tree::TreeMetricsHandler#node_depth96,3689
43
- def level::Tree::TreeMetricsHandler#level105,3875
44
- def depth::Tree::TreeMetricsHandler#depth124,4560
45
- def breadth::Tree::TreeMetricsHandler#breadth140,5197
46
- def in_degree::Tree::TreeMetricsHandler#in_degree154,5660
47
- def out_degree::Tree::TreeMetricsHandler#out_degree165,5973
48
-
49
- lib/tree/utils/tree_merge_handler.rb,214
50
- module Tree::Tree40,1769
51
- def merge::Tree#merge57,2500
52
- def merge!::Tree#merge!72,3134
53
- def check_merge_prerequisites::Tree#check_merge_prerequisites85,3441
54
- def merge_trees::Tree#merge_trees102,4086
55
-
56
- lib/tree/utils/utils.rb,27
57
- module Tree::Tree39,1838
58
-
59
- lib/tree/version.rb,27
60
- module Tree::Tree38,1723
61
-
62
- lib/tree.rb,2676
63
- module Tree::Tree48,2158
64
- class TreeNode::Tree::TreeNode85,3731
65
- attr_reader :name::Tree::TreeNode#name108,4483
66
- attr_accessor :content::Tree::TreeNode#content115,4682
67
- attr_reader :parent::Tree::TreeNode#parent119,4798
68
- def root::Tree::TreeNode#root126,5010
69
- def is_root?::Tree::TreeNode#is_root?137,5316
70
- def has_content?::Tree::TreeNode#has_content?145,5499
71
- def is_leaf?::Tree::TreeNode#is_leaf?156,5753
72
- def parentage::Tree::TreeNode#parentage168,6128
73
- def has_children?::Tree::TreeNode#has_children?186,6554
74
- def initialize::Tree::TreeNode#Tree::TreeNode.new209,7380
75
- def detached_copy::Tree::TreeNode#detached_copy227,7997
76
- def detached_subtree_copy::Tree::TreeNode#detached_subtree_copy237,8283
77
- alias :dup::Tree::TreeNode#dup246,8544
78
- def marshal_dump::Tree::TreeNode#marshal_dump251,8722
79
- def create_dump_rep::Tree::TreeNode#create_dump_rep257,8890
80
- def marshal_load::Tree::TreeNode#marshal_load272,9428
81
- def to_s::Tree::TreeNode#to_s297,10212
82
- def <<::Tree::TreeNode#<<320,10983
83
- def add::Tree::TreeNode#add355,12489
84
- def insertion_range::Tree::TreeNode#insertion_range375,13451
85
- def remove!::Tree::TreeNode#remove!397,14238
86
- def parent=::Tree::TreeNode#parent=412,14641
87
- def remove_from_parent!::Tree::TreeNode#remove_from_parent!425,15026
88
- def remove_all!::Tree::TreeNode#remove_all!436,15398
89
- def set_as_root!::Tree::TreeNode#set_as_root!447,15627
90
- def freeze_tree!::Tree::TreeNode#freeze_tree!457,15953
91
- def []::Tree::TreeNode#[]497,17471
92
- def each::Tree::TreeNode#each522,18438
93
- def preordered_each::Tree::TreeNode#preordered_each550,19398
94
- def postordered_each::Tree::TreeNode#postordered_each562,19810
95
- def breadth_each::Tree::TreeNode#breadth_each598,21236
96
- def children::Tree::TreeNode#children624,22174
97
- def each_leaf::Tree::TreeNode#each_leaf645,22795
98
- def first_child::Tree::TreeNode#first_child662,23217
99
- def last_child::Tree::TreeNode#last_child670,23428
100
- def first_sibling::Tree::TreeNode#first_sibling686,23875
101
- def is_first_sibling?::Tree::TreeNode#is_first_sibling?696,24149
102
- def last_sibling::Tree::TreeNode#last_sibling710,24565
103
- def is_last_sibling?::Tree::TreeNode#is_last_sibling?720,24835
104
- def siblings::Tree::TreeNode#siblings736,25388
105
- def is_only_child?::Tree::TreeNode#is_only_child?755,25940
106
- def next_sibling::Tree::TreeNode#next_sibling768,26343
107
- def previous_sibling::Tree::TreeNode#previous_sibling784,26817
108
- def <=>::Tree::TreeNode#<=>800,27328
109
- def print_tree::Tree::TreeNode#print_tree808,27557
110
-
111
- test/run_test.rb,0
112
-
113
- test/test_binarytree.rb,1192
114
- module TestTree::TestTree39,1717
115
- class TestBinaryTreeNode::TestTree::TestBinaryTreeNode41,1776
116
- def setup::TestTree::TestBinaryTreeNode#setup44,1868
117
- def teardown::TestTree::TestBinaryTreeNode#teardown52,2171
118
- def test_initialize::TestTree::TestBinaryTreeNode#test_initialize59,2330
119
- def test_add::TestTree::TestBinaryTreeNode#test_add67,2719
120
- def test_inordered_each::TestTree::TestBinaryTreeNode#test_inordered_each90,3633
121
- def test_left_child::TestTree::TestBinaryTreeNode#test_left_child134,5101
122
- def test_right_child::TestTree::TestBinaryTreeNode#test_right_child142,5414
123
- def test_left_child_equals::TestTree::TestBinaryTreeNode#test_left_child_equals150,5727
124
- def test_right_child_equals::TestTree::TestBinaryTreeNode#test_right_child_equals169,6717
125
- def test_is_left_child_eh::TestTree::TestBinaryTreeNode#test_is_left_child_eh189,7834
126
- def test_is_right_child_eh::TestTree::TestBinaryTreeNode#test_is_right_child_eh204,8373
127
- def test_swap_children::TestTree::TestBinaryTreeNode#test_swap_children218,8919
128
- def test_old_camelCase_method_names::TestTree::TestBinaryTreeNode#test_old_camelCase_method_names236,9802
129
-
130
- test/test_rubytree_require.rb,203
131
- module TestTree::TestTree38,1678
132
- class TestRequireRubytree::TestTree::TestRequireRubytree41,1759
133
- def test_create_a_simple_node::TestTree::TestRequireRubytree#test_create_a_simple_node44,1884
134
-
135
- test/test_subclassed_node.rb,389
136
- module TestTree::TestTree39,1688
137
- class TestSubclassedTreeNode::TestTree::TestSubclassedTreeNode42,1741
138
- class MyNode::TestTree::TestSubclassedTreeNode::MyNode45,1868
139
- def my_dummy_method::TestTree::TestSubclassedTreeNode::MyNode#my_dummy_method47,1967
140
- def test_subclassed_camelcase_methods::TestTree::TestSubclassedTreeNode#test_subclassed_camelcase_methods52,2026
141
-
142
- test/test_thread_and_fiber.rb,422
143
- module TestTree::TestTree39,1695
144
- class TestFiberAndThreadOnNode::TestTree::TestFiberAndThreadOnNode41,1747
145
- def create_long_depth_trees::TestTree::TestFiberAndThreadOnNode#create_long_depth_trees44,1843
146
- def test_fiber_for_recursion::TestTree::TestFiberAndThreadOnNode#test_fiber_for_recursion59,2260
147
- def test_thread_for_recursion::TestTree::TestFiberAndThreadOnNode#test_thread_for_recursion73,2807
148
-
149
- test/test_tree.rb,5684
150
- module TestTree::TestTree39,1725
151
- class TestTreeNode::TestTree::TestTreeNode41,1777
152
- def setup::TestTree::TestTreeNode#setup65,2610
153
- def setup_test_tree::TestTree::TestTreeNode#setup_test_tree77,3030
154
- def teardown::TestTree::TestTreeNode#teardown84,3180
155
- def test_has_version_number::TestTree::TestTreeNode#test_has_version_number89,3272
156
- def test_root_setup::TestTree::TestTreeNode#test_root_setup94,3423
157
- def test_root::TestTree::TestTreeNode#test_root111,4473
158
- def test_has_content_eh::TestTree::TestTreeNode#test_has_content_eh124,5023
159
- def test_length_is_size::TestTree::TestTreeNode#test_length_is_size135,5481
160
- def test_spaceship::TestTree::TestTreeNode#test_spaceship141,5671
161
- def test_is_comparable::TestTree::TestTreeNode#test_is_comparable167,6454
162
- def test_to_s::TestTree::TestTreeNode#test_to_s185,7236
163
- def test_first_sibling::TestTree::TestTreeNode#test_first_sibling218,8954
164
- def test_is_first_sibling_eh::TestTree::TestTreeNode#test_is_first_sibling_eh231,9682
165
- def test_is_last_sibling_eh::TestTree::TestTreeNode#test_is_last_sibling_eh242,10165
166
- def test_last_sibling::TestTree::TestTreeNode#test_last_sibling253,10633
167
- def test_siblings::TestTree::TestTreeNode#test_siblings265,11287
168
- def test_is_only_child_eh::TestTree::TestTreeNode#test_is_only_child_eh293,12210
169
- def test_next_sibling::TestTree::TestTreeNode#test_next_sibling304,12646
170
- def test_previous_sibling::TestTree::TestTreeNode#test_previous_sibling315,13146
171
- def test_add::TestTree::TestTreeNode#test_add326,13675
172
- def test_add_duplicate::TestTree::TestTreeNode#test_add_duplicate347,14357
173
- def test_add_at_specific_position::TestTree::TestTreeNode#test_add_at_specific_position388,15785
174
- def test_remove_bang::TestTree::TestTreeNode#test_remove_bang452,18838
175
- def test_remove_all_bang::TestTree::TestTreeNode#test_remove_all_bang484,19801
176
- def test_remove_from_parent_bang::TestTree::TestTreeNode#test_remove_from_parent_bang494,20107
177
- def test_children::TestTree::TestTreeNode#test_children513,20822
178
- def test_first_child::TestTree::TestTreeNode#test_first_child549,22411
179
- def test_last_child::TestTree::TestTreeNode#test_last_child558,22739
180
- def test_find::TestTree::TestTreeNode#test_find567,23055
181
- def test_parentage::TestTree::TestTreeNode#test_parentage582,23650
182
- def test_each::TestTree::TestTreeNode#test_each591,23982
183
- def test_each_leaf::TestTree::TestTreeNode#test_each_leaf610,24666
184
- def test_parent::TestTree::TestTreeNode#test_parent637,25861
185
- def test_indexed_access::TestTree::TestTreeNode#test_indexed_access648,26280
186
- def test_print_tree::TestTree::TestTreeNode#test_print_tree659,26653
187
- def test_marshal_dump::TestTree::TestTreeNode#test_marshal_dump666,26813
188
- alias test_marshal_load::TestTree::TestTreeNode#test_marshal_load708,28935
189
- def test_collect::TestTree::TestTreeNode#test_collect711,29056
190
- def test_freeze_tree_bang::TestTree::TestTreeNode#test_freeze_tree_bang721,29322
191
- def test_content::TestTree::TestTreeNode#test_content735,29844
192
- def test_depth::TestTree::TestTreeNode#test_depth743,30235
193
- def do_deprecated_depth::TestTree::TestTreeNode#do_deprecated_depth754,30608
194
- def test_node_height::TestTree::TestTreeNode#test_node_height772,31176
195
- def test_node_depth::TestTree::TestTreeNode#test_node_depth797,32385
196
- def test_level::TestTree::TestTreeNode#test_level810,32822
197
- def test_breadth::TestTree::TestTreeNode#test_breadth825,33365
198
- def test_breadth_each::TestTree::TestTreeNode#test_breadth_each844,34012
199
- def test_preordered_each::TestTree::TestTreeNode#test_preordered_each885,35318
200
- def test_postordered_each::TestTree::TestTreeNode#test_postordered_each924,36572
201
- def test_detached_copy::TestTree::TestTreeNode#test_detached_copy963,37827
202
- def test_detached_subtree_copy::TestTree::TestTreeNode#test_detached_subtree_copy980,38555
203
- def test_has_children_eh::TestTree::TestTreeNode#test_has_children_eh1014,40807
204
- def test_is_leaf_eh::TestTree::TestTreeNode#test_is_leaf_eh1020,40969
205
- def test_is_root_eh::TestTree::TestTreeNode#test_is_root_eh1027,41175
206
- def test_content_equals::TestTree::TestTreeNode#test_content_equals1033,41338
207
- def test_size::TestTree::TestTreeNode#test_size1041,41603
208
- def test_lt2::TestTree::TestTreeNode#test_lt21050,41867
209
- def test_index::TestTree::TestTreeNode#test_index1061,42359
210
- def test_in_degree::TestTree::TestTreeNode#test_in_degree1082,43455
211
- def test_out_degree::TestTree::TestTreeNode#test_out_degree1093,43922
212
- def test_json_serialization::TestTree::TestTreeNode#test_json_serialization1104,44409
213
- def test_json_deserialization::TestTree::TestTreeNode#test_json_deserialization1128,45209
214
- def test_json_roundtrip::TestTree::TestTreeNode#test_json_roundtrip1156,46395
215
- def test_old_camelCase_method_names::TestTree::TestTreeNode#test_old_camelCase_method_names1172,47136
216
- def test_integer_node_names::TestTree::TestTreeNode#test_integer_node_names1203,48204
217
- def test_add_node_to_self_as_child::TestTree::TestTreeNode#test_add_node_to_self_as_child1234,49434
218
- def test_single_node_becomes_leaf::TestTree::TestTreeNode#test_single_node_becomes_leaf1250,49947
219
- def test_unique_node_names::TestTree::TestTreeNode#test_unique_node_names1262,50368
220
- def setup_other_test_tree::TestTree::TestTreeNode#setup_other_test_tree1276,50723
221
- def test_merge::TestTree::TestTreeNode#test_merge1304,51712
222
- def test_merge_bang::TestTree::TestTreeNode#test_merge_bang1333,53150