HomeSort by relevance Sort by last modified time
    Searched refs:pair (Results 1 - 25 of 2361) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/chromium_org/third_party/cython/src/Cython/Includes/libcpp/
pair.pxd 1 from utility cimport pair namespace
  /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/libcxx/test/algorithms/alg.sorting/alg.min.max/
minmax_init_list.pass.cpp 13 // 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<int, int>(1, 3)), "")
    [all...]
minmax_init_list_comp.pass.cpp 13 // pair<T, T>
23 assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)));
24 assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)));
25 assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)));
26 assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1)));
27 assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)));
28 assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1)));
31 static_assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), "");
32 static_assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)), "");
33 static_assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), "")
    [all...]
  /bionic/libstdc++/include/
stl_pair.h 64 struct pair { struct
70 pair() : first(), second() {} function in struct:pair
71 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {} function in struct:pair
74 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} function in struct:pair
78 inline bool operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
84 inline bool operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
91 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/libcxx/test/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;
get_const.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>&);
24 typedef std::pair<int, short> P;
32 typedef std::pair<int, short> P;
  /external/libcxx/test/utilities/utility/pairs/pairs.pair/
const_pair_U_V.pass.cpp 12 // 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;
copy_ctor.pass.cpp 12 // 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;
piecewise.pass.cpp 12 // 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;
assign_const_pair_U_V.pass.cpp 12 // 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;
  /external/llvm/lib/DebugInfo/
DWARFRelocMap.h 17 typedef DenseMap<uint64_t, std::pair<uint8_t, int64_t> > RelocAddrMap;
  /external/chromium_org/base/containers/
hash_tables_unittest.cc 17 Type pair(value1, value2); \
19 map[pair] = 1; \
25 typedef std::pair<int16, int16> Int16Int16Pair;
26 typedef std::pair<int16, int32> Int16Int32Pair;
27 typedef std::pair<int16, int64> Int16Int64Pair;
34 typedef std::pair<int32, int16> Int32Int16Pair;
35 typedef std::pair<int32, int32> Int32Int32Pair;
36 typedef std::pair<int32, int64> Int32Int64Pair;
43 typedef std::pair<int64, int16> Int64Int16Pair;
44 typedef std::pair<int64, int32> Int64Int32Pair
    [all...]
  /external/chromium_org/third_party/skia/src/core/
SkPtrRecorder.cpp 12 Pair* p = fList.begin();
13 Pair* stop = fList.end();
21 bool SkPtrSet::Less(const Pair& a, const Pair& b) {
31 Pair pair; local
32 pair.fPtr = ptr;
34 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair));
47 Pair pair; local
    [all...]
  /external/chromium_org/ash/display/
display_layout_store.cc 53 const DisplayIdPair& pair) {
55 paired_layouts_.find(pair);
57 iter != paired_layouts_.end() ? iter->second : CreateDisplayLayout(pair);
61 const DisplayIdPair& pair) {
62 DisplayLayout layout = GetRegisteredDisplayLayout(pair);
67 pair.first == layout.primary_id) ? layout : layout.Invert();
70 void DisplayLayoutStore::UpdateMirrorStatus(const DisplayIdPair& pair,
72 if (paired_layouts_.find(pair) == paired_layouts_.end())
73 CreateDisplayLayout(pair);
74 paired_layouts_[pair].mirrored = mirrored
    [all...]
  /external/chromium_org/tools/gn/
deps_iterator.h 42 const LabelTargetPair& pair() const { function in class:DepsIterator
48 const Target* target() const { return pair().ptr; }
51 const Label& label() const { return pair().label; }
  /external/chromium_org/third_party/mesa/src/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...]
  /external/chromium_org/third_party/ots/src/
glyf.h 8 #include <utility> // std::pair
16 std::vector<std::pair<const uint8_t*, size_t> > iov;
  /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...]
  /external/libcxx/test/containers/associative/map/
types.pass.cpp 13 // class Allocator = allocator<pair<const Key, T>>>
20 // typedef pair<const key_type, mapped_type> value_type;
42 static_assert((std::is_same<std::map<int, double>::value_type, std::pair<const int, double> >::value), "");
44 static_assert((std::is_same<std::map<int, double>::allocator_type, std::allocator<std::pair<const int, double> > >::value), "");
45 static_assert((std::is_same<std::map<int, double>::reference, std::pair<const int, double>&>::value), "");
46 static_assert((std::is_same<std::map<int, double>::const_reference, const std::pair<const int, double>&>::value), "");
47 static_assert((std::is_same<std::map<int, double>::pointer, std::pair<const int, double>*>::value), "");
48 static_assert((std::is_same<std::map<int, double>::const_pointer, const std::pair<const int, double>*>::value), "");
54 static_assert((std::is_same<std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>>::key_type, int>::value), "");
55 static_assert((std::is_same<std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>>::mapped_type, double>::value), "")
    [all...]
  /external/libcxx/test/containers/associative/multimap/
types.pass.cpp 13 // class Allocator = allocator<pair<const Key, T>>>
20 // typedef pair<const key_type, mapped_type> value_type;
42 static_assert((std::is_same<std::multimap<int, double>::value_type, std::pair<const int, double> >::value), "");
44 static_assert((std::is_same<std::multimap<int, double>::allocator_type, std::allocator<std::pair<const int, double> > >::value), "");
45 static_assert((std::is_same<std::multimap<int, double>::reference, std::pair<const int, double>&>::value), "");
46 static_assert((std::is_same<std::multimap<int, double>::const_reference, const std::pair<const int, double>&>::value), "");
47 static_assert((std::is_same<std::multimap<int, double>::pointer, std::pair<const int, double>*>::value), "");
48 static_assert((std::is_same<std::multimap<int, double>::const_pointer, const std::pair<const int, double>*>::value), "");
54 static_assert((std::is_same<std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>>::key_type, int>::value), "");
55 static_assert((std::is_same<std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>>::mapped_type, double>::value), "")
    [all...]
  /art/runtime/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>, EmptyFn, HashMapWrapper<HashFn>,
  /external/chromium_org/third_party/WebKit/Source/core/accessibility/
AXARIAGridCell.h 45 virtual void rowIndexRange(pair<unsigned, unsigned>& rowRange) OVERRIDE;
47 virtual void columnIndexRange(pair<unsigned, unsigned>& columnRange) OVERRIDE;
  /external/libcxx/test/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.obs/
arrow.pass.cpp 22 const std::shared_ptr<std::pair<int, int> > p(new std::pair<int, int>(3, 4));

Completed in 968 milliseconds

1 2 3 4 5 6 7 8 91011>>