| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| queue.h | 60 SHORTEST_FIRST_QUEUE = 3, // Shortest-first queue
187 // Shortest-first queue discipline, templated on the StateId and
263 // Shortest-first queue discipline, templated on the StateId and Weight is
503 // shortest-first queue using the natural order w.r.t to the distance.
570 ": using shortest-first discipline";
|
| rmepsilon.h | 35 #include "fst/lib/shortest-distance.h"
118 // Shortest distance algorithm computation state.
198 // The vector 'distance' will be used to hold the shortest distances
|
| weight.h | 116 // "Semiring Framework and Algorithms for Shortest-Distance Problems",
|
| /frameworks/base/docs/html/guide/topics/manifest/ |
| supports-screens-element.jd | 132 <dd>Specifies the minimum smallestWidth required. The smallestWidth is the shortest dimension of
134 the shortest of the available screen's two dimensions. So, in order for a device to be considered
141 the smallestWidth because they are the shortest dimension of the screen's available space.</p>
|
| /packages/apps/Email/src/com/android/email/ |
| SecurityPolicy.java | 350 * password will be set to expire in the shortest required interval (most secure). This method
353 * based on the requirements of the account with the shortest interval.
743 * password will be set to expire in the shortest required interval (most secure). The logic
[all...] |
| /external/chromium/chrome/browser/ |
| process_singleton_win.cc | 221 // We should have enough room for the shortest command (min_message_size)
222 // and also be a multiple of wchar_t bytes. The shortest command
|
| /external/chromium/testing/gtest/test/ |
| gtest_output_test.py | 107 # *? means "find the shortest string that matches".
115 # *? means "find the shortest string that matches".
|
| /external/gtest/test/ |
| gtest_output_test.py | 107 # *? means "find the shortest string that matches".
115 # *? means "find the shortest string that matches".
|
| /external/libvpx/libvpx/third_party/googletest/src/test/ |
| gtest_output_test.py | 107 # *? means "find the shortest string that matches".
115 # *? means "find the shortest string that matches".
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| pdtscript.h | 32 #include <fst/script/shortest-path.h>
39 #include <fst/extensions/pdt/shortest-path.h>
|
| /external/openfst/src/lib/ |
| properties.cc | 359 // Properties for shortest path. This function computes how the properties
360 // of the output of shortest path need to be updated, given that 'props' is
|
| /external/protobuf/gtest/test/ |
| gtest_output_test.py | 108 # *? means "find the shortest string that matches".
116 # *? means "find the shortest string that matches".
|
| /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
|
| /external/clang/utils/ |
| CmpDriver | 39 # Normalize so a is shortest.
|
| /external/llvm/lib/Target/Mips/ |
| MipsAnalyzeImmediate.cpp | 149 // Set Insts to the shortest instruction sequence.
|
| /external/marisa-trie/tools/ |
| marisa-find.cc | 30 " -f, --find-first find a shortest prefix key\n"
|
| /external/marisa-trie/v0_1_5/tools/ |
| marisa_alpha-find.cc | 30 " -f, --find-first find a shortest prefix key\n"
|
| /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/v8/test/cctest/ |
| SConscript | 53 'gay-shortest.cc',
|
| /external/webkit/Source/WebCore/storage/ |
| StorageMap.cpp | 64 // can take the shortest route.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| list_partition.h | 94 * longest and the shortest part is bounded by @f$
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/sys/ |
| gmon.h | 77 * For example, on the VAX, the shortest two call sequence is:
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/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.7-4.6/sysroot/usr/include/sys/ |
| gmon.h | 77 * For example, on the VAX, the shortest two call sequence is:
|
