Home
last modified time | relevance | path

Searched refs:Compare (Results 1 – 19 of 19) sorted by relevance

/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/
Dswap_member.pass.cpp30 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
32 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; in main()
34 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
35 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
42 assert(c1.key_eq() == Compare(2)); in main()
51 assert(c2.key_eq() == Compare(1)); in main()
59 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
61 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; in main()
74 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
75 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.swap/
Dswap_non_member.pass.cpp30 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
32 typedef std::unordered_set<int, Hash, Compare, Alloc> C; in main()
34 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
35 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
42 assert(c1.key_eq() == Compare(2)); in main()
51 assert(c2.key_eq() == Compare(1)); in main()
59 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
61 typedef std::unordered_set<int, Hash, Compare, Alloc> C; in main()
74 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
75 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/
Dswap_non_member.pass.cpp30 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
32 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; in main()
34 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
35 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
42 assert(c1.key_eq() == Compare(2)); in main()
51 assert(c2.key_eq() == Compare(1)); in main()
59 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
61 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; in main()
74 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
75 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/
Dswap_member.pass.cpp30 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
32 typedef std::unordered_set<int, Hash, Compare, Alloc> C; in main()
34 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
35 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
42 assert(c1.key_eq() == Compare(2)); in main()
51 assert(c2.key_eq() == Compare(1)); in main()
59 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
61 typedef std::unordered_set<int, Hash, Compare, Alloc> C; in main()
74 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
75 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.swap/
Dswap_non_member.pass.cpp31 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
33 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; in main()
35 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
36 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
43 assert(c1.key_eq() == Compare(2)); in main()
52 assert(c2.key_eq() == Compare(1)); in main()
60 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
62 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; in main()
75 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/
Dswap_member.pass.cpp31 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
33 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; in main()
35 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
36 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
43 assert(c1.key_eq() == Compare(2)); in main()
52 assert(c2.key_eq() == Compare(1)); in main()
60 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
62 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; in main()
75 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.swap/
Dswap_non_member.pass.cpp31 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
33 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C; in main()
35 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
36 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
43 assert(c1.key_eq() == Compare(2)); in main()
52 assert(c2.key_eq() == Compare(1)); in main()
60 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
62 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C; in main()
75 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/
Dswap_member.pass.cpp32 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
34 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C; in main()
36 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
37 C c2(0, Hash(2), Compare(2), Alloc(2)); in main()
44 assert(c1.key_eq() == Compare(2)); in main()
53 assert(c2.key_eq() == Compare(1)); in main()
61 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
63 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C; in main()
76 C c1(0, Hash(1), Compare(1), Alloc(1)); in main()
77 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2)); in main()
[all …]
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/container/
Dcontainer_fwd.hpp77 ,class Compare = std::less<Key>
83 ,class Compare = std::less<Key>
90 ,class Compare = std::less<Key>
97 ,class Compare = std::less<Key>
103 ,class Compare = std::less<Key>
109 ,class Compare = std::less<Key>
116 ,class Compare = std::less<Key>
123 ,class Compare = std::less<Key>
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/
Dminmax_element_comp.pass.cpp27 typedef std::greater<int> Compare; in test() typedef
28 Compare comp; in test()
73 typedef std::greater<int> Compare; in test() typedef
74 Compare comp; in test()
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/detail/
Dbinary_search.hpp61 template <class ForwardIter, class Tp, class Compare>
63 const Tp& val, Compare comp) in lower_bound()
111 template <class ForwardIter, class Tp, class Compare>
113 const Tp& val, Compare comp) in upper_bound()
167 template <class ForwardIter, class Tp, class Compare>
170 Compare comp) in equal_range()
206 template <class ForwardIter, class Tp, class Compare>
209 Compare comp) { in binary_search()
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/
Dfixed_mapping.hpp59 template<typename Key, typename Value, typename Compare = std::less<Key> >
78 … bool operator()( elem_type const& x, Key const& y ) const { return Compare()( x.first, y ); } in operator ()()
84 …bool operator()( elem_type const& x, elem_type const& y ) const { return Compare()( x.first, y.fir… in operator ()()
96 return (it == m_map.end() || Compare()( key, it->first ) ) ? m_invalid_value : it->second; in operator []()
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
Dset21 template <class Key, class Compare = less<Key>,
29 typedef Compare key_compare;
71 : set(first, last, Compare(), a) {} // C++14
73 : set(il, Compare(), a) {} // C++14
166 template <class Key, class Compare, class Allocator>
168 operator==(const set<Key, Compare, Allocator>& x,
169 const set<Key, Compare, Allocator>& y);
171 template <class Key, class Compare, class Allocator>
173 operator< (const set<Key, Compare, Allocator>& x,
174 const set<Key, Compare, Allocator>& y);
[all …]
Dmap21 template <class Key, class T, class Compare = less<Key>,
30 typedef Compare key_compare;
82 : map(first, last, Compare(), a) {} // C++14
84 : map(il, Compare(), a) {} // C++14
187 template <class Key, class T, class Compare, class Allocator>
189 operator==(const map<Key, T, Compare, Allocator>& x,
190 const map<Key, T, Compare, Allocator>& y);
192 template <class Key, class T, class Compare, class Allocator>
194 operator< (const map<Key, T, Compare, Allocator>& x,
195 const map<Key, T, Compare, Allocator>& y);
[all …]
Dqueue95 class Compare = less<typename Container::value_type>>
107 Compare comp;
119 explicit priority_queue(const Compare& comp);
120 priority_queue(const Compare& comp, const container_type& c);
121 explicit priority_queue(const Compare& comp, container_type&& c);
124 const Compare& comp = Compare());
127 const Compare& comp, const container_type& c);
130 const Compare& comp, container_type&& c);
134 priority_queue(const Compare& comp, const Alloc& a);
136 priority_queue(const Compare& comp, const container_type& c,
[all …]
Dalgorithm322 template <class ForwardIterator, class Compare>
324 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
330 template <class ForwardIterator, class Compare>
332 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
338 template <class RandomAccessIterator, class Compare>
340 sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
346 template <class RandomAccessIterator, class Compare>
348 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
354 template <class RandomAccessIterator, class Compare>
356 …(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
[all …]
Dforward_list131 template <class Compare> void merge(forward_list& x, Compare comp);
132 template <class Compare> void merge(forward_list&& x, Compare comp);
134 template <class Compare> void sort(Compare comp);
Dlist141 template <class Compare>
142 void merge(list& x, Compare comp);
143 template <class Compare>
144 void merge(list&& x, Compare comp);
146 template <class Compare>
147 void sort(Compare comp);
/ndk/sources/third_party/googletest/googletest/include/gtest/
Dgtest.h1449 static AssertionResult Compare(const char* expected_expression, in Compare() function
1463 static AssertionResult Compare(const char* expected_expression, in Compare() function
1482 static AssertionResult Compare(
1500 static AssertionResult Compare( in Compare() function
1948 EqHelper<GTEST_IS_NULL_LITERAL_(expected)>::Compare, \
1963 EqHelper<GTEST_IS_NULL_LITERAL_(expected)>::Compare, \