Home
last modified time | relevance | path

Searched refs:Compare (Results 1 - 25 of 229) sorted by relevance

12345678910

/third_party/gn/src/base/containers/
H A Dflat_map.h64 // const Compare& compare = Compare());
69 // const Compare& compare = Compare()); // Re-use storage.
72 // const Compare& comp = Compare());
151 template <class Key, class Mapped, class Compare = std::less<>>
156 Compare> {
162 Compare>;
180 explicit flat_map(const Compare
[all...]
H A Dflat_set.h50 // const Compare& compare = Compare());
55 // const Compare& compare = Compare()); // Re-use storage.
58 // const Compare& comp = Compare());
132 template <class Key, class Compare = std::less<>>
137 Compare>;
/third_party/protobuf/src/google/protobuf/util/
H A Dfield_comparator_test.cc62 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
69 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
76 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
85 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
89 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
98 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
102 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
112 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
116 comparator_.Compare(message_1_, message_2_, field, -1, -1, NULL)); in TEST_F()
126 comparator_.Compare(message_1 in TEST_F()
[all...]
H A Dmessage_differencer_unittest.cc84 EXPECT_TRUE(differencer->Compare(msg1, msg2)); in ExpectEqualsWithDifferencer()
87 EXPECT_TRUE(differencer->Compare(msg1, msg2)); in ExpectEqualsWithDifferencer()
98 // Compare in TEST()
112 // Compare in TEST()
126 // Compare in TEST()
142 EXPECT_TRUE(differencer.Compare(msg1, msg2)); in TEST()
144 EXPECT_FALSE(differencer.Compare(msg1, msg2)); in TEST()
146 EXPECT_TRUE(differencer.Compare(msg1, msg2)); in TEST()
148 EXPECT_FALSE(differencer.Compare(msg1, msg2)); in TEST()
161 // Compare in TEST()
2273 virtual ComparisonResult Compare(const Message& message_1, Compare() function in google::protobuf::__anon17105::ParentSavingFieldComparator
[all...]
H A Dfield_comparator.cc58 FieldComparator::ComparisonResult DefaultFieldComparator::Compare( in Compare() function in google::protobuf::util::DefaultFieldComparator
68 return ResultFromBoolean(Compare##METHOD( \ in Compare()
73 Compare##METHOD(*field, reflection_1->Get##METHOD(message_1, field), \ in Compare()
130 bool DefaultFieldComparator::Compare(MessageDifferencer* differencer, in Compare() function in google::protobuf::util::DefaultFieldComparator
134 return differencer->Compare(message1, message2, in Compare()
H A Dfield_comparator.h87 virtual ComparisonResult Compare(const Message& message_1,
116 ComparisonResult Compare(const Message& message_1, const Message& message_2,
154 // Compare using the provided message_differencer. For example, a subclass can
157 bool Compare(MessageDifferencer* differencer, const Message& message1,
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/SystemZ/
H A DSystemZElimCompare.cpp85 bool convertToBRCT(MachineInstr &MI, MachineInstr &Compare,
87 bool convertToLoadAndTrap(MachineInstr &MI, MachineInstr &Compare,
89 bool convertToLoadAndTest(MachineInstr &MI, MachineInstr &Compare,
91 bool convertToLogical(MachineInstr &MI, MachineInstr &Compare,
93 bool adjustCCMasksForInstr(MachineInstr &MI, MachineInstr &Compare,
96 bool optimizeCompareZero(MachineInstr &Compare,
98 bool fuseCompareOperations(MachineInstr &Compare,
174 // Return the source register of Compare, which is the unknown value
176 static unsigned getCompareSourceReg(MachineInstr &Compare) { in getCompareSourceReg() argument
178 if (Compare in getCompareSourceReg()
190 convertToBRCT( MachineInstr &MI, MachineInstr &Compare, SmallVectorImpl<MachineInstr *> &CCUsers) convertToBRCT() argument
244 convertToLoadAndTrap( MachineInstr &MI, MachineInstr &Compare, SmallVectorImpl<MachineInstr *> &CCUsers) convertToLoadAndTrap() argument
284 convertToLoadAndTest( MachineInstr &MI, MachineInstr &Compare, SmallVectorImpl<MachineInstr *> &CCUsers) convertToLoadAndTest() argument
312 convertToLogical( MachineInstr &MI, MachineInstr &Compare, SmallVectorImpl<MachineInstr *> &CCUsers) convertToLogical() argument
360 adjustCCMasksForInstr( MachineInstr &MI, MachineInstr &Compare, SmallVectorImpl<MachineInstr *> &CCUsers, unsigned ConvOpc) adjustCCMasksForInstr() argument
501 isCompareZero(MachineInstr &Compare) isCompareZero() argument
520 optimizeCompareZero( MachineInstr &Compare, SmallVectorImpl<MachineInstr *> &CCUsers) optimizeCompareZero() argument
596 fuseCompareOperations( MachineInstr &Compare, SmallVectorImpl<MachineInstr *> &CCUsers) fuseCompareOperations() argument
[all...]
/third_party/node/deps/v8/src/zone/
H A Dzone-containers.h91 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, ZoneAllocato
[all...]
/third_party/skia/third_party/externals/swiftshader/tests/regres/cov/
H A Dspan.go31 // Compare returns -1 if l comes before o, 1 if l comes after o, otherwise 0.
32 func (l Location) Compare(o Location) int {
47 func (l Location) Before(o Location) bool { return l.Compare(o) == -1 }
50 func (l Location) After(o Location) bool { return l.Compare(o) == 1 }
61 // Compare returns -1 if l comes before o, 1 if l comes after o, otherwise 0.
62 func (s Span) Compare(o Span) int {
77 func (s Span) Before(o Span) bool { return s.Compare(o) == -1 }
80 func (s Span) Inside(o Span) bool { return s.Start.Compare(o.Start) >= 0 && s.End.Compare(o.End) <= 0 }
92 idxStart := sort.Search(len(*l), func(i int) bool { return (*l)[i].End.Compare(
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/pnacl-llvm/include/llvm/Bitcode/NaCl/
H A DNaClBitCodes.h206 int Compare(const NaClBitCodeAbbrevOp &Op) const { in Compare() function in llvm::NaClBitCodeAbbrevOp
207 // Compare encoding values. in Compare()
239 return Op1.Compare(Op2) < 0; in operator <()
244 return Op1.Compare(Op2) <= 0; in operator <=()
249 return Op1.Compare(Op2) == 0; in operator ==()
254 return Op1.Compare(Op2) != 0; in operator !=()
259 return Op1.Compare(Op2) >= 0; in operator >=()
264 return Op1.Compare(Op2) > 0; in operator >()
300 int Compare(const NaClBitCodeAbbrev &Abbrev) const { in Compare() function in llvm::NaClBitCodeAbbrev
311 if (int Diff = OperandList[I].Compare(Abbre in Compare()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DPriorityQueue.h26 class Compare = std::less<typename Sequence::value_type> >
27 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
29 explicit PriorityQueue(const Compare &compare = Compare(), in PriorityQueue() argument
31 : std::priority_queue<T, Sequence, Compare>(compare, sequence) in PriorityQueue()
36 const Compare &compare = Compare(), in PriorityQueue()
38 : std::priority_queue<T, Sequence, Compare>(begin, end, compare, sequence) in PriorityQueue()
35 PriorityQueue(Iterator begin, Iterator end, const Compare &compare = Compare(), const Sequence &sequence = Sequence()) PriorityQueue() argument
H A Dsimple_ilist.h258 template <class Compare> void merge(simple_ilist &RHS, Compare comp);
264 template <class Compare> void sort(Compare comp);
269 template <class Compare>
270 void simple_ilist<T, Options...>::merge(simple_ilist &RHS, Compare comp) { in merge()
291 template <class Compare>
292 void simple_ilist<T, Options...>::sort(Compare comp) { in sort()
/third_party/node/deps/v8/src/numbers/
H A Dinteger-literal.h32 return Compare(IntegerLiteral(std::numeric_limits<T>::min(), false)) >= 0 && in IsRepresentableAs()
33 Compare(IntegerLiteral(std::numeric_limits<T>::max(), false)) <= 0; in IsRepresentableAs()
52 int Compare(const IntegerLiteral& other) const { in Compare() function in v8::internal::IntegerLiteral
82 return x.Compare(y) == 0; in operator ==()
86 return x.Compare(y) != 0; in operator !=()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
H A Dsimple_ilist.h254 template <class Compare> void merge(simple_ilist &RHS, Compare comp);
260 template <class Compare> void sort(Compare comp);
265 template <class Compare>
266 void simple_ilist<T, Options...>::merge(simple_ilist &RHS, Compare comp) { in merge()
287 template <class Compare>
288 void simple_ilist<T, Options...>::sort(Compare comp) { in sort()
/third_party/json/tests/thirdparty/fifo_map/
H A Dfifo_map.hpp100 class Compare = fifo_map_compare<Key>,
110 using key_compare = Compare;
117 using internal_map_type = std::map<Key, T, Compare, Allocator>;
512 Compare m_compare;
522 template <class Key, class T, class Compare, class Allocator>
523 inline void swap(nlohmann::fifo_map<Key, T, Compare, Allocator>& m1, in swap()
524 nlohmann::fifo_map<Key, T, Compare, Allocator>& m2) in swap()
/third_party/icu/vendor/double-conversion/upstream/double-conversion/
H A Dbignum.h76 static int Compare(const Bignum& a, const Bignum& b);
78 return Compare(a, b) == 0; in Equal()
81 return Compare(a, b) <= 0; in LessEqual()
84 return Compare(a, b) < 0; in Less()
86 // Returns Compare(a + b, c);
/third_party/icu/icu4c/source/i18n/
H A Ddouble-conversion-bignum.h90 static int Compare(const Bignum& a, const Bignum& b);
92 return Compare(a, b) == 0; in Equal()
95 return Compare(a, b) <= 0; in LessEqual()
98 return Compare(a, b) < 0; in Less()
100 // Returns Compare(a + b, c);
/third_party/node/deps/icu-small/source/i18n/
H A Ddouble-conversion-bignum.h90 static int Compare(const Bignum& a, const Bignum& b);
92 return Compare(a, b) == 0; in Equal()
95 return Compare(a, b) <= 0; in LessEqual()
98 return Compare(a, b) < 0; in Less()
100 // Returns Compare(a + b, c);
/third_party/node/deps/v8/src/base/numbers/
H A Dbignum.h52 static int Compare(const Bignum& a, const Bignum& b);
54 return Compare(a, b) == 0; in Equal()
57 return Compare(a, b) <= 0; in LessEqual()
60 return Compare(a, b) < 0; in Less()
62 // Returns Compare(a + b, c);
/third_party/skia/third_party/externals/icu/source/i18n/
H A Ddouble-conversion-bignum.h90 static int Compare(const Bignum& a, const Bignum& b);
92 return Compare(a, b) == 0; in Equal()
95 return Compare(a, b) <= 0; in LessEqual()
98 return Compare(a, b) < 0; in Less()
100 // Returns Compare(a + b, c);
/third_party/icu/vendor/double-conversion/upstream/test/cctest/
H A Dtest-bignum.cc1070 TEST(Compare) { in TEST()
1075 CHECK_EQ(0, Bignum::Compare(bignum1, bignum2)); in TEST()
1082 CHECK_EQ(-1, Bignum::Compare(bignum1, bignum2)); in TEST()
1083 CHECK_EQ(+1, Bignum::Compare(bignum2, bignum1)); in TEST()
1093 CHECK_EQ(0, Bignum::Compare(bignum1, bignum2)); in TEST()
1097 CHECK_EQ(-1, Bignum::Compare(bignum1, bignum2)); in TEST()
1098 CHECK_EQ(+1, Bignum::Compare(bignum2, bignum1)); in TEST()
1104 CHECK_EQ(0, Bignum::Compare(bignum1, bignum2)); in TEST()
1110 CHECK_EQ(-1, Bignum::Compare(bignum1, bignum2)); in TEST()
1111 CHECK_EQ(+1, Bignum::Compare(bignum in TEST()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/
H A Dbtree_set.h71 template <typename Key, typename Compare = std::less<Key>,
76 Key, Compare, Alloc, /*TargetNodeSize=*/256,
393 template <typename Key, typename Compare = std::less<Key>,
398 Key, Compare, Alloc, /*TargetNodeSize=*/256,
/third_party/gn/src/base/
H A Dstl_util.h205 template <class Key, class T, class Compare, class Allocator, class Predicate>
206 void EraseIf(std::map<Key, T, Compare, Allocator>& container, Predicate pred) { in EraseIf()
210 template <class Key, class T, class Compare, class Allocator, class Predicate>
211 void EraseIf(std::multimap<Key, T, Compare, Allocator>& container, in EraseIf()
216 template <class Key, class Compare, class Allocator, class Predicate>
217 void EraseIf(std::set<Key, Compare, Allocator>& container, Predicate pred) { in EraseIf()
221 template <class Key, class Compare, class Allocator, class Predicate>
222 void EraseIf(std::multiset<Key, Compare, Allocator>& container, in EraseIf()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/IR/
H A DValue.h565 template <class Compare> void sortUseList(Compare Cmp);
579 template <class Compare>
580 static Use *mergeUseLists(Use *L, Use *R, Compare Cmp) { in mergeUseLists()
610 template <class Compare>
611 static void mergeUseListsImpl(Use *L, Use *R, Use **Next, Compare Cmp);
639 template <class Compare> void Value::sortUseList(Compare Cmp) { in sortUseList()
/third_party/lzma/CPP/Common/
H A DMyVector.h309 const int comp = item.Compare(midVal); in FindInSorted2()
357 const int comp = item.Compare(midVal); in AddToUniqueSorted2()
417 if (s < size && p[(size_t)s + 1].Compare(p[s]) > 0) in SortRefDown2()
419 if (temp.Compare(p[s]) >= 0) in SortRefDown2()
643 const int comp = item.Compare(midVal); in FindInSorted()
662 const int comp = item.Compare(midVal); in AddToUniqueSorted()
683 const int comp = item.Compare(midVal);
703 { return (*(*((const T *const *)a1))).Compare(*(*((const T *const *)a2))); } in CompareObjectItems()

Completed in 19 milliseconds

12345678910