/external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
H A D | mismatch_pred.pass.cpp | 15 // pair<Iter1, Iter2> 41 == (std::pair<II, II>(II(ia+3), II(ib+3)))); 43 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); 47 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); 53 == (std::pair<II, II>(II(ia+3), II(ib+3)))); 55 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); 58 == (std::pair<II, II>(II(ia+3), II(ib+3)))); 63 (std::pair<int*,int*>(ia+3,ib+3))); 67 (std::pair<int*,int*>(ia+3,ib+3))); 69 (std::pair<in [all...] |
H A D | mismatch.pass.cpp | 14 // pair<Iter1, Iter2> 37 == (std::pair<II, II>(II(ia+3), II(ib+3)))); 40 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); 44 == (std::pair<II, II>(II(ia+3), II(ib+3)))); 47 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); 51 == (std::pair<II, II>(II(ia+2), II(ib+2))));
|
/external/clang/test/SemaCXX/ |
H A D | implicit-member-functions.cpp | 88 template<typename T, typename U> struct pair { struct in namespace:Recursion 89 pair(); 93 pair(const pair<V,W> &); 107 pair<Point<K>, Vector<K>> x; 111 // pair's templated constructor, which triggers instantiation of the
|
/external/openfst/src/include/fst/script/ |
H A D | replace.h | 21 using std::pair; using std::make_pair; 32 typedef args::Package<const vector<pair<int64, const FstClass *> > &, 38 // pair<real label, real fst> that the real Replace will use 39 const vector<pair<int64, const FstClass *> >& untyped_tuples = 42 vector<pair<typename Arc::Label, const Fst<Arc> *> > fst_tuples( 55 void Replace(const vector<pair<int64, const FstClass *> > &tuples,
|
/external/libcxx/test/std/containers/associative/map/map.modifiers/ |
H A D | clear.pass.cpp | 25 typedef std::pair<int, double> P; 44 typedef std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M; 45 typedef std::pair<int, double> P;
|
/external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
H A D | clear.pass.cpp | 25 typedef std::pair<int, double> P; 44 typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M; 45 typedef std::pair<int, double> P;
|
/external/libcxx/test/std/containers/unord/unord.map/unorder.map.modifiers/ |
H A D | clear.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 28 typedef std::pair<int, std::string> P; 45 min_allocator<std::pair<const int, std::string>>> C; 46 typedef std::pair<int, std::string> P;
|
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
H A D | clear.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 28 typedef std::pair<int, std::string> P; 45 min_allocator<std::pair<const int, std::string>>> C; 46 typedef std::pair<int, std::string> P;
|
/external/libcxx/test/std/utilities/utility/pairs/pair.astuple/ |
H A D | get_non_const.pass.cpp | 12 // template <class T1, class T2> struct pair 15 // typename tuple_element<I, std::pair<T1, T2> >::type& 16 // get(pair<T1, T2>&); 23 std::pair<int, int> a; 28 constexpr std::pair<int, int> getP () { return { 3, 4 }; } 34 typedef std::pair<int, short> P;
|
/external/libcxx/test/std/containers/unord/unord.map/ |
H A D | load_factor.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 29 typedef std::pair<int, std::string> P; 46 typedef std::pair<int, std::string> P; 53 min_allocator<std::pair<const int, std::string>>> C; 54 typedef std::pair<int, std::string> P; 71 min_allocator<std::pair<const int, std::string>>> C; 72 typedef std::pair<int, std::string> P;
|
/external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
H A D | size_hash_equal_allocator.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 33 test_allocator<std::pair<const NotConstructible, 39 test_allocator<std::pair<const NotConstructible, NotConstructible> >(10) 45 (test_allocator<std::pair<const NotConstructible, NotConstructible> >(10))); 57 min_allocator<std::pair<const NotConstructible, 63 min_allocator<std::pair<const NotConstructible, NotConstructible> >() 69 (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
|
H A D | move.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 35 test_allocator<std::pair<const int, std::string> > 37 typedef std::pair<int, std::string> P; 50 test_allocator<std::pair<const int, std::string> >(10) 58 (test_allocator<std::pair<const int, std::string> >(10))); 71 test_allocator<std::pair<const int, std::string> > 73 typedef std::pair<int, std::string> P; 87 test_allocator<std::pair<const int, std::string> >(10) 99 (test_allocator<std::pair<const int, std::string> >(10))); 113 min_allocator<std::pair<cons [all...] |
/external/libcxx/test/std/containers/unord/unord.multimap/ |
H A D | load_factor.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 29 typedef std::pair<int, std::string> P; 46 typedef std::pair<int, std::string> P; 53 min_allocator<std::pair<const int, std::string>>> C; 54 typedef std::pair<int, std::string> P; 71 min_allocator<std::pair<const int, std::string>>> C; 72 typedef std::pair<int, std::string> P;
|
H A D | bucket_count.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 27 typedef std::pair<int, std::string> P; 34 typedef std::pair<int, std::string> P;
|
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
H A D | size_hash_equal_allocator.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 33 test_allocator<std::pair<const NotConstructible, 39 test_allocator<std::pair<const NotConstructible, NotConstructible> >(10) 45 (test_allocator<std::pair<const NotConstructible, NotConstructible> >(10))); 57 min_allocator<std::pair<const NotConstructible, 63 min_allocator<std::pair<const NotConstructible, NotConstructible> >() 69 (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
|
/external/libcxx/test/std/utilities/utility/pairs/pairs.spec/ |
H A D | comparison.pass.cpp | 12 // template <class T1, class T2> struct pair 14 // template <class T1, class T2> bool operator==(const pair<T1,T2>&, const pair<T1,T2>&); 15 // template <class T1, class T2> bool operator!=(const pair<T1,T2>&, const pair<T1,T2>&); 16 // template <class T1, class T2> bool operator< (const pair<T1,T2>&, const pair<T1,T2>&); 17 // template <class T1, class T2> bool operator> (const pair<T1,T2>&, const pair<T1,T2>&); 18 // template <class T1, class T2> bool operator>=(const pair<T [all...] |
/external/clang/test/CodeGen/ |
H A D | atomic-arm64.c | 60 void test3(pointer_pair_t pair) { argument 61 __c11_atomic_store(&a_pointer_pair, pair, memory_order_seq_cst);
|
/external/libcxx/test/std/containers/associative/map/map.cons/ |
H A D | alloc.pass.cpp | 26 typedef test_allocator<std::pair<const int, double> > A; 35 typedef min_allocator<std::pair<const int, double> > A;
|
/external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
H A D | alloc.pass.cpp | 26 typedef test_allocator<std::pair<const int, double> > A; 35 typedef min_allocator<std::pair<const int, double> > A;
|
/external/icu/icu4c/source/i18n/ |
H A D | collationfastlatin.cpp | 125 * Single mini CE or a pair. 462 * Single mini CE or a pair. 948 CollationFastLatin::getSecondaries(uint32_t variableTop, uint32_t pair) { argument 949 if(pair <= 0xffff) { 951 if(pair >= MIN_SHORT) { 952 pair = getSecondariesFromOneShortCE(pair); 953 } else if(pair > variableTop) { 954 pair = COMMON_SEC_PLUS_OFFSET; 955 } else if(pair > 974 getCases(uint32_t variableTop, UBool strengthIsPrimary, uint32_t pair) argument 1015 getTertiaries(uint32_t variableTop, UBool withCaseBits, uint32_t pair) argument 1066 getQuaternaries(uint32_t variableTop, uint32_t pair) argument [all...] |
/external/dexmaker/src/dx/java/com/android/dx/rop/annotation/ |
H A D | Annotation.java | 142 for (NameValuePair pair : elements.values()) { 148 sb.append(pair.getName().toHuman()); 150 sb.append(pair.getValue().toHuman()); 180 * @param pair {@code non-null;} the (name, value) pair to place into this instance 182 public void put(NameValuePair pair) { argument 185 if (pair == null) { 186 throw new NullPointerException("pair == null"); 189 elements.put(pair.getName(), pair); 199 add(NameValuePair pair) argument [all...] |
/external/skia/src/core/ |
H A D | SkMetaData.cpp | 49 PtrPair* pair = (PtrPair*)rec->data(); local 50 if (pair->fProc && pair->fPtr) { 51 pair->fPtr = pair->fProc(pair->fPtr, false); 98 PtrPair pair = { ptr, proc }; local 99 (void)this->set(name, &pair, sizeof(PtrPair), kPtr_Type, 1); 134 PtrPair* pair = (PtrPair*)rec->data(); local 135 if (pair 189 const PtrPair* pair = (const PtrPair*)rec->data(); local 258 PtrPair* pair = (PtrPair*)rec->data(); local [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | incomplete_lq_factorization.h | 84 vector<pair<int, double> >* scratch,
|
/external/deqp/modules/egl/ |
H A D | teglChooseConfigReference.hpp | 39 void chooseConfigReference (const eglw::Library& egl, eglw::EGLDisplay display, std::vector<eglw::EGLConfig>& dst, const std::vector<std::pair<eglw::EGLenum, eglw::EGLint> >& attributes);
|
/external/guava/guava-gwt/test-super/com/google/common/collect/testing/google/super/com/google/common/collect/testing/google/ |
H A D | BiMapInverseTester.java | 45 BiMapPair<K, V> pair = new BiMapPair<K, V>(getMap()); 46 BiMapPair<K, V> copy = SerializableTester.reserialize(pair); 47 assertEquals(pair.forward, copy.forward); 48 assertEquals(pair.backward, copy.backward);
|