rubytree 0.9.0 → 0.9.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: ac2fe1bd84044b1981f67b94bbf751f144d96afb
-  data.tar.gz: 20ed672c1300c42447b483919a47fe8128d8ad05
+  metadata.gz: 04cb1c44d2c9f5c11c5f9202b0e24202e287579a
+  data.tar.gz: a6b6581c4b1bcc106896889a092ece86a93e3bb5
 SHA512:
-  metadata.gz: eb12ccc374632de68c78121c70a8a0c3c7e42e3c062c78a179df542d2e459928464c0404a546ab14f06394c0db8b73e5baf21818a87f2b7dcddf5e58b37a783f
-  data.tar.gz: 1249c16cf513a6f44e713338e7bd1eb38a8d3ee554d0584126fe093bc89013ca9efc06516be82cada869479da93d23aef84fe070f0efa94261255a5bb7525d01
+  metadata.gz: 9dcc9b36d0ca03c71c11658e637086ee9f2decbbe1429f296ea38afbc73c2902b5375387429c882329a64d2740ad43eb3abb0de34be03a4b58413c0098e36722
+  data.tar.gz: 33dc63cd509b22d768c29cca9dd7c75744add483b6003577df13ce3990541d38113420a17ad5b74c72993796b80e692164c1d7e580b91ccdf301505b4a1fb36a

data/Gemfile

@@ -5,6 +5,7 @@ gemspec
 
 group :development, :test do
   gem "rake", "~> 10.1"
+  gem "coveralls", ">= 0.7", :require => false, :platforms => :mri_21
 end
 
 # Local Variables:

data/Gemfile.lock

@@ -1,20 +1,40 @@
 PATH
   remote: .
   specs:
-    rubytree (0.9.0)
+    rubytree (0.9.2)
       json (~> 1.8)
       structured_warnings (~> 0.1)
 
 GEM
   remote: https://rubygems.org/
   specs:
+    coveralls (0.7.0)
+      multi_json (~> 1.3)
+      rest-client
+      simplecov (>= 0.7)
+      term-ansicolor
+      thor
+    docile (1.1.1)
     json (1.8.1)
+    mime-types (2.0)
+    multi_json (1.8.2)
     rake (10.1.1)
     rdoc (4.1.0)
+    rest-client (1.6.7)
+      mime-types (>= 1.16)
     rtags (0.98)
     rtagstask (0.0.4)
       rtags (> 0.0.0)
+    simplecov (0.8.2)
+      docile (~> 1.1.0)
+      multi_json
+      simplecov-html (~> 0.8.0)
+    simplecov-html (0.8.0)
     structured_warnings (0.1.4)
+    term-ansicolor (1.2.2)
+      tins (~> 0.8)
+    thor (0.18.1)
+    tins (0.13.1)
     yard (0.8.7.3)
 
 PLATFORMS
@@ -22,6 +42,7 @@ PLATFORMS
 
 DEPENDENCIES
   bundler (~> 1.5)
+  coveralls (>= 0.7)
   rake (~> 10.1)
   rdoc (~> 4.1)
   rtagstask (~> 0.0)

data/History.rdoc

@@ -2,7 +2,21 @@
 
 = History of Changes
 
-=== 0.9.0 / 2013-12-31
+=== 0.9.2 / 2014-01-03
+
+* Yanked R0.9.1 as the History file was not updated.
+
+* Updated the gem description.
+
+* Changed the travis-ci build to include coverall support.
+
+=== 0.9.1 / 2014-01-03
+
+* Updated the Gem description.
+
+* Incorporated code coverage using the coverall gem.
+
+=== 0.9.0 / 2014-01-02
 
 This is a feature and bug-fix release.
 

data/Rakefile

@@ -2,7 +2,7 @@
 #
 # Rakefile - This file is part of the RubyTree package.
 #
-# Copyright (c) 2006, 2007, 2009, 2010, 2011, 2012, 2013  Anupam Sengupta
+# Copyright (c) 2006, 2007, 2009, 2010, 2011, 2012, 2013, 2014  Anupam Sengupta
 #
 # All rights reserved.
 #
@@ -40,7 +40,13 @@ PKG_VER  = GEM_SPEC.version
 GEM_NAME = "#{PKG_NAME}-#{PKG_VER}.gem"
 
 desc "Default Task (Run the tests)"
-task :default => 'test:unit'
+task :default do
+  if ENV["COVERAGE"]
+    Rake::Task["test:coverage"].invoke
+  else
+    Rake::Task["test:unit"].invoke
+  end
+end
 
 desc "Display the current gem version"
 task :version do
@@ -108,6 +114,11 @@ namespace :test do              # ................................ Test related
     example.warning = false
   end
 
+  desc "Run the code coverage"
+  task :coverage do
+    ruby 'test/run_test.rb'
+  end
+
   begin
     require 'rcov/rcovtask'
     Rcov::RcovTask.new(:rcov) do |t|

data/lib/tree/version.rb

@@ -4,7 +4,7 @@
 #
 # Author:: Anupam Sengupta (anupamsg@gmail.com)
 #
-# Copyright (c) 2012, 2013 Anupam Sengupta
+# Copyright (c) 2012, 2013, 2014 Anupam Sengupta
 #
 # All rights reserved.
 #
@@ -37,5 +37,5 @@
 #
 module Tree
   # Rubytree Package Version
-  VERSION = '0.9.0'
+  VERSION = '0.9.2'
 end

data/test/run_test.rb

@@ -0,0 +1,60 @@
+#!/usr/bin/env ruby
+#
+# run_test.rb:: Run all the tests from the Ruby command line.
+#
+# Author:  Anupam Sengupta
+# Time-stamp: <2014-01-03 21:15:37 anupam>
+# Copyright (C) 2014 Anupam Sengupta <anupamsg@gmail.com>
+#
+# 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.
+#
+
+base_dir = File.expand_path(File.join(File.dirname(__FILE__), ".."))
+lib_dir  = File.join(base_dir, "lib")
+test_dir = File.join(base_dir, "test")
+
+$LOAD_PATH.unshift(lib_dir)
+
+if ENV["COVERAGE"]
+  begin
+    require 'simplecov'
+    require 'coveralls'
+
+    SimpleCov.formatter = Coveralls::SimpleCov::Formatter
+
+    SimpleCov.start do
+      add_filter '/test/'
+      add_group 'Core Classes', '/lib/.*tree.rb'
+      add_group 'Internal Utilities', '/lib/tree/utils/.*.rb'
+    end
+  rescue LoadError => e
+    puts "Could not load simplecov; continuing without code coverage"
+  end
+end
+
+require 'test/unit'
+
+exit Test::Unit::AutoRunner.run(true, test_dir)

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rubytree
 version: !ruby/object:Gem::Version
-  version: 0.9.0
+  version: 0.9.2
 platform: ruby
 authors:
 - Anupam Sengupta
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-08-21 00:00:00.000000000 Z
+date: 2014-01-03 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: structured_warnings
@@ -94,15 +94,31 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '0.0'
-description: |2
-      RubyTree is a Ruby implementation of the generic tree data structure.
-      It provides a node-based model to store uniquely identifiable node-elements
-      in the tree and simple APIs to access, modify and traverse the structure.
-      RubyTree is node-centric, where individual nodes on the tree are the primary
-      compositional and structural elements.
+description: |2+
+
+      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.rubyforge.org.
 
-      This implementation also mixes in the Enumerable module to allow standard
-      access to the tree as a collection.
 email: anupamsg@gmail.com
 executables: []
 extensions: []
@@ -120,7 +136,6 @@ files:
 - LICENSE.md
 - README.md
 - Rakefile
-- TAGS
 - TODO.org
 - examples/example_basic.rb
 - lib/rubytree.rb
@@ -133,6 +148,7 @@ files:
 - lib/tree/utils/tree_merge_handler.rb
 - lib/tree/utils/utils.rb
 - lib/tree/version.rb
+- test/run_test.rb
 - test/test_binarytree.rb
 - test/test_rubytree_require.rb
 - test/test_subclassed_node.rb

data/TAGS

@@ -1,218 +0,0 @@
-
-../.dir-locals.el,0
-
-../examples/example_basic.rb,0
-
-../lib/rubytree.rb,0
-
-../lib/tree/binarytree.rb,544
-module TreeTree
43,1900
-  class BinaryTreeNode < TreeNodeBinaryTreeNode
52,2207
-    def left_childleft_child
62,2488
-    def right_childright_child
74,2879
-    def is_left_child?is_left_child?
83,3155
-    def is_right_child?is_right_child?
93,3486
-    def add(child)add
110,4143
-    def inordered_each(&block)inordered_each
128,4662
-    def set_child_at(child, at_index)set_child_at
159,5598
-    def left_child=(child)left_child=
178,6266
-    def right_child=(child)right_child=
190,6635
-    def swap_childrenswap_children
195,6781
-
-../lib/tree/tree_deps.rb,0
-
-../lib/tree/utils/camel_case_method_handler.rb,271
-module Tree::UtilsTree
41,1848
-  module CamelCaseMethodHandlerCamelCaseMethodHandler
44,2002
-    def self.included(base)included
45,2034
-      def method_missing(meth, *args, &blk)method_missing
49,2180
-      def to_snake_case(camel_cased_word)to_snake_case
66,2792
-
-../lib/tree/utils/json_converter.rb,263
-module Tree::Utils::JSONConverterTree
42,1899
-  def self.included(base)included
44,1934
-  def as_json(options = {})as_json
61,2385
-  def to_json(*a)to_json
89,3093
-  module ClassMethodsClassMethods
94,3243
-    def json_create(json_hash)json_create
113,3956
-
-../lib/tree/utils/metrics_methods.rb,451
-module Tree::UtilsTree
41,1833
-  module TreeMetricsHandlerTreeMetricsHandler
43,1916
-    def self.included(base)included
44,1944
-      def sizesize
56,2311
-      def lengthlength
67,2655
-      def node_heightnode_height
80,3072
-      def node_depthnode_depth
96,3683
-      def levellevel
105,3869
-      def depthdepth
124,4554
-      def breadthbreadth
140,5191
-      def in_degreein_degree
154,5654
-      def out_degreeout_degree
165,5967
-
-../lib/tree/utils/tree_merge_handler.rb,259
-module Tree::Utils::TreeMergeHandlerTree
40,1769
-  def merge(other_tree)merge
57,2498
-  def merge!(other_tree)merge!
72,3132
-  def check_merge_prerequisites(other_tree)check_merge_prerequisites
85,3439
-  def merge_trees(tree1, tree2)merge_trees
102,4084
-
-../lib/tree/utils/utils.rb,32
-module Tree::UtilsTree
39,1838
-
-../lib/tree/version.rb,25
-module TreeTree
38,1717
-
-../lib/tree.rb,2022
-module TreeTree
53,2335
-  class TreeNodeTreeNode
90,3884
-    def rootroot
131,5161
-    def is_root?is_root?
142,5467
-    def has_content?has_content?
150,5650
-    def is_leaf?is_leaf?
161,5904
-    def parentageparentage
173,6279
-    def has_children?has_children?
191,6705
-    def initialize(name, content = nil)initialize
214,7531
-    def detached_copydetached_copy
232,8148
-    def detached_subtree_copydetached_subtree_copy
242,8434
-    def marshal_dumpmarshal_dump
256,8873
-    def create_dump_rep           # :nodoc:create_dump_rep
262,9041
-    def marshal_load(dumped_tree_array)marshal_load
277,9579
-    def to_sto_s
302,10363
-    def <<(child)<<
325,11134
-    def add(child, at_index = -1)add
360,12640
-    def insertion_rangeinsertion_range
379,13509
-    def remove!(child)remove!
401,14296
-    def parent=(parent)         # :nodoc:parent=
416,14699
-    def remove_from_parent!remove_from_parent!
429,15084
-    def remove_all!remove_all!
440,15456
-    def set_as_root!              # :nodoc:set_as_root!
451,15685
-    def freeze_tree!freeze_tree!
461,16011
-    def [](name_or_index, num_as_name=false)[]
501,17529
-    def each(&block)             # :yields: nodeeach
526,18496
-    def preordered_each(&block)  # :yields: nodepreordered_each
554,19456
-    def postordered_each(&block)postordered_each
566,19868
-    def breadth_each(&block)breadth_each
602,21294
-    def childrenchildren
628,22232
-    def each_leaf &blockeach_leaf
649,22853
-    def first_childfirst_child
666,23275
-    def last_childlast_child
674,23486
-    def first_siblingfirst_sibling
690,23933
-    def is_first_sibling?is_first_sibling?
700,24207
-    def last_siblinglast_sibling
714,24623
-    def is_last_sibling?is_last_sibling?
724,24893
-    def siblingssiblings
740,25446
-    def is_only_child?is_only_child?
759,25998
-    def next_siblingnext_sibling
772,26401
-    def previous_siblingprevious_sibling
788,26875
-    def <=>(other)<=>
804,27386
-    def print_tree(level = 0)print_tree
812,27615
-
-../test/test_binarytree.rb,798
-module TestTreeTestTree
39,1717
-  class TestBinaryTreeNode < Test::Unit::TestCaseTestBinaryTreeNode
41,1774
-    def setupsetup
44,1864
-    def teardownteardown
52,2167
-    def test_initializetest_initialize
59,2326
-    def test_addtest_add
67,2715
-    def test_inordered_eachtest_inordered_each
90,3629
-    def test_left_childtest_left_child
134,5097
-    def test_right_childtest_right_child
142,5410
-    def test_left_child_equalstest_left_child_equals
150,5723
-    def test_right_child_equalstest_right_child_equals
169,6713
-    def test_is_left_child_ehtest_is_left_child_eh
189,7830
-    def test_is_right_child_ehtest_is_right_child_eh
204,8369
-    def test_swap_childrentest_swap_children
218,8915
-    def test_old_camelCase_method_namestest_old_camelCase_method_names
236,9798
-
-../test/test_rubytree_require.rb,180
-module TestTreeTestTree
38,1678
-  class TestRequireRubytree < Test::Unit::TestCaseTestRequireRubytree
41,1757
-    def test_create_a_simple_nodetest_create_a_simple_node
44,1880
-
-../test/test_subclassed_node.rb,301
-module TestTreeTestTree
39,1688
-  class TestSubclassedTreeNode < Test::Unit::TestCaseTestSubclassedTreeNode
42,1739
-    class MyNode < Tree::TreeNodeMyNode
45,1864
-      def my_dummy_methodmy_dummy_method
47,1961
-    def test_subclassed_camelcase_methodstest_subclassed_camelcase_methods
52,2022
-
-../test/test_thread_and_fiber.rb,331
-module TestTreeTestTree
39,1695
-  class TestFiberAndThreadOnNode < Test::Unit::TestCaseTestFiberAndThreadOnNode
41,1745
-    def create_long_depth_trees(depth=100)create_long_depth_trees
44,1839
-    def test_fiber_for_recursiontest_fiber_for_recursion
59,2256
-    def test_thread_for_recursiontest_thread_for_recursion
73,2803
-
-../test/test_tree.rb,3873
-module TestTreeTestTree
39,1719
-  class TestTreeNode < Test::Unit::TestCaseTestTreeNode
41,1769
-    def setupsetup
65,2600
-    def setup_test_treesetup_test_tree
77,3020
-    def teardownteardown
84,3170
-    def test_has_version_numbertest_has_version_number
89,3262
-    def test_root_setuptest_root_setup
94,3413
-    def test_roottest_root
111,4463
-    def test_has_content_ehtest_has_content_eh
124,5013
-    def test_length_is_sizetest_length_is_size
135,5471
-    def test_spaceshiptest_spaceship
141,5661
-    def test_is_comparabletest_is_comparable
167,6444
-    def test_to_stest_to_s
185,7226
-    def test_first_siblingtest_first_sibling
218,8944
-    def test_is_first_sibling_ehtest_is_first_sibling_eh
231,9672
-    def test_is_last_sibling_ehtest_is_last_sibling_eh
242,10155
-    def test_last_siblingtest_last_sibling
253,10623
-    def test_siblingstest_siblings
265,11277
-    def test_is_only_child_ehtest_is_only_child_eh
293,12200
-    def test_next_siblingtest_next_sibling
304,12636
-    def test_previous_siblingtest_previous_sibling
315,13136
-    def test_addtest_add
326,13665
-    def test_add_at_specific_positiontest_add_at_specific_position
350,14474
-    def test_remove_bangtest_remove_bang
414,17527
-    def test_remove_all_bangtest_remove_all_bang
446,18490
-    def test_remove_from_parent_bangtest_remove_from_parent_bang
456,18796
-    def test_childrentest_children
475,19511
-    def test_first_childtest_first_child
511,21100
-    def test_last_childtest_last_child
520,21428
-    def test_findtest_find
529,21744
-    def test_parentagetest_parentage
544,22339
-    def test_eachtest_each
553,22671
-    def test_each_leaftest_each_leaf
572,23355
-    def test_parenttest_parent
599,24550
-    def test_indexed_accesstest_indexed_access
610,24969
-    def test_print_treetest_print_tree
621,25342
-    def test_marshal_dumptest_marshal_dump
628,25502
-    def test_collecttest_collect
673,27745
-    def test_freeze_tree_bangtest_freeze_tree_bang
683,28011
-    def test_contenttest_content
697,28533
-    def test_depthtest_depth
705,28924
-    def do_deprecated_depthdo_deprecated_depth
716,29297
-    def test_node_heighttest_node_height
734,29865
-    def test_node_depthtest_node_depth
759,31074
-    def test_leveltest_level
772,31511
-    def test_breadthtest_breadth
787,32054
-    def test_breadth_eachtest_breadth_each
806,32701
-    def test_preordered_eachtest_preordered_each
847,34007
-    def test_postordered_eachtest_postordered_each
886,35261
-    def test_detached_copytest_detached_copy
925,36516
-    def test_detached_subtree_copytest_detached_subtree_copy
942,37244
-    def test_has_children_ehtest_has_children_eh
976,39496
-    def test_is_leaf_ehtest_is_leaf_eh
982,39658
-    def test_is_root_ehtest_is_root_eh
989,39864
-    def test_content_equalstest_content_equals
995,40027
-    def test_sizetest_size
1003,40292
-    def test_lt2                # Test the << methodtest_lt2
1012,40556
-    def test_index              #  Test the [] methodtest_index
1023,41048
-    def test_in_degreetest_in_degree
1044,42144
-    def test_out_degreetest_out_degree
1055,42611
-    def test_json_serializationtest_json_serialization
1066,43098
-    def test_json_deserializationtest_json_deserialization
1090,43898
-    def test_json_roundtriptest_json_roundtrip
1118,45084
-    def test_old_camelCase_method_namestest_old_camelCase_method_names
1134,45825
-    def test_integer_node_namestest_integer_node_names
1165,46893
-    def test_add_node_to_self_as_childtest_add_node_to_self_as_child
1196,48123
-    def test_single_node_becomes_leaftest_single_node_becomes_leaf
1208,48548
-    def test_unique_node_namestest_unique_node_names
1219,48895
-    def setup_other_test_treesetup_other_test_tree
1227,49139
-    def test_mergetest_merge
1255,50128
-    def test_merge_bangtest_merge_bang
1284,51566