max_              275 ash/wm/workspace/workspace_window_resizer.cc       max_ = size_;
max_              279 ash/wm/workspace/workspace_window_resizer.cc     return size_ == (shrinking ? min_ : max_);
max_              291 ash/wm/workspace/workspace_window_resizer.cc     return max_ != 0;
max_              299 ash/wm/workspace/workspace_window_resizer.cc     return has_max() && size_ > max_;
max_              317 ash/wm/workspace/workspace_window_resizer.cc     if (has_max() && new_value > max_) {
max_              318 ash/wm/workspace/workspace_window_resizer.cc       size_ = max_;
max_              319 ash/wm/workspace/workspace_window_resizer.cc       return new_value - max_;
max_              329 ash/wm/workspace/workspace_window_resizer.cc   int max_;
max_               27 base/metrics/histogram_samples.cc   HistogramBase::Sample max_;
max_               45 base/metrics/histogram_samples.cc       !iter_->ReadInt(&max_) ||
max_               55 base/metrics/histogram_samples.cc   *max = max_;
max_              109 components/policy/core/browser/configuration_policy_handler.cc       max_(max),
max_              135 components/policy/core/browser/configuration_policy_handler.cc   if (value < min_ || value > max_) {
max_              145 components/policy/core/browser/configuration_policy_handler.cc     value = std::min(std::max(value, min_), max_);
max_              134 components/policy/core/browser/configuration_policy_handler.h   int max_;
max_              486 third_party/re2/re2/parse.cc   re->max_ = max;
max_              279 third_party/re2/re2/regexp.cc   re->max_ = max;
max_              327 third_party/re2/re2/regexp.h   int max() { DCHECK_EQ(op_, kRegexpRepeat); return max_; }
max_              548 third_party/re2/re2/regexp.h       int max_;
max_              277 third_party/re2/re2/simplify.cc       Regexp* nre = SimplifyRepeat(newsub, re->min_, re->max_,
max_               47 ui/gfx/break_list.h   size_t max() const { return max_; }
max_               68 ui/gfx/break_list.h   size_t max_;
max_               72 ui/gfx/break_list.h BreakList<T>::BreakList() : breaks_(1, Break(0, T())), max_(0) {
max_               76 ui/gfx/break_list.h BreakList<T>::BreakList(T value) : breaks_(1, Break(0, value)), max_(0) {
max_               91 ui/gfx/break_list.h   DCHECK(Range(0, max_).Contains(range));
max_              102 ui/gfx/break_list.h   if (trailing_value != value && range.end() != max_)
max_              115 ui/gfx/break_list.h   max_ = max;
max_              142 ui/gfx/break_list.h   return Range(i->first, next == breaks_.end() ? max_ : next->first);
max_              168 ui/gfx/break_list.h   if (max_ > 0)
max_              169 ui/gfx/break_list.h     DCHECK_LT(breaks_.back().first, max_) << "Break beyond max position.";