/external/libcxx/test/std/utilities/utility/pairs/pair.astuple/ |
tuple_element.fail.cpp | 12 // template <class T1, class T2> struct pair 14 // tuple_element<I, pair<T1, T2> >::type 20 typedef std::pair<int, short> T; 21 std::tuple_element<2, T>::type foo; // expected-error@utility:* {{Index out of bounds in std::tuple_element<std::pair<T1, T2>>}}
|
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; 25 typedef std::pair<int, short> const P1; 29 typedef std::pair<int, short> volatile P1; 33 typedef std::pair<int, short> const volatile P1;
|
/external/llvm/include/llvm/DebugInfo/DWARF/ |
DWARFRelocMap.h | 17 typedef DenseMap<uint64_t, std::pair<uint8_t, int64_t> > RelocAddrMap;
|
/external/pdfium/fpdfsdk/pwl/ |
cpwl_icon.h | 25 std::pair<float, float> GetScale(); 28 std::pair<float, float> GetImageOffset(); 35 std::pair<float, float> GetIconPosition(); 38 std::pair<float, float> GetImageSize();
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/libcxx/utilities/utility/pairs/pairs.pair/ |
pair.tuple_element.fail.cpp | 12 // template <class T1, class T2> struct pair 14 // tuple_element<I, pair<T1, T2> >::type 21 typedef std::pair<int, double> P; 23 // expected-error@utility:* {{static_assert failed "Index out of bounds in std::tuple_element<std::pair<T1, T2>>"}}
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/utilities/utility/pairs/pair.astuple/ |
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; 25 typedef std::pair<int, short> const P1; 29 typedef std::pair<int, short> volatile P1; 33 typedef std::pair<int, short> const volatile P1;
|
/external/clang/test/CodeGenCXX/ |
pr20719.cpp | 24 struct pair { struct 25 pair(int, int); 32 pair x(K_void([] {}), K_int([] {}));
|
/external/tensorflow/tensorflow/contrib/lite/examples/label_image/ |
get_top_n.h | 26 float threshold, std::vector<std::pair<float, int>>* top_results, 31 std::vector<std::pair<float, int>>*, bool); 33 std::vector<std::pair<float, int>>*, bool);
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
minmax_init_list_comp.pass.cpp | 15 // pair<T, T> 32 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<int, int>(5, 1))) [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.min.max/ |
minmax_init_list_comp.pass.cpp | 15 // pair<T, T> 32 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<int, int>(5, 1))) [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
stl_pair.h | 0 // Pair implementation -*- C++ -*- 96 struct pair struct 105 // 265. std::pair::pair() effects overly restrictive 108 _GLIBCXX_CONSTEXPR pair() function in struct:pair 111 /** Two objects may be passed to a @c pair constructor to be copied. */ 112 _GLIBCXX_CONSTEXPR pair(const _T1& __a, const _T2& __b) function in struct:pair 115 /** There is also a templated copy ctor for the @c pair class itself. */ 118 pair(const pair<_U1, _U2>& __p function in struct:pair 124 constexpr pair(const pair<_U1, _U2>& __p) function in struct:pair 133 constexpr pair(_U1&& __x, const _T2& __y) function in struct:pair 138 constexpr pair(const _T1& __x, _U2&& __y) function in struct:pair 144 constexpr pair(_U1&& __x, _U2&& __y) function in struct:pair 150 constexpr pair(pair<_U1, _U2>&& __p) function in struct:pair [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
stl_pair.h | 0 // Pair implementation -*- C++ -*- 96 struct pair struct 105 // 265. std::pair::pair() effects overly restrictive 108 _GLIBCXX_CONSTEXPR pair() function in struct:pair 111 /** Two objects may be passed to a @c pair constructor to be copied. */ 112 _GLIBCXX_CONSTEXPR pair(const _T1& __a, const _T2& __b) function in struct:pair 115 /** There is also a templated copy ctor for the @c pair class itself. */ 118 pair(const pair<_U1, _U2>& __p function in struct:pair 124 constexpr pair(const pair<_U1, _U2>& __p) function in struct:pair 133 constexpr pair(_U1&& __x, const _T2& __y) function in struct:pair 138 constexpr pair(const _T1& __x, _U2&& __y) function in struct:pair 144 constexpr pair(_U1&& __x, _U2&& __y) function in struct:pair 150 constexpr pair(pair<_U1, _U2>&& __p) function in struct:pair [all...] |
/external/ltp/lib/newlib_tests/ |
test16.c | 34 static struct tst_fzsync_pair pair = TST_FZSYNC_PAIR_INIT; variable in typeref:struct:tst_fzsync_pair 42 for (i = 0; tst_fzsync_wait_update_b(&pair); i++) { 43 tst_fzsync_delay_b(&pair); 44 tst_fzsync_time_b(&pair); 45 if (!tst_fzsync_wait_b(&pair)) 68 tst_fzsync_wait_update_a(&pair); 69 tst_fzsync_delay_a(&pair); 72 tst_fzsync_time_a(&pair); 73 if (!tst_fzsync_wait_a(&pair)) 96 if (labs(pair.delay) > 1000 [all...] |
/external/skia/src/core/ |
SkPtrRecorder.cpp | 11 Pair* p = fList.begin(); 12 Pair* stop = fList.end(); 20 bool SkPtrSet::Less(const Pair& a, const Pair& b) { 30 Pair pair; local 31 pair.fPtr = ptr; 33 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 46 Pair pair; local [all...] |
/external/skqp/src/core/ |
SkPtrRecorder.cpp | 11 Pair* p = fList.begin(); 12 Pair* stop = fList.end(); 20 bool SkPtrSet::Less(const Pair& a, const Pair& b) { 30 Pair pair; local 31 pair.fPtr = ptr; 33 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 46 Pair pair; local [all...] |
/tools/tradefederation/core/src/com/android/tradefed/util/ |
Pair.java | 21 * Define our own Pair class which contains two objects. 23 public class Pair<A, B> { 27 public Pair(A first, B second) { 37 if (!(o instanceof Pair)) { 38 // o is not an instance of Pair object 41 final Pair<?, ?> pair = (Pair<?, ?>) o; local 42 if (this == pair) { 47 if (pair.first != null) [all...] |
/external/ppp/pppd/plugins/radius/ |
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->attribute = attr->value 270 VALUE_PAIR *pair; local 529 VALUE_PAIR *pair; local [all...] |
/external/libcxx/test/std/utilities/utility/pairs/pairs.pair/ |
piecewise.pass.cpp | 14 // template <class T1, class T2> struct pair 17 // pair(piecewise_construct_t, tuple<Args1...> first_args, 27 typedef std::pair<int, int*> P1; 28 typedef std::pair<int*, int> P2; 29 typedef std::pair<P1, P2> P3;
|
default.pass.cpp | 12 // template <class T1, class T2> struct pair 14 // constexpr pair(); 35 typedef std::pair<float, short*> P; 42 typedef std::pair<float, short*> P; 49 using P = std::pair<int, NoDefault>; 51 using P2 = std::pair<NoDefault, int>;
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/utilities/utility/pairs/pairs.pair/ |
piecewise.pass.cpp | 14 // template <class T1, class T2> struct pair 17 // pair(piecewise_construct_t, tuple<Args1...> first_args, 27 typedef std::pair<int, int*> P1; 28 typedef std::pair<int*, int> P2; 29 typedef std::pair<P1, P2> P3;
|
/prebuilts/ndk/r16/sources/third_party/shaderc/libshaderc_util/include/libshaderc_util/ |
format.h | 28 for (const auto& pair : map) { 29 s << prefix << pair.first << infix << pair.second << postfix;
|
/art/libartbase/base/ |
hash_map.h | 31 size_t operator()(const std::pair<Key, Value>& pair) const { 32 return fn_(pair.first); 39 bool operator()(const std::pair<Key, Value>& a, const std::pair<Key, Value>& b) const { 43 bool operator()(const std::pair<Key, Value>& a, const Element& element) const { 53 class Alloc = std::allocator<std::pair<Key, Value>>> 54 class HashMap : public HashSet<std::pair<Key, Value>, 60 using Base = HashSet<std::pair<Key, Value>,
|
/external/llvm/include/llvm/Object/ |
SymbolSize.h | 18 std::vector<std::pair<SymbolRef, uint64_t>>
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
radeon_program_pair.c | 38 int rc_pair_alloc_source(struct rc_pair_instruction *pair, 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->Alpha.Src[i].File != file | [all...] |
/frameworks/support/core/ktx/src/androidTest/java/androidx/core/util/ |
PairTest.kt | 19 import android.util.Pair 26 val pair = Pair("one", "two") 27 val (first: String, second: String) = pair 28 assertSame(pair.first, first) 29 assertSame(pair.second, second) 33 val pair = Pair("one", "two") 34 val (first: String?, second: String?) = pair 35 assertSame(pair.first, first [all...] |