rubytree 0.9.5pre6 → 0.9.5pre7

data/lib/tree/utils/metrics_methods.rb

@@ -4,21 +4,21 @@
 #
 # Author::  Anupam Sengupta (anupamsg@gmail.com)
 #
-# Time-stamp: <2013-12-31 21:45:35 anupam>
+# Time-stamp: <2015-05-30 14:23:23 anupam>
 #
-# Copyright (C) 2013 Anupam Sengupta <anupamsg@gmail.com>
+# Copyright (C) 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'
@@ -60,7 +60,8 @@ module Tree::Utils
       # @!attribute [r] length
       # Convenience synonym for {#size}.
       #
-      # @deprecated This method name is ambiguous and may be removed.  Use {#size} instead.
+      # @deprecated This method name is ambiguous and may be removed. Use
+      # {#size} instead.
       #
       # @return [Integer] The total number of nodes in this (sub)tree.
       # @see #size
@@ -85,16 +86,19 @@ module Tree::Utils
       # @!attribute [r] node_depth
       # Depth of this node in its tree.  Depth of a node is defined as:
       #
-      # Depth:: Length of the node's path to its root.  Depth of a root node is zero.
+      # Depth:: Length of the node's path to its root. Depth of a root node is
+      # zero.
       #
-      # *Note* that the deprecated method {#depth} was incorrectly computing this value.
-      # Please replace all calls to the old method with {#node_depth} instead.
+      # *Note* that the deprecated method {#depth} was incorrectly computing
+      # this value. Please replace all calls to the old method with
+      # {#node_depth} instead.
       #
       # {#level} is an alias for this method.
       #
       # @return [Integer] Depth of this node.
       def node_depth
-        @node_depth ||= is_root? ? 0 : (1 + parent.node_depth)
+        return 0 if is_root?
+        1 + parent.node_depth
       end
 
       # @!attribute [r] level
@@ -108,8 +112,8 @@ module Tree::Utils
       # @!attribute [r] depth
       # Depth of the tree from this node. A single leaf node has a depth of 1.
       #
-      # This method is *DEPRECATED* and may be removed in the subsequent releases.
-      # Note that the value returned by this method is actually the:
+      # This method is *DEPRECATED* and may be removed in the subsequent
+      # releases. Note that the value returned by this method is actually the:
       #
       # _height_ + 1 of the node, *NOT* the _depth_.
       #
@@ -117,11 +121,15 @@ module Tree::Utils
       # {#node_height} methods instead.
       #
       # @return [Integer] depth of the node.
-      # @deprecated This method returns an incorrect value.  Use the {#node_depth} method instead.
+      #
+      # @deprecated This method returns an incorrect value. Use the
+      # {#node_depth} method instead.
       #
       # @see #node_depth
       def depth
-        warn DeprecatedMethodWarning, 'This method is deprecated.  Please use node_depth() or node_height() instead (bug # 22535)'
+        warn DeprecatedMethodWarning,
+             "This method is deprecated.  "\
+             "Please use node_depth() or node_height() instead (bug # 22535)"
 
         return 1 if is_leaf?
         1 + @children.collect { |child| child.depth }.max
@@ -144,7 +152,8 @@ module Tree::Utils
       # The incoming edge-count of this node.
       #
       # In-degree is defined as:
-      # In-degree:: Number of edges arriving at the node (0 for root, 1 for all other nodes)
+      # In-degree:: Number of edges arriving at the node (0 for root, 1 for
+      # all other nodes)
       #
       # - In-degree = 0 for a root or orphaned node
       # - In-degree = 1 for a node which has a parent

data/lib/tree/utils/path_methods.rb

@@ -0,0 +1,92 @@
+# path_methods.rb - This file is part of the RubyTree package.
+#
+# = path_methods.rb - Provides methods for extracting the node path.
+#
+# Author::  Marco Ziccardi and Anupam Sengupta (anupamsg@gmail.com)
+#
+# Time-stamp: <2015-05-30 16:04:00 anupam>
+#
+# Copyright (C) 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:
+#
+# - 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.
+#
+# - 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
+#   specific prior written permission.
+#
+#   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.
+#
+
+module Tree::Utils
+  # Provides utility methods for path extraction
+  module TreePathHandler
+    def self.included(base)
+
+      # @!group Node Path
+
+      # Returns the path of this node from the root as a string, with the node
+      # names separated using the specified separator. The path is listed left
+      # to right from the root node.
+      #
+      # @param separator The optional separator to use. The default separator is
+      #                  '+=>+'.
+      #
+      # @return [String] The node path with names separated using the specified
+      #                  separator.
+      def path_as_string(separator = '=>')
+        path_as_array().join(separator)
+      end
+
+      # Returns the node-names from this node to the root as an array. The first
+      # element is the root node name, and the last element is this node's name.
+      #
+      # @return [Array] The array containing the node names for the path to this
+      # node
+      def path_as_array()
+        get_path_name_array().reverse
+      end
+
+      # @!visibility private
+      #
+      # Returns the path names in an array. The first element is the name of
+      # this node, and the last element is the root node name.
+      #
+      # @return [Array] An array of the node names for the path from this node
+      #                 to its root.
+      def get_path_name_array(current_array_path = [])
+        path_array = current_array_path + [name]
+
+        if !parent              # If detached node or root node.
+          return path_array
+        else                    # Else recurse to parent node.
+          path_array = parent.get_path_name_array(path_array)
+          return path_array
+        end
+      end
+
+      protected :get_path_name_array
+
+      # @!endgroup
+    end # self.included
+  end
+
+end

data/lib/tree/utils/tree_merge_handler.rb

@@ -3,21 +3,21 @@
 # tree_merge_handler.rb
 #
 # Author:  Anupam Sengupta
-# Time-stamp: <2013-12-31 21:52:59 anupam>
+# Time-stamp: <2015-05-30 16:06:18 anupam>
 #
-# Copyright (C) 2013 Anupam Sengupta (anupamsg@gmail.com)
+# Copyright (C) 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
@@ -26,13 +26,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.
 #
 
 # Provides utility methods to merge two {Tree::TreeNode} based trees.
@@ -41,7 +41,8 @@ module Tree::Utils::TreeMergeHandler
 
   # @!group Merging Trees
 
-  # Merge two trees that share the same root node and returns <em>a new tree</em>.
+  # Merge two trees that share the same root node and returns <em>a new
+  # tree</em>.
   #
   # The new tree contains the contents of the merge between _other_tree_ and
   # self. Duplicate nodes (coming from _other_tree_) will *NOT* be overwritten
@@ -52,11 +53,15 @@ module Tree::Utils::TreeMergeHandler
   # @param [Tree::TreeNode] other_tree The other tree to merge with.
   # @return [Tree::TreeNode] the resulting tree following the merge.
   #
-  # @raise [TypeError] This exception is raised if _other_tree_ is not a {Tree::TreeNode}.
-  # @raise [ArgumentError] This exception is raised if _other_tree_ does not have the same root node as self.
+  # @raise [TypeError] This exception is raised if _other_tree_ is not a
+  #                    {Tree::TreeNode}.
+  #
+  # @raise [ArgumentError] This exception is raised if _other_tree_ does not
+  #                        have the same root node as self.
   def merge(other_tree)
     check_merge_prerequisites(other_tree)
-    new_tree = merge_trees( self.root.dup, other_tree.root )
+    new_tree = merge_trees(self.root.dup, other_tree.root)
+    return new_tree
   end
 
   # Merge in another tree (that shares the same root node) into +this+ tree.
@@ -67,8 +72,11 @@ module Tree::Utils::TreeMergeHandler
   #
   # @param [Tree::TreeNode] other_tree The other tree to merge with.
   #
-  # @raise [TypeError] This exception is raised if _other_tree_ is not a {Tree::TreeNode}.
-  # @raise [ArgumentError] This exception is raised if _other_tree_ does not have the same root node as self.
+  # @raise [TypeError] This exception is raised if _other_tree_ is not a
+  #                    {Tree::TreeNode}.
+  #
+  # @raise [ArgumentError] This exception is raised if _other_tree_ does not
+  #                        have the same root node as self.
   def merge!(other_tree)
     check_merge_prerequisites( other_tree )
     merge_trees( self.root, other_tree.root )
@@ -84,11 +92,13 @@ module Tree::Utils::TreeMergeHandler
   # @see #merge!
   def check_merge_prerequisites(other_tree)
     unless other_tree.is_a?(Tree::TreeNode)
-      raise TypeError, 'You can only merge in another instance of Tree::TreeNode'
+      raise TypeError,
+            'You can only merge in another instance of Tree::TreeNode'
     end
 
     unless self.root.name == other_tree.root.name
-      raise ArgumentError, 'Unable to merge trees as they do not share the same root'
+      raise ArgumentError,
+            'Unable to merge trees as they do not share the same root'
     end
   end
 
@@ -97,7 +107,8 @@ module Tree::Utils::TreeMergeHandler
   # @author Darren Oakley (https://github.com/dazoakley)
   #
   # @param [Tree::TreeNode] tree1 The target tree to merge into.
-  # @param [Tree::TreeNode] tree2 The donor tree (that will be merged into target).
+  # @param [Tree::TreeNode] tree2 The donor tree (that will be merged
+  #                               into target).
   # @raise [Tree::TreeNode] The merged tree.
   def merge_trees(tree1, tree2)
     names1 = tree1.has_children? ? tree1.children.map { |child| child.name } : []

data/lib/tree/utils/utils.rb

@@ -4,21 +4,21 @@
 #
 # Author::  Anupam Sengupta (anupamsg@gmail.com)
 #
-# Time-stamp: <2012-08-25 22:01:17 anupam>
+# Time-stamp: <2015-05-30 14:25:57 anupam>
 #
-# Copyright (C) 2012 Anupam Sengupta <anupamsg@gmail.com>
+# Copyright (C) 2012, 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.
 
 # Provides utilities and mixin modules for RubyTree.
 module Tree::Utils

data/lib/tree/version.rb

@@ -8,15 +8,15 @@
 #
 # 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
@@ -25,17 +25,17 @@
 #   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
   # Rubytree Package Version
-  VERSION = '0.9.5pre6'
+  VERSION = '0.9.5pre7'
 end

data/rubytree.gemspec

@@ -0,0 +1,88 @@
+# -*- encoding: utf-8 -*-
+#
+# gemspec for the rubytree gem.
+#
+# Author:: Anupam Sengupta (anupamsg@gmail.com)
+#
+# Copyright (c) 2012, 2013, 2014, 2015 Anupam Sengupta
+# All rights reserved.
+
+$:.unshift File.expand_path("../lib", __FILE__)
+require "tree/version"
+
+Gem::Specification.new do |s|
+  s.name                  = 'rubytree'
+  s.date                  = '2015-01-04'
+  s.version               = Tree::VERSION
+  s.license               = 'BSD'
+
+  s.platform              = Gem::Platform::RUBY
+  s.author                = 'Anupam Sengupta'
+  s.email                 = 'anupamsg@gmail.com'
+  s.homepage              = 'http://rubytree.anupamsg.me'
+
+  s.required_ruby_version = '>=1.8.7'
+
+  s.summary               = %q{A generic tree data structure.}
+  s.description           = <<-EOF
+
+    RubyTree is a pure Ruby implementation of the generic tree data structure. It
+    provides a node-based model to store named nodes in the tree, and provides
+    simple APIs to access, modify and traverse the structure.
+
+    The implementation is node-centric, where individual nodes in the tree are the
+    primary structural elements. All common tree-traversal methods (pre-order,
+    post-order, and breadth-first) are supported.
+
+    The library mixes in the Enumerable and Comparable modules to allow access to
+    the tree as a standard collection (iteration, comparison, etc.).
+
+    A Binary tree is also provided, which provides the in-order traversal in
+    addition to the other methods.
+
+    RubyTree supports importing from, and exporting to JSON, and also supports the
+    Ruby's standard object marshaling.
+
+    This is a BSD licensed open source project, and is hosted at
+    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.anupamsg.me.
+
+  EOF
+
+  s.files                = Dir['lib/**/*.rb']  # The actual code
+  s.files               += Dir['[A-Z]*']       # Various documentation files
+  s.files               += Dir['test/**/*.rb'] # Test cases
+  s.files               += Dir['examples/**/*.rb'] # Examples
+
+  s.files               += ['.gemtest']        # Support for gem-test
+
+  s.require_paths        = ['lib']
+
+  s.test_files           = Dir.glob('test/**/test_*.rb')
+
+  s.extra_rdoc_files     = ['README.md', 'LICENSE.md',
+                            'API-CHANGES.rdoc', 'History.rdoc']
+  s.rdoc_options         = ["--title", "Rubytree Documentation", "--quiet"]
+
+  s.add_runtime_dependency 'structured_warnings' , '~> 0.2'
+  s.add_runtime_dependency 'json'                , '~> 1.8'
+
+  # Note: Rake is added as a development and test dependency in the Gemfile.
+  s.add_development_dependency 'bundler'         , '~> 1.7'
+  s.add_development_dependency 'rdoc'            , '~> 4.2'
+  s.add_development_dependency 'yard'            , '~> 0.8'
+  s.add_development_dependency 'rtagstask'       , '~> 0.0'
+
+  s.post_install_message = <<-EOF
+    ========================================================================
+                    Thank you for installing RubyTree.
+
+    Note:: As of 0.9.5, the Tree::TreeNode#add method has 'move' semantics.
+
+    Details of the API changes are documented in the API-CHANGES file.
+    ========================================================================
+  EOF
+
+end