src/libs/alm/Area.cpp

637

kLE, max.Height(), priority, priority);

src/libs/alm/Area.cpp

654

fMaxContentWidth = fLS->AddConstraint(-1.0, fLeft, 1.0, fRight, kLE,

src/libs/linprog/ActiveSetSolver.cpp

491

if (constraint->Op() == kLE) {

src/libs/linprog/ActiveSetSolver.cpp

570

constraintLE = fLinearSpec->AddConstraint(1, variable, kLE, 20000);

src/libs/linprog/Constraint.cpp

351

: (fOp == kLE) ? "<= "

src/libs/linprog/LayoutOptimizer.cpp

532

if (constraint->Op() == LinearProgramming::kLE)

src/libs/linprog/LayoutOptimizer.cpp

575

if (constraint->Op() == LinearProgramming::kLE)

src/libs/linprog/LayoutOptimizer.cpp

584

if (constraint->Op() == LinearProgramming::kLE)

src/libs/linprog/LayoutOptimizer.cpp

737

if (constraint->Op() == LinearProgramming::kLE)

src/libs/linprog/Variable.cpp

216

return fLS->AddConstraint(1.0, this, -1.0, var, kLE, 0.0);

src/libs/linprog/Variable.cpp

253

return fLS->AddConstraint(1.0, this, -1.0, var, kLE, 0.0, penaltyNeg,

src/servers/app/stackandtile/SATGroup.cpp

84

LeftVar(), kLE, 0, kInequalityPenalty, kInequalityPenalty);

src/servers/app/stackandtile/SATGroup.cpp

86

TopVar(), kLE, 0, kInequalityPenalty, kInequalityPenalty);

src/tests/libs/alm/FriendLayout.cpp

73

LinearProgramming::kLE, 90.0f);

src/tests/libs/linprog/Program.cpp

32

Constraint* c1 = ls.AddConstraint(1.0, x1, OperatorType(kLE), 108);

src/tests/libs/linprog/Program.cpp

62

Constraint* c2 = ls.AddConstraint(1, x1, -1, x2, kLE, 0);

src/tests/libs/linprog/Program.cpp

63

Constraint* c3 = ls.AddConstraint(1, x2, -1, x3, kLE, 0);

src/tests/libs/linprog/Program.cpp

94

Constraint* c2 = ls.AddConstraint(1, x1, -1, x2, kLE, 0);

src/tests/libs/linprog/Program.cpp

95

Constraint* c3 = ls.AddConstraint(1, x2, -1, x3, kLE, 0);