Lines Matching refs:rRange
50 …inline bool operator()( const ValueRange& rRange, sal_Int32 nValue ) const { return rRange… in operator ()()
57 void ValueRangeSet::insert( const ValueRange& rRange ) in insert() argument
62 …ValueRangeVector::iterator aIt = ::std::lower_bound( aBeg, aEnd, rRange.mnFirst, ValueRangeComp() … in insert()
64 if( (aIt != aEnd) && aIt->contains( rRange ) ) return; in insert()
66 if( (aIt != aBeg) && ((aIt - 1)->mnLast + 1 == rRange.mnFirst) ) --aIt; in insert()
68 if( (aIt != aEnd) && aIt->intersects( rRange ) ) in insert()
71 aIt->mnFirst = ::std::min( aIt->mnFirst, rRange.mnFirst ); in insert()
74 while( (aNext != aEnd) && aNext->intersects( rRange ) ) ++aNext; in insert()
76 aIt->mnLast = ::std::max( (aNext - 1)->mnLast, rRange.mnLast ); in insert()
83 maRanges.insert( aIt, rRange ); in insert()
87 ValueRangeVector ValueRangeSet::getIntersection( const ValueRange& rRange ) const in getIntersection()
91 …nst_iterator aIt = ::std::lower_bound( maRanges.begin(), maRanges.end(), rRange.mnFirst, ValueRang… in getIntersection()
92 …or::const_iterator aEnd = maRanges.end(); (aIt != aEnd) && (aIt->mnFirst <= rRange.mnLast); ++aIt ) in getIntersection()
93 …es.push_back( ValueRange( ::std::max( aIt->mnFirst, rRange.mnFirst ), ::std::min( aIt->mnLast, rRa… in getIntersection()