farce 0.4.1 → 0.6.0

data/lib/farce/walker/modification.rb

@@ -172,14 +172,14 @@ module Farce
         node ? node.changed == true : (@seen.key?(object) && !@seen[object].equal?(object))
       end
 
-      # Follow pending references to check that hashing cannot reach unfinished Data.
+      # Follow pending references to check that hashing cannot reach unfinished values.
       def hashable?(object)
-        return true unless @unfinished_data && !@unfinished_data.empty?
+        return true unless @unfinished_values && !@unfinished_values.empty?
         !Walker.visit(object, constants:, class_variables:) do |value, traversal|
-          traversal.return(true) if @unfinished_data.key?(value)
+          traversal.return(true) if @unfinished_values.key?(value)
           node = @nodes[value] || @destinations&.[](value)
           if node && node.plans
-            traversal.return(true) if @unfinished_data.key?(node.destination)
+            traversal.return(true) if @unfinished_values.key?(node.destination)
             node.plans.each { |plan| plan.children.each { traversal.visit(resolved(it)) } }
           else
             traversal.traverse
@@ -188,10 +188,10 @@ module Farce
         end
       end
 
-      # Reject keys and set elements whose Data dependencies are still being built.
+      # Reject keys and set elements whose immutable dependencies are still being built.
       def check_hash_key(object)
         return object if hashable?(object)
-        raise ArgumentError, "hash key or set element refers to an unfinished Data value"
+        raise ArgumentError, "hash key or set element refers to an unfinished Data or Range value"
       end
 
       private
@@ -217,19 +217,19 @@ module Farce
           dirty        ||= plan.hash_keys && (index % plan.key_stride).zero? && child && child.changed
         end
         node.changed ||= dirty
-        plan.dirty = dirty
+        plan.dirty = dirty || (Range === node.destination && @unfinished_values&.key?(node.destination))
       end
 
-      # Choose a writable destination, copying lazily or allocating unfinished Data.
+      # Choose a writable destination, copying lazily or allocating unfinished values.
       def prepare(node, rebuild: false)
         previous = node.destination
         return previous unless rebuild || previous.equal?(node.original)
         object = node.original
         return object if Internal::Noncopyable === object || Abstract::LeaseMap === object
         destination =
-          if Data === object
+          if Data === object || Range === object
             value = object.class.allocate
-            (@unfinished_data ||= {}.compare_by_identity)[value] = true
+            (@unfinished_values ||= {}.compare_by_identity)[value] = true
             value
           elsif @modify == true
             send_to(object, :frozen?) ? send_to(object, :clone, freeze: false) : object
@@ -241,6 +241,7 @@ module Farce
         (@destinations ||= {}.compare_by_identity)[destination] = node unless destination.equal?(object)
         node.destination = destination
         node.result = destination if !node.skipped && (node.result.equal?(object) || node.result.equal?(previous))
+        node.plans&.each { it.dirty = true } if Range === destination
         destination
       end
 
@@ -259,7 +260,7 @@ module Farce
           node.destination = result
           node.result = result if node.result.equal?(old)
         end
-        @unfinished_data&.delete(node.destination) if Data === node.destination
+        @unfinished_values&.delete(node.destination) if Data === node.destination || Range === node.destination
         return unless node.cyclic
         plan.target = node.destination
         plan.applied = plan.results.dup
@@ -281,6 +282,9 @@ module Farce
         if freeze
           node.changed = true unless send_to(node.result, :frozen?)
           prepare(node) if @modify != true && node.result.equal?(node.original) && !send_to(node.result, :frozen?)
+          if Range === node.destination && @unfinished_values&.key?(node.destination)
+            node.plans&.each { apply(node, it) }
+          end
           send_to(node.result, :freeze)
         end
         finalize_node(node) if finalize
@@ -308,15 +312,25 @@ module Farce
               freezing = !node.skipped && (node.freeze_result || @freeze == true)
               needed   = node.plans&.any?(&:dirty) || (freezing && @modify != true && !send_to(node.original, :frozen?))
               prepare(node) if needed
-              next unless Data === node.destination && send_to(node.destination, :frozen?) && node.plans&.any? do |plan|
-                plan.applied && plan.results.each_with_index.any? { |value, index| !value.equal?(plan.applied[index]) }
+              next unless Data === node.destination || Range === node.destination
+              # Rebuild only after this destination's own assignments become stale.
+              next unless node.plans&.any? do |plan|
+                plan.target.equal?(node.destination) && plan.applied &&
+                  plan.results.each_with_index.any? { |value, index| !value.equal?(plan.applied[index]) }
               end
               prepare(node, rebuild: true)
             end
             break if component.each_with_index.all? { |node, index| node.destination.equal?(destinations[index]) }
           end
 
-          component.sort_by { Data === it.destination ? 2 : (it.plans&.any?(&:hash_keys) ? 1 : 0) }.each do |node|
+          ordered = component.sort_by do |node|
+            if Data === node.destination || Range === node.destination
+              2
+            else
+              node.plans&.any?(&:hash_keys) ? 1 : 0
+            end
+          end
+          ordered.each do |node|
             @node           = node
             @current_object = node.original
             node.plans&.each do |plan|

data/lib/farce/walker.rb

@@ -140,14 +140,18 @@ module Farce
     end
 
     # Transform a graph using the callback's return values.
+    #
     # Call {#traverse} to transform an object's children. Returning another value
     # replaces the object without automatically visiting that replacement.
     # Unchanged branches retain their identity, including when copy is enabled.
+    #
     # Changed cycles are connected before results are frozen or finalized.
     # A cyclic callback may run again as child replacements become known. Keep
     # callbacks repeatable and put publication or caching in {#finalize}.
     # Use {#freeze_result} instead of freezing a preliminary traversal result.
+    #
     # Data values are rebuilt only when members change, using their normal initializer.
+    # Ranges are rebuilt when endpoints or instance variables change.
     # Noncopyable coordination objects, such as leases, are updated in place.
     # Constants and class variables are assigned only when their value
     # changes identity. Constant replacement can emit Ruby redefinition warnings.
@@ -156,6 +160,7 @@ module Farce
     #
     # A walk is not an atomic snapshot or update. Coordinate concurrent writers
     # when transforming container structure, especially map keys.
+    #
     # @param object [BasicObject] the root object
     # @!macro walker_module_options
     # @param copy [Boolean, Symbol] false to edit mutable objects in place, true to
@@ -171,7 +176,7 @@ module Farce
     # @raise [ArgumentError] if copy is neither a boolean nor a Symbol
     # @raise [ArgumentError] if cyclic callbacks do not converge within 32 passes,
     #   or a cyclic finalizer replaces its result
-    # @raise [ArgumentError] if a hash key or set element refers to a Data value
+    # @raise [ArgumentError] if a hash key or set element refers to a Data or Range value
     #   still being constructed. Identity-based containers do not hash their keys.
     def self.modify(object, copy: false, freeze: nil, constants: true, class_variables: true, &callback)
       raise LocalJumpError, "no block given" unless callback
@@ -263,9 +268,11 @@ module Farce
     def remember(object, result) = @seen[object] = result
 
     # Visit child values and describe how to assign their replacements.
+    #
     # The assignment block only runs during modification and may run again for cycles.
     # It receives a writable target and the resolved children. Do not mutate object
     # outside this block. Return the result of update from a traversal definition.
+    #
     # @param object [BasicObject] the object being traversed
     # @param values [Array] child references in assignment order
     # @param hash_keys [Boolean] rebuild when key descendants change in place
@@ -288,6 +295,7 @@ module Farce
     # and requested freezing. Registering another finalizer replaces the first.
     # Cyclic finalizers must preserve identity. Acyclic finalizers may return a
     # canonical replacement, which is propagated to the parent.
+    #
     # @yieldparam result [BasicObject] the settled result
     # @yieldparam cyclic [Boolean] whether the node belongs to a cycle
     # @yieldreturn [BasicObject] the final result

data/lib/farce/weak_atom.rb

@@ -100,14 +100,17 @@ module Farce
       matched
     end
 
+    # (see Abstract::Atom#wait_until)
+    def wait_until(timeout: nil, &) = Internal.wait_until(@atom, timeout:, &)
+
     # (see Abstract::Atom#wait_until_changed)
     def wait_until_changed(expected, timeout: nil, &fallback)
       deadline = Internal.timeout_deadline(timeout)
       while true
-        current = @atom.get(timeout: Internal.remaining_timeout(deadline)) { TIMED_OUT }
+        current = @atom.get(timeout: Clock.remaining(deadline)) { TIMED_OUT }
         return fallback&.call if TIMED_OUT.equal?(current)
         return current unless values_equal?(current, expected)
-        result = @atom.wait_until_changed(current, timeout: Internal.remaining_timeout(deadline)) { TIMED_OUT }
+        result = @atom.wait_until_changed(current, timeout: Clock.remaining(deadline)) { TIMED_OUT }
         return fallback&.call if TIMED_OUT.equal?(result)
       end
     end

data/lib/farce/weak_key_map.rb

@@ -23,7 +23,7 @@ module Farce
 
     private
 
-    def new_map(**)    = Internal::StrictWeakKeyMap.new(**)
+    def new_map(...) = Internal::StrictWeakKeyMap.new(...)
     def freeze_backend = @map
   end
 

data/lib/farce/weak_map.rb

@@ -25,7 +25,7 @@ module Farce
 
     private
 
-    def new_map(**)    = Internal::StrictWeakMap.new(**)
+    def new_map(...) = Internal::StrictWeakMap.new(...)
     def freeze_backend = @map
   end
 

data/lib/farce/weak_value_map.rb

@@ -24,7 +24,7 @@ module Farce
 
     private
 
-    def new_map(**)    = Internal::StrictWeakValueMap.new(**)
+    def new_map(...) = Internal::StrictWeakValueMap.new(...)
     def freeze_backend = @map
   end
 

data/lib/farce.rb

@@ -429,7 +429,9 @@ module Farce
   end
 
   # Schedules work without waiting for the block to finish.
-  # On CRuby, uses a shared Ractor pool with at most {System.cpu_count} workers.
+  # On CRuby, uses a shared Ractor pool with at most {System.cpu_count} workers by default.
+  # Set {Config}'s `parallel_pool_*` options before creating a scheduler to configure
+  # its worker limits, growth and shrink delays, per-worker task limit, and queue capacity.
   # On JRuby and TruffleRuby, starts a new thread for each task.
   #
   # Without a block, returns the shared scheduler. The CRuby pool starts workers

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: farce
 version: !ruby/object:Gem::Version
-  version: 0.4.1
+  version: 0.6.0
 platform: ruby
 authors:
 - Konstantin Haase
@@ -74,6 +74,7 @@ files:
 - ext/farce/transaction.h
 - ext/farce/tree_map.c
 - ext/farce/trie.c
+- ext/farce/trie_search.h
 - ext/farce/unshareable.c
 - ext/farce/unshared_io_pool.h
 - ext/farce/unshared_signal.c
@@ -81,6 +82,7 @@ files:
 - ext/farce/unsupported.c
 - ext/farce/vector.c
 - ext/farce/weak_map.c
+- ext/farce/weak_references.h
 - ext/java/org/farce/BoundedMap.java
 - ext/java/org/farce/FiberScheduler.java
 - ext/java/org/farce/PriorityKey.java
@@ -114,6 +116,7 @@ files:
 - lib/farce/abstract/pool.rb
 - lib/farce/abstract/port.rb
 - lib/farce/abstract/priority_queue.rb
+- lib/farce/abstract/publisher.rb
 - lib/farce/abstract/queue.rb
 - lib/farce/abstract/scheduler.rb
 - lib/farce/abstract/set.rb
@@ -131,6 +134,14 @@ files:
 - lib/farce/backports.rb
 - lib/farce/class_mirror.rb
 - lib/farce/clock.rb
+- lib/farce/concurrent.rb
+- lib/farce/concurrent/count_down_latch.rb
+- lib/farce/concurrent/cyclic_barrier.rb
+- lib/farce/concurrent/event.rb
+- lib/farce/concurrent/fiber_local_var.rb
+- lib/farce/concurrent/local_var.rb
+- lib/farce/concurrent/thread_local_var.rb
+- lib/farce/concurrent/tuple.rb
 - lib/farce/config.rb
 - lib/farce/counter.rb
 - lib/farce/deduper.rb
@@ -185,6 +196,7 @@ files:
 - lib/farce/engine/ruby/shared/vault.rb
 - lib/farce/engine/ruby/shared/vault_weak_map.rb
 - lib/farce/engine/ruby/shared/weak_atom.rb
+- lib/farce/engine/ruby/shared/weak_cache_mirror.rb
 - lib/farce/engine/ruby/shared/weak_map.rb
 - lib/farce/engine/shared.rb
 - lib/farce/engine/shared/atom.rb
@@ -209,6 +221,7 @@ files:
 - lib/farce/engine/shared/strict_tree_map.rb
 - lib/farce/engine/shared/transaction_map_backend.rb
 - lib/farce/engine/shared/trie.rb
+- lib/farce/engine/shared/trie/ignore_case.rb
 - lib/farce/engine/shared/trie_builder.rb
 - lib/farce/engine/shared/unshareable.rb
 - lib/farce/engine/shared/unshared_atom.rb
@@ -298,6 +311,7 @@ files:
 - lib/farce/internal/mutable_ordered_key_lock_map.rb
 - lib/farce/internal/noncopyable.rb
 - lib/farce/internal/ordered_key_lock_map.rb
+- lib/farce/internal/pool_settings.rb
 - lib/farce/internal/pool_supervisor.rb
 - lib/farce/internal/pool_worker.rb
 - lib/farce/internal/portable_transaction.rb
@@ -349,6 +363,7 @@ files:
 - lib/farce/local/molecule.rb
 - lib/farce/local/pool.rb
 - lib/farce/local/priority_queue.rb
+- lib/farce/local/publisher.rb
 - lib/farce/local/queue.rb
 - lib/farce/local/scheduler.rb
 - lib/farce/local/scoped.rb
@@ -365,6 +380,7 @@ files:
 - lib/farce/lock.rb
 - lib/farce/lru_map.rb
 - lib/farce/map.rb
+- lib/farce/memoize.rb
 - lib/farce/mode_manager.rb
 - lib/farce/mode_manager/smart_rule.rb
 - lib/farce/molecule.rb
@@ -377,6 +393,7 @@ files:
 - lib/farce/proxy/register.rb
 - lib/farce/proxy/supervisor.rb
 - lib/farce/proxy/wrapper.rb
+- lib/farce/publisher.rb
 - lib/farce/queue.rb
 - lib/farce/ractor.rb
 - lib/farce/read_write_lock.rb
@@ -404,6 +421,7 @@ files:
 - lib/farce/strict/molecule.rb
 - lib/farce/strict/port.rb
 - lib/farce/strict/priority_queue.rb
+- lib/farce/strict/publisher.rb
 - lib/farce/strict/queue.rb
 - lib/farce/strict/set.rb
 - lib/farce/strict/sorted_set.rb
@@ -411,10 +429,13 @@ files:
 - lib/farce/strict/tree_map.rb
 - lib/farce/strict/vector.rb
 - lib/farce/strict/weak_atom.rb
+- lib/farce/strict/weak_cache.rb
 - lib/farce/strict/weak_key_map.rb
 - lib/farce/strict/weak_map.rb
 - lib/farce/strict/weak_set.rb
 - lib/farce/strict/weak_value_map.rb
+- lib/farce/subscription.rb
+- lib/farce/subscription/definitions.rb
 - lib/farce/system.rb
 - lib/farce/task.rb
 - lib/farce/thread_executor.rb
@@ -452,6 +473,7 @@ files:
 - lib/farce/unshared/molecule.rb
 - lib/farce/unshared/pool.rb
 - lib/farce/unshared/priority_queue.rb
+- lib/farce/unshared/publisher.rb
 - lib/farce/unshared/queue.rb
 - lib/farce/unshared/scheduler.rb
 - lib/farce/unshared/set.rb