Lines Matching refs:end
41 T end;
43 Interval() : begin(-1), end(-1) {}
45 Interval(T b, T e) : begin(b), end(e) {}
48 return begin < i.begin || (begin == i.begin && end > i.end);
52 return begin == i.begin && end == i.end;
56 return begin != i.begin || end != i.end;
64 end = n;
71 n = end;
100 it != intervals->end(); ++it)
108 lower_bound(intervals_.begin(), intervals_.end(), interval);
111 return (--lb)->end > value;
126 intervals_[0].begin + 1 == intervals_[0].end;
175 sort(intervals_.begin(), intervals_.end());
181 if (inti.begin == inti.end)
185 if (intj.begin > inti.end)
187 if (intj.end > inti.end)
188 inti.end = intj.end;
191 count_ += inti.end - inti.begin;
210 while (it1 != intervals_.end() && it2 != iintervals->end()) {
211 if (it1->end <= it2->begin) {
213 } else if (it2->end <= it1->begin) {
218 interval.end = min(it1->end, it2->end);
220 oset->count_ += interval.end - interval.begin;
221 if (it1->end < it2->end)
240 it != intervals_.end();
242 interval.end = min(it->begin, maxval);
243 if (interval.begin < interval.end) {
245 oset->count_ += interval.end - interval.begin;
247 interval.begin = it->end;
249 interval.end = maxval;
250 if (interval.begin < interval.end) {
252 oset->count_ += interval.end - interval.begin;
266 iset.Complement(intervals_.back().end, &cset);
279 while (it1 != intervals_.end() && it2 != intervals->end()) {
280 if (it1->end <= it2->begin) {
282 } else if (it2->end <= it1->begin) {
302 while (it1 != intervals_.end() && it2 != intervals->end()) {
303 if (it1->end <= it2->begin) { // no overlap - it1 first
306 } else if (it2->end <= it1->begin) { // no overlap - it2 first
309 } else if (it2->begin == it1->begin && it2->end == it1->end) { // equals
313 } else if (it2->begin <= it1->begin && it2->end >= it1->end) { // 1 c 2
317 } else if (it1->begin <= it2->begin && it1->end >= it2->end) { // 2 c 1
329 if (it1 != intervals_.end())
331 if (it2 != intervals->end())
348 while (it1 != intervals_.end() && it2 != intervals->end()) {
349 if (it1->end <= it2->begin) { // no overlap - it1 first
351 } else if (it2->begin < it1->begin || it2->end > it1->end) { // no C
353 } else if (it2->end == it1->end) {
360 return it2 == intervals->end();
369 it != intervals->end();
373 strm << "[" << it->begin << "," << it->end << ")";
