ROSE  0.9.10.54
Sawyer::Container::IntervalMap< I, T, Policy > Member List

This is the complete list of members for Sawyer::Container::IntervalMap< I, T, Policy >, including all inherited members.

bestFit(const typename Interval::Value &size, NodeIterator start)Sawyer::Container::IntervalMap< I, T, Policy >inline
bestFit(const typename Interval::Value &size, ConstNodeIterator start) const Sawyer::Container::IntervalMap< I, T, Policy >inline
bestFitImpl(IMap &imap, const typename Interval::Value &size, typename IntervalMapTraits< IMap >::NodeIterator start)Sawyer::Container::IntervalMap< I, T, Policy >inlinestatic
clear()Sawyer::Container::IntervalMap< I, T, Policy >inline
ConstIntervalIterator typedefSawyer::Container::IntervalMap< I, T, Policy >
ConstNodeIterator typedefSawyer::Container::IntervalMap< I, T, Policy >
ConstValueIterator typedefSawyer::Container::IntervalMap< I, T, Policy >
contains(Interval key) const (defined in Sawyer::Container::IntervalMap< I, T, Policy >)Sawyer::Container::IntervalMap< I, T, Policy >inline
contains(const IntervalMap< Interval, T2, Policy2 > &other) const (defined in Sawyer::Container::IntervalMap< I, T, Policy >)Sawyer::Container::IntervalMap< I, T, Policy >inline
erase(const Interval &erasure)Sawyer::Container::IntervalMap< I, T, Policy >inline
eraseMultiple(const IntervalMap< Interval, T2, Policy2 > &other)Sawyer::Container::IntervalMap< I, T, Policy >inline
exists(const typename Interval::Value &size) const Sawyer::Container::IntervalMap< I, T, Policy >inline
find(const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< I, T, Policy >inline
find(const typename Interval::Value &scalar) const Sawyer::Container::IntervalMap< I, T, Policy >inline
findAll(const Interval &interval)Sawyer::Container::IntervalMap< I, T, Policy >inline
findAll(const Interval &interval) const Sawyer::Container::IntervalMap< I, T, Policy >inline
findAllImpl(IMap &imap, const Interval &interval)Sawyer::Container::IntervalMap< I, T, Policy >inlinestatic
findFirstOverlap(const Interval &interval)Sawyer::Container::IntervalMap< I, T, Policy >inline
findFirstOverlap(const Interval &interval) const Sawyer::Container::IntervalMap< I, T, Policy >inline
findFirstOverlap(typename IntervalMap::NodeIterator thisIter, const IntervalMap< Interval, T2, Policy2 > &other, typename IntervalMap< Interval, T2, Policy2 >::ConstNodeIterator otherIter)Sawyer::Container::IntervalMap< I, T, Policy >inline
findFirstOverlap(typename IntervalMap::ConstNodeIterator thisIter, const IntervalMap< Interval, T2, Policy2 > &other, typename IntervalMap< Interval, T2, Policy2 >::ConstNodeIterator otherIter) const Sawyer::Container::IntervalMap< I, T, Policy >inline
findFirstOverlapImpl(IMap &imap, const Interval &interval)Sawyer::Container::IntervalMap< I, T, Policy >inlinestatic
findFirstOverlapImpl(IMap &imap, typename IntervalMapTraits< IMap >::NodeIterator thisIter, const IntervalMap< Interval, T2, Policy2 > &other, typename IntervalMap< Interval, T2, Policy2 >::ConstNodeIterator otherIter)Sawyer::Container::IntervalMap< I, T, Policy >inlinestatic
findImpl(IMap &imap, const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< I, T, Policy >inlinestatic
findPrior(const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< I, T, Policy >inline
findPrior(const typename Interval::Value &scalar) const Sawyer::Container::IntervalMap< I, T, Policy >inline
findPriorImpl(IMap &imap, const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< I, T, Policy >inlinestatic
firstFit(const typename Interval::Value &size, NodeIterator start)Sawyer::Container::IntervalMap< I, T, Policy >inline
firstFit(const typename Interval::Value &size, ConstNodeIterator start) const Sawyer::Container::IntervalMap< I, T, Policy >inline
firstFitImpl(IMap &imap, const typename Interval::Value &size, typename IntervalMapTraits< IMap >::NodeIterator start)Sawyer::Container::IntervalMap< I, T, Policy >inlinestatic
firstUnmapped(typename Interval::Value minAddr) const Sawyer::Container::IntervalMap< I, T, Policy >inline
get(const typename Interval::Value &scalar) const Sawyer::Container::IntervalMap< I, T, Policy >inline
getOptional(const typename Interval::Value &scalar) const Sawyer::Container::IntervalMap< I, T, Policy >inline
getOrDefault(const typename Interval::Value &scalar) const Sawyer::Container::IntervalMap< I, T, Policy >inline
getOrElse(const typename Interval::Value &scalar, Value &dflt)Sawyer::Container::IntervalMap< I, T, Policy >inline
getOrElse(const typename Interval::Value &scalar, const Value &dflt) const Sawyer::Container::IntervalMap< I, T, Policy >inline
greatest() const Sawyer::Container::IntervalMap< I, T, Policy >inline
greatest(typename Interval::Value upperLimit) const Sawyer::Container::IntervalMap< I, T, Policy >inline
greatestUnmapped(typename Interval::Value upperLimit) const Sawyer::Container::IntervalMap< I, T, Policy >inline
hull() const Sawyer::Container::IntervalMap< I, T, Policy >inline
insert(Interval key, Value value, bool makeHole=true)Sawyer::Container::IntervalMap< I, T, Policy >inline
insertMultiple(const IntervalMap< Interval, T2, Policy2 > &other, bool makeHole=true)Sawyer::Container::IntervalMap< I, T, Policy >inline
Interval typedefSawyer::Container::IntervalMap< I, T, Policy >
IntervalMap()Sawyer::Container::IntervalMap< I, T, Policy >inline
IntervalMap(const IntervalMap< Interval2, T2, Policy2 > &other)Sawyer::Container::IntervalMap< I, T, Policy >inline
intervals() const Sawyer::Container::IntervalMap< I, T, Policy >inline
isDistinct(const Interval &interval) const (defined in Sawyer::Container::IntervalMap< I, T, Policy >)Sawyer::Container::IntervalMap< I, T, Policy >inline
isDistinct(const IntervalMap< Interval, T2, Policy2 > &other) const (defined in Sawyer::Container::IntervalMap< I, T, Policy >)Sawyer::Container::IntervalMap< I, T, Policy >inline
isEmpty() const Sawyer::Container::IntervalMap< I, T, Policy >inline
isOverlapping(const Interval &interval) const (defined in Sawyer::Container::IntervalMap< I, T, Policy >)Sawyer::Container::IntervalMap< I, T, Policy >inline
isOverlapping(const IntervalMap< Interval, T2, Policy2 > &other) const (defined in Sawyer::Container::IntervalMap< I, T, Policy >)Sawyer::Container::IntervalMap< I, T, Policy >inline
lastUnmapped(typename Interval::Value maxAddr) const Sawyer::Container::IntervalMap< I, T, Policy >inline
least() const Sawyer::Container::IntervalMap< I, T, Policy >inline
least(typename Interval::Value lowerLimit) const Sawyer::Container::IntervalMap< I, T, Policy >inline
leastUnmapped(typename Interval::Value lowerLimit) const Sawyer::Container::IntervalMap< I, T, Policy >inline
lowerBound(const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< I, T, Policy >inline
lowerBound(const typename Interval::Value &scalar) const Sawyer::Container::IntervalMap< I, T, Policy >inline
Map typedefSawyer::Container::IntervalMap< I, T, Policy >
nIntervals() const Sawyer::Container::IntervalMap< I, T, Policy >inline
Node typedefSawyer::Container::IntervalMap< I, T, Policy >
NodeIterator typedefSawyer::Container::IntervalMap< I, T, Policy >
nodes()Sawyer::Container::IntervalMap< I, T, Policy >inline
nodes() const Sawyer::Container::IntervalMap< I, T, Policy >inline
operator=(const IntervalMap< Interval2, T2, Policy2 > &other)Sawyer::Container::IntervalMap< I, T, Policy >inline
operator[](const typename Interval::Value &scalar) const Sawyer::Container::IntervalMap< I, T, Policy >inline
size() const Sawyer::Container::IntervalMap< I, T, Policy >inline
upperBound(const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< I, T, Policy >inline
upperBound(const typename Interval::Value &scalar) const Sawyer::Container::IntervalMap< I, T, Policy >inline
Value typedefSawyer::Container::IntervalMap< I, T, Policy >
ValueIterator typedefSawyer::Container::IntervalMap< I, T, Policy >
values()Sawyer::Container::IntervalMap< I, T, Policy >inline
values() const Sawyer::Container::IntervalMap< I, T, Policy >inline