HomeSort by relevance Sort by last modified time
    Searched refs:lengths (Results 1 - 25 of 49) sorted by null

1 2

  /external/icu4c/common/
triedict.h 82 * @param lengths An array that is filled with the lengths of words that matched.
83 * @param count Filled with the number of elements output in lengths.
84 * @param limit The size of the lengths array; this limits the number of words output.
89 int32_t *lengths,
155 * @param lengths An array that is filled with the lengths of words that matched.
156 * @param count Filled with the number of elements output in lengths.
157 * @param limit The size of the lengths array; this limits the number of words output.
162 int32_t *lengths,
    [all...]
dictbe.cpp 109 // list of word candidate lengths, in increasing length order
110 int32_t lengths[POSSIBLE_WORD_LIST_MAX]; member in class:PossibleWord
153 prefix = dict->matches(text, rangeEnd-start, lengths, count, sizeof(lengths)/sizeof(lengths[0]));
160 utext_setNativeIndex(text, start+lengths[count-1]);
169 utext_setNativeIndex(text, offset + lengths[mark]);
170 return lengths[mark];
176 utext_setNativeIndex(text, offset + lengths[--current]);
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/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/zlib/contrib/puff/
puff.c 52 * 1.3 20 Mar 2002 - Go back to lengths for puff() parameters [Jean-loup]
87 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */
203 * a negative value if there is an error. If all of the lengths are zero, i.e.
210 * a simple integer ordering of codes of the same lengths. Hence below the
296 * Given the list of code lengths length[0..n-1] representing a canonical
307 * codes past the end of the incomplete lengths.
338 (h->count[length[symbol]])++; /* assumes lengths are within bounds */
342 /* check for an over-subscribed or incomplete set of lengths */
379 * - Literals, lengths, and the end-of-block code are combined into a single
383 * - There are 256 possible lengths (3..258), and so 29 symbols are not enoug
526 short lengths[FIXLCODES]; local
650 short lengths[MAXCODES]; \/* descriptor code lengths *\/ local
    [all...]
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
list_partition.h 88 * @param lengths Length of the resulting parts.
101 InputIterator* starts, size_t* lengths, const int num_parts,
156 lengths[i - 1] = size_part * range_length;
164 lengths[i - 1] = (size_part+1) * range_length;
170 lengths[num_parts - 1] -= (dist_limit - dist);
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/openssl/apps/
speed.c 234 static int lengths[SIZE_NUM]={16,64,256,1024,8*1024}; variable
    [all...]
  /bionic/libc/tools/zoneinfo/
ZoneCompactor.java 40 // File lengths by zone name
41 Map<String,Integer> lengths = new HashMap<String,Integer>(); field in class:ZoneCompactor
105 lengths.put(s, new Integer((int)length));
125 lengths.put(from, lengths.get(to));
150 writeInt(idx, lengths.get(zname).intValue());
  /system/media/mca/filterpacks/base/native/
geometry.cpp 137 const Point& lengths) {
139 if (!dy.ScaleTo(lengths.y() / 2.0f)) {
146 dx.ScaleTo(lengths.x() / 2.0f);
153 width_ = lengths.x();
154 height_ = lengths.y();
  /external/skia/src/animator/
SkGetCondensedInfo.cpp 30 static int _searchByName(const unsigned char* lengths, int count, const char* strings, const char target[]) {
35 if (strcmp(&strings[lengths[mid << 2]], target) < 0)
40 if (strcmp(&strings[lengths[hi << 2]], target) != 0)
  /frameworks/base/libs/rs/
rsElement.h 81 const size_t * lengths,
96 const size_t * lengths,
98 ObjectBaseRef<const Element> elem = createRef(rsc, count, ein, nin, lengths, asin);
rsElement.cpp 198 const char **nin, const size_t * lengths, const uint32_t *asin) {
209 (ee->mFields[i].name.length() != lengths[i]) ||
231 e->mFields[ct].name.setTo(nin[ct], lengths[ct]);
  /external/icu4c/tools/gennames/
gennames.c 76 * These lengths are sequentially for each tokenized string, not for the de-tokenized result.
78 * 32 lengths.
322 addLine(uint32_t code, char *names[], int16_t lengths[], int16_t count);
551 int16_t lengths[4]={ 0, 0, 0, 0 }; local
564 lengths[0]=getName(names+0, fields[1][1]);
567 lengths[0]=0;
575 lengths[1]=getName(names+1, fields[10][1]);
578 lengths[1]=0;
585 lengths[2]=getName(names+2, fields[11][1]);
588 if(lengths[0]+lengths[1]+lengths[2]==0)
    [all...]
  /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
291 size += entry.lengths[t];
458 long oldLength = entry.lengths[i];
460 entry.lengths[i] = newLength;
512 size -= entry.lengths[i];
513 entry.lengths[i] = 0;
753 /** Lengths of this entry's files. */
754 private final long[] lengths; field in class:DiskLruCache.Entry
764 this.lengths = new long[valueCount];
769 for (long size : lengths) {
    [all...]
  /frameworks/base/core/java/android/content/
IntentFilter.java 247 int[] lengths, int lenPos) {
249 final int N = lengths[lenPos];
257 int[] lengths, int lenPos) {
258 if (findStringInSet(set, string, lengths, lenPos) >= 0) return set;
262 lengths[lenPos] = 1;
265 final int N = lengths[lenPos];
268 lengths[lenPos] = N+1;
276 lengths[lenPos] = N+1;
281 int[] lengths, int lenPos) {
282 int pos = findStringInSet(set, string, lengths, lenPos)
    [all...]
  /external/skia/gpu/src/
GrGLProgram.cpp 631 int lengths[MAX_STRINGS]; local
636 lengths[stringCnt] = segments.fHeader.size();
641 lengths[stringCnt] = segments.fVSUnis.size();
646 lengths[stringCnt] = segments.fVSAttrs.size();
651 lengths[stringCnt] = segments.fVaryings.size();
657 lengths[stringCnt] = segments.fVSCode.size();
672 lengths);
682 lengths[stringCnt] = segments.fHeader.size();
687 lengths[stringCnt] = strlen(GrShaderPrecision());
692 lengths[stringCnt] = segments.fFSUnis.size()
    [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/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.
  /system/media/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
  /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/tcpdump/
util.c 213 static const char *lengths[] = {"y", "w", "d", "h", "m", "s"}; local
215 const char **l = lengths;

Completed in 550 milliseconds

1 2