forester 4.3.0 → 5.0.0

data/lib/forester/version.rb

@@ -1,17 +1,3 @@
 module Forester
-  class Version
-    MAJOR = 4
-    MINOR = 3
-    PATCH = 0
-    PRE = nil
-
-    class << self
-
-      def to_s
-        [MAJOR, MINOR, PATCH, PRE].compact.join('.')
-      end
-
-    end
-
-  end
+  VERSION = '5.0.0'.freeze
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: forester
 version: !ruby/object:Gem::Version
-  version: 4.3.0
+  version: 5.0.0
 platform: ruby
 authors:
 - Eugenio Bruno
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-02-26 00:00:00.000000000 Z
+date: 2017-08-06 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubytree
@@ -24,97 +24,134 @@ dependencies:
     - - '='
       - !ruby/object:Gem::Version
         version: 0.9.7
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.15'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.15'
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: '12.0'
+        version: '10.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: '12.0'
+        version: '10.0'
 - !ruby/object:Gem::Dependency
   name: minitest
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+- !ruby/object:Gem::Dependency
+  name: minitest-bender
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: '5.10'
+        version: '0.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: '5.10'
+        version: '0.0'
 - !ruby/object:Gem::Dependency
   name: simplecov
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
         version: '0.14'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
         version: '0.14'
+- !ruby/object:Gem::Dependency
+  name: coveralls
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.8'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.8'
 - !ruby/object:Gem::Dependency
   name: pry-byebug
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
         version: '3.4'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
         version: '3.4'
-description: Forester is a collection of utilities to represent and interact with
-  tree data structures.
-email: eugeniobruno@gmail.com
+description: 
+email:
+- eugeniobruno@gmail.com
 executables: []
 extensions: []
-extra_rdoc_files: []
+extra_rdoc_files:
+- LICENSE.txt
+- README.md
+- CODE_OF_CONDUCT.md
+- CHANGELOG.md
 files:
-- .gitignore
-- .travis.yml
+- ".gitignore"
+- ".travis.yml"
+- CHANGELOG.md
+- CODE_OF_CONDUCT.md
 - Gemfile
-- LICENSE
+- LICENSE.txt
 - README.md
 - Rakefile
+- bin/console
+- bin/setup
 - forester.gemspec
 - lib/forester.rb
-- lib/forester/node_content/base.rb
-- lib/forester/node_content/dictionary.rb
-- lib/forester/node_content/factory.rb
-- lib/forester/node_content/list.rb
 - lib/forester/tree_factory.rb
 - lib/forester/tree_node.rb
-- lib/forester/tree_node_ext/aggregators.rb
+- lib/forester/tree_node_ext/iterators.rb
 - lib/forester/tree_node_ext/mutators.rb
+- lib/forester/tree_node_ext/serializers.rb
 - lib/forester/tree_node_ext/validators.rb
-- lib/forester/tree_node_ext/views.rb
 - lib/forester/version.rb
-- test/minitest_helper.rb
-- test/test_ad_hoc_tree.rb
-- test/test_aggregators.rb
-- test/test_mutators.rb
-- test/test_tree_factory.rb
-- test/test_tree_node.rb
-- test/test_validators.rb
-- test/test_views.rb
-- test/trees/simple_tree.yml
 homepage: https://github.com/eugeniobruno/forester
 licenses:
 - MIT
@@ -125,27 +162,18 @@ require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: 2.0.0
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.4.8
+rubygems_version: 2.5.1
 signing_key: 
 specification_version: 4
-summary: A trees library
-test_files:
-- test/minitest_helper.rb
-- test/test_ad_hoc_tree.rb
-- test/test_aggregators.rb
-- test/test_mutators.rb
-- test/test_tree_factory.rb
-- test/test_tree_node.rb
-- test/test_validators.rb
-- test/test_views.rb
-- test/trees/simple_tree.yml
+summary: Forester is a library to work with tree data structures.
+test_files: []

data/lib/forester/node_content/base.rb

@@ -1,9 +0,0 @@
-module Forester
-  module NodeContent
-    class Base < SimpleDelegator
-
-
-
-    end
-  end
-end

data/lib/forester/node_content/dictionary.rb

@@ -1,91 +0,0 @@
-module Forester
-  module NodeContent
-    class Dictionary < Base
-
-      def fields
-        keys
-      end
-
-      def has_key?(key, indifferent = true)
-        if indifferent
-          equivs(key).any? { |k| super(k) }
-        else
-          super(key)
-        end
-      end
-      alias_method :has?, :has_key?
-
-      def [](key)
-        super(best key)
-      end
-
-      def fetch(key, default = :yield_to_block, &block)
-        best_key = best key
-        if default == :yield_to_block
-          super(best_key, &block)
-        else
-          super(best_key, default, &block)
-        end
-      end
-      alias_method :get, :fetch
-
-      def []=(key, value, options = {})
-        default_options = {
-          symbolize_key: true
-        }
-        options = default_options.merge(options)
-
-        convert_key = ->(k) { k }
-        convert_key = ->(k) { k.to_sym } if options[:symbolize_key]
-
-        super(convert_key.call(key), value)
-      end
-      alias_method :put!, :[]=
-
-      def delete(key, default = :yield_to_block, &block)
-        best_key = best key
-        if default == :yield_to_block
-          super(best_key, &block)
-        else
-          super(best_key, default, &block)
-        end
-      end
-      alias_method :del!, :delete
-
-      def to_hash(options = {})
-        default_options = {
-          fields_to_include: fields, # all of them
-          stringify_keys:    false,
-          symbolize_keys:    false
-        }
-        options = default_options.merge(options)
-        options[:fields_to_include] = fields if options[:fields_to_include] == :all
-
-        convert_key = ->(k) { k }
-        convert_key = ->(k) { k.to_s }   if options[:stringify_keys]
-        convert_key = ->(k) { k.to_sym } if options[:symbolize_keys]
-
-        each_with_object({}) do |(k, v), hash|
-          if equivs(k).any? { |eq| options[:fields_to_include].include?(eq) }
-            hash[convert_key.call(k)] = v
-          end
-        end
-      end
-
-      def merge(dictionary)
-        self.class.new(super)
-      end
-
-      private
-
-      def equivs(key)
-        [key, key.to_s, key.to_s.to_sym].uniq
-      end
-
-      def best(key)
-        equivs(key).find { |k| has_key?(k, false) } || key
-      end
-
-    end
-  end
-end

data/lib/forester/node_content/factory.rb

@@ -1,25 +0,0 @@
-module Forester
-  module NodeContent
-    module Factory
-
-      extend self
-
-      def from_hash(hash, children_key, indifferent = true)
-        ret = without_key(hash, children_key)
-        ret = Dictionary.new(ret) if indifferent
-        ret
-      end
-
-      def from_array(array)
-        List.new(array)
-      end
-
-      private
-
-      def without_key(hash, key)
-        hash.reject { |k, _| k.to_s == key.to_s }
-      end
-
-    end
-  end
-end

data/lib/forester/node_content/list.rb

@@ -1,31 +0,0 @@
-module Forester
-  module NodeContent
-    class List < Base
-
-      def include?(*args)
-        super
-      end
-      alias_method :has?, :include?
-
-      def fetch(*args)
-        super
-      end
-      alias_method :get, :fetch
-
-      def push(*args)
-        super
-      end
-      alias_method :add!, :push
-
-      def delete(*args)
-        super
-      end
-      alias_method :del!, :delete
-
-      def to_array
-        Array.new(self)
-      end
-
-    end
-  end
-end

data/lib/forester/tree_node_ext/aggregators.rb

@@ -1,101 +0,0 @@
-module Forester
-  module Aggregators
-
-    def own_and_descendants(field, options = {}, &if_missing)
-      default_options = {
-        traversal: :depth_first
-      }
-      options = default_options.merge(options)
-
-      if_missing = -> (node) { [] } unless block_given?
-
-      each_node(traversal: options[:traversal]).flat_map do |node|
-        as_array(node.get(field, &if_missing))
-      end
-    end
-
-    def nodes_with(field, values, options = {})
-      default_options = {
-        single: false
-      }
-      options = default_options.merge(options)
-
-      method = options[:single] ? :find : :select
-      found_nodes = each_node.public_send(method) do |node|
-        not ( as_array(node.get(field) { :no_match }) & as_array(values) ).empty?
-      end
-
-      as_array(found_nodes)
-    end
-
-    def with_ancestry(options = {})
-      default_options = {
-        include_root: true,
-        include_self: true,
-        descending:   true
-      }
-      options = default_options.merge(options)
-
-      ancestors = self.parentage          || []
-      ancestors = ancestors[0...-1]       unless options[:include_root]
-      ancestors = ancestors.unshift(self) if     options[:include_self]
-
-      options[:descending] ? ancestors.reverse : ancestors
-    end
-
-    def search(options)
-      default_options = {
-        single_node: false,
-        by_field:    :name,
-        keywords:    :missing_search_keywords,
-        then_get:    :nodes, # if :nodes, subtree is ignored
-        subtree:     true
-      }
-      options = default_options.merge(options)
-
-      found_nodes = nodes_with(options[:by_field], options[:keywords], single: options[:single_node] )
-
-      return found_nodes if options[:then_get] == :nodes
-      # TODO this method should never return [nil]. This happens when single_node
-      # is true and no matches are found. Moreover, if then_get is not :nodes,
-      # it should not raise. Both cases should return [].
-
-      found_nodes.flat_map do |node|
-        node.get(options[:then_get], subtree: options[:subtree])
-      end
-    end
-
-    def group_by_sibling_subtrees(options = {})
-      default_options = {
-        level:             1,
-        group_field:       'name',
-        aggregation_field: 'value',
-        if_field_missing:  -> (node) { [] },
-        ancestry_in_keys:  false, # if false, with_root is ignored
-        with_root:         false
-      }
-      options = default_options.merge(options)
-
-      nodes_of_level(options[:level]).each_with_object({}) do |node, hash|
-        key =
-          if options[:ancestry_in_keys]
-            nodes_for_key = node.with_ancestry(include_root: options[:with_root])
-            nodes_for_key.map { |n| get_or_id(n, options[:group_field]) }
-          else
-            get_or_id(node, options[:group_field])
-          end
-
-        value = node.own_and_descendants(options[:aggregation_field], &options[:if_field_missing])
-
-        hash[key] = value
-      end
-    end
-
-    private
-
-    def get_or_id(node, field)
-      node.get(field) { |n| n.object_id }
-    end
-
-  end
-end