| /external/regex-re2/re2/ |
| 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 if c >= 65536]
[all...] |
| 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[0
[all...] |
| /external/brotli/java/org/brotli/dec/ |
| HuffmanTreeGroup.java | 22 int[] codes; field in class:HuffmanTreeGroup
25 * Offsets of distinct lookup tables in {@link #codes} storage.
34 * @param n number of Huffman codes
38 group.codes = new int[n * Huffman.HUFFMAN_MAX_TABLE_SIZE];
53 Decode.readHuffmanCode(group.alphabetSize, group.codes, next, br);
|
| /external/valgrind/drd/scripts/ |
| 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/apps/raytrace/rltotiff/Makefile 2008-05-25 10:31:57.000000000 +020
[all...] |
| /libcore/luni/src/test/java/libcore/java/net/ |
| OldHttpRetryExceptionTest.java | 26 int [] codes = {400, 404, 200, 500, 0}; local
30 codes[i]);
33 hre.responseCode() == codes[i]);
39 int [] codes = {400, -1, Integer.MAX_VALUE, Integer.MIN_VALUE, 0}; local
45 codes[i], locations[i]);
48 hre.responseCode() == codes[i]);
|
| /external/ltp/testcases/commands/su/ |
| su01_s1 | 140 set codes [wait]
141 set pid [lindex $codes 0]
142 set exit_code [lindex $codes 3]
203 set codes [wait]
204 set pid [lindex $codes 0]
205 set exit_code [lindex $codes 3]
242 set codes [wait]
243 set pid [lindex $codes 0]
244 set exit_code [lindex $codes 3]
297 set codes [wait
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
| 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.
55 CODES,
61 unsigned codes, code FAR * FAR *table,
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
| inftrees.h | 48 CODES,
54 unsigned codes, code FAR * FAR *table,
|
| /external/icu/icu4c/source/tools/toolutil/ |
| collationinfo.h | 31 static void printReorderRanges(const CollationData &data, const int32_t *codes, int32_t length);
|
| /external/pdfium/third_party/zlib_v128/ |
| 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.
55 CODES,
61 unsigned codes, code FAR * FAR *table,
|
| /external/python/cpython2/Modules/zlib/ |
| 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.
55 CODES,
61 unsigned codes, code FAR * FAR *table,
|
| /external/syslinux/com32/lib/zlib/ |
| 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.
55 CODES,
61 unsigned codes, code FAR * FAR *table,
|
| /external/zlib/src/contrib/infback9/ |
| 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
|
| 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.
54 CODES,
60 unsigned codes, code FAR * FAR *table,
|
| /external/zlib/src/ |
| 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.
55 CODES,
61 unsigned codes, code FAR * FAR *table,
|
| /external/libexif/libexif/ |
| exif-log.c | 42 } codes[] = { variable in typeref:struct:__anon23356
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/python/cpython2/Tools/ssl/ |
| make_ssl_data.py | 22 codes = []
30 codes.append((code, (libcode, name, num)))
31 return codes
45 # Read codes from libraries
53 # Merge with existing codes (in case some old codes disappeared).
54 codes = {} variable
59 # Only keep it if the numeric codes weren't reused
61 codes[errcode] = libcode, errname, errnum
62 codes.update(dict(new_codes)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/X11/extensions/ |
| extutil.h | 49 XExtCodes *codes; /* the extension protocol codes */ member in struct:_XExtDisplayInfo
63 XExtCodes* /* codes */
68 XExtCodes* /* codes */
73 XExtCodes* /* codes */
78 XExtCodes* /* codes */
83 XExtCodes* /* codes */
88 XExtCodes* /* codes */
92 XExtCodes* /* codes */
107 XExtCodes* /* codes */,
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/X11/extensions/ |
| extutil.h | 47 XExtCodes *codes; /* the extension protocol codes */ member in struct:_XExtDisplayInfo
61 XExtCodes* /* codes */
66 XExtCodes* /* codes */
71 XExtCodes* /* codes */
76 XExtCodes* /* codes */
81 XExtCodes* /* codes */
86 XExtCodes* /* codes */
90 XExtCodes* /* codes */
105 XExtCodes* /* codes */,
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| CollationSettings.java | 138 int[] codes; local
140 codes = codesAndRanges;
142 // TODO: Java 6: Arrays.copyOf(codes, codesLength);
143 codes = new int[codesLength];
144 System.arraycopy(codesAndRanges, 0, codes, 0, codesLength);
157 reorderCodes = codes;
179 setReordering(data, codes);
182 public void setReordering(CollationData data, int[] codes) {
183 if(codes.length == 0 || (codes.length == 1 && codes[0] == Collator.ReorderCodes.NONE))
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| CollationSettings.java | 136 int[] codes; local
138 codes = codesAndRanges;
140 // TODO: Java 6: Arrays.copyOf(codes, codesLength);
141 codes = new int[codesLength];
142 System.arraycopy(codesAndRanges, 0, codes, 0, codesLength);
155 reorderCodes = codes;
177 setReordering(data, codes);
180 public void setReordering(CollationData data, int[] codes) {
181 if(codes.length == 0 || (codes.length == 1 && codes[0] == Collator.ReorderCodes.NONE))
[all...] |
| /external/sl4a/ScriptingLayerForAndroid/src/de/mud/terminal/ |
| VDUInput.java | 68 * Override the standard key codes used by the terminal emulation.
69 * @param codes a properties object containing key code definitions
71 void setKeyCodes(Properties codes);
|
| /external/webp/src/utils/ |
| huffman_encode_utils.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:__anon38580
|
| /external/pcre/dist2/src/ |
| pcre2_serialize.c | 42 a sequence of compiled codes. */
72 pcre2_serialize_encode(const pcre2_code **codes, int32_t number_of_codes,
87 if (codes == NULL || serialized_bytes == NULL || serialized_size == NULL)
98 if (codes[i] == NULL) return PCRE2_ERROR_NULL;
99 re = (const pcre2_real_code *)(codes[i]);
129 re = (const pcre2_real_code *)(codes[i]);
145 pcre2_serialize_decode(pcre2_code **codes, int32_t number_of_codes,
159 if (data == NULL || codes == NULL) return PCRE2_ERROR_NULL;
204 memctl->free(codes[j], memctl->memory_data);
205 codes[j] = NULL
[all...] |
| /external/regex-re2/re2/testing/ |
| 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...] |
