/external/chromium_org/components/password_manager/core/browser/ |
H A D | psl_matching_helper_unittest.cc | 22 TestPair pairs[] = { local 31 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(pairs); ++i) { 33 form1.signon_realm = pairs[i].url1; 35 form2.signon_realm = pairs[i].url2; 36 EXPECT_EQ(pairs[i].should_match, 39 << "First URL = " << pairs[i].url1 40 << ", second URL = " << pairs[i].url2;
|
/external/chromium_org/third_party/skia/src/svg/ |
H A D | SkSVGPaintState.cpp | 79 // iterate through colon / semi-colon delimited pairs 80 int pairs = SkParse::Count(attrValue, ';'); local 93 } while (--pairs);
|
/external/icu/icu4c/source/layout/ |
H A D | KernTable.h | 35 LEReferenceToArrayOf<PairInfo> pairs; member in class:KernTable
|
/external/skia/src/svg/ |
H A D | SkSVGPaintState.cpp | 79 // iterate through colon / semi-colon delimited pairs 80 int pairs = SkParse::Count(attrValue, ';'); local 93 } while (--pairs);
|
/external/chromium_org/third_party/ots/src/ |
H A D | kern.h | 26 std::vector<OpenTypeKERNFormat0Pair> pairs; member in struct:ots::OpenTypeKERNFormat0
|
/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/base/strings/ |
H A D | string_split.cc | 153 std::vector<std::string> pairs; local 154 SplitString(line, key_value_pair_delimiter, &pairs); 157 for (size_t i = 0; i < pairs.size(); ++i) { 158 // Don't add empty pairs into the result. 159 if (pairs[i].empty()) 164 if (!SplitStringIntoKeyValue(pairs[i], key_value_delimiter, &key, &value)) { 165 // Don't return here, to allow for pairs without associated
|
/external/chromium_org/chrome/browser/extensions/api/identity/ |
H A D | gaia_web_auth_flow.cc | 135 std::vector<std::pair<std::string, std::string> > pairs; local 136 base::SplitStringIntoKeyValuePairs(fragment, '=', '&', &pairs); 142 it = pairs.begin(); 143 it != pairs.end();
|
/external/fio/ |
H A D | json.h | 37 struct json_pair **pairs; member in struct:json_object
|
H A D | json.c | 136 json_free_pair(obj->pairs[i]); 137 free(obj->pairs); 192 struct json_pair **pairs = realloc(obj->pairs, local 194 if (!pairs) 196 pairs[obj->pair_cnt] = pair; 198 obj->pairs = pairs; 316 json_print_pair(obj->pairs[i]);
|
/external/chromium_org/base/ |
H A D | sys_info_chromeos.cc | 109 // Parse and cache lsb_release key pairs. There should only be a handful 112 std::vector<std::pair<std::string, std::string> > pairs; local 113 SplitStringIntoKeyValuePairs(lsb_release, '=', '\n', &pairs); 114 for (size_t i = 0; i < pairs.size(); ++i) { 116 TrimWhitespaceASCII(pairs[i].first, TRIM_ALL, &key); 117 TrimWhitespaceASCII(pairs[i].second, TRIM_ALL, &value);
|
/external/chromium_org/net/cert/ |
H A D | x509_cert_types_mac.cc | 91 CSSM_X509_TYPE_VALUE_PAIR* pairs; member in struct:net::__anon8504::KeyValuePairs 95 { SEC_ASN1_SET_OF, offsetof(KeyValuePairs, pairs), 230 NULL != (pair = name[rdn].pairs_list[0][pair_index].pairs);
|
/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/webrtc/modules/video_capture/android/ |
H A D | device_info_android.cc | 28 // Helper for storing lists of pairs of ints. Used e.g. for resolutions & FPS 33 static std::string IntPairsToString(const IntPairs& pairs, char separator) { argument 35 for (size_t i = 0; i < pairs.size(); ++i) { 38 stream << "(" << pairs[i].first << separator << pairs[i].second << ")";
|
/external/clang/test/SemaCXX/ |
H A D | 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/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/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | shortest-path.h | 173 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/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/chromium_org/chrome/browser/devtools/device/adb/ |
H A D | adb_device_info_query.cc | 245 std::vector<std::string> pairs; local 246 Tokenize(str, "-", &pairs); 247 if (pairs.size() != 2) 253 Tokenize(pairs[1].substr(1, pairs[1].size() - 2), ",", &numbers);
|
/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/qemu/android/utils/ |
H A D | 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 wit [all...] |
/external/chromium_org/chrome/common/extensions/docs/examples/apps/hello-php/lib/oauth/ |
H A D | OAuth.php | 821 $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/chromium_org/third_party/skia/src/effects/gradients/ |
H A D | SkGradientShaderPriv.h | 29 int pairs = count >> 1; local 30 for (int i = 0; i < pairs; i++) {
|
/external/skia/src/effects/gradients/ |
H A D | SkGradientShaderPriv.h | 29 int pairs = count >> 1; local 30 for (int i = 0; i < pairs; i++) {
|