/external/harfbuzz/contrib/tables/ |
mirroring-parse.py | 12 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/icu4c/layout/ |
KernTable.h | 34 const PairInfo* pairs; member in class:KernTable
|
KernTable.cpp | 74 : pairs(0), font(font) 117 pairs = (const PairInfo*)((char*)table + KERN_SUBTABLE_0_HEADER_SIZE); 120 fprintf(stderr, "coverage: %0.4x nPairs: %d pairs 0x%x\n", coverage, nPairs, pairs); 135 const PairInfo* p = pairs; 172 if (pairs) { 186 const PairInfo* p = pairs; 205 fprintf(stdout, " %.3d (%0.8x)\n", ((char*)tp - (char*)pairs)/KERN_PAIRINFO_SIZE, tkey);
|
/frameworks/wilhelm/src/ut/ |
OpenSLESUT.c | 43 static Pair pairs[] = { variable 106 const Pair *end = &pairs[sizeof(pairs)/sizeof(pairs[0])]; 107 for (p = pairs; p != end; ++p) {
|
/external/nist-sip/java/gov/nist/core/ |
MultiValueMapImpl.java | 56 Set pairs = map.entrySet(); local 58 if (pairs == null) 61 Iterator pairsIterator = pairs.iterator(); 72 Set pairs = map.entrySet(); local 73 Iterator pairsIterator = pairs.iterator(); 85 Set pairs = map.entrySet(); local 86 Iterator pairsIterator = pairs.iterator();
|
/external/skia/src/core/ |
SkPixelRef.cpp | 188 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;
|
SkFlattenable.cpp | 394 SkDebugf("%s has no registered name/factory pairs." 405 const Pair* pairs = gPairs; 407 if (strcmp(pairs[i].fName, name) == 0) { 408 return pairs[i].fFactory; 418 const Pair* pairs = gPairs; 420 if (pairs[i].fFactory == fact) { 421 return pairs[i].fName;
|
/external/skia/src/effects/ |
SkPorterDuff.cpp | 48 const Pair* pairs = gPairs; local 50 if (pairs[i].fXF == src) { 52 *dst = pairs[i].fPD;
|
/packages/apps/Browser/src/com/android/browser/ |
PreloadRequestReceiver.java | 113 final Bundle pairs = i.getBundleExtra(Browser.EXTRA_HEADERS); local 114 if (pairs != null && !pairs.isEmpty()) { 115 Iterator<String> iter = pairs.keySet().iterator(); 119 headers.put(key, pairs.getString(key));
|
/external/webkit/Source/WebCore/platform/ |
MIMETypeRegistry.cpp | 269 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[ndx].extension, synonyms) [all...] |
/sdk/ninepatch/src/com/android/ninepatch/ |
NinePatchChunk.java | 384 private Pair<Integer> getPadding(List<Pair<Integer>> pairs) { 385 if (pairs.size() == 0) { 387 } else if (pairs.size() == 1) { 388 if (pairs.get(0).mFirst == 0) { 389 return new Pair<Integer>(pairs.get(0).mSecond - pairs.get(0).mFirst, 0); 391 return new Pair<Integer>(0, pairs.get(0).mSecond - pairs.get(0).mFirst); 394 int index = pairs.size() - 1; 395 return new Pair<Integer>(pairs.get(0).mSecond - pairs.get(0).mFirst [all...] |
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_tools_windows/tools/ |
picoloaddbg.lua | 106 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
|
picoloadphones.lua | 104 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/qemu/android/utils/ |
ini.c | 39 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 with empty values. If 0, save al [all...] |
/external/webkit/Tools/QueueStatusServer/model/ |
activeworkitems.py | 43 # The id/date pairs should probably just be their own class. 47 def _set_item_time_pairs(self, pairs): 48 if pairs: 51 self.item_ids, self.item_dates = map(list, zip(*pairs))
|
/frameworks/ml/bordeaux/learning/multiclass_pa/jni/ |
jni_multiclass_pa.cpp | 27 const int length, vector<pair<int, float> >* pairs) { 28 pairs->clear(); 32 pairs->push_back(new_pair);
|
/external/webkit/Tools/Scripts/webkitpy/thirdparty/simplejson/ |
decoder.py | 119 pairs = {} 125 return pairs, end + 1 141 pairs[key] = value 156 pairs = object_hook(pairs) 157 return pairs, end
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
shortest-path.h | 173 ShortestPathCompare(const vector<Pair>& pairs, 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.push_back(Pair(arc.nextstate, w)) [all...] |
/external/chromium/base/ |
string_split.cc | 100 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/clang/test/SemaCXX/ |
for-range-examples.cpp | 142 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/regex-re2/re2/ |
make_unicode_casefold.py | 62 def _MakeRanges(pairs): 91 for a, b in pairs: 132 print "// %d groups, %d pairs, %d ranges" % (len(casegroups), len(foldpairs), len(foldranges))
|
/external/valgrind/main/cachegrind/ |
cg_annotate.in | 801 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/doclava/src/com/google/doclava/ |
LinkReference.java | 83 int pairs = 0; local 91 pairs++; 94 pairs++; 97 pairs--; 100 pairs--; 106 if (pairs == 0) { 118 if (index == len && pairs != 0) {
|
/external/openfst/src/include/fst/ |
util.h | 270 // 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";
|
shortest-path.h | 214 ShortestPathCompare(const vector<Pair>& pairs, 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.push_back(Pair(arc.nextstate, w)) [all...] |