ROSE  0.9.10.103
Sawyer::Container::AddressMap< A, T > Member List

This is the complete list of members for Sawyer::Container::AddressMap< A, T >, including all inherited members.

access(unsigned x) const Sawyer::Container::AddressMap< A, T >inline
access(unsigned x)Sawyer::Container::AddressMap< A, T >inline
Address typedefSawyer::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< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
bestFit(const typename Interval::Value &size, ConstNodeIterator start) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
bestFitImpl(IMap &imap, const typename Interval::Value &size, typename IntervalMapTraits< IMap >::NodeIterator start)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >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< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
ConstIntervalIterator typedefSawyer::Container::AddressMap< A, T >
ConstNodeIterator typedefSawyer::Container::AddressMap< A, T >
ConstSegmentIterator typedefSawyer::Container::AddressMap< A, T >
ConstValueIterator typedefSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >
contains(Interval key) const (defined in Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
contains(const IntervalMap< Interval, T2, Policy2 > &other) const (defined in Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
erase(const Interval &erasure)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
eraseMultiple(const IntervalMap< Interval, T2, Policy2 > &other)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
exists(const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) const Sawyer::Container::AddressMap< A, T >inline
IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >::exists(const typename Interval::Value &size) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
find(const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
find(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
findAll(const Interval &interval)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
findAll(const Interval &interval) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
findAllImpl(IMap &imap, const Interval &interval)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inlinestatic
findFirstOverlap(const Interval &interval)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
findFirstOverlap(const Interval &interval) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
findFirstOverlap(typename IntervalMap::NodeIterator thisIter, const IntervalMap< Interval, T2, Policy2 > &other, typename IntervalMap< Interval, T2, Policy2 >::ConstNodeIterator otherIter)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
findFirstOverlap(typename IntervalMap::ConstNodeIterator thisIter, const IntervalMap< Interval, T2, Policy2 > &other, typename IntervalMap< Interval, T2, Policy2 >::ConstNodeIterator otherIter) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
findFirstOverlapImpl(IMap &imap, const Interval &interval)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >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< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >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< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >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< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
findPrior(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
findPriorImpl(IMap &imap, const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inlinestatic
firstFit(const typename Interval::Value &size, NodeIterator start)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
firstFit(const typename Interval::Value &size, ConstNodeIterator start) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
firstFitImpl(IMap &imap, const typename Interval::Value &size, typename IntervalMapTraits< IMap >::NodeIterator start)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inlinestatic
firstUnmapped(typename Interval::Value minAddr) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
get(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
getOptional(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
getOrDefault(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
getOrElse(const typename Interval::Value &scalar, Value &dflt)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
getOrElse(const typename Interval::Value &scalar, const Value &dflt) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
greatest() constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
greatest(typename Interval::Value upperLimit) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
greatestUnmapped(typename Interval::Value upperLimit) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
hull() constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
insert(Interval key, Value value, bool makeHole=true)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
insertMultiple(const IntervalMap< Interval, T2, Policy2 > &other, bool makeHole=true)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
Interval typedefSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >
IntervalMap()Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
IntervalMap(const IntervalMap< Interval2, T2, Policy2 > &other)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
intervals() constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
isDistinct(const Interval &interval) const (defined in Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
isDistinct(const IntervalMap< Interval, T2, Policy2 > &other) const (defined in Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
isEmpty() constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
isOverlapping(const Interval &interval) const (defined in Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
isOverlapping(const IntervalMap< Interval, T2, Policy2 > &other) const (defined in Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
keep(const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0)Sawyer::Container::AddressMap< A, T >inline
lastUnmapped(typename Interval::Value maxAddr) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
least() constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
least(typename Interval::Value lowerLimit) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
leastUnmapped(typename Interval::Value lowerLimit) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >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< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
lowerBound(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
Map typedefSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >
next(const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) const Sawyer::Container::AddressMap< A, T >inline
nIntervals() constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
Node typedefSawyer::Container::AddressMap< A, T >
NodeIterator typedefSawyer::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 IntervalMap< Interval2, T2, Policy2 > &other)Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
operator[](const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >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 typedefSawyer::Container::AddressMap< A, T >
SegmentIterator typedefSawyer::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() constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >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< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
upperBound(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
Value typedefSawyer::Container::AddressMap< A, T >
ValueIterator typedefSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >
values()Sawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >inline
values() constSawyer::Container::IntervalMap< Interval< A >, AddressSegment< A, T >, AddressMapImpl::SegmentMergePolicy< A, T > >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