Lines Matching full:mark
175 Constraint.prototype.satisfy = function (mark) {
176 this.chooseMethod(mark);
182 this.markInputs(mark);
187 if (!planner.addPropagate(this, mark))
189 out.mark = mark;
236 UnaryConstraint.prototype.chooseMethod = function (mark) {
237 this.satisfied = (this.myOutput.mark != mark)
248 UnaryConstraint.prototype.markInputs = function (mark) {
311 * A unary input constraint used to mark a variable that the client
359 BinaryConstraint.prototype.chooseMethod = function (mark) {
360 if (this.v1.mark == mark) {
361 this.direction = (this.v2.mark != mark && Strength.stronger(this.strength, this.v2.walkStrength))
365 if (this.v2.mark == mark) {
366 this.direction = (this.v1.mark != mark && Strength.stronger(this.strength, this.v1.walkStrength))
398 * Mark the input variable with the given mark.
400 BinaryConstraint.prototype.markInputs = function (mark) {
401 this.input().mark = mark;
437 BinaryConstraint.prototype.inputsKnown = function (mark) {
439 return i.mark == mark || i.stay || i.determinedBy == null;
482 ScaleConstraint.prototype.markInputs = function (mark) {
483 ScaleConstraint.superConstructor.prototype.markInputs.call(this, mark);
484 this.scale.mark = this.offset.mark = mark;
544 this.mark = 0;
587 * a unique mark value so that we know where we've been. This allows
592 var mark = this.newMark();
593 var overridden = c.satisfy(mark);
595 overridden = overridden.satisfy(mark);
626 * Select a previously unused mark value.
652 var mark = this.newMark();
657 if (c.output().mark != mark && c.inputsKnown(mark)) {
659 c.output().mark = mark;
690 * the given mark. Thus, encountering a marked node downstream of
694 Planner.prototype.addPropagate = function (c, mark) {
699 if (d.output().mark == mark) {
