| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| D | NelderMead.java | 85 final RealPointValuePair worst = simplex[n]; in iterateSimplex() local
86 final double[] xWorst = worst.getPointRef(); in iterateSimplex()
134 if (comparator.compare(reflected, worst) < 0) { in iterateSimplex()
158 if (comparator.compare(inContracted, worst) < 0) { in iterateSimplex()
|
| /external/bison/m4/ |
| D | strerror.m4 | 29 # If we don't know, assume the worst.
83 # If we don't know, assume the worst.
|
| D | setenv.m4 | 40 # If we don't know, assume the worst.
132 # If we don't know, assume the worst.
|
| D | printf.m4 | 80 # If we don't know, assume the worst.
237 # If we don't know, assume the worst.
450 # If we don't know, assume the worst.
544 # If we don't know, assume the worst.
599 # If we don't know, assume the worst.
902 # If we don't know, assume the worst.
1076 # If we don't know, assume the worst.
1169 # If we don't know, assume the worst.
1259 # If we don't know, assume the worst.
1342 # If we don't know, assume the worst.
[all …]
|
| D | realloc.m4 | 35 # If we don't know, assume the worst.
|
| D | calloc.m4 | 39 # If we don't know, assume the worst.
|
| D | stat.m4 | 53 # If we don't know, assume the worst.
|
| D | malloc.m4 | 35 # If we don't know, assume the worst.
|
| D | signbit.m4 | 34 # If we don't know, assume the worst.
63 # If we don't know, assume the worst.
|
| D | getopt.m4 | 298 [dnl Cross compiling. Assume the worst, even on glibc platforms.
|
| /external/nanopb-c/generator/ |
| D | nanopb_generator.py | 816 worst = 0
826 elif status > worst:
827 worst = status
830 if worst > 255 or checks:
833 if worst > 65535 or checks:
835 if worst > 65535:
850 if worst < 65536:
852 if worst > 255:
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| D | LocaleMatcher.java | 415 final double worst; field in LocaleMatcher.Level
418 worst = d; in Level()
533 System.out.println("\t\t\t\tNOTFOUND\t" + level.worst); in getRawScore()
535 return level.worst; in getRawScore()
|
| /external/eigen/bench/ |
| D | BenchTimer.h | 107 inline double worst(int TIMER = CPU_TIMER) const
|
| /external/skia/tests/ |
| D | PathOpsSkpClipTest.cpp | 768 SkTDArray<SortByPixel*> worst; in encodeFound() local
770 *worst.append() = &state.fPixelWorst[index]; in encodeFound()
772 SkTQSort<SortByPixel>(worst.begin(), worst.end() - 1); in encodeFound()
774 const TestResult& result = *worst[index]; in encodeFound()
|
| /external/valgrind/coregrind/m_debuginfo/ |
| D | README.txt | 40 The worst thing is that it is the stabs type reader that was crashing,
|
| /external/speex/libspeex/ |
| D | jitter.c | 186 int worst = 0; in compute_opt_delay() local
230 worst = latest; in compute_opt_delay()
257 deltaT = best-worst; in compute_opt_delay()
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2001-05-19-ExceptionResponse.txt | 19 then once in the exception path). Because this could, at worst,
|
| /external/mesa3d/src/mesa/main/ |
| D | texcompress_fxt1.c | 315 GLint i, k, worst = -1; in fxt1_worst() local
325 worst = k; in fxt1_worst()
329 return worst; in fxt1_worst()
546 GLint worst = fxt1_worst(vec[j], input, nc, n); in fxt1_lloyd() local
548 vec[j][i] = input[worst][i]; in fxt1_lloyd()
|
| /external/llvm/docs/ |
| D | SegmentedStacks.rst | 12 monolithic chunk (of some worst case size) at thread initialization. This is
|
| /external/replicaisland/ |
| D | README.TXT | 34 …mals, organized by tile. It takes a long time to run and is probably the worst code in the entire…
|
| /external/mesa3d/src/mesa/drivers/dri/common/xmlpool/ |
| D | sv.po | 188 msgid "At least 1 texture must fit under worst-case assumptions"
|
| D | de.po | 234 msgid "At least 1 texture must fit under worst-case assumptions"
|
| /external/libvorbis/doc/ |
| D | a1-encapsulation-ogg.tex | 171 Failure to do so should, at worst, cause a
|
| /external/bzip2/ |
| D | bzip2.txt | 324 between worst-case and average-case compression time is in
385 sion. Bela Lubkin encouraged me to improve the worst-case
|
| D | bzip2.1.preformatted | 327 between worst‐case and average‐case compression time is in
390 sion. Bela Lubkin encouraged me to improve the worst‐case
|