HomeSort by relevance Sort by last modified time
    Searched refs:lengths (Results 1 - 25 of 42) 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 35 * lengths[i] is the length of the compressed chunk,
44 uint64_t* lengths; member in struct:BDRVDMGState
89 s->offsets = s->lengths = s->sectors = s->sectorcounts = NULL;
131 s->lengths = qemu_realloc(s->lengths, new_size);
139 last_in_offset = s->offsets[i-1]+s->lengths[i-1];
152 s->lengths[i] = read_off(s->fd);
153 if(s->lengths[i]>max_compressed_size)
154 max_compressed_size = s->lengths[i];
221 ret = read(s->fd, 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...]
  /external/chromium/third_party/icu/source/common/
triedict.h 85 * @param lengths An array that is filled with the lengths of words that matched.
86 * @param count Filled with the number of elements output in lengths.
87 * @param limit The size of the lengths array; this limits the number of words output.
93 int32_t *lengths,
181 * @param lengths An array that is filled with the lengths of words that matched.
182 * @param count Filled with the number of elements output in lengths.
183 * @param limit The size of the lengths array; this limits the number of words output.
189 int32_t *lengths,
    [all...]
dictbe.cpp 114 // list of word candidate lengths, in increasing length order
115 int32_t lengths[POSSIBLE_WORD_LIST_MAX]; member in class:PossibleWord
158 prefix = dict->matches(text, rangeEnd-start, lengths, count, sizeof(lengths)/sizeof(lengths[0]));
165 utext_setNativeIndex(text, start+lengths[count-1]);
174 utext_setNativeIndex(text, offset + lengths[mark]);
175 return lengths[mark];
181 utext_setNativeIndex(text, offset + lengths[--current]);
618 AutoBuffer<int32_t, maxWordSize> lengths(numChars)
    [all...]
unames.c 529 * expandGroupLengths() reads a block of compressed lengths of 32 strings and
530 * expands them into offsets and lengths for each string.
531 * Lengths are stored with a variable-width encoding in consecutive nibbles:
535 * The offsets and lengths arrays must be at least 33 (one more) long because
540 uint16_t offsets[LINES_PER_GROUP+1], uint16_t lengths[LINES_PER_GROUP+1]) {
541 /* read the lengths of the 32 strings in this group and get each string's offset */
545 /* all 32 lengths must be read to get the offset of the first group string */
564 *lengths++=length;
576 *lengths++=length;
594 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2] local
627 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local
1360 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local
2012 uint16_t offsets[LINES_PER_GROUP+1], lengths[LINES_PER_GROUP+1]; local
    [all...]
  /external/openssl/apps/
speed.c 234 static int lengths[SIZE_NUM]={16,64,256,1024,8*1024}; variable
    [all...]
  /libcore/luni/src/main/java/org/apache/harmony/luni/platform/
IFileSystem.java 71 int[] lengths, int size) throws IOException;
74 int[] lengths, int size) throws IOException;
OSFileSystem.java 107 public native long readv(int fd, int[] addresses, int[] offsets, int[] lengths, int size)
110 public native long writev(int fd, int[] addresses, int[] offsets, int[] lengths, int size)
  /development/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());
  /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)
  /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...]
  /external/chromium/third_party/icu/source/tools/gennames/
gennames.c 76 * These lengths are sequentially for each tokenized string, not for the de-tokenized result.
78 * 32 lengths.
304 addLine(uint32_t code, char *names[], int16_t lengths[], int16_t count);
473 int16_t lengths[3]={ 0, 0, 0 }; local
486 lengths[0]=getName(names+0, fields[1][1]);
489 lengths[0]=0;
497 lengths[1]=getName(names+1, fields[10][1]);
500 lengths[1]=0;
507 lengths[2]=getName(names+2, fields[11][1]);
510 if(lengths[0]+lengths[1]+lengths[2]==0)
    [all...]
  /frameworks/base/libs/rs/
rsElement.h 66 const char **, const size_t * lengths);
rsElement.cpp 112 const char **nin, const size_t * lengths)
121 (ee->mFields[i].name.length() != lengths[i]) ||
139 e->mFields[ct].name.setTo(nin[ct], lengths[ct]);
  /libcore/luni/src/main/java/org/apache/harmony/nio/internal/
FileChannelImpl.java 294 int[] lengths = new int[length]; local
305 lengths[i] = buffer.remaining();
314 lengths, length);
329 if (lengths[i] < bytesRemaining) {
332 bytesRemaining -= lengths[i];
552 int[] lengths = new int[length]; local
571 lengths[i] = buffer.remaining();
581 lengths, length);
  /frameworks/base/core/java/android/content/
IntentFilter.java 241 int[] lengths, int lenPos) {
243 final int N = lengths[lenPos];
251 int[] lengths, int lenPos) {
252 if (findStringInSet(set, string, lengths, lenPos) >= 0) return set;
256 lengths[lenPos] = 1;
259 final int N = lengths[lenPos];
262 lengths[lenPos] = N+1;
270 lengths[lenPos] = N+1;
275 int[] lengths, int lenPos) {
276 int pos = findStringInSet(set, string, lengths, lenPos)
    [all...]
  /external/mtpd/
pptp.c 57 static uint8_t lengths[] = { variable
135 uint16_t length = lengths[message];
275 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
336 CHECK_EQ(lengths[i], written);
338 for (int j = 0; j < lengths[i]; j++)
341 for (int j = lengths[i]; j < 11; j++)
353 // Make sure we cover all always-flat lengths and at least one above.
  /libcore/dalvik/src/main/java/dalvik/system/
BlockGuard.java 175 int[] lengths, int size) throws IOException {
177 return mFileSystem.readv(fileDescriptor, addresses, offsets, lengths, size);
181 int[] lengths, int size) throws IOException {
183 return mFileSystem.writev(fileDescriptor, addresses, offsets, lengths, size);
  /system/media/opensles/tools/hashgen/
Makefile 40 gperf --null-strings --readonly-tables --compare-lengths part23in.gperf > part23in.c
  /libcore/luni/src/main/java/org/apache/harmony/security/asn1/
DerOutputStream.java 127 private void push(int[] lengths, Object[] values) {
140 len[index] = lengths;
  /libcore/luni/src/main/native/
org_apache_harmony_luni_platform_OSFileSystem.cpp 135 // out of range lengths, though, we want our range checking to fire.
210 ScopedIntArrayRO lengths(env, jLengths);
211 if (lengths.get() == NULL) {
216 vectors[i].iov_len = lengths[i];

Completed in 509 milliseconds

1 2