/external/chromium_org/chrome/browser/android/banners/ |
H A D | app_banner_utilities.cc | 16 std::vector<int> codes; local 18 codes.push_back(i); 20 DCHECK(std::find(codes.begin(), codes.end(), event) != codes.end()); 21 UMA_HISTOGRAM_CUSTOM_ENUMERATION("AppBanners.DismissEvent", event, codes); 25 std::vector<int> codes; local 27 codes.push_back(i); 29 DCHECK(std::find(codes.begin(), codes 34 std::vector<int> codes; local [all...] |
/external/chromium_org/third_party/re2/re2/ |
H A D | make_unicode_groups.py | 30 def MakeRanges(codes): 34 for c in codes: 49 # def PrintCodes(type, name, codes): 50 # """Print the codes as an array of type named name.""" 52 # for c in codes: 56 def PrintGroup(name, codes): 57 """Print the data structures for the group of codes. 62 # Split codes into 16-bit ranges and 32-bit ranges. 63 range16 = MakeRanges([c for c in codes if c < 65536]) 64 range32 = MakeRanges([c for c in codes i [all...] |
H A D | unicode.py | 132 The reader calls doline(codes, fields) for each entry in the table. 184 codes = _URange(fields[0]) 190 if (len(codes) != 1 or codes[0] <= first or 194 codes = range(first, codes[0] + 1) 197 fields[0] = "%04X..%04X" % (codes[0], codes[-1]) 202 if len(codes) != 1: 205 first = codes[ [all...] |
/external/regex-re2/re2/ |
H A D | make_unicode_groups.py | 30 def MakeRanges(codes): 34 for c in codes: 49 # def PrintCodes(type, name, codes): 50 # """Print the codes as an array of type named name.""" 52 # for c in codes: 56 def PrintGroup(name, codes): 57 """Print the data structures for the group of codes. 62 # Split codes into 16-bit ranges and 32-bit ranges. 63 range16 = MakeRanges([c for c in codes if c < 65536]) 64 range32 = MakeRanges([c for c in codes i [all...] |
H A D | unicode.py | 132 The reader calls doline(codes, fields) for each entry in the table. 184 codes = _URange(fields[0]) 190 if (len(codes) != 1 or codes[0] <= first or 194 codes = range(first, codes[0] + 1) 197 fields[0] = "%04X..%04X" % (codes[0], codes[-1]) 202 if len(codes) != 1: 205 first = codes[ [all...] |
/external/valgrind/main/drd/scripts/ |
H A D | download-and-build-splash2 | 37 diff -ru orig/splash2/codes/apps/radiosity/display.C splash2/codes/apps/radiosity/display.C 38 --- orig/splash2/codes/apps/radiosity/display.C 2008-05-25 10:38:52.000000000 +0200 39 +++ splash2/codes/apps/radiosity/display.C 2008-05-25 10:37:51.000000000 +0200 48 --- orig/splash2/codes/apps/radiosity/Makefile 2008-05-25 10:38:52.000000000 +0200 49 +++ splash2/codes/apps/radiosity/Makefile 2008-05-25 13:05:36.000000000 +0200 67 diff -ru orig/splash2/codes/apps/raytrace/rltotiff/Makefile splash2/codes/apps/raytrace/rltotiff/Makefile 68 --- orig/splash2/codes/apps/raytrace/rltotiff/Makefile 2008-05-25 10:38:52.000000000 +0200 69 +++ splash2/codes/app [all...] |
H A D | download-and-build-splash2.in | 37 diff -ru orig/splash2/codes/apps/radiosity/display.C splash2/codes/apps/radiosity/display.C 38 --- orig/splash2/codes/apps/radiosity/display.C 2008-05-25 10:38:52.000000000 +0200 39 +++ splash2/codes/apps/radiosity/display.C 2008-05-25 10:37:51.000000000 +0200 48 --- orig/splash2/codes/apps/radiosity/Makefile 2008-05-25 10:38:52.000000000 +0200 49 +++ splash2/codes/apps/radiosity/Makefile 2008-05-25 13:05:36.000000000 +0200 67 diff -ru orig/splash2/codes/apps/raytrace/rltotiff/Makefile splash2/codes/apps/raytrace/rltotiff/Makefile 68 --- orig/splash2/codes/apps/raytrace/rltotiff/Makefile 2008-05-25 10:38:52.000000000 +0200 69 +++ splash2/codes/app [all...] |
/external/smack/src/org/xbill/DNS/ |
H A D | EDNSOption.java | 25 private static Mnemonic codes = new Mnemonic("EDNS Option Codes", field in class:EDNSOption.Code 29 codes.setMaximum(0xFFFF); 30 codes.setPrefix("CODE"); 31 codes.setNumericAllowed(true); 33 codes.add(NSID, "NSID"); 34 codes.add(CLIENT_SUBNET, "CLIENT_SUBNET"); 42 return codes.getText(code); 53 return codes.getValue(s);
|
/external/chromium_org/third_party/zlib/ |
H A D | inftrees.h | 39 1444, which is the sum of 852 for literal/length codes and 592 for distance 40 codes. These values were found by exhaustive searches using the program 43 maximum bit length of a code. "enough 286 9 15" for literal/length codes 44 returns returns 852, and "enough 30 6 15" for distance codes returns 592. 61 unsigned codes, code FAR * FAR *table,
|
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
H A D | inftrees.h | 39 1444, which is the sum of 852 for literal/length codes and 592 for distance 40 codes. These values were found by exhaustive searches using the program 43 maximum bit length of a code. "enough 286 9 15" for literal/length codes 44 returns returns 852, and "enough 30 6 15" for distance codes returns 592. 61 unsigned codes, code FAR * FAR *table,
|
/external/qemu/distrib/zlib-1.2.8/ |
H A D | inftrees.h | 39 1444, which is the sum of 852 for literal/length codes and 592 for distance 40 codes. These values were found by exhaustive searches using the program 43 maximum bit length of a code. "enough 286 9 15" for literal/length codes 44 returns returns 852, and "enough 30 6 15" for distance codes returns 592. 61 unsigned codes, code FAR * FAR *table,
|
/external/zlib/src/contrib/infback9/ |
H A D | inflate9.h | 30 Read deflate codes: 43 code FAR *next; /* next available space in codes[] */ 46 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
|
H A D | inftree9.h | 39 1446, which is the sum of 852 for literal/length codes and 594 for distance 40 codes. These values were found by exhaustive searches using the program 43 maximum bit length of a code. "enough 286 9 15" for literal/length codes 44 returns returns 852, and "enough 32 6 15" for distance codes returns 594. 60 unsigned codes, code FAR * FAR *table,
|
/external/zlib/src/ |
H A D | inftrees.h | 39 1444, which is the sum of 852 for literal/length codes and 592 for distance 40 codes. These values were found by exhaustive searches using the program 43 maximum bit length of a code. "enough 286 9 15" for literal/length codes 44 returns returns 852, and "enough 30 6 15" for distance codes returns 592. 61 unsigned codes, code FAR * FAR *table,
|
/external/libexif/libexif/ |
H A D | exif-log.c | 42 } codes[] = { variable in typeref:struct:__anon23665 57 for (i = 0; codes[i].title; i++) if (codes[i].code == code) break; 58 return _(codes[i].title); 66 for (i = 0; codes[i].message; i++) if (codes[i].code == code) break; 67 return _(codes[i].message);
|
/external/qemu/distrib/sdl-1.2.15/src/video/Xext/extensions/ |
H A D | extutil.h | 51 XExtCodes *codes; /* the extension protocol codes */ member in struct:_XExtDisplayInfo 66 XExtCodes* /* codes */ 73 XExtCodes* /* codes */ 80 XExtCodes* /* codes */ 87 XExtCodes* /* codes */ 94 XExtCodes* /* codes */ 101 XExtCodes* /* codes */ 107 XExtCodes* /* codes */ 128 XExtCodes* /* codes */, [all...] |
/external/fonttools/Lib/fontTools/ |
H A D | unicode.py | 22 self.codes = _makeunicodes(f) 26 return self.codes[charCode]
|
/external/fonttools/Tools/fontTools/ |
H A D | unicode.py | 22 self.codes = _makeunicodes(f) 26 return self.codes[charCode]
|
/external/chromium_org/third_party/libwebp/utils/ |
H A D | huffman_encode.h | 26 uint8_t extra_bits; // extra bits for escape codes 29 // Struct to represent the tree codes (depth and bits array). 33 uint16_t* codes; // Symbol Codes. member in struct:__anon13299
|
H A D | huffman.c | 233 int* const codes, 264 memset(codes, 0, code_lengths_size * sizeof(*codes)); 267 codes)) { 274 if (!TreeAddSymbol(tree, symbol, codes[symbol], 290 const int* const codes, 297 assert(codes != NULL); 305 if (codes[i] != NON_EXISTENT_SYMBOL) { 309 if (!TreeAddSymbol(tree, symbols[i], codes[i], code_lengths[i])) { 231 VP8LHuffmanTreeBuildImplicit(HuffmanTree* const tree, const int* const code_lengths, int* const codes, int code_lengths_size) argument 288 VP8LHuffmanTreeBuildExplicit(HuffmanTree* const tree, const int* const code_lengths, const int* const codes, const int* const symbols, int max_symbol, int num_symbols) argument
|
/external/webp/src/utils/ |
H A D | huffman_encode.h | 26 uint8_t extra_bits; // extra bits for escape codes 29 // Struct to represent the tree codes (depth and bits array). 33 uint16_t* codes; // Symbol Codes. member in struct:__anon33396
|
/external/guava/guava-tests/test/com/google/common/hash/ |
H A D | AbstractNonStreamingHashFunctionTest.java | 35 HashCode[] codes = new HashCode[hashers.size()]; 37 codes[i] = hashers.get(i).hash(); 39 for (int i = 1; i < codes.length; i++) { 40 assertEquals(codes[i - 1], codes[i]);
|
/external/chromium_org/third_party/re2/re2/testing/ |
H A D | unicode_test.py | 87 def DoLine(codes, fields): 92 self.assertEquals([0x0041], codes) 96 self.assertEquals(range(0x0061, 0x007A + 1), codes) 100 self.assertEquals(range(0x1F00, 0x1FFE + 1), codes) 104 self.assertEquals([0x10FFFF], codes) 108 self.assertEquals([0x0000], codes) 158 for script, codes in self.scripts.items(): 159 for code in codes: 178 for category, codes in self.categories.items(): 179 for code in codes [all...] |
/external/regex-re2/re2/testing/ |
H A D | unicode_test.py | 87 def DoLine(codes, fields): 92 self.assertEquals([0x0041], codes) 96 self.assertEquals(range(0x0061, 0x007A + 1), codes) 100 self.assertEquals(range(0x1F00, 0x1FFE + 1), codes) 104 self.assertEquals([0x10FFFF], codes) 108 self.assertEquals([0x0000], codes) 158 for script, codes in self.scripts.items(): 159 for code in codes: 178 for category, codes in self.categories.items(): 179 for code in codes [all...] |
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/coff/ |
H A D | coff-objfmt.h | 48 yasm_value off; /* Offset expression (used for some codes) */ 60 /* Linked list of codes, in decreasing location offset order. 64 SLIST_HEAD(coff_unwind_code_head, coff_unwind_code) codes; member in struct:coff_unwind_info
|