Home
last modified time | relevance | path

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

12345678910>>...22

/third_party/protobuf/src/google/protobuf/util/
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_, message_2_, field, -1, -1, NULL)); in TEST_F()
[all …]
Dmessage_differencer_unittest.cc84 EXPECT_TRUE(differencer->Compare(msg1, msg2)); in ExpectEqualsWithDifferencer()
87 EXPECT_TRUE(differencer->Compare(msg1, msg2)); in ExpectEqualsWithDifferencer()
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()
176 EXPECT_TRUE(differencer.Compare(msg1, msg2)); in TEST()
192 EXPECT_TRUE(differencer.Compare(msg1, msg2)); in TEST()
207 EXPECT_TRUE(differencer.Compare(msg1, msg2)); in TEST()
223 EXPECT_FALSE(differencer.Compare(msg1, msg2)); in TEST()
[all …]
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()
/third_party/gn/src/base/containers/
Dflat_map.h151 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 …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/SystemZ/
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,
176 static unsigned getCompareSourceReg(MachineInstr &Compare) { in getCompareSourceReg() argument
178 if (Compare.isCompare()) in getCompareSourceReg()
179 reg = Compare.getOperand(0).getReg(); in getCompareSourceReg()
[all …]
/third_party/skia/third_party/externals/swiftshader/tests/regres/cov/
Dspan.go32 func (l Location) Compare(o Location) int { func
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 }
62 func (s Span) Compare(o Span) int { func
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) <=…
92 idxStart := sort.Search(len(*l), func(i int) bool { return (*l)[i].End.Compare(s.Start) >= 0 })
98 idxEnd := sort.Search(len(*l), func(i int) bool { return (*l)[i].Start.Compare(s.End) > 0 })
127 idxStart := sort.Search(len(*l), func(i int) bool { return (*l)[i].End.Compare(s.Start) > 0 })
128 idxEnd := sort.Search(len(*l), func(i int) bool { return (*l)[i].Start.Compare(s.End) >= 0 })
[all …]
/third_party/node/deps/v8/src/zone/
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, ZoneAllocator<K>> {
139 : std::multiset<K, Compare, ZoneAllocator<K>>(Compare(), in ZoneMultiset()
145 template <typename K, typename V, typename Compare = std::less<K>>
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/pnacl-llvm/include/llvm/Bitcode/NaCl/
DNaClBitCodes.h206 int Compare(const NaClBitCodeAbbrevOp &Op) const { in Compare() function
239 return Op1.Compare(Op2) < 0;
244 return Op1.Compare(Op2) <= 0;
249 return Op1.Compare(Op2) == 0;
254 return Op1.Compare(Op2) != 0;
259 return Op1.Compare(Op2) >= 0;
264 return Op1.Compare(Op2) > 0;
300 int Compare(const NaClBitCodeAbbrev &Abbrev) const {
311 if (int Diff = OperandList[I].Compare(Abbrev.OperandList[I]))
348 return A1.Compare(A2) < 0;
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
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(),
31 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
36 const Compare &compare = Compare(),
38 : std::priority_queue<T, Sequence, Compare>(begin, end, compare, sequence)
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/glslang/Test/baseResults/
Dloops.frag.out21 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 …]
D100Limits.vert.out18 0:24 Compare Less Than ( temp bool)
34 0:29 Compare Equal ( temp bool)
70 0:33 Compare Equal ( temp bool)
83 0:34 Compare Less Than ( temp bool)
101 0:35 Compare Less Than or Equal ( temp bool)
119 0:36 Compare Less Than or Equal ( temp bool)
127 0:36 Compare Equal ( temp bool)
147 0:37 Compare Less Than or Equal ( temp bool)
165 0:38 Compare Not Equal ( temp bool)
173 0:38 Compare Equal ( temp bool)
[all …]
DearlyReturnDiscard.frag.out16 0:26 Compare Greater Than ( temp bool)
29 0:31 Compare Less Than ( temp bool)
44 0:36 Compare Greater Than ( temp bool)
56 0:42 Compare Greater Than ( temp bool)
66 0:43 Compare Greater Than ( temp bool)
88 0:48 Compare Less Than ( temp bool)
146 0:26 Compare Greater Than ( temp bool)
159 0:31 Compare Less Than ( temp bool)
174 0:36 Compare Greater Than ( temp bool)
186 0:42 Compare Greater Than ( temp bool)
[all …]
DloopsArtificial.frag.out15 0:71 Compare Less Than ( temp bool)
28 0:60 Compare Less Than ( temp bool)
45 0:62 Compare Less Than ( temp bool)
61 0:67 Compare Less Than ( temp bool)
83 0:74 Compare Less Than ( temp bool)
93 0:75 Compare Less Than ( temp bool)
110 0:81 Compare Less Than ( temp bool)
127 0:83 Compare Less Than ( temp bool)
143 0:88 Compare Less Than ( temp bool)
232 0:71 Compare Less Than ( temp bool)
[all …]
/third_party/node/deps/v8/src/numbers/
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
82 return x.Compare(y) == 0;
86 return x.Compare(y) != 0;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
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/icu/vendor/double-conversion/upstream/test/cctest/
Dtest-bignum.cc1070 TEST(Compare) { in TEST() argument
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(bignum2, bignum1)); in TEST()
[all …]
/third_party/zlib/contrib/ada/
Dmtest.adb57 procedure Compare (Item : in Stream_Element_Array); subprogspec
63 procedure Compare (Item : in Stream_Element_Array) is subprogram
71 end Compare;
73 procedure Compare_Write is new ZLib.Write (Write => Compare);
/third_party/node/deps/v8/src/base/numbers/
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()
/third_party/icu/vendor/double-conversion/upstream/double-conversion/
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()
/third_party/icu/icu4c/source/i18n/
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()
/third_party/node/deps/icu-small/source/i18n/
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()
/third_party/skia/third_party/externals/icu/source/i18n/
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()
/third_party/gn/src/base/
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() argument
210 template <class Key, class T, class Compare, class Allocator, class Predicate>
211 void EraseIf(std::multimap<Key, T, Compare, Allocator>& container, in EraseIf() argument
216 template <class Key, class Compare, class Allocator, class Predicate>
217 void EraseIf(std::set<Key, Compare, Allocator>& container, Predicate pred) { in EraseIf() argument
221 template <class Key, class Compare, class Allocator, class Predicate>
222 void EraseIf(std::multiset<Key, Compare, Allocator>& container, in EraseIf() argument
/third_party/json/tests/thirdparty/fifo_map/
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() argument
524 nlohmann::fifo_map<Key, T, Compare, Allocator>& m2) in swap()

12345678910>>...22