/external/clang/test/CodeGen/ |
H A D | tbaa-thread-sanitizer.cpp | 7 struct pair { struct 9 pair(const iterator &a) : first(a) {} function in struct:pair 13 (void)pair(iterator());
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
H A D | minmax_init_list.pass.cpp | 13 // pair<T, T> 22 assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3))); 23 assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3))); 24 assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3))); 25 assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3))); 26 assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3))); 27 assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3))); 30 static_assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)), ""); 31 static_assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)), ""); 32 static_assert((std::minmax({2, 1, 3}) == std::pair<in [all...] |
H A D | minmax_init_list_comp.pass.cpp | 13 // pair<T, T> 30 std::pair<int, int> p = std::minmax(il, std::ref(pred)); 41 assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); 42 assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); 43 assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); 44 assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); 45 assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); 46 assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); 47 assert((std::minmax({1, 2, 3}, all_equal ) == std::pair<int, int>(1, 3))); 50 assert((std::minmax({1, 2, 2, 3, 3, 3, 5, 5, 5, 5, 5, 3}, std::ref(pred)) == std::pair<in [all...] |
/external/valgrind/none/tests/ |
H A D | allexec_prepare_prereq | 11 pair() function 31 pair x86 amd64 32 pair ppc32 ppc64 33 pair s390x_unexisting_in_32bits s390x 34 pair arm arm64 35 pair mips32 mips64 36 pair tilegx_unexisting_32bits tilegx
|
/external/clang/test/PCH/ |
H A D | crash-12631281.cpp | 15 template <class _T1, class _T2> struct pair { struct 19 pair(_U1&& , _U2&& ); // expected-note {{candidate}} 23 pair<_ForwardIterator, _ForwardIterator> __equal_range(_ForwardIterator) { 24 return pair<_ForwardIterator, _ForwardIterator>(0, 0); // expected-error {{no matching constructor}} 28 pair<_ForwardIterator, _ForwardIterator> equal_range( _ForwardIterator a) { 33 pair<int, int> range() {
|
/external/lzma/CPP/7zip/UI/Common/ |
H A D | UpdateProduce.cpp | 19 const CUpdatePair &pair = updatePairs[i];
local 23 up2.DirIndex = pair.DirIndex;
24 up2.ArcIndex = pair.ArcIndex;
27 switch(actionSet.StateActions[pair.State])
31 if (pair.State != NPairState::kOnlyOnDisk)
32 IgnoreArchiveItem(m_ArchiveItems[pair.ArcIndex]);
36 callback->ShowDeleteFile(pair.ArcIndex);
40 if (pair.State == NPairState::kOnlyOnDisk)
46 if (pair.State == NPairState::kOnlyInArchive ||
47 pair [all...] |
H A D | UpdatePair.cpp | 95 CUpdatePair pair;
local 103 pair.State = NUpdateArchive::NPairState::kOnlyOnDisk;
104 pair.DirIndex = dirIndex2;
109 pair.State = ai.Censored ?
112 pair.ArcIndex = arcIndex2;
119 pair.DirIndex = dirIndex2;
120 pair.ArcIndex = arcIndex2;
125 case -1: pair.State = NUpdateArchive::NPairState::kNewInArchive; break;
126 case 1: pair.State = NUpdateArchive::NPairState::kOldInArchive; break;
128 pair 140 CUpdatePair pair; local 148 CUpdatePair pair; local [all...] |
/external/libcxx/test/std/utilities/utility/pairs/pair.astuple/ |
H A D | tuple_size.pass.cpp | 12 // template <class T1, class T2> struct pair 14 // tuple_size<pair<T1, T2> >::value 21 typedef std::pair<int, short> P1;
|
H A D | get_const.pass.cpp | 12 // template <class T1, class T2> struct pair 15 // const typename tuple_element<I, std::pair<T1, T2> >::type& 16 // get(const pair<T1, T2>&); 24 typedef std::pair<int, short> P; 32 typedef std::pair<int, short> P;
|
/external/libcxx/test/std/utilities/utility/pairs/pairs.pair/ |
H A D | const_pair_U_V.pass.cpp | 12 // template <class T1, class T2> struct pair 14 // template <class U, class V> pair(const pair<U, V>& p); 22 typedef std::pair<int, short> P1; 23 typedef std::pair<double, long> P2; 32 typedef std::pair<int, short> P1; 33 typedef std::pair<double, long> P2;
|
H A D | copy_ctor.pass.cpp | 12 // template <class T1, class T2> struct pair 14 // pair(const pair&) = default; 22 typedef std::pair<int, short> P1; 29 static_assert((std::is_trivially_copy_constructible<std::pair<int, int> >::value), ""); 33 typedef std::pair<int, short> P1;
|
H A D | piecewise.pass.cpp | 12 // template <class T1, class T2> struct pair 15 // pair(piecewise_construct_t, tuple<Args1...> first_args, 26 typedef std::pair<int, int*> P1; 27 typedef std::pair<int*, int> P2; 28 typedef std::pair<P1, P2> P3;
|
H A D | assign_const_pair_U_V.pass.cpp | 12 // template <class T1, class T2> struct pair 14 // template<class U, class V> pair& operator=(const pair<U, V>& p); 22 typedef std::pair<int, short> P1; 23 typedef std::pair<double, long> P2;
|
H A D | default.pass.cpp | 12 // template <class T1, class T2> struct pair 14 // constexpr pair(); 22 typedef std::pair<float, short*> P; 30 typedef std::pair<float, short*> P;
|
/external/clang/test/CodeGenCXX/ |
H A D | pr20719.cpp | 24 struct pair { struct 25 pair(int, int); 32 pair x(K_void([] {}), K_int([] {}));
|
H A D | pr18635.cpp | 10 template <typename F, typename S> struct pair { struct in class:unique_ptr 14 pair<T *, int> data;
|
/external/skia/src/core/ |
H A D | SkPtrRecorder.cpp | 31 Pair pair; local 32 pair.fPtr = ptr; 34 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 47 Pair pair; local 48 pair.fPtr = ptr; 50 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 54 pair.fIndex = count + 1; 55 *fList.insert(index) = pair; [all...] |
/external/ppp/pppd/plugins/radius/ |
H A D | avpair.c | 26 * Purpose: add an attribute-value pair to the given list. 28 * Returns: pointer to added a/v pair upon success, NULL pointer upon failure. 30 * Remarks: Always appends the new pair to the end of the list. 53 * Purpose: assign the given value to an attribute-value pair. 104 * Purpose: make a new attribute-value pair with given parameters. 106 * Returns: pointer to generated a/v pair when successful, NULL when failure. 163 VALUE_PAIR *pair; local 207 if ((pair = 215 strcpy (pair->name, attr->name); 216 pair 270 VALUE_PAIR *pair; local 455 rc_avpair_free(VALUE_PAIR *pair) argument 529 VALUE_PAIR *pair; local 692 rc_avpair_tostr(VALUE_PAIR *pair, char *name, int ln, char *value, int lv) argument [all...] |
/external/llvm/include/llvm/DebugInfo/DWARF/ |
H A D | DWARFRelocMap.h | 17 typedef DenseMap<uint64_t, std::pair<uint8_t, int64_t> > RelocAddrMap;
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | radeon_program_pair.c | 38 int rc_pair_alloc_source(struct rc_pair_instruction *pair, argument 53 if (rgb && pair->RGB.Src[RC_PAIR_PRESUB_SRC].Used 54 && index != pair->RGB.Src[RC_PAIR_PRESUB_SRC].Index) { 58 if (alpha && pair->Alpha.Src[RC_PAIR_PRESUB_SRC].Used 59 && index != pair->Alpha.Src[RC_PAIR_PRESUB_SRC].Index) { 67 if (pair->RGB.Src[i].Used) { 68 if (pair->RGB.Src[i].File != file || 69 pair->RGB.Src[i].Index != index) { 77 if (pair->Alpha.Src[i].Used) { 78 if (pair 131 pair_foreach_source_callback( struct rc_pair_instruction * pair, void * data, rc_pair_foreach_src_fn cb, unsigned int swz, unsigned int src) argument 169 rc_pair_foreach_source_that_alpha_reads( struct rc_pair_instruction * pair, void * data, rc_pair_foreach_src_fn cb) argument 184 rc_pair_foreach_source_that_rgb_reads( struct rc_pair_instruction * pair, void * data, rc_pair_foreach_src_fn cb) argument [all...] |
/external/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.obs/ |
H A D | arrow.pass.cpp | 22 const std::shared_ptr<std::pair<int, int> > p(new std::pair<int, int>(3, 4));
|
/external/strace/tests/ |
H A D | dumpio.test | 7 run_prog ./unix-pair-send-recv abcdefghijklmnopqrstuvwxyz
|
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
H A D | CollationFastLatin.java | 93 * Use INDEX_MASK to find the pair of CEs after the fixed table. 294 * Single mini CE or a pair. 737 private static int getPrimaries(int variableTop, int pair) { argument 738 int ce = pair & 0xffff; 739 if(ce >= MIN_SHORT) { return pair & TWO_SHORT_PRIMARIES_MASK; } 740 if(ce > variableTop) { return pair & TWO_LONG_PRIMARIES_MASK; } 742 return pair; // special mini CE 754 private static int getSecondaries(int variableTop, int pair) { argument 755 if(pair <= 0xffff) { 757 if(pair > 779 getCases(int variableTop, boolean strengthIsPrimary, int pair) argument 819 getTertiaries(int variableTop, boolean withCaseBits, int pair) argument 869 getQuaternaries(int variableTop, int pair) argument [all...] |
/external/libcxx/test/std/containers/associative/map/ |
H A D | types.pass.cpp | 13 // class Allocator = allocator<pair<const Key, T>>> 20 // typedef pair<const key_type, mapped_type> value_type; 43 static_assert((std::is_same<C::value_type, std::pair<const int, double> >::value), ""); 45 static_assert((std::is_same<C::allocator_type, std::allocator<std::pair<const int, double> > >::value), ""); 46 static_assert((std::is_same<C::reference, std::pair<const int, double>&>::value), ""); 47 static_assert((std::is_same<C::const_reference, const std::pair<const int, double>&>::value), ""); 48 static_assert((std::is_same<C::pointer, std::pair<const int, double>*>::value), ""); 49 static_assert((std::is_same<C::const_pointer, const std::pair<const int, double>*>::value), ""); 55 typedef std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> C; 58 static_assert((std::is_same<C::value_type, std::pair<cons [all...] |
/external/libcxx/test/std/containers/associative/multimap/ |
H A D | types.pass.cpp | 13 // class Allocator = allocator<pair<const Key, T>>> 20 // typedef pair<const key_type, mapped_type> value_type; 43 static_assert((std::is_same<C::value_type, std::pair<const int, double> >::value), ""); 45 static_assert((std::is_same<C::allocator_type, std::allocator<std::pair<const int, double> > >::value), ""); 46 static_assert((std::is_same<C::reference, std::pair<const int, double>&>::value), ""); 47 static_assert((std::is_same<C::const_reference, const std::pair<const int, double>&>::value), ""); 48 static_assert((std::is_same<C::pointer, std::pair<const int, double>*>::value), ""); 49 static_assert((std::is_same<C::const_pointer, const std::pair<const int, double>*>::value), ""); 55 typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> C; 58 static_assert((std::is_same<C::value_type, std::pair<cons [all...] |