| /toolchain/binutils/binutils-2.25/gprof/ |
| gmon.h | 104 * For the VAX, the shortest two call sequence is:
|
| /external/icu/icu4c/source/test/intltest/ |
| usettest.cpp | [all...] |
| /external/icu/icu4j/eclipse-build/plugins.template/com.ibm.icu.base/src/com/ibm/icu/impl/locale/ |
| LanguageTag.java | 128 * language = 2*3ALPHA ; shortest ISO 639 code
563 // language = 2*3ALPHA ; shortest ISO 639 code
|
| /external/opencv3/3rdparty/zlib/ |
| 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/pcre/dist/doc/html/ |
| pcrematching.html | 82 algorithm returns the first one that it finds. Whether this is the shortest,
115 first match (which is necessarily the shortest) is found.
|
| /external/pdfium/third_party/zlib_v128/ |
| 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/v8/test/cctest/ |
| cctest.gyp | 96 'gay-shortest.cc',
290 # MSVS wants this for gay-{precision,shortest}.cc.
|
| /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/boringssl/src/include/openssl/ |
| base64.h | 170 * (in input bytes) or the shortest input line
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/ |
| PKG-INFO | 11 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph.egg-info/ |
| PKG-INFO | 11 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| /external/clang/utils/ |
| CmpDriver | 44 # Normalize so a is shortest.
|
| /external/libchrome/base/strings/ |
| utf_string_conversions_unittest.cc | 85 // Non-shortest-form UTF-8.
|
| /external/libchrome/base/third_party/icu/ |
| icu_utf.cc | 183 * Starting with Unicode 3.0.1, non-shortest forms are illegal.
|
| /external/libweave/third_party/chromium/base/third_party/icu/ |
| icu_utf.cc | 188 * Starting with Unicode 3.0.1, non-shortest forms are illegal.
|
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/lz/ |
| BT4.java | 37 // Substracting 1 because the shortest match that this match
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_defines.h | [all...] |
| /external/regex-re2/re2/testing/ |
| filtered_re2_test.cc | 92 // substring in an OR are removed; that is, only the shortest
|
| /frameworks/base/core/java/android/util/ |
| MathUtils.java | 164 * travel is determined by the shortest angle between the start and end
|
| /frameworks/base/core/java/com/android/internal/widget/ |
| NotificationActionListLayout.java | 106 // Measure shortest children first. To avoid measuring twice, we approximate by looking
|
| /prebuilts/go/darwin-x86/src/path/ |
| path.go | 50 // Clean returns the shortest path name equivalent to path
|
| /prebuilts/go/linux-x86/src/path/ |
| path.go | 50 // Clean returns the shortest path name equivalent to path
|
| /external/opencv3/modules/shape/src/ |
| sc_dis.cpp | 635 // Dijkstra shortest path algorithm.
636 // runs until unassigned column added to shortest path tree.
698 // if unassigned, shortest augmenting path is complete.
|
