Searched refs:pair (Results 1 - 25 of 1753) sorted by relevance

1234567891011>>

/external/clang/test/CodeGen/
H A Dtbaa-thread-sanitizer.cpp7 struct pair { struct
9 pair(const iterator &a) : first(a) {} function in struct:pair
13 (void)pair(iterator());
/external/libchrome/base/threading/
H A Dplatform_thread_internal_posix.cc14 for (const ThreadPriorityToNiceValuePair& pair :
16 if (pair.priority == priority)
17 return pair.nice_value;
24 for (const ThreadPriorityToNiceValuePair& pair :
26 if (pair.nice_value == nice_value)
27 return pair.priority;
/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/
H A Dminmax_init_list.pass.cpp13 // pair<T, T>
22 assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)));
23 assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)));
24 assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)));
25 assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3)));
26 assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3)));
27 assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3)));
30 static_assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)), "");
31 static_assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)), "");
32 static_assert((std::minmax({2, 1, 3}) == std::pair<in
[all...]
H A Dminmax_init_list_comp.pass.cpp13 // pair<T, T>
30 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<in
[all...]
/external/valgrind/none/tests/
H A Dallexec_prepare_prereq11 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
36 pair tilegx_unexisting_32bits tilegx
/external/libweave/src/
H A Dstring_utils_unittest.cc79 std::pair<std::string, std::string> pair; local
81 pair = SplitAtFirst(" 123 : 4 : 56 : 789 ", ":", true);
82 EXPECT_EQ("123", pair.first);
83 EXPECT_EQ("4 : 56 : 789", pair.second);
85 pair = SplitAtFirst(" 123 : 4 : 56 : 789 ", ":", false);
86 EXPECT_EQ(" 123 ", pair.first);
87 EXPECT_EQ(" 4 : 56 : 789 ", pair.second);
89 pair = SplitAtFirst("", "=", true);
90 EXPECT_EQ("", pair
[all...]
/external/clang/test/PCH/
H A Dcrash-12631281.cpp15 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/libcxx/test/std/utilities/utility/pairs/pair.astuple/
H A Dtuple_size.pass.cpp12 // 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;
H A Dget_const.pass.cpp12 // template <class T1, class T2> struct pair
15 // const typename tuple_element<I, std::pair<T1, T2> >::type&
16 // get(const pair<T1, T2>&);
24 typedef std::pair<int, short> P;
32 typedef std::pair<int, short> P;
/external/libcxx/test/std/utilities/utility/pairs/pairs.pair/
H A Dconst_pair_U_V.pass.cpp12 // template <class T1, class T2> struct pair
14 // template <class U, class V> pair(const pair<U, V>& p);
22 typedef std::pair<int, short> P1;
23 typedef std::pair<double, long> P2;
32 typedef std::pair<int, short> P1;
33 typedef std::pair<double, long> P2;
H A Dcopy_ctor.pass.cpp12 // template <class T1, class T2> struct pair
14 // pair(const pair&) = default;
22 typedef std::pair<int, short> P1;
29 static_assert((std::is_trivially_copy_constructible<std::pair<int, int> >::value), "");
33 typedef std::pair<int, short> P1;
H A Dpiecewise.pass.cpp12 // template <class T1, class T2> struct pair
15 // pair(piecewise_construct_t, tuple<Args1...> first_args,
26 typedef std::pair<int, int*> P1;
27 typedef std::pair<int*, int> P2;
28 typedef std::pair<P1, P2> P3;
H A Dassign_const_pair_U_V.pass.cpp12 // template <class T1, class T2> struct pair
14 // template<class U, class V> pair& operator=(const pair<U, V>& p);
22 typedef std::pair<int, short> P1;
23 typedef std::pair<double, long> P2;
H A Ddefault.pass.cpp12 // template <class T1, class T2> struct pair
14 // constexpr pair();
22 typedef std::pair<float, short*> P;
30 typedef std::pair<float, short*> P;
/external/clang/test/CodeGenCXX/
H A Dpr20719.cpp24 struct pair { struct
25 pair(int, int);
32 pair x(K_void([] {}), K_int([] {}));
H A Dpr18635.cpp10 template <typename F, typename S> struct pair { struct in class:unique_ptr
14 pair<T *, int> data;
/external/lzma/CPP/7zip/UI/Common/
H A DUpdateProduce.cpp19 const CUpdatePair &pair = updatePairs[i]; local
22 up2.DirIndex = pair.DirIndex;
23 up2.ArcIndex = pair.ArcIndex;
27 switch (actionSet.StateActions[pair.State])
31 if (pair.State != NPairState::kOnlyOnDisk)
32 IgnoreArchiveItem(m_ArchiveItems[pair.ArcIndex]);
36 callback->ShowDeleteFile(pair.ArcIndex);
40 if (pair.State == NPairState::kOnlyOnDisk)
42 if (pair.State == NPairState::kOnlyInArchive)
44 if (pair
[all...]
/external/skia/src/core/
H A DSkPtrRecorder.cpp31 Pair pair; local
32 pair.fPtr = ptr;
34 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair));
47 Pair pair; local
48 pair.fPtr = ptr;
50 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair));
54 pair.fIndex = count + 1;
55 *fList.insert(index) = pair;
[all...]
/external/ppp/pppd/plugins/radius/
H A Davpair.c26 * 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
270 VALUE_PAIR *pair; local
455 rc_avpair_free(VALUE_PAIR *pair) argument
529 VALUE_PAIR *pair; local
692 rc_avpair_tostr(VALUE_PAIR *pair, char *name, int ln, char *value, int lv) argument
[all...]
/external/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFRelocMap.h17 typedef DenseMap<uint64_t, std::pair<uint8_t, int64_t> > RelocAddrMap;
/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_program_pair.c38 int rc_pair_alloc_source(struct rc_pair_instruction *pair, argument
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
131 pair_foreach_source_callback( struct rc_pair_instruction * pair, void * data, rc_pair_foreach_src_fn cb, unsigned int swz, unsigned int src) argument
169 rc_pair_foreach_source_that_alpha_reads( struct rc_pair_instruction * pair, void * data, rc_pair_foreach_src_fn cb) argument
184 rc_pair_foreach_source_that_rgb_reads( struct rc_pair_instruction * pair, void * data, rc_pair_foreach_src_fn cb) argument
[all...]
/external/libbrillo/brillo/strings/
H A Dstring_utils_unittest.cc75 std::pair<std::string, std::string> pair; local
77 pair = string_utils::SplitAtFirst(" 123 : 4 : 56 : 789 ", ":", true);
78 EXPECT_EQ("123", pair.first);
79 EXPECT_EQ("4 : 56 : 789", pair.second);
81 pair = string_utils::SplitAtFirst(" 123 : 4 : 56 : 789 ", ":", false);
82 EXPECT_EQ(" 123 ", pair.first);
83 EXPECT_EQ(" 4 : 56 : 789 ", pair.second);
85 pair = string_utils::SplitAtFirst("", "=");
86 EXPECT_EQ("", pair
[all...]
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/
H A DbtOverlappingPairCache.cpp54 void btHashedOverlappingPairCache::cleanOverlappingPair(btBroadphasePair& pair,btDispatcher* dispatcher) argument
56 if (pair.m_algorithm && dispatcher)
59 pair.m_algorithm->~btCollisionAlgorithm();
60 dispatcher->freeCollisionAlgorithm(pair.m_algorithm);
61 pair.m_algorithm=0;
85 virtual bool processOverlap(btBroadphasePair& pair) argument
87 if ((pair.m_pProxy0 == m_cleanProxy) ||
88 (pair.m_pProxy1 == m_cleanProxy))
90 m_pairCache->cleanOverlappingPair(pair,m_dispatcher);
118 virtual bool processOverlap(btBroadphasePair& pair) argument
227 btBroadphasePair* pair = internalFindPair(proxy0, proxy1, hash); local
286 btBroadphasePair* pair = internalFindPair(proxy0, proxy1, hash); local
386 btBroadphasePair* pair = &m_overlappingPairArray[i]; local
440 btBroadphasePair& pair = m_overlappingPairArray[findIndex]; local
471 btBroadphasePair* pair = new (mem) btBroadphasePair(*proxy0,*proxy1); local
497 btBroadphasePair* pair = &m_overlappingPairArray[findIndex]; local
522 btBroadphasePair* pair = &m_overlappingPairArray[i]; local
555 cleanOverlappingPair(btBroadphasePair& pair,btDispatcher* dispatcher) argument
585 processOverlap(btBroadphasePair& pair) argument
616 processOverlap(btBroadphasePair& pair) argument
[all...]
/external/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.obs/
H A Darrow.pass.cpp22 const std::shared_ptr<std::pair<int, int> > p(new std::pair<int, int>(3, 4));
/external/strace/tests/
H A Ddumpio.test7 run_prog ./unix-pair-send-recv abcdefghijklmnopqrstuvwxyz

Completed in 1289 milliseconds

1234567891011>>