Lines Matching refs:constraint
35 * "The DeltaBlue Algorithm: An Incremental Constraint Hierarchy Solver"
41 * the constraint model is built by side-effects from constructors.
148 * (or "constraint") between a set of variables. A constraint supplies
151 * to represent a constraint.
153 function Constraint(strength) {
158 * Activate this constraint and attempt to satisfy it.
160 Constraint.prototype.addConstraint = function () {
166 * Attempt to find a way to enforce this constraint. If successful,
168 * graph. Answer the constraint that this constraint overrides, if
172 Constraint.prototype.satisfy = function (mark) {
176 alert("Could not satisfy a required constraint!");
190 Constraint.prototype.destroyConstraint = function () {
196 * Normal constraints are not input constraints. An input constraint
200 Constraint.prototype.isInput = function () {
219 UnaryConstraint.inheritsFrom(Constraint);
222 * Adds this constraint to the constraint graph
230 * Decides if this constraint can be satisfied and records that
239 * Returns true if this constraint is satisfied in the current solution.
258 * 'stay', the value for the current output of this constraint. Assume
259 * this constraint is satisfied.
268 * Records that this constraint is unsatisfied
308 * A unary input constraint used to mark a variable that the client
349 BinaryConstraint.inheritsFrom(Constraint);
379 * Add this constraint to the constraint graph
388 * Answer true if this constraint is satisfied in the current solution.
418 * constraint. Assume this constraint is satisfied.
428 * Record the fact that this constraint is unsatisfied.
465 * Adds this constraint to the constraint graph.
485 * Enforce this constraint. Assume that it is satisfied.
497 * 'stay', the value for the current output of this constraint. Assume
498 * this constraint is satisfied.
521 * Enforce this constraint. Assume that it is satisfied.
533 * structure of the constraint graph, the current dataflow graph, and
535 * constraint solver.
548 * Add the given constraint to the set of all constraints that refer
575 * Attempt to satisfy the given constraint and, if successful,
577 * the constraint is successful, it may override a weaker constraint
579 * constraint using some other method. This process is repeated
581 * determined by any constraint or b) it reaches a constraint that
586 * constraint graph has an inadvertent cycle.
596 * Entry point for retracting a constraint. Remove the given
597 * constraint and incrementally update the dataflow graph.
598 * Details: Retracting the given constraint may allow some currently
599 * unsatisfiable downstream constraint to be satisfied. We therefore collect
601 * satisfy each one in turn. This list is traversed by constraint
636 * Details: The outputs of a constraint are marked when it is added
637 * to the plan under construction. A constraint may be appended to
640 * been computed by a constraint appearing earlier in the plan), b)
643 * constraint. The last provision is for past states of history
645 * any constraint.
680 * downstream of the given constraint and recompute the actual
682 * detected, remove the given constraint and answer
685 * encountered downstream of the given constraint. The sender is
686 * assumed to have marked the inputs of the given constraint with
688 * the output constraint means that there is a path from the
689 * constraint's output to one of its inputs.
709 * downstream of the given constraint. Answer a collection of
786 * constraints is constructed with a stay constraint on one end. An
787 * edit constraint is then added to the opposite end and the time is
788 * measured for adding and removing this constraint, and extracting
789 * and executing a constraint satisfaction plan. There are two cases.
790 * In case 1, the added constraint is stronger than the stay
791 * constraint and values must propagate down the entire length of the
792 * chain. In case 2, the added constraint is weaker than the stay
793 * constraint so it cannot be accomodated. The cost in this case is,
