| /prebuilts/go/darwin-x86/src/compress/bzip2/ |
| huffman.go | 89 // Now we assign codes to the symbols, starting with the longest code.
90 // We keep the codes packed into a uint32, at the most-significant end.
96 codes := huffmanCodes(make([]huffmanCode, len(lengths)))
105 codes[i].code = code
106 codes[i].codeLen = length
107 codes[i].value = pairs[i].value
115 sort.Sort(codes)
117 t.nodes = make([]huffmanNode, len(codes))
118 _, err := buildHuffmanNode(&t, codes, 0)
177 func buildHuffmanNode(t *huffmanTree, codes []huffmanCode, level uint32) (nodeIndex uint16, err error)
[all...] |
| /prebuilts/go/linux-x86/src/compress/bzip2/ |
| huffman.go | 89 // Now we assign codes to the symbols, starting with the longest code.
90 // We keep the codes packed into a uint32, at the most-significant end.
96 codes := huffmanCodes(make([]huffmanCode, len(lengths)))
105 codes[i].code = code
106 codes[i].codeLen = length
107 codes[i].value = pairs[i].value
115 sort.Sort(codes)
117 t.nodes = make([]huffmanNode, len(codes))
118 _, err := buildHuffmanNode(&t, codes, 0)
177 func buildHuffmanNode(t *huffmanTree, codes []huffmanCode, level uint32) (nodeIndex uint16, err error)
[all...] |
| /external/fonttools/Lib/fontTools/ |
| unicode.py | 22 self.codes = _makeunicodes(f)
26 return self.codes[charCode]
|
| /external/iputils/ |
| ping6_niquery.h | 23 /* Query Codes */
28 /* Reply Codes */
|
| /external/v8/src/compiler/ |
| instruction-codes.h | 11 #include "src/compiler/arm/instruction-codes-arm.h"
13 #include "src/compiler/arm64/instruction-codes-arm64.h"
15 #include "src/compiler/ia32/instruction-codes-ia32.h"
17 #include "src/compiler/mips/instruction-codes-mips.h"
19 #include "src/compiler/mips64/instruction-codes-mips64.h"
21 #include "src/compiler/x64/instruction-codes-x64.h"
23 #include "src/compiler/ppc/instruction-codes-ppc.h"
25 #include "src/compiler/x87/instruction-codes-x87.h"
|
| /external/zlib/src/contrib/infback9/ |
| 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)
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...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/device/ |
| Configuration.java | 22 // These codes must match the auto-generated codes in IWindowManager.java
|
| /external/chromium-trace/catapult/devil/devil/android/sdk/ |
| version_codes.py | 5 """Android SDK version codes.
|
| /external/libvorbis/doc/ |
| vorbis-errors.txt | 1 Error return codes possible from libvorbis and libvorbisfile:
8 *** Return codes:
46 *** Libvorbis functions that can return failure/error codes:
64 *** Libvorbisfile functions that can return failure/error codes:
|
| /external/opencv3/3rdparty/libwebp/utils/ |
| 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:__anon21919
|
| /external/strace/linux/tile/ |
| get_scno.c | 1 /* Return codes: 1 - ok, 0 - ignore, other - error. */
|
| /packages/inputmethods/OpenWnn/res/xml/ |
| keyboard_4key.xml | 24 <Key android:codes="-300" android:keyLabel="@string/key_symbol_mode" android:keyEdgeFlags="left" android:keyWidth="25%p" wnn:isSecondKey="true"/>
25 <Key android:codes="-301" android:keyWidth="25%p" android:keyLabel="\u25b2" wnn:isSecondKey="true" />
26 <Key android:codes="-302" android:keyWidth="25%p" android:keyLabel="\u25bc" wnn:isSecondKey="true" />
27 <Key android:codes="-303" android:keyIcon="@drawable/key_del" android:iconPreview="@drawable/key_del_b" android:isRepeatable="true" android:keyEdgeFlags="right" android:keyWidth="25%p" wnn:isSecondKey="true" />
|
| /prebuilts/go/darwin-x86/test/fixedbugs/ |
| bug200.go | 11 // hash codes so it missed the duplication
|
| /prebuilts/go/linux-x86/test/fixedbugs/ |
| bug200.go | 11 // hash codes so it missed the duplication
|
| /external/llvm/test/tools/llvm-objdump/ |
| win64-unwind-data.test | 15 OBJ-NEXT: Number of Codes: 8
18 OBJ-NEXT: Unwind Codes:
32 OBJ-NEXT: Number of Codes: 0
41 OBJ-NEXT: Number of Codes: 0
50 OBJ-NEXT: Number of Codes: 6
52 OBJ-NEXT: Unwind Codes:
64 EXE-NEXT: Number of Codes: 8
67 EXE-NEXT: Unwind Codes:
82 EXE-NEXT: Number of Codes: 0
92 EXE-NEXT: Number of Codes:
[all...] |
| /external/regex-re2/re2/ |
| unicode_groups.h | 7 // The codes get split into ranges of 16-bit codes
8 // and ranges of 32-bit codes. It would be simpler
|
| /hardware/ti/omap4-aah/libtiutils/ |
| ErrorUtils.h | 20 ///Header file where all the android error codes are defined
23 ///Header file where all the OMX error codes are defined
31 ///Header file where all the TI OSAL error codes are defined
|
| /hardware/ti/omap4xxx/libtiutils/ |
| ErrorUtils.h | 20 ///Header file where all the android error codes are defined
23 ///Header file where all the OMX error codes are defined
29 ///Header file where all the TI OSAL error codes are defined
|
| /docs/source.android.com/src/devices/input/ |
| overview.jd | 43 event types and codes in the <code>linux/input.h</code> kernel header file.
45 the details such as physical scan codes, HID usages, I2C messages,
51 events. As part of this process, the Linux input protocol event codes
52 are translated into Android event codes according to the
106 to configure the mapping from Linux event codes to Android event codes
117 <h2 id="understanding-hid-usages-and-event-codes">Understanding HID Usages and Event Codes</h2>
129 with each key, button or other control. Because physical scan codes
132 HID Usages or Linux key codes.</p
[all...] |
| /external/opencv3/3rdparty/zlib/ |
| 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)
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/zlib/src/ |
| 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)
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/zlib/src/examples/ |
| 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
[all...] |
| /external/freetype/src/gzip/ |
| infblock.c | 31 codes exist, they are coded using one bit each (0 and 1).
32 5. There is no way of sending zero distance codes--a dummy must be
34 store blocks with no distance codes, but this was discovered to be
36 zero distance codes, which is sent as one code of zero bits in
38 6. There are up to 286 literal/length codes. Code 256 represents the
40 288 codes just to fill out the Huffman codes. Codes 286 and 287
42 defined for them. Similarily, there are up to 30 distance codes.
43 However, static trees define 32 codes (all 5 bits) to fill out th
[all...] |
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/gzip/ |
| infblock.c | 31 codes exist, they are coded using one bit each (0 and 1).
32 5. There is no way of sending zero distance codes--a dummy must be
34 store blocks with no distance codes, but this was discovered to be
36 zero distance codes, which is sent as one code of zero bits in
38 6. There are up to 286 literal/length codes. Code 256 represents the
40 288 codes just to fill out the Huffman codes. Codes 286 and 287
42 defined for them. Similarily, there are up to 30 distance codes.
43 However, static trees define 32 codes (all 5 bits) to fill out th
[all...] |
| /external/pdfium/third_party/zlib_v128/ |
| 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,
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 */
77 code lengths are lens[0..codes-1]. Each length corresponds to th
[all...] |
