behavior_machines 0.1.0 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: ec761ecd4fe6d6f47c9441607ef0df573a49ec611d96f113f46547e7872b219d
-  data.tar.gz: 16be482a97faa6d3807aa41cc66d4e1088a1e0732f11ad12cfcb53e70e0fdc32
+  metadata.gz: 9a83e1e8b54ae643e0763d07afbf5b34f5ddf80790c55e57a958f82754a8328f
+  data.tar.gz: 4df17f639b4f87c83473508e5d44eac058f1e9ced1ebce87a630c0a27498818f
 SHA512:
-  metadata.gz: 446b75ee20966a1564d2669645018c06dab4a2ce535ae2f57a6bdb070d1ec628e99dd29812ca32168103da2f9cbcefb46311557d3631b718844fe49b8a230d79
-  data.tar.gz: 3a0e4f7c47e9b787c95d1ab4a2c9dbe71205f46bedc291153a698093affc6d5d874789187fba678b7595ae1efe05e020236c48131889d63210adfd77be506266
+  metadata.gz: c3bb6e3ba9b6f58c861193cdc944c425167544425531b60d06ea31c2a5d7b6bd3354101918f22d3593ae26cb27399058eedf9f668316fa22da1d0815006458a2
+  data.tar.gz: fe002a3c84e4dce7e8d8049762f062bcc31f39c17a52c4b02921d2a2e46d42bf6c40dab32d63cd0155fd8385b0e27033920d37181c27609ecf4ee63cc1d9846d

data/README.md

@@ -68,7 +68,8 @@ compiles them.
 Durations are seconds. The clock is an Integer count of nanoseconds, passed as
 `now:` and defaulting to `BehaviorMachines.now` (monotonic).
 `tree.next_deadline` returns when a running `sleep` or `timeout` next needs a
-tick, so a host can sleep until then.
+tick, so a host can sleep until then. A looping decorator that finished a run
+reports that tick's time, so its next run is due at once.
 
 ## Errors
 

data/lib/behavior_machines/engine.rb

@@ -441,7 +441,7 @@ module BehaviorMachines
     end
 
     # Repeat, RetryUntilSuccessful, and KeepRunningUntilFailure: at most one
-    # finished child run per tick.
+    # finished child run per tick; the next run is due at once.
     class LoopSlot < Slot
       def initialize(id, child, again_on, limit)
         super(id)
@@ -449,20 +449,28 @@ module BehaviorMachines
         @again_on = again_on
         @limit = limit
         @runs = 0
+        @due = nil
       end
 
       private
 
       def step(run, now, _starting)
+        @due = nil
         return @again_on if @limit&.zero?
 
         status = @child.tick(run, now)
         return status if status == :running
         return finish(status) unless status == @again_on
-        return :running if @limit.nil?
+        return again(now) if @limit.nil?
         return finish(status) if @runs + 1 == @limit
 
         @runs += 1
+        again(now)
+      end
+
+      # A run finished and the next waits for a tick: due at once.
+      def again(now)
+        @due = now
         :running
       end
 
@@ -476,7 +484,7 @@ module BehaviorMachines
         @runs = 0
       end
 
-      def running_deadline = @child.next_deadline
+      def running_deadline = earliest([@due, @child.next_deadline])
     end
   end
 end

data/lib/behavior_machines/tree.rb

@@ -53,7 +53,8 @@ module BehaviorMachines
       @engine.running?
     end
 
-    # The earliest time, in nanoseconds, a running Sleep or Timeout will fire.
+    # The earliest time, in nanoseconds, a running Sleep or Timeout will fire,
+    # or a looping decorator wants its next run (already due).
     def next_deadline
       check_idle
       @engine.next_deadline

data/lib/behavior_machines/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module BehaviorMachines
-  VERSION = '0.1.0'
+  VERSION = '0.2.0'
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: behavior_machines
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.2.0
 platform: ruby
 authors:
 - Abdelkader Boudih