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