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

  /bootable/recovery/otautil/include/otautil/
rangeset.h 137 class SortedRangeSet : public RangeSet {
142 SortedRangeSet() {}
145 explicit SortedRangeSet(std::vector<Range>&& pairs);
149 // Insert the input SortedRangeSet; keep the ranges sorted and merge the overlap ranges.
150 void Insert(const SortedRangeSet& rs);
160 // 0-based continuous block ranges) is covered by the SortedRangeSet. If so, returns the offset
161 // within this SortedRangeSet.
164 // The mapped offset within a SortedRangeSet("1-9 15-19") is 10.
167 // item in SortedRangeSet("1-9 15-19"). So its data can be found at offset 40970 (i.e. 4096 * 10
168 // + 10) in a range represented by this SortedRangeSet
    [all...]
  /bootable/recovery/otautil/
rangeset.cpp 192 SortedRangeSet::SortedRangeSet(std::vector<Range>&& pairs) : RangeSet(std::move(pairs)) {
196 void SortedRangeSet::Insert(const Range& to_insert) {
197 SortedRangeSet rs({ to_insert });
201 // Insert the input SortedRangeSet; keep the ranges sorted and merge the overlap ranges.
202 void SortedRangeSet::Insert(const SortedRangeSet& rs) {
228 void SortedRangeSet::Insert(size_t start, size_t len) {
233 bool SortedRangeSet::Overlaps(size_t start, size_t len) const {
239 // 0-based continuous block ranges) is covered by the SortedRangeSet. If so, returns the offse
    [all...]

Completed in 190 milliseconds