| /packages/apps/Email/tests/src/com/android/email/mail/store/imap/ |
| ImapResponseParserTest.java | 82 "103 OK\r\n" + // shortest OK
83 "* a\r\n" // shortest response
|
| /bionic/libc/bionic/ |
| mbrtoc32.cpp | 74 // detect redundant, non-"shortest form" encodings. For
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_bvgraph.h | 144 // Same as findPath, but finds a shortest path.
|
| /external/freetype/src/gzip/ |
| inftrees.c | 65 shortest codes, so those codes dominate the decoding time, and hence
77 bits is used, or when the shortest code is *longer* than the requested
78 table size, in which case the length of the shortest code in bits is
207 /* go through the bit lengths (k already is bits in shortest code) */
|
| /external/icu/icu4j/main/classes/charset/src/com/ibm/icu/charset/ |
| UConverterConstants.java | 126 Also, starting with Unicode 3.0.1, non-shortest byte sequences
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/gzip/ |
| inftrees.c | 65 shortest codes, so those codes dominate the decoding time, and hence
77 bits is used, or when the shortest code is *longer* than the requested
78 table size, in which case the length of the shortest code in bits is
207 /* go through the bit lengths (k already is bits in shortest code) */
|
| /external/libgdx/gdx/src/com/badlogic/gdx/assets/loaders/resolvers/ |
| ResolutionFileResolver.java | 105 // Prefer the shortest side.
|
| /external/libweave/third_party/chromium/base/strings/ |
| string_util_unittest.cc | 82 // is invalid UTF-8 since UTF-8 states that the shortest encoding for a
|
| /external/llvm/include/llvm/Passes/ |
| PassBuilder.h | 68 /// the shortest stack of pass managers that allow inserting that first pass.
|
| /external/llvm/lib/Target/Mips/ |
| MipsAnalyzeImmediate.cpp | 150 // Set Insts to the shortest instruction sequence.
|
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/lz/ |
| HC4.java | 45 // Substracting 1 because the shortest match that this match
|
| /external/pcre/dist/doc/html/ |
| pcre_dfa_exec.html | 92 PCRE_DFA_SHORTEST Return only the shortest match
|
| /external/pcre/dist/doc/ |
| pcre_dfa_exec.3 | 78 PCRE_DFA_SHORTEST Return only the shortest match
|
| /external/proguard/src/proguard/classfile/instruction/ |
| SimpleInstruction.java | 139 // Reconstruct the opcode of the shortest instruction, if there are
|
| /external/proguard/src/proguard/shrink/ |
| ShortestUsageMarker.java | 30 * shortest chain of dependencies.
|
| /external/webrtc/webrtc/base/ |
| fileutils_mock.h | 109 // find shortest non-trivial common path. (ex. /var/lib/dir)
|
| /external/zopfli/src/zopfli/ |
| lz77.h | 88 are used, the first 3 are ignored (the shortest length is 3. It is purely
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/sys/ |
| gmon.h | 77 * For example, on the VAX, the shortest two call sequence is:
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| list_partition.h | 95 * longest and the shortest part is bounded by
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/i386-linux-gnu/sys/ |
| gmon.h | 77 * For example, on the VAX, the shortest two call sequence is:
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/x86_64-linux-gnu/sys/ |
| gmon.h | 77 * For example, on the VAX, the shortest two call sequence is:
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| list_partition.h | 95 * longest and the shortest part is bounded by
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| list_partition.h | 95 * longest and the shortest part is bounded by
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| list_partition.h | 95 * longest and the shortest part is bounded by
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setools/ |
| dta.py | 91 Generator which yields one shortest domain transition path
110 self.log.info("Generating one shortest path from {0} to {1}...".format(s, t))
159 Generator which yields all shortest domain transition paths
178 self.log.info("Generating all shortest paths from {0} to {1}...".format(s, t))
|
