| /external/clang/test/SemaCXX/ |
| builtins.cpp | 12 template<int (*Compare)(const char *s1, const char *s2)>
14 return Compare(s1, s2) == 0;
|
| /external/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
37 const Compare &compare = Compare(),
[all...] |
| /external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/common/ |
| error.py | 50 def Compare(a, b):
51 """Compare two error objects, by source code order.
65 Compare = staticmethod(Compare)
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.map/ |
| swap_member.pass.cpp | 30 typedef test_compare<std::equal_to<int> > Compare;
32 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
34 C c1(0, Hash(1), Compare(1), Alloc(1));
35 C c2(0, Hash(2), Compare(2), Alloc(2));
42 assert(c1.key_eq() == Compare(2));
51 assert(c2.key_eq() == Compare(1));
59 typedef test_compare<std::equal_to<int> > Compare;
61 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
74 C c1(0, Hash(1), Compare(1), Alloc(1));
75 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.map/unord.map.swap/ |
| swap_non_member.pass.cpp | 30 typedef test_compare<std::equal_to<int> > Compare;
32 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
34 C c1(0, Hash(1), Compare(1), Alloc(1));
35 C c2(0, Hash(2), Compare(2), Alloc(2));
42 assert(c1.key_eq() == Compare(2));
51 assert(c2.key_eq() == Compare(1));
59 typedef test_compare<std::equal_to<int> > Compare;
61 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
74 C c1(0, Hash(1), Compare(1), Alloc(1));
75 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multiset/ |
| swap_member.pass.cpp | 29 typedef test_compare<std::equal_to<int> > Compare;
31 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C;
33 C c1(0, Hash(1), Compare(1), Alloc(1));
34 C c2(0, Hash(2), Compare(2), Alloc(2));
41 assert(c1.key_eq() == Compare(2));
50 assert(c2.key_eq() == Compare(1));
58 typedef test_compare<std::equal_to<int> > Compare;
60 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C;
73 C c1(0, Hash(1), Compare(1), Alloc(1));
74 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multiset/unord.multiset.swap/ |
| swap_non_member.pass.cpp | 29 typedef test_compare<std::equal_to<int> > Compare;
31 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C;
33 C c1(0, Hash(1), Compare(1), Alloc(1));
34 C c2(0, Hash(2), Compare(2), Alloc(2));
41 assert(c1.key_eq() == Compare(2));
50 assert(c2.key_eq() == Compare(1));
58 typedef test_compare<std::equal_to<int> > Compare;
60 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C;
73 C c1(0, Hash(1), Compare(1), Alloc(1));
74 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.set/ |
| swap_member.pass.cpp | 29 typedef test_compare<std::equal_to<int> > Compare;
31 typedef std::unordered_set<int, Hash, Compare, Alloc> C;
33 C c1(0, Hash(1), Compare(1), Alloc(1));
34 C c2(0, Hash(2), Compare(2), Alloc(2));
41 assert(c1.key_eq() == Compare(2));
50 assert(c2.key_eq() == Compare(1));
58 typedef test_compare<std::equal_to<int> > Compare;
60 typedef std::unordered_set<int, Hash, Compare, Alloc> C;
73 C c1(0, Hash(1), Compare(1), Alloc(1));
74 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.set/unord.set.swap/ |
| swap_non_member.pass.cpp | 29 typedef test_compare<std::equal_to<int> > Compare;
31 typedef std::unordered_set<int, Hash, Compare, Alloc> C;
33 C c1(0, Hash(1), Compare(1), Alloc(1));
34 C c2(0, Hash(2), Compare(2), Alloc(2));
41 assert(c1.key_eq() == Compare(2));
50 assert(c2.key_eq() == Compare(1));
58 typedef test_compare<std::equal_to<int> > Compare;
60 typedef std::unordered_set<int, Hash, Compare, Alloc> C;
73 C c1(0, Hash(1), Compare(1), Alloc(1));
74 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /external/chromium/chrome/browser/autofill/ |
| autofill-inl.h | 17 return form_group->Compare(form_group_) == 0;
21 return form_group.Compare(form_group_) == 0;
|
| /external/chromium/third_party/libjingle/overrides/talk/xmllite/ |
| qname.h | 25 int Compare(const QName & other) const;
28 bool operator<(const QName & other) const { return Compare(other) < 0; }
|
| /external/v8/test/mjsunit/ |
| to_number_order.js | 143 assertTrue(a < b, "Compare objects a < b");
144 assertEquals("hestfisk", x, "Compare objects a < b valueOf order");
147 assertFalse(a < a, "Compare objects a < a");
148 // assertEquals("hesthest", x, "Compare objects a < a valueOf order");
151 assertTrue(a == a, "Compare objects a == a");
152 assertEquals("", x, "Compare objects a == a valueOf not called");
155 assertFalse(b > b, "Compare objects b > b");
156 assertEquals("fiskfisk", x, "Compare objects b > b valueOf order");
159 assertTrue(b >= b, "Compare objects b >= b");
160 assertEquals("fiskfisk", x, "Compare objects b >= b valueOf order")
[all...] |
| /external/easymock/src/org/easymock/internal/matchers/ |
| Compare.java | 24 public class Compare<T> implements IArgumentMatcher, Serializable {
34 public Compare(T expected, Comparator<? super T> comparator, LogicalOperator result) {
50 return operator.matchResult(comparator.compare((T) actual, expected));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.min.max/ |
| minmax_element_comp.pass.cpp | 12 // template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
13 // requires CopyConstructible<Compare>
15 // minmax_element(Iter first, Iter last, Compare comp);
27 typedef std::greater<int> Compare;
28 Compare comp;
73 typedef std::greater<int> Compare;
74 Compare comp;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multimap/ |
| swap_member.pass.cpp | 30 typedef test_compare<std::equal_to<int> > Compare;
32 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
34 C c1(0, Hash(1), Compare(1), Alloc(1));
35 C c2(0, Hash(2), Compare(2), Alloc(2));
42 assert(c1.key_eq() == Compare(2));
51 assert(c2.key_eq() == Compare(1));
59 typedef test_compare<std::equal_to<int> > Compare;
61 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
74 C c1(0, Hash(1), Compare(1), Alloc(1));
75 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multimap/unord.multimap.swap/ |
| swap_non_member.pass.cpp | 30 typedef test_compare<std::equal_to<int> > Compare;
32 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
34 C c1(0, Hash(1), Compare(1), Alloc(1));
35 C c2(0, Hash(2), Compare(2), Alloc(2));
42 assert(c1.key_eq() == Compare(2));
51 assert(c2.key_eq() == Compare(1));
59 typedef test_compare<std::equal_to<int> > Compare;
61 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
74 C c1(0, Hash(1), Compare(1), Alloc(1));
75 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /external/clang/test/SemaTemplate/ |
| issue150.cpp | 78 template<class T, template<class> class Compare, class Default,
87 template<class _T, template<class> class Compare = PR9016::less,
88 class = typename interval_type_default<_T,Compare>::type,
96 template<class _T, template<class> class Compare = PR9016::less,
97 class = typename interval_type_default<_T,Compare>::type,
|
| /external/chromium/base/ |
| version.h | 54 FRIEND_TEST_ALL_PREFIXES(VersionTest, Compare);
|
| /external/clang/include/clang/Serialization/ |
| ContinuousRangeMap.h | 48 struct Compare {
74 iterator I = std::lower_bound(Rep.begin(), Rep.end(), Val, Compare());
92 iterator I = std::upper_bound(Rep.begin(), Rep.end(), K, Compare());
119 std::sort(Self.Rep.begin(), Self.Rep.end(), Compare());
|
| /external/openfst/src/include/fst/ |
| arcsort.h | 36 template <class Arc, class Compare>
45 ArcSortMapper(const Fst<Arc> &fst, const Compare &comp)
49 ArcSortMapper(const ArcSortMapper<Arc, Compare> &mapper,
75 const Compare &comp_;
79 void operator=(const ArcSortMapper<Arc, Compare> &); // disallow
84 // type Compare. This version modifies its input. Comparison function
86 // library. In general, Compare must meet the requirements for an STL
96 template<class Arc, class Compare>
97 void ArcSort(MutableFst<Arc> *fst, Compare comp) {
98 ArcSortMapper<Arc, Compare> mapper(*fst, comp)
[all...] |
| /external/v8/src/ |
| bignum.h | 71 static int Compare(const Bignum& a, const Bignum& b);
73 return Compare(a, b) == 0;
76 return Compare(a, b) <= 0;
79 return Compare(a, b) < 0;
81 // Returns Compare(a + b, c);
|
| splay-tree-inl.h | 54 int cmp = Config::Compare(key, root_->key_);
88 return Config::Compare(key, root_->key_) == 0;
113 int cmp = Config::Compare(root_->key_, key);
137 int cmp = Config::Compare(root_->key_, key);
183 int cmp = Config::Compare(new_key, root_->key_);
240 int cmp = Config::Compare(key, current->key_);
244 if (Config::Compare(key, current->left_->key_) < 0) {
260 if (Config::Compare(key, current->right_->key_) > 0) {
|
| /external/chromium/third_party/libjingle/source/talk/xmllite/ |
| qname.h | 56 int Compare(const QName & other) const;
59 bool operator<(const QName & other) const { return Compare(other) < 0; }
|
| /frameworks/compile/mclinker/include/mcld/Support/ |
| MemoryArea.h | 99 struct Compare {
113 typedef std::multimap<Key, Space*, Key::Compare> SpaceMapType;
|
| /external/chromium/chrome/browser/chromeos/ |
| language_preferences_unittest.cc | 20 bool Compare(T a, T b) {
24 bool Compare<const char*>(const char* a, const char* b) {
42 if (Compare(pref.default_pref_value,
|
