| access(unsigned x) const | Sawyer::Container::AddressMap< A, T > | inline |
| access(unsigned x) | Sawyer::Container::AddressMap< A, T > | inline |
| Address typedef | Sawyer::Container::AddressMap< A, T > | |
| AddressMap() | Sawyer::Container::AddressMap< A, T > | inline |
| AddressMap(const AddressMap &other, bool copyOnWrite=false) | Sawyer::Container::AddressMap< A, T > | inline |
| after(Address x) const | Sawyer::Container::AddressMap< A, T > | inline |
| after(Address x) | Sawyer::Container::AddressMap< A, T > | inline |
| any() const | Sawyer::Container::AddressMap< A, T > | inline |
| any() | Sawyer::Container::AddressMap< A, T > | inline |
| at(Address x) const | Sawyer::Container::AddressMap< A, T > | inline |
| at(Address x) | Sawyer::Container::AddressMap< A, T > | inline |
| at(const Sawyer::Container::Interval< Address > &x) const | Sawyer::Container::AddressMap< A, T > | inline |
| at(const Sawyer::Container::Interval< Address > &x) | Sawyer::Container::AddressMap< A, T > | inline |
| atOrAfter(Address x) const | Sawyer::Container::AddressMap< A, T > | inline |
| atOrAfter(Address x) | Sawyer::Container::AddressMap< A, T > | inline |
| atOrBefore(Address x) const | Sawyer::Container::AddressMap< A, T > | inline |
| atOrBefore(Address x) | Sawyer::Container::AddressMap< A, T > | inline |
| available(const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) const | Sawyer::Container::AddressMap< A, T > | inline |
| baseSize(Address base, Address size) const | Sawyer::Container::AddressMap< A, T > | inline |
| baseSize(Address base, Address size) | Sawyer::Container::AddressMap< A, T > | inline |
| before(Address x) const | Sawyer::Container::AddressMap< A, T > | inline |
| before(Address x) | Sawyer::Container::AddressMap< A, T > | inline |
| 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 |
| Buffer typedef (defined in Sawyer::Container::AddressMap< A, T >) | Sawyer::Container::AddressMap< A, T > | |
| changeAccess(unsigned requiredAccess, unsigned prohibitedAccess, const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0) | Sawyer::Container::AddressMap< A, T > | inline |
| checkConsistency() const | Sawyer::Container::AddressMap< A, T > | inline |
| clear() | Sawyer::Container::IntervalMap< I, T, Policy > | inline |
| ConstIntervalIterator typedef | Sawyer::Container::AddressMap< A, T > | |
| ConstNodeIterator typedef | Sawyer::Container::AddressMap< A, T > | |
| ConstSegmentIterator typedef | Sawyer::Container::AddressMap< A, T > | |
| ConstValueIterator typedef | Sawyer::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 AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) const | Sawyer::Container::AddressMap< A, T > | inline |
| Sawyer::Container::IntervalMap::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 |
| findFreeSpace(size_t nValues, size_t alignment=1, Sawyer::Container::Interval< Address > restriction=Sawyer::Container::Interval< Address >::whole(), MatchFlags flags=0) const | Sawyer::Container::AddressMap< A, T > | inline |
| findImpl(IMap &imap, const typename Interval::Value &scalar) | Sawyer::Container::IntervalMap< I, T, Policy > | inlinestatic |
| findNode(const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) const | Sawyer::Container::AddressMap< A, T > | inline |
| findNode(const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0) | Sawyer::Container::AddressMap< A, T > | inline |
| 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 typedef | Sawyer::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 |
| keep(const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0) | Sawyer::Container::AddressMap< A, T > | 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 |
| limit(size_t x) const | Sawyer::Container::AddressMap< A, T > | inline |
| limit(size_t x) | Sawyer::Container::AddressMap< A, T > | 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 typedef | Sawyer::Container::IntervalMap< I, T, Policy > | |
| next(const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) const | Sawyer::Container::AddressMap< A, T > | inline |
| nIntervals() const | Sawyer::Container::IntervalMap< I, T, Policy > | inline |
| Node typedef | Sawyer::Container::AddressMap< A, T > | |
| NodeIterator typedef | Sawyer::Container::AddressMap< A, T > | |
| nodes() | Sawyer::Container::AddressMap< A, T > | inline |
| nodes() const | Sawyer::Container::AddressMap< A, T > | inline |
| nodes(const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) const | Sawyer::Container::AddressMap< A, T > | inline |
| nodes(const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0) | Sawyer::Container::AddressMap< A, T > | inline |
| none() const | Sawyer::Container::AddressMap< A, T > | inline |
| none() | Sawyer::Container::AddressMap< A, T > | inline |
| nSegments() const | Sawyer::Container::AddressMap< A, T > | inline |
| operator=(const AddressMap &other) (defined in Sawyer::Container::AddressMap< A, T >) | Sawyer::Container::AddressMap< A, T > | inline |
| Sawyer::Container::IntervalMap::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 |
| overlaps(const Interval &interval) const (defined in Sawyer::Container::IntervalMap< I, T, Policy >) | Sawyer::Container::IntervalMap< I, T, Policy > | inline |
| overlaps(const IntervalMap< Interval, T2, Policy2 > &other) const (defined in Sawyer::Container::IntervalMap< I, T, Policy >) | Sawyer::Container::IntervalMap< I, T, Policy > | inline |
| prohibit(unsigned x) const | Sawyer::Container::AddressMap< A, T > | inline |
| prohibit(unsigned x) | Sawyer::Container::AddressMap< A, T > | inline |
| prune(const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0) | Sawyer::Container::AddressMap< A, T > | inline |
| read(Value *buf, const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) const | Sawyer::Container::AddressMap< A, T > | inline |
| read(std::vector< Value > &buf, const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) const | Sawyer::Container::AddressMap< A, T > | inline |
| require(unsigned x) const | Sawyer::Container::AddressMap< A, T > | inline |
| require(unsigned x) | Sawyer::Container::AddressMap< A, T > | inline |
| Segment typedef | Sawyer::Container::AddressMap< A, T > | |
| SegmentIterator typedef | Sawyer::Container::AddressMap< A, T > | |
| segmentPredicate(SegmentPredicate< Address, Value > *p) const | Sawyer::Container::AddressMap< A, T > | inline |
| segmentPredicate(SegmentPredicate< Address, Value > *p) | Sawyer::Container::AddressMap< A, T > | inline |
| segments() | Sawyer::Container::AddressMap< A, T > | inline |
| segments() const | Sawyer::Container::AddressMap< A, T > | inline |
| segments(const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) const | Sawyer::Container::AddressMap< A, T > | inline |
| segments(const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0) | Sawyer::Container::AddressMap< A, T > | inline |
| singleSegment() const | Sawyer::Container::AddressMap< A, T > | inline |
| singleSegment() | Sawyer::Container::AddressMap< A, T > | inline |
| size() const | Sawyer::Container::IntervalMap< I, T, Policy > | inline |
| substr(const std::string &x) const | Sawyer::Container::AddressMap< A, T > | inline |
| substr(const std::string &x) | Sawyer::Container::AddressMap< A, T > | inline |
| traverse(Functor &functor, const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) const | Sawyer::Container::AddressMap< A, T > | inline |
| traverse(Functor &functor, const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0) | Sawyer::Container::AddressMap< A, T > | inline |
| traverse(Visitor &visitor, const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) const | Sawyer::Container::AddressMap< A, T > | inline |
| traverse(Visitor &visitor, const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0) | Sawyer::Container::AddressMap< A, T > | inline |
| unmapped(Address boundary, MatchFlags flags=0) const | Sawyer::Container::AddressMap< A, T > | 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 typedef | Sawyer::Container::AddressMap< A, T > | |
| ValueIterator typedef | Sawyer::Container::IntervalMap< I, T, Policy > | |
| values() | Sawyer::Container::IntervalMap< I, T, Policy > | inline |
| values() const | Sawyer::Container::IntervalMap< I, T, Policy > | inline |
| within(const Sawyer::Container::Interval< Address > &x) const | Sawyer::Container::AddressMap< A, T > | inline |
| within(const Sawyer::Container::Interval< Address > &x) | Sawyer::Container::AddressMap< A, T > | inline |
| within(Address x, Address y) const | Sawyer::Container::AddressMap< A, T > | inline |
| within(Address x, Address y) | Sawyer::Container::AddressMap< A, T > | inline |
| write(const Value *buf, const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0) | Sawyer::Container::AddressMap< A, T > | inline |
| write(const std::vector< Value > &buf, const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0) | Sawyer::Container::AddressMap< A, T > | inline |
