97   void Union(const IntervalSet<T> &iset) {  in Union()  argument
98     const vector<Interval> *intervals = iset.Intervals();  in Union()
115   bool operator==(const IntervalSet<T>& iset) const {
116     return *(iset.Intervals()) == intervals_;
120   bool operator!=(const IntervalSet<T>& iset) const {
121     return *(iset.Intervals()) != intervals_;
135   void Intersect(const IntervalSet<T> &iset, IntervalSet<T> *oset) const;
143   void Difference(const IntervalSet<T> &iset, IntervalSet<T> *oset) const;
147   bool Overlaps(const IntervalSet<T> &iset) const;
151   bool StrictlyOverlaps(const IntervalSet<T> &iset) const;
155   bool Contains(const IntervalSet<T> &iset) const;
200 void IntervalSet<T>::Intersect(const IntervalSet<T> &iset,  in Intersect()  argument
202   const vector<Interval> *iintervals = iset.Intervals();  in Intersect()
259 void IntervalSet<T>::Difference(const IntervalSet<T> &iset,  in Difference()  argument
266     iset.Complement(intervals_.back().end, &cset);  in Difference()
274 bool IntervalSet<T>::Overlaps(const IntervalSet<T> &iset) const {  in Overlaps()  argument
275   const vector<Interval> *intervals = iset.Intervals();  in Overlaps()
294 bool IntervalSet<T>::StrictlyOverlaps(const IntervalSet<T> &iset) const {  in StrictlyOverlaps()  argument
295   const vector<Interval> *intervals = iset.Intervals();  in StrictlyOverlaps()
340 bool IntervalSet<T>::Contains(const IntervalSet<T> &iset) const {  in Contains()  argument
341   if (iset.Count() > Count())  in Contains()
344   const vector<Interval> *intervals = iset.Intervals();  in Contains()