| /external/icu4c/test/intltest/ |
| usettest.cpp | [all...] |
| /external/qemu/distrib/zlib-1.2.3/ |
| inftrees.c | 30 longest code or if it is less than the shortest code.
81 for the first code of the shortest length, and the codes are integer
|
| /external/zlib/src/contrib/infback9/ |
| inftree9.c | 30 longest code or if it is less than the shortest code.
83 for the first code of the shortest length, and the codes are integer
|
| /external/zlib/src/ |
| inftrees.c | 30 longest code or if it is less than the shortest code.
81 for the first code of the shortest length, and the codes are integer
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/test/ |
| core-extensions.rb | 51 # Returns the shortest length of leading whitespace for all non-blank lines
|
| /external/chromium/base/third_party/icu/ |
| icu_utf.cc | 184 * Starting with Unicode 3.0.1, non-shortest forms are illegal.
|
| /external/chromium/base/ |
| utf_string_conversions_unittest.cc | 82 // Non-shortest-form UTF-8.
|
| /external/openfst/src/include/fst/ |
| weight.h | 126 // Algorithms for Shortest-Distance Problems", Journal of Automata,
|
| rmepsilon.h | 42 #include <fst/shortest-distance.h>
135 // Shortest distance algorithm computation state.
224 // The vector 'distance' will be used to hold the shortest distances
|
| /external/regex-re2/re2/testing/ |
| filtered_re2_test.cc | 92 // substring in an OR are removed; that is, only the shortest
|
| /external/v8/test/cctest/ |
| test-bignum-dtoa.cc | 38 #include "gay-shortest.h"
|
| test-dtoa.cc | 38 #include "gay-shortest.h"
|
| /external/webkit/Source/WebCore/platform/graphics/gpu/ |
| LoopBlinnLocalTriangulator.h | 202 // - If the convex hull is a quadrilateral, then the shortest edge
|
| LoopBlinnLocalTriangulator.cpp | 210 // diagonals intersect. Note that we choose the shortest diagonal
|
| /packages/apps/Exchange/exchange2/src/com/android/exchange/adapter/ |
| Search.java | 51 // The shortest search query we'll accept
|
| /external/v8/src/ |
| bignum-dtoa.cc | 74 // digits yield the shortest decimal representation of v.
160 // when the generated digits yield the shortest decimal representation of v. A
571 // optionally (used by GenerateShortestDigits to decide if it has the shortest
|
| fast-dtoa.cc | 360 // * buffer contains the shortest possible decimal digit-sequence
594 // The digits in the buffer are the shortest representation possible: no
661 // number of digits. This version does not generate the shortest representation,
|
| /frameworks/base/location/java/android/location/ |
| Location.java | 391 * shortest path between them. Distance and bearing are defined using the
443 * North when traveling along the shortest path between this
444 * location and the given location. The shortest path is defined
|
| /external/grub/stage2/ |
| gunzip.c | 404 shortest codes, so those codes dominate the decoding time, and hence
416 bits is used, or when the shortest code is *longer* than the requested
417 table size, in which case the length of the shortest code in bits is
620 /* go through the bit lengths (k already is bits in shortest code) */
[all...] |
| /external/icu4c/i18n/unicode/ |
| bms.h | 25 * compute the length of the shortest string that can
|
| /external/icu4c/test/cintltst/ |
| trie2test.c | 353 0xc0, 0x80, /* non-shortest U+0000 */
354 0xc1, 0xbf, /* non-shortest U+007f */
356 0xe0, 0x90, 0x80, /* non-shortest U+0400 */
360 0xf0, 0x8f, 0xbf, 0xbf, /* non-shortest U+ffff */
[all...] |
| /external/libpng/contrib/gregbook/ |
| README | 185 All options can be abbreviated to the shortest unique value; for example,
|
| /external/wpa_supplicant_8/src/wps/ |
| upnp_xml.c | 113 * do not represent unicode chars or are not the shortest encoding.
|
| /packages/apps/Gallery2/gallerycommon/src/com/android/gallery3d/common/ |
| Utils.java | 222 // shortest path to change source to target.
|
| /external/zlib/src/examples/ |
| enough.c | 57 the log2 of the number of symbols), where the shortest code has more bits
58 than root. In that case, root is increased to the length of the shortest
|
