| /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/skia/src/core/ |
| SkFlattenable.cpp | 96 SkDebugf("%s has no registered name/factory pairs."
107 const Pair* pairs = gPairs;
109 if (strcmp(pairs[i].fName, name) == 0) {
110 return pairs[i].fFactory;
120 const Pair* pairs = gPairs; local
122 if (pairs[i].fFactory == fact) {
123 return pairs[i].fName;
|
| /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/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/ |
| AbstractSampleEncryptionBox.java | 70 e.pairs = new LinkedList<Entry.Pair>();
72 e.pairs.add(e.createPair(IsoTypeReader.readUInt16(content), IsoTypeReader.readUInt32(content)));
162 IsoTypeWriter.writeUInt16(byteBuffer, entry.pairs.size());
163 for (Entry.Pair pair : entry.pairs) {
196 public List<Pair> pairs = new LinkedList<Pair>(); field in class:AbstractSampleEncryptionBox.Entry
209 for (Entry.Pair pair : pairs) {
279 if (pairs != null ? !pairs.equals(entry.pairs) : entry.pairs != null)
[all...] |
| /external/skia/legacy/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;
|
| /external/skia/legacy/src/effects/ |
| SkPorterDuff.cpp | 48 const Pair* pairs = gPairs; local
50 if (pairs[i].fXF == src) {
52 *dst = pairs[i].fPD;
|
| /external/skia/src/effects/ |
| SkPorterDuff.cpp | 48 const Pair* pairs = gPairs; local
50 if (pairs[i].fXF == src) {
52 *dst = pairs[i].fPD;
|
| /external/marisa-trie/lib/marisa/ |
| tail.cc | 149 Vector<KeyIdPair> pairs; local
150 pairs.resize(keys.size());
157 pairs[i].first = RString(keys[i]);
158 pairs[i].second = (UInt32)i;
160 std::sort(pairs.begin(), pairs.end(), std::greater<KeyIdPair>());
166 temp_offsets.resize(pairs.size(), 1);
170 for (std::size_t i = 0; i < pairs.size(); ++i) {
171 const KeyIdPair &cur = pairs[i];
|
| trie-build.cc | 80 Vector<TerminalIdPair> pairs; local
81 pairs.resize(terminals.size());
82 for (UInt32 i = 0; i < pairs.size(); ++i) {
83 pairs[i].first = terminals[i];
84 pairs[i].second = i;
87 std::sort(pairs.begin(), pairs.end());
90 for (UInt32 i = 0; i < pairs.size(); ++i) {
91 while (node < pairs[i].first) {
95 if (node == pairs[i].first)
[all...] |
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| tail.cc | 149 Vector<KeyIdPair> pairs; local
150 pairs.resize(keys.size());
157 pairs[i].first = RString(keys[i]);
158 pairs[i].second = (UInt32)i;
160 std::sort(pairs.begin(), pairs.end(), std::greater<KeyIdPair>());
166 temp_offsets.resize(pairs.size(), 1);
170 for (std::size_t i = 0; i < pairs.size(); ++i) {
171 const KeyIdPair &cur = pairs[i];
|
| trie-build.cc | 89 Vector<TerminalIdPair> pairs; local
90 pairs.resize(terminals.size());
91 for (UInt32 i = 0; i < pairs.size(); ++i) {
92 pairs[i].first = terminals[i];
93 pairs[i].second = i;
96 std::sort(pairs.begin(), pairs.end());
99 for (UInt32 i = 0; i < pairs.size(); ++i) {
100 while (node < pairs[i].first) {
104 if (node == pairs[i].first)
[all...] |
| /external/skia/tools/ |
| rebaseline.py | 18 pairs = [ variable
50 for pair in pairs:
|
| /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...] |
| /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/openfst/src/include/fst/ |
| util.h | 271 // Utilities for reading/writing integer pairs (typically labels)
276 vector<pair<I, I> >* pairs,
289 pairs->clear();
308 pairs->push_back(make_pair(i1, i2));
316 const vector<pair<I, I> >& pairs) {
326 for (ssize_t n = 0; n < pairs.size(); ++n)
327 *strm << pairs[n].first << "\t" << pairs[n].second << "\n";
339 // Utilities for reading/writing label pairs
343 vector<pair<Label, Label> >* pairs,
[all...] |
| /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...] |
