Home
last modified time | relevance | path

Searched refs:pairs (Results 1 – 25 of 209) sorted by relevance

123456789

/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/
DAbstractSampleEncryptionBox.java70 e.pairs = new LinkedList<Entry.Pair>(); in _parseDetails()
72 … e.pairs.add(e.createPair(IsoTypeReader.readUInt16(content), IsoTypeReader.readUInt32(content))); in _parseDetails()
162 IsoTypeWriter.writeUInt16(byteBuffer, entry.pairs.size()); in getContent()
163 for (Entry.Pair pair : entry.pairs) { in getContent()
196 public List<Pair> pairs = new LinkedList<Pair>(); field in AbstractSampleEncryptionBox.Entry
209 for (Entry.Pair pair : pairs) { in getSize()
279 if (pairs != null ? !pairs.equals(entry.pairs) : entry.pairs != null) { in equals()
289 result = 31 * result + (pairs != null ? pairs.hashCode() : 0); in hashCode()
297 ", pairs=" + pairs + in toString()
344 size += entry.pairs.size() * 6; in getEntrySizes()
/external/harfbuzz/contrib/tables/
Dmirroring-parse.py12 pairs = []
27 pairs.append((a, b))
29 pairs.sort()
40 for pair in pairs:
43 print >>outfile, 'static const unsigned mirroring_properties_count = %d;\n' % len(pairs)
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_tools_windows/tools/
Dpicoloaddbg.lua106 for s in pairs(propnames) do propnames[s] = 0 end
107 for s in pairs(upropnames) do upropnames[s] = 0 end
108 for s, p in pairs(st) do
109 for prop, propval in pairs(p) do
120 for prop, propval in pairs(upropnames) do
136 for s, pl in pairs(symnrs) do
163 for k, v in pairs(syms) do
Dpicoloadphones.lua104 for s in pairs(propnames) do propnames[s] = 0 end
105 for s in pairs(upropnames) do upropnames[s] = 0 end
106 for s, p in pairs(st) do
107 for prop, propval in pairs(p) do
118 for prop, propval in pairs(upropnames) do
134 for s, pl in pairs(symnrs) do
/external/nist-sip/java/gov/nist/core/
DMultiValueMapImpl.java56 Set pairs = map.entrySet(); in containsValue() local
58 if (pairs == null) in containsValue()
61 Iterator pairsIterator = pairs.iterator(); in containsValue()
72 Set pairs = map.entrySet(); in clear() local
73 Iterator pairsIterator = pairs.iterator(); in clear()
85 Set pairs = map.entrySet(); in values() local
86 Iterator pairsIterator = pairs.iterator(); in values()
/external/icu4c/layout/
DKernTable.cpp74 : pairs(0), font(font) in KernTable()
117 pairs = (const PairInfo*)((char*)table + KERN_SUBTABLE_0_HEADER_SIZE); in KernTable()
120 fprintf(stderr, "coverage: %0.4x nPairs: %d pairs 0x%x\n", coverage, nPairs, pairs); in KernTable()
135 const PairInfo* p = pairs; in KernTable()
172 if (pairs) { in process()
186 const PairInfo* p = pairs; in process()
205 fprintf(stdout, " %.3d (%0.8x)\n", ((char*)tp - (char*)pairs)/KERN_PAIRINFO_SIZE, tkey); in process()
/external/skia/src/core/
DSkPixelRef.cpp199 const Pair* pairs = gPairs; in NameToFactory() local
201 if (strcmp(pairs[i].fName, name) == 0) { in NameToFactory()
202 return pairs[i].fFactory; in NameToFactory()
212 const Pair* pairs = gPairs; in FactoryToName() local
214 if (pairs[i].fFactory == fact) { in FactoryToName()
215 return pairs[i].fName; in FactoryToName()
DSkFlattenable.cpp405 const Pair* pairs = gPairs; in NameToFactory() local
407 if (strcmp(pairs[i].fName, name) == 0) { in NameToFactory()
408 return pairs[i].fFactory; in NameToFactory()
418 const Pair* pairs = gPairs; in FactoryToName() local
420 if (pairs[i].fFactory == fact) { in FactoryToName()
421 return pairs[i].fName; in FactoryToName()
/external/qemu/android/utils/
Dini.c39 IniPair* pairs; member
47 AFREE(i->pairs[nn].key); in iniFile_free()
48 i->pairs[nn].key = NULL; in iniFile_free()
49 i->pairs[nn].value = NULL; in iniFile_free()
51 AFREE(i->pairs); in iniFile_free()
99 AARRAY_RENEW(i->pairs, newMax); in iniFile_addPair()
103 pair = i->pairs + i->numPairs; in iniFile_addPair()
116 if (!strcmp(i->pairs[nn].key,key)) in iniFile_getPair()
117 return &i->pairs[nn]; in iniFile_getPair()
315 IniPair* pair = f->pairs; in iniFile_saveToFileCommon()
[all …]
/external/webkit/Source/WebCore/platform/
DMIMETypeRegistry.cpp269 static const TypeExtensionPair pairs[] = { in mediaMIMETypeMap() local
354 const unsigned numPairs = sizeof(pairs) / sizeof(pairs[0]); in mediaMIMETypeMap()
357 if (mediaMIMETypeForExtensionMap.contains(pairs[ndx].extension)) in mediaMIMETypeMap()
358 mediaMIMETypeForExtensionMap.get(pairs[ndx].extension)->append(pairs[ndx].type); in mediaMIMETypeMap()
364 String systemType = MIMETypeRegistry::getMIMETypeForExtension(pairs[ndx].extension); in mediaMIMETypeMap()
365 if (!systemType.isEmpty() && pairs[ndx].type != systemType) in mediaMIMETypeMap()
367 synonyms->append(pairs[ndx].type); in mediaMIMETypeMap()
368 mediaMIMETypeForExtensionMap.add(pairs[ndx].extension, synonyms); in mediaMIMETypeMap()
/external/v8/test/mjsunit/
Dswitch.js385 var pairs = [],
389 pairs = test_type.map(function(v) {
396 pairs = clause_values.string.map(function(v) {
403 pairs = clause_values.string.map(function(v) {
410 pairs = [
416 pairs = clause_values.smi.map(function(v) {
423 pairs = clause_values.smi.map(function(v) {
431 pairs.forEach(function(pair) {
/external/llvm/test/YAMLParser/
Dconstruct-pairs.data3 # Explicitly typed pairs.
4 Block tasks: !!pairs
9 Flow tasks: !!pairs [ meeting: with team, meeting: with boss ]
/external/v8/tools/gcmole/
Dgcmole.lua160 for condition, files in pairs(sources) do
185 for k, v in pairs(self) do e[k] = v end
186 for k, v in pairs(t) do e[k] = v end
280 for caller, _ in pairs(callers) do
289 for funcname, callers in pairs(funcs) do
306 for name, value in pairs(gc) do if value then out:write (name, '\n') end end
311 for name, causes in pairs(gc_caused) do
/external/srec/tools/thirdparty/OpenFst/fst/lib/
Dshortest-path.h173 ShortestPathCompare(const vector<Pair>& pairs, in ShortestPathCompare() argument
176 : pairs_(pairs), distance_(distance), superfinal_(sfinal), delta_(d) {} in ShortestPathCompare()
273 vector<Pair> pairs; in ShortestPath() local
280 compare(pairs, *distance, superfinal, opts.delta); in ShortestPath()
288 while (pairs.size() <= final) in ShortestPath()
289 pairs.push_back(Pair(kNoStateId, Weight::Zero())); in ShortestPath()
290 pairs[final] = Pair(rfst.Start(), Weight::One()); in ShortestPath()
296 Pair p = pairs[state]; in ShortestPath()
314 pairs.push_back(Pair(arc.nextstate, w)); in ShortestPath()
325 pairs.push_back(Pair(superfinal, w)); in ShortestPath()
/external/clang/test/SemaCXX/
Dfor-range-examples.cpp142 map_range::vector<T> pairs; in main() local
143 pairs.push_back(T(42, 12.9)); in main()
144 pairs.push_back(T(6, 4.2)); in main()
145 pairs.push_back(T(9, 1.1)); in main()
146 for (auto a : map(map_range::mem_fun(&T::get<int>), pairs)) { in main()
/external/webkit/Tools/Scripts/webkitpy/thirdparty/simplejson/
Ddecoder.py119 pairs = {}
125 return pairs, end + 1
141 pairs[key] = value
156 pairs = object_hook(pairs)
157 return pairs, end
/external/webkit/Tools/QueueStatusServer/model/
Dactiveworkitems.py47 def _set_item_time_pairs(self, pairs): argument
48 if pairs:
51 self.item_ids, self.item_dates = map(list, zip(*pairs))
/external/skia/src/effects/
DSkPorterDuff.cpp48 const Pair* pairs = gPairs; in find_pdmode() local
50 if (pairs[i].fXF == src) { in find_pdmode()
52 *dst = pairs[i].fPD; in find_pdmode()
/external/chromium/base/
Dstring_split.cc100 std::vector<std::string> pairs; in SplitStringIntoKeyValuePairs() local
101 SplitString(line, key_value_pair_delimiter, &pairs); in SplitStringIntoKeyValuePairs()
104 for (size_t i = 0; i < pairs.size(); ++i) { in SplitStringIntoKeyValuePairs()
107 if (pairs[i].empty()) in SplitStringIntoKeyValuePairs()
112 if (!SplitStringIntoKeyValues(pairs[i], in SplitStringIntoKeyValuePairs()
/external/openfst/src/include/fst/
Dshortest-path.h214 ShortestPathCompare(const vector<Pair>& pairs, in ShortestPathCompare() argument
217 : pairs_(pairs), distance_(distance), superfinal_(sfinal), delta_(d) {} in ShortestPathCompare()
304 vector<Pair> pairs; variable
310 compare(pairs, distance, superfinal, delta);
328 while (pairs.size() <= final)
329 pairs.push_back(Pair(kNoStateId, Weight::Zero()));
330 pairs[final] = Pair(ifst.Start(), Weight::One());
337 Pair p = pairs[state];
362 pairs.push_back(Pair(arc.nextstate, w));
373 pairs.push_back(Pair(superfinal, w));
Dutil.h275 vector<pair<Label, Label> >* pairs,
288 pairs->clear();
306 pairs->push_back(make_pair(frmlabel, tolabel));
314 const vector<pair<Label, Label> >& pairs) { in WriteLabelPairs()
324 for (ssize_t n = 0; n < pairs.size(); ++n) in WriteLabelPairs()
325 *strm << pairs[n].first << "\t" << pairs[n].second << "\n"; in WriteLabelPairs()
/external/valgrind/main/cachegrind/
Dcg_annotate.in801 my @pairs;
803 push(@pairs, $line_nums[$i] - $context); # lower marker
808 push(@pairs, $line_nums[$i] + $context); # upper marker
812 $pairs[0] = 1 if ($pairs[0] < 1);
813 while (@pairs) {
814 my $low = shift @pairs;
815 my $high = shift @pairs;
/external/srec/srec/EventLog/src/
Driff.c509 RiffKVPair *pairs; in readSwiChunk() local
528 for (pairs = swichunk->kvals.kvpairs, i = 0; i < swichunk->kvals.num_pairs; i++, pairs++) in readSwiChunk()
530 pairs->key = kvpair_buf; in readSwiChunk()
532 pairs->value = kvpair_buf; in readSwiChunk()
1080 RiffKVPair *pairs; in convertBuf2Riff() local
1092 for (pairs = swichunk->kvals.kvpairs, i = 0; i < num_pairs; i++, pairs++) in convertBuf2Riff()
1094 strcpy((char *)ptr, pairs->key); in convertBuf2Riff()
1095 ptr += strlen(pairs->key) + 1; in convertBuf2Riff()
1097 strcpy((char *)ptr, pairs->value); in convertBuf2Riff()
1098 ptr += strlen(pairs->value) + 1; in convertBuf2Riff()
/external/valgrind/main/callgrind/
Dcallgrind_annotate.in1117 my @pairs;
1119 push(@pairs, $line_nums[$i] - $context); # lower marker
1124 push(@pairs, $line_nums[$i] + $context); # upper marker
1128 $pairs[0] = 1 if ($pairs[0] < 1);
1129 while (@pairs) {
1130 my $low = shift @pairs;
1131 my $high = shift @pairs;
/external/webkit/Tools/CodeCoverage/
Dregenerate-coverage-display169 def replace(text, *pairs): argument
174 while pairs:
175 (a,b) = pairs[0]
177 pairs = pairs[1:]

123456789