Home | History | Annotate | Download | only in fst

Lines Matching full:iset

97   void Union(const IntervalSet<T> &iset) {
98 const vector<Interval> *intervals = iset.Intervals();
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,
202 const vector<Interval> *iintervals = iset.Intervals();
259 void IntervalSet<T>::Difference(const IntervalSet<T> &iset,
266 iset.Complement(intervals_.back().end, &cset);
274 bool IntervalSet<T>::Overlaps(const IntervalSet<T> &iset) const {
275 const vector<Interval> *intervals = iset.Intervals();
294 bool IntervalSet<T>::StrictlyOverlaps(const IntervalSet<T> &iset) const {
295 const vector<Interval> *intervals = iset.Intervals();
340 bool IntervalSet<T>::Contains(const IntervalSet<T> &iset) const {
341 if (iset.Count() > Count())
344 const vector<Interval> *intervals = iset.Intervals();