rooted_tree 0.3.2 → 0.3.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: e3f5ccd99747a243d238569e0701d73798e94c0d
-  data.tar.gz: 9fe0b64c62ae48112271a9c757112f683f3bdecc
+  metadata.gz: 2f48a3504fb307daf09d507cd556d7b622d6e17d
+  data.tar.gz: 363432cb0d5a2b69f0f4f0980de16ec03451619b
 SHA512:
-  metadata.gz: 281c52f594074e7ed2c2b8d9b85fbd405615f8d35b71f999aebdf55a9cd35cc51b7658c3f3491fe52a762e712dcde4b8955de99fe85962b6f22850aa87d8add6
-  data.tar.gz: 7e1a800d3a03349fe3364f722a6826afbbad0bafb205ec6dca44a19f8828c987daa9d822b33b2d81f565ab8e5e5648b50baa5899aa6fd1bcdf0ca603b92d9de9
+  metadata.gz: 08d262553a452128cceedda189e57d7118184f253c5106696a9a5b98751392091717dbd8551670cb81c6743e08ecd9876442c3592f4ff1e6ea9b67e9a581d5ee
+  data.tar.gz: f1de5a0b40607102934aaea8ecbb94d98de13aed5a5805bfed6e2ff34d41121a4cb600cc8a1f05dbf88b4c6001432c54e75621dde560ac4e79937cdd5f2a55f4

data/lib/rooted_tree/node.rb

@@ -31,10 +31,22 @@ module RootedTree
 
     alias arity degree
 
+    # Creates a new node with the given object as its value, unless a Node is
+    # passed, in which case it will be returned.
+    #
+    # value - the object to be used as value for a new Node, or a Node object.
+    #
+    # Returns a Node object.
+
     def self.[](value = nil)
       return value if value.is_a? self
       new value
     end
+    
+    # Create a new, unconnected Node object with an optional value. The value is
+    # owned by the Node instance and will be duped along with it.
+    #
+    # value - arbitrary object that is owned by the Node instance.
 
     def initialize(value = nil)
       @parent = nil
@@ -45,15 +57,33 @@ module RootedTree
       @degree = 0
       @value = value
     end
+    
+    # When copying a node the child nodes are copied as well, along with the
+    # value.
 
-    def initialize_copy(*)
-      duped_children = children.map { |v| v.dup.tap { |w| w.parent = self } }
+    def initialize_dup(source)
+      # Dup each child and link them to the new parent
+      duped_children = source.children.map do |child|
+        child.dup.tap { |n| n.parent = self }
+      end
+      
+      # Connect each child to its adjecent siblings
       duped_children.each_cons(2) { |a, b| a.next, b.prev = b, a }
 
       @parent = nil
       @first_child = duped_children.first
       @last_child = duped_children.last
+      @value = begin
+                 source.value.dup
+               rescue TypeError
+                 source.value
+               end
+               
+      super
     end
+    
+    # Freezes the value as well as each of the children, outside of the normal
+    # behaviour.
 
     def freeze
       @value.freeze
@@ -135,12 +165,21 @@ module RootedTree
     # Access the next sibling. Raises a StopIteration if this node is the last
     # one.
     #
-    # Returns the previous sibling node.
+    # Returns the next sibling node.
 
     def next
       raise StopIteration if last?
       @next
     end
+    
+    # Dangerous accessor of the next sibling. Unlike the regular #next this
+    # method will return nil if this node is the last one.
+    #
+    # Returns the next sibling node or nil if this node is last.
+    
+    def next!
+      @next
+    end
 
     # Access the previous sibling. Raises a StopIteration if this node is the
     # first one.
@@ -153,6 +192,15 @@ module RootedTree
     end
 
     alias previous prev
+    
+    # Dangerous accessor of the previous sibling. Unlike the regular #prev this
+    # method will return nil if this node is the first one.
+    
+    def prev!
+      @prev
+    end
+    
+    alias previous! prev!
 
     # Access the parent node. Raises a StopIteration if this node is the
     # root.
@@ -270,9 +318,9 @@ module RootedTree
     # Returns an array of the children to the deleted node, now made roots.
 
     def delete
-      extract.children.map do |child|
+      extract.children.to_a.each do |child|
         child.parent = nil
-        child
+        child.next = child.prev = nil
       end
     end
 

data/lib/rooted_tree/version.rb

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

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rooted_tree
 version: !ruby/object:Gem::Version
-  version: 0.3.2
+  version: 0.3.3
 platform: ruby
 authors:
 - Sebastian Lindberg
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2016-08-01 00:00:00.000000000 Z
+date: 2016-08-03 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler