| /external/libchrome/sandbox/linux/bpf_dsl/ |
| policy_compiler.h | 82 UPPER,
|
| /device/huawei/angler/camera/QCamera2/stack/mm-jpeg-interface/src/ |
| mm_jpeg_exif.c | 38 #define UPPER(a) (((a)>>16) & 0xFFFF)
|
| /device/lge/bullhead/camera/QCamera2/stack/mm-jpeg-interface/src/ |
| mm_jpeg_exif.c | 38 #define UPPER(a) (((a)>>16) & 0xFFFF)
|
| /external/guava/guava-tests/test/com/google/common/base/ |
| AsciiTest.java | 33 * The Unicode points {@code 00c1} and {@code 00e1} are the upper- and
39 private static final String UPPER = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
42 assertEquals(LOWER, Ascii.toLowerCase(UPPER));
49 assertEquals(UPPER, Ascii.toUpperCase(LOWER));
50 assertSame(UPPER, Ascii.toUpperCase(UPPER));
76 for (char c : UPPER.toCharArray()) {
128 assertTrue(Ascii.equalsIgnoreCase(LOWER, UPPER));
129 assertTrue(Ascii.equalsIgnoreCase(UPPER, LOWER));
|
| /hardware/qcom/camera/QCamera2/stack/mm-jpeg-interface/src/ |
| mm_jpeg_exif.c | 41 #define UPPER(a) (((a)>>16) & 0xFFFF)
|
| /device/moto/shamu/camera/QCamera2/stack/mm-jpeg-interface/src/ |
| mm_jpeg_exif.c | 38 #define UPPER(a) (((a)>>16) & 0xFFFF)
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| CollationKey.java | 106 * Upper bound that will match strings of exact size
108 public static final int UPPER = 1;
111 * Upper bound that will match all the strings that have the same
359 * between upper and lower bounds. For example, if bounds are produced
360 * for a sortkey of string "smith", strings between upper and lower
363 * There are two upper bounds that can be produced. If BoundMode.UPPER
375 * produces a lower inclusive bound, BoundMode.UPPER, that
376 * produces upper bound that matches strings of the same
441 case BoundMode.UPPER: // =
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| CollationKey.java | 108 * Upper bound that will match strings of exact size
111 public static final int UPPER = 1;
114 * Upper bound that will match all the strings that have the same
370 * between upper and lower bounds. For example, if bounds are produced
371 * for a sortkey of string "smith", strings between upper and lower
374 * There are two upper bounds that can be produced. If BoundMode.UPPER
386 * produces a lower inclusive bound, BoundMode.UPPER, that
387 * produces upper bound that matches strings of the same
453 case BoundMode.UPPER: // =
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/io/ |
| OutputStreamWriterTest.java | 36 private static final int UPPER = 0xd800;
455 int upper = UPPER; local
458 upper = 128;
461 upper = 256;
465 for (int c = 0; c < upper; ++c) {
473 for (int expected = 0; expected < upper; ++expected) {
498 int upper = UPPER; local
501 upper = 128
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| UCaseProps.java | 191 if(getTypeFromProps(props)>=UPPER) {
457 /** @return NONE, LOWER, UPPER, TITLE */
817 if(getTypeFromProps(props)>=UPPER) {
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| UCaseProps.java | 187 if(getTypeFromProps(props)>=UPPER) {
453 /** @return NONE, LOWER, UPPER, TITLE */
813 if(getTypeFromProps(props)>=UPPER) {
[all...] |
| /external/cblas/testing/ |
| c_cblat2.f | [all...] |
| c_cblat3.f | [all...] |
| c_dblat2.f | [all...] |
| c_dblat3.f | [all...] |
| c_sblat2.f | [all...] |
| c_sblat3.f | [all...] |
| c_zblat2.f | [all...] |
| c_zblat3.f | [all...] |
| /external/eigen/blas/testing/ |
| cblat2.f | [all...] |
| cblat3.f | [all...] |
| dblat2.f | [all...] |
| dblat3.f | [all...] |
| sblat2.f | [all...] |
| sblat3.f | [all...] |
