Lines Matching refs:if
15 // along with this program; if not, write to the Free Software
80 if (value != elm) {
166 * Attempt to find a way to enforce this constraint. If successful,
168 * graph. Answer the constraint that this constraint overrides, if
169 * there is one, or nil, if there isn't.
174 if (!this.isSatisfied()) {
175 if (this.strength == Strength.REQUIRED)
182 if (overridden != null) overridden.markUnsatisfied();
184 if (!planner.addPropagate(this, mark))
191 if (this.isSatisfied()) planner.incrementalRemove(this);
230 * Decides if this constraint can be satisfied and records that
239 * Returns true if this constraint is satisfied in the current solution.
257 * Calculate the walkabout strength, the stay flag, and, if it is
264 if (this.myOutput.stay) this.execute(); // Stay optimization
279 if (this.myOutput != null) this.myOutput.removeConstraint(this);
289 * Planners may exploit the fact that instances, if satisfied, will not
352 * Decides if this constraint can be satisfied and which way it
357 if (this.v1.mark == mark) {
362 if (this.v2.mark == mark) {
367 if (Strength.weaker(this.v1.walkStrength, this.v2.walkStrength)) {
388 * Answer true if this constraint is satisfied in the current solution.
416 * Calculate the walkabout strength, the stay flag, and, if it is
424 if (out.stay) this.execute();
440 if (this.v1 != null) this.v1.removeConstraint(this);
441 if (this.v2 != null) this.v2.removeConstraint(this);
475 if (this.scale != null) this.scale.removeConstraint(this);
476 if (this.offset != null) this.offset.removeConstraint(this);
488 if (this.direction == Direction.FORWARD) {
496 * Calculate the walkabout strength, the stay flag, and, if it is
504 if (out.stay) this.execute();
560 if (this.determinedBy == c) this.determinedBy = null;
575 * Attempt to satisfy the given constraint and, if successful,
576 * incrementally update the dataflow graph. Details: If satifying
585 * the algorithm to avoid getting into an infinite loop even if the
615 if (u.strength == strength)
639 * known if either a) the variable is marked (indicating that has
654 if (c.output().mark != mark && c.inputsKnown(mark)) {
671 if (c.isInput() && c.isSatisfied())
681 * values of all variables whose stay flag is true. If a cycle is
696 if (d.output().mark == mark) {
723 if (!c.isSatisfied())
729 if (next != determining && next.isSatisfied()) {
743 if (c != determining && c.isSatisfied())
805 if (prev != null)
807 if (i == 0) first = v;
808 if (i == n) last = v;
820 if (last.value != i)
847 if (dst.value != 1170) alert("Projection 1 failed");
849 if (src.value != 5) alert("Projection 2 failed");
852 if (dests.at(i).value != i * 5 + 1000)
857 if (dests.at(i).value != i * 5 + 2000)
