/development/samples/browseable/MultiWindowPlayground/ |
AndroidManifest.xml | 45 (500dp at its shortest side). It is launched in the top/end (top/right) corner by default.
|
/external/libutf/ |
utf.7 | 90 the shortest encoding is used.
|
/external/v8/tools/testrunner/network/ |
distro.py | 61 # Convert |shells| to list and sort it, shortest total_duration first.
|
/packages/apps/Camera2/src/com/android/camera/ui/ |
CaptureAnimationOverlay.java | 97 * @param shortFlash show shortest possible flash instead of regular long version.
|
/prebuilts/go/darwin-x86/src/unicode/utf8/ |
utf8.go | 220 // out of range, or is not the shortest possible UTF-8 encoding for the 232 // out of range, or is not the shortest possible UTF-8 encoding for the 245 // out of range, or is not the shortest possible UTF-8 encoding for the 284 // out of range, or is not the shortest possible UTF-8 encoding for the
|
/prebuilts/go/linux-x86/src/unicode/utf8/ |
utf8.go | 220 // out of range, or is not the shortest possible UTF-8 encoding for the 232 // out of range, or is not the shortest possible UTF-8 encoding for the 245 // out of range, or is not the shortest possible UTF-8 encoding for the 284 // out of range, or is not the shortest possible UTF-8 encoding for the
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setools/ |
infoflow.py | 95 Generator which yields one shortest path between the source 116 self.log.info("Generating one shortest path from {0} to {1}...".format(s, t)) 170 Generator which yields all shortest paths between the source 191 self.log.info("Generating all shortest paths from {0} to {1}...".format(s, t))
|
/system/bt/service/common/bluetooth/ |
uuid.h | 76 // Returns the shortest possible representation of this UUID in bytes.
|
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/i386/ |
bundle.s | 104 # to its shortest form, and one that must use the long form.
|
x86-64-bundle.s | 108 # to its shortest form, and one that must use the long form.
|
/external/guava/guava/src/com/google/common/base/ |
Utf8.java | 30 * <a href="http://www.unicode.org/versions/corrigendum1.html">"non-shortest form"</a> byte 104 * decoded. For example, some versions of the JDK decoder will accept "non-shortest form" byte
|
/external/v8/test/cctest/ |
test-fast-dtoa.cc | 38 #include "test/cctest/gay-shortest.h" 288 // success rate than for the shortest representation.
|
/external/autotest/tko/perf_upload/ |
perf_uploader.py | 274 serve as the shortest unambiguous names for each (as described here: 283 Chrome version: 27.0.1452.2 (shortest unambiguous name: 1452.2) 284 ChromeOS version: 27.3906.0.0 (shortest unambiguous name: 3906.0.0)
|
/external/tcpdump/ |
INSTALL.txt | 96 ospf.h - Open Shortest Path First definitions 159 print-ospf.c - Open Shortest Path First printer routines 160 print-ospf6.c - IPv6 Open Shortest Path First printer routines
|
/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>
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib-dynload/ |
itertools.so | |
/packages/apps/Email/provider_src/com/android/email/ |
SecurityPolicy.java | 310 * password will be set to expire in the shortest required interval (most secure). This method 313 * based on the requirements of the account with the shortest interval. [all...] |
/external/google-breakpad/src/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/icu/android_icu4j/src/main/tests/android/icu/dev/test/lang/ |
UnicodeSetStringSpanTest.java | 231 // Iterate for the shortest match at each position. 232 // Recurse for each but the shortest match. 237 // Remember shortest match from start for iteration. 242 // Recurse for non-shortest match from start. 329 // Iterate for the shortest match at each position. 330 // Recurse for each but the shortest match. 335 // Remember shortest match from prev for iteration. 340 // Recurse for non-shortest match from prev. [all...] |
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/lang/ |
UnicodeSetStringSpanTest.java | 227 // Iterate for the shortest match at each position. 228 // Recurse for each but the shortest match. 233 // Remember shortest match from start for iteration. 238 // Recurse for non-shortest match from start. 325 // Iterate for the shortest match at each position. 326 // Recurse for each but the shortest match. 331 // Remember shortest match from prev for iteration. 336 // Recurse for non-shortest match from prev. [all...] |
/external/pcre/dist/doc/ |
pcrematching.3 | 65 algorithm returns the first one that it finds. Whether this is the shortest, 97 first match (which is necessarily the shortest) is found.
|
/external/protobuf/gtest/test/ |
gtest_output_test.py | 109 # *? means "find the shortest string that matches". 117 # *? means "find the shortest string that matches".
|
/external/vulkan-validation-layers/tests/gtest-1.7.0/test/ |
gtest_output_test.py | 107 # *? means "find the shortest string that matches". 115 # *? means "find the shortest string that matches".
|
/ndk/sources/third_party/googletest/googletest/test/ |
gtest_output_test.py | 107 # *? means "find the shortest string that matches". 115 # *? means "find the shortest string that matches".
|