Home
last modified time | relevance | path

Searched refs:GEQ (Results 1 – 25 of 1099) sorted by relevance

12345678910>>...44

/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/optim/linear/
H A DSimplexSolverTest.java148 constraints.add(new LinearConstraint(new double[] {0, 0, 1}, Relationship.GEQ, -10)); in testMath434NegativeVariable()
182 constraints.add(new LinearConstraint(new double[] {200}, Relationship.GEQ, 1)); in testMath434PivotRowSelection()
223 constraints.add(new LinearConstraint(new double[] { 1, 1, 0 }, Relationship.GEQ, 1)); in testMath272()
264 constraints.add(new LinearConstraint(new double[] { 1, 0 }, Relationship.GEQ, 10.0)); in testDegeneracy()
265 constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.GEQ, 8.0)); in testDegeneracy()
293 constraints.add(new LinearConstraint(new double[] { 2, 0 }, Relationship.GEQ, -1.0)); in testMath290GEQ()
523 constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.GEQ, 0)); in testMinimization()
537 constraints.add(new LinearConstraint(new double[] { 1, 1 }, Relationship.GEQ, 6)); in testSolutionWithNegativeDecisionVariable()
553 constraints.add(new LinearConstraint(new double[] { 1 }, Relationship.GEQ, 3)); in testInfeasibleSolution()
793 relationship = Relationship.GEQ; in equationFromString()
[all …]
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/optimization/linear/
H A DSimplexSolverTest.java114 constraints.add(new LinearConstraint(new double[] {0, 0, 1}, Relationship.GEQ, -10)); in testMath434NegativeVariable()
146 constraints.add(new LinearConstraint(new double[] {200}, Relationship.GEQ, 1)); in testMath434PivotRowSelection()
185 constraints.add(new LinearConstraint(new double[] { 1, 1, 0 }, Relationship.GEQ, 1)); in testMath272()
224 constraints.add(new LinearConstraint(new double[] { 1, 0 }, Relationship.GEQ, 10.0)); in testDegeneracy()
225 constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.GEQ, 8.0)); in testDegeneracy()
251 constraints.add(new LinearConstraint(new double[] { 2, 0 }, Relationship.GEQ, -1.0)); in testMath290GEQ()
358 constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.GEQ, 0)); in testMinimization()
371 constraints.add(new LinearConstraint(new double[] { 1, 1 }, Relationship.GEQ, 6)); in testSolutionWithNegativeDecisionVariable()
386 constraints.add(new LinearConstraint(new double[] { 1 }, Relationship.GEQ, 3)); in testInfeasibleSolution()
584 relationship = Relationship.GEQ; in equationFromString()
[all …]
/dports/archivers/libzippp/libzippp-libzippp-v5.0-1.8.0/
H A Dcompile.bat20 if %ERRORLEVEL% GEQ 1 goto error_zlib
22 if %ERRORLEVEL% GEQ 1 goto error_zlib
24 if %ERRORLEVEL% GEQ 1 goto error_zlib
37 if %ERRORLEVEL% GEQ 1 goto error_libzip
39 if %ERRORLEVEL% GEQ 1 goto error_libzip
41 if %ERRORLEVEL% GEQ 1 goto error_libzip
67 if %ERRORLEVEL% GEQ 1 goto error_libzippp
70 if %ERRORLEVEL% GEQ 1 goto error_libzippp
72 if %ERRORLEVEL% GEQ 1 goto error_libzippp
88 if %ERRORLEVEL% GEQ 1 goto error_libzippp
[all …]
/dports/devel/universal-ctags/ctags-p5.9.20211128.0/Units/parser-yacc.r/not-union.d/
H A Dexpected.tags1 HOSTCOND input.y /^%token HOSTCOND DCOND SCOND DPORT SPORT LEQ GEQ NEQ AUTOBOUND$/;" t language:YACC
2 DCOND input.y /^%token HOSTCOND DCOND SCOND DPORT SPORT LEQ GEQ NEQ AUTOBOUND$/;" t language:YACC
3 SCOND input.y /^%token HOSTCOND DCOND SCOND DPORT SPORT LEQ GEQ NEQ AUTOBOUND$/;" t language:YACC
4 DPORT input.y /^%token HOSTCOND DCOND SCOND DPORT SPORT LEQ GEQ NEQ AUTOBOUND$/;" t language:YACC
5 SPORT input.y /^%token HOSTCOND DCOND SCOND DPORT SPORT LEQ GEQ NEQ AUTOBOUND$/;" t language:YACC
6 LEQ input.y /^%token HOSTCOND DCOND SCOND DPORT SPORT LEQ GEQ NEQ AUTOBOUND$/;" t language:YACC
7 GEQ input.y /^%token HOSTCOND DCOND SCOND DPORT SPORT LEQ GEQ NEQ AUTOBOUND$/;" t language:YACC
8 NEQ input.y /^%token HOSTCOND DCOND SCOND DPORT SPORT LEQ GEQ NEQ AUTOBOUND$/;" t language:YACC
9 AUTOBOUND input.y /^%token HOSTCOND DCOND SCOND DPORT SPORT LEQ GEQ NEQ AUTOBOUND$/;" t language:YA…
H A Dinput.y39 %token HOSTCOND DCOND SCOND DPORT SPORT LEQ GEQ NEQ AUTOBOUND
62 | DPORT GEQ HOSTCOND
87 | SPORT GEQ HOSTCOND
243 return GEQ; in yylex()
/dports/math/cvc4/CVC4-1.7/src/theory/arith/
H A Darith_utilities.h77 case GEQ: in isRelationOperator()
97 case LEQ: return GEQ; in reverseRelationKind()
99 case GEQ: return LEQ; in reverseRelationKind()
114 case GEQ: return left >= right; in evaluateConstantPredicate()
157 case kind::GEQ: in oldSimplifiedKind()
166 case kind::GEQ: //(not (GEQ x c)) <=> (LT x c) in oldSimplifiedKind()
169 return kind::GEQ; in oldSimplifiedKind()
187 case kind::LT: return kind::GEQ; in negateKind()
190 case kind::GEQ: return kind::LT; in negateKind()
H A Dnormal_form.cpp700 case kind::GEQ: in toSumPair()
741 case kind::GEQ: in normalizedVariablePart()
781 case kind::GEQ: in normalizedDeltaRational()
834 case kind::GEQ: in toNode()
845 case kind::GEQ: in toNode()
876 case kind::GEQ: in getComplexity()
895 case kind::GEQ: in getLeft()
915 case kind::GEQ: in getRight()
945 case kind::GEQ: in isNormalForm()
1288 case kind::GEQ: in mkComparison()
[all …]
H A Darith_static_learner.cpp179 case GEQ: { // (ite (>= x y) x y) in iteMinMax()
180 Node nGeqX = NodeBuilder<2>(GEQ) << n << t; in iteMinMax()
181 Node nGeqY = NodeBuilder<2>(GEQ) << n << e; in iteMinMax()
206 nGeqMin = NodeBuilder<2>(kind::GEQ) << n << mkRationalNode(min.getNoninfinitesimalPart()); in iteConstant()
267 case kind::GEQ: in addBound()
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/optim/linear/
H A DRelationship.java30 GEQ(">="); enumConstant
58 return GEQ; in oppositeRelationship()
59 case GEQ : in oppositeRelationship()
/dports/dns/dnscrypt-proxy2/dnscrypt-proxy-2.1.1/vendor/github.com/go-critic/go-critic/checkers/
H A DboolExprSimplify_checker.go125 cmp.Op = token.GEQ
130 case token.GEQ:
165 {token.GTR, token.EQL, token.GEQ},
166 {token.EQL, token.GTR, token.GEQ},
215 return replace(token.ADD, token.SUB, token.GEQ)
217 case token.GEQ:
286 {token.GEQ, token.LSS, 1, 0},
290 {token.GEQ, token.LEQ, 0, 0},
310 {token.LSS, token.GEQ, 1, 0},
312 {token.LEQ, token.GEQ, 2, 1},
H A DyodaStyleExpr_checker.go37 case token.EQL, token.NEQ, token.LSS, token.LEQ, token.GEQ, token.GTR:
52 expr.Op = token.GEQ
55 case token.GEQ:
/dports/multimedia/navidrome/navidrome-0.40.0/vendor/github.com/kunwardeep/paralleltest/tools/vendor/github.com/go-critic/go-critic/checkers/
H A DboolExprSimplify_checker.go125 cmp.Op = token.GEQ
130 case token.GEQ:
165 {token.GTR, token.EQL, token.GEQ},
166 {token.EQL, token.GTR, token.GEQ},
215 return replace(token.ADD, token.SUB, token.GEQ)
217 case token.GEQ:
286 {token.GEQ, token.LSS, 1, 0},
290 {token.GEQ, token.LEQ, 0, 0},
309 {token.LSS, token.GEQ, 1, 0},
311 {token.LEQ, token.GEQ, 2, 1},
H A DyodaStyleExpr_checker.go37 case token.EQL, token.NEQ, token.LSS, token.LEQ, token.GEQ, token.GTR:
52 expr.Op = token.GEQ
55 case token.GEQ:
/dports/multimedia/navidrome/navidrome-0.40.0/vendor/github.com/go-critic/go-critic/checkers/
H A DboolExprSimplify_checker.go125 cmp.Op = token.GEQ
130 case token.GEQ:
165 {token.GTR, token.EQL, token.GEQ},
166 {token.EQL, token.GTR, token.GEQ},
215 return replace(token.ADD, token.SUB, token.GEQ)
217 case token.GEQ:
286 {token.GEQ, token.LSS, 1, 0},
290 {token.GEQ, token.LEQ, 0, 0},
310 {token.LSS, token.GEQ, 1, 0},
312 {token.LEQ, token.GEQ, 2, 1},
H A DyodaStyleExpr_checker.go37 case token.EQL, token.NEQ, token.LSS, token.LEQ, token.GEQ, token.GTR:
52 expr.Op = token.GEQ
55 case token.GEQ:
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/optimization/linear/
H A DRelationship.java35 GEQ(">="); enumConstant
60 return GEQ; in oppositeRelationship()
61 case GEQ : in oppositeRelationship()
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/dependent-sum-0.7.1.0/examples/
H A DFooGADT.hs47 gcompare Foo Foo = GEQ
51 gcompare Bar Bar = GEQ
55 gcompare Baz Baz = GEQ
59 gcompare Qux Qux = GEQ
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/some-1.0.2/src/Data/GADT/
H A DInternal.hs224 GEQ :: GOrdering t t
235 weakenOrdering GEQ = EQ function
246 showsPrec _ GEQ = showString "GEQ"
255 "GEQ" -> [(mkSome GEQ, rest)]
266 gcompare Refl Refl = GEQ
272 Just Refl -> GEQ
295 GEQ -> case gcompare y y' of
297 GEQ -> GEQ
/dports/math/clingo/clingo-5.5.1/libgringo/gringo/
H A Dbase.hh66 enum class Relation : unsigned { GT, LT, LEQ, GEQ, NEQ, EQ }; enumerator
175 case Relation::GEQ: { out << ">="; break; } in operator <<()
185 case Relation::GEQ: { return Relation::LEQ; } in inv()
186 case Relation::LEQ: { return Relation::GEQ; } in inv()
198 case Relation::GEQ: { return Relation::LT; } in neg()
201 case Relation::LT: { return Relation::GEQ; } in neg()
/dports/math/cvc4/CVC4-1.7/src/theory/idl/
H A Didl_assertion.cpp39 if (d_op == kind::GEQ) { in IDLAssertion()
86 return kind::GEQ; in negateOp()
93 case kind::GEQ: in negateOp()
135 case kind::GEQ: { in parse()
/dports/math/cvc4/CVC4-1.7/src/preprocessing/passes/
H A Dpseudo_boolean_processor.cpp55 if (assertion.getKind() != kind::GEQ) in decomposeAssertion()
59 Assert(assertion.getKind() == kind::GEQ); in decomposeAssertion()
209 Assert(assertion.getKind() == kind::GEQ); in learnRewrittenGeq()
259 case kind::GEQ: in learnInternal()
267 if (assertion.getKind() == kind::GEQ) in learnInternal()
302 return nm->mkNode(kind::GEQ, v, mkRationalNode(Rational(1))); in mkGeqOne()
327 Assert(geq.getKind() == kind::GEQ); in learnGeqSub()
/dports/math/cvc4/CVC4-1.7/src/theory/strings/
H A Dtheory_strings_preprocess.cpp64 Node c1 = nm->mkNode(GEQ, n, d_zero); in simplify()
84 nm->mkNode(GEQ, lt0, t12), in simplify()
112 Node krange = nm->mkNode(GEQ, skk, negone); in simplify()
115 krange = nm->mkNode(GEQ, nm->mkNode(STRING_LENGTH, x), skk); in simplify()
195 Node lem = nm->mkNode(GEQ, leni, d_one); in simplify()
230 nm->mkNode(GEQ, c, nm->mkNode(ITE, leadingZeroPos, d_one, d_zero)), in simplify()
237 Node nonneg = nm->mkNode(GEQ, n, d_zero); in simplify()
279 Node kc1 = nm->mkNode(GEQ, k, d_zero); in simplify()
288 OR, nm->mkNode(LT, codeSk, d_zero), nm->mkNode(GEQ, codeSk, ten)); in simplify()
437 lem.push_back(nm->mkNode(GEQ, numOcc, d_zero)); in simplify()
[all …]
/dports/www/grafana8/grafana-8.3.6/vendor/cuelang.org/go/cue/token/
H A Dtoken.go73 GEQ // >= const
147 GEQ: ">=",
226 case EQL, NEQ, LSS, LEQ, GTR, GEQ, MAT, NMAT:
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/brdb/tests/
H A Dtest_query.cxx19 (brdb_query::LT == ~brdb_query::GEQ ) && in test_query()
20 (brdb_query::GEQ == ~brdb_query::LT ) ); in test_query()
/dports/sysutils/heirloom/heirloom-070715/expr/
H A Dexpr.y120 %token <val> OR AND ADD SUBT MULT DIV REM EQ GT GEQ LT LEQ NEQ
128 %left EQ LT GT GEQ LEQ NEQ
157 | expr GEQ expr { $$ = _rel(GEQ, $1, $3); }
205 EQ, EQ, LT, LEQ, GT, GEQ, NEQ,
241 case GEQ: i = i>=0; break; in _rel()

12345678910>>...44