HomeSort by relevance Sort by last modified time
    Searched defs:lengths (Results 26 - 50 of 61) sorted by null

12 3

  /external/chromium_org/third_party/icu/source/common/
dictbe.cpp 112 // list of word candidate lengths, in increasing length order
113 int32_t lengths[POSSIBLE_WORD_LIST_MAX]; member in class:PossibleWord
156 prefix = dict->matches(text, rangeEnd-start, lengths, count, sizeof(lengths)/sizeof(lengths[0]));
163 utext_setNativeIndex(text, start+lengths[count-1]);
172 utext_setNativeIndex(text, offset + lengths[mark]);
173 return lengths[mark];
179 utext_setNativeIndex(text, offset + lengths[--current]);
616 AutoBuffer<int32_t, maxWordSize> lengths(numChars)
    [all...]
unames.c 526 * expandGroupLengths() reads a block of compressed lengths of 32 strings and
527 * expands them into offsets and lengths for each string.
528 * Lengths are stored with a variable-width encoding in consecutive nibbles:
532 * The offsets and lengths arrays must be at least 33 (one more) long because
537 uint16_t offsets[LINES_PER_GROUP+1], uint16_t lengths[LINES_PER_GROUP+1]) {
538 /* read the lengths of the 32 strings in this group and get each string's offset */
542 /* all 32 lengths must be read to get the offset of the first group string */
561 *lengths++=length;
573 *lengths++=length;
591 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2] local
624 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local
1352 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local
2004 uint16_t offsets[LINES_PER_GROUP+1], lengths[LINES_PER_GROUP+1]; 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...]
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...]
  /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);
  /frameworks/base/packages/WallpaperCropper/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);
  /packages/apps/Camera2/src/com/android/camera/exif/
ExifOutputStream.java 413 long[] lengths = new long[stripCount]; local
415 lengths[i] = mExifData.getStrip(i).length;
417 lengthTag.setValue(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);
  /packages/apps/Launcher3/WallpaperPicker/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);
  /packages/apps/Mms/src/com/android/mms/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/BitmapFun/src/main/java/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/chromium_org/third_party/libwebp/enc/
vp8l.c 207 uint8_t* lengths; local
209 sizeof(*lengths) + sizeof(*codes));
215 lengths = (uint8_t*)&codes[total_length_size];
219 huffman_codes[i].code_lengths = lengths;
221 lengths += bit_length;
490 // Create Huffman bit lengths and codes for each histogram image.
559 // Create Huffman bit lengths and codes for each histogram image.
    [all...]
  /external/chromium_org/v8/test/cctest/
test-strings.cc 907 const int lengths[12] = {0, 0, 2, 3, 3, 3, 6, 7, 7, 7, 10, 11}; local
921 CHECK_EQ(lengths[i], written);
924 for (int j = 0; j < lengths[i]; j++)
927 for (int j = lengths[i]; j < 11; j++)
940 // Make sure we cover all always-flat lengths and at least one above.
    [all...]
  /external/okhttp/src/main/java/com/squareup/okhttp/internal/
DiskLruCache.java 130 * and may be read. A publish line is followed by the lengths of each of
324 size += entry.lengths[t];
438 return new Snapshot(key, entry.sequenceNumber, ins, entry.lengths);
530 long oldLength = entry.lengths[i];
532 entry.lengths[i] = newLength;
588 size -= entry.lengths[i];
589 entry.lengths[i] = 0;
669 private final long[] lengths; field in class:DiskLruCache.Snapshot
671 private Snapshot(String key, long sequenceNumber, InputStream[] ins, long[] lengths) {
675 this.lengths = lengths
875 private final long[] lengths; field in class:DiskLruCache.Entry
    [all...]
  /external/webp/src/enc/
vp8l.c 207 uint8_t* lengths; local
209 sizeof(*lengths) + sizeof(*codes));
215 lengths = (uint8_t*)&codes[total_length_size];
219 huffman_codes[i].code_lengths = lengths;
221 lengths += bit_length;
490 // Create Huffman bit lengths and codes for each histogram image.
559 // Create Huffman bit lengths and codes for each histogram image.
    [all...]
  /external/chromium_org/third_party/freetype/include/freetype/internal/
psaux.h 104 /* init :: Set to 0xDEADBEEF if `elements' and `lengths' have */
113 /* lengths :: A table of element sizes within the block. */
130 FT_PtrDist* lengths; /* lengths of table elements */ member in struct:PS_TableRec_
    [all...]
  /external/chromium_org/third_party/openssl/openssl/apps/
speed.c 259 static int lengths[SIZE_NUM]={16,64,256,1024,8*1024}; variable
    [all...]
  /external/freetype/include/freetype/internal/
psaux.h 104 /* init :: Set to 0xDEADBEEF if `elements' and `lengths' have */
113 /* lengths :: A table of element sizes within the block. */
130 FT_PtrDist* lengths; /* lengths of table elements */ member in struct:PS_TableRec_
    [all...]
  /external/openssl/apps/
speed.c 259 static int lengths[SIZE_NUM]={16,64,256,1024,8*1024}; variable
    [all...]
  /external/chromium_org/third_party/mesa/src/include/CL/
cl.hpp 2400 ::size_t* lengths = (::size_t*) alloca(n * sizeof(::size_t)); local
2426 ::size_t* lengths = (::size_t*) alloca(n * sizeof(::size_t)); local
    [all...]
  /external/mesa3d/include/CL/
cl.hpp 2400 ::size_t* lengths = (::size_t*) alloca(n * sizeof(::size_t)); local
2426 ::size_t* lengths = (::size_t*) alloca(n * sizeof(::size_t)); local
    [all...]

Completed in 1064 milliseconds

12 3