| /external/chromium/testing/gmock/src/ |
| gmock-cardinalities.cc | 54 max_(max >= min_ ? max : min_) {
75 virtual int ConservativeUpperBound() const { return max_; }
78 return min_ <= call_count && call_count <= max_ ;
82 return call_count >= max_;
88 const int max_; member in class:testing::__anon4277::BetweenCardinalityImpl
109 if (max_ == 0) {
111 } else if (max_ == INT_MAX) {
114 *os << "called at most " << FormatTimes(max_);
116 } else if (min_ == max_) {
118 } else if (max_ == INT_MAX)
122 *os << "called between " << min_ << " and " << max_ << " times"; local
[all...] |
| /external/qemu/android/utils/ |
| vector.h | 21 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/regex-re2/re2/ |
| regexp.h | 120 // Matches sub_[0] at least min_ times, at most max_ times.
121 // max_ == -1 means no upper limit.
326 int max() { DCHECK_EQ(op_, kRegexpRepeat); return max_; }
547 int max_; member in struct:re2::Regexp::__anon12118::__anon12119
|
| simplify.cc | 277 Regexp* nre = SimplifyRepeat(newsub, re->min_, re->max_,
|
| regexp.cc | 268 re->max_ = max;
|
| parse.cc | 487 re->max_ = max;
[all...] |
| /external/freetype/src/cff/ |
| cffparse.c | 783 #define CFF_FIELD_DELTA( code_, name_, max_, id_ ) \
789 clazz[i].array_max = max_; \
832 #define CFF_FIELD_DELTA( code_, name_, max_, id_ ) \
838 clazz[i].array_max = max_; \
|
| /external/v8/src/ |
| ast.h | 2436 int max_; member in class:v8::internal::RegExpQuantifier
[all...] |
