/libcore/luni/src/main/java/libcore/io/ |
DiskLruCache.java | 129 * and may be read. A publish line is followed by the lengths of each of 310 size += entry.lengths[t]; 490 long oldLength = entry.lengths[i]; 492 entry.lengths[i] = newLength; 547 size -= entry.lengths[i]; 548 entry.lengths[i] = 0; 806 /** Lengths of this entry's files. */ 807 private final long[] lengths; field in class:DiskLruCache.Entry 820 this.lengths = new long[valueCount]; 825 for (long size : lengths) { [all...] |
/external/libvorbis/vq/ |
bookutil.c | 338 void build_tree_from_lengths(int vals, long *hist, long *lengths){ 346 /* find codeword lengths */ 377 lengths[j]++; 392 bitsum+=(histsave[i]-1)*lengths[i]; 407 void build_tree_from_lengths0(int vals, long *hist, long *lengths){ 410 the lengths after the build */ 430 lengths[i]=lengthlist[upper++]; 432 lengths[i]=0;
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
set_operations.h | 377 difference_type* lengths; local 394 lengths = new difference_type[num_threads]; 430 lengths[ iam ] = op.invoke(block_begin.first, block_end.first, 437 lengths[ iam ] = op.count(block_begin.first, block_end.first, 441 // Make sure everyone wrote their lengths. 450 r += lengths[i]; 462 r += lengths[ i ];
|
/external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/file/ |
DnaBlockData.java | 106 //reading lengths
113 int[] lengths = new int[amount];//theamount is the same as int types
local 115 lengths[i] = inputStream.readShort();
|
/frameworks/base/core/java/android/service/textservice/ |
SpellCheckerService.java | 423 final int[] lengths = new int[querySize]; local 437 lengths[i] = item.mLength; 444 + lengths[i]); 447 return new SentenceSuggestionsInfo(reconstructedSuggestions, offsets, lengths);
|
/frameworks/base/core/java/android/content/ |
IntentFilter.java | 248 int[] lengths, int lenPos) { 250 final int N = lengths[lenPos]; 258 int[] lengths, int lenPos) { 259 if (findStringInSet(set, string, lengths, lenPos) >= 0) return set; 263 lengths[lenPos] = 1; 266 final int N = lengths[lenPos]; 269 lengths[lenPos] = N+1; 277 lengths[lenPos] = N+1; 282 int[] lengths, int lenPos) { 283 int pos = findStringInSet(set, string, lengths, lenPos) [all...] |
/external/v8/test/mjsunit/ |
string-indexof-1.js | 116 var lengths = [1, 4, 15]; // Single char, simple and complex. variable 118 for (var lengthIndex = 0; lengthIndex < lengths.length; lengthIndex++) { 119 var length = lengths[lengthIndex];
|
/external/mtpd/ |
pptp.c | 58 static uint8_t lengths[] = { variable 136 uint16_t length = lengths[message]; 272 if (incoming.length < lengths[incoming.message]) {
|
/external/icu4c/common/ |
unames.cpp | 528 * expandGroupLengths() reads a block of compressed lengths of 32 strings and 529 * expands them into offsets and lengths for each string. 530 * Lengths are stored with a variable-width encoding in consecutive nibbles: 534 * The offsets and lengths arrays must be at least 33 (one more) long because 539 uint16_t offsets[LINES_PER_GROUP+1], uint16_t lengths[LINES_PER_GROUP+1]) { 540 /* read the lengths of the 32 strings in this group and get each string's offset */ 544 /* all 32 lengths must be read to get the offset of the first group string */ 563 *lengths++=length; 575 *lengths++=length; 593 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2] local 626 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local 1366 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local 2010 uint16_t offsets[LINES_PER_GROUP+1], lengths[LINES_PER_GROUP+1]; local [all...] |
/frameworks/wilhelm/tools/hashgen/ |
Makefile | 40 gperf --null-strings --readonly-tables --compare-lengths part23in.gperf > part23in.c
|
/external/valgrind/main/memcheck/tests/ |
varinfo6.stdout.exp | 9 bytes: mapping 19, selectors 66, code lengths 134, codes 6465
|
origin5-bz2.stdout.exp | 10 bytes: mapping 19, selectors 66, code lengths 134, codes 6465
|
/external/webkit/Source/WebCore/platform/text/ |
TextCodecUTF8.cpp | 67 static const uint8_t lengths[256] = { local 85 return lengths[firstByte];
|
/libcore/luni/src/main/java/org/apache/harmony/security/asn1/ |
DerOutputStream.java | 101 private void push(int[] lengths, Object[] values) { 113 len[index] = lengths;
|
/external/v8/test/cctest/ |
test-strings.cc | 325 const int lengths[12] = {0, 0, 2, 3, 3, 3, 6, 7, 7, 7, 10, 11}; local 338 CHECK_EQ(lengths[i], written); 341 for (int j = 0; j < lengths[i]; j++) 344 for (int j = lengths[i]; j < 11; j++) 356 // Make sure we cover all always-flat lengths and at least one above.
|
/external/tcpdump/ |
util.c | 213 static const char *lengths[] = {"y", "w", "d", "h", "m", "s"}; local 215 const char **l = lengths;
|
/external/webkit/LayoutTests/dom/html/level2/html/ |
HTMLAnchorElement03.js | 78 The coords attribute is a comma-seperated list of lengths, defining
|
HTMLAreaElement03.js | 78 The coords attribute specifies a comma-seperated list of lengths,
|
anchor03.js | 78 Comma-separated list of lengths, defining an active region geometry.
|
/external/webkit/LayoutTests/dom/xhtml/level2/html/ |
HTMLAnchorElement03.js | 78 The coords attribute is a comma-seperated list of lengths, defining
|
HTMLAreaElement03.js | 78 The coords attribute specifies a comma-seperated list of lengths,
|
anchor03.js | 78 Comma-separated list of lengths, defining an active region geometry.
|
/frameworks/rs/ |
rsElement.cpp | 255 const char **nin, const size_t * lengths, const uint32_t *asin) { 266 (ee->mFields[i].name.length() != lengths[i]) || 288 e->mFields[ct].name.setTo(nin[ct], lengths[ct]);
|
/packages/apps/Gallery2/gallerycommon/src/com/android/gallery3d/exif/ |
ExifOutputStream.java | 413 long[] lengths = new long[stripCount]; local 415 lengths[i] = mExifData.getStrip(i).length; 417 lengthTag.setValue(lengths);
|
/external/valgrind/main/exp-sgcheck/tests/ |
hackedbz2.stdout.exp | 9 bytes: mapping 19, selectors 66, code lengths 134, codes 6465
|