| /external/clang/test/CodeGen/ |
| tbaa-thread-sanitizer.cpp | 7 struct pair { struct
9 pair(const iterator &a) : first(a) {} function in struct:pair
13 (void)pair(iterator());
|
| /external/libchrome/base/threading/ |
| platform_thread_internal_posix.cc | 15 for (const auto& pair : kThreadPriorityToNiceValueMap) {
16 if (pair.priority == priority)
17 return pair.nice_value;
27 for (const auto& pair : Reversed(kThreadPriorityToNiceValueMap)) {
28 if (pair.nice_value >= nice_value)
29 return pair.priority;
|
| /external/ltp/include/ |
| tst_fuzzy_sync.h | 105 static void tst_fzsync_pair_info(struct tst_fzsync_pair *pair)
109 pair->avg_diff, pair->avg_dev, pair->delay);
117 static inline void tst_fzsync_delay_a(struct tst_fzsync_pair *pair)
119 volatile long spin_delay = pair->delay;
130 static inline void tst_fzsync_delay_b(struct tst_fzsync_pair *pair)
132 volatile long spin_delay = pair->delay;
148 static inline void tst_fzsync_time_a(struct tst_fzsync_pair *pair)
150 tst_fzsync_time(&pair->a)
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/csharp/ |
| std_pair.i | 4 * SWIG typemaps for std::pair
11 // std::pair
20 template<class T, class U> struct pair {
22 pair();
23 pair(T t, U u);
24 pair(const pair& p);
26 template <class U1, class U2> pair(const pair<U1, U2> &p);
|
| /prebuilts/misc/common/swig/include/2.0.11/d/ |
| std_pair.i | 4 * SWIG typemaps for std::pair
11 // std::pair
20 template<class T, class U> struct pair {
22 pair();
23 pair(T t, U u);
24 pair(const pair& p);
26 template <class U1, class U2> pair(const pair<U1, U2> &p);
|
| /prebuilts/misc/common/swig/include/2.0.11/go/ |
| std_pair.i | 4 * SWIG typemaps for std::pair
11 // std::pair
20 template<class T, class U> struct pair {
22 pair();
23 pair(T first, U second);
24 pair(const pair& p);
26 template <class U1, class U2> pair(const pair<U1, U2> &p);
|
| /prebuilts/misc/common/swig/include/2.0.11/java/ |
| std_pair.i | 4 * SWIG typemaps for std::pair
11 // std::pair
20 template<class T, class U> struct pair {
22 pair();
23 pair(T first, U second);
24 pair(const pair& p);
26 template <class U1, class U2> pair(const pair<U1, U2> &p);
|
| /prebuilts/misc/common/swig/include/2.0.11/ocaml/ |
| std_pair.i | 4 * SWIG typemaps for std::pair
11 // std::pair
20 template<class T, class U> struct pair {
22 pair();
23 pair(T first, U second);
24 pair(const pair& p);
26 template <class U1, class U2> pair(const pair<U1, U2> &p);
|
| /prebuilts/misc/common/swig/include/2.0.11/perl5/ |
| std_pair.i | 4 * SWIG typemaps for std::pair
11 // std::pair
20 template<class T, class U> struct pair {
22 pair();
23 pair(T t, U u);
24 pair(const pair& p);
26 template <class U1, class U2> pair(const pair<U1, U2> &p);
|
| /prebuilts/misc/common/swig/include/2.0.11/php/ |
| std_pair.i | 4 * SWIG typemaps for std::pair
11 // std::pair
20 template<class T, class U> struct pair {
22 pair();
23 pair(T first, U second);
24 pair(const pair& p);
26 template <class U1, class U2> pair(const pair<U1, U2> &p);
|
| /prebuilts/misc/common/swig/include/2.0.11/tcl/ |
| std_pair.i | 4 * Typemaps for std::pair
11 // std::pair
20 template<class T, class U> struct pair {
22 pair();
23 pair(T first, U second);
24 pair(const pair& p);
26 template <class U1, class U2> pair(const pair<U1, U2> &p);
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
| minmax_init_list.pass.cpp | 15 // pair<T, T>
25 assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)));
26 assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)));
27 assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)));
28 assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3)));
29 assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3)));
30 assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3)));
33 static_assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)), "");
34 static_assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)), "");
35 static_assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)), "")
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/lua/ |
| std_pair.i | 4 * std::pair typemaps for LUA
11 A really cut down version of the pair class.
17 %template(IntPair) pair<int, int>;
27 template <class T, class U > struct pair {
31 pair();
32 pair(T first, U second);
33 pair(const pair& p);
40 pair<T,U> make_pair(const T&,const U&);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.min.max/ |
| minmax_init_list.pass.cpp | 15 // pair<T, T>
25 assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)));
26 assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)));
27 assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)));
28 assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3)));
29 assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3)));
30 assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3)));
33 static_assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)), "");
34 static_assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)), "");
35 static_assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)), "")
[all...] |
| /external/libcxx/test/std/utilities/utility/pairs/pairs.pair/ |
| implicit_deduction_guides.pass.cpp | 20 // Test that the constructors offered by std::pair are formulated
35 // (1) pair(const T1&, const T2&) -> pair<T1, T2>
36 // (2) explicit pair(const T1&, const T2&) -> pair<T1, T2>
37 // (3) pair(pair const& t) -> decltype(t)
38 // (4) pair(pair&& t) -> decltype(t)
39 // (5) pair(pair<U1, U2> const&) -> pair<U1, U2
50 ASSERT_SAME_TYPE(decltype(t1), std::pair<const char*, int>); member in class:std
54 ASSERT_SAME_TYPE(decltype(p1), std::pair<E, int>); member in class:std
58 ASSERT_SAME_TYPE(decltype(p2), std::pair<E, E>); member in class:std
63 ASSERT_SAME_TYPE(decltype(p1), std::pair<double, decltype(nullptr)>); member in class:std
68 ASSERT_SAME_TYPE(decltype(p1), std::pair<E, decltype(nullptr)>); member in class:std
73 ASSERT_SAME_TYPE(decltype(p1), std::pair<std::string, void*>); member in class:std
78 ASSERT_SAME_TYPE(decltype(p1), std::pair<std::string, E>); member in class:std
[all...] |
| dtor.pass.cpp | 14 // template <class T1, class T2> struct pair
16 // ~pair()
19 // The destructor of pair shall be a trivial destructor
33 std::pair<int, float> >::value), "");
35 std::pair<int, std::string> >::value), "");
|
| /prebuilts/misc/common/swig/include/2.0.11/std/ |
| std_pair.i | 9 template <class T, class U > struct pair {
16 %fragment(SWIG_Traits_frag(std::pair<T,U >), "header",
21 template <> struct traits<std::pair<T,U > > {
24 return "std::pair<" #T "," #U " >";
31 %typemap_traits_ptr(SWIG_TYPECHECK_PAIR, std::pair<T,U >);
33 %typemap_traits(SWIG_TYPECHECK_PAIR, std::pair<T,U >);
36 pair();
37 pair(T first, U second);
38 pair(const pair& p)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/system/include/ |
| stl_pair.h | 72 struct pair { struct
78 pair() : first(), second() {} function in struct:pair
79 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {} function in struct:pair
82 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} function in struct:pair
86 inline bool operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
92 inline bool operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
99 inline bool operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
[all...] |
| /external/clang/test/PCH/ |
| 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/valgrind/none/tests/ |
| 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
|
| /external/lzma/CPP/7zip/UI/Common/ |
| UpdateProduce.cpp | 19 const CUpdatePair &pair = updatePairs[i];
local
22 up2.DirIndex = pair.DirIndex;
23 up2.ArcIndex = pair.ArcIndex;
27 switch (actionSet.StateActions[(unsigned)pair.State])
30 if (pair.ArcIndex >= 0 && callback)
31 callback->ShowDeleteFile(pair.ArcIndex);
35 if (pair.State == NPairState::kOnlyOnDisk)
37 if (pair.State == NPairState::kOnlyInArchive)
39 if (pair.HostIndex >= 0)
46 if (updatePairs[pair.HostIndex].DirIndex >= 0)
[all...] |
| /external/syslinux/gpxe/src/hci/mucurses/ |
| colour.c | 31 * Initialise colour pair
33 * @v pair colour pair number
37 int init_pair ( short pair, short fcol, short bcol ) {
40 if ( ( pair < 1 ) || ( pair >= COLOUR_PAIRS ) )
43 cpair = &cpairs[pair];
50 * Get colours of colour pair
52 * @v pair colour pair numbe
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/utilities/utility/pairs/pairs.pair/ |
| dtor.pass.cpp | 14 // template <class T1, class T2> struct pair
16 // ~pair()
19 // The destructor of pair shall be a trivial destructor
33 std::pair<int, float> >::value), "");
35 std::pair<int, std::string> >::value), "");
|
| /external/javaparser/javaparser-testing/src/test/java/com/github/javaparser/utils/ |
| PairTest.java | 10 Pair<String, String> pair = new Pair<>("abc", "def"); local
12 assertEquals("<abc, def>", pair.toString());
17 Pair<String, String> pair = new Pair<>(null, null); local
19 assertEquals("<null, null>", pair.toString());
|
| /external/libcxx/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>>"}}
|
