Lines Matching defs:Constraint
26 * A JavaScript implementation of the DeltaBlue constraint-solving
29 * "The DeltaBlue Algorithm: An Incremental Constraint Hierarchy Solver"
35 * the constraint model is built by side-effects from constructors.
142 * (or "constraint") between a set of variables. A constraint supplies
145 * to represent a constraint.
147 function Constraint(strength) {
152 * Activate this constraint and attempt to satisfy it.
154 Constraint.prototype.addConstraint = function () {
160 * Attempt to find a way to enforce this constraint. If successful,
162 * graph. Answer the constraint that this constraint overrides, if
166 Constraint.prototype.satisfy = function (mark) {
170 alert("Could not satisfy a required constraint!");
184 Constraint.prototype.destroyConstraint = function () {
190 * Normal constraints are not input constraints. An input constraint
194 Constraint.prototype.isInput = function () {
213 UnaryConstraint.inheritsFrom(Constraint);
216 * Adds this constraint to the constraint graph
224 * Decides if this constraint can be satisfied and records that
233 * Returns true if this constraint is satisfied in the current solution.
252 * 'stay', the value for the current output of this constraint. Assume
253 * this constraint is satisfied.
262 * Records that this constraint is unsatisfied
302 * A unary input constraint used to mark a variable that the client
343 BinaryConstraint.inheritsFrom(Constraint);
346 * Decides if this constraint can be satisfied and which way it
373 * Add this constraint to the constraint graph
382 * Answer true if this constraint is satisfied in the current solution.
412 * constraint. Assume this constraint is satisfied.
422 * Record the fact that this constraint is unsatisfied.
459 * Adds this constraint to the constraint graph.
479 * Enforce this constraint. Assume that it is satisfied.
491 * 'stay', the value for the current output of this constraint. Assume
492 * this constraint is satisfied.
515 * Enforce this constraint. Assume that it is satisfied.
527 * structure of the constraint graph, the current dataflow graph, and
529 * constraint solver.
542 * Add the given constraint to the set of all constraints that refer
569 * Attempt to satisfy the given constraint and, if successful,
571 * the constraint is successful, it may override a weaker constraint
573 * constraint using some other method. This process is repeated
575 * determined by any constraint or b) it reaches a constraint that
580 constraint graph has an inadvertent cycle.
590 * Entry point for retracting a constraint. Remove the given
591 * constraint and incrementally update the dataflow graph.
592 * Details: Retracting the given constraint may allow some currently
593 * unsatisfiable downstream constraint to be satisfied. We therefore collect
595 * satisfy each one in turn. This list is traversed by constraint
630 * Details: The outputs of a constraint are marked when it is added
631 * to the plan under construction. A constraint may be appended to
634 * been computed by a constraint appearing earlier in the plan), b)
637 * constraint. The last provision is for past states of history
639 * any constraint.
674 * downstream of the given constraint and recompute the actual
676 * detected, remove the given constraint and answer
679 * encountered downstream of the given constraint. The sender is
680 * assumed to have marked the inputs of the given constraint with
682 * the output constraint means that there is a path from the
683 * constraint's output to one of its inputs.
703 * downstream of the given constraint. Answer a collection of
780 * constraints is constructed with a stay constraint on one end. An
781 * edit constraint is then added to the opposite end and the time is
782 * measured for adding and removing this constraint, and extracting
783 * and executing a constraint satisfaction plan. There are two cases.
784 * In case 1, the added constraint is stronger than the stay
785 * constraint and values must propagate down the entire length of the
786 * chain. In case 2, the added constraint is weaker than the stay
787 * constraint so it cannot be accomodated. The cost in this case is,
