Lines Matching full:mark
172 Constraint.prototype.satisfy = function (mark) {
173 this.chooseMethod(mark);
179 this.markInputs(mark);
184 if (!planner.addPropagate(this, mark))
186 out.mark = mark;
233 UnaryConstraint.prototype.chooseMethod = function (mark) {
234 this.satisfied = (this.myOutput.mark != mark)
245 UnaryConstraint.prototype.markInputs = function (mark) {
308 * A unary input constraint used to mark a variable that the client
356 BinaryConstraint.prototype.chooseMethod = function (mark) {
357 if (this.v1.mark == mark) {
358 this.direction = (this.v2.mark != mark && Strength.stronger(this.strength, this.v2.walkStrength))
362 if (this.v2.mark == mark) {
363 this.direction = (this.v1.mark != mark && Strength.stronger(this.strength, this.v1.walkStrength))
395 * Mark the input variable with the given mark.
397 BinaryConstraint.prototype.markInputs = function (mark) {
398 this.input().mark = mark;
434 BinaryConstraint.prototype.inputsKnown = function (mark) {
436 return i.mark == mark || i.stay || i.determinedBy == null;
479 ScaleConstraint.prototype.markInputs = function (mark) {
480 ScaleConstraint.superConstructor.prototype.markInputs.call(this, mark);
481 this.scale.mark = this.offset.mark = mark;
541 this.mark = 0;
584 * a unique mark
589 var mark = this.newMark();
590 var overridden = c.satisfy(mark);
592 overridden = overridden.satisfy(mark);
623 * Select a previously unused mark value.
649 var mark = this.newMark();
654 if (c.output().mark != mark && c.inputsKnown(mark)) {
656 c.output().mark = mark;
687 * the given mark. Thus, encountering a marked node downstream of
691 Planner.prototype.addPropagate = function (c, mark) {
696 if (d.output().mark == mark) {
