abstract class Constraint extends DLNode[Constraint] with Weighted with Identified with PTag with LazyLogging with AdviseCounts

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Constraint
  2. AdviseCounts
  3. Advisable
  4. LazyLogging
  5. PTag
  6. Identified
  7. Weighted
  8. DLNode
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Constraint(scope: Variable*)
  2. new Constraint(scope: Array[Variable])

Abstract Value Members

  1. abstract def advise(problemState: ProblemState, event: Event, pos: Int): Int
    Attributes
    protected
  2. abstract def check(tuple: Array[Int]): Boolean

    returns

    true iff the constraint is satisfied by the given tuple

  3. abstract def init(ps: ProblemState): Outcome
  4. abstract def revise(problemState: ProblemState, modified: BitVector): Outcome
  5. abstract def simpleEvaluation: Int

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def adviseCount: Int
    Definition Classes
    AdviseCounts
  5. def append(n: Constraint): Unit
    Definition Classes
    DLNode
  6. def arity: Int

    arity is the number of variables involved by the constraint

  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. final def cardSize(problemState: ProblemState, p: Int = arity - 1, size: Int = 1): Int
    Annotations
    @tailrec()
  9. def clear(): Unit
    Definition Classes
    DLNode
  10. def clearMod(): BitVector
  11. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  12. def consistent(problemState: ProblemState, modified: Traversable[Int]): Outcome
  13. final def consistent(ps: ProblemState): Outcome
  14. def controlAssignment(problemState: ProblemState): Boolean
  15. def controlRevision(ps: ProblemState): Boolean
  16. final def controlTuplePresence(problemState: ProblemState, tuple: Array[Int], mod: List[Int]): Boolean
    Annotations
    @tailrec()
  17. final def controlTuplePresence(problemState: ProblemState, tuple: Array[Int], i: Int = arity - 1): Boolean
    Annotations
    @tailrec()
  18. val currentList: Int
    Definition Classes
    DLNode
  19. def dataSize: Int
  20. def diff(ps1: ProblemState, ps2: ProblemState): Seq[(Variable, (Domain, Domain))]
  21. final def doubleCardSize(problemState: ProblemState): Double
  22. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  23. def equals(o: Any): Boolean
    Definition Classes
    Constraint → AnyRef → Any
  24. def event(problemState: ProblemState, event: Event, pos: Int, alwaysMod: Boolean = false): Int
  25. final def eventAll(problemState: ProblemState, event: Event = Assignment, alwaysMod: Boolean = false): Int
  26. def eventArray(problemState: ProblemState, event: Event, positions: Array[Int]): Int

    Same event for all positions Mostly used when a variable is several times in the scope

  27. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  28. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  29. def hashCode(): Int
    Definition Classes
    Constraint → AnyRef → Any
  30. def id: Int

    returns

    the unique, integer identifier of the object.

    Definition Classes
    Constraint → Identified
  31. def identify(i: Int): Int
  32. def incrementWeight(): Unit
    Definition Classes
    Constraint → Weighted
  33. def intervalsOnly(problemState: ProblemState): Boolean
  34. def isEmpty: Boolean
    Definition Classes
    DLNode
  35. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  36. def iterator: Iterator[Constraint]
    Definition Classes
    DLNode
  37. lazy val logger: Logger
    Attributes
    protected
    Definition Classes
    LazyLogging
  38. def modVars(modified: BitVector): Traversable[Variable]
    Attributes
    protected
  39. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  40. val next: DLNode[Constraint]
    Definition Classes
    DLNode
  41. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  42. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  43. val position: Map[Variable, Array[Int]]

    returns

    a map containing the positions of variables in the scope of the constraint.

  44. val positionInVariable: Array[Int]
  45. val present: Int
    Definition Classes
    PTag
  46. val prev: DLNode[Constraint]
    Definition Classes
    DLNode
  47. def register(ac: AdviseCount): Constraint.this.type
    Definition Classes
    Constraint → AdviseCounts → Advisable
  48. def remove(): Unit
    Definition Classes
    DLNode
  49. final def revise(problemState: ProblemState): Outcome
  50. val scope: Array[Variable]
  51. final def scopeSize(problemState: ProblemState): Int
  52. def singleFree(ps: ProblemState): Option[Int]
  53. def skip(modified: BitVector): Int
  54. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  55. def toString(): String
    Definition Classes
    Constraint → AnyRef → Any
  56. def toString(problemState: ProblemState): String
  57. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  58. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  59. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  60. val weight: Int
    Definition Classes
    Weighted

Inherited from AdviseCounts

Inherited from Advisable

Inherited from LazyLogging

Inherited from PTag

Inherited from Identified

Inherited from Weighted

Inherited from DLNode[Constraint]

Inherited from AnyRef

Inherited from Any

Ungrouped