| /external/zlib/src/examples/ |
| D | enough.c | 207 int least; /* least number of syms to use at this juncture */ in count() local
227 least = (left << 1) - syms; in count()
228 if (least < 0) in count()
229 least = 0; in count()
239 for (use = least; use <= most; use++) { in count()
324 int least; /* least number of syms to use at this juncture */ in examine() local
363 least = (left << 1) - syms; in examine()
364 if (least < 0) in examine()
365 least = 0; in examine()
374 use = least; in examine()
[all …]
|
| /external/llvm/test/MC/AsmParser/ |
| D | floating-literals.s | 60 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one exponent digit
64 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one exponent digit
68 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one exponent digit
72 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one significand digit
76 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one significand digit
|
| /external/libvorbis/vq/ |
| D | bookutil.c | 350 long least=-1; in build_tree_from_lengths() local
356 if(least==-1 || hist[j]<=least){ in build_tree_from_lengths()
357 least=hist[j]; in build_tree_from_lengths()
360 least=-1; in build_tree_from_lengths()
362 if((least==-1 || hist[j]<=least) && membership[j]!=first){ in build_tree_from_lengths()
363 least=hist[j]; in build_tree_from_lengths()
372 least=hist[first]+hist[second]; in build_tree_from_lengths()
376 hist[j]=least; in build_tree_from_lengths()
|
| /external/skia/src/pathops/ |
| D | SkOpCubicHull.cpp | 130 int least = yMin ^ mask; in convexHull() local
133 order[1] = least; in convexHull()
137 if (!rotate(*this, least, most, midPath)) { // ! if cbc[least]==cbc[most] in convexHull()
141 int midSides = side(midPath[yMin].fY - midPath[least].fY); in convexHull()
142 midSides ^= side(midPath[midX].fY - midPath[least].fY); in convexHull()
|
| /external/ceres-solver/docs/source/ |
| D | bibliography.rst | 35 pseudo-inverses and nonlinear least squares problems whose
58 nonlinear problems in least squares**, *Quart. Appl. Math*,
62 preconditioner for large sparse least squares problems**, *SIAM
66 nonlinear least squares problems**, 2004.
71 .. [Marquardt] D.W. Marquardt, **An algorithm for least squares
94 nonlinear least squares problems**, Siam Review, 22(3):318–337,
100 .. [Stigler] S. M. Stigler, **Gauss and the invention of least
|
| D | history.rst | 7 Ceres Solver grew out of the need for general least squares solving at
24 method of least squares to correctly predict when and where the
|
| D | index.rst | 3 You can adapt this file completely to your liking, but it should at least
27 large complicated `nonlinear least squares`_ problems. It is a feature
42 .. _nonlinear least squares: http://en.wikipedia.org/wiki/Non-linear_least_squares
|
| /external/llvm/test/tools/llvm-cov/Inputs/ |
| D | test_-b_-f.output | 34 Taken at least once:100.00% of 4
40 Taken at least once:81.82% of 11
56 Taken at least once:86.67% of 15
|
| D | test_-b.output | 4 Taken at least once:86.67% of 15
|
| /external/skia/gyp/ |
| D | freetype.gyp | 25 # Android provides at least FreeType 2.4.0
48 # Skia's FreeType port requires at least FreeType 2.3.8
60 # Android provides at least FreeType 2.4.0
|
| /external/llvm/test/YAMLParser/ |
| D | sloppy-indentation.data | 11 to be indented with at least one space
15 to be indented with at least one space"
|
| /external/llvm/test/CodeGen/ARM/ |
| D | readcyclecounter.ll | 7 ; possible to disable it, but realistically present on at least every v7-A
8 ; processor (but not on v6, at least by default).
|
| /external/pdfium/testing/resources/javascript/ |
| D | document_methods.in | 149 // Method needs at least one argument.
170 // Method needs at least one argument.
251 // Method requires at least one argument.
262 // Method requires at least one argument.
280 // Method requires at least one argument.
|
| /external/ceres-solver/scripts/ |
| D | ceres-solver.spec | 7 Summary: A non-linear least squares minimizer
35 large complicated nonlinear least squares problems. Features include:
55 Summary: A non-linear least squares minimizer
|
| /external/llvm/docs/ |
| D | HowToBuildOnARM.rst | 29 false alarms (e.g., ARCMT failure) please use at least the following
63 external hard-drives (those are also a lot faster). So, at least, you
68 provide *at least* 4 amperes, this is especially important if you use USB
|
| /external/clang/test/Lexer/ |
| D | string-literal-errors.cpp | 27 #define foo() lots and lots of tokens, need at least 8 to fill up the smallvector buffer #BadThings…
|
| /external/markdown/tests/misc/ |
| D | underscores.txt | 5 Ok, at least _this_ should work.
|
| /external/ceres-solver/ |
| D | README | 1 Ceres Solver - A non-linear least squares minimizer
|
| /external/elfutils/src/ |
| D | THANKS | 1 At least the following have submitted valuable patches:
|
| /external/llvm/test/MC/Disassembler/SystemZ/ |
| D | trunc-01.txt | 2 # Every instruction must be at least two bytes long.
|
| /external/libvorbis/doc/ |
| D | 02-bitpacking.tex | 41 A byte has a well-defined 'least significant' bit (LSb), which is the
55 first), 0-1-2-3 ('little endian' or 'least significant byte first' in
76 integer to the logical bitstream first, followed by next least
79 placing the LSb of the integer to be written into the least
81 the next-least significant bit of the source integer and so on up to
|
| /external/llvm/test/CodeGen/AArch64/ |
| D | arm64-inline-asm-error-M.ll | 4 ; Check for at least one invalid constant.
|
| D | arm64-inline-asm-error-N.ll | 4 ; Check for at least one invalid constant.
|
| /external/llvm/utils/lit/tests/Inputs/shtest-format/ |
| D | argv0.txt | 2 # path. This is important for some tools, in particular '[' which at least on OS
|
| /external/jemalloc/include/jemalloc/ |
| D | jemalloc_defs.h.in | 12 * At least Linux omits the "const" in:
|