Lines Matching full:mark
166 Constraint.prototype.satisfy = function (mark) {
167 this.chooseMethod(mark);
173 this.markInputs(mark);
178 if (!planner.addPropagate(this, mark))
180 out.mark = mark;
227 UnaryConstraint.prototype.chooseMethod = function (mark) {
228 this.satisfied = (this.myOutput.mark != mark)
239 UnaryConstraint.prototype.markInputs = function (mark) {
302 * A unary input constraint used to mark a variable that the client
350 BinaryConstraint.prototype.chooseMethod = function (mark) {
351 if (this.v1.mark == mark) {
352 this.direction = (this.v1.mark != mark && Strength.stronger(this.strength, this.v2.walkStrength))
356 if (this.v2.mark == mark) {
357 this.direction = (this.v1.mark != mark && Strength.stronger(this.strength, this.v1.walkStrength))
389 * Mark the input variable with the given mark.
391 BinaryConstraint.prototype.markInputs = function (mark) {
392 this.input().mark = mark;
428 BinaryConstraint.prototype.inputsKnown = function (mark) {
430 return i.mark == mark || i.stay || i.determinedBy == null;
473 ScaleConstraint.prototype.markInputs = function (mark) {
474 ScaleConstraint.superConstructor.prototype.markInputs.call(this, mark);
475 this.scale.mark = this.offset.mark = mark;
535 this.mark = 0;
578 * a unique mark value so that we know where we've been. This allows
583 var mark = this.newMark();
584 var overridden = c.satisfy(mark);
586 overridden = overridden.satisfy(mark);
617 * Select a previously unused mark value.
643 var mark = this.newMark();
648 if (c.output().mark != mark && c.inputsKnown(mark)) {
650 c.output().mark = mark;
681 * the given mark. Thus, encountering a marked node downstream of
685 Planner.prototype.addPropagate = function (c, mark) {
690 if (d.output().mark == mark) {
