63     auto iter = std::lower_bound(mRanges.begin(), mRanges.end(), makeUidRangeParcel(intUid, intUid),  in hasUid()
65     return (iter != mRanges.end() && iter->start == intUid) ||  in hasUid()
66            (iter != mRanges.begin() && (--iter)->stop >= intUid);  in hasUid()
70     return mRanges;  in getRanges()
74     mRanges.clear();  in parseFrom()
108         mRanges.push_back(makeUidRangeParcel(uidStart, uidEnd));  in parseFrom()
110     std::sort(mRanges.begin(), mRanges.end(), compUidRangeParcel);  in parseFrom()
115     mRanges = ranges;  in UidRanges()
116     std::sort(mRanges.begin(), mRanges.end(), compUidRangeParcel);  in UidRanges()
120     auto middle = mRanges.insert(mRanges.end(), other.mRanges.begin(), other.mRanges.end());  in add()
121     std::inplace_merge(mRanges.begin(), middle, mRanges.end(), compUidRangeParcel);  in add()
125     auto end = std::set_difference(mRanges.begin(), mRanges.end(), other.mRanges.begin(),  in remove()
126                                    other.mRanges.end(), mRanges.begin(), compUidRangeParcel);  in remove()
127     mRanges.erase(end, mRanges.end());  in remove()
136     for (size_t i = 0; i < mRanges.size(); i++) {  in overlapsSelf()
137         for (size_t j = i + 1; j < mRanges.size(); j++) {  in overlapsSelf()
138             if (isOverlapped(mRanges[i], mRanges[j])) {  in overlapsSelf()
147     for (const auto& thisRange : mRanges) {  in overlaps()
159     for (const auto &range : mRanges) {  in toString()