HomeSort by relevance Sort by last modified time
    Searched defs:ranges_ (Results 1 - 13 of 13) sorted by null

  /external/pdfium/testing/
range_set.h 28 void Clear() { ranges_.clear(); }
37 const RangesContainer& ranges() const { return ranges_; }
44 RangesContainer ranges_; member in class:RangeSet
  /external/libchrome/base/metrics/
bucket_ranges.h 41 size_t size() const { return ranges_.size(); }
42 HistogramBase::Sample range(size_t i) const { return ranges_[i]; }
44 DCHECK_LT(i, ranges_.size());
46 ranges_[i] = value;
55 size_t bucket_count() const { return ranges_.size() - 1; }
63 // Return true iff |other| object has same ranges_ as |this| object's ranges_.
81 Ranges ranges_; member in class:base::BucketRanges
83 // Checksum for the conntents of ranges_. Used to detect random over-writes
statistics_recorder.h 279 RangesMap ranges_; member in class:base::StatisticsRecorder
  /external/v4l2_codec2/vda/
ranges.h 51 std::vector<std::pair<T, T> > ranges_; member in class:media::Ranges
61 return ranges_.size();
67 for (i = 0; i < ranges_.size() && ranges_[i].second < start; ++i) {
73 if (i == ranges_.size()) {
74 ranges_.push_back(std::make_pair(start, end));
75 return ranges_.size();
80 if (end < ranges_[i].first) {
81 ranges_.insert(ranges_.begin() + i, std::make_pair(start, end))
    [all...]
  /bootable/recovery/otautil/include/otautil/
rangeset.h 62 return ranges_.size();
71 return ranges_.cbegin();
75 return ranges_.cend();
79 return ranges_.begin();
83 return ranges_.end();
87 return ranges_.begin();
91 return ranges_.end();
96 return ranges_.crbegin();
100 return ranges_.crend();
105 return !ranges_.empty()
123 std::vector<Range> ranges_; member in class:RangeSet
    [all...]
sysutil.h 86 return ranges_.size();
101 std::vector<MappedRange> ranges_; member in class:MemMapping
  /art/libartbase/base/
memory_type_table.h 88 MemoryTypeTable(MemoryTypeTable&& table) : ranges_(std::move(table.ranges_)) {}
91 ranges_ = std::move(table.ranges_);
98 int last = static_cast<int>(ranges_.size()) - 1;
101 if (address < ranges_[m].Start()) {
103 } else if (address >= ranges_[m].Limit()) {
106 DCHECK(ranges_[m].Contains(address))
107 << reinterpret_cast<void*>(address) << " " << ranges_[m];
108 return &ranges_[m]
123 std::vector<MemoryTypeRange<T>> ranges_; member in class:art::final
160 std::map<uintptr_t, MemoryTypeRange<T>> ranges_; member in class:art::final
    [all...]
  /external/bcc/src/cc/
syms.h 105 std::vector<Range> ranges_; member in struct:ProcSyms::Module
121 uint64_t start() const { return ranges_.begin()->start; }
  /external/libbrillo/brillo/http/
http_request.h 325 std::vector<std::pair<uint64_t, uint64_t>> ranges_; member in class:brillo::http::final
327 // range_value_omitted is used in |ranges_| list to indicate omitted value.
  /external/v8/src/profiler/
allocation-tracker.h 80 size_t size() { return ranges_.size(); }
95 RangeMap ranges_; member in class:v8::internal::AddressToTraceMap
  /bootable/recovery/updater/include/private/
commands.h 37 : hash_(std::move(hash)), ranges_(std::move(ranges)) {}
44 return ranges_;
48 return ranges_.blocks();
52 return hash_ == other.hash_ && ranges_ == other.ranges_;
61 RangeSet ranges_; member in class:TargetInfo
71 StashInfo(std::string id, RangeSet ranges) : id_(std::move(id)), ranges_(std::move(ranges)) {}
74 return ranges_.blocks();
82 return ranges_;
86 return id_ == other.id_ && ranges_ == other.ranges_
95 RangeSet ranges_; member in class:StashInfo
154 RangeSet ranges_; member in class:SourceInfo
    [all...]
  /external/v8/src/wasm/
wasm-code-manager.h 57 explicit DisjointAllocationPool(AddressRange range) : ranges_({range}) {}
71 bool IsEmpty() const { return ranges_.empty(); }
72 const std::list<AddressRange>& ranges() const { return ranges_; }
75 std::list<AddressRange> ranges_; member in class:v8::internal::wasm::final
  /external/v8/src/regexp/
regexp-ast.h 144 : ranges_(nullptr), standard_set_type_(standard_set_type) {}
146 : ranges_(ranges), standard_set_type_(0) {}
156 ZoneList<CharacterRange>* ranges_; member in class:v8::internal::BASE_EMBEDDED

Completed in 339 milliseconds