gecoder-with-gecode 0.7.1-mswin32

data/lib/gecoder/interface/constraints/set_enum/operation.rb

@@ -0,0 +1,60 @@
+module Gecode::SetEnumMethods
+  Gecode::Constraints::Util::SET_OPERATION_TYPES.each_pair do |name, type|
+    next if type == Gecode::Raw::SOT_MINUS # Does not support this constraint?
+    
+    module_eval <<-"end_code"
+      # Starts a constraint on the #{name} of the sets.
+      def #{name}
+        params = {:lhs => self, :operation => #{type}}
+        Gecode::Constraints::SetEnum::Operation::ExpressionStub.new(
+          @model, params)
+      end
+    end_code
+  end
+end
+
+# A module that gathers the classes and modules used by operation constaints.
+module Gecode::Constraints::SetEnum::Operation #:nodoc:
+  # Describes a CompositeStub for the enumeration operation constraint, which 
+  # constrains the result of applying an operation between all set variables in 
+  # a set enumeration. 
+  # 
+  # The supported operations are:
+  # * union
+  # * disjoint_union
+  # * intersection
+  # * minus
+  # 
+  # == Example
+  # 
+  #   # The union of all set variables in +sets+ must be subset of 1..17.
+  #   sets.union.must_be.subset_of 1..17
+  #   
+  #   # The intersection of all set variables must equal [1,3,5].
+  #   sets.intersection.must == [1,3,5]
+  #   
+  #   # The union of all set variable must be a subset of the set variable
+  #   # +universe+.
+  #   sets.union.must_be.subset_of universe
+  #   
+  #   # The same as above, but reified with the boolean variable 
+  #   # +is_within_universe+. 
+  #   sets.union.must_be.subset_of(universe, :reify => is_within_universe)
+  class ExpressionStub < Gecode::Constraints::Set::CompositeStub
+    def constrain_equal(variable, params, constrain)
+      enum, operation = @params.values_at(:lhs, :operation)
+    
+      if constrain
+        if operation == Gecode::Raw::SOT_INTER or 
+            operation == Gecode::Raw::SOT_MINUS
+          variable.must_be.subset_of enum.first.upper_bound
+        else
+          variable.must_be.subset_of enum.upper_bound_range
+        end
+      end
+      
+      Gecode::Raw::rel(@model.active_space, operation, enum.to_set_var_array,
+        variable.bind)
+    end
+  end
+end

data/lib/gecoder/interface/constraints/set_enum/selection.rb

@@ -0,0 +1,217 @@
+module Gecode::SetEnumMethods
+  # This adds the adder for the methods in the modules including it. The 
+  # reason for doing it so indirect is that the first #[] won't be defined 
+  # before the module that this is mixed into is mixed into an enum.
+  def self.included(mod) #:nodoc:
+    mod.module_eval do
+      # Now we enter the module that the module possibly defining #[] 
+      # is mixed into.
+      if instance_methods.include?('[]') and 
+          not instance_methods.include?('pre_selection_access')
+        alias_method :pre_selection_access, :[]
+      end
+    
+      def [](*vars)
+        # Hook in an element constraint if a variable is used for array 
+        # access.
+        if vars.first.kind_of? Gecode::FreeIntVar
+          params = {:lhs => self, :index => vars.first}
+          Gecode::Constraints::SetEnum::Selection::SelectExpressionStub.new(
+            @model, params)
+        elsif vars.first.kind_of? Gecode::FreeSetVar
+          params = {:lhs => self, :indices => vars.first}
+          Gecode::Constraints::SetEnum::Selection::SetAccessStub.new(
+            @model, params)
+        else
+          pre_selection_access(*vars) if respond_to? :pre_selection_access
+        end
+      end
+    end
+  end
+end
+
+# A module that gathers the classes and modules used by selection constraints.
+module Gecode::Constraints::SetEnum::Selection #:nodoc:
+  # Describes an expression stub started with a set var enum followed with an
+  # array access using a set variable.
+  class SetAccessStub < Gecode::Constraints::ExpressionStub #:nodoc:
+    include Gecode::Constraints::LeftHandSideMethods
+    
+    # Starts a union selection constraint on the selected sets.
+    def union
+      UnionExpressionStub.new(@model, @params)
+    end
+    
+    # Starts a intersection selection constraint on the selected sets. The 
+    # option :with may optionally be specified, in which case the value should
+    # be an enumeration of the elements in the universe.
+    def intersection(options = {})
+      unless options.empty? 
+        unless options.size == 1 and options.has_key?(:with)
+          raise ArgumentError, "Expected option key :with, got #{options.keys}."
+        else
+          universe = options[:with]
+          unless universe.kind_of?(Enumerable) and 
+              universe.all?{ |element| element.kind_of? Fixnum }
+            raise TypeError, "Expected the universe to be specified as " + 
+              "an enumeration of fixnum, got #{universe.class}."
+          end
+          @params.update(:universe => universe)
+        end
+      end
+      
+      IntersectionExpressionStub.new(@model, @params)
+    end
+    
+    private
+    
+    # Produces an expression with position for the lhs module.
+    def expression(params)
+      SetAccessExpression.new(@model, @params.update(params))
+    end
+  end
+  
+  # Describes an expression that starts with an set variable enum followed with
+  # an array access using a set variable followed by some form of must.
+  class SetAccessExpression < Gecode::Constraints::Set::Expression #:nodoc:
+    # Constrains the selected sets to be disjoint.
+    def disjoint
+      if @params[:negate]
+        raise Gecode::MissingConstraintError, 'A negated set selection ' + 
+          'disjoint is not implemented.'
+      end
+      
+      @model.add_constraint DisjointConstraint.new(@model, @params)
+    end
+  end
+
+  # Describes a CompositeStub for the set select constraint, which constrains 
+  # the set in a position specified by an integer variable in an enumeration of 
+  # set variable.
+  # 
+  # == Examples
+  # 
+  #   # The set at the position described by the integer variable 
+  #   # +singleton_zero_position+ in the enumeration +sets+ of set variables 
+  #   # must equal [0].
+  #   sets[singleton_zero_position].must == 0
+  #   
+  #   # The set at the position described by the integer variable +position+ in 
+  #   # the enumeration +sets+ of set variables must be a subset of +set+.
+  #   sets[position].must_be.subset_of set
+  #   
+  #   # The same as above, but reified with the boolean variable +bool+.
+  #   sets[position].must_be.subset_of(set, :reify => bool)
+  class SelectExpressionStub < Gecode::Constraints::Set::CompositeStub
+    def constrain_equal(variable, params, constrain)
+      enum, index = @params.values_at(:lhs, :index)
+      if constrain
+        variable.must_be.subset_of enum.upper_bound_range
+      end
+
+      Gecode::Raw::selectSet(@model.active_space, enum.to_set_var_array, 
+        index.bind, variable.bind)
+    end
+  end
+  
+  # Describes a CompositeStub for the set union selection constraint, 
+  # which constrains the union of sets located at the positions 
+  # specified by a set variable in an enumeration of set variables.
+  # 
+  # == Examples
+  # 
+  #   # The sets in the enumeration set variable +sets+ located at the positions
+  #   # described by the set variable +selected_sets+ must have a union that's
+  #   # a superset of [0,4,17]. 
+  #   sets[selected_sets].union.must_be.superset_of [0,4,17]
+  #   
+  #   # The sets in the enumeration set variable +sets+ located at the positions
+  #   # described by the set variable +selected_sets+ must have a union that's
+  #   # disjoint with the set variable +set+.
+  #   sets[selected_sets].union.must_be.disjoint_with set
+  #   
+  #   # The same as above but reified with the boolean variable 
+  #   # +union_is_disjoint+.
+  #   sets[selected_sets].union.must_be.disjoint_with(set, 
+  #     :reify => union_is_disjoin)
+  class UnionExpressionStub < Gecode::Constraints::Set::CompositeStub
+    def constrain_equal(variable, params, constrain)
+      enum, indices = @params.values_at(:lhs, :indices)
+      if constrain
+        variable.must_be.subset_of enum.upper_bound_range
+      end
+      
+      Gecode::Raw::selectUnion(@model.active_space, enum.to_set_var_array,
+        indices.bind, variable.bind)
+    end
+  end
+  
+  # Describes a CompositeStub for the set intersection selection constraint, 
+  # which constrains the intersection of sets located at the positions 
+  # specified by a set variable in an enumeration of set variables.
+  # 
+  # Optionally a universe may also be specified.
+  # 
+  # == Examples
+  # 
+  #   # The sets in the enumeration set variable +sets+ located at the positions
+  #   # described by the set variable +selected_sets+ must have an intersection 
+  #   # that's a superset of [0,4,17]. 
+  #   sets[selected_sets].intersection.must_be.superset_of [0,4,17]
+  #   
+  #   # The sets in the enumeration set variable +sets+ located at the positions
+  #   # described by the set variable +selected_sets+ must have an intersection
+  #   # that's disjoint with the set variable +set+.
+  #   sets[selected_sets].intersection.must_be.disjoint_with set
+  #   
+  #   # The sets in the enumeration set variable +sets+ located at the positions
+  #   # described by the set variable +selected_sets+ must have an intersection
+  #   # that's disjoint with the set variable +set+ inside the universe 0..17.
+  #   sets[selected_sets].intersection(:with => 0..17).must_be.disjoint_with set
+  #   
+  #   # The sets in the enumeration set variable +sets+ located at the positions
+  #   # described by the set variable +selected_sets+ must have an intersection
+  #   # that's disjoint with the set variable +set+ inside the universe 
+  #   # described by the set variable +universe+.
+  #   sets[selected_sets].intersection(:with => universe).must_be.disjoint_with set
+  #   
+  #   
+  #   # The same as above but reified with the boolean variable 
+  #   # +intersection_is_disjoint+.
+  #   sets[selected_sets].intersection(:with => universe).must_be.disjoint_with(
+  #     set, :reifty => intersection_is_disjoin)
+  class IntersectionExpressionStub < Gecode::Constraints::Set::CompositeStub
+    def constrain_equal(variable, params, constrain)
+      enum, indices, universe = @params.values_at(:lhs, :indices, :universe)
+      # We can't do any useful constraining here since the empty intersection
+      # is the universe.
+      
+      if universe.nil?
+        Gecode::Raw::selectInter(@model.active_space, enum.to_set_var_array,
+          indices.bind, variable.bind)
+      else
+        Gecode::Raw::selectInterIn(@model.active_space, enum.to_set_var_array,
+          indices.bind, variable.bind, 
+          Gecode::Constraints::Util.constant_set_to_int_set(universe))
+      end
+    end
+  end
+  
+  # Describes a disjoint constraint, which constrains all set variable is an
+  # enumeration, at the position specified by a set variable, to be disjoint.
+  # 
+  # Does not support negation nor reification.
+  # 
+  # == Examples
+  # 
+  #   # The set variable located in the enumeration +sets+ at positions 
+  #   # described by +disjoint_set_positions+ must be disjoint.
+  #   sets[disjoint_set_positions].must_be.disjoint 
+  class DisjointConstraint < Gecode::Constraints::Constraint
+    def post
+      enum, indices = @params.values_at(:lhs, :indices)
+      Gecode::Raw.selectDisjoint(@model.active_space, enum.to_set_var_array,
+        indices.bind)
+    end
+  end
+end

data/lib/gecoder/interface/constraints/set_enum_constraints.rb

@@ -0,0 +1,34 @@
+module Gecode
+  module SetEnumMethods
+    include Gecode::Constraints::LeftHandSideMethods
+    
+    private
+    
+    # Produces an expression for the lhs module.
+    def expression(params)
+      params.update(:lhs => self)
+      Constraints::SetEnum::Expression.new(@model, params)
+    end
+  end
+  
+  # A module containing constraints that have enumerations of set variables as 
+  # left hand side.
+  module Constraints::SetEnum
+    # Expressions with set enums as left hand sides.
+    class Expression < Gecode::Constraints::Expression
+      # Raises TypeError unless the left hand side is a set enum.
+      def initialize(model, params)
+        super
+        
+        unless params[:lhs].respond_to? :to_set_var_array
+          raise TypeError, 'Must have set enum as left hand side.'
+        end
+      end
+    end
+  end
+end
+
+require 'gecoder/interface/constraints/set_enum/channel'
+require 'gecoder/interface/constraints/set_enum/distinct'
+require 'gecoder/interface/constraints/set_enum/selection'
+require 'gecoder/interface/constraints/set_enum/operation'

data/lib/gecoder/interface/constraints/set_var_constraints.rb

@@ -0,0 +1,72 @@
+module Gecode
+  class FreeSetVar
+    include Gecode::Constraints::LeftHandSideMethods
+    
+    private
+    
+    # Produces an expression for the lhs module.
+    def expression(params)
+      params.update(:lhs => self)
+      Constraints::Set::Expression.new(@model, params)
+    end
+  end
+  
+  # A module containing constraints that have set variables as left hand side
+  # (but not enumerations).
+  module Constraints::Set
+    # An expression with a set as left hand side.
+    class Expression < Gecode::Constraints::Expression #:nodoc:
+    end
+    
+    # Utility methods for sets.
+    module Util #:nodoc:
+      module_function
+      def decode_options(options)
+        if options.has_key? :strength
+          raise ArgumentError, 'Set constraints do not support the strength ' +
+            'option.'
+        end
+        Gecode::Constraints::Util.decode_options(options)
+      end
+    end
+    
+    # A composite expression which is an set expression with a left hand side 
+    # resulting from a previous constraint.
+    class CompositeExpression < Gecode::Constraints::CompositeExpression #:nodoc:
+      # The block given should take three parameters. The first is the variable 
+      # that should be the left hand side, if it's nil then a new one should be
+      # created. The second is the has of parameters. The block should return 
+      # the variable used as left hand side.
+      def initialize(model, params, &block)
+        super(Expression, Gecode::FreeSetVar, lambda{ model.set_var }, model,
+          params, &block)
+      end
+    end
+    
+    # Describes a stub that produces a set variable, which can then be used with 
+    # the normal set variable constraints. An example of a set composite 
+    # constraints would be set selection constraint.
+    #
+    #   sets[int_var].must_be.subset_of(another_set)
+    # 
+    # <tt>sets[int_var]</tt> produces a set variable which the constraint 
+    # <tt>.must_be.subset_of(another_set)</tt> is then applied to.In the above 
+    # case two constraints (and one temporary variable) are required, but in the 
+    # case of equality only one constraint is required.
+    # 
+    # Whether a constraint involving a reification stub supports negation and 
+    # reification depends on the constraint on the right hand side (none 
+    # support the strength option as no set constraints do).
+    class CompositeStub < Gecode::Constraints::CompositeStub
+      def initialize(model, params)
+        super(CompositeExpression, model, params)
+      end
+    end
+  end
+end
+
+require 'gecoder/interface/constraints/set/domain'
+require 'gecoder/interface/constraints/set/relation'
+require 'gecoder/interface/constraints/set/cardinality'
+require 'gecoder/interface/constraints/set/connection'
+require 'gecoder/interface/constraints/set/operation'

data/lib/gecoder/interface/enum_matrix.rb

@@ -0,0 +1,64 @@
+require 'matrix'
+
+module Gecode::Util
+  # Methods that make a matrix an enumerable.
+  module MatrixEnumMethods
+    include Enumerable
+  
+    # Iterates over every element in the matrix.
+    def each(&block)
+      row_size.times do |i|
+        column_size.times do |j|
+          yield self[i,j]
+        end
+      end
+    end
+  end
+
+  # Extends Matrix so that it's an enumerable.
+  class EnumMatrix < Matrix
+    include MatrixEnumMethods
+    
+    def row(i)
+      wrap_if_wrapped make_vector_enumerable(super)
+    end
+    
+    def column(i)
+      wrap_if_wrapped make_vector_enumerable(super)
+    end
+    
+    def minor(*args)
+      matrix = super
+      class <<matrix
+        include MatrixEnumMethods
+      end
+      return wrap_if_wrapped(matrix)
+    end
+    
+    private
+    
+    # Makes the specified vector enumerable.
+    def make_vector_enumerable(vector)
+      class <<vector
+        include Enumerable
+  
+        # Iterates over every element in the matrix.
+        def each(&block)
+          size.times do |i|
+            yield self[i]
+          end
+        end
+      end
+      return vector
+    end
+    
+    # Wraps the specified enumerable if the matrix itself is already wrapped.
+    def wrap_if_wrapped(enum)
+      if respond_to? :model
+        model.wrap_enum(enum)
+      else
+        enum
+      end
+    end
+  end
+end