ruby-dagger 0.1.0 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: e030dad6d87f620512b7a158700c1f8cea254b52a22c07a7553830fe30091235
-  data.tar.gz: 72f5cb1df8b73511966b807265429afca3afd3a60160c82ff2431cd3564e8754
+  metadata.gz: d74463b8145c28c660a15879bd8e3ce3ff2059aa7bd9fbf6ec58ed0d2412d7b2
+  data.tar.gz: ea0364d683460c925dddc028dbbb041e06774cba69c3725d738c9a850bffa5c5
 SHA512:
-  metadata.gz: c608c41c1390c0a39a4bfb3be347bc7c423f4594b06c5c041ebbd544620379afceb9cf9f40b257e3323b0d1e9f869da53dbe311b444f75c74ad872099a8966cf
-  data.tar.gz: a45e9fecd2fb5eb124632e01279857e5edfe8f6f619a8f5d061d8f57c67db894699bade0c7e9977eff65f9447161839c23ec284259169016921f613dfe263601
+  metadata.gz: 9e0e6bde47b0aeed349122b293fcd4322febe07c9a6d85c1e469e479661d4152aa01ed62340dc26d4a901acba5951a0cd4ca53f012da6f06ff30e9d8fddf94a2
+  data.tar.gz: 20e4b90104dc47c3abe92b9fed52f3a7b4f3fdb101154f62b2bd2cd9a46fb7dc8c6cabb922dc4e0aa0df997c85524c8ea37979a75f1ba9abc74cd92311a0787c

data/README.md

@@ -1,12 +1,14 @@
-[![Gem Version](https://badge.fury.io/rb/ruby-dagger.svg)](https://badge.fury.io/rb/ruby-dagger) [![Maintainability](https://api.codeclimate.com/v1/badges/0d92a4d05b6bb5c06dce/maintainability)](https://codeclimate.com/github/notCalle/ruby-dagger/maintainability)
+[![Gem Version](https://badge.fury.io/rb/ruby-dagger.svg)](https://badge.fury.io/rb/ruby-dagger) [![Maintainability](https://api.codeclimate.com/v1/badges/4038215eb129292a826d/maintainability)](https://codeclimate.com/github/notCalle/ruby-dagger/maintainability)
 
 # Dagger
 
-`Dagger` can manage a [directed acyclic graph](/notcalle/tangle) of
-[key trees](/notcalle/keytree), inspired by the ideas behind [PalletJack](/saab-simc-admin/palletjack).
+`Dagger` can manage a
+[directed acyclic graph](https://github.com/notcalle/tangle) of
+[key trees](https://github.com/notcalle/keytree), inspired by the ideas behind [PalletJack](https://github.com/saab-simc-admin/palletjack).
 
 The DAG is stored in a regular posix file system hierarchy, where
-/directories/ are vertices with a forest of key trees from the contained /files/. Edges are formed from the directory structure, and /symlinks/.
+_directories_ are vertices with a forest of key trees from the contained
+_files_. Edges are formed from the directory structure, and _symlinks_.
 
 Edge direction (default top->down & target->source) is selectable,
 but key tree inheritence is always top->down & target->source.

data/lib/dagger/default.rb

@@ -57,11 +57,9 @@ module Dagger
     def process(key)
       catch do |ball|
         default_rules(key).each do |rule|
-          context = Context.new(result: ball,
-                                dictionary: @dictionary,
-                                rule_chain: rule.clone)
+          context = Context.new(result: ball, dictionary: @dictionary)
 
-          process_rule(context) until context.rule_chain.empty?
+          process_rule_chain(rule, context)
         end
         raise KeyError, %(no rule succeeded for "#{key}")
       end
@@ -75,15 +73,17 @@ module Dagger
       @dictionary.fetch(@rule_prefix + key)
     end
 
-    # Call the processing method for the first clause of a rule
+    # Process the methods in a rule chain
     #
     # :call-seq:
-    #   call_rule
-    def process_rule(context)
-      key, arg = *context.rule_chain.first
-      context.rule_chain.delete(key)
-      klass = Dagger::Generate.const_get(camelize(key))
-      klass[context, arg, &->(value) { throw context.result, value }]
+    #   process_rule_chain(rule_chain, context)
+    def process_rule_chain(rule_chain, context)
+      rule_chain.each do |key, arg|
+        klass = Dagger::Generate.const_get(camelize(key))
+        klass[context, arg, &->(value) { throw context.result, value }]
+      end
+    rescue StopIteration
+      nil
     end
 
     # Convert snake_case to CamelCase

data/lib/dagger/generator.rb

@@ -8,12 +8,15 @@ module Dagger
   # +Context+ key access:
   # :call-seq:
   #   dictionary => Hash-like with current key lookup dictionary.
-  #   rule_chain => Hash of remaining rules in the current chain.
   #
   # +Context+ value update:
   # :call-seq:
   #   update(key: value, ...)
   #
+  # Stop the processing of current rule chain:
+  # :call-seq:
+  #   stop
+  #
   # Wrap non-enumerable objects in an +Array+
   # :call-seq:
   #   enumerable(value) => value || [value]
@@ -37,7 +40,17 @@ module Dagger
 
     private
 
-    delegate %i[dictionary rule_chain] => :@context
+    delegate %i[dictionary] => :@context
+
+    # Stop processing the current rule chain
+    #
+    # :call-seq:
+    #   stop
+    #
+    # Raises +StopIteration+
+    def stop
+      raise StopIteration
+    end
 
     # Update context attributes with new values
     #

data/lib/dagger/generator/require.rb

@@ -10,7 +10,7 @@ module Dagger
     #   - ...
     class Require < Dagger::Generator
       def process(keys)
-        return unless keys.all? do |key, regexps|
+        stop unless keys.any? do |key, regexps|
           string = dictionary[key]
           enumerable(regexps).any? do |regexp|
             ::Regexp.new(regexp).match?(string)

data/lib/dagger/generator/require_name.rb

@@ -10,7 +10,7 @@ module Dagger
     class RequireName < Dagger::Generator
       def process(regexps)
         string = dictionary['_meta.name']
-        enumerable(regexps).any? do |regexp|
+        stop unless enumerable(regexps).any? do |regexp|
           ::Regexp.new(regexp).match?(string)
         end
       end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ruby-dagger
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.1
 platform: ruby
 authors:
 - Calle Englund
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2018-05-25 00:00:00.000000000 Z
+date: 2018-05-26 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: key_tree