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

1234567

/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/brotli/java/org/brotli/dec/
H A DHuffmanTreeGroup.java22 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/
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/ltp/testcases/commands/su/
H A Dsu01_s1140 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 [wai
[all...]
/external/python/cpython2/Tools/ssl/
H A Dmake_ssl_data.py22 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
[all...]
/external/icu/icu4c/source/tools/toolutil/
H A Dcollationinfo.h31 static void printReorderRanges(const CollationData &data, const int32_t *codes, int32_t length);
/external/pdfium/third_party/zlib_v128/
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/python/cpython2/Modules/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/syslinux/com32/lib/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/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/libexif/libexif/
H A Dexif-log.c42 } codes[] = { variable in typeref:struct:__anon10655
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/icu/android_icu4j/src/main/java/android/icu/impl/coll/
H A DCollationSettings.java138 int[] codes;
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) { argument
183 if(codes.length == 0 || (codes
240 setReorderArrays(int[] codes, int[] ranges, int rangesStart, int rangesLength, byte[] table) argument
[all...]
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DCollationSettings.java136 int[] codes;
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) { argument
181 if(codes.length == 0 || (codes
238 setReorderArrays(int[] codes, int[] ranges, int rangesStart, int rangesLength, byte[] table) argument
[all...]
/external/fonttools/Lib/fontTools/
H A Dunicode.py22 self.codes = _makeunicodes(f)
26 return self.codes[charCode]
/external/fonttools/Tools/fontTools/
H A Dunicode.py22 self.codes = _makeunicodes(f)
26 return self.codes[charCode]
/external/sl4a/ScriptingLayerForAndroid/src/de/mud/terminal/
H A DVDUInput.java68 * 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); argument
/external/webp/src/utils/
H A Dhuffman_encode_utils.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:__anon25880
/external/pcre/dist2/src/
H A Dpcre2_serialize.c42 a sequence of compiled codes. */
72 pcre2_serialize_encode(const pcre2_code **codes, int32_t number_of_codes, argument
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, argument
159 if (data == NULL || codes == NULL) return PCRE2_ERROR_NULL;
204 memctl->free(codes[j], memctl->memory_data);
205 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/fmtlib/test/
H A Dformat-impl-test.cc109 int codes[] = {42, -1}; local
110 for (std::size_t i = 0, n = sizeof(codes) / sizeof(*codes); i < n; ++i) {
112 msg = fmt::format("error {}", codes[i]);
116 fmt::format_error_code(w, codes[i], prefix);
123 fmt::format_error_code(w, codes[i], prefix);
/external/python/cpython2/Tools/world/
H A Dworld3 """world -- Print mappings between country names and DNS country codes.
37 Country codes are maintained by the RIPE Network Coordination Centre,
60 codes and numbers, which are also provided in the standard format
240 codes = nameorgs.keys()
241 codes.sort()
242 for code in codes:
246 codes = countries.keys()
247 codes.sort()
248 for code in codes:
/external/curl/docs/cmdline-opts/
H A Dfail.d13 response codes will slip through, especially when authentication is involved
14 (response codes 401 and 407).

Completed in 2296 milliseconds

1234567