Home
last modified time | relevance | path

Searched refs:kLE (Results 1 – 9 of 9) sorted by relevance

/haiku/src/tests/libs/linprog/
H A DProgram.cpp32 Constraint* c1 = ls.AddConstraint(1.0, x1, OperatorType(kLE), 108); in Test1()
62 Constraint* c2 = ls.AddConstraint(1, x1, -1, x2, kLE, 0); in SoftConstraints()
63 Constraint* c3 = ls.AddConstraint(1, x2, -1, x3, kLE, 0); in SoftConstraints()
94 Constraint* c2 = ls.AddConstraint(1, x1, -1, x2, kLE, 0); in SoftInequalityConstraints()
95 Constraint* c3 = ls.AddConstraint(1, x2, -1, x3, kLE, 0); in SoftInequalityConstraints()
/haiku/headers/libs/linprog/
H A DLinearProgrammingTypes.h35 kLE, enumerator
/haiku/src/libs/linprog/
H A DVariable.cpp216 return fLS->AddConstraint(1.0, this, -1.0, var, kLE, 0.0); in IsSmallerOrEqual()
253 return fLS->AddConstraint(1.0, this, -1.0, var, kLE, 0.0, penaltyNeg, in IsSmallerOrEqual()
H A DLayoutOptimizer.cpp532 if (constraint->Op() == LinearProgramming::kLE) in SetConstraints()
575 if (constraint->Op() == LinearProgramming::kLE) in _ActualValue()
584 if (constraint->Op() == LinearProgramming::kLE) in _RightSide()
737 if (constraint->Op() == LinearProgramming::kLE) in _Solve()
H A DActiveSetSolver.cpp491 if (constraint->Op() == kLE) { in Solve()
570 constraintLE = fLinearSpec->AddConstraint(1, variable, kLE, 20000); in VariableRangeChanged()
H A DConstraint.cpp351 : (fOp == kLE) ? "<= " in ToString()
/haiku/src/tests/libs/alm/
H A DFriendLayout.cpp73 LinearProgramming::kLE, 90.0f); in FriendWindow()
/haiku/src/libs/alm/
H A DArea.cpp637 kLE, max.Height(), priority, priority); in _UpdateMaxSizeConstraint()
654 fMaxContentWidth = fLS->AddConstraint(-1.0, fLeft, 1.0, fRight, kLE, in _UpdateMaxSizeConstraint()
/haiku/src/servers/app/stackandtile/
H A DSATGroup.cpp84 LeftVar(), kLE, 0, kInequalityPenalty, kInequalityPenalty); in Init()
86 TopVar(), kLE, 0, kInequalityPenalty, kInequalityPenalty); in Init()