/external/chromium_org/chrome/browser/password_manager/ |
psl_matching_helper_unittest.cc | 18 TestPair pairs[] = { local 27 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(pairs); ++i) { 29 form1.signon_realm = pairs[i].url1; 31 form2.signon_realm = pairs[i].url2; 32 EXPECT_EQ(pairs[i].should_match, 35 << "First URL = " << pairs[i].url1 36 << ", second URL = " << pairs[i].url2;
|
/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/chromium_org/cc/trees/ |
blocking_task_runner.cc | 24 std::vector<TaskRunnerPair> pairs; member in struct:cc::TaskRunnerPairs 36 for (size_t i = 0; i < task_runners->pairs.size(); ++i) { 37 if (task_runners->pairs[i].first->HasOneRef()) { 44 task_runners->pairs.erase(task_runners->pairs.begin() + i); 51 for (size_t i = 0; i < task_runners->pairs.size(); ++i) { 52 if (task_runners->pairs[i].first == current.get()) 53 return task_runners->pairs[i].second.get(); 57 task_runners->pairs.push_back(TaskRunnerPair(current, runner));
|
/external/chromium_org/components/auto_login_parser/ |
auto_login_parser.cc | 47 std::vector<std::pair<std::string, std::string> > pairs; 48 if (!base::SplitStringIntoKeyValuePairs(header, '=', '&', &pairs)) 53 for (size_t i = 0; i < pairs.size(); ++i) { 54 const std::pair<std::string, std::string>& pair = pairs[i];
|
/external/chromium_org/tools/win/split_link/ |
graph_dependencies.py | 37 # Break into pairs to uniq to make graph less of a mess. 43 pairs = line.split(' -> ') 44 for i in range(len(pairs) - 1): 45 deduplicated.add('%s -> %s;' % (pairs[i], pairs[i + 1]))
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/ |
closebrackets.js | 10 var pairs = DEFAULT_BRACKETS, explode = DEFAULT_EXPLODE_ON_ENTER; 11 if (typeof val == "string") pairs = val; 13 if (val.pairs != null) pairs = val.pairs; 16 var map = buildKeymap(pairs); 27 function buildKeymap(pairs) { 33 if (around && pairs.indexOf(around) % 2 == 0) 40 for (var i = 0; i < pairs.length; i += 2) (function(left, right) { 66 })(pairs.charAt(i), pairs.charAt(i + 1)) [all...] |
/external/chromium_org/third_party/ots/src/ |
kern.cc | 97 // Some fonts (e.g. calibri.ttf, pykes_peak_zero.ttf) have pairs >= 10923. 121 // Read kerning pairs. 122 subtable.pairs.reserve(num_pairs); 134 OTS_WARNING("Kerning pairs are not sorted."); 141 subtable.pairs.push_back(kerning_pair); 170 const uint16_t length = 14 + (6 * kern->subtables[i].pairs.size()); 174 !out->WriteU16(kern->subtables[i].pairs.size()) || 180 for (unsigned j = 0; j < kern->subtables[i].pairs.size(); ++j) { 181 if (!out->WriteU16(kern->subtables[i].pairs[j].left) || 182 !out->WriteU16(kern->subtables[i].pairs[j].right) | [all...] |
kern.h | 26 std::vector<OpenTypeKERNFormat0Pair> pairs; member in struct:ots::OpenTypeKERNFormat0
|
/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/chromium_org/third_party/simplejson/ |
decoder.py | 187 pairs = [] 199 result = object_pairs_hook(pairs) 201 pairs = {} 203 pairs = object_hook(pairs) 204 return pairs, end + 1 235 pairs.append((key, value)) 269 result = object_pairs_hook(pairs) 271 pairs = dict(pairs) [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/json/ |
decoder.py | 152 pairs = [] 153 pairs_append = pairs.append 165 result = object_pairs_hook(pairs) 167 pairs = {} 169 pairs = object_hook(pairs) 170 return pairs, end + 1 230 result = object_pairs_hook(pairs) 232 pairs = dict(pairs) [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/json/ |
decoder.py | 152 pairs = [] 153 pairs_append = pairs.append 165 result = object_pairs_hook(pairs) 167 pairs = {} 169 pairs = object_hook(pairs) 170 return pairs, end + 1 230 result = object_pairs_hook(pairs) 232 pairs = dict(pairs) [all...] |
/external/chromium_org/third_party/skia/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/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/ |
misc.py | 33 pairs = [] 44 pairs.append((start, end)) 48 pairs.append((start, end)) 49 ret = ', '.join(map(nice_pair, pairs))
|
/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];
|
/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];
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
test_collections.py | 722 # test random pairs of multisets 770 pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)] 771 self.assertEqual(sorted(OrderedDict(dict(pairs)).items()), pairs) # dict input 772 self.assertEqual(sorted(OrderedDict(**dict(pairs)).items()), pairs) # kwds input 773 self.assertEqual(list(OrderedDict(pairs).items()), pairs) # pairs input 775 c=3, e=5).items()), pairs) # mixed inpu [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
test_collections.py | 722 # test random pairs of multisets 770 pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)] 771 self.assertEqual(sorted(OrderedDict(dict(pairs)).items()), pairs) # dict input 772 self.assertEqual(sorted(OrderedDict(**dict(pairs)).items()), pairs) # kwds input 773 self.assertEqual(list(OrderedDict(pairs).items()), pairs) # pairs input 775 c=3, e=5).items()), pairs) # mixed inpu [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
mhlib.py | 776 internally as a list of three pairs: [(1,100), (200,400), 795 self.pairs = [] 801 self.pairs = [] 804 return cmp(self.pairs, other.pairs) 807 return hash(self.pairs) 813 self.pairs.sort() 815 while i < len(self.pairs): 816 alo, ahi = self.pairs[i-1] 817 blo, bhi = self.pairs[i [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
mhlib.py | 776 internally as a list of three pairs: [(1,100), (200,400), 795 self.pairs = [] 801 self.pairs = [] 804 return cmp(self.pairs, other.pairs) 807 return hash(self.pairs) 813 self.pairs.sort() 815 while i < len(self.pairs): 816 alo, ahi = self.pairs[i-1] 817 blo, bhi = self.pairs[i [all...] |