Searched refs:codes (Results 1 - 25 of 131) sorted by relevance

123456

/external/chromium_org/third_party/re2/re2/
H A Dmake_unicode_groups.py30 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 Dunicode.py132 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 Dmake_unicode_groups.py30 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 Dunicode.py132 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/dropbear/libtomcrypt/src/misc/base64/
H A Dbase64_encode.c21 static const char *codes = variable
51 *p++ = codes[(in[0] >> 2) & 0x3F];
52 *p++ = codes[(((in[0] & 3) << 4) + (in[1] >> 4)) & 0x3F];
53 *p++ = codes[(((in[1] & 0xf) << 2) + (in[2] >> 6)) & 0x3F];
54 *p++ = codes[in[2] & 0x3F];
62 *p++ = codes[(a >> 2) & 0x3F];
63 *p++ = codes[(((a & 3) << 4) + (b >> 4)) & 0x3F];
64 *p++ = (i+1 < inlen) ? codes[(((b & 0xf) << 2)) & 0x3F] : '=';
/external/valgrind/main/drd/scripts/
H A Ddownload-and-build-splash2.in37 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 DEDNSOption.java25 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/libwebp/utils/
H A Dhuffman_encode.h26 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:__anon11628
H A Dhuffman.c178 // Get Huffman codes from the code lengths.
179 int* const codes = local
180 (int*)WebPSafeMalloc((uint64_t)code_lengths_size, sizeof(*codes));
181 if (codes == NULL) goto End;
183 if (!HuffmanCodeLengthsToCodes(code_lengths, code_lengths_size, codes)) {
190 if (!TreeAddSymbol(tree, symbol, codes[symbol], code_lengths[symbol])) {
197 free(codes);
206 const int* const codes,
214 assert(codes != NULL);
222 if (codes[
204 HuffmanTreeBuildExplicit(HuffmanTree* const tree, const int* const code_lengths, const int* const codes, const int* const symbols, int max_symbol, int num_symbols) argument
[all...]
H A Dhuffman.h60 // Build a Huffman tree with explicitly given lists of code lengths, codes
65 const int* const codes,
69 // Utility: converts Huffman code lengths to corresponding Huffman codes.
71 // Returns false in case of error (memory allocation, invalid codes).
/external/chromium_org/third_party/zlib/
H A Dinftrees.h39 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.3/
H A Dinftrees.h54 unsigned codes, code FAR * FAR *table,
/external/webp/src/utils/
H A Dhuffman_encode.h26 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:__anon28023
H A Dhuffman.c178 // Get Huffman codes from the code lengths.
179 int* const codes = local
180 (int*)WebPSafeMalloc((uint64_t)code_lengths_size, sizeof(*codes));
181 if (codes == NULL) goto End;
183 if (!HuffmanCodeLengthsToCodes(code_lengths, code_lengths_size, codes)) {
190 if (!TreeAddSymbol(tree, symbol, codes[symbol], code_lengths[symbol])) {
197 free(codes);
206 const int* const codes,
214 assert(codes != NULL);
222 if (codes[
204 HuffmanTreeBuildExplicit(HuffmanTree* const tree, const int* const code_lengths, const int* const codes, const int* const symbols, int max_symbol, int num_symbols) argument
[all...]
H A Dhuffman.h60 // Build a Huffman tree with explicitly given lists of code lengths, codes
65 const int* const codes,
69 // Utility: converts Huffman code lengths to corresponding Huffman codes.
71 // Returns false in case of error (memory allocation, invalid codes).
/external/zlib/src/contrib/infback9/
H A Dinflate9.h30 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 Dinftree9.h39 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 Dinftrees.h39 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/sdl-1.2.15/src/video/Xext/extensions/
H A Dextutil.h51 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/guava/guava-tests/test/com/google/common/hash/
H A DAbstractNonStreamingHashFunctionTest.java35 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 Dunicode_test.py87 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 Dunicode_test.py87 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/chrome/browser/resources/file_manager/js/metadata/
H A Dbyte_reader.js88 var codes = [];
91 codes.push(dataView.getUint8(pos + i));
93 return String.fromCharCode.apply(null, codes);
111 var codes = [];
116 codes.push(code);
119 return String.fromCharCode.apply(null, codes);
147 var codes = [];
152 codes.push(code);
155 return String.fromCharCode.apply(null, codes);
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/coff/
H A Dcoff-objfmt.h48 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
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/
H A Djsdifflib.js317 var codes = this.get_opcodes();
318 if (!codes) codes = [["equal", 0, 1, 0, 1]];
320 if (codes[0][0] == 'equal') {
321 code = codes[0];
327 codes[0] = [tag, Math.max(i1, i2 - n), i2, Math.max(j1, j2 - n), j2];
329 if (codes[codes.length - 1][0] == 'equal') {
330 code = codes[codes
[all...]

Completed in 1132 milliseconds

123456