Searched defs:pair (Results 101 - 125 of 178) sorted by relevance

12345678

/external/clang/test/Index/
H A Drecursive-cxx-member-calls.cpp4 template < class _T1, class _T2 > struct pair { _T2 second; }; struct in namespace:std
69 typedef std::pair < IdentifierInfo, const char *>actualtype;
73 typedef std::pair < IdentifierInfo, const char *>actualtype;
202 // CHECK-tokens: Keyword: "template" [4:3 - 4:11] ClassTemplate=pair:4:44 (Definition)
203 // CHECK-tokens: Punctuation: "<" [4:12 - 4:13] ClassTemplate=pair:4:44 (Definition)
206 // CHECK-tokens: Punctuation: "," [4:23 - 4:24] ClassTemplate=pair:4:44 (Definition)
209 // CHECK-tokens: Punctuation: ">" [4:35 - 4:36] ClassTemplate=pair:4:44 (Definition)
210 // CHECK-tokens: Keyword: "struct" [4:37 - 4:43] ClassTemplate=pair:4:44 (Definition)
211 // CHECK-tokens: Identifier: "pair" [4:44 - 4:48] ClassTemplate=pair
[all...]
/external/icu/icu4c/source/test/intltest/
H A Dicusvtst.cpp705 const StringPair* pair = (const StringPair*)names[i]; local
706 logln(" " + pair->displayName + " --> " + pair->id);
745 const StringPair* pair = (const StringPair*)names[i]; local
746 logln(" " + pair->displayName + " --> " + pair->id);
917 const StringPair* pair = (const StringPair*)names[i]; local
918 logln(" " + pair->displayName + " --> " + pair->id);
942 const StringPair* pair local
[all...]
H A Dtstnorm.cpp1441 const StringPair &pair=pairs[i]; local
1442 UnicodeString input=UnicodeString(pair.input, -1, US_INV).unescape();
1443 UnicodeString expected=UnicodeString(pair.expected, -1, US_INV).unescape();
1473 const StringPair &pair=pairs[i]; local
1474 UnicodeString input=UnicodeString(pair.input, -1, US_INV).unescape();
1475 UnicodeString expected=UnicodeString(pair.expected, -1, US_INV).unescape();
/external/lzma/CPP/7zip/Archive/
H A DXzHandler.cpp951 const CMethodNamePair &pair = g_NamePairs[k]; local
952 if (StringsAreEqualNoCase_Ascii(_filterMethod.MethodName, pair.Name))
954 _filterId = pair.Id;
/external/lzma/CPP/7zip/UI/Common/
H A DArchiveExtractCallback.cpp1160 CExtrRefSortPair &pair = pairs[i]; local
1161 pair.Index = i;
1162 pair.Len = GetNumSlashes(_extractedFolderPaths[i]);
H A DLoadCodecs.cpp455 const CIconPair &pair = IconPairs[i]; local
456 if (ext.IsEqualToNoCase(pair.Ext))
458 iconIndex = pair.IconIndex;
H A DArchiveCommandLine.cpp343 CRenamePair &pair = renamePairs->AddNew(); local
344 pair.OldName = oldName;
345 pair.NewName = newName;
346 pair.RecursedType = type;
347 pair.WildcardParsing = wildcardMatching;
349 if (!pair.Prepare())
352 val += pair.OldName;
354 val += pair.NewName;
429 throw CArcCmdLineException("There is no second file name for rename pair:", nonSwitchStrings[oldIndex]);
641 NWildcard::CPair &pair local
884 const CCodePagePair &pair = g_CodePagePairs[i]; local
[all...]
H A DUpdate.cpp1441 CRefSortPair pair; local
1442 pair.Index = i;
1443 pair.Len = GetNumSlashes(phyPath);
1444 pairs.Add(pair);
/external/mksh/src/
H A Dhistrap.c1027 const struct mksh_sigpair *pair = mksh_sigpairs; local
1028 while ((pair->nr != i) && (pair->name != NULL))
1029 ++pair;
1030 cs = pair->name;
/external/skia/src/core/
H A DSkGeometry.cpp652 * Given an array and count, remove all pair-wise duplicates from the array,
876 SkDCubicPair pair = cubic.chopAt(roots[0]); local
878 dst[i] = pair.pts[i].asSkPoint();
1010 SkConic pair[2]; local
1011 this->chopAt(t1 ? t1 : t2, pair);
1012 *dst = pair[SkToBool(t1)];
/external/strace/
H A Dnet.c1089 int pair[2]; local
1091 if (umove_or_printaddr(tcp, addr, &pair))
1094 printpair_fd(tcp, pair[0], pair[1]);
/external/webrtc/webrtc/modules/video_coding/
H A Djitter_buffer.cc45 typedef std::pair<uint32_t, VCMFrameBuffer*> FrameListPair;
47 bool IsKeyFrame(FrameListPair pair) { argument
48 return pair.second->FrameType() == kVideoFrameKey;
51 bool HasNonEmptyState(FrameListPair pair) { argument
52 return pair.second->GetState() != kStateEmpty;
/external/clang/lib/CodeGen/
H A DCGBlocks.cpp350 std::pair<CharUnits,CharUnits> tinfo
2136 auto pair = BlockByrefInfos.insert({D, info}); local
2137 assert(pair.second && "info was inserted recursively?");
2138 return pair.first->second;
H A DCGObjC.cpp987 ComplexPairTy pair = EmitLoadOfComplex(LV, SourceLocation()); local
988 EmitStoreOfComplex(pair, MakeAddrLValue(ReturnValue, ivarType),
2418 // an extra retain/release pair by zeroing out the source of this
2635 // the retain/release pair.
2810 std::pair<LValue,llvm::Value*>
2838 return std::pair<LValue,llvm::Value*>(lvalue, value);
2841 std::pair<LValue,llvm::Value*>
2848 return std::pair<LValue,llvm::Value*>(lvalue, value);
/external/harfbuzz_ng/src/
H A Dhb-ot-layout-gpos-table.hh585 * pair--first glyph is listed in the
739 * in the pair--may be zero (0) */
742 * in the pair--may be zero (0) */
829 * first glyph of the pair--may be zero
832 * second glyph of the pair--may be
837 * the first glyph of the pair */
841 * the second glyph of the pair */
1422 case Pair: return_trace (u.pair.dispatch (c));
1438 PairPos pair; member in union:OT::PosLookupSubTable::__anon6408
/external/icu/icu4c/source/tools/gennorm2/
H A Dn2builder.cpp378 // Insert (trail, composite) pair into compositions list for the lead character.
385 i=0; // "insert" the first pair at index 0
641 // A Jamo leading consonant or an LV pair combines-forward if it is at the end,
768 const CompositionPair &pair=pairs[i]; local
770 UChar32 compositeAndFwd=pair.composite<<1;
771 if(getNormRef(pair.composite).compositions!=NULL) {
776 if(pair.trail<Normalizer2Impl::COMP_1_TRAIL_LIMIT) {
778 firstUnit=pair.trail<<1;
782 firstUnit=(pair.trail<<1)|Normalizer2Impl::COMP_1_TRIPLE;
788 (pair
[all...]
/external/icu/icu4c/source/tools/tzcode/
H A Dtz2icu.cpp911 bool isNotSet(const pair<const string,FinalRule>& p) {
919 bool mapsToUnknownRule(const pair<const string,FinalZone>& p) {
931 void insertRuleID(const pair<string,FinalRule>& p) { argument
935 void eraseRuleID(const pair<string,FinalZone>& p) { argument
1404 void mergeFinalZone(const pair<string,FinalZone>& p) { argument
/external/ipsec-tools/src/racoon/
H A Dipsec_doi.c184 struct prop_pair **pair; local
186 /* get proposal pair */
187 pair = get_proppair(sa, IPSECDOI_TYPE_PH1);
188 if (pair == NULL)
192 newsa = get_ph1approval(iph1, pair);
194 free_proppair(pair);
209 get_ph1approval(iph1, pair)
211 struct prop_pair **pair;
225 if (pair[i] == NULL)
227 for (s = pair[
892 struct prop_pair **pair; local
1290 struct prop_pair **pair = NULL; local
1635 struct prop_pair **pair, *p; local
1695 struct prop_pair **pair = NULL; local
[all...]
/external/v8/test/cctest/
H A Dtest-regexp.cc151 MinMaxPair pair = { min_match, max_match }; local
152 return pair;
/external/valgrind/VEX/priv/
H A Dguest_x86_helpers.c1616 ULong pair; local
1648 pair = x86g_check_fldcw ( (UInt)fpucw );
1649 fpround = (UInt)pair;
1650 ew = (VexEmNote)(pair >> 32);
H A Dguest_amd64_helpers.c1860 ULong pair; local
1892 pair = amd64g_check_fldcw ( (ULong)fpucw );
1893 fpround = (UInt)pair & 0xFFFFFFFFULL;
1894 ew = (VexEmNote)(pair >> 32);
2475 ULong pair; local
2505 pair = amd64g_check_fldcw ( (ULong)fpucw );
2506 fpround = (UInt)pair & 0xFFFFFFFFULL;
2507 ew = (VexEmNote)(pair >> 32);
/external/webp/src/enc/
H A Dhistogram.c574 // Pair of histograms. Negative idx1 value means that pair is out-of-date.
639 HistogramPair* const pair,
646 pair->idx1 = idx1;
647 pair->idx2 = idx2;
648 pair->cost_diff =
650 pair->cost_combo = histos->bit_cost_;
695 // Remove pairs intersecting the just combined best pair. This will
702 // Do not copy the invalid pair.
780 if (curr_cost_diff < best_cost_diff) { // found a better pair?
638 PreparePair(VP8LHistogram** histograms, int idx1, int idx2, HistogramPair* const pair, VP8LHistogram* const histos) argument
/external/v8/src/ppc/
H A Dsimulator-ppc.cc609 PrintF(" add argument 'fp' to print register pair double values\n");
1180 static void decodeObjectPair(ObjectPair* pair, intptr_t* x, intptr_t* y) { argument
1181 *x = pair->x;
1182 *y = pair->y;
1188 static void decodeObjectPair(ObjectPair* pair, intptr_t* x, intptr_t* y) { argument
1190 *x = static_cast<int32_t>(*pair >> 32);
1191 *y = static_cast<int32_t>(*pair);
1193 *x = static_cast<int32_t>(*pair);
1194 *y = static_cast<int32_t>(*pair >> 32);
1203 // all runtime calls return this pair
[all...]
/external/v8/src/parsing/
H A Dparser-base.h245 void AddDestructuringAssignment(DestructuringAssignment pair) { argument
246 destructuring_assignments_to_rewrite_.Add(pair);
/external/valgrind/coregrind/m_debuginfo/
H A Dreaddwarf3.c414 by a 0/0 pair.
687 /* Read a (host-)word pair. This is something of a hack since
814 AddrRange pair; local
820 pair.aMin = aMin;
821 pair.aMax = aMax;
822 VG_(addToXA)( xa, &pair );
842 AddrRange pair; local
857 /* Read a (host-)word pair. This is something of a hack since
879 pair.aMin = w1 + base + svma_of_referencing_CU;
880 pair
[all...]

Completed in 876 milliseconds

12345678