/external/glide/third_party/gif_decoder/src/main/java/com/bumptech/glide/gifdecoder/ |
GifDecoder.java | 50 * frame. This method must also be called before you request the first frame or an error will 530 dataSize, first, top, bi, pi; local 561 datum = bits = count = first = top = pi = bi = 0; 607 first = code; 612 pixelStack[top++] = (byte) first; 619 first = ((int) suffix[code]) & 0xff; 620 pixelStack[top++] = (byte) first; 625 suffix[available] = (byte) first;
|
/external/gptfdisk/ |
basicmbr.cc | 246 // partNum = number of first partition in extended partition (normally 4). 349 // First write the main MBR data structure.... 631 // are found, as well as when a single partition in the first 791 // First determine if it can be logical.... 829 // Returns the first sector occupied by any logical partition. Note that 1379 uint64_t first; local [all...] |
/external/guava/guava/src/com/google/common/collect/ |
AbstractMapBasedMultimap.java | 646 public V first() { method in class:AbstractMapBasedMultimap.WrappedSortedSet 648 return getSortedSetDelegate().first(); 997 public K first() { method in class:SortedKeySet [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
AbstractMapBasedMultimap.java | 643 public V first() { method in class:AbstractMapBasedMultimap.WrappedSortedSet 645 return getSortedSetDelegate().first(); 919 public K first() { method in class:SortedKeySet [all...] |
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
ImmutableSortedSetTest.java | 125 set.first(); 173 assertEquals("e", set.first()); 274 assertEquals("b", set.first()); 363 assertEquals("a", set.first());
|
ListsTest.java | 620 List<Integer> first = iterator.next(); local 625 assertEquals(asList(3, 4, 5), first); 628 first.set(1, 6);
|
/external/guava/guava-tests/test/com/google/common/collect/ |
ListsTest.java | 883 List<Integer> first = iterator.next(); local 888 assertEquals(asList(3, 4, 5), first); 891 first.set(1, 6); [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
Normalizer.java | 78 * the canonical composed and decomposed forms as shown in the first example 1654 public int first() { method in class:Normalizer [all...] |
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/lang/ |
UnicodeSetStringSpanTest.java | 32 // Simple test first, easier to debug. 234 next = matchLimit; // First match from start. 332 length = matchStart; // First match from prev. 396 * of the original. When using spanBack() and comparing with span(), use a span condition for the first spanBack() 454 // Default first span condition for going forward with an uncomplemented set. 460 // First span condition for span(), used to terminate the spanBack() iteration. 464 // which is the opposite of span()'s first span condition 714 int c, first; local 715 for (first = c = 0;; c = nextCodePoint(c)) { 718 verifySpanBothUTFs(sets, s.toString(), localWhichSpans, testName, first); [all...] |
/external/icu/icu4c/source/common/ |
uresdata.cpp | 313 int32_t first; local 319 first=*p; 320 if(!U16_IS_TRAIL(first)) { 322 } else if(first<0xdfef) { 323 length=first&0x3ff; 325 } else if(first<0xdfff) { 326 length=((first-0xdfef)<<16)|p[1]; 370 int32_t first=*p; local 371 if (first == 0x2205) { // implicit length 373 } else if (first == 0xdc03) { // explicit length 3 (should not occur [all...] |
/external/icu/icu4c/source/i18n/ |
collationdatabuilder.cpp | 65 * "\0" for the first entry for any code point, with its default CE32. 286 // Reserve the first CE32 for U+0000. 313 // Set the Latin-1 letters block so that it is allocated first in the data array, 551 // First tailoring for c. 705 int64_t first = ces[0]; local 708 if(first == ce64s.elementAti(i)) { 739 int32_t first = newCE32s[0]; local 742 if(first == ce32s.elementAti(i)) { [all...] |
compactdecimalformat.cpp | 91 // first compute log10(x). Compute displayNum = (x / divisors[log10(x)]). 531 // We load the UNUM_SHORT and UNUM_LONG data looking first in local numbering 603 UResourceBundle* first = tryGetByKeyWithFallback(numberSystemResource, style, fillIn, flags, status); local 604 UResourceBundle* second = tryGetByKeyWithFallback(first, gDecimalFormatTag, fillIn, flags, status); 606 ures_close(first); 627 // Example: This code first searches for "foo/bar" sub-resource without falling 828 // Everything up to first 0 is the prefix 892 // First this function figures out for which log10 values, the other
|
numfmt.cpp | 297 UBool first = TRUE; local 299 if (first) { printf("[ "); first = FALSE; } else { printf(", "); } 304 if (first) { printf("[ "); first = FALSE; } else { printf(", "); } 309 if (first) { printf("[ "); first = FALSE; } else { printf(", "); } 313 if (first) { printf("[ "); first = FALSE; } else { printf(", "); } 317 if (first) { printf("[ "); first = FALSE; } else { printf(", "); [all...] |
/external/icu/icu4c/source/test/intltest/ |
numberformat2test.cpp | 1439 AffixPattern first; local [all...] |
/external/icu/icu4c/source/tools/genrb/ |
wrtxml.cpp | 508 /* first print translate attribute */ 1028 int32_t first, index; local 1038 first = (int32_t)(pos - filename + 1); 1040 first = 0; 1042 index = (int32_t)(uprv_strlen(filename) - uprv_strlen(textExt) - first); 1045 uprv_strncpy(originalFileName, filename + first, index); [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
Normalizer.java | 77 * the canonical composed and decomposed forms as shown in the first example 1611 public int first() { method in class:Normalizer [all...] |
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/lang/ |
UnicodeSetStringSpanTest.java | 28 // Simple test first, easier to debug. 230 next = matchLimit; // First match from start. 328 length = matchStart; // First match from prev. 392 * of the original. When using spanBack() and comparing with span(), use a span condition for the first spanBack() 450 // Default first span condition for going forward with an uncomplemented set. 456 // First span condition for span(), used to terminate the spanBack() iteration. 460 // which is the opposite of span()'s first span condition 710 int c, first; local 711 for (first = c = 0;; c = nextCodePoint(c)) { 714 verifySpanBothUTFs(sets, s.toString(), localWhichSpans, testName, first); [all...] |
/external/iproute2/ip/ |
iproute.c | 494 int first = 1; local 500 fprintf(fp, "%s" flname "%s", first ? "<" : "", flags ? "," : "> "); \ 501 first = 0; } 518 fprintf(fp, "%s%x> ", first ? "<" : "", flags); 629 int first = 0; local 639 if (first) [all...] |
/external/ipsec-tools/src/racoon/ |
isakmp.c | 1175 * We have to setup this flag now to correctly generate the first reply. 2971 struct payload_list *ptr = *plist, *first; local [all...] |
/external/jetty/src/java/org/eclipse/jetty/util/ |
MultiPartInputStream.java | 488 // Get first boundary 790 char first=value.charAt(0); local 791 if (first=='"' || first=='\'')
|
/external/jetty/src/java/org/eclipse/jetty/xml/ |
XmlConfiguration.java | 68 * <code>ServiceLoader</code> by using the DTD and first tag element in the file. Note that DTD will be null if validation is off. 1006 int first = 0; local [all...] |
/external/libdrm/ |
xf86drmMode.c | 1568 const drmModeAtomicReqItem *first = misc; local [all...] |
/external/libunwind/src/ia64/ |
Gparser.c | 75 struct ia64_reg_state *copy, *prev = NULL, *first = NULL; local 86 if (first) 89 first = copy; 93 return first; 206 /* First, resolve implicit register save locations (see Section 746 mean that the region behaves exactly like the first RLEN 931 /* check dynamic info first --- it overrides everything else */
|
/external/libxml2/ |
xpointer.c | 207 * @node1: the first node 208 * @index1: the first index 214 * Returns -2 in case of error 1 if first point < second point, 0 if 294 * @range1: the first range 687 * @val1: the first LocationSet 1117 * @name: the preparsed Scheme for the first XPtrPart 1132 * attempt to evaluate the next one, if any. The result of the first 2560 xmlChar first; local [all...] |
/external/llvm/lib/Support/ |
regcomp.c | 271 int first = 1; /* is this the first alternative? */ local 283 if (first) { 287 first = 0; 296 if (!first) { /* tail-end fixups */ 494 * This implementation is a bit of a kludge, in that a trailing $ is first 502 int end1, /* first terminating character */ 506 int first = 1; /* first subexpression? */ local 515 wasdollar = p_simp_re(p, first); [all...] |