/external/jcommander/src/test/java/com/beust/jcommander/args/ |
H A D | ArgsArityInteger.java | 32 @Parameter(names = "-pairs", arity = 2, description = "Pairs") 33 public List<Integer> pairs; field in class:ArgsArityInteger
|
H A D | ArgsArityString.java | 32 @Parameter(names = "-pairs", arity = 2, description = "Pairs") 33 public List<String> pairs; field in class:ArgsArityString
|
/external/chromium-trace/catapult/tracing/tracing/mre/ |
H A D | mre_result.py | 13 def __init__(self, failures=None, pairs=None): 16 if pairs is None: 17 pairs = {} 19 self._pairs = pairs 26 def pairs(self): member in class:MreResult 31 'pairs': self._pairs
|
/external/curl/tests/unit/ |
H A D | unit1395.c | 47 const struct dotdot pairs[] = { variable in typeref:struct:dotdot 70 for(i=0; i < sizeof(pairs)/sizeof(pairs[0]); i++) { 71 char *out = Curl_dedotdotify((char *)pairs[i].input); 74 if(strcmp(out, pairs[i].output)) { 76 i, pairs[i].input, out, pairs[i].output);
|
/external/icu/icu4c/source/layout/ |
H A D | KernTable.h | 35 LEReferenceToArrayOf<PairInfo> pairs; member in class:KernTable
|
/external/skia/src/svg/parser/ |
H A D | SkSVGPaintState.cpp | 79 // iterate through colon / semi-colon delimited pairs 80 int pairs = SkParse::Count(attrValue, ';'); local 93 } while (--pairs);
|
/external/lzma/CPP/Common/ |
H A D | TextConfig.cpp | 50 bool GetTextConfig(const AString &s, CObjectVector<CTextConfigPair> &pairs)
argument 52 pairs.Clear();
105 pairs.Add(pair);
110 int FindTextConfigItem(const CObjectVector<CTextConfigPair> &pairs, const UString &id) throw()
argument 112 FOR_VECTOR (i, pairs)
113 if (pairs[i].ID == id)
118 UString GetTextConfigValue(const CObjectVector<CTextConfigPair> &pairs, const UString &id)
argument 120 int index = FindTextConfigItem(pairs, id);
123 return pairs[index].String;
|
/external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/translit/ |
H A D | UnicodeSetCloseOver.java | 107 * groups: 'pairs', and 'nonpairs'. Create a tally of the length 128 * @param pairs Accumulate equivalency classes that consist of 134 * not including pairs. Each length structure is represented by a 141 StringBuffer pairs, 153 pairs.append(a).append(b); 155 // Note that pairs are included in 'lengths' 189 StringBuffer pairs = new StringBuffer(); 196 analyzeCaseData(equivClasses, pairs, nonpairs, lengths); 205 out.println(Utility.formatForSource(pairs.toString()) + ";"); 223 // In C++, the pairs ar 140 analyzeCaseData(Map equivClasses, StringBuffer pairs, Vector nonpairs, Vector lengths) argument [all...] |
/external/fio/ |
H A D | json.h | 37 struct json_pair **pairs; member in struct:json_object
|
H A D | json.c | 130 json_free_pair(obj->pairs[i]); 131 free(obj->pairs); 186 struct json_pair **pairs = realloc(obj->pairs, local 188 if (!pairs) 190 pairs[obj->pair_cnt] = pair; 192 obj->pairs = pairs; 310 json_print_pair(obj->pairs[i]);
|
/external/libbrillo/brillo/ |
H A D | data_encoding.cc | 91 std::vector<std::string> pairs; local 92 pairs.reserve(params.size()); 96 pairs.push_back(brillo::string_utils::Join("=", key, value)); 99 return brillo::string_utils::Join("&", pairs);
|
/external/libchrome/base/strings/ |
H A D | string_split.cc | 214 std::vector<StringPiece> pairs = SplitStringPiece( local 217 key_value_pairs->reserve(pairs.size()); 220 for (const StringPiece& pair : pairs) { 222 // Don't return here, to allow for pairs without associated
|
/external/libmicrohttpd/src/testspdy/ |
H A D | test_struct_namevalue.c | 31 char *pairs[] = {"one","1","two","2","three","3","four","4","five","5"}; variable 49 if(strcmp(name,pairs[*c]) != 0) 59 if(strcmp(value[0],pairs[(*c)+1]) != 0) 112 size = sizeof(pairs)/sizeof(pairs[0]); 131 if(SPDY_YES != SPDY_name_value_add(container,pairs[i],pairs[i+1])) 149 value = SPDY_name_value_lookup(container,pairs[i], &ret); 150 if(NULL == value || 1 !=ret || strcmp(value[0], pairs[i+1]) != 0) 153 (NULL == value) ? -1 : strcmp(value[0], pairs[ [all...] |
/external/libweave/src/ |
H A D | data_encoding.cc | 88 std::vector<std::string> pairs; local 89 pairs.reserve(params.size()); 93 pairs.push_back(Join("=", key, value)); 96 return Join("&", pairs);
|
/external/opencv3/modules/calib3d/src/ |
H A D | checkchessboard.cpp | 85 static void countClasses(const std::vector<std::pair<float, int> >& pairs, size_t idx1, size_t idx2, std::vector<int>& counts) argument 90 counts[pairs[i].second]++;
|
/external/gmock/src/ |
H A D | gmock-matchers.cc | 312 static void LogElementMatcherPairVec(const ElementMatcherPairs& pairs, argument 318 for (Iter it = pairs.begin(); it != pairs.end(); ++it) {
|
/external/libchrome/base/ |
H A D | sys_info_chromeos.cc | 112 // Parse and cache lsb_release key pairs. There should only be a handful 115 base::StringPairs pairs; local 116 SplitStringIntoKeyValuePairs(lsb_release, '=', '\n', &pairs); 117 for (size_t i = 0; i < pairs.size(); ++i) { 119 TrimWhitespaceASCII(pairs[i].first, TRIM_ALL, &key); 120 TrimWhitespaceASCII(pairs[i].second, TRIM_ALL, &value);
|
/external/lzma/CPP/7zip/Bundles/SFXSetup/ |
H A D | SfxSetup.cpp | 170 CObjectVector<CTextConfigPair> pairs;
local 171 if (!GetTextConfig(config, pairs))
177 UString friendlyName = GetTextConfigValue(pairs, L"Title");
178 UString installPrompt = GetTextConfigValue(pairs, L"BeginPrompt");
179 UString progress = GetTextConfigValue(pairs, L"Progress");
182 int index = FindTextConfigItem(pairs, L"Directory");
184 dirPrefix = pairs[index].String;
191 appLaunched = GetTextConfigValue(pairs, L"RunProgram");
194 executeFile = GetTextConfigValue(pairs, L"ExecuteFile");
195 executeParameters = GetTextConfigValue(pairs, [all...] |
/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/v8/src/compiler/ |
H A D | loop-peeling.cc | 105 // Maps a node to its index in the {pairs} vector. 108 NodeVector* pairs; member in struct:v8::internal::compiler::Peeling 111 : node_map(graph, static_cast<uint32_t>(max)), pairs(p) {} 115 return pairs->at(node_map.Get(node)); 119 node_map.Set(original, 1 + pairs->size()); 120 pairs->push_back(original); 121 pairs->push_back(copy); 135 Node* copy = pairs->at(node_map.Get(original));
|
/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/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/ |
H A D | btCompoundCompoundCollisionAlgorithm.cpp | 62 btSimplePairArray& pairs = m_childCollisionAlgorithmCache->getOverlappingPairArray(); local 63 for (i=0;i<pairs.size();i++) 65 if (pairs[i].m_userPointer) 68 ((btCollisionAlgorithm*)pairs[i].m_userPointer)->getAllContactManifolds(manifoldArray); 76 btSimplePairArray& pairs = m_childCollisionAlgorithmCache->getOverlappingPairArray(); local 78 int numChildren = pairs.size(); 82 if (pairs[i].m_userPointer) 84 btCollisionAlgorithm* algo = (btCollisionAlgorithm*) pairs[i].m_userPointer; 316 btSimplePairArray& pairs = m_childCollisionAlgorithmCache->getOverlappingPairArray(); local 317 for (i=0;i<pairs 354 btSimplePairArray& pairs = m_childCollisionAlgorithmCache->getOverlappingPairArray(); local [all...] |
/external/icu/icu4c/source/test/intltest/ |
H A D | tstnorm.cpp | 1177 // test composePair() for some pairs of characters that do not compose 1183 errln("NFC.composePair() incorrectly composes some pairs of characters"); 1423 static const StringPair pairs[]={ local 1440 for(int32_t i=0; i<UPRV_LENGTHOF(pairs); ++i) { 1441 const StringPair &pair=pairs[i]; 1453 static const StringPair pairs[]={ local 1472 for(int32_t i=0; i<UPRV_LENGTHOF(pairs); ++i) { 1473 const StringPair &pair=pairs[i];
|
/external/libchrome/base/process/ |
H A D | process_metrics_linux.cc | 33 void TrimKeyValuePairs(StringPairs* pairs) { argument 34 DCHECK(pairs); 35 StringPairs& p_ref = *pairs; 68 StringPairs pairs; local 69 SplitStringIntoKeyValuePairs(status, ':', '\n', &pairs); 70 TrimKeyValuePairs(&pairs); 71 for (size_t i = 0; i < pairs.size(); ++i) { 72 const std::string& key = pairs[i].first; 73 const std::string& value_str = pairs[i].second; 109 StringPairs pairs; local 270 StringPairs pairs; local [all...] |
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/ |
H A D | btDbvtBroadphase.cpp | 396 printf("fixed(%u) dynamics(%u) pairs(%u)\r\n",m_sets[1].m_leaves,m_sets[0].m_leaves,m_paircache->getNumOverlappingPairs()); 425 //perform a sort, to find duplicates and to sort 'invalid' pairs to the end 483 //perform a sort, to sort 'invalid' pairs to the end 561 btBroadphasePairArray& pairs=m_paircache->getOverlappingPairArray(); local 562 if(pairs.size()>0) 565 int ni=btMin(pairs.size(),btMax<int>(m_newpairs,(pairs.size()*m_cupdates)/100)); 568 btBroadphasePair& p=pairs[(m_cid+i)%pairs.size()]; 581 if(pairs [all...] |