Searched refs:pair (Results 226 - 250 of 1401) sorted by relevance

1234567891011>>

/external/clang/test/CodeGenCXX/
H A Dcxx0x-initializer-stdinitializerlist.cpp274 struct pair { struct in namespace:PR12178
280 map(std::initializer_list<pair>);
487 template <class T1, class T2> struct pair { struct in namespace:B19773010
490 constexpr pair() : first(), second() {} function in struct:B19773010::pair
491 constexpr pair(T1 a, T2 b) : first(a), second(b) {} function in struct:B19773010::pair
496 testcase(std::initializer_list<pair<const char *, E>>);
501 // CHECK: store %"struct.B19773010::pair"* getelementptr inbounds ([1 x %"struct.B19773010::pair"], [1 x %"struct.B19773010::pair"]* bitcast ([1 x { i8*, i32 }]* @.ref.tmp{{.*}} to [1 x %"struct.B19773010::pair"]*), i6
510 PR22940_helper(const pair<void*, int>&) argument
[all...]
/external/clang/test/SemaTemplate/
H A Ddeduction-crash.cpp71 struct pair struct
73 template<class _Tuple, int = enable_if<__tuple_convertible<_Tuple, pair>::value>::type>
74 pair(_Tuple&& );
84 int operator<<( basic_ostream<char> , pair ) ;
/external/icu/icu4c/source/i18n/
H A Dcollationfastlatin.h101 * Use INDEX_MASK to find the pair of CEs after the fixed table.
229 static inline uint32_t getPrimaries(uint32_t variableTop, uint32_t pair) { argument
230 uint32_t ce = pair & 0xffff;
231 if(ce >= MIN_SHORT) { return pair & TWO_SHORT_PRIMARIES_MASK; }
232 if(ce > variableTop) { return pair & TWO_LONG_PRIMARIES_MASK; }
234 return pair; // special mini CE
244 static uint32_t getSecondaries(uint32_t variableTop, uint32_t pair);
245 static uint32_t getCases(uint32_t variableTop, UBool strengthIsPrimary, uint32_t pair);
246 static uint32_t getTertiaries(uint32_t variableTop, UBool withCaseBits, uint32_t pair);
247 static uint32_t getQuaternaries(uint32_t variableTop, uint32_t pair);
[all...]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/
H A Dpartition_copy.pass.cpp14 // pair<OutputIterator1, OutputIterator2>
35 typedef std::pair<output_iterator<int*>, int*> P;
/external/libcxx/test/std/containers/associative/map/map.access/
H A Dat.pass.cpp25 typedef std::pair<const int, double> V;
58 typedef std::pair<const int, double> V;
90 typedef std::pair<const int, double> V;
123 typedef std::pair<const int, double> V;
H A Dempty.pass.cpp34 typedef std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
/external/libcxx/test/std/containers/associative/map/map.cons/
H A Dcompare.pass.cpp34 std::map<int, double, C, min_allocator<std::pair<const int, double>>> m(C(3));
H A Ddefault.pass.cpp30 std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> m;
H A Diter_iter_comp_alloc.pass.cpp28 typedef std::pair<const int, double> V;
54 typedef std::pair<const int, double> V;
80 typedef std::pair<const int, double> V;
93 typedef std::pair<const int, double> V;
/external/libcxx/test/std/containers/associative/multimap/
H A Dempty.pass.cpp34 typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
/external/libcxx/test/std/containers/associative/multimap/multimap.cons/
H A Dcompare.pass.cpp34 std::multimap<int, double, C, min_allocator<std::pair<const int, double>>> m(C(3));
H A Ddefault.pass.cpp30 std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> m;
/external/libcxx/test/std/containers/associative/set/
H A Demplace.pass.cpp15 // pair<iterator, bool> emplace(Args&&... args);
29 typedef std::pair<M::iterator, bool> R;
49 typedef std::pair<M::iterator, bool> R;
69 typedef std::pair<M::iterator, bool> R;
80 typedef std::pair<M::iterator, bool> R;
/external/libcxx/test/std/containers/unord/unord.map/
H A Ddb_local_iterators_7.pass.cpp40 min_allocator<std::pair<const int, std::string>>> C;
/external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/
H A Dassign_init.pass.cpp13 // class Alloc = allocator<pair<const Key, T>>>
31 typedef std::allocator<std::pair<const int, std::string> > A;
37 typedef std::pair<int, std::string> P;
64 typedef min_allocator<std::pair<const int, std::string> > A;
70 typedef std::pair<int, std::string> P;
/external/libcxx/test/std/containers/unord/unord.map/unorder.map.modifiers/
H A Derase_iter_iter_db1.pass.cpp26 typedef std::pair<int, int> P;
H A Derase_iter_iter_db2.pass.cpp26 typedef std::pair<int, int> P;
H A Derase_iter_iter_db3.pass.cpp26 typedef std::pair<int, int> P;
/external/libcxx/test/std/containers/unord/unord.multimap/
H A Ddb_local_iterators_7.pass.cpp40 min_allocator<std::pair<const int, std::string>>> C;
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/
H A Derase_iter_iter_db1.pass.cpp26 typedef std::pair<int, int> P;
H A Derase_iter_iter_db2.pass.cpp26 typedef std::pair<int, int> P;
H A Derase_iter_iter_db3.pass.cpp26 typedef std::pair<int, int> P;
/external/libcxx/test/std/utilities/tuple/tuple.tuple/tuple.assign/
H A Dmove_pair.pass.cpp15 // tuple& operator=(pair<U1, U2>&& u);
42 typedef std::pair<double, std::unique_ptr<D>> T0;
/external/libcxx/test/std/utilities/tuple/tuple.tuple/tuple.cnstr/
H A Dmove_pair.pass.cpp14 // template <class U1, class U2> tuple(pair<U1, U2>&& u);
41 typedef std::pair<double, std::unique_ptr<D>> T0;
/external/llvm/include/llvm/ADT/
H A DDAGDeltaAlgorithm.h42 typedef std::pair<change_ty, change_ty> edge_ty;

Completed in 309 milliseconds

1234567891011>>