Lines Matching refs:constraints
96 * Strengths are used to measure the relative importance of constraints.
98 * disrupting current constraints. Strengths cannot be created outside
196 * Normal constraints are not input constraints. An input constraint
209 * Abstract superclass for constraints having a single possible output
300 // Stay constraints do nothing
325 // Edit constraints do nothing
338 * Abstract superclass for constraints having two possible output
539 this.constraints = new OrderedCollection();
548 * Add the given constraint to the set of all constraints that refer
552 this.constraints.add(c);
559 this.constraints.remove(c);
583 * variables of constraints that have been processed are marked with
600 * a list of unsatisfied downstream constraints and attempt to
603 * unnecessarily adding and then overriding weak constraints.
631 * constraints, usually a set of input constraints. This method
633 * only constraints whose output variables are not stay. Constraints
634 * that do no computation, such as stay and edit constraints, are
665 * given constraints, usually a set of input constraints.
667 Planner.prototype.extractPlanFromConstraints = function (constraints) {
669 for (var i = 0; i < constraints.size(); i++) {
670 var c = constraints.at(i);
710 * unsatisfied constraints sorted in order of decreasing strength.
721 for (var i = 0; i < v.constraints.size(); i++) {
722 var c = v.constraints.at(i);
727 for (var i = 0; i < v.constraints.size(); i++) {
728 var next = v.constraints.at(i);
740 var cc = v.constraints;
753 * A Plan is an ordered list of constraints to be executed in sequence
754 * to resatisfy all currently satisfiable constraints in the face of
786 * constraints is constructed with a stay constraint on one end. An
801 // Build chain of n equality constraints
