qpid::RangeSet< T > Class Template Reference
A set implemented as a list of [begin, end) ranges. More...
#include <RangeSet.h>
Inheritance diagram for qpid::RangeSet< T >:
Public Types | |
| typedef iterator | const_iterator |
| typedef Ranges::const_iterator | RangeIterator |
Public Member Functions | |
| RangeSet (const Range< T > &r) | |
| RangeSet (const T &a, const T &b) | |
| bool | contiguous () const |
| bool | contains (const T &t) const |
| bool | contains (const Range< T > &) const |
| Range< T > | toRange () const |
| bool | operator== (const RangeSet< T > &) const |
| void | addRange (const Range< T > &) |
| void | addSet (const RangeSet< T > &) |
| RangeSet< T > & | operator+= (const T &t) |
| RangeSet< T > & | operator+= (const Range< T > &r) |
| RangeSet< T > & | operator+= (const RangeSet< T > &s) |
| void | removeRange (const Range< T > &) |
| void | removeSet (const RangeSet< T > &) |
| RangeSet< T > & | operator-= (const T &t) |
| RangeSet< T > & | operator-= (const Range< T > &r) |
| RangeSet< T > & | operator-= (const RangeSet< T > &s) |
| T | front () const |
| T | back () const |
| iterator | begin () const |
| iterator | end () const |
| RangeIterator | rangesBegin () const |
| RangeIterator | rangesEnd () const |
| size_t | rangesSize () const |
| uint32_t | span () const |
| bool | empty () const |
| void | clear () |
| Range< T > | rangeContaining (const T &) const |
| Return the largest contiguous range containing x. | |
| template<class S> | |
| void | serialize (S &s) |
| template<class S> | |
| void | encode (S &s) const |
| template<class S> | |
| void | decode (S &s) |
Friends | |
| template<class U> | |
| std::ostream & | operator<< (std::ostream &o, const RangeSet< U > &r) |
Detailed Description
template<class T>
class qpid::RangeSet< T >
A set implemented as a list of [begin, end) ranges.
T must be LessThanComparable and Incrementable. RangeSet only provides const iterators.
Definition at line 95 of file RangeSet.h.
Member Function Documentation
template<class T>
| Range< T > qpid::RangeSet< T >::toRange | ( | ) | const [inline] |
template<class T>
| Range< T > qpid::RangeSet< T >::rangeContaining | ( | const T & | t | ) | const [inline] |
Return the largest contiguous range containing x.
Returns the empty range [x,x) if x is not in the set.
Definition at line 309 of file RangeSet.h.
The documentation for this class was generated from the following file:
- /home/nsantos/projects/mrg-team/testing/magnum/f10/qpidc/qpid/cpp/src/qpid/RangeSet.h
