farce 0.4.1-java → 0.6.0-java

data/lib/farce/engine/shared/trie/ignore_case.rb

@@ -0,0 +1,136 @@
+# frozen_string_literal: true
+# shareable_constant_value: literal
+# warn_indent: true
+
+module Farce
+  module Internal
+    class PortableTrie
+      # @api private
+      module IgnoreCase
+        private
+
+        def each_result(input, peek:, deduplicate:, &)
+          raise TypeError, "input must be a String" unless input.is_a?(String)
+          input = String.new(input)
+          validate_encoding!(input, "input")
+
+          input_length = input.length
+          static_input = input.downcase
+          if static_input.length != input_length
+            return each_expanding_result(input, static_input, peek:, deduplicate:, &)
+          end
+          seen = {} if deduplicate
+          stack = [[@root, 0, EMPTY_CAPTURES, EMPTY_NAMED_CAPTURES, 0, 0]]
+
+          until stack.empty?
+            node, position, captures, named, phase, index = stack.pop
+            if phase.zero?
+              child = nil
+              stride = node.stride
+              if node.fast_static
+                key = static_input[position, stride]
+                child = node.fast_static[key] if key
+              elsif position < input_length && !node.static.empty?
+                child = node.static[static_input[position]]
+              end
+              if child
+                # Retain only frames with alternatives or a terminal result.
+                stack << [node, position, captures, named, 1, 0] unless node.dynamic.empty? && node.tokens.empty?
+                stack << [child, position + stride, captures, named, 0, 0]
+                next
+              end
+            end
+            if index < node.dynamic.length
+              regexp, child = node.dynamic[index]
+              if index + 1 < node.dynamic.length || !node.tokens.empty?
+                stack << [node, position, captures, named, 1, index + 1]
+              end
+              if (matched = regexp.match(input, position))
+                stack << [
+                  child,
+                  matched.end(0),
+                  captures + matched.captures,
+                  merge_named_captures(named, matched.named_captures),
+                  0,
+                  0
+                ]
+              end
+            elsif (peek || position == input_length) && !node.tokens.empty?
+              node.tokens.each do |token_id|
+                next if deduplicate && seen.key?(token_id)
+
+                seen[token_id] = true if deduplicate
+                yield(
+                  @tokens.fetch(token_id),
+                  captures.map { |value| value&.dup },
+                  copy_named_captures(named),
+                  input[position..] || +""
+                )
+              end
+            end
+          end
+        end
+
+        def each_expanding_result(input, static_input, peek:, deduplicate:)
+          to_original = [0]
+          from_original = [0]
+          input.each_char.with_index do |character, index|
+            count = character.downcase.length
+            # An internal lowercase boundary cannot start a regexp or end a result.
+            (count - 1).times { to_original << nil }
+            to_original << (index + 1)
+            from_original << (to_original.length - 1)
+          end
+          input_length = static_input.length
+          seen = {} if deduplicate
+          stack = [[@root, 0, EMPTY_CAPTURES, EMPTY_NAMED_CAPTURES, 0, 0]]
+
+          until stack.empty?
+            node, position, captures, named, phase, index = stack.pop
+            original_position = to_original[position]
+            case phase
+            when 0
+              stack << [node, position, captures, named, 1, 0]
+              if node.fast_static
+                key = static_input[position, node.stride]
+                if key && (child = node.fast_static[key])
+                  stack << [child, position + node.stride, captures, named, 0, 0]
+                end
+              elsif position < input_length && (child = node.static[static_input[position]])
+                stack << [child, position + 1, captures, named, 0, 0]
+              end
+            when 1
+              if index < node.dynamic.length
+                regexp, child = node.dynamic[index]
+                stack << [node, position, captures, named, 1, index + 1]
+                if original_position && (matched = regexp.match(input, original_position))
+                  stack << [
+                    child,
+                    from_original[matched.end(0)],
+                    captures + matched.captures,
+                    merge_named_captures(named, matched.named_captures),
+                    0,
+                    0
+                  ]
+                end
+              elsif original_position && (peek || position == input_length) && !node.tokens.empty?
+                node.tokens.each do |token_id|
+                  next if deduplicate && seen.key?(token_id)
+
+                  seen[token_id] = true if deduplicate
+                  yield(
+                    @tokens.fetch(token_id),
+                    captures.map { |value| value&.dup },
+                    copy_named_captures(named),
+                    input[original_position..] || +""
+                  )
+                end
+              end
+            end
+          end
+        end
+      end
+      private_constant :IgnoreCase
+    end
+  end
+end

data/lib/farce/engine/shared/trie.rb

@@ -76,11 +76,16 @@ module Farce
       end
       private_constant :Node
 
-      def initialize(entries, tokens)
+      def initialize(entries, tokens, ignore_case: false)
         validate_array!(entries, "entries")
         validate_array!(tokens, "tokens")
         validate_tokens!(tokens)
 
+        if ignore_case
+          @ignore_case = true
+          extend IgnoreCase
+        end
+
         @tokens      = Array.new(tokens).freeze
         @root        = Node.new
         nodes        = [@root]
@@ -103,6 +108,7 @@ module Farce
             when String
               literal = String.new(part)
               validate_encoding!(literal, "edge")
+              literal.downcase! if ignore_case
               literal.each_char do |character|
                 child = node.static[character]
                 unless child
@@ -171,6 +177,12 @@ module Farce
 
       private
 
+      def initialize_dup(other)
+        super
+        # Unlike clone, dup does not retain the instance's matching module.
+        extend IgnoreCase if @ignore_case
+      end
+
       def anchor(regexp)
         compile_regexp("\\G(?:#{regexp.source})", regexp)
       rescue RegexpError
@@ -314,4 +326,5 @@ module Farce
   end
 end
 
+require "farce/engine/shared/trie/ignore_case"
 require "farce/engine/shared/trie_builder"

data/lib/farce/engine/shared/trie_builder.rb

@@ -17,6 +17,13 @@ module Farce
     # terminal match. A regexp edge is atomic. Later edges cannot make a regexp
     # choose a different endpoint.
     #
+    # Pass `ignore_case: true` to {.build} or {Builder.new} to compare all static
+    # segments using Unicode downcasing. Regexp options do not change. Regexp
+    # matches, captures, and suffixes use the original input and retain its casing.
+    # This does not include every equivalence supported by `Regexp::IGNORECASE`.
+    # For example, `"SS"` matches `"ss"`, but `"ß"` does not match `"ss"`.
+    # Case-equivalent static entries share a branch and retain their token order.
+    #
     # Tokens must already be Ractor-shareable. They are stored and returned
     # unchanged. Equal but different token objects remain separate. Reusing the
     # same token object produces at most one result per lookup.
@@ -94,20 +101,23 @@ module Farce
       # Collects entries and publishes immutable {Trie} snapshots.
       class Builder
         # Create an empty builder.
-        def initialize
+        # @param ignore_case [Boolean] compare all static segments without case
+        def initialize(ignore_case: false)
           @entries = []
+          @ignore_case = !!ignore_case
         end
 
         # @api private
         def marshal_dump
           entries = @entries.map { |parts, token| [parts, Internal::MarshalSupport.value(token)] }
-          [1, entries, frozen?]
+          [1, entries, frozen?, @ignore_case]
         end
 
         # @api private
         def marshal_load(data)
-          entries, frozen = Internal::MarshalSupport.payload(data, 2)
-          initialize
+          length = data.is_a?(Array) && data.length == 3 ? 2 : 3
+          entries, frozen, ignore_case = Internal::MarshalSupport.payload(data, length)
+          initialize(ignore_case:)
           entries.each { |parts, token| add(parts, Internal::MarshalSupport.restore_value(token)) }
           freeze if frozen
         end
@@ -159,7 +169,7 @@ module Farce
             [parts.dup.freeze, token_ids.fetch(token)].freeze
           end.freeze
 
-          Trie.send(:build_entries, entries, tokens.freeze)
+          Trie.send(:build_entries, entries, tokens.freeze, ignore_case: @ignore_case)
         end
 
         private
@@ -180,17 +190,18 @@ module Farce
       class << self
         # Build an immutable trie.
         #
+        # @param ignore_case [Boolean] compare all static segments without case
         # @yieldparam builder [Builder]
         # @return [Trie]
-        def build
-          builder = Builder.new
+        def build(ignore_case: false)
+          builder = Builder.new(ignore_case:)
           yield builder if block_given?
           builder.build
         end
 
         private
 
-        def build_entries(entries, tokens) = new(entries, tokens)
+        def build_entries(entries, tokens, ignore_case:) = new(entries, tokens, ignore_case:)
 
         private :new
       end

data/lib/farce/engine/shared/unshared_atom.rb

@@ -129,7 +129,7 @@ module Farce
 
         loop do
           current, version = @mutex.synchronize { [@value, @version] }
-          return current unless values_equal?(current, expected)
+          return current if Internal.value_changed?(current, expected, compare_by_identity?)
 
           result = @mutex.synchronize do
             next unless @version == version

data/lib/farce/engine/shared/unshared_vector.rb

@@ -6,9 +6,11 @@ module Farce
   # @!visibility private
   module Internal # :nodoc: all
     class UnsharedVector
+      def self.normalize_source(source) = source.is_a?(Integer) ? Array.new(source) : source
+
       def initialize(source = nil, compare_by_identity: false)
         validate_boolean(compare_by_identity, "compare_by_identity")
-        raise TypeError, "source must be an Array" unless source.nil? || source.is_a?(Array)
+        raise TypeError, "source must be an Array" unless source.nil? || source.is_a?(Array) || source.is_a?(Integer)
 
         @values              = source ? Array.new(source) : []
         @compare_by_identity = compare_by_identity
@@ -274,12 +276,12 @@ module Farce
         finish_update if completed
       end
 
-      def wait_until_changed(index, expected, timeout: nil)
-        wait_for_value(convert_index(index), expected, timeout_deadline(timeout), non_nil: false)
+      def wait_until_changed(index, expected, timeout: nil, &fallback)
+        wait_for_value(convert_index(index), expected, timeout_deadline(timeout), fallback, non_nil: false)
       end
 
       def wait_until_non_nil(index, timeout: nil)
-        wait_for_value(convert_index(index), nil, timeout_deadline(timeout), non_nil: true)
+        wait_for_value(convert_index(index), nil, timeout_deadline(timeout), nil, non_nil: true)
       end
 
       def compare_by_identity? = @compare_by_identity
@@ -341,20 +343,21 @@ module Farce
         raise FrozenError.new("can't modify frozen #{self.class}", receiver: self)
       end
 
-      def wait_for_value(index, expected, deadline, non_nil:)
+      def wait_for_value(index, expected, deadline, fallback, non_nil:)
         while true
           generation = @signal.generation
           current    = @mutex.synchronize { @values[index] }
-          ready      = non_nil ? !current.nil? : !values_equal?(current, expected)
+          ready      = non_nil ? !current.nil? :
+            Internal.value_changed?(current, expected, compare_by_identity?)
           return current if ready
-          return unless wait_for_signal(generation, deadline)
+          return fallback&.call unless wait_for_signal(generation, deadline)
         end
       end
 
       def wait_for_signal(generation, deadline)
         return @signal.wait(generation) unless deadline
 
-        remaining = deadline - Clock.now
+        remaining = Clock.remaining(deadline)
         return false unless remaining.positive?
         !@signal.wait(generation, timeout: remaining).nil?
       end

data/lib/farce/engine/shared/unshared_weak_map.rb

@@ -145,10 +145,11 @@ module Farce
       # Yield presence and value under the entry reservation.
       # MAP_KEEP and MAP_DELETE are control results. Other results replace the value.
       # Return whether a change committed.
-      def modify(key) # rubocop:disable Naming/PredicateMethod
+      def modify(key, timeout: nil)
         raise LocalJumpError, "no block given" unless block_given?
         check_frozen!
-        _, result = with_entry(key, nil, create: true, mutating: true) do |present, current, entry, index|
+        deadline = timeout_deadline(timeout)
+        completed, result = with_entry(key, deadline, create: true, mutating: true) do |present, current, entry, index|
           value = yield(present, current)
           check_frozen!
           if MAP_KEEP.equal?(value)
@@ -161,7 +162,7 @@ module Farce
             entry.store(value)
           end
         end
-        !!result
+        completed && !!result
       end
 
       def wait_until_changed(key, expected, timeout: nil, &fallback)
@@ -352,7 +353,7 @@ module Farce
           return fallback&.call if timed_out == :timed_out
 
           unless entry
-            return nil unless values_equal?(nil, expected)
+            return nil if Internal.value_changed?(nil, expected, compare_values_by_identity?)
             return fallback&.call unless signal_changed?(@index.change_signal, observed, deadline)
             next
           end
@@ -373,13 +374,14 @@ module Farce
           # lookup object. Otherwise GC could orphan the entry's change signal.
           key     = stored_key
           current = nil unless present
-          return current if non_nil ? !current.nil? : !values_equal?(current, expected)
+          return current if non_nil ? !current.nil? :
+            Internal.value_changed?(current, expected, compare_values_by_identity?)
           return fallback&.call unless entry.wait_for_change?(changed, deadline)
         end
       end
 
       def signal_changed?(signal, observed, deadline)
-        timeout = deadline - Clock.now if deadline
+        timeout = Clock.remaining(deadline)
         return false if timeout && !timeout.positive?
 
         timed_out = Object.new

data/lib/farce/engine/shared/vector.rb

@@ -6,6 +6,8 @@ module Farce
   # @!visibility private
   module Internal # :nodoc: all
     class Vector < UnsharedVector
+      def self.new_for_modes(source) = new(source, compare_by_identity: true)
+
       def initialize(source = nil, **)
         source.each { check_value(it) } if source.is_a?(Array)
         super

data/lib/farce/engine/shared/weak_atom/base.rb

@@ -146,7 +146,7 @@ module Farce
       def with_value(timeout)
         deadline = timeout_deadline(timeout)
         result = TIMED_OUT
-        @lock.update(timeout: remaining_timeout(deadline)) do
+        @lock.update(timeout: Clock.remaining(deadline)) do
           result = yield
           nil
         end
@@ -158,11 +158,12 @@ module Farce
         loop do
           generation = @changes.value
           current    = read_value
-          return current if non_nil ? !current.nil? : !values_equal?(current, expected)
+          return current if non_nil ? !current.nil? :
+            Internal.value_changed?(current, expected, compare_by_identity?)
           # Detect recursive waits without waiting for another owner's update.
           @lock.get(timeout: 0)
-          return fallback&.call if remaining_timeout(deadline)&.zero?
-          @changes.wait_until_changed(generation, timeout: remaining_timeout(deadline))
+          return fallback&.call if Clock.remaining(deadline)&.zero?
+          @changes.wait_until_changed(generation, timeout: Clock.remaining(deadline))
         end
       end
 
@@ -177,12 +178,6 @@ module Farce
         raise ArgumentError, "timeout must be finite and non-negative" unless timeout.finite? && !timeout.negative?
         Clock.now + timeout
       end
-
-      def remaining_timeout(deadline)
-        return unless deadline
-        remaining = deadline - Clock.now
-        remaining.negative? ? 0 : remaining
-      end
     end
     private_constant :WeakAtomBase
   end

data/lib/farce/engine/shared/weak_map/cell.rb

@@ -61,7 +61,7 @@ module Farce
       end
 
       def wait_for_change?(observed, deadline)
-        timeout = deadline - Clock.now if deadline
+        timeout = Clock.remaining(deadline)
         return false if timeout && !timeout.positive?
         !!@changes.wait(observed, timeout:) { false }
       end

data/lib/farce/engine/shared.rb

@@ -54,6 +54,8 @@ module Farce
       end
     end
 
+    def native_weak_maps? = true
+
     # define_method supplies the receiver. Rebinding first is unnecessary without
     # native Ractor isolation and can change the method context used by super.
     def prepare_method_definition(&definition) = definition

data/lib/farce/engine/truffleruby/map.rb

@@ -28,7 +28,8 @@ module Farce
         end
 
         def eql?(other)
-          result = other.is_a?(Key) && value.eql?(other.value)
+          result = other.is_a?(Key) &&
+            (BASIC_OBJECT_EQUAL_METHOD.bind_call(value, other.value) || value.eql?(other.value))
           owner = mutation_owner || (other.mutation_owner if other.is_a?(Key))
           Internal::Freeze.check(owner) if owner
           result
@@ -214,11 +215,11 @@ module Farce
       # Yield presence and value under the key reservation.
       # MAP_KEEP and MAP_DELETE are control results. Other results replace the value.
       # Return whether a change committed.
-      def modify(key) # rubocop:disable Naming/PredicateMethod
+      def modify(key, timeout: nil)
         raise LocalJumpError, "no block given" unless block_given?
         check_frozen!
         wrapped = wrap_key(key)
-        _, result = with_mutating_key_operation(wrapped, nil) do |reservation|
+        completed, result = with_mutating_key_operation(wrapped, timeout_deadline(timeout)) do |reservation|
           present, current = native_operation { [concurrent_key?(wrapped), concurrent_get(wrapped)] }
           value = yield(present, current)
           next false if MAP_KEEP.equal?(value)
@@ -231,7 +232,7 @@ module Farce
             changed!
           end
         end
-        !!result
+        completed && !!result
       end
 
       def upsert(key, initial_value, timeout: nil)
@@ -557,7 +558,8 @@ module Farce
             native_operation { concurrent_get(wrapped) }
           end
           return fallback&.call unless completed
-          ready = non_nil ? !current.nil? : !values_equal?(current, expected)
+          ready = non_nil ? !current.nil? :
+            Internal.value_changed?(current, expected, compare_values_by_identity?)
           return current if ready
           return fallback&.call unless wait_for_signal(@change_signal, generation, deadline)
         end
@@ -566,7 +568,7 @@ module Farce
       def wait_for_signal(signal, generation, deadline)
         return signal.wait(generation) unless deadline
 
-        remaining = deadline - Clock.now
+        remaining = Clock.remaining(deadline)
         return false unless remaining.positive?
         !signal.wait(generation, timeout: remaining).nil?
       end

data/lib/farce/engine/truffleruby/native/counter.rb

@@ -60,7 +60,6 @@ module Farce
           check_frozen!
         end
         change(delta)
-        self
       end
 
       def decrement(delta = 1)
@@ -70,7 +69,6 @@ module Farce
           check_frozen!
         end
         change(-delta)
-        self
       end
 
       alias value get

data/lib/farce/engine/truffleruby/native/priority_queue.rb

@@ -23,8 +23,8 @@ module Farce
       private_constant :Bucket, :TrackedItem
 
       class State
-        attr_accessor :size, :sealed, :closed, :generation, :operation_owner
-        attr_reader :buckets, :capacity, :signal, :lock, :tracked_items, :track_age
+        attr_accessor :size, :sealed, :closed, :generation, :operation_owner, :capacity
+        attr_reader :buckets, :signal, :lock, :tracked_items, :track_age
 
         def initialize(capacity:, signal:, lock:, track_age:)
           @buckets = []
@@ -139,7 +139,18 @@ module Farce
         with_queue_operation(state) { state.size.zero? } # rubocop:disable Style/ZeroLengthPredicate
       end
 
-      def capacity = initialized_state.capacity
+      def capacity
+        state = initialized_state
+        with_queue_operation(state) { state.capacity }
+      end
+
+      def capacity=(value)
+        state = initialized_state
+        value = normalize_capacity(value)
+        with_queue_operation(state) do
+          notify_and_commit(state) { state.capacity = value }
+        end
+      end
 
       def clear
         state = initialized_state
@@ -262,7 +273,10 @@ module Farce
 
       def normalize_capacity(capacity)
         return nil if capacity.nil?
-        capacity = capacity.to_int unless primitive_is_a?(capacity, Integer)
+        unless primitive_is_a?(capacity, Integer)
+          raise TypeError, "capacity must be an Integer or nil" unless capacity.respond_to?(:to_int)
+          capacity = capacity.to_int
+        end
         raise TypeError, "capacity must be an Integer or nil" unless primitive_is_a?(capacity, Integer)
         raise ArgumentError, "capacity must be positive or nil" unless capacity.positive?
         capacity

data/lib/farce/engine/truffleruby/signal.rb

@@ -43,7 +43,7 @@ module Farce
               current = generation
               break current unless current == observed
 
-              remaining = deadline - Clock.now if deadline
+              remaining = Clock.remaining(deadline)
               break TIMED_OUT if remaining && !remaining.positive?
               @num_waiting.set(@num_waiting.get + 1) unless waiting
               waiting = true

data/lib/farce/engine/truffleruby.rb

@@ -39,6 +39,15 @@ module Farce
 
     def native_ractors? = false
 
+    # Range#initialize rejects open endpoints on TruffleRuby, while Range.new accepts them.
+    def initialize_range(target, first, last, exclude_end)
+      if first.nil? || last.nil?
+        target.__send__(:initialize_copy, target.class.new(first, last, exclude_end))
+      else
+        target.__send__(:initialize, first, last, exclude_end)
+      end
+    end
+
     # @api private
     # TruffleRuby probes this additional hook before using _dump.
     def marshal_protocol_method?(name)

data/lib/farce/extension.rb

@@ -100,13 +100,15 @@ module Farce
     # @yield the block containing method definitions
     # @yieldreceiver [Module, Refinement] the module/refinement used for extending the target class.
     # @return [self] the extension instance
-    def define(*targets, &)
+    # rubocop:disable-next Naming/BlockForwarding, Style/ArgumentsForwarding
+    def define(*targets, &block)
+      # JRuby rejects repeated anonymous block forwarding inside a block.
       @lock.synchronize do
         check_state!
         targets.each do |target|
-          refine(target, &)
+          refine(target, &block)
           mixin = @definitions.store_if_absent(target) { Mixin.new(self, target) }
-          mixin.module_eval(&)
+          mixin.module_eval(&block)
           mixin.install if installed?
         end
       end

data/lib/farce/integrations/concurrent.rb

@@ -3,9 +3,14 @@
 # warn_indent: true
 
 # @!group concurrent-ruby Integration
-require "farce"           unless defined?(Farce::Abstract)
-require "concurrent/map"  unless defined?(Concurrent::Map)
-require "concurrent/tvar" unless defined?(Concurrent::TVar)
+require "farce"                              unless defined?(Farce::Abstract)
+require "concurrent/map"                     unless defined?(Concurrent::Map)
+require "concurrent/tvar"                    unless defined?(Concurrent::TVar)
+require "concurrent/atomic/atomic_reference" unless defined?(Concurrent::AtomicReference)
+require "concurrent/atomic/atomic_fixnum"    unless defined?(Concurrent::AtomicFixnum)
+require "concurrent/atomic/atomic_boolean"   unless defined?(Concurrent::AtomicBoolean)
+require "concurrent/atomic/event"            unless defined?(Concurrent::Event)
+require "concurrent/atomic/count_down_latch" unless defined?(Concurrent::CountDownLatch)
 
 module Farce
   module Integrations
@@ -109,4 +114,12 @@ module Farce
   Internal::Converter.define(::Concurrent::Map, :Map) do |instance, value|
     value.each { instance[_1] = convert(_2) }
   end
+
+  Farce.on_main do
+    Subscription.define(::Concurrent::AtomicReference) { subscriber.value = it }
+    Subscription.define(::Concurrent::AtomicFixnum) { |_| subscriber.increment }
+    Subscription.define(::Concurrent::AtomicBoolean) { |_| subscriber.make_true }
+    Subscription.define(::Concurrent::Event) { |_| subscriber.set }
+    Subscription.define(::Concurrent::CountDownLatch) { |_| subscriber.count_down }
+  end
 end

data/lib/farce/integrations/sorted_set.rb

@@ -7,5 +7,6 @@ require "farce" unless defined?(Farce::Abstract)
 require "sorted_set"
 
 module Farce
+  Farce.dedup.store(::SortedSet)
   Internal::Converter.define(::SortedSet, :SortedSet)
 end