Home
last modified time | relevance | path

Searched refs:AtLeast (Results 1 – 12 of 12) sorted by relevance

/freebsd/contrib/googletest/googlemock/test/
H A Dgmock-cardinalities_test.cc44 using testing::AtLeast;
136 AtLeast(-1); in TEST()
142 const Cardinality c = AtLeast(0); in TEST()
155 const Cardinality c = AtLeast(2); in TEST()
166 AtLeast(1).DescribeTo(&ss1); in TEST()
174 AtLeast(3).DescribeTo(&ss3); in TEST()
179 const Cardinality c = AtLeast(2); in TEST()
H A Dgmock-spec-builders_test.cc743 EXPECT_CALL(b, DoB(5)).Description("DoB Method").Times(AtLeast(2)); in TEST()
/freebsd/contrib/googletest/googlemock/src/
H A Dgmock-cardinalities.cc139 GTEST_API_ Cardinality AtLeast(int n) { return Between(n, INT_MAX); } in AtLeast() function
145 GTEST_API_ Cardinality AnyNumber() { return AtLeast(0); } in AnyNumber()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDenseMap.h579 void grow(unsigned AtLeast) { in grow() argument
580 static_cast<DerivedT *>(this)->grow(AtLeast); in grow()
845 void grow(unsigned AtLeast) { in grow() argument
849 allocateBuckets(std::max<unsigned>(64, static_cast<unsigned>(NextPowerOf2(AtLeast-1)))); in grow()
1086 void grow(unsigned AtLeast) { in grow() argument
1087 if (AtLeast > InlineBuckets) in grow()
1088 AtLeast = std::max<unsigned>(64, NextPowerOf2(AtLeast-1)); in grow()
1116 if (AtLeast > InlineBuckets) { in grow()
1118 new (getLargeRep()) LargeRep(allocateBuckets(AtLeast)); in grow()
1126 if (AtLeast <= InlineBuckets) { in grow()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_dense_map.h392 void grow(unsigned AtLeast) { static_cast<DerivedT *>(this)->grow(AtLeast); } in grow() argument
644 void grow(unsigned AtLeast) { in grow() argument
648 allocateBuckets(RoundUpToPowerOfTwo(Max<unsigned>(64, AtLeast))); in grow()
/freebsd/contrib/googletest/googlemock/include/gmock/
H A Dgmock-cardinalities.h136 GTEST_API_ Cardinality AtLeast(int n);
H A Dgmock-spec-builders.h1048 set_cardinality(AtLeast(static_cast<int>(untyped_actions_.size()))); in WillRepeatedly()
/freebsd/contrib/llvm-project/llvm/lib/Target/ARC/Disassembler/
H A DARCDisassembler.cpp182 static const uint64_t AtLeast = 2; in DecodeSymbolicOperand() local
184 Inst, Value, Address, true, 0, AtLeast, 0)); in DecodeSymbolicOperand()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUCodeGenPrepare.cpp246 unsigned AtLeast, bool Signed) const;
1194 Value *Den, unsigned AtLeast, in getDivNumBits() argument
1198 if (LHSSignBits < AtLeast) in getDivNumBits()
1202 if (RHSSignBits < AtLeast) in getDivNumBits()
1220 unsigned AtLeast = (SSBits <= 24) ? 0 : (SSBits - 24 + IsSigned); in expandDivRem24() local
1221 int DivBits = getDivNumBits(I, Num, Den, AtLeast, IsSigned); in expandDivRem24()
/freebsd/contrib/googletest/docs/
H A Dgmock_for_dummies.md230 using ::testing::AtLeast; // #1
235 .Times(AtLeast(1));
415 We've seen `AtLeast(n)` as an example of fuzzy cardinalities earlier. For the
427 0, the cardinality is `Times(AtLeast(n))`.
H A Dgmock_cook_book.md759 using ::testing::AtLeast;
785 .Times(AtLeast(1));
3796 `AtLeast(5)` or `Between(2, 4)`.
/freebsd/contrib/googletest/docs/reference/
H A Dmocking.md133 | `AtLeast(n)` | The function call is expected at least *n* times. |
146 *n* >= 0, the inferred cardinality is `Times(AtLeast(n))`.