Public Types |
typedef std::set< Segment< T,
Compare >, SegmentCompare< T,
Compare > >::key_type | key_type |
| key type is same as Container 's key_type .
|
typedef std::set< Segment< T,
Compare >, SegmentCompare< T,
Compare > >::value_type | value_type |
| value type is same as Container 's value_type .
|
typedef key_type::value_type | element_type |
| element type is same as key_type 's value_type.
|
typedef std::set< Segment< T,
Compare >, SegmentCompare< T,
Compare > >::key_compare | key_compare |
| key compare
|
typedef std::set< Segment< T,
Compare >, SegmentCompare< T,
Compare > >::value_compare | value_compare |
| value compare
|
typedef Compare | element_compare |
| element compare
|
typedef std::set< Segment< T,
Compare >, SegmentCompare< T,
Compare > >::pointer | pointer |
| pointer
|
typedef std::set< Segment< T,
Compare >, SegmentCompare< T,
Compare > >::reference | reference |
| reference
|
typedef std::set< Segment< T,
Compare >, SegmentCompare< T,
Compare > >::const_reference | const_reference |
| const reference
|
typedef std::set< Segment< T,
Compare >, SegmentCompare< T,
Compare > >::size_type | size_type |
| size_type
|
typedef std::set< Segment< T,
Compare >, SegmentCompare< T,
Compare > >::difference_type | difference_type |
| difference_type
|
typedef std::set< Segment< T,
Compare >, SegmentCompare< T,
Compare > >::iterator | iterator |
| iterator
|
typedef std::set< Segment< T,
Compare >, SegmentCompare< T,
Compare > >::const_iterator | const_iterator |
| const_iterator
|
Public Member Functions |
| SegmentSet (void) |
| creates a set with no segments
|
me::const_iterator | insert_merge (const typename me::value_type &segment) |
const_iterator | begin (void) const |
iterator | begin (void) |
void | clear (void) |
| erases all values
|
size_type | count (const element_type &element) const |
bool | empty (void) const |
const_iterator | end (void) const |
iterator | end (void) |
void | erase (iterator first, iterator last) |
| erase values in range [first, last)
|
void | erase (iterator pos) |
iterator | find (const element_type &element) |
const_iterator | find (const element_type &vt) const |
std::pair< iterator, bool > | insert (const value_type &value) |
| insert value
|
key_compare | key_comp (void) const |
iterator | lower_bound (const element_type &element) |
| similar to lower_bound in std::set and std::map
|
const_iterator | lower_bound (const element_type &element) const |
| similar to lower_bound in std::set and std::map
|
size_type | size (void) const |
iterator | upper_bound (const element_type &element) |
const_iterator | upper_bound (const element_type &element) const |
| similar to upper_bound in std::set and std::map
|
value_compare | value_comp (void) const |
| similar to upper_bound in std::set and std::map
|
Protected Member Functions |
std::pair< iterator, iterator > | overlap_range (const key_type &segment) |
Protected Attributes |
std::set< Segment< T, Compare >
, SegmentCompare< T, Compare > > | container_ |
| underlying container
|
template<typename T, class Compare = std::less<T>>
class theplu::yat::utility::SegmentSet< T, Compare >
a set of Segments
A container that holds a set of Segment. The Segments cannot overlap.
- Since:
- new in yat 0.7