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

1 2 3

  /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/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/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 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/chromium_org/third_party/WebKit/Source/core/rendering/style/
StyleRareInheritedData.cpp 42 Length lengths[1]; member in struct:WebCore::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;
  /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();
  /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/chromium_org/chrome/browser/net/spdyproxy/
data_reduction_proxy_settings_android.cc 263 DataReductionProxySettings::ContentLengthList lengths = local
266 if (!lengths.empty()) {
267 DCHECK_EQ(lengths.size(), spdyproxy::kNumDaysInHistory);
268 env->SetLongArrayRegion(result, 0, lengths.size(), &lengths[0]);
  /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/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]
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...]

Completed in 895 milliseconds

1 2 3