| /external/chromium/net/disk_cache/ |
| eviction.h | 75 int max_size_; member in class:disk_cache::Eviction
|
| mem_backend_impl.h | 108 int32 max_size_; // Maximum data size for this instance. member in class:disk_cache::MemBackendImpl
|
| backend_impl.h | 349 int32 max_size_; // Maximum data size for this instance. member in class:disk_cache::BackendImpl
|
| /external/regex-re2/util/ |
| sparse_set.h | 57 : size_(0), max_size_(0), sparse_to_dense_(NULL), dense_(NULL) {}
60 max_size_ = max_size;
93 if (new_max_size > max_size_) {
96 memmove(a, sparse_to_dense_, max_size_*sizeof a[0]);
98 for (int i = max_size_; i < new_max_size; i++)
116 max_size_ = new_max_size;
121 int max_size() const { return max_size_; }
129 DCHECK_LT(i, max_size_);
130 if (static_cast<uint>(i) >= max_size_) {
147 if (static_cast<uint>(i) >= max_size_) {
168 int max_size_; member in class:re2::SparseSet
[all...] |
| sparse_array.h | 56 // size max_size_. At any point, the number of elements in the sparse array is
142 return max_size_;
224 int max_size_; member in class:re2::SparseArray
233 : size_(0), max_size_(0), sparse_to_dense_(NULL), dense_() {}
270 if (new_max_size > max_size_) {
273 memmove(a, sparse_to_dense_, max_size_*sizeof a[0]);
276 for (int i = max_size_; i < new_max_size; i++)
285 max_size_ = new_max_size;
286 if (size_ > max_size_)
287 size_ = max_size_;
[all...] |
