Home
last modified time | relevance | path

Searched refs:LEQ (Results 1 – 25 of 1134) sorted by relevance

12345678910>>...46

/dports/math/clingo/clingo-5.5.1/libgringo/tests/input/
H A Dliteral.cc97 …CK( (csplit(at(1), Relation::LEQ, at(2), Relation::LEQ, at(3))->hash() == csplit(at(1), Relation::…
98 …CK(!(csplit(at(2), Relation::LEQ, at(2), Relation::LEQ, at(3))->hash() == csplit(at(1), Relation::…
99 …CK(!(csplit(at(1), Relation::LEQ, at(3), Relation::LEQ, at(3))->hash() == csplit(at(1), Relation::…
100 …CK(!(csplit(at(1), Relation::LEQ, at(2), Relation::LEQ, at(4))->hash() == csplit(at(1), Relation::…
128 …QUIRE( (*csplit(at(1), Relation::LEQ, at(2), Relation::LEQ, at(3)) == *csplit(at(1), Relation::LEQ…
129 …QUIRE(!(*csplit(at(2), Relation::LEQ, at(2), Relation::LEQ, at(3)) == *csplit(at(1), Relation::LEQ…
130 …QUIRE(!(*csplit(at(1), Relation::LEQ, at(3), Relation::LEQ, at(3)) == *csplit(at(1), Relation::LEQ…
131 …QUIRE(!(*csplit(at(1), Relation::LEQ, at(2), Relation::LEQ, at(4)) == *csplit(at(1), Relation::LEQ…
132 …plit(at(1), Relation::NEQ, at(2), Relation::LEQ, at(3)) == *csplit(at(1), Relation::LEQ, at(2), Re…
133 …QUIRE(!(*csplit(at(1), Relation::LEQ, at(2), Relation::NEQ, at(3)) == *csplit(at(1), Relation::LEQ…
[all …]
/dports/editors/texmacs/TeXmacs-1.99.4-src/src/Data/String/
H A Dmerge_sort.hpp24 template<class T, class LEQ> static void
28 if (!LEQ::leq(a[start], a[start+1])) { in merge_sort_sub()
37 merge_sort_sub<T, LEQ> (a,middle,end,merge_buf); in merge_sort_sub()
47 template<class T, class LEQ> void
50 merge_sort_sub<T, LEQ> (a, 0, N(a), merge_buf); } in merge_sort_leq()
75 template<class T, class U, class LEQ> static void
80 if (!LEQ::leq(a[start], a[start+1])) { in merge_sort_sub()
92 merge_sort_sub<T,U,LEQ> (a,b,middle,end,ma,mb); in merge_sort_sub()
102 template<class T, class U, class LEQ> void
110 template<class T, class LEQ> array<int>
[all …]
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/optim/linear/
H A DSimplexSolverTest.java113 constraints.add(new LinearConstraint(new double[] { 1, 2, 1 }, Relationship.LEQ, 2)); in testMath781()
472 constraints.add(new LinearConstraint(new double[] { 1, 0 }, Relationship.LEQ, 2)); in testSimplexSolver()
473 constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.LEQ, 3)); in testSimplexSolver()
488 constraints.add(new LinearConstraint(new double[] { 1 }, Relationship.LEQ, 10)); in testSingleVariableAndConstraint()
505 constraints.add(new LinearConstraint(new double[] { 1, 0 }, Relationship.LEQ, 2)); in testModelWithNoArtificialVars()
506 constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.LEQ, 3)); in testModelWithNoArtificialVars()
507 constraints.add(new LinearConstraint(new double[] { 1, 1 }, Relationship.LEQ, 4)); in testModelWithNoArtificialVars()
521 constraints.add(new LinearConstraint(new double[] { 1, 2 }, Relationship.LEQ, 6)); in testMinimization()
552 constraints.add(new LinearConstraint(new double[] { 1 }, Relationship.LEQ, 1)); in testInfeasibleSolution()
795 relationship = Relationship.LEQ; in equationFromString()
[all …]
H A DSimplexTableauTest.java64 constraints.add(new LinearConstraint(new double[] {1, 0}, Relationship.LEQ, 2)); in testTableauWithNoArtificialVars()
65 constraints.add(new LinearConstraint(new double[] {0, 1}, Relationship.LEQ, 3)); in testTableauWithNoArtificialVars()
66 constraints.add(new LinearConstraint(new double[] {1, 1}, Relationship.LEQ, 4)); in testTableauWithNoArtificialVars()
93 constraints.add(new LinearConstraint(new double[] {1, 0}, Relationship.LEQ, 2)); in createConstraints()
94 constraints.add(new LinearConstraint(new double[] {0, 1}, Relationship.LEQ, 3)); in createConstraints()
/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…
/dports/math/cvc4/CVC4-1.7/src/theory/arith/
H A Darith_utilities.h75 case LEQ: in isRelationOperator()
97 case LEQ: return GEQ; in reverseRelationKind()
99 case GEQ: return LEQ; in reverseRelationKind()
112 case LEQ: return left <= right; in evaluateConstantPredicate()
156 case kind::LEQ: in oldSimplifiedKind()
164 case kind::LEQ: //(not (LEQ x c)) <=> (GT x c) in oldSimplifiedKind()
171 return kind::LEQ; in oldSimplifiedKind()
188 case kind::GT: return kind::LEQ; in negateKind()
189 case kind::LEQ: return kind::GT; in negateKind()
287 Node above_start = nm->mkNode(kind::LEQ, start, term); in mkInRange()
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/optimization/linear/
H A DSimplexSolverTest.java81 constraints.add(new LinearConstraint(new double[] { 1, 2, 1 }, Relationship.LEQ, 2)); in testMath781()
310 constraints.add(new LinearConstraint(new double[] { 1, 0 }, Relationship.LEQ, 2)); in testSimplexSolver()
311 constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.LEQ, 3)); in testSimplexSolver()
325 constraints.add(new LinearConstraint(new double[] { 1 }, Relationship.LEQ, 10)); in testSingleVariableAndConstraint()
341 constraints.add(new LinearConstraint(new double[] { 1, 0 }, Relationship.LEQ, 2)); in testModelWithNoArtificialVars()
342 constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.LEQ, 3)); in testModelWithNoArtificialVars()
343 constraints.add(new LinearConstraint(new double[] { 1, 1 }, Relationship.LEQ, 4)); in testModelWithNoArtificialVars()
356 constraints.add(new LinearConstraint(new double[] { 1, 2 }, Relationship.LEQ, 6)); in testMinimization()
385 constraints.add(new LinearConstraint(new double[] { 1 }, Relationship.LEQ, 1)); in testInfeasibleSolution()
586 relationship = Relationship.LEQ; in equationFromString()
[all …]
H A DSimplexTableauTest.java67 constraints.add(new LinearConstraint(new double[] {1, 0}, Relationship.LEQ, 2)); in testTableauWithNoArtificialVars()
68 constraints.add(new LinearConstraint(new double[] {0, 1}, Relationship.LEQ, 3)); in testTableauWithNoArtificialVars()
69 constraints.add(new LinearConstraint(new double[] {1, 1}, Relationship.LEQ, 4)); in testTableauWithNoArtificialVars()
96 constraints.add(new LinearConstraint(new double[] {1, 0}, Relationship.LEQ, 2)); in createConstraints()
97 constraints.add(new LinearConstraint(new double[] {0, 1}, Relationship.LEQ, 3)); in createConstraints()
/dports/lang/snobol4/snobol4-2.2.2/test/
H A Dlexcmp.ref2 LEQ('','')
6 LEQ('a','a')
26 LEQ(1,'1')
30 LEQ('1',1)
/dports/audio/rhvoice/RHVoice-1.2.4/src/third-party/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/
H A DTestPerf.java87 assertRelation("", true, duration / ITERATIONS / 1000000.0, LEQ, 50.0); // 47231000
101 assertRelation("", true, duration / ITERATIONS / 1000000.0, LEQ, 50.0); // 47231000
116 assertRelation("", true, duration / ITERATIONS / 1000000.0, LEQ, 50.0);
131 assertRelation("", true, duration / ITERATIONS / 1000000.0, LEQ, 50.0);
163 LEQ, 0);
166 assertRelation("CLDRFile.ldmlComparator", true, seconds, LEQ, 0.1);
171 assertRelation("DtdComparator-check", true, failures.value, LEQ, 0);
175 assertRelation("DtdComparator", true, newSeconds, LEQ, seconds * .5);
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/optim/linear/
H A DRelationship.java28 LEQ("<="), enumConstant
57 case LEQ : in oppositeRelationship()
60 return LEQ; in oppositeRelationship()
/dports/dns/dnscrypt-proxy2/dnscrypt-proxy-2.1.1/vendor/github.com/go-critic/go-critic/checkers/
H A DboolExprSimplify_checker.go127 cmp.Op = token.LEQ
128 case token.LEQ:
167 {token.LSS, token.EQL, token.LEQ},
168 {token.EQL, token.LSS, token.LEQ},
225 return replace(token.SUB, token.ADD, token.LEQ)
227 case token.LEQ:
288 {token.GTR, token.LEQ, 1, 1},
290 {token.GEQ, token.LEQ, 0, 0},
308 {token.LEQ, token.GTR, 1, 1},
312 {token.LEQ, token.GEQ, 2, 1},
/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.go127 cmp.Op = token.LEQ
128 case token.LEQ:
167 {token.LSS, token.EQL, token.LEQ},
168 {token.EQL, token.LSS, token.LEQ},
225 return replace(token.SUB, token.ADD, token.LEQ)
227 case token.LEQ:
288 {token.GTR, token.LEQ, 1, 1},
290 {token.GEQ, token.LEQ, 0, 0},
307 {token.LEQ, token.GTR, 1, 1},
311 {token.LEQ, token.GEQ, 2, 1},
/dports/multimedia/navidrome/navidrome-0.40.0/vendor/github.com/go-critic/go-critic/checkers/
H A DboolExprSimplify_checker.go127 cmp.Op = token.LEQ
128 case token.LEQ:
167 {token.LSS, token.EQL, token.LEQ},
168 {token.EQL, token.LSS, token.LEQ},
225 return replace(token.SUB, token.ADD, token.LEQ)
227 case token.LEQ:
288 {token.GTR, token.LEQ, 1, 1},
290 {token.GEQ, token.LEQ, 0, 0},
308 {token.LEQ, token.GTR, 1, 1},
312 {token.LEQ, token.GEQ, 2, 1},
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/optimization/linear/
H A DRelationship.java32 LEQ("<="), enumConstant
59 case LEQ : in oppositeRelationship()
62 return LEQ; in oppositeRelationship()
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/fourmolu-0.3.0.0/data/examples/declaration/type-families/closed-type-family/
H A Dinfix-four-out.hs6 'Zero `LEQ` y = 'True
7 'Succ n `LEQ` 'Zero = 'False
8 'Succ n `LEQ` 'Succ m = n `LEQ` m
H A Dinfix-out.hs6 'Zero `LEQ` y = 'True
7 'Succ n `LEQ` 'Zero = 'False
8 'Succ n `LEQ` 'Succ m = n `LEQ` m
H A Dinfix.hs6 'Zero `LEQ` y = 'True
7 'Succ n `LEQ` 'Zero = 'False
8 'Succ n `LEQ` 'Succ m = n `LEQ` m
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/ormolu-0.1.4.1/data/examples/declaration/type-families/closed-type-family/
H A Dinfix.hs6 'Zero `LEQ` y = 'True
7 'Succ n `LEQ` 'Zero = 'False
8 'Succ n `LEQ` 'Succ m = n `LEQ` m
H A Dinfix-out.hs6 'Zero `LEQ` y = 'True
7 'Succ n `LEQ` 'Zero = 'False
8 'Succ n `LEQ` 'Succ m = n `LEQ` m
/dports/devel/hs-ormolu/ormolu-0.4.0.0/data/examples/declaration/type-families/closed-type-family/
H A Dinfix-out.hs6 'Zero `LEQ` y = 'True
7 'Succ n `LEQ` 'Zero = 'False
8 'Succ n `LEQ` 'Succ m = n `LEQ` m
H A Dinfix.hs6 'Zero `LEQ` y = 'True
7 'Succ n `LEQ` 'Zero = 'False
8 'Succ n `LEQ` 'Succ m = n `LEQ` m
/dports/math/cvc4/CVC4-1.7/src/theory/idl/
H A Didl_assertion.cpp43 d_op = kind::LEQ; in IDLAssertion()
48 d_op = kind::LEQ; in IDLAssertion()
87 case kind::LEQ: in negateOp()
92 return kind::LEQ; in negateOp()
133 case kind::LEQ: in parse()
/dports/cad/openscad/openscad-41f58fe57c03457a3a8b4dc541ef5654ec3e8c78/src/ext/libtess2/Source/
H A Dpriorityq.c45 #define LEQ(x,y) (*pq->leq)(x,y) macro
49 #define LEQ(x,y) VertLeq((TESSvertex *)x, (TESSvertex *)y) macro
136 if( child < pq->size && LEQ( h[n[child+1].handle].key, in FloatDown()
144 if( child > pq->size || LEQ( h[hCurr].key, h[hChild].key )) { in FloatDown()
167 if( parent == 0 || LEQ( h[hParent].key, h[hCurr].key )) { in FloatUp()
281 if( curr <= 1 || LEQ( h[n[curr>>1].handle].key, h[n[curr].handle].key )) { in pqHeapDelete()
335 #define LT(x,y) (! LEQ(y,x))
336 #define GT(x,y) (! LEQ(x,y))
413 assert( LEQ( **(i+1), **i )); in pqInit()
466 if( LEQ( heapMin, sortMin )) { in pqExtractMin()
[all …]
/dports/cad/openscad-devel/openscad-63a7c77740030c63d646eb0684ba6947eecb0db7/src/ext/libtess2/Source/
H A Dpriorityq.c45 #define LEQ(x,y) (*pq->leq)(x,y) macro
49 #define LEQ(x,y) VertLeq((TESSvertex *)x, (TESSvertex *)y) macro
136 if( child < pq->size && LEQ( h[n[child+1].handle].key, in FloatDown()
144 if( child > pq->size || LEQ( h[hCurr].key, h[hChild].key )) { in FloatDown()
167 if( parent == 0 || LEQ( h[hParent].key, h[hCurr].key )) { in FloatUp()
281 if( curr <= 1 || LEQ( h[n[curr>>1].handle].key, h[n[curr].handle].key )) { in pqHeapDelete()
335 #define LT(x,y) (! LEQ(y,x))
336 #define GT(x,y) (! LEQ(x,y))
413 assert( LEQ( **(i+1), **i )); in pqInit()
466 if( LEQ( heapMin, sortMin )) { in pqExtractMin()
[all …]

12345678910>>...46