/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];
|
/bionic/libc/tools/zoneinfo/ |
ZoneCompactor.java | 80 // File lengths by zone name 81 private Map<String,Integer> lengths = new HashMap<String,Integer>(); field in class:ZoneCompactor 129 lengths.put(s, (int) length); 150 lengths.put(from, lengths.get(to)); 192 f.writeInt(lengths.get(zoneName));
|
/external/libvorbis/vq/ |
huffbuild.c | 131 long *lengths=_ogg_calloc(vals,sizeof(long)); local 149 build_tree_from_lengths0(vals,hist,lengths); 169 fprintf(file,"%2ld,",lengths[j]);
|
latticetune.c | 31 LSP fitting, then generates new codeword lengths for maximally 42 long *lengths; local 85 lengths=_ogg_calloc(entries,sizeof(long)); 132 /* build the codeword lengths */ 133 build_tree_from_lengths0(entries,hits,lengths); 135 c->lengthlist=lengths;
|
/external/marisa-trie/tests/ |
trie-test.cc | 139 std::vector<std::size_t> lengths; local 140 ASSERT(trie.find("Baddie", &ids, &lengths) == 1); 143 ASSERT(lengths.size() == 1); 144 ASSERT(lengths[0] == 3); 146 ASSERT(trie.find_callback("anderson", FindCallback(&ids, &lengths)) == 1); 149 ASSERT(lengths.size() == 2); 150 ASSERT(lengths[1] == 3); 337 std::vector<std::size_t> lengths; local 338 ASSERT(trie.find("card", &ids, &lengths) == 1); 341 ASSERT(lengths.size() == 1) 375 std::size_t lengths[10]; local 539 std::vector<std::size_t> lengths; local [all...] |
/external/marisa-trie/tools/ |
marisa-find.cc | 41 static std::vector<std::size_t> lengths; local 42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths); 47 std::cout.write(str.c_str(), lengths[i]) << '\t' << str << '\n'; 53 lengths.clear();
|
/external/marisa-trie/v0_1_5/tests/ |
trie-test.cc | 141 std::vector<std::size_t> lengths; local 142 ASSERT(trie.find("Baddie", &ids, &lengths) == 1); 145 ASSERT(lengths.size() == 1); 146 ASSERT(lengths[0] == 3); 148 ASSERT(trie.find_callback("anderson", FindCallback(&ids, &lengths)) == 1); 151 ASSERT(lengths.size() == 2); 152 ASSERT(lengths[1] == 3); 339 std::vector<std::size_t> lengths; local 340 ASSERT(trie.find("card", &ids, &lengths) == 1); 343 ASSERT(lengths.size() == 1) 377 std::size_t lengths[10]; local 557 std::vector<std::size_t> lengths; local [all...] |
/external/marisa-trie/v0_1_5/tools/ |
marisa_alpha-find.cc | 41 static std::vector<std::size_t> lengths; local 42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths); 47 std::cout.write(str.c_str(), lengths[i]) << '\t' << str << '\n'; 53 lengths.clear();
|
/external/webkit/Source/WebCore/platform/text/ |
TextCodecUTF8.cpp | 67 static const uint8_t lengths[256] = { local 85 return lengths[firstByte];
|
/development/samples/SpellChecker/SampleSpellCheckerService/src/com/example/android/samplespellcheckerservice/ |
SampleSpellCheckerService.java | 103 final int[] lengths; local 119 lengths = new int[] { 4, 4, 4 }; 131 lengths = new int[] { ti.getText().length() }; 134 new SentenceSuggestionsInfo(sis, lengths, offsets);
|
/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();
|
Field.java | 224 List<Integer> lengths = new ArrayList<Integer>(3);//3 dimensions will be enough in most cases
local 233 lengths.add(Integer.valueOf(nameBuilder.substring(tableStartIndex + 1, tableStopIndex)));
240 if (!lengths.isEmpty()) {
241 tableSizes = new int[lengths.size()];
243 tableSizes[i] = lengths.get(i).intValue();
|
/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/qemu/block/ |
dmg.c | 33 * lengths[i] is the length of the compressed chunk, 42 uint64_t* lengths; member in struct:BDRVDMGState 85 s->offsets = s->lengths = s->sectors = s->sectorcounts = NULL; 132 s->lengths = qemu_realloc(s->lengths, new_size); 141 last_in_offset = s->offsets[i-1]+s->lengths[i-1]; 160 s->lengths[i] = read_off(bs, offset); 163 if(s->lengths[i]>max_compressed_size) 164 max_compressed_size = s->lengths[i]; 232 s->compressed_chunk+i, s->lengths[chunk]-i) [all...] |
/external/tcpdump/ |
util.c | 213 static const char *lengths[] = {"y", "w", "d", "h", "m", "s"}; local 215 const char **l = lengths;
|
/external/zlib/src/contrib/puff/ |
puff.c | 52 * 1.3 20 Mar 2002 - Go back to lengths for puff() parameters [Gailly] 93 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */ 212 * a negative value if there is an error. If all of the lengths are zero, i.e. 219 * a simple integer ordering of codes of the same lengths. Hence below the 308 * Given the list of code lengths length[0..n-1] representing a canonical 319 * codes past the end of the incomplete lengths. 350 (h->count[length[symbol]])++; /* assumes lengths are within bounds */ 354 /* check for an over-subscribed or incomplete set of lengths */ 392 * - Literals, lengths, and the end-of-block code are combined into a single 396 * - There are 256 possible lengths (3..258), and so 29 symbols are not enoug 545 short lengths[FIXLCODES]; local 669 short lengths[MAXCODES]; \/* descriptor code lengths *\/ local [all...] |
/external/mtpd/ |
pptp.c | 58 static uint8_t lengths[] = { variable 136 uint16_t length = lengths[message]; 272 if (incoming.length < lengths[incoming.message]) {
|
/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.
|
/packages/inputmethods/PinyinIME/jni/include/ |
userdict.h | 263 uint32 lengths[kUserDictCacheSize]; member in struct:ime_pinyin::UserDict::UserDictCache
|
/external/icu4c/common/ |
dictbe.cpp | 103 // list of word candidate lengths, in increasing length order 104 int32_t lengths[POSSIBLE_WORD_LIST_MAX]; member in class:PossibleWord 147 prefix = dict->matches(text, rangeEnd-start, lengths, count, sizeof(lengths)/sizeof(lengths[0])); 154 utext_setNativeIndex(text, start+lengths[count-1]); 163 utext_setNativeIndex(text, offset + lengths[mark]); 164 return lengths[mark]; 170 utext_setNativeIndex(text, offset + lengths[--current]); 839 AutoBuffer<int32_t, maxWordSize> lengths(numChars) [all...] |
/external/icu4c/test/perf/dicttrieperf/ |
dicttrieperf.cpp | 215 // Prime the prefix lengths so that we don't keep prefixLength at 0 until 348 int32_t *lengths, int &count, int limit ) { 364 // lengths[count++]=(int32_t)utext_getNativeIndex(text); 365 lengths[count++]=numChars; // CompactTrieDictionary just counts chars too. 441 int32_t lengths[20]; local 452 lengths, count, LENGTHOF(lengths)); 453 if(count==0 || lengths[count-1]!=lines[i].len) { 547 int32_t *lengths, int &count, int limit ) { 558 // lengths[count++]=(int32_t)utext_getNativeIndex(text) 590 int32_t lengths[20]; local [all...] |
/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);
|
/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);
|
/development/samples/training/bitmapfun/src/com/example/android/bitmapfun/util/ |
DiskLruCache.java | 143 * and may be read. A publish line is followed by the lengths of each of 409 size += entry.lengths[t]; 587 long oldLength = entry.lengths[i]; 589 entry.lengths[i] = newLength; 644 size -= entry.lengths[i]; 645 entry.lengths[i] = 0; 899 /** Lengths of this entry's files. */ 900 private final long[] lengths; field in class:DiskLruCache.Entry 913 this.lengths = new long[valueCount]; [all...] |
/external/okhttp/src/main/java/com/squareup/okhttp/internal/ |
DiskLruCache.java | 129 // and may be read. A publish line is followed by the lengths of each of 305 size += entry.lengths[t]; 475 long oldLength = entry.lengths[i]; 477 entry.lengths[i] = newLength; 531 size -= entry.lengths[i]; 532 entry.lengths[i] = 0; 774 /** Lengths of this entry's files. */ 775 private final long[] lengths; field in class:DiskLruCache.Entry 788 this.lengths = new long[valueCount]; 793 for (long size : lengths) { [all...] |