Home
last modified time | relevance | path

Searched refs:max_ (Results 1 – 9 of 9) sorted by relevance

/external/chromium/testing/gmock/src/
Dgmock-cardinalities.cc54 max_(max >= min_ ? max : min_) { in BetweenCardinalityImpl()
75 virtual int ConservativeUpperBound() const { return max_; } in ConservativeUpperBound()
78 return min_ <= call_count && call_count <= max_ ; in IsSatisfiedByCallCount()
82 return call_count >= max_; in IsSaturatedByCallCount()
88 const int max_; member in testing::__anoncf51261a0111::BetweenCardinalityImpl
109 if (max_ == 0) { in DescribeTo()
111 } else if (max_ == INT_MAX) { in DescribeTo()
114 *os << "called at most " << FormatTimes(max_); in DescribeTo()
116 } else if (min_ == max_) { in DescribeTo()
118 } else if (max_ == INT_MAX) { in DescribeTo()
[all …]
/external/qemu/android/utils/
Dvector.h21 unsigned max_##name \
30 (obj)->max_##name = 0; \
37 (obj)->max_##name = (count); \
44 (obj)->max_##name = 0; \
58 (obj)->max_##name = (newMax); \
64 if (_newCount > (obj)->max_##name) \
67 &(obj)->max_##name, _newCount ); \
/external/freetype/src/cff/
Dcffparse.c783 #define CFF_FIELD_DELTA( code_, name_, max_, id_ ) \ in FT_Create_Class_cff_field_handlers() argument
789 clazz[i].array_max = max_; \ in FT_Create_Class_cff_field_handlers()
832 #define CFF_FIELD_DELTA( code_, name_, max_, id_ ) \ in FT_Create_Class_cff_field_handlers() argument
838 clazz[i].array_max = max_; \ in FT_Create_Class_cff_field_handlers()
/external/regex-re2/re2/
Dregexp.h326 int max() { DCHECK_EQ(op_, kRegexpRepeat); return max_; } in max()
547 int max_; member
Dsimplify.cc277 Regexp* nre = SimplifyRepeat(newsub, re->min_, re->max_, in PostVisit()
Dregexp.cc268 re->max_ = max; in Repeat()
Dparse.cc487 re->max_ = max; in PushRepetition()
/external/v8/src/
Dast.h2402 max_(max), in RegExpQuantifier()
2427 int max() { return max_; } in max()
2436 int max_; variable
/external/e2fsprogs/po/
Dcs.po3010 " [-e max_špatných_bloků] [-p počet_průchodů]\n"