Searched defs:pairs (Results 1 - 25 of 38) sorted by relevance

12

/external/icu4c/layout/
H A DKernTable.h34 const PairInfo* pairs; member in class:KernTable
/external/skia/src/svg/
H A DSkSVGPaintState.cpp79 // iterate through colon / semi-colon delimited pairs
80 int pairs = SkParse::Count(attrValue, ';'); local
93 } while (--pairs);
/external/skia/src/effects/
H A DSkPorterDuff.cpp48 const Pair* pairs = gPairs; local
50 if (pairs[i].fXF == src) {
52 *dst = pairs[i].fPD;
H A DSkGradientShader.cpp29 int pairs = count >> 1; local
30 for (int i = 0; i < pairs; i++) {
/external/chromium/base/
H A Dstring_split.cc100 std::vector<std::string> pairs; local
101 SplitString(line, key_value_pair_delimiter, &pairs);
104 for (size_t i = 0; i < pairs.size(); ++i) {
107 if (pairs[i].empty())
112 if (!SplitStringIntoKeyValues(pairs[i],
/external/chromium/net/base/
H A Dx509_cert_types_mac.cc79 KeyValuePair* pairs; member in struct:net::__anon2441::KeyValuePairs
83 { SEC_ASN1_SET_OF, offsetof(KeyValuePairs, pairs),
219 NULL != (pair = name[rdn].pairs_list[0][pair_index].pairs);
/external/clang/test/SemaCXX/
H A Dfor-range-examples.cpp142 map_range::vector<T> pairs; local
143 pairs.push_back(T(42, 12.9));
144 pairs.push_back(T(6, 4.2));
145 pairs.push_back(T(9, 1.1));
146 for (auto a : map(map_range::mem_fun(&T::get<int>), pairs)) {
/external/openfst/src/include/fst/
H A Dshortest-path.h214 ShortestPathCompare(const vector<Pair>& pairs, argument
217 : pairs_(pairs), distance_(distance), superfinal_(sfinal), delta_(d) {}
301 // characterized by a pair (s,w). The vector 'pairs' maps each
304 vector<Pair> pairs;
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
[all...]
H A Dutil.h270 // Utilities for reading/writing label pairs
275 vector<pair<Label, Label> >* pairs,
288 pairs->clear();
306 pairs->push_back(make_pair(frmlabel, tolabel));
314 const vector<pair<Label, Label> >& pairs) {
324 for (ssize_t n = 0; n < pairs.size(); ++n)
325 *strm << pairs[n].first << "\t" << pairs[n].second << "\n";
274 ReadLabelPairs(const string& filename, vector<pair<Label, Label> >* pairs, bool allow_negative = false) argument
313 WriteLabelPairs(const string& filename, const vector<pair<Label, Label> >& pairs) argument
H A Dsymbol-table.h487 // Relabels a symbol table as specified by the input vector of pairs
494 const vector<pair<Label, Label> > &pairs) {
499 for (size_t i = 0; i < pairs.size(); ++i)
500 new_table->AddSymbol(table->Find(pairs[i].first), pairs[i].second);
493 RelabelSymbolTable(const SymbolTable *table, const vector<pair<Label, Label> > &pairs) argument
H A Dlabel-reachable.h235 // Returns relabeling pairs (cf. relabel.h::Relabel()).
236 // If 'avoid_collisions' is true, extra pairs are added to
239 void RelabelPairs(vector<pair<Label, Label> > *pairs, argument
241 pairs->clear();
247 pairs->push_back(pair<Label, Label>(it->first, it->second));
255 pairs->push_back(pair<Label, Label>(i, label2index.size() + 1));
H A Dlookahead-matcher.h649 // Returns relabeling pairs (cf. relabel.h::Relabel()).
651 // If 'avoid_collisions' is true, extra pairs are added to
655 static void RelabelPairs(const L &mfst, vector<pair<Label, Label> > *pairs, argument
661 reachable.RelabelPairs(pairs, avoid_collisions);
684 vector<pair<Label, Label> > pairs; local
685 reachable.RelabelPairs(&pairs, true);
686 WriteLabelPairs(FLAGS_save_relabel_ipairs, pairs);
692 vector<pair<Label, Label> > pairs; local
693 reachable.RelabelPairs(&pairs, true);
694 WriteLabelPairs(FLAGS_save_relabel_opairs, pairs);
[all...]
/external/skia/src/core/
H A DSkPixelRef.cpp188 SkDebugf("%s has no registered name/factory pairs."
199 const Pair* pairs = gPairs;
201 if (strcmp(pairs[i].fName, name) == 0) {
202 return pairs[i].fFactory;
212 const Pair* pairs = gPairs; local
214 if (pairs[i].fFactory == fact) {
215 return pairs[i].fName;
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dshortest-path.h173 ShortestPathCompare(const vector<Pair>& pairs, argument
176 : pairs_(pairs), distance_(distance), superfinal_(sfinal), delta_(d) {}
270 // characterized by a pair (s,w). The vector 'pairs' maps each
273 vector<Pair> pairs; local
280 compare(pairs, *distance, superfinal, opts.delta);
288 while (pairs.size() <= final)
289 pairs.push_back(Pair(kNoStateId, Weight::Zero()));
290 pairs[final] = Pair(rfst.Start(), Weight::One());
296 Pair p = pairs[state];
314 pairs
[all...]
/external/webkit/Source/WebCore/platform/
H A DMIMETypeRegistry.cpp269 static const TypeExtensionPair pairs[] = { local
354 const unsigned numPairs = sizeof(pairs) / sizeof(pairs[0]);
357 if (mediaMIMETypeForExtensionMap.contains(pairs[ndx].extension))
358 mediaMIMETypeForExtensionMap.get(pairs[ndx].extension)->append(pairs[ndx].type);
364 String systemType = MIMETypeRegistry::getMIMETypeForExtension(pairs[ndx].extension);
365 if (!systemType.isEmpty() && pairs[ndx].type != systemType)
367 synonyms->append(pairs[ndx].type);
368 mediaMIMETypeForExtensionMap.add(pairs[nd
[all...]
/external/qemu/android/utils/
H A Dini.c39 IniPair* pairs; member in struct:IniFile
47 AFREE(i->pairs[nn].key);
48 i->pairs[nn].key = NULL;
49 i->pairs[nn].value = NULL;
51 AFREE(i->pairs);
99 AARRAY_RENEW(i->pairs, newMax);
103 pair = i->pairs + i->numPairs;
116 if (!strcmp(i->pairs[nn].key,key))
117 return &i->pairs[nn];
305 * strip - If 1, ignore (don't save) pairs wit
[all...]
/external/chromium/chrome/common/extensions/docs/examples/apps/hello-php/lib/oauth/
H A DOAuth.php821 $pairs = explode('&', $input); variable
824 foreach ($pairs as $pair) {
859 $pairs = array(); variable
867 $pairs[] = $parameter . '=' . $duplicate_value;
870 $pairs[] = $parameter . '=' . $value;
875 return implode('&', $pairs);
/external/srec/srec/EventLog/src/
H A Driff.c509 RiffKVPair *pairs; local
528 for (pairs = swichunk->kvals.kvpairs, i = 0; i < swichunk->kvals.num_pairs; i++, pairs++)
530 pairs->key = kvpair_buf;
532 pairs->value = kvpair_buf;
1080 RiffKVPair *pairs; local
1083 ck.ckLength = kvals_chunk_size; /* num_pairs and pairs themselves */
1092 for (pairs = swichunk->kvals.kvpairs, i = 0; i < num_pairs; i++, pairs++)
1094 strcpy((char *)ptr, pairs
[all...]
/external/chromium/chrome/browser/extensions/
H A Dextension_updater_unittest.cc317 // puts the key/value pairs into |result|. For keys with no value, the empty
322 std::vector<std::string> pairs; local
323 base::SplitString(params, '&', &pairs);
324 for (size_t i = 0; i < pairs.size(); i++) {
326 base::SplitString(pairs[i], '=', &key_val);
/external/icu4c/test/intltest/
H A Dtstnorm.cpp1392 static const StringPair pairs[]={ local
1409 for(int32_t i=0; i<LENGTHOF(pairs); ++i) {
1410 const StringPair &pair=pairs[i];
1422 static const StringPair pairs[]={ local
1441 for(int32_t i=0; i<LENGTHOF(pairs); ++i) {
1442 const StringPair &pair=pairs[i];
H A Dtranstst.cpp3506 const UnicodeString* pairs) {
3508 for (int32_t i=0; pairs[i].length() > 0; i+=2) {
3509 if (0==source.caseCompare(pairs[i], U_FOLD_CASE_DEFAULT)) {
3510 return pairs[i+1];
3505 _findMatch(const UnicodeString& source, const UnicodeString* pairs) argument
H A Dusettest.cpp1871 * as a pairs list. Ranges are listed in ascending Unicode order.
1875 UnicodeString pairs; local
1883 pairs.append((UChar)start).append((UChar)end);
1885 return pairs;
2040 "\") => pairs \"" +
2045 "\") => pairs \"" +
2060 errln(UnicodeString("FAIL: applyPattern(\""+ pattern + "\").toPattern() => " + temppattern + " => pairs \""+ escape(getPairs(*tempset)) + "\", expected pairs \"" +
2063 logln(UnicodeString("Ok: applyPattern(\""+ pattern + "\").toPattern() => " + temppattern + " => pairs \"" + escape(getPairs(*tempset)) + "\""));
3577 // Test with non-ASCII set strings - test proper handling of surrogate pairs
[all...]
/external/icu4c/tools/gennorm2/
H A Dn2builder.cpp128 UVector32 *compositions; // (trail, composite) pairs
363 const CompositionPair *pairs=leadNorm->getCompositionPairs(length); local
365 if(trail==pairs[i].trail) {
372 if(trail<pairs[i].trail) {
386 const CompositionPair *pairs=norm.getCompositionPairs(length); local
388 uint8_t trailCC=getCC(pairs[i].trail);
399 const CompositionPair *pairs=norm.getCompositionPairs(length); local
401 if(trail==pairs[i].trail) {
402 return pairs[i].composite;
404 if(trail<pairs[
687 const CompositionPair *pairs=p->getCompositionPairs(length); local
[all...]
/external/llvm/utils/TableGen/
H A DFixedLenDecoderEmitter.cpp811 std::pair<StringRef, StringRef> pairs = SR.split(','); local
812 while (pairs.second.size()) {
813 emitSinglePredicateMatch(o, pairs.first, Emitter->PredicateNamespace);
815 pairs = pairs.second.split(',');
817 emitSinglePredicateMatch(o, pairs.first, Emitter->PredicateNamespace);
/external/opencv/ml/src/
H A Dml_inner_functions.cpp1101 CvSampleResponsePair* pairs = 0; local
1115 CV_CALL( pairs = (CvSampleResponsePair*)cvAlloc( (sample_count+1)*sizeof(pairs[0])));
1119 pairs[i].sample = samples[i];
1120 pairs[i].mask = (mask) ? (mask[i]) : 0;
1121 pairs[i].response = classes->data.i[i];
1122 pairs[i].index = i;
1126 qsort( pairs, sample_count, sizeof(pairs[0]), icvCmpSampleResponsePairs );
1127 pairs[sample_coun
[all...]

Completed in 540 milliseconds

12