/external/chromium_org/components/password_manager/core/browser/ |
H A D | psl_matching_helper_unittest.cc | 22 TestPair pairs[] = { local 45 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(pairs); ++i) { 47 form1.signon_realm = pairs[i].url1; 49 form2.signon_realm = pairs[i].url2; 50 EXPECT_EQ(pairs[i].should_match, 52 << "First URL = " << pairs[i].url1 53 << ", second URL = " << pairs[i].url2;
|
/external/libcxx/test/utilities/utility/pairs/pairs.pair/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/utilities/utility/pairs/pairs.pair/Android.mk 19 test_name := utilities/utility/pairs/pairs.pair/default 23 test_name := utilities/utility/pairs/pairs.pair/const_first_const_second 27 test_name := utilities/utility/pairs/pairs.pair/copy_ctor 31 test_name := utilities/utility/pairs/pairs [all...] |
/external/libcxx/test/utilities/utility/pairs/pairs.spec/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/utilities/utility/pairs/pairs.spec/Android.mk 19 test_name := utilities/utility/pairs/pairs.spec/make_pair 23 test_name := utilities/utility/pairs/pairs.spec/comparison 27 test_name := utilities/utility/pairs/pairs.spec/non_member_swap
|
/external/libcxx/test/utilities/utility/pairs/pairs.general/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/utilities/utility/pairs/pairs.general/Android.mk 19 test_name := utilities/utility/pairs/pairs.general/nothing_to_do
|
/external/libcxx/test/utilities/utility/pairs/pair.astuple/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/utilities/utility/pairs/pair.astuple/Android.mk 19 test_name := utilities/utility/pairs/pair.astuple/pairs.by.type 20 test_src := pairs.by.type.pass.cpp 23 test_name := utilities/utility/pairs/pair.astuple/tuple_element 27 test_name := utilities/utility/pairs/pair.astuple/tuple_size 31 test_name := utilities/utility/pairs/pair.astuple/get_const 35 test_name := utilities/utility/pairs/pair.astuple/get_non_const 39 test_name := utilities/utility/pairs/pair.astuple/get_rv
|
/external/libcxx/test/utilities/utility/pairs/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/utilities/utility/pairs/Android.mk 19 test_name := utilities/utility/pairs/nothing_to_do
|
/external/libcxx/test/utilities/utility/pairs/pair.piecewise/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/utilities/utility/pairs/pair.piecewise/Android.mk 19 test_name := utilities/utility/pairs/pair.piecewise/piecewise_construct
|
/external/chromium_org/chrome/browser/resources/gaia_auth/ |
H A D | util.js | 17 * @return {Object} The key value pairs of the extracted params. 25 var pairs = search.split('&'); 26 for (var i = 0; i < pairs.length; ++i) { 27 var pair = pairs[i].split('=');
|
/external/chromium_org/components/auto_login_parser/ |
H A D | auto_login_parser.cc | 47 base::StringPairs pairs; 48 if (!base::SplitStringIntoKeyValuePairs(header, '=', '&', &pairs)) 53 for (base::StringPairs::const_iterator it = pairs.begin(); it != pairs.end();
|
/external/chromium_org/tools/win/split_link/ |
H A D | 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/brotli/src/brotli/enc/ |
H A D | cluster.h | 61 // it is below a threshold, stores the pair (idx1, idx2) in the *pairs heap. 66 std::vector<HistogramPair>* pairs) { 91 double threshold = pairs->empty() ? 1e99 : 92 std::max(0.0, (*pairs)[0].cost_diff); 103 pairs->push_back(p); 104 push_heap(pairs->begin(), pairs->end(), HistogramPairComparator()); 125 // We maintain a heap of histogram pairs, ordered by the bit cost reduction. 126 std::vector<HistogramPair> pairs; local 130 &pairs); 63 CompareAndPushToHeap(const Histogram<kSize>* out, const int* cluster_size, int idx1, int idx2, std::vector<HistogramPair>* pairs) argument [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/ |
H A D | closebrackets.js | 22 var pairs = DEFAULT_BRACKETS, explode = DEFAULT_EXPLODE_ON_ENTER; 23 if (typeof val == "string") pairs = val; 25 if (val.pairs != null) pairs = val.pairs; 28 var map = buildKeymap(pairs); 39 function buildKeymap(pairs) { 48 if (!around || pairs.indexOf(around) % 2 != 0) return CodeMirror.Pass; 57 for (var i = 0; i < pairs.length; i += 2) (function(left, right) { 118 })(pairs [all...] |
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
H A D | sort.h | 83 } pairs; member in struct:hist_entry 115 return !list_empty(&he->pairs.node); 121 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node); 128 list_add_tail(&pair->pairs.node, &he->pairs.head);
|
/external/chromium_org/third_party/ots/src/ |
H A D | 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[ [all...] |
H A D | kern.h | 26 std::vector<OpenTypeKERNFormat0Pair> pairs; member in struct:ots::OpenTypeKERNFormat0
|
/external/chromium_org/base/i18n/ |
H A D | build_utf8_validator_tables.cc | 192 // and |existing_set|, and append it to |pairs|. 196 PairVector* pairs) { 200 pairs->push_back(new_pair); 209 void MoveRightMostCharToSet(PairVector* pairs) { argument 211 PairVector::const_iterator it = pairs->begin(); 212 while (it != pairs->end() && it->character.empty()) { 216 CHECK(it != pairs->end()); 221 while (it != pairs->end()) { 242 new_pairs.swap(*pairs); 245 void MoveAllCharsToSets(PairVector* pairs) { argument 193 ConstructPairAndAppend(const Character& character, const Range& new_range, const StringSet& existing_set, PairVector* pairs) argument 263 LogStringSets(const PairVector& pairs) argument 328 GenerateStates(const PairVector& pairs) argument 448 PairVector pairs = InitializeCharacters(); local [all...] |
/external/nist-sip/java/gov/nist/core/ |
H A D | MultiValueMapImpl.java | 56 Set pairs = map.entrySet(); 58 if (pairs == null) 61 Iterator pairsIterator = pairs.iterator(); 72 Set pairs = map.entrySet(); 73 Iterator pairsIterator = pairs.iterator(); 85 Set pairs = map.entrySet(); 86 Iterator pairsIterator = pairs.iterator();
|
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/ |
H A D | 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 ! [all...] |
/external/icu/icu4c/source/layout/ |
H A D | KernTable.cpp | 78 : pairs(), fTable(base) 126 // pairs is an instance member, and table is on the stack. 127 // set 'pairs' based on table.getAlias(). This will range check it. 129 pairs = LEReferenceToArrayOf<PairInfo>(fTable, // based on overall table 137 fprintf(stderr, "coverage: %0.4x nPairs: %d pairs %p\n", coverage, nPairs, pairs.getAlias()); 142 fprintf(stderr, "coverage: %0.4x nPairs: %d pairs 0x%x\n", coverage, nPairs, pairs); 158 const PairInfo& p = pairs[i, success]; 195 if (LE_SUCCESS(success) && !pairs [all...] |
H A D | KernTable.h | 35 LEReferenceToArrayOf<PairInfo> pairs; member in class:KernTable
|
/external/chromium_org/third_party/simplejson/ |
H A D | 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...] |
/external/chromium_org/third_party/skia/src/effects/ |
H A D | SkPorterDuff.cpp | 48 const Pair* pairs = gPairs; local 50 if (pairs[i].fXF == src) { 52 *dst = pairs[i].fPD;
|
/external/skia/src/effects/ |
H A D | 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/ |
H A D | misc.py | 33 pairs = [] 44 pairs.append((start, end)) 48 pairs.append((start, end)) 49 ret = ', '.join(map(nice_pair, pairs))
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | switch.js | 385 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) {
|