rubytree 0.9.5pre6 → 0.9.5pre7

data/lib/tree/binarytree.rb

@@ -8,19 +8,19 @@
 # Author:: Anupam Sengupta (anupamsg@gmail.com)
 #
 
-# Copyright (c) 2007, 2008, 2009, 2010, 2012, 2013, 2014 Anupam Sengupta
+# Copyright (c) 2007, 2008, 2009, 2010, 2012, 2013, 2014, 2015 Anupam Sengupta
 #
 # All rights reserved.
 #
-# Redistribution and use in source and binary forms, with or without modification,
-# are permitted provided that the following conditions are met:
+# 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.
+# - 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
@@ -29,21 +29,22 @@
 #   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.
+# 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 'tree'
 
 module Tree
 
-  # Provides a Binary tree implementation. This node allows only two child nodes (left and right child).  It also
-  # provides direct access to the left or right child, including assignment to the same.
+  # Provides a Binary tree implementation. This node allows only two child nodes
+  # (left and right child). It also provides direct access to the left or right
+  # child, including assignment to the same.
   #
   # This inherits from the {Tree::TreeNode} class.
   #
@@ -64,11 +65,13 @@ module Tree
     end
 
     # @!attribute [rw] right_child
-    # Right child of the receiver node. Note that right child == last child unless there is only one child.
+    # Right child of the receiver node. Note that right child == last child
+    # unless there is only one child.
     #
     # Returns +nil+ if the right child does not exist.
     #
-    # @return [Tree::BinaryTreeNode] The right child, or +nil+ if the right side child does not exist.
+    # @return [Tree::BinaryTreeNode] The right child, or +nil+ if the right side
+    #                                child does not exist.
     #
     # @see #left_child
     def right_child
@@ -97,16 +100,19 @@ module Tree
 
     # @!group Structure Modification
 
-    # Adds the specified child node to the receiver node.  The child node's parent is set to be the receiver.
+    # Adds the specified child node to the receiver node. The child node's
+    # parent is set to be the receiver.
     #
-    # The child nodes are added in the order of addition, i.e., the first child added becomes the left node, and the
-    # second child added will be the second node.
+    # The child nodes are added in the order of addition, i.e., the first child
+    # added becomes the left node, and the second child added will be the second
+    # node.
     #
     # If only one child is present, then this will be the left child.
     #
     # @param [Tree::BinaryTreeNode] child The child to add.
     #
-    # @raise [ArgumentError] This exception is raised if two children are already present.
+    # @raise [ArgumentError] This exception is raised if two children are
+    #                        already present.
     def add(child)
       raise ArgumentError, "Already has two child nodes" if @children.size == 2
 
@@ -137,11 +143,15 @@ module Tree
     #   root.add_from_hash({:B => {:D => {}}, [:C, "C content!"] => {}})
     #
     # @param [Hash] hashed_subtree The hash of child subtrees.
-    # @raise [ArgumentError] This exception is raised if hash contains too many children.
+    #
+    # @raise [ArgumentError] This exception is raised if hash contains too
+    #                        many children.
+    # =>
     # @raise [ArgumentError] This exception is raised if a non-hash is passed.
     # @return [Array] Array of child nodes added
     def add_from_hash(hashed_subtree)
-      raise ArgumentError, "Too many children" if hashed_subtree.size + @children.size > 2
+      raise ArgumentError, "Too many children"\
+                           if hashed_subtree.size + @children.size > 2
       super(hashed_subtree)
     end
 
@@ -179,17 +189,20 @@ module Tree
 
     end
 
-    # A protected method to allow insertion of child nodes at the specified location.
-    # Note that this method allows insertion of +nil+ nodes.
+    # A protected method to allow insertion of child nodes at the specified
+    # location. Note that this method allows insertion of +nil+ nodes.
+    #
+    # @param [Tree::BinaryTreeNode] child The child to add at the specified
+    #                                     location.
     #
-    # @param [Tree::BinaryTreeNode] child The child to add at the specified location.
     # @param [Integer] at_index The location to add the entry at (0 or 1).
     #
     # @return [Tree::BinaryTreeNode] The added child.
     #
     # @raise [ArgumentError] If the index is out of limits.
     def set_child_at(child, at_index)
-      raise ArgumentError "A binary tree cannot have more than two children." unless (0..1).include? at_index
+      raise ArgumentError "A binary tree cannot have more than two children."\
+                          unless (0..1).include? at_index
 
       @children[at_index]        = child
       @children_hash[child.name] = child if child # Assign the name mapping
@@ -199,9 +212,11 @@ module Tree
 
     protected :set_child_at
 
-    # Sets the left child of the receiver node. If a previous child existed, it is replaced.
+    # Sets the left child of the receiver node. If a previous child existed, it
+    # is replaced.
     #
-    # @param [Tree::BinaryTreeNode] child The child to add as the left-side node.
+    # @param [Tree::BinaryTreeNode] child The child to add as the left-side
+    #                                     node.
     #
     # @return [Tree::BinaryTreeNode] The assigned child node.
     #
@@ -211,9 +226,11 @@ module Tree
       set_child_at child, 0
     end
 
-    # Sets the right child of the receiver node. If a previous child existed, it is replaced.
+    # Sets the right child of the receiver node. If a previous child existed, it
+    # is replaced.
     #
-    # @param [Tree::BinaryTreeNode] child The child to add as the right-side node.
+    # @param [Tree::BinaryTreeNode] child The child to add as the right-side
+    #                                     node.
     #
     # @return [Tree::BinaryTreeNode] The assigned child node.
     #

data/lib/tree/tree_deps.rb

@@ -7,19 +7,19 @@
 # Author:: Anupam Sengupta (anupamsg@gmail.com)
 #
 
-# Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2014 Anupam Sengupta
+# Copyright (c) 2006-2015 Anupam Sengupta
 #
 # All rights reserved.
 #
-# Redistribution and use in source and binary forms, with or without modification,
-# are permitted provided that the following conditions are met:
+# 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.
+# - 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
@@ -28,13 +28,13 @@
 #   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.
+# 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'
@@ -42,7 +42,8 @@ require 'json'
 
 require 'tree/version'
 require 'tree/utils/metrics_methods'
+require 'tree/utils/path_methods'
 require 'tree/utils/camel_case_method_handler'
 require 'tree/utils/json_converter'
 require 'tree/utils/tree_merge_handler'
-require 'tree/utils/hash_converter'
+require 'tree/utils/hash_converter'

data/lib/tree/utils/camel_case_method_handler.rb

@@ -4,21 +4,21 @@
 #
 # Author::  Anupam Sengupta (anupamsg@gmail.com)
 #
-# Time-stamp: <2013-12-31 20:48:13 anupam>
+# Time-stamp: <2015-05-30 14:14:09 anupam>
 #
-# Copyright (C) 2012, 2013 Anupam Sengupta <anupamsg@gmail.com>
+# 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:
+# 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.
+# - 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
@@ -27,13 +27,13 @@
 #   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.
+# 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'
@@ -49,7 +49,8 @@ module Tree::Utils
       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}"
+               "The camelCased methods are deprecated. "\
+               "Please use #{new_method_name} instead of #{meth}"
           return send(new_method_name, *args, &blk)
         else
           super

data/lib/tree/utils/hash_converter.rb

@@ -5,22 +5,22 @@
 #
 # Author::  Jen Hamon (http://www.github.com/jhamon)
 #
-# Time-stamp: <2015-01-02 15:11:03 anupam>
+# Time-stamp: <2015-05-30 14:19:16 anupam>
 #
 # Copyright (C) 2014, 2015 Jen Hamon (http://www.github.com/jhamon) and
 #                    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:
+# 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.
+# - 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
@@ -29,13 +29,13 @@
 #   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.
+# 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.
 
 module Tree::Utils::HashConverter
 
@@ -73,19 +73,30 @@ module Tree::Utils::HashConverter
     #
     #   # A tree with equivalent structure but with content present for
     #   # nodes A and D could be built from a hash like this:
-    #   {[:A, "A content"] => {:B => {}, :C => {[:D, "D content"] => {}, :E => {}}}}
+    #   {[:A, "A content"] => {:B => {},
+    #                          :C => { [:D, "D content"] => {},
+    #                                   :E => {}  }}}
     #
     # @author Jen Hamon (http://www.github.com/jhamon)
     # @param [Hash] hash Hash to build tree from.
-    # @return [Tree::TreeNode] The {Tree::TreeNode} instance representing the root of your tree.
+    #
+    # @return [Tree::TreeNode] The {Tree::TreeNode} instance representing the
+    #                          root of your tree.
     #
     # @raise [ArgumentError] This exception is raised if a non-Hash is passed.
-    # @raise [ArgumentError] This exception is raised if the hash has multiple top-level elements.
-    # @raise [ArgumentError] This exception is raised if the hash contains values that are not hashes or nils.
+    #
+    # @raise [ArgumentError] This exception is raised if the hash has multiple
+    #                        top-level elements.
+    #
+    # @raise [ArgumentError] This exception is raised if the hash contains
+    #                        values that are not hashes or nils.
 
     def from_hash(hash)
-      raise ArgumentError, "Argument must be a type of hash" unless hash.is_a?(Hash)
-      raise ArgumentError, "Hash must have one top-level element" if hash.size != 1
+      raise ArgumentError, "Argument must be a type of hash"\
+                           unless hash.is_a?(Hash)
+
+      raise ArgumentError, "Hash must have one top-level element"\
+                           if hash.size != 1
 
       root, children = hash.first
 
@@ -127,7 +138,8 @@ module Tree::Utils::HashConverter
     # @return [Array] Array of child nodes added
     # @see ClassMethods#from_hash
     def add_from_hash(children)
-      raise ArgumentError, "Argument must be a type of hash" unless children.is_a?(Hash)
+      raise ArgumentError, "Argument must be a type of hash"\
+                           unless children.is_a?(Hash)
 
       child_nodes = []
       children.each do |child, grandchildren|
@@ -145,7 +157,9 @@ module Tree::Utils::HashConverter
     #    root = Tree::TreeNode.new(:root, "root content")
     #    root << Tree::TreeNode.new(:child1, "child1 content")
     #    root << Tree::TreeNode.new(:child2, "child2 content")
-    #    root.to_h # => {[:root, "root content"] => { [:child1, "child1 content"] => {}, [:child2, "child2 content"] => {}}}
+    #    root.to_h # => {[:root, "root content"] =>
+    #                         { [:child1, "child1 content"] =>
+    #                                    {}, [:child2, "child2 content"] => {}}}
     # @author Jen Hamon (http://www.github.com/jhamon)
     # @return [Hash] Hash representation of tree.
     def to_h

data/lib/tree/utils/json_converter.rb

@@ -4,21 +4,21 @@
 #
 # Author::  Anupam Sengupta (anupamsg@gmail.com)
 #
-# Time-stamp: <2014-10-25 16:16:23 anupam>
+# Time-stamp: <2015-05-30 14:20:20 anupam>
 #
-# Copyright (C) 2012, 2013, 2014 Anupam Sengupta <anupamsg@gmail.com>
+# Copyright (C) 2012, 2013, 2014, 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:
+# 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.
+# - 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
@@ -27,13 +27,13 @@
 #   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.
+# 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 'json'
 
@@ -54,7 +54,8 @@ module Tree::Utils::JSONConverter
   #
   # @return A hash based representation of the JSON
   #
-  # Rails uses JSON in ActiveSupport, and all Rails JSON encoding goes through +as_json+.
+  # Rails uses JSON in ActiveSupport, and all Rails JSON encoding goes through
+  # +as_json+.
   #
   # @see #to_json
   # @see http://stackoverflow.com/a/6880638/273808
@@ -90,7 +91,8 @@ module Tree::Utils::JSONConverter
     as_json.to_json(*a)
   end
 
-  # ClassMethods for the {JSONConverter} module.  Will become class methods in the +include+ target.
+  # ClassMethods for the {JSONConverter} module. Will become class methods in
+  # the +include+ target.
   module ClassMethods
     # Helper method to create a Tree::TreeNode instance from the JSON hash
     # representation.  Note that this method should *NOT* be called directly.