| /external/drm_hwcomposer/ |
| drmresources.h | 50 std::pair<uint32_t, uint32_t> min_resolution() const {
54 std::pair<uint32_t, uint32_t> max_resolution() const {
95 std::pair<uint32_t, uint32_t> min_resolution_;
96 std::pair<uint32_t, uint32_t> max_resolution_;
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| BiMapInverseTester.java | 50 BiMapPair<K, V> pair = new BiMapPair<K, V>(getMap()); local
51 BiMapPair<K, V> copy = SerializableTester.reserialize(pair);
52 assertEquals(pair.forward, copy.forward);
53 assertEquals(pair.backward, copy.backward);
|
| /external/libchrome/base/containers/ |
| hash_tables.h | 33 struct hash<std::pair<Type1, Type2>> {
34 std::size_t operator()(std::pair<Type1, Type2> value) const {
48 class Alloc = std::allocator<std::pair<const Key, T>>>
56 class Alloc = std::allocator<std::pair<const Key, T>>>
|
| /external/libcxx/test/libcxx/containers/associative/ |
| tree_key_value_traits.pass.cpp | 28 typedef std::pair<int, int> Tp;
36 typedef std::pair<const int, int> Tp;
50 std::pair<const int, int> >::value), "");
52 std::pair<const int, int> >::value), "");
|
| /external/libcxx/test/libcxx/containers/unord/ |
| key_value_traits.pass.cpp | 28 typedef std::pair<int, int> Tp;
36 typedef std::pair<const int, int> Tp;
50 std::pair<const int, int> >::value), "");
52 std::pair<const int, int> >::value), "");
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| max_bucket_count.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
35 min_allocator<std::pair<const int, std::string>>> C;
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
| size.fail.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
34 test_allocator<std::pair<const NotConstructible,
42 (test_allocator<std::pair<const NotConstructible, NotConstructible> >()));
54 min_allocator<std::pair<const NotConstructible,
62 (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
|
| size.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
34 test_allocator<std::pair<const NotConstructible,
42 (test_allocator<std::pair<const NotConstructible, NotConstructible> >()));
54 min_allocator<std::pair<const NotConstructible,
62 (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
|
| size_hash.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
34 test_allocator<std::pair<const NotConstructible,
44 (test_allocator<std::pair<const NotConstructible, NotConstructible> >()));
56 min_allocator<std::pair<const NotConstructible,
66 (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
|
| size_hash_equal.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
34 test_allocator<std::pair<const NotConstructible,
45 (test_allocator<std::pair<const NotConstructible, NotConstructible> >()));
57 min_allocator<std::pair<const NotConstructible,
68 (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| erase_iter_db1.pass.cpp | 24 typedef std::pair<int, int> P;
|
| erase_iter_db2.pass.cpp | 26 typedef std::pair<int, int> P;
|
| erase_iter_iter_db4.pass.cpp | 26 typedef std::pair<int, int> P;
|
| /external/libcxx/test/std/containers/unord/unord.multimap/ |
| max_bucket_count.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
34 min_allocator<std::pair<const int, std::string>>> C;
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| size.fail.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
34 test_allocator<std::pair<const NotConstructible,
42 (test_allocator<std::pair<const NotConstructible, NotConstructible> >()));
54 min_allocator<std::pair<const NotConstructible,
62 (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
|
| size.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
34 test_allocator<std::pair<const NotConstructible,
42 (test_allocator<std::pair<const NotConstructible, NotConstructible> >()));
54 min_allocator<std::pair<const NotConstructible,
62 (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
|
| size_hash.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
34 test_allocator<std::pair<const NotConstructible,
44 (test_allocator<std::pair<const NotConstructible, NotConstructible> >()));
56 min_allocator<std::pair<const NotConstructible,
66 (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
|
| size_hash_equal.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
34 test_allocator<std::pair<const NotConstructible,
45 (test_allocator<std::pair<const NotConstructible, NotConstructible> >()));
57 min_allocator<std::pair<const NotConstructible,
68 (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_db1.pass.cpp | 24 typedef std::pair<int, int> P;
|
| erase_iter_db2.pass.cpp | 26 typedef std::pair<int, int> P;
|
| erase_iter_iter_db4.pass.cpp | 26 typedef std::pair<int, int> P;
|
| /external/libcxx/test/std/utilities/tuple/tuple.tuple/tuple.helper/ |
| tuple_size_value_sfinae.pass.cpp | 34 static_assert(has_value<std::pair<int, long> volatile>(), "");
|
| /external/libcxx/test/std/utilities/utility/pairs/pair.astuple/ |
| get_const_rv.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>&&);
30 typedef std::pair<std::unique_ptr<int>, short> P;
41 std::pair<int&, int const&> const p(x, y);
51 std::pair<int&&, int const&&> const p(std::move(x), std::move(y));
60 typedef std::pair<int, short> P;
|
| /external/libcxx/test/std/utilities/utility/pairs/pairs.pair/ |
| special_member_generation_test.pass.cpp | 14 // template <class T, class U> struct pair;
16 // pair(pair const&) = default;
17 // pair(pair &&) = default;
18 // pair& operator=(pair const&);
19 // pair& operator=(pair&&);
34 using P1 = std::pair<T1, int>
[all...] |
| /external/llvm/include/llvm/ADT/ |
| DAGDeltaAlgorithm.h | 42 typedef std::pair<change_ty, change_ty> edge_ty;
|
