modular_tree 0.11.0 → 0.13.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: c0947ea53f44cfdfdf8c615c26217fc7bfd86b9fae98f6c234519ace576f911d
-  data.tar.gz: 6dc9685845668b34db4724828f777e80d1e808557c1e8b63988f23a82fdccccf
+  metadata.gz: 2cd6d39620d1c665267716d2089f1c498a1d0dd4aef5fc4b2cba175590d483a8
+  data.tar.gz: 9f6f684e5433a04541761abb0a6379e18093c77fb2e3cd257ae7bba49ada19c1
 SHA512:
-  metadata.gz: e18eeb61df2ec711d51501175409ce1b085dc86d01c65ae3863f9abf4c72ff2e051dfc070541652acfdc6515859a2b7e0cf9c11ea665c5d1f9146c83ad881701
-  data.tar.gz: b7f8dfbd482c7c64dd8f52f52d17d2ad2b4e82ee5e0604adbc790aa576ade55c0e26456df207938656ef5314fd4601809797669c11a488ba89d861e020bee905
+  metadata.gz: 72e405f8c4e5dcf4111c964301b482743d2ccec4b644c196fc64f15fe5393f713eb7f2e675f6c6f48a694764b4b055196e18a1a53145bfb6e9af920a6991325a
+  data.tar.gz: 01da8646f20a98c4b4dc85ed7f79e67842a0c5f3836a28a6b1e171f723c861d154ba250bb70243027404daf108f61e09a07a4d2fbf800fcd4a3a3beb9c1d5bee

data/lib/modular_tree/algorithms.rb

@@ -10,15 +10,20 @@ module Tree
     include BranchesProperty
 
     # Bottom-up
-    def ancestors # TODO: rename #parents
+    def parents(*filter)
+      filter = Filter.new(*filter)
       curr = self
       a = []
-      a.push curr.node while curr = curr.branch
+      while curr = curr.branch
+        select, continue = filter.match(curr.node)
+        a.push curr.node if select
+        break if !continue
+      end
       a
     end
 
     # Top-down # TODO: rename #ancestors
-    def ancestry
+    def ancestors
       curr = self
       a = []
       a.unshift curr.node while curr = curr.branch
@@ -69,11 +74,18 @@ module Tree
 
     # Implementation of Enumerable#select extended with a single filter. As
     # #each, the block is called with value, key, and parent arguments
-    def select(filter = nil, this: true, &block)
+    #
+    # The match expression can also be a list of classes (instead of an array of classes)
+    #
+    def select(*expr, this: true, &block)
+      !block_given? || expr.empty? or raise ArgumentError, "Can't use both match expression and block"
       if block_given?
-        each(block, true, this: this).to_a
+        each.select { |branch| yield branch }
+      elsif !expr.empty?
+        matcher = Matcher.new(*expr, &block)
+        each.select { |branch| matcher.match? branch }
       else
-        each(filter || true, true, this: this)
+        each
       end
     end
 
@@ -83,14 +95,15 @@ module Tree
     # The match expression can also be a list of classes (instead of an array of classes)
     #
     # TODO: Maybe make #children an Array extended with filtering
-    def choose(*args, &block)
-      matcher = Matcher.new(*args, &block)
+    def choose(*expr, &block)
+      !block_given? || expr.empty? or raise ArgumentError, "Can't use both match expression and block"
       if block_given?
-        a = []
-        each_branch { |branch, key| a << branch if matcher.match? branch }
-        a
+        each_branch.select { |branch| yield branch }
+      elsif !expr.empty?
+        matcher = Matcher.new(*expr, &block)
+        each_branch.select { |branch| matcher.match? branch }
       else
-        Enumerator.new { |enum| each_branch { |branch, key| enum << branch if matcher.match? branch } }
+        each
       end
     end
 
@@ -104,10 +117,14 @@ module Tree
     # Post-order enumerator of selected nodes
     def postorder(*filter, this: true) = common_each(*filter, :node_value, :each_postorder, this)
 
+    # TODO IDEA: 
+    #   edges -> parent/child nodes
+    #   pairs -> parent/.../descendant nodes
+
     # Enumerator of edges in the tree. Edges are [previous-matching-node,
     # matching-node] tuples. Top-level nodes have previous-matching-node set to
-    # nil. If the filter matches all nodes the value is an edge-representation
-    # of the tree
+    # nil (the result is a forrest). If the filter matches all nodes the value
+    # is an edge-representation of the tree
     def edges(*filter, this: true, &block)
       if block_given?
         each(*filter, this: this) { |node, _, parent| yield parent, node }
@@ -117,7 +134,7 @@ module Tree
     end
 
     # Return array of [previous-matching-node, matching-node] tuples. Returns
-    # the empty array ff there is no matching set of nodes
+    # the empty array iff there is no matching set of nodes
     def pairs(first_match_expr, second_match_expr, this: true)
       first_matcher = Matcher.new(first_match_expr)
       second_matcher = Matcher.new(second_match_expr)

data/lib/modular_tree/implementations.rb

@@ -159,6 +159,9 @@ module Tree
     attr_writer :next_sibling
   end
 
+  # TODO: A ChildrenArrayImplementation that defines #insert and #append and
+  # adds an optional index argument to #attach
+
   module InternalChildrenArrayImplementation
     include InternalChildrenImplementation
 
@@ -183,6 +186,8 @@ module Tree
     # index or an object
     #
     # TODO: Rename #attach. #insert & #append are Enumerable operations
+    #
+    # TODO: Default where argument - insert: 0, append: -1
     def insert(where, child) = insert_append(:insert, where, child)
     def append(where, child) = insert_append(:append, where, child)
 

data/lib/modular_tree/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module Tree
-  VERSION = "0.11.0"
+  VERSION = "0.13.0"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: modular_tree
 version: !ruby/object:Gem::Version
-  version: 0.11.0
+  version: 0.13.0
 platform: ruby
 authors:
 - Claus Rasmussen
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2022-12-23 00:00:00.000000000 Z
+date: 2023-01-10 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: constrain