/external/chromium_org/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/chromium_org/third_party/WebKit/Source/core/animation/animatable/ |
AnimatableStrokeDasharrayList.cpp | 41 RefPtr<SVGLengthList> lengths = passLengths; local 42 SVGLengthList::ConstIterator it = lengths->begin(); 43 SVGLengthList::ConstIterator itEnd = lengths->end(); 50 RefPtr<SVGLengthList> lengths = SVGLengthList::create(); local 55 lengths->append(length); 57 return lengths.release();
|
/external/chromium_org/third_party/mesa/src/src/mesa/tnl/ |
t_vb_normals.c | 54 const GLfloat *lengths; local 59 /* We can only use the display list's saved normal lengths if we've 63 lengths = NULL; 65 lengths = VB->NormalLengthPtr; 70 lengths,
|
/external/mesa3d/src/mesa/tnl/ |
t_vb_normals.c | 54 const GLfloat *lengths; local 59 /* We can only use the display list's saved normal lengths if we've 63 lengths = NULL; 65 lengths = VB->NormalLengthPtr; 70 lengths,
|
/external/chromium_org/third_party/libphonenumber/src/phonenumbers/geocoding/ |
area_code_map.cc | 54 const int* const lengths = storage_->GetPossibleLengths(); local 59 const int possible_length = lengths[lengths_index];
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
test_bufio.py | 11 lengths = list(range(1, 257)) + [512, 1000, 1024, 2048, 4096, 8192, 10000, variable 43 for length in lengths:
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
test_bufio.py | 11 lengths = list(range(1, 257)) + [512, 1000, 1024, 2048, 4096, 8192, 10000, variable 43 for length in lengths:
|
/bionic/libc/tools/zoneinfo/ |
ZoneCompactor.java | 36 // File lengths by zone name. 37 private Map<String,Integer> lengths = new HashMap<String,Integer>(); field in class:ZoneCompactor 80 lengths.put(s, (int) length); 96 lengths.put(from, lengths.get(to)); 143 f.writeInt(lengths.get(actualZoneName));
|
/external/chromium_org/chrome/browser/net/spdyproxy/ |
data_reduction_proxy_settings_android.cc | 123 DataReductionProxySettings::ContentLengthList lengths = local 126 if (!lengths.empty()) { 127 DCHECK_EQ(lengths.size(), data_reduction_proxy::kNumDaysInHistory); 128 env->SetLongArrayRegion(result, 0, lengths.size(), &lengths[0]);
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
StyleRareInheritedData.cpp | 44 Length lengths[1]; member in struct:blink::SameSizeAsStyleRareInheritedData
|
/external/chromium_org/third_party/WebKit/Source/wtf/text/ |
TextCodecUTF8.cpp | 72 static const uint8_t lengths[256] = { local 90 return lengths[firstByte];
|
/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;
|
/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/chromium_org/third_party/boringssl/src/crypto/cipher/ |
aead_test.c | 73 const unsigned int lengths[NUM_TYPES], 79 if (!EVP_AEAD_CTX_init(&ctx, aead, bufs[KEY], lengths[KEY], lengths[TAG], 86 lengths[NONCE], bufs[IN], lengths[IN], bufs[AD], 87 lengths[AD])) { 92 if (ciphertext_len != lengths[CT] + lengths[TAG]) { 94 (unsigned)ciphertext_len, (unsigned)(lengths[CT] + lengths[TAG])) 157 unsigned int lengths[NUM_TYPES]; local [all...] |
/external/chromium_org/courgette/ |
streams.cc | 38 // Maximum lengths of varint encoding of uint32 261 unsigned int lengths[kMaxStreams]; local 265 finger = Varint::Parse32WithLimit(finger, end, &lengths[i]); 268 accumulated_length += lengths[i]; 271 // Remaining bytes should add up to sum of lengths. 277 stream(i)->Init(start + accumulated_length, lengths[i]); 278 accumulated_length += lengths[i]; 295 uint32 lengths[kMaxStreams] = {}; // i.e. all zero. 298 if (!control_stream->ReadVarint32(&lengths[i])) 303 if (!this->stream(i)->ReadSubstream(lengths[i], set->stream(i)) 367 uint32 lengths[kMaxStreams]; local [all...] |
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/spdy/ |
Huffman.java | 39 private final byte[] lengths; field in class:Huffman.Codec 43 * @param lengths Index designates the symbol this code represents. 45 Codec(int[] codes, byte[] lengths) { 46 buildTree(codes, lengths); 48 this.lengths = lengths; 58 int nbits = lengths[b]; 82 len += lengths[b]; 131 private void buildTree(int[] codes, byte[] lengths) { 132 for (int i = 0; i < lengths.length; i++) [all...] |
/external/tcpdump/ |
util.c | 232 static const char *lengths[] = {"y", "w", "d", "h", "m", "s"}; local 234 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] 94 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */ 213 * a negative value if there is an error. If all of the lengths are zero, i.e. 220 * a simple integer ordering of codes of the same lengths. Hence below the 309 * Given the list of code lengths length[0..n-1] representing a canonical 320 * codes past the end of the incomplete lengths. 351 (h->count[length[symbol]])++; /* assumes lengths are within bounds */ 355 /* check for an over-subscribed or incomplete set of lengths */ 393 * - Literals, lengths, and the end-of-block code are combined into a single 397 * - There are 256 possible lengths (3..258), and so 29 symbols are not enoug 546 short lengths[FIXLCODES]; local 670 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/chromium_org/third_party/icu/source/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]); [all...] |
/external/chromium_org/third_party/icu/source/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...] |
/external/icu/icu4c/source/common/ |
dictbe.cpp | 106 // list of word candidate lengths, in increasing length order 107 int32_t lengths[POSSIBLE_WORD_LIST_MAX]; member in class:PossibleWord 150 prefix = dict->matches(text, rangeEnd-start, lengths, count, sizeof(lengths)/sizeof(lengths[0])); 157 utext_setNativeIndex(text, start+lengths[count-1]); 166 utext_setNativeIndex(text, offset + lengths[mark]); 167 return lengths[mark]; 173 utext_setNativeIndex(text, offset + lengths[--current]); [all...] |
/external/icu/icu4c/source/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);
|