rooted_tree 0.2.2 → 0.2.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 22a5b2a13278deccce0118fecd19ba5d65e39a4c
-  data.tar.gz: f2de5a5dba41d23f396e325889f9ed2dd6d468af
+  metadata.gz: 70e0e394dca29c945f79679ac2ade085f9210412
+  data.tar.gz: d8e06827ee6b284d2cc39140229125b5f0232428
 SHA512:
-  metadata.gz: 492a612d75f800c8e3ab638beb1c7bc9f352125eb29ceff47bf2a38855b12bbbb4675846dd52a4813877baf5402da1f39a6b53880c2c9adf9083621c50122dc7
-  data.tar.gz: cd0a3ef730dca13e6d083bdf44ed0b834a973121dff0ca05369fd355f8c6b30a9be1fd957dc5b9e60dd5b0ba1395964fe63122e0914a4593441b791c6b4b87f3
+  metadata.gz: 2b63502165e12f8d0ff158f07c2d2c010485f85f227ffbe05b1f73cc541907601c8a642816e568b8575a6cb7f7b2f4b41d901e5ffafe926a34b855077ea1764b
+  data.tar.gz: 29c29640e1f5e18812f994a76646e91e15b7e0bc5df125056707901e197a97455d5442cb6e19ff758221fc361663646d50a69b9d64331db5a836e51136c96346

data/README.md

@@ -3,6 +3,7 @@
 [![Gem Version](https://badge.fury.io/rb/richtext.png)](http://badge.fury.io/rb/rooted_tree)
 [![Build Status](https://travis-ci.org/seblindberg/ruby-rooted_tree.svg?branch=master)](https://travis-ci.org/seblindberg/ruby-rooted_tree)
 [![Coverage Status](https://coveralls.io/repos/github/seblindberg/ruby-rooted_tree/badge.svg?branch=master)](https://coveralls.io/github/seblindberg/ruby-rooted_tree?branch=master)
+[![Inline docs](http://inch-ci.org/github/seblindberg/ruby-rooted_tree.svg?branch=master)](http://inch-ci.org/github/seblindberg/ruby-rooted_tree)
 
 A tree is a connected graph with no cycles. There, that is plenty of explanation. Please refer to https://en.wikipedia.org/wiki/Tree_structure for a more in depth description, but if you need one this library probably is not for you.
 

data/lib/rooted_tree/node.rb

@@ -33,10 +33,10 @@ module RootedTree
 
     def self.[](value = nil)
       return value if value.is_a? self
-      self.new value
+      new value
     end
 
-    def initialize value = nil
+    def initialize(value = nil)
       @parent = nil
       @next = nil
       @prev = nil
@@ -56,9 +56,9 @@ module RootedTree
     end
 
     def freeze
-      super
       @value.freeze
       children.each(&:freeze)
+      super
     end
 
     # Leaf?
@@ -399,15 +399,19 @@ module RootedTree
     # Add
     #
     # Add two roots together to create a larger tree. A new common root will be
-    # created and returned.
+    # created and returned. Note that if the any of the root nodes are not
+    # frozen they will be modified, and as a result seize to be roots.
 
     def +(other)
       unless root? && other.root?
         raise StructureException, 'Only roots can be added'
       end
 
-      root = self.class.new
-      root << self << other
+      a = frozen? ? dup : self
+      b = other.frozen? ? other.dup : other
+
+      ab = self.class.new
+      ab << a << b
     end
 
     # Equality
@@ -465,7 +469,7 @@ module RootedTree
     #   |--Node:0x3ffd64c1fd30
     #   |  |--Node:0x3ffd64c1f86c
     #   |  +--Node:0x3ffd64c1f63c
-    #   +--Entety:0x3ffd64c1f40c
+    #   +--Node:0x3ffd64c1f40c
     #
     # By passing `as_array: true` the method will instead return an array
     # containing each of the output lines. The method also accepts a block

data/lib/rooted_tree/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module RootedTree
-  VERSION = '0.2.2'
+  VERSION = '0.2.3'
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rooted_tree
 version: !ruby/object:Gem::Version
-  version: 0.2.2
+  version: 0.2.3
 platform: ruby
 authors:
 - Sebastian Lindberg
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2016-07-25 00:00:00.000000000 Z
+date: 2016-07-27 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler