hsume2-state_machine 1.0.1

data/lib/state_machine/path_collection.rb

@@ -0,0 +1,90 @@
+require 'state_machine/path'
+
+module StateMachine
+  # Represents a collection of paths that are generated based on a set of
+  # requirements regarding what states to start and end on
+  class PathCollection < Array
+    include Assertions
+    
+    # The object whose state machine is being walked
+    attr_reader :object
+    
+    # The state machine these path are walking
+    attr_reader :machine
+    
+    # The initial state to start each path from
+    attr_reader :from_name
+    
+    # The target state for each path
+    attr_reader :to_name
+    
+    # Creates a new collection of paths with the given requirements.
+    # 
+    # Configuration options:
+    # * <tt>:from</tt> - The initial state to start from
+    # * <tt>:to</tt> - The target end state
+    # * <tt>:deep</tt> - Whether to enable deep searches for the target state.
+    # * <tt>:guard</tt> - Whether to guard transitions with the if/unless
+    #   conditionals defined for each one
+    def initialize(object, machine, options = {})
+      options = {:deep => false, :from => machine.states.match!(object).name}.merge(options)
+      assert_valid_keys(options, :from, :to, :deep, :guard)
+      
+      @object = object
+      @machine = machine
+      @from_name = machine.states.fetch(options[:from]).name
+      @to_name = options[:to] && machine.states.fetch(options[:to]).name
+      @guard = options[:guard]
+      @deep = options[:deep]
+      
+      initial_paths.each {|path| walk(path)}
+    end
+    
+    # Lists all of the states that can be transitioned from through the paths in
+    # this collection.
+    # 
+    # For example,
+    # 
+    #   paths.from_states # => [:parked, :idling, :first_gear, ...]
+    def from_states
+      map {|path| path.from_states}.flatten.uniq
+    end
+    
+    # Lists all of the states that can be transitioned to through the paths in
+    # this collection.
+    # 
+    # For example,
+    # 
+    #   paths.to_states # => [:idling, :first_gear, :second_gear, ...]
+    def to_states
+      map {|path| path.to_states}.flatten.uniq
+    end
+    
+    # Lists all of the events that can be fired through the paths in this
+    # collection.
+    # 
+    # For example,
+    # 
+    #   paths.events  # => [:park, :ignite, :shift_up, ...]
+    def events
+      map {|path| path.events}.flatten.uniq
+    end
+    
+    private
+      # Gets the initial set of paths to walk
+      def initial_paths
+        machine.events.transitions_for(object, :from => from_name, :guard => @guard).map do |transition|
+          path = Path.new(object, machine, :target => to_name, :guard => @guard)
+          path << transition
+          path
+        end
+      end
+      
+      # Walks down the given path.  Each new path that matches the configured
+      # requirements will be added to this collection.
+      def walk(path)
+        self << path if path.complete?
+        path.walk {|next_path| walk(next_path)} unless to_name && path.complete? && !@deep
+      end
+  end
+end

data/lib/state_machine/state.rb

@@ -0,0 +1,271 @@
+require 'state_machine/assertions'
+require 'state_machine/condition_proxy'
+
+module StateMachine
+  # A state defines a value that an attribute can be in after being transitioned
+  # 0 or more times.  States can represent a value of any type in Ruby, though
+  # the most common (and default) type is String.
+  # 
+  # In addition to defining the machine's value, a state can also define a
+  # behavioral context for an object when that object is in the state.  See
+  # StateMachine::Machine#state for more information about how state-driven
+  # behavior can be utilized.
+  class State
+    include Assertions
+    
+    # The state machine for which this state is defined
+    attr_accessor :machine
+    
+    # The unique identifier for the state used in event and callback definitions
+    attr_reader :name
+    
+    # The fully-qualified identifier for the state, scoped by the machine's
+    # namespace
+    attr_reader :qualified_name
+    
+    # The human-readable name for the state
+    attr_writer :human_name
+    
+    # The value that is written to a machine's attribute when an object
+    # transitions into this state
+    attr_writer :value
+    
+    # Whether this state's value should be cached after being evaluated
+    attr_accessor :cache
+    
+    # Whether or not this state is the initial state to use for new objects
+    attr_accessor :initial
+    alias_method :initial?, :initial
+    
+    # A custom lambda block for determining whether a given value matches this
+    # state
+    attr_accessor :matcher
+    
+    # Tracks all of the methods that have been defined for the machine's owner
+    # class when objects are in this state.
+    # 
+    # Maps :method_name => UnboundMethod
+    attr_reader :methods
+    
+    # Creates a new state within the context of the given machine.
+    # 
+    # Configuration options:
+    # * <tt>:initial</tt> - Whether this state is the beginning state for the
+    #   machine. Default is false.
+    # * <tt>:value</tt> - The value to store when an object transitions to this
+    #   state.  Default is the name (stringified).
+    # * <tt>:cache</tt> - If a dynamic value (via a lambda block) is being used,
+    #   then setting this to true will cache the evaluated result
+    # * <tt>:if</tt> - Determines whether a value matches this state
+    #   (e.g. :value => lambda {Time.now}, :if => lambda {|state| !state.nil?}).
+    #   By default, the configured value is matched.
+    # * <tt>:human_name</tt> - The human-readable version of this state's name
+    def initialize(machine, name, options = {}) #:nodoc:
+      assert_valid_keys(options, :initial, :value, :cache, :if, :human_name)
+      
+      @machine = machine
+      @name = name
+      @qualified_name = name && machine.namespace ? :"#{machine.namespace}_#{name}" : name
+      @human_name = options[:human_name] || (@name ? @name.to_s.tr('_', ' ') : 'nil')
+      @value = options.include?(:value) ? options[:value] : name && name.to_s
+      @cache = options[:cache]
+      @matcher = options[:if]
+      @methods = {}
+      @initial = options[:initial] == true
+      
+      if name
+        conflicting_machines = machine.owner_class.state_machines.select {|name, other_machine| other_machine != machine && other_machine.states[qualified_name, :qualified_name]}
+        
+        # Output a warning if another machine has a conflicting qualified name
+        # for a different attribute
+        if conflict = conflicting_machines.detect {|name, other_machine| other_machine.attribute != machine.attribute}
+          name, other_machine = conflict
+          warn "State #{qualified_name.inspect} for #{machine.name.inspect} is already defined in #{other_machine.name.inspect}"
+        elsif conflicting_machines.empty?
+          # Only bother adding predicates when another machine for the same
+          # attribute hasn't already done so
+          add_predicate
+        end
+      end
+    end
+    
+    # Creates a copy of this state in addition to the list of associated
+    # methods to prevent conflicts across different states.
+    def initialize_copy(orig) #:nodoc:
+      super
+      @methods = methods.dup
+    end
+    
+    # Determines whether there are any states that can be transitioned to from
+    # this state.  If there are none, then this state is considered *final*.
+    # Any objects in a final state will remain so forever given the current
+    # machine's definition.
+    def final?
+      !machine.events.any? do |event|
+        event.branches.any? do |branch|
+          branch.state_requirements.any? do |requirement|
+            requirement[:from].matches?(name) && !requirement[:to].matches?(name, :from => name)
+          end
+        end
+      end
+    end
+    
+    # Transforms the state name into a more human-readable format, such as
+    # "first gear" instead of "first_gear"
+    def human_name(klass = @machine.owner_class)
+      @human_name.is_a?(Proc) ? @human_name.call(self, klass) : @human_name
+    end
+    
+    # Generates a human-readable description of this state's name / value:
+    # 
+    # For example,
+    # 
+    #   State.new(machine, :parked).description                               # => "parked"
+    #   State.new(machine, :parked, :value => :parked).description            # => "parked"
+    #   State.new(machine, :parked, :value => nil).description                # => "parked (nil)"
+    #   State.new(machine, :parked, :value => 1).description                  # => "parked (1)"
+    #   State.new(machine, :parked, :value => lambda {Time.now}).description  # => "parked (*)
+    def description
+      description = name ? name.to_s : name.inspect
+      description << " (#{@value.is_a?(Proc) ? '*' : @value.inspect})" unless name.to_s == @value.to_s
+      description
+    end
+    
+    # The value that represents this state.  This will optionally evaluate the
+    # original block if it's a lambda block.  Otherwise, the static value is
+    # returned.
+    # 
+    # For example,
+    # 
+    #   State.new(machine, :parked, :value => 1).value                        # => 1
+    #   State.new(machine, :parked, :value => lambda {Time.now}).value        # => Tue Jan 01 00:00:00 UTC 2008
+    #   State.new(machine, :parked, :value => lambda {Time.now}).value(false) # => <Proc:0xb6ea7ca0@...>
+    def value(eval = true)
+      if @value.is_a?(Proc) && eval
+        if cache_value?
+          @value = @value.call
+          machine.states.update(self)
+          @value
+        else
+          @value.call
+        end
+      else
+        @value
+      end
+    end
+    
+    # Determines whether this state matches the given value.  If no matcher is
+    # configured, then this will check whether the values are equivalent.
+    # Otherwise, the matcher will determine the result.
+    # 
+    # For example,
+    # 
+    #   # Without a matcher
+    #   state = State.new(machine, :parked, :value => 1)
+    #   state.matches?(1)           # => true
+    #   state.matches?(2)           # => false
+    #   
+    #   # With a matcher
+    #   state = State.new(machine, :parked, :value => lambda {Time.now}, :if => lambda {|value| !value.nil?})
+    #   state.matches?(nil)         # => false
+    #   state.matches?(Time.now)    # => true
+    def matches?(other_value)
+      matcher ? matcher.call(other_value) : other_value == value
+    end
+    
+    # Defines a context for the state which will be enabled on instances of
+    # the owner class when the machine is in this state.
+    # 
+    # This can be called multiple times.  Each time a new context is created,
+    # a new module will be included in the owner class.
+    def context(&block)
+      owner_class = machine.owner_class
+      machine_name = machine.name
+      name = self.name
+      
+      # Evaluate the method definitions
+      context = ConditionProxy.new(owner_class, lambda {|object| object.class.state_machine(machine_name).states.matches?(object, name)})
+      context.class_eval(&block)
+      context.instance_methods.each do |method|
+        methods[method.to_sym] = context.instance_method(method)
+        
+        # Calls the method defined by the current state of the machine
+        context.class_eval <<-end_eval, __FILE__, __LINE__ + 1
+          def #{method}(*args, &block)
+            self.class.state_machine(#{machine_name.inspect}).states.match!(self).call(self, #{method.inspect}, lambda {super}, *args, &block)
+          end
+        end_eval
+      end
+      
+      # Include the context so that it can be bound to the owner class (the
+      # context is considered an ancestor, so it's allowed to be bound)
+      owner_class.class_eval { include context }
+      
+      context
+    end
+    
+    # Calls a method defined in this state's context on the given object.  All
+    # arguments and any block will be passed into the method defined.
+    # 
+    # If the method has never been defined for this state, then a NoMethodError
+    # will be raised.
+    def call(object, method, method_missing = nil, *args, &block)
+      if context_method = methods[method.to_sym]
+        # Method is defined by the state: proxy it through
+        context_method.bind(object).call(*args, &block)
+      else
+        # Dispatch to the superclass since this state doesn't handle the method
+        method_missing.call if method_missing
+      end
+    end
+    
+    # Draws a representation of this state on the given machine.  This will
+    # create a new node on the graph with the following properties:
+    # * +label+ - The human-friendly description of the state.
+    # * +width+ - The width of the node.  Always 1.
+    # * +height+ - The height of the node.  Always 1.
+    # * +shape+ - The actual shape of the node.  If the state is a final
+    #   state, then "doublecircle", otherwise "ellipse".
+    # 
+    # The actual node generated on the graph will be returned.
+    def draw(graph)
+      node = graph.add_node(name ? name.to_s : 'nil',
+        :label => description,
+        :width => '1',
+        :height => '1',
+        :shape => final? ? 'doublecircle' : 'ellipse'
+      )
+      
+      # Add open arrow for initial state
+      graph.add_edge(graph.add_node('starting_state', :shape => 'point'), node) if initial?
+      
+      node
+    end
+    
+    # Generates a nicely formatted description of this state's contents.
+    # 
+    # For example,
+    # 
+    #   state = StateMachine::State.new(machine, :parked, :value => 1, :initial => true)
+    #   state   # => #<StateMachine::State name=:parked value=1 initial=true context=[]>
+    def inspect
+      attributes = [[:name, name], [:value, @value], [:initial, initial?], [:context, methods.keys]]
+      "#<#{self.class} #{attributes.map {|attr, value| "#{attr}=#{value.inspect}"} * ' '}>"
+    end
+    
+    private
+      # Should the value be cached after it's evaluated for the first time?
+      def cache_value?
+        @cache
+      end
+      
+      # Adds a predicate method to the owner class so long as a name has
+      # actually been configured for the state
+      def add_predicate
+        # Checks whether the current value matches this state
+        machine.define_helper(:instance, "#{qualified_name}?") do |machine, object|
+          machine.states.matches?(object, name)
+        end
+      end
+  end
+end

data/lib/state_machine/state_collection.rb

@@ -0,0 +1,112 @@
+require 'state_machine/node_collection'
+
+module StateMachine
+  # Represents a collection of states in a state machine
+  class StateCollection < NodeCollection
+    def initialize(machine) #:nodoc:
+      super(machine, :index => [:name, :qualified_name, :value])
+    end
+    
+    # Determines whether the given object is in a specific state.  If the
+    # object's current value doesn't match the state, then this will return
+    # false, otherwise true.  If the given state is unknown, then an IndexError
+    # will be raised.
+    # 
+    # == Examples
+    # 
+    #   class Vehicle
+    #     state_machine :initial => :parked do
+    #       other_states :idling
+    #     end
+    #   end
+    #   
+    #   states = Vehicle.state_machine.states
+    #   vehicle = Vehicle.new               # => #<Vehicle:0xb7c464b0 @state="parked">
+    #   
+    #   states.matches?(vehicle, :parked)   # => true
+    #   states.matches?(vehicle, :idling)   # => false
+    #   states.matches?(vehicle, :invalid)  # => IndexError: :invalid is an invalid key for :name index
+    def matches?(object, name)
+      fetch(name).matches?(machine.read(object, :state))
+    end
+    
+    # Determines the current state of the given object as configured by this
+    # state machine.  This will attempt to find a known state that matches
+    # the value of the attribute on the object.
+    # 
+    # == Examples
+    # 
+    #   class Vehicle
+    #     state_machine :initial => :parked do
+    #       other_states :idling
+    #     end
+    #   end
+    #   
+    #   states = Vehicle.state_machine.states
+    #   
+    #   vehicle = Vehicle.new         # => #<Vehicle:0xb7c464b0 @state="parked">
+    #   states.match(vehicle)         # => #<StateMachine::State name=:parked value="parked" initial=true>
+    #   
+    #   vehicle.state = 'idling'
+    #   states.match(vehicle)         # => #<StateMachine::State name=:idling value="idling" initial=true>
+    #   
+    #   vehicle.state = 'invalid'
+    #   states.match(vehicle)         # => nil
+    def match(object)
+      value = machine.read(object, :state)
+      self[value, :value] || detect {|state| state.matches?(value)}
+    end
+    
+    # Determines the current state of the given object as configured by this
+    # state machine.  If no state is found, then an ArgumentError will be
+    # raised.
+    # 
+    # == Examples
+    # 
+    #   class Vehicle
+    #     state_machine :initial => :parked do
+    #       other_states :idling
+    #     end
+    #   end
+    #   
+    #   states = Vehicle.state_machine.states
+    #   
+    #   vehicle = Vehicle.new         # => #<Vehicle:0xb7c464b0 @state="parked">
+    #   states.match!(vehicle)        # => #<StateMachine::State name=:parked value="parked" initial=true>
+    #   
+    #   vehicle.state = 'invalid'
+    #   states.match!(vehicle)        # => ArgumentError: "invalid" is not a known state value
+    def match!(object)
+      match(object) || raise(ArgumentError, "#{machine.read(object, :state).inspect} is not a known #{machine.name} value")
+    end
+    
+    # Gets the order in which states should be displayed based on where they
+    # were first referenced.  This will order states in the following priority:
+    # 
+    # 1. Initial state
+    # 2. Event transitions (:from, :except_from, :to, :except_to options)
+    # 3. States with behaviors
+    # 4. States referenced via +state+ or +other_states+
+    # 5. States referenced in callbacks
+    # 
+    # This order will determine how the GraphViz visualizations are rendered.
+    def by_priority
+      order = select {|state| state.initial}.map {|state| state.name}
+      
+      machine.events.each {|event| order += event.known_states}
+      order += select {|state| state.methods.any?}.map {|state| state.name}
+      order += keys(:name) - machine.callbacks.values.flatten.map {|callback| callback.known_states}.flatten
+      order += keys(:name)
+      
+      order.uniq!
+      order.map! {|name| self[name]}
+      order
+    end
+    
+    private
+      # Gets the value for the given attribute on the node
+      def value(node, attribute)
+        attribute == :value ? node.value(false) : super
+      end
+  end
+end