/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
ecmametadatapass.py | 295 next_code = tokenutil.SearchExcept(token, TokenType.NON_CODE_TYPES) 296 if next_code.type != TokenType.START_BLOCK: 317 next_code = tokenutil.SearchExcept(token, TokenType.NON_CODE_TYPES) 318 if (next_code.type != TokenType.START_BLOCK and 319 (next_code.type != TokenType.KEYWORD or next_code.string != 'if')): 442 next_code = tokenutil.SearchExcept(token, TokenType.NON_CODE_TYPES) 446 not next_code or next_code.line_number != token.line_number) 452 next_code_is_operator = next_code and next_code.type == TokenType.OPERATO [all...] |
indentation.py | 213 next_code = tokenutil.SearchExcept(token, Type.NON_CODE_TYPES) 214 if next_code and next_code.type == Type.END_BLOCK: 215 next_code = tokenutil.SearchExcept(next_code, Type.NON_CODE_TYPES) 216 if next_code and next_code.string in ('else', 'case', 'default'):
|
ecmalintrules.py | 635 next_code = tokenutil.SearchExcept(equal_operator, Type.NON_CODE_TYPES) 636 if next_code and ( 637 next_code.type in (Type.START_BRACKET, Type.START_BLOCK) or 638 next_code.IsOperator('new')): [all...] |
/external/webp/src/utils/ |
huffman_encode.c | 397 uint32_t next_code[MAX_ALLOWED_CODE_LENGTH + 1]; local 408 next_code[0] = 0; 413 next_code[i] = code; 418 tree->codes[i] = ReverseBits(code_length, next_code[code_length]++);
|
/external/zlib/src/doc/ |
rfc1951.txt | 439 next_code[bits] = code; 451 tree[n].Code = next_code[len]; 452 next_code[len]++; 476 Step 2 computes the following next_code values: 478 N next_code[N] [all...] |
/external/qemu/distrib/zlib-1.2.3/ |
trees.c | 582 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local 591 next_code[bits] = code = (code + bl_count[bits-1]) << 1; 604 tree[n].Code = bi_reverse(next_code[len]++, len); 607 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1)); [all...] |
/external/zlib/src/ |
trees.c | 580 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local 589 next_code[bits] = code = (code + bl_count[bits-1]) << 1; 602 tree[n].Code = bi_reverse(next_code[len]++, len); 605 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1)); [all...] |
/prebuilts/ndk/4/platforms/android-3/arch-arm/usr/lib/ |
libz.so | |
/prebuilts/ndk/4/platforms/android-4/arch-arm/usr/lib/ |
libz.so | |
/prebuilts/ndk/4/platforms/android-5/arch-arm/usr/lib/ |
libz.so | |
/prebuilts/ndk/4/platforms/android-8/arch-arm/usr/lib/ |
libz.so | |
/prebuilts/ndk/5/platforms/android-3/arch-arm/usr/lib/ |
libz.so | |
/prebuilts/ndk/6/platforms/android-3/arch-arm/usr/lib/ |
libz.so | |
/development/ndk/platforms/android-9/arch-x86/lib/ |
libz.a | [all...] |
/prebuilts/ndk/6/platforms/android-9/arch-x86/usr/lib/ |
libz.a | [all...] |
/prebuilts/ndk/7/platforms/android-14/arch-x86/usr/lib/ |
libz.a | [all...] |
/prebuilts/ndk/7/platforms/android-9/arch-x86/usr/lib/ |
libz.a | [all...] |
/prebuilts/ndk/8/platforms/android-14/arch-x86/usr/lib/ |
libz.a | [all...] |
/prebuilts/ndk/8/platforms/android-9/arch-x86/usr/lib/ |
libz.a | [all...] |