Home | History | Annotate | Download | only in html

Lines Matching refs:m_ranges

57     unsigned size = m_ranges.size();
59 newSession->add(m_ranges[i].m_start, m_ranges[i].m_end);
70 if (!m_ranges.size())
73 double start = m_ranges.first().m_start;
77 for (size_t index = 0; index + 1 < m_ranges.size(); ++index)
78 inverted->add(m_ranges[index].m_end, m_ranges[index + 1].m_start);
80 double end = m_ranges.last().m_end;
85 m_ranges.swap(inverted->m_ranges);
107 for (size_t index = 0; index < other->m_ranges.size(); ++index) {
108 const Range& range = other->m_ranges[index];
112 m_ranges.swap(unioned->m_ranges);
121 return m_ranges[index].m_start;
130 return m_ranges[index].m_end;
146 for (overlappingArcIndex = 0; overlappingArcIndex < m_ranges.size(); overlappingArcIndex++) {
147 if (addedRange.isOverlappingRange(m_ranges[overlappingArcIndex])
148 || addedRange.isContiguousWithRange(m_ranges[overlappingArcIndex])) {
150 addedRange = addedRange.unionWithOverlappingOrContiguousRange(m_ranges[overlappingArcIndex]);
151 m_ranges.remove(overlappingArcIndex);
156 if (addedRange.isBeforeRange(m_ranges[0])) {
162 if (m_ranges[overlappingArcIndex - 1].isBeforeRange(addedRange)
163 && addedRange.isBeforeRange(m_ranges[overlappingArcIndex])) {
173 m_ranges.insert(overlappingArcIndex, addedRange);
216 visitor->trace(m_ranges);