| /external/chromium-trace/catapult/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)
|
| /art/test/003-omnibus-opcodes/src/ |
| Compare.java | 20 public class Compare {
96 /* compare when high words are equal but low words differ */
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/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;
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| swap_member.pass.cpp | 32 typedef test_compare<std::equal_to<int> > Compare;
34 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1));
36 C c2(0, Hash(2), Compare(2), Alloc(2));
43 assert(c1.key_eq() == Compare(2));
52 assert(c2.key_eq() == Compare(1));
60 typedef test_compare<std::equal_to<int> > Compare;
62 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
75 C c1(0, Hash(1), Compare(1), Alloc(1));
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.swap/ |
| swap_non_member.pass.cpp | 32 typedef test_compare<std::equal_to<int> > Compare;
34 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1));
36 C c2(0, Hash(2), Compare(2), Alloc(2));
43 assert(c1.key_eq() == Compare(2));
52 assert(c2.key_eq() == Compare(1));
60 typedef test_compare<std::equal_to<int> > Compare;
62 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
75 C c1(0, Hash(1), Compare(1), Alloc(1));
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multimap/ |
| swap_member.pass.cpp | 32 typedef test_compare<std::equal_to<int> > Compare;
34 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
36 C c1(0, Hash(1), Compare(1), Alloc(1));
37 C c2(0, Hash(2), Compare(2), Alloc(2));
44 assert(c1.key_eq() == Compare(2));
53 assert(c2.key_eq() == Compare(1));
61 typedef test_compare<std::equal_to<int> > Compare;
63 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
76 C c1(0, Hash(1), Compare(1), Alloc(1));
77 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.swap/ |
| swap_non_member.pass.cpp | 31 typedef test_compare<std::equal_to<int> > Compare;
33 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1));
36 C c2(0, Hash(2), Compare(2), Alloc(2));
43 assert(c1.key_eq() == Compare(2));
52 assert(c2.key_eq() == Compare(1));
60 typedef test_compare<std::equal_to<int> > Compare;
62 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
75 C c1(0, Hash(1), Compare(1), Alloc(1));
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| swap_member.pass.cpp | 30 typedef test_compare<std::equal_to<int> > Compare;
32 typedef std::unordered_multiset<int, 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_multiset<int, 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/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.swap/ |
| swap_non_member.pass.cpp | 30 typedef test_compare<std::equal_to<int> > Compare;
32 typedef std::unordered_multiset<int, 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_multiset<int, 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/libcxx/test/std/containers/unord/unord.set/ |
| swap_member.pass.cpp | 30 typedef test_compare<std::equal_to<int> > Compare;
32 typedef std::unordered_set<int, 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_set<int, 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/libcxx/test/std/containers/unord/unord.set/unord.set.swap/ |
| swap_non_member.pass.cpp | 30 typedef test_compare<std::equal_to<int> > Compare;
32 typedef std::unordered_set<int, 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_set<int, 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/webrtc/webrtc/libjingle/xmllite/ |
| qname.cc | 62 int QName::Compare(const StaticQName& other) const {
63 int result = local_part_.compare(other.local);
67 return namespace_.compare(other.ns);
70 int QName::Compare(const QName& other) const {
71 int result = local_part_.compare(other.local_part_);
75 return namespace_.compare(other.namespace_);
|
| /frameworks/av/media/libstagefright/foundation/ |
| AStringUtils.cpp | 23 int AStringUtils::Compare(const char *a, const char *b, size_t len, bool ignoreCase) {
38 if (strLen < globIx || Compare(str, glob, globIx /* len */, ignoreCase)) {
59 return !Compare(tail, pattern, len, ignoreCase);
62 while (ix + len <= strLen && Compare(str + ix, pattern, len, ignoreCase)) {
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
| swap_member.pass.cpp | 31 typedef test_compare<std::equal_to<int> > Compare;
33 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1));
36 C c2(0, Hash(2), Compare(2), Alloc(2));
43 assert(c1.key_eq() == Compare(2));
52 assert(c2.key_eq() == Compare(1));
60 typedef test_compare<std::equal_to<int> > Compare;
62 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
75 C c1(0, Hash(1), Compare(1), Alloc(1));
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.swap/ |
| swap_non_member.pass.cpp | 31 typedef test_compare<std::equal_to<int> > Compare;
33 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1));
36 C c2(0, Hash(2), Compare(2), Alloc(2));
43 assert(c1.key_eq() == Compare(2));
52 assert(c2.key_eq() == Compare(1));
60 typedef test_compare<std::equal_to<int> > Compare;
62 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C;
75 C c1(0, Hash(1), Compare(1), Alloc(1));
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| swap_member.pass.cpp | 32 typedef test_compare<std::equal_to<int> > Compare;
34 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
36 C c1(0, Hash(1), Compare(1), Alloc(1));
37 C c2(0, Hash(2), Compare(2), Alloc(2));
44 assert(c1.key_eq() == Compare(2));
53 assert(c2.key_eq() == Compare(1));
61 typedef test_compare<std::equal_to<int> > Compare;
63 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
76 C c1(0, Hash(1), Compare(1), Alloc(1));
77 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.swap/ |
| swap_non_member.pass.cpp | 31 typedef test_compare<std::equal_to<int> > Compare;
33 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
35 C c1(0, Hash(1), Compare(1), Alloc(1));
36 C c2(0, Hash(2), Compare(2), Alloc(2));
43 assert(c1.key_eq() == Compare(2));
52 assert(c2.key_eq() == Compare(1));
60 typedef test_compare<std::equal_to<int> > Compare;
62 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C;
75 C c1(0, Hash(1), Compare(1), Alloc(1));
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| swap_member.pass.cpp | 30 typedef test_compare<std::equal_to<int> > Compare;
32 typedef std::unordered_multiset<int, 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_multiset<int, 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++/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/ |
| swap_non_member.pass.cpp | 30 typedef test_compare<std::equal_to<int> > Compare;
32 typedef std::unordered_multiset<int, 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_multiset<int, 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++/libcxx/test/containers/unord/unord.set/ |
| swap_member.pass.cpp | 30 typedef test_compare<std::equal_to<int> > Compare;
32 typedef std::unordered_set<int, 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_set<int, 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++/libcxx/test/containers/unord/unord.set/unord.set.swap/ |
| swap_non_member.pass.cpp | 30 typedef test_compare<std::equal_to<int> > Compare;
32 typedef std::unordered_set<int, 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_set<int, 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...] |
| /art/runtime/ |
| dex_cache_resolved_classes.h | 36 // Only compare the key elements, ignore the resolved classes.
37 int Compare(const DexCacheResolvedClasses& other) const {
41 // Don't need to compare base_location_ since dex_location_ has more info.
42 return dex_location_.compare(other.dex_location_);
75 return a.Compare(b) < 0;
|
| /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));
|
| /external/libcxx/test/std/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;
|
| /frameworks/av/media/libstagefright/codecs/common/include/ |
| voMem.h | 48 VO_S32 (VO_API * Compare) (VO_S32 uID, VO_PTR pBuffer1, VO_PTR pBuffer2, VO_U32 uSize);
|
