| /external/llvm-project/mlir/unittests/Analysis/Presburger/ |
| D | SimplexTest.cpp | 19 Simplex simplex(2); in TEST() local
21 simplex.addInequality({1, -1, 0}); in TEST()
22 EXPECT_FALSE(simplex.isEmpty()); in TEST()
24 unsigned snapshot = simplex.getSnapshot(); in TEST()
26 simplex.addInequality({-1, 1, -1}); in TEST()
27 EXPECT_TRUE(simplex.isEmpty()); in TEST()
28 simplex.rollback(snapshot); in TEST()
29 EXPECT_FALSE(simplex.isEmpty()); in TEST()
35 Simplex simplex(1); in TEST() local
36 simplex.addInequality({1, -1}); // x >= 1. in TEST()
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| D | DirectSearchOptimizer.java | 92 protected RealPointValuePair[] simplex; field in DirectSearchOptimizer
289 RealPointValuePair[] previous = new RealPointValuePair[simplex.length]; in optimize()
294 for (int i = 0; i < simplex.length; ++i) { in optimize()
295 converged &= checker.converged(iterations, previous[i], simplex[i]); in optimize()
299 return simplex[0]; in optimize()
304 System.arraycopy(simplex, 0, previous, 0, simplex.length); in optimize()
364 simplex = new RealPointValuePair[n + 1]; in buildSimplex()
365 simplex[0] = new RealPointValuePair(startPoint, Double.NaN); in buildSimplex()
374 simplex[i + 1] = new RealPointValuePair(vertexI, Double.NaN); in buildSimplex()
388 for (int i = 0; i < simplex.length; ++i) { in evaluateSimplex()
[all …]
|
| D | MultiDirectional.java | 70 final RealPointValuePair[] original = simplex; in iterateSimplex()
78 final RealPointValuePair[] reflectedSimplex = simplex; in iterateSimplex()
82 simplex = reflectedSimplex; in iterateSimplex()
99 for (int i = 0; i < simplex.length; ++i) { in iterateSimplex()
100 converged &= checker.converged(iter, original[i], simplex[i]); in iterateSimplex()
127 simplex = new RealPointValuePair[n + 1]; in evaluateNewSimplex()
128 simplex[0] = original[0]; in evaluateNewSimplex()
135 simplex[i] = new RealPointValuePair(xTransformed, Double.NaN, false); in evaluateNewSimplex()
140 return simplex[0]; in evaluateNewSimplex()
|
| D | NelderMead.java | 80 final int n = simplex.length - 1; in iterateSimplex()
83 final RealPointValuePair best = simplex[0]; in iterateSimplex()
84 final RealPointValuePair secondBest = simplex[n-1]; in iterateSimplex()
85 final RealPointValuePair worst = simplex[n]; in iterateSimplex()
92 final double[] x = simplex[i].getPointRef(); in iterateSimplex()
167 final double[] xSmallest = simplex[0].getPointRef(); in iterateSimplex()
168 for (int i = 1; i < simplex.length; ++i) { in iterateSimplex()
169 final double[] x = simplex[i].getPoint(); in iterateSimplex()
173 simplex[i] = new RealPointValuePair(x, Double.NaN, false); in iterateSimplex()
|
| /external/llvm-project/mlir/lib/Analysis/ |
| D | PresburgerSet.cpp | 165 static void subtractRecursively(FlatAffineConstraints &b, Simplex &simplex, in subtractRecursively() argument
173 unsigned initialSnapshot = simplex.getSnapshot(); in subtractRecursively()
174 unsigned offset = simplex.numConstraints(); in subtractRecursively()
175 simplex.intersectFlatAffineConstraints(sI); in subtractRecursively()
177 if (simplex.isEmpty()) { in subtractRecursively()
179 simplex.rollback(initialSnapshot); in subtractRecursively()
180 subtractRecursively(b, simplex, s, i + 1, result); in subtractRecursively()
184 simplex.detectRedundant(); in subtractRecursively()
188 isMarkedRedundant.push_back(simplex.isMarkedRedundant(offset + j)); in subtractRecursively()
190 simplex.rollback(initialSnapshot); in subtractRecursively()
[all …]
|
| D | AffineStructures.cpp | 1048 Simplex simplex(*this); in isIntegerEmpty() local
1049 if (simplex.isUnbounded()) in isIntegerEmpty()
1051 return !simplex.findIntegerSample().hasValue(); in isIntegerEmpty()
1445 Simplex simplex(*this); in removeRedundantConstraints() local
1446 simplex.detectRedundant(); in removeRedundantConstraints()
1459 if (!simplex.isMarkedRedundant(r)) in removeRedundantConstraints()
1476 if (!(simplex.isMarkedRedundant(numIneqs + 2 * r) && in removeRedundantConstraints()
1477 simplex.isMarkedRedundant(numIneqs + 2 * r + 1))) in removeRedundantConstraints()
|
| /external/llvm-project/mlir/lib/Analysis/Presburger/ |
| D | Simplex.cpp | 695 : simplex(Simplex::makeProduct(originalSimplex, originalSimplex)), in GBRSimplex()
696 simplexConstraintOffset(simplex.numConstraints()) {} in GBRSimplex()
705 snapshotStack.push_back(simplex.getSnapshot()); in addEqualityForDirection()
706 simplex.addEquality(getCoeffsForDirection(dir)); in addEqualityForDirection()
714 unsigned snap = simplex.getSnapshot(); in computeWidthAndDuals()
715 unsigned conIndex = simplex.addRow(getCoeffsForDirection(dir)); in computeWidthAndDuals()
716 unsigned row = simplex.con[conIndex].pos; in computeWidthAndDuals()
718 simplex.computeRowOptimum(Simplex::Direction::Up, row); in computeWidthAndDuals()
720 dualDenom = simplex.tableau(row, 0); in computeWidthAndDuals()
748 if (simplex.con[i].orientation == Orientation::Column) { in computeWidthAndDuals()
[all …]
|
| /external/mesa3d/src/mesa/program/ |
| D | prog_noise.c | 191 static const unsigned char simplex[64][4] = { variable
542 i1 = simplex[c][0] >= 3 ? 1 : 0; in _mesa_noise4()
543 j1 = simplex[c][1] >= 3 ? 1 : 0; in _mesa_noise4()
544 k1 = simplex[c][2] >= 3 ? 1 : 0; in _mesa_noise4()
545 l1 = simplex[c][3] >= 3 ? 1 : 0; in _mesa_noise4()
547 i2 = simplex[c][0] >= 2 ? 1 : 0; in _mesa_noise4()
548 j2 = simplex[c][1] >= 2 ? 1 : 0; in _mesa_noise4()
549 k2 = simplex[c][2] >= 2 ? 1 : 0; in _mesa_noise4()
550 l2 = simplex[c][3] >= 2 ? 1 : 0; in _mesa_noise4()
552 i3 = simplex[c][0] >= 1 ? 1 : 0; in _mesa_noise4()
[all …]
|
| /external/llvm-project/polly/lib/External/isl/ |
| D | isl_vertices.c | 1389 isl_stat (*fn)(__isl_take isl_cell *simplex, void *user), void *user) in call_on_simplex() argument
1393 struct isl_cell *simplex; in call_on_simplex() local
1397 simplex = isl_calloc_type(ctx, struct isl_cell); in call_on_simplex()
1398 if (!simplex) in call_on_simplex()
1400 simplex->vertices = isl_vertices_copy(cell->vertices); in call_on_simplex()
1401 if (!simplex->vertices) in call_on_simplex()
1403 simplex->dom = isl_basic_set_copy(cell->dom); in call_on_simplex()
1404 if (!simplex->dom) in call_on_simplex()
1406 simplex->n_vertices = n_simplex + n_other; in call_on_simplex()
1407 simplex->ids = isl_alloc_array(ctx, int, simplex->n_vertices); in call_on_simplex()
[all …]
|
| D | isl_vertices_private.h | 62 isl_stat (*fn)(__isl_take isl_cell *simplex, void *user), void *user);
|
| /external/oboe/samples/RhythmGame/third_party/glm/gtc/ |
| D | noise.hpp | 54 GLM_FUNC_DECL T simplex(
|
| D | noise.inl | 592 GLM_FUNC_QUALIFIER T simplex(glm::tvec2<T, P> const & v) function
649 GLM_FUNC_QUALIFIER T simplex(tvec3<T, P> const & v) function
724 GLM_FUNC_QUALIFIER T simplex(tvec4<T, P> const & v) function
|
| /external/llvm-project/polly/lib/External/isl/doc/ |
| D | implementation.tex | 175 In the following sections, we briefly recall the dual simplex
186 In {\tt isl}, the dual simplex method uses the same representation
188 simplex method. The implementation of this LP solver is based
213 The dual simplex method starts from an initial sample value that
270 The solution found by the dual simplex method may have
369 of the actual dual simplex method with Gomory cuts.
474 the dual simplex method.
562 implementation uses a recursive call to the dual simplex with Gomory
621 of the dual simplex method applied to this new context will be the same
624 the dual simplex method incrementally on the context and backtrack
|
| /external/tcpdump/ |
| D | CREDITS | 168 Onno van der Linden <onno at simplex dot nl>
|
| D | CHANGES | 839 Token Ring support on DLPI - Onno van der Linden <onno@simplex.nl>
1022 (onno@simplex.nl)
|
| /external/libpcap/ |
| D | CREDITS | 179 Onno van der Linden <onno at simplex dot nl>
|
| /external/e2fsprogs/po/ |
| D | ms.po | 7041 " -s, --sides=MOD tetapkan MOD dupleks (`1' atau `simplex',\n"
|
| /external/one-true-awk/testdir/ |
| D | funstack.in | 13483 …norm; linear programming; minimizes; overdetermined system of equations; simplex method; subroutin…
25345 …simplex method. The algorithm is a general purpose one that does not account for any particular st…
25351 … programming; mathematical programming, linear; modified Givens; revised simplex; transformations;…
|
| /external/jline/src/src/test/resources/jline/example/ |
| D | english.gz | |
| /external/kotlinx.coroutines/benchmarks/src/jmh/resources/ |
| D | ospd.txt.gz | |
| /external/cldr/tools/java/org/unicode/cldr/util/data/transforms/ |
| D | internal_raw_IPA-old.txt | 179205 simplex %20537 sˈɪmplɛks
|
| D | internal_raw_IPA.txt | 150104 simplex %32137 sˈɪmplɛks
|