| /external/cldr/keyboards/import/ |
| D | scanCodes-implied.xml | 14 <scanCodes codes="29 02 03 04 05 06 07 08 09 0A 0B 0C 0D" /> <!-- 13 keys, ` to = -->
15 <scanCodes codes="10 11 12 13 14 15 16 17 18 19 1A 1B 2B" /> <!-- 13 keys, Q to \ -->
16 <scanCodes codes="1E 1F 20 21 22 23 24 25 26 27 28" /> <!-- 11 keys, A to ' -->
17 <scanCodes codes="2C 2D 2E 2F 30 31 32 33 34 35" /> <!-- 10 keys, Z to / -->
18 <scanCodes codes="39" /> <!-- 1 key, spacebar -->
21 <scanCodes codes="29 02 03 04 05 06 07 08 09 0A 0B 0C 0D" /> <!-- 13 keys -->
22 <scanCodes codes="10 11 12 13 14 15 16 17 18 19 1A 1B" /> <!-- 12 keys -->
23 <scanCodes codes="1E 1F 20 21 22 23 24 25 26 27 28 2B" /> <!-- 12 keys -->
24 <scanCodes codes="56 2C 2D 2E 2F 30 31 32 33 34 35" /> <!-- 11 keys-->
25 <scanCodes codes="39" /> <!-- 1 key, spacebar -->
[all …]
|
| /external/rust/crates/uniffi_meta/src/ |
| D | reader.rs | 5 use crate::metadata::{checksum_metadata, codes};
40 codes::NAMESPACE => NamespaceMetadata { in read_metadata()
45 codes::UDL_FILE => UdlFile { in read_metadata()
51 codes::FUNC => self.read_func()?.into(), in read_metadata()
52 codes::CONSTRUCTOR => self.read_constructor()?.into(), in read_metadata()
53 codes::METHOD => self.read_method()?.into(), in read_metadata()
54 codes::RECORD => self.read_record()?.into(), in read_metadata()
55 codes::ENUM => self.read_enum()?.into(), in read_metadata()
56 codes::INTERFACE => self.read_object(ObjectImpl::Struct)?.into(), in read_metadata()
57 codes::TRAIT_INTERFACE => self.read_object(ObjectImpl::Trait)?.into(), in read_metadata()
[all …]
|
| /external/grpc-grpc/src/ruby/lib/grpc/ |
| D | errors.rb | 81 codes = {}
82 codes[OK] = Ok
83 codes[CANCELLED] = Cancelled
84 codes[UNKNOWN] = Unknown
85 codes[INVALID_ARGUMENT] = InvalidArgument
86 codes[DEADLINE_EXCEEDED] = DeadlineExceeded
87 codes[NOT_FOUND] = NotFound
88 codes[ALREADY_EXISTS] = AlreadyExists
89 codes[PERMISSION_DENIED] = PermissionDenied
90 codes[UNAUTHENTICATED] = Unauthenticated
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/src/core/lib/slice/ |
| D | b64.cc | 130 static void decode_one_char(const unsigned char* codes, unsigned char* result, in decode_one_char() argument
132 uint32_t packed = (static_cast<uint32_t>(codes[0]) << 2) | in decode_one_char()
133 (static_cast<uint32_t>(codes[1]) >> 4); in decode_one_char()
137 static void decode_two_chars(const unsigned char* codes, unsigned char* result, in decode_two_chars() argument
139 uint32_t packed = (static_cast<uint32_t>(codes[0]) << 10) | in decode_two_chars()
140 (static_cast<uint32_t>(codes[1]) << 4) | in decode_two_chars()
141 (static_cast<uint32_t>(codes[2]) >> 2); in decode_two_chars()
146 static int decode_group(const unsigned char* codes, size_t num_codes, in decode_group() argument
156 decode_one_char(codes, result, result_offset); in decode_group()
160 decode_two_chars(codes, result, result_offset); in decode_group()
[all …]
|
| /external/regex-re2/re2/ |
| D | make_unicode_groups.py | 30 def MakeRanges(codes): argument
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): argument
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 …]
|
| 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[0]
208 doline(codes, fields)
236 def DoLine(codes, fields): argument
242 togroup.setdefault(lower, [lower]).extend(codes)
[all …]
|
| /external/rust/crates/libz-sys/src/zlib/contrib/infback9/ |
| D | inftree9.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
25 to be generated, CODES, LENS, or DISTS. On return, zero is success,
32 int inflate_table9(type, lens, codes, table, bits, work) in inflate_table9() argument
35 unsigned codes;
46 int left; /* number of prefix codes available */
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
64 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
68 static const unsigned short dbase[32] = { /* Distance codes 0..31 base */
72 static const unsigned short dext[32] = { /* Distance codes 0..31 extra */
[all …]
|
| /external/tflite-support/third_party/zlib/ |
| D | inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
25 to be generated, CODES, LENS, or DISTS. On return, zero is success,
32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument
35 unsigned codes;
46 int left; /* number of prefix codes available */
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
63 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
66 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
70 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
[all …]
|
| /external/python/cpython2/Modules/zlib/ |
| D | inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
25 to be generated, CODES, LENS, or DISTS. On return, zero is success,
32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument
35 unsigned codes;
46 int left; /* number of prefix codes available */
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
63 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
66 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
70 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
[all …]
|
| /external/rust/crates/libz-sys/src/zlib/ |
| D | inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
25 to be generated, CODES, LENS, or DISTS. On return, zero is success,
32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument
35 unsigned codes;
46 int left; /* number of prefix codes available */
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
63 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
66 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
70 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
[all …]
|
| /external/rust/crates/libz-sys/src/zlib/contrib/puff/ |
| D | puff.c | 49 * - Fix fixed codes table error
63 * 1.8 9 Jan 2004 - Added some comments on no distance codes case
79 * 2.3 21 Jan 2013 - Check for invalid code length codes in dynamic blocks
92 #define MAXLCODES 286 /* maximum number of literal/length codes */
93 #define MAXDCODES 30 /* maximum number of distance codes */
94 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */
95 #define FIXLCODES 288 /* number of fixed literal/length codes */
219 * - The codes as stored in the compressed data are bit-reversed relative to
220 * a simple integer ordering of codes of the same lengths. Hence below the
226 * - The first code for the shortest length is all zeros. Subsequent codes of
[all …]
|
| /external/libwebsockets/win32port/zlib/ |
| D | inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
25 to be generated, CODES, LENS, or DISTS. On return, zero is success,
32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument
35 unsigned codes;
46 int left; /* number of prefix codes available */
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
63 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
66 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
70 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
[all …]
|
| /external/rust/crates/libz-sys/src/zlib/examples/ |
| D | enough.c | 2 * all possible valid and complete Huffman codes, subject to a length limit.
12 As inflate does, decrease root for short codes
23 Examine all possible Huffman codes for a given number of symbols and a
25 inflate. Only complete Huffman codes are counted.
27 Two codes are considered distinct if the vectors of the number of codes per
30 the bit values to the codes (i.e. only canonical codes are counted).
44 speed. There is a single first-level table to decode codes up to root bits
46 has 1 << root entries and is indexed by the next root bits of input. Codes
53 codes. Each subsequent root-bit prefix then has its own sub-table. The
55 incrementally as the number of codes at each bit length is populated. When
[all …]
|
| /external/rust/crates/libz-sys/src/zlib-ng/ |
| D | inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
25 to be generated, CODES, LENS, or DISTS. On return, zero is success,
32 int Z_INTERNAL zng_inflate_table(codetype type, uint16_t *lens, unsigned codes, in zng_inflate_table() argument
40 int left; /* number of prefix codes available */ in zng_inflate_table()
52 uint16_t count[MAXBITS+1]; /* number of codes of each length */ in zng_inflate_table()
54 static const uint16_t lbase[31] = { /* Length codes 257..285 base */ in zng_inflate_table()
57 static const uint16_t lext[31] = { /* Length codes 257..285 extra */ in zng_inflate_table()
60 static const uint16_t dbase[32] = { /* Distance codes 0..29 base */ in zng_inflate_table()
64 static const uint16_t dext[32] = { /* Distance codes 0..29 extra */ in zng_inflate_table()
71 code lengths are lens[0..codes-1]. Each length corresponds to the in zng_inflate_table()
[all …]
|
| /external/zlib/ |
| D | inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
25 to be generated, CODES, LENS, or DISTS. On return, zero is success,
33 unsigned codes, code FAR * FAR *table, in inflate_table() argument
41 int left; /* number of prefix codes available */ in inflate_table()
53 unsigned short count[MAXBITS+1]; /* number of codes of each length */ in inflate_table()
55 static const unsigned short lbase[31] = { /* Length codes 257..285 base */ in inflate_table()
58 static const unsigned short lext[31] = { /* Length codes 257..285 extra */ in inflate_table()
61 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ in inflate_table()
65 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */ in inflate_table()
72 code lengths are lens[0..codes-1]. Each length corresponds to the in inflate_table()
[all …]
|
| /external/trusty/arm-trusted-firmware/lib/zlib/ |
| D | inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
25 to be generated, CODES, LENS, or DISTS. On return, zero is success,
33 unsigned codes, code FAR * FAR *table, in inflate_table() argument
41 int left; /* number of prefix codes available */ in inflate_table()
53 unsigned short count[MAXBITS+1]; /* number of codes of each length */ in inflate_table()
55 static const unsigned short lbase[31] = { /* Length codes 257..285 base */ in inflate_table()
58 static const unsigned short lext[31] = { /* Length codes 257..285 extra */ in inflate_table()
61 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ in inflate_table()
65 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */ in inflate_table()
72 code lengths are lens[0..codes-1]. Each length corresponds to the in inflate_table()
[all …]
|
| /external/freetype/src/gzip/ |
| D | inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
25 to be generated, CODES, LENS, or DISTS. On return, zero is success,
35 unsigned codes, in inflate_table() argument
46 int left; /* number of prefix codes available */ in inflate_table()
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */ in inflate_table()
60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */ in inflate_table()
63 static const unsigned short lext[31] = { /* Length codes 257..285 extra */ in inflate_table()
66 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ in inflate_table()
70 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */ in inflate_table()
77 code lengths are lens[0..codes-1]. Each length corresponds to the in inflate_table()
[all …]
|
| /external/fastrpc/inc/ |
| D | AEEStdErr.h | 34 // Basic Error Codes
229 Error Codes
232 This topic lists the categories of error codes that Brew MP returns. The topic for each
240 The categories of error codes include: ~
243 AddrBook error codes ~
244 AddrInfo error codes ~
247 Basic AEE Error Codes ~
248 Database error codes ~
249 dbc Error Codes ~
250 DNS Resolver error codes ~
[all …]
|
| /external/cronet/third_party/re2/src/re2/ |
| D | unicode.py | 136 The reader calls doline(codes, fields) for each entry in the table.
190 codes = _URange(fields[0])
196 if (len(codes) != 1 or codes[0] <= first or
200 codes = range(first, codes[0] + 1)
203 fields[0] = "%04X..%04X" % (codes[0], codes[-1])
208 if len(codes) != 1:
211 first = codes[0]
214 doline(codes, fields)
242 def DoLine(codes, fields): argument
248 togroup.setdefault(lower, [lower]).extend(codes)
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/ |
| D | unicode.py | 136 The reader calls doline(codes, fields) for each entry in the table.
190 codes = _URange(fields[0])
196 if (len(codes) != 1 or codes[0] <= first or
200 codes = range(first, codes[0] + 1)
203 fields[0] = "%04X..%04X" % (codes[0], codes[-1])
208 if len(codes) != 1:
211 first = codes[0]
214 doline(codes, fields)
242 def DoLine(codes, fields): argument
248 togroup.setdefault(lower, [lower]).extend(codes)
[all …]
|
| /external/mesa3d/src/gfxstream/codegen/vulkan/vulkan-docs-next/scripts/spec_tools/ |
| D | consistency_tools.py | 41 "manual" return codes:
42 the codes of the value are available for a command if-and-only-if
87 # availability of some return codes.
93 # Some return codes require a type (or its child) in the input.
100 for codes in self.forward_only_manual_types_to_codes.values():
101 specified_codes.update(codes)
102 for codes in self.reverse_only_manual_types_to_codes.values():
103 specified_codes.update(codes)
104 for codes in self.input_type_to_codes.values():
105 specified_codes.update(codes)
[all …]
|
| /external/python/google-api-python-client/docs/dyn/ |
| D | content_v2_1.regions.html | 113 …ettings` services. You can define regions as collections of either postal codes or, in some countr…
121 …codes that defines the region area. Note: All regions defined using postal codes are accessible vi…
122 "postalCodes": [ # Required. A range of postal codes.
123 { # A range of postal codes that defines the region area.
125 …h. Optional: if not set, then the area is defined as being all the postal codes matching postalCod…
144 …ettings` services. You can define regions as collections of either postal codes or, in some countr…
152 …codes that defines the region area. Note: All regions defined using postal codes are accessible vi…
153 "postalCodes": [ # Required. A range of postal codes.
154 { # A range of postal codes that defines the region area.
156 …h. Optional: if not set, then the area is defined as being all the postal codes matching postalCod…
[all …]
|
| /external/geonames/export/dump/ |
| D | readme.txt | 21 …nateNamesV2.zip : alternate names with language codes and geonameId, file with iso language co…
24 …or administrative subdivision 'admin2 code' (UTF8), Format : concatenated codes <tab>name <tab> as…
25 iso-languagecodes.txt : iso 639 language codes, as used for alternate names in file alternateNam…
26 featureCodes.txt : name and description for feature classes and feature codes
28 countryInfo.txt : country information : iso codes, fips codes, languages, capital ,...
38 …pe. The type 'ADM' stands for the admin hierarchy modeled by the admin1-4 codes. The other entries…
50 feature class : see http://www.geonames.org/export/codes.html, char(1)
51 feature code : see http://www.geonames.org/export/codes.html, varchar(10)
53 cc2 : alternate country codes, comma separated, ISO-3166 2-letter country code, 200 c…
66 Most adm1 are FIPS codes. ISO codes are used for US, CH, BE and ME. UK and Greece are using an addi…
[all …]
|
| /external/rust/crates/libz-sys/src/zlib-ng/doc/ |
| D | rfc1951.txt | 81 3.2.5. Compressed blocks (length and distance codes) ...... 11
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
296 * Data elements other than Huffman codes are packed
299 * Huffman codes are packed starting with the most-
307 elements in the correct MSB-to-LSB order and Huffman codes in
316 alphabet by bit sequences (codes), one code for each symbol, in
361 using the fewest bits of any possible prefix codes for that
364 information on Huffman codes.)
366 Note that in the "deflate" format, the Huffman codes for the
[all …]
|
| /external/rust/crates/libz-sys/src/zlib/doc/ |
| D | rfc1951.txt | 81 3.2.5. Compressed blocks (length and distance codes) ...... 11
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
296 * Data elements other than Huffman codes are packed
299 * Huffman codes are packed starting with the most-
307 elements in the correct MSB-to-LSB order and Huffman codes in
316 alphabet by bit sequences (codes), one code for each symbol, in
361 using the fewest bits of any possible prefix codes for that
364 information on Huffman codes.)
366 Note that in the "deflate" format, the Huffman codes for the
[all …]
|