Implements a set as a set of intervals - leaving adjoining intervals separate.
More...
|
enum | { fineness = 2
} |
|
typedef separate_interval_set
< DomainT, Compare, Interval,
Alloc > | type |
|
typedef interval_base_set
< type, DomainT, Compare,
Interval, Alloc > | base_type |
|
typedef type | overloadable_type |
|
typedef type | key_object_type |
|
typedef interval_set< DomainT,
Compare, Interval, Alloc > | joint_type |
|
typedef DomainT | domain_type |
| The domain type of the set. More...
|
|
typedef DomainT | codomain_type |
| The codomaintype is the same as domain_type. More...
|
|
typedef DomainT | element_type |
| The element type of the set. More...
|
|
typedef interval_type | segment_type |
| The segment type of the set. More...
|
|
typedef exclusive_less_than
< interval_type > | interval_compare |
| Comparison functor for intervals. More...
|
|
typedef exclusive_less_than
< interval_type > | key_compare |
| Comparison functor for keys. More...
|
|
typedef Alloc< interval_type > | allocator_type |
| The allocator type of the set. More...
|
|
typedef Alloc< DomainT > | domain_allocator_type |
| allocator type of the corresponding element set More...
|
|
typedef base_type::atomized_type | atomized_type |
| The corresponding atomized type representing this interval container of elements. More...
|
|
typedef base_type::ImplSetT | ImplSetT |
| Container type for the implementation. More...
|
|
typedef ImplSetT::key_type | key_type |
| key type of the implementing container More...
|
|
typedef ImplSetT::value_type | data_type |
| data type of the implementing container More...
|
|
typedef ImplSetT::value_type | value_type |
| value type of the implementing container More...
|
|
typedef ImplSetT::iterator | iterator |
| iterator for iteration over intervals More...
|
|
typedef ImplSetT::const_iterator | const_iterator |
| const_iterator for iteration over intervals More...
|
|
typedef separate_interval_set
< DomainT, Compare, Interval,
Alloc > | sub_type |
| The designated derived or sub_type of this base class. More...
|
|
typedef difference_type_of
< domain_type >::type | difference_type |
| The difference type of an interval which is sometimes different form the data_type. More...
|
|
typedef size_type_of
< domain_type >::type | size_type |
| The size type of an interval which is mostly std::size_t. More...
|
|
typedef ImplSetT::pointer | pointer |
| pointer type More...
|
|
typedef ImplSetT::const_pointer | const_pointer |
| const pointer type More...
|
|
typedef ImplSetT::reference | reference |
| reference type More...
|
|
typedef ImplSetT::const_reference | const_reference |
| const reference type More...
|
|
typedef ImplSetT::reverse_iterator | reverse_iterator |
| iterator for reverse iteration over intervals More...
|
|
typedef
ImplSetT::const_reverse_iterator | const_reverse_iterator |
| const_iterator for iteration over intervals More...
|
|
typedef
boost::icl::element_iterator
< iterator > | element_iterator |
| element iterator: Depreciated, see documentation. More...
|
|
typedef
boost::icl::element_iterator
< const_iterator > | element_const_iterator |
| element const iterator: Depreciated, see documentation. More...
|
|
typedef
boost::icl::element_iterator
< reverse_iterator > | element_reverse_iterator |
| element reverse iterator: Depreciated, see documentation. More...
|
|
typedef
boost::icl::element_iterator
< const_reverse_iterator > | element_const_reverse_iterator |
| element const reverse iterator: Depreciated, see documentation. More...
|
|
|
typedef | ICL_INTERVAL_TYPE (Interval, DomainT, Compare) interval_type |
| The interval type of the set. More...
|
|
typedef | ICL_COMPARE_DOMAIN (Compare, DomainT) domain_compare |
| Comparison functor for domain values. More...
|
|
| separate_interval_set () |
| Default constructor for the empty object. More...
|
|
| separate_interval_set (const separate_interval_set &src) |
| Copy constructor. More...
|
|
template<class SubType > |
| separate_interval_set (const interval_base_set< SubType, DomainT, Compare, Interval, Alloc > &src) |
| Copy constructor for base_type. More...
|
|
| separate_interval_set (const domain_type &elem) |
| Constructor for a single element. More...
|
|
| separate_interval_set (const interval_type &itv) |
| Constructor for a single interval. More...
|
|
template<class SubType > |
void | assign (const interval_base_set< SubType, DomainT, Compare, Interval, Alloc > &src) |
| Assignment from a base interval_set. More...
|
|
template<class SubType > |
separate_interval_set & | operator= (const interval_base_set< SubType, DomainT, Compare, Interval, Alloc > &src) |
| Assignment operator for base type. More...
|
|
| separate_interval_set (separate_interval_set &&src) |
| Move constructor. More...
|
|
separate_interval_set & | operator= (separate_interval_set src) |
| Move assignment operator. More...
|
|
typedef | ICL_COMPARE_DOMAIN (Compare, segment_type) segment_compare |
|
| BOOST_STATIC_CONSTANT (int, fineness=0) |
|
void | swap (interval_base_set &operand) |
| swap the content of containers More...
|
|
void | clear () |
| sets the container empty More...
|
|
bool | empty () const |
| is the container empty? More...
|
|
size_type | size () const |
| An interval set's size is it's cardinality. More...
|
|
std::size_t | iterative_size () const |
| Size of the iteration over this container. More...
|
|
const_iterator | find (const element_type &key_value) const |
| Find the interval, that contains element key_value . More...
|
|
const_iterator | find (const interval_type &key_interval) const |
| Find the first interval, that collides with interval key_interval . More...
|
|
separate_interval_set< DomainT,
Compare, Interval, Alloc > & | add (const element_type &key) |
| Add a single element key to the set. More...
|
|
separate_interval_set< DomainT,
Compare, Interval, Alloc > & | add (const segment_type &inter_val) |
| Add an interval of elements inter_val to the set. More...
|
|
iterator | add (iterator prior_, const segment_type &inter_val) |
| Add an interval of elements inter_val to the set. More...
|
|
separate_interval_set< DomainT,
Compare, Interval, Alloc > & | subtract (const element_type &key) |
| Subtract a single element key from the set. More...
|
|
separate_interval_set< DomainT,
Compare, Interval, Alloc > & | subtract (const segment_type &inter_val) |
| Subtract an interval of elements inter_val from the set. More...
|
|
separate_interval_set< DomainT,
Compare, Interval, Alloc > & | insert (const element_type &key) |
| Insert an element key into the set. More...
|
|
separate_interval_set< DomainT,
Compare, Interval, Alloc > & | insert (const segment_type &inter_val) |
| Insert an interval of elements inter_val to the set. More...
|
|
iterator | insert (iterator prior_, const segment_type &inter_val) |
| Insert an interval of elements inter_val to the set. More...
|
|
separate_interval_set< DomainT,
Compare, Interval, Alloc > & | erase (const element_type &key) |
| Erase an element key from the set. More...
|
|
separate_interval_set< DomainT,
Compare, Interval, Alloc > & | erase (const segment_type &inter_val) |
| Erase an interval of elements inter_val from the set. More...
|
|
void | erase (iterator position) |
| Erase the interval that iterator position points to. More...
|
|
void | erase (iterator first, iterator past) |
| Erase all intervals in the range [first,past) of iterators. More...
|
|
separate_interval_set< DomainT,
Compare, Interval, Alloc > & | flip (const element_type &key) |
| If *this set contains key it is erased, otherwise it is added. More...
|
|
separate_interval_set< DomainT,
Compare, Interval, Alloc > & | flip (const segment_type &inter_val) |
| If *this set contains inter_val it is erased, otherwise it is added. More...
|
|
iterator | begin () |
|
const_iterator | begin () const |
|
iterator | end () |
|
const_iterator | end () const |
|
reverse_iterator | rbegin () |
|
const_reverse_iterator | rbegin () const |
|
reverse_iterator | rend () |
|
const_reverse_iterator | rend () const |
|
iterator | lower_bound (const value_type &interval) |
|
const_iterator | lower_bound (const value_type &interval) const |
|
iterator | upper_bound (const value_type &interval) |
|
const_iterator | upper_bound (const value_type &interval) const |
|
std::pair< iterator, iterator > | equal_range (const key_type &interval) |
|
std::pair< const_iterator,
const_iterator > | equal_range (const key_type &interval) const |
|
template<typename DomainT, ICL_COMPARE Compare = ICL_COMPARE_INSTANCE(ICL_COMPARE_DEFAULT, DomainT), ICL_INTERVAL(ICL_COMPARE) Interval = ICL_INTERVAL_INSTANCE(ICL_INTERVAL_DEFAULT, DomainT, Compare), ICL_ALLOC Alloc = std::allocator>
class boost::icl::separate_interval_set< DomainT, Compare, Interval, Alloc >
Implements a set as a set of intervals - leaving adjoining intervals separate.