| /external/google-breakpad/src/processor/ |
| D | static_map_iterator-inl.h | 44 template<typename Key, typename Value, typename Compare>
45 StaticMapIterator<Key, Value, Compare>::StaticMapIterator(const char* base, in StaticMapIterator()
57 template<typename Key, typename Value, typename Compare>
58 StaticMapIterator<Key, Value, Compare>&
59 StaticMapIterator<Key, Value, Compare>::operator++() {
68 template<typename Key, typename Value, typename Compare>
69 StaticMapIterator<Key, Value, Compare>
70 StaticMapIterator<Key, Value, Compare>::operator++(int postfix_operator) {
75 StaticMapIterator<Key, Value, Compare> tmp = *this;
80 template<typename Key, typename Value, typename Compare>
[all …]
|
| D | static_map-inl.h | 45 template<typename Key, typename Value, typename Compare>
46 StaticMap<Key, Value, Compare>::StaticMap(const char* raw_data) in StaticMap()
60 template<typename Key, typename Value, typename Compare>
61 StaticMapIterator<Key, Value, Compare>
62 StaticMap<Key, Value, Compare>::find(const Key &key) const { in find()
81 template<typename Key, typename Value, typename Compare>
82 StaticMapIterator<Key, Value, Compare>
83 StaticMap<Key, Value, Compare>::lower_bound(const Key &key) const { in lower_bound()
102 template<typename Key, typename Value, typename Compare>
103 StaticMapIterator<Key, Value, Compare>
[all …]
|
| /external/protobuf/src/google/protobuf/util/ |
| D | field_comparator_test.cc | 65 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
72 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
79 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
88 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
92 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
101 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
105 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
115 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
119 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
129 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
[all …]
|
| /external/libchrome/base/containers/ |
| D | flat_map.h | 151 template <class Key, class Mapped, class Compare = std::less<>>
156 Compare> {
162 Compare>;
180 explicit flat_map(const Compare& comp);
186 const Compare& comp = Compare());
193 const Compare& comp = Compare());
197 const Compare& comp = Compare());
244 template <class Key, class Mapped, class Compare>
245 flat_map<Key, Mapped, Compare>::flat_map(const Compare& comp) : tree(comp) {} in flat_map()
247 template <class Key, class Mapped, class Compare>
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/SystemZ/ |
| D | SystemZElimCompare.cpp | 85 bool convertToBRCT(MachineInstr &MI, MachineInstr &Compare,
87 bool convertToLoadAndTrap(MachineInstr &MI, MachineInstr &Compare,
89 bool convertToLoadAndTest(MachineInstr &MI, MachineInstr &Compare,
91 bool adjustCCMasksForInstr(MachineInstr &MI, MachineInstr &Compare,
94 bool optimizeCompareZero(MachineInstr &Compare,
96 bool fuseCompareOperations(MachineInstr &Compare,
179 static unsigned getCompareSourceReg(MachineInstr &Compare) { in getCompareSourceReg() argument
181 if (Compare.isCompare()) in getCompareSourceReg()
182 reg = Compare.getOperand(0).getReg(); in getCompareSourceReg()
183 else if (isLoadAndTestAsCmp(Compare)) in getCompareSourceReg()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.swap/ |
| D | swap_non_member.pass.cpp | 32 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
34 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; in main()
35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
36 C c2(0, Hash(2), Compare(2), Alloc(1, 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_multiset<int, Hash, Compare, Alloc> C; in main()
75 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(1, 2)); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| D | swap_member.pass.cpp | 32 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
34 typedef std::unordered_multiset<int, Hash, Compare, Alloc> C; in main()
35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
36 C c2(0, Hash(2), Compare(2), Alloc(1, 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_multiset<int, Hash, Compare, Alloc> C; in main()
75 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(1, 2)); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.set/unord.set.swap/ |
| D | swap_non_member.pass.cpp | 32 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
34 typedef std::unordered_set<int, Hash, Compare, Alloc> C; in main()
35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
36 C c2(0, Hash(2), Compare(2), Alloc(1, 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_set<int, Hash, Compare, Alloc> C; in main()
75 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(1, 2)); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| D | swap_member.pass.cpp | 32 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
34 typedef std::unordered_set<int, Hash, Compare, Alloc> C; in main()
35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
36 C c2(0, Hash(2), Compare(2), Alloc(1, 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_set<int, Hash, Compare, Alloc> C; in main()
75 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
76 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(1, 2)); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.swap/ |
| D | swap_non_member.pass.cpp | 33 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
35 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; in main()
36 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
37 C c2(0, Hash(2), Compare(2), Alloc(1, 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_map<int, std::string, Hash, Compare, Alloc> C; in main()
76 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
77 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(1, 2)); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| D | swap_member.pass.cpp | 33 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
35 typedef std::unordered_map<int, std::string, Hash, Compare, Alloc> C; in main()
36 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
37 C c2(0, Hash(2), Compare(2), Alloc(1, 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_map<int, std::string, Hash, Compare, Alloc> C; in main()
76 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
77 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(1, 2)); in main()
[all …]
|
| /external/llvm/lib/Target/SystemZ/ |
| D | SystemZElimCompare.cpp | 74 bool convertToBRCT(MachineInstr &MI, MachineInstr &Compare,
77 bool adjustCCMasksForInstr(MachineInstr &MI, MachineInstr &Compare,
79 bool optimizeCompareZero(MachineInstr &Compare,
81 bool fuseCompareOperations(MachineInstr &Compare,
161 static unsigned getCompareSourceReg(MachineInstr &Compare) { in getCompareSourceReg() argument
163 if (Compare.isCompare()) in getCompareSourceReg()
164 reg = Compare.getOperand(0).getReg(); in getCompareSourceReg()
165 else if (isLoadAndTestAsCmp(Compare)) in getCompareSourceReg()
166 reg = Compare.getOperand(1).getReg(); in getCompareSourceReg()
176 MachineInstr &MI, MachineInstr &Compare, in convertToBRCT() argument
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.swap/ |
| D | swap_non_member.pass.cpp | 33 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
35 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C; in main()
36 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
37 C c2(0, Hash(2), Compare(2), Alloc(1, 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, 1)); in main()
77 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(1, 2)); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.multimap/ |
| D | swap_member.pass.cpp | 35 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
37 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C; in main()
38 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
39 C c2(0, Hash(2), Compare(2), Alloc(1, 2)); in main()
46 assert(c1.key_eq() == Compare(2)); in main()
55 assert(c2.key_eq() == Compare(1)); in main()
63 typedef test_compare<std::equal_to<int> > Compare; in main() typedef
65 typedef std::unordered_multimap<int, std::string, Hash, Compare, Alloc> C; in main()
78 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main()
79 C c2(std::begin(a2), std::end(a2), 0, Hash(2), Compare(2), Alloc(1, 2)); in main()
[all …]
|
| /external/v8/src/zone/ |
| D | zone-containers.h | 91 template <typename T, typename Compare = std::less<T>>
93 : public std::priority_queue<T, ZoneVector<T>, Compare> {
97 : std::priority_queue<T, ZoneVector<T>, Compare>(Compare(), in ZonePriorityQueue()
123 template <typename K, typename Compare = std::less<K>>
124 class ZoneSet : public std::set<K, Compare, ZoneAllocator<K>> {
128 : std::set<K, Compare, ZoneAllocator<K>>(Compare(), in ZoneSet()
134 template <typename K, typename Compare = std::less<K>>
135 class ZoneMultiset : public std::multiset<K, Compare, ZoneAllocator<K>> {
139 : std::multiset<K, Compare, ZoneAllocator<K>>(Compare(), in ZoneMultiset()
145 template <typename K, typename V, typename Compare = std::less<K>>
[all …]
|
| /external/webrtc/webrtc/libjingle/xmllite/ |
| D | qname.h | 49 int Compare(const StaticQName& other) const;
50 int Compare(const QName& other) const;
53 return Compare(other) == 0;
56 return Compare(other) == 0;
59 return Compare(other) != 0;
62 return Compare(other) != 0;
65 return Compare(other) < 0;
74 return other.Compare(*this) == 0;
78 return other.Compare(*this) != 0;
|
| /external/libtextclassifier/native/actions/ |
| D | ranker.cc | 41 int Compare(const T& left, const T& right) { in Compare() function
52 int Compare(const std::string& left, const std::string& right) { in Compare() function
57 int Compare(const MessageTextSpan& span, const MessageTextSpan& other) { in Compare() function
58 if (const int value = Compare(span.message_index, other.message_index)) { in Compare()
61 if (const int value = Compare(span.span.first, other.span.first)) { in Compare()
64 if (const int value = Compare(span.span.second, other.span.second)) { in Compare()
71 return Compare(span, other) == 0; in IsSameSpan()
81 int Compare(const ActionSuggestionAnnotation& annotation, in Compare() function
83 if (const int value = Compare(annotation.span, other.span)) { in Compare()
86 if (const int value = Compare(annotation.name, other.name)) { in Compare()
[all …]
|
| /external/libchrome/mojo/public/cpp/bindings/ |
| D | map_traits_flat_map.h | 13 template <typename K, typename V, typename Compare>
14 struct MapTraits<base::flat_map<K, V, Compare>> {
17 using Iterator = typename base::flat_map<K, V, Compare>::iterator;
18 using ConstIterator = typename base::flat_map<K, V, Compare>::const_iterator;
20 static size_t GetSize(const base::flat_map<K, V, Compare>& input) {
24 static ConstIterator GetBegin(const base::flat_map<K, V, Compare>& input) {
27 static Iterator GetBegin(base::flat_map<K, V, Compare>& input) {
41 static bool Insert(base::flat_map<K, V, Compare>& input,
49 static void SetToEmpty(base::flat_map<K, V, Compare>* output) {
|
| D | map_traits_stl.h | 15 template <typename K, typename V, typename Compare>
16 struct MapTraits<std::map<K, V, Compare>> {
19 using Iterator = typename std::map<K, V, Compare>::iterator;
20 using ConstIterator = typename std::map<K, V, Compare>::const_iterator;
22 static bool IsNull(const std::map<K, V, Compare>& input) {
27 static void SetToNull(std::map<K, V, Compare>* output) {
32 static size_t GetSize(const std::map<K, V, Compare>& input) {
36 static ConstIterator GetBegin(const std::map<K, V, Compare>& input) {
39 static Iterator GetBegin(std::map<K, V, Compare>& input) {
52 static bool Insert(std::map<K, V, Compare>& input, const K& key, V&& value) {
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| D | 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(),
39 : std::priority_queue<T, Sequence, Compare>(begin, end, compare, sequence)
|
| /external/swiftshader/third_party/subzero/pnacl-llvm/include/llvm/Bitcode/NaCl/ |
| D | NaClBitCodes.h | 194 int Compare(const NaClBitCodeAbbrevOp &Op) const { in Compare() function
226 return Op1.Compare(Op2) < 0;
231 return Op1.Compare(Op2) <= 0;
236 return Op1.Compare(Op2) == 0;
241 return Op1.Compare(Op2) != 0;
246 return Op1.Compare(Op2) >= 0;
251 return Op1.Compare(Op2) > 0;
285 int Compare(const NaClBitCodeAbbrev &Abbrev) const {
296 if (int Diff = OperandList[I].Compare(Abbrev.OperandList[I]))
332 return A1.Compare(A2) < 0;
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | 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(),
39 : std::priority_queue<T, Sequence, Compare>(begin, end, compare, sequence)
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/Support/ |
| D | JSONTest.cpp | 122 auto Compare = [](llvm::StringRef S, Value Expected) { in TEST() local
134 Compare(R"(true)", true); in TEST()
135 Compare(R"(false)", false); in TEST()
136 Compare(R"(null)", nullptr); in TEST()
138 Compare(R"(42)", 42); in TEST()
139 Compare(R"(2.5)", 2.5); in TEST()
140 Compare(R"(2e50)", 2e50); in TEST()
141 Compare(R"(1.2e3456789)", std::numeric_limits<double>::infinity()); in TEST()
143 Compare(R"("foo")", "foo"); in TEST()
144 Compare(R"("\"\\\b\f\n\r\t")", "\"\\\b\f\n\r\t"); in TEST()
[all …]
|
| /external/Reactive-Extensions/RxCpp/Ix/CPP/src/cpplinq/ |
| D | linq_groupby.hpp | 57 template <class Collection, class KeyFn, class Compare = default_less>
84 std::map<key_type, group_type*, Compare> groupIndex;
89 Compare comp;
93 Compare comp = Compare()) in impl_t()
150 Compare comp = Compare()) in cursor()
179 Compare comp = Compare()) in linq_groupby()
189 Compare comp;
|
| /external/deqp-deps/glslang/Test/baseResults/ |
| D | loops.frag.out | 21 0:59 Compare Less Than ( temp bool)
40 0:63 Compare Less Than ( temp bool)
67 0:73 Compare Less Than ( temp bool)
80 0:78 Compare Less Than ( temp bool)
93 0:80 Compare Less Than ( temp bool)
106 0:87 Compare Less Than ( temp bool)
120 0:92 Compare Less Than ( temp bool)
126 0:92 Compare Less Than ( temp bool)
139 0:97 Compare Less Than ( temp bool)
152 0:99 Compare Less Than ( temp bool)
[all …]
|