/external/zxing/core/ |
H A D | core.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ... |
/external/zxing/qr_scanner/src/com/google/zxing/client/android/ |
H A D | CaptureActivity.java | 225 if (points != null && points.length > 0) { 235 if (points.length == 2) { 238 } else if (points.length == 4 && (rawResult.getBarcodeFormat() == BarcodeFormat.UPC_A
|
H A D | PlanarYUVLuminanceSource.java | 65 if (row == null || row.length < width) { 79 // original data. The docs specifically warn that result.length must be ignored.
|
H A D | ViewfinderView.java | 113 scannerAlpha = (scannerAlpha + 1) % SCANNER_ALPHA.length;
|
/external/yaffs2/yaffs2/ |
H A D | yaffs_mtdif2.c | 54 n = mtd->ecclayout->oobfree[j].length; 67 n = mtd->ecclayout->oobfree[j].length; 94 n = mtd->ecclayout->oobfree[j].length; 105 n = mtd->ecclayout->oobfree[j].length;
|
/external/zlib/src/as400/ |
H A D | zlib.inc | 115 D destLen 10U 0 Destination length 117 D sourceLen 10u 0 value Source length 121 D destLen 10U 0 Destination length 123 D sourceLen 10U 0 value Source length 131 D destLen 10U 0 Destination length 133 D sourceLen 10U 0 value Source length 169 D len 10u 0 value Buffer length 174 D len 10u 0 value Buffer length 183 D len 10i 0 value Buffer length 322 D dictLength 10U 0 value Dictionary length [all...] |
/external/zlib/src/contrib/blast/ |
H A D | blast.c | 33 #define MAXBITS 13 /* maximum code length */ 94 * each length, which for a canonical code are stepped through in order. 100 short *count; /* number of symbols of each length */ 118 * - The first code for the shortest length is all ones. Subsequent codes of 119 * the same length are simply integer decrements of the previous code. When 120 * moving up a length, a one bit is appended to the code. For a complete 121 * code, the last code of the longest length will be all zeros. To support 129 int first; /* first code of length len */ 130 int count; /* number of codes of length len */ 131 int index; /* index of first code of length le 193 short length[256]; /* code lengths */ local [all...] |
/external/zlib/src/contrib/dotzlib/DotZLib/ |
H A D | ChecksumImpl.cs | 61 /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
109 private static extern uint crc32(uint crc, int data, uint length);
argument 130 /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
160 private static extern uint adler32(uint adler, int data, uint length);
argument 181 /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
|
H A D | GZipStream.cs | 27 private static extern int gzwrite(IntPtr gzFile, int data, int length);
argument 30 private static extern int gzread(IntPtr gzFile, int data, int length);
argument 237 #region Position & length stuff
|
/external/zlib/src/contrib/infback9/ |
H A D | infback9.c | 48 Build and output length and distance decoding tables for fixed code 61 /* literal/length table */ 236 unsigned long length; /* literal or length of data to copy */ local 240 code const FAR *lencode; /* starting table for length/literal codes */ 246 unsigned len; /* length to copy for repeats, bits to drop */ 313 /* get and verify stored block length */ 321 length = (unsigned)hold & 0xffff; 322 Tracev((stderr, "inflate: stored length %lu\n", 323 length)); [all...] |
/external/zlib/src/contrib/masmx64/ |
H A D | gvmat64.asm | 471 ;;; Calculate the length of the match. If it is longer than MAX_MATCH,
479 ;;; If the length of the match is not longer than the best match we
510 ;;; Accept the current string, with the maximum possible length.
|
/external/zlib/src/contrib/masmx86/ |
H A D | inffas32.asm | 85 db 'invalid literal/length code'
|
H A D | match686.asm | 388 ;;; Calculate the length of the match. If it is longer than MAX_MATCH,
397 ;;; If the length of the match is not longer than the best match we
429 ;;; Accept the current string, with the maximum possible length.
|
/external/zlib/src/contrib/pascal/ |
H A D | zlibpas.pas | 56 extra_len: Integer; (* extra field length (valid if extra != Z_NULL) *)
|
/external/zlib/src/contrib/puff/ |
H A D | puff.c | 77 * - Allow incomplete code only if single code length is 1 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 */ 95 #define FIXLCODES 288 /* number of fixed literal/length codes */ 152 * - After the two-bit stored block type (00), the stored block length and 158 * - The second inverted copy of the stored block length does not have to be 161 * - A stored block can have zero length. This is sometimes used to byte-align 166 unsigned len; /* length of stored block */ 172 /* get length and check against its one's complement */ 201 * each length, whic 340 construct(struct huffman *h, const short *length, int n) argument [all...] |
/external/zlib/src/ |
H A D | deflate.c | 97 int length)); 110 /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */ 118 ush good_length; /* reduce lazy search above this match length */ 119 ush max_lazy; /* do not perform lazy search above this match length */ 120 ush nice_length; /* quit search above this match length */ 173 * the previous length of the hash chain. 230 * output size for (length,distance) codes is <= 24 bits. 582 /* compute wrapper length */ 1137 * return its length. Matches shorter or equal to prev_length are discarded, 1142 * OUT assertion: the match length i [all...] |
H A D | deflate.h | 31 /* number of length codes, not counting the special END_BLOCK code */ 72 ush len; /* length of bit string */ 121 * performed with a length multiple of the block size. Also, it limits 156 uInt match_length; /* length of best match */ 170 * length. A higher limit improves compression ratio but degrades the 180 /* Insert new strings in the hash table only if the match length is not 181 * greater than this length. This saves time but degrades compression. 195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 201 struct tree_desc_s bl_desc; /* desc. for bit length tree */ 204 /* number of codes at each bit length fo [all...] |
H A D | infback.c | 73 Return state with length and distance decoding tables and index sizes set to 95 /* literal/length table */ 267 unsigned len; /* length to copy for repeats, bits to drop */ 327 /* get and verify stored block length */ 335 state->length = (unsigned)hold & 0xffff; 336 Tracev((stderr, "inflate: stored length %u\n", 337 state->length)); 341 while (state->length != 0) { 342 copy = state->length; 352 state->length [all...] |
H A D | inflate.c | 19 * - Remove unnecessary second byte pull from length extra in inffast.c 76 * - Changed inflateBack() argument and in_func typedef to swap the length 252 Return state with length and distance decoding tables and index sizes set to 274 /* literal/length table */ 559 if there is no input available. The decoding of variable length codes uses 620 unsigned len; /* length to copy for repeats, bits to drop */ 724 state->length = (unsigned)(hold); 735 copy = state->length; 740 len = state->head->extra_len - state->length; 749 state->length [all...] |
H A D | inflate.h | 25 EXLEN, /* i: waiting for extra length (gzip) */ 34 STORED, /* i: waiting for stored size (length and complement) */ 38 LENLENS, /* i: waiting for code length code lengths */ 39 CODELENS, /* i: waiting for length/lit and distance code lengths */ 41 LEN, /* i: waiting for length/lit/eob code */ 42 LENEXT, /* i: waiting for length extra bits */ 48 LENGTH, /* i: waiting for 32-bit length (gzip) */ 101 unsigned length; /* literal or length of data to copy */ member in struct:inflate_state 106 code const FAR *lencode; /* starting table for length/litera [all...] |
H A D | make_vms.com | 320 $ if f$locate("CCOPT=",cparm) .lt. f$length(cparm) 323 $ len = f$length(cparm) - start 325 $ if f$locate("AS_IS",f$edit(ccopt,"UPCASE")) .lt. f$length(ccopt) - 329 $ if f$locate("LOPTS=",cparm) .lt. f$length(cparm) 332 $ len = f$length(cparm) - start 335 $ if f$locate("CC=",cparm) .lt. f$length(cparm) 338 $ len = f$length(cparm) - start 352 $ if f$locate("MAKE=",cparm) .lt. f$length(cparm) 355 $ len = f$length(cparm) - start 546 $ if (in_ldef .lt. f$length(libdef [all...] |
H A D | trees.c | 48 /* Bit length codes must not exceed MAX_BL_BITS bits */ 54 /* repeat previous bit length 3-6 times (2 bits of repeat count) */ 57 /* repeat a zero length 3-10 times (3 bits of repeat count) */ 60 /* repeat a zero length 11-138 times (7 bits of repeat count) */ 62 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */ 68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 73 /* The lengths of the bit length codes are sent in order of decreasing 74 * probability, to avoid transmitting the lengths for unused bit length codes. 105 /* length code for each normalized match length ( 240 int length; /* length value */ local [all...] |
/external/zlib/src/examples/ |
H A D | enough.c | 2 * all possible valid and complete Huffman codes, subject to a length limit. 24 maximum code length in bits to determine the maximum table size for zilb's 28 length are not identical. So permutations of the symbol assignments result 33 are coded at each length. At each step, we have how many symbols remain to 34 be coded, what the last code length used was, and how many bit patterns of 35 that length remain unused. Then we add one to the code length and double the 36 number of unused patterns to graduate to the next code length. We then 37 assign all portions of the remaining symbols to that code length that 45 in length (roo 263 size_t length; /* length of the bit vector in bytes */ local [all...] |
/external/zopfli/src/zopfli/ |
H A D | blocksplitter.c | 98 tree and the size to encode all literal, length and distance symbols and their 162 size_t length = dists[i] == 0 ? 1 : litlens[i]; local 167 pos += length; 318 size_t length = store.dists[i] == 0 ? 1 : store.litlens[i]; local 323 pos += length;
|
H A D | cache.c | 30 lmc->length = (unsigned short*)malloc(sizeof(unsigned short) * blocksize); 35 /* length > 0 and dist 0 is invalid combination, which indicates on purpose 37 for (i = 0; i < blocksize; i++) lmc->length[i] = 1; 43 free(lmc->length); 49 size_t pos, size_t length, 61 if (length < 3) return; 62 for (i = 3; i <= length; i++) { 63 if (i == length || sublen[i] != sublen[i + 1]) { 73 assert(bestlength == length); 76 assert(bestlength <= length); 48 ZopfliSublenToCache(const unsigned short* sublen, size_t pos, size_t length, ZopfliLongestMatchCache* lmc) argument 81 ZopfliCacheToSublen(const ZopfliLongestMatchCache* lmc, size_t pos, size_t length, unsigned short* sublen) argument 94 unsigned length = cache[j * 3] + 3; local 107 ZopfliMaxCachedSublen(const ZopfliLongestMatchCache* lmc, size_t pos, size_t length) argument [all...] |