boost::icl::interval_bitset< DomainT, BitSetT, Compare, Interval, Alloc > Class Template Reference

Large bitsets that combine interval compression and bitcompression. More...

List of all members.

Public Types
typedef boost::icl::bit_element_iterator < const_iterator >	element_const_iterator
	element const iterator: Depreciated, see documentation.
typedef boost::icl::bit_element_iterator < const_reverse_iterator >	element_const_reverse_iterator
	element const reverse iterator: Depreciated, see documentation.
typedef boost::icl::bit_element_iterator < iterator >	element_iterator
	element iterator: Depreciated, see documentation.
typedef boost::icl::bit_element_iterator < reverse_iterator >	element_reverse_iterator
	element reverse iterator: Depreciated, see documentation.

---

Detailed Description

template<typename DomainT = unsigned long, typename BitSetT = icl::bits<unsigned long>, ICL_COMPARE Compare = ICL_COMPARE_INSTANCE(std::less, DomainT), ICL_INTERVAL(ICL_COMPARE) Interval = ICL_INTERVAL_INSTANCE(ICL_INTERVAL_DEFAULT, DomainT, Compare), ICL_ALLOC Alloc = std::allocator>
class boost::icl::interval_bitset< DomainT, BitSetT, Compare, Interval, Alloc >

Large bitsets that combine interval compression and bitcompression.

Class interval_bitset implements a set as an interval_map of bitsets. An interval_bitset is selfcompressing in two ways. Large contiguous runs of bits can be represented by intervals in the same way as for icl::interval_set or icl::interval_map (interval compression). Individual bits that spread over narrow ranges are represented in machine words as bitsets (bit compression).

There is a datailed description on how an interval_bitset is implemented using icl::interval_map in the project section of the boost book documentation here: http://www.joachim-faulhaber.de/boost_itl/doc/libs/icl/doc/html/boost_itl/projects.html

---

Member Typedef Documentation

template<typename DomainT = unsigned long, typename BitSetT = icl::bits<unsigned long>, ICL_COMPARE Compare = ICL_COMPARE_INSTANCE(std::less, DomainT), ICL_INTERVAL(ICL_COMPARE) Interval = ICL_INTERVAL_INSTANCE(ICL_INTERVAL_DEFAULT, DomainT, Compare), ICL_ALLOC Alloc = std::allocator>

typedef boost::icl::bit_element_iterator<iterator> boost::icl::interval_bitset< DomainT, BitSetT, Compare, Interval, Alloc >::element_iterator

element iterator: Depreciated, see documentation.

template<typename DomainT = unsigned long, typename BitSetT = icl::bits<unsigned long>, ICL_COMPARE Compare = ICL_COMPARE_INSTANCE(std::less, DomainT), ICL_INTERVAL(ICL_COMPARE) Interval = ICL_INTERVAL_INSTANCE(ICL_INTERVAL_DEFAULT, DomainT, Compare), ICL_ALLOC Alloc = std::allocator>

typedef boost::icl::bit_element_iterator<const_iterator> boost::icl::interval_bitset< DomainT, BitSetT, Compare, Interval, Alloc >::element_const_iterator

element const iterator: Depreciated, see documentation.

template<typename DomainT = unsigned long, typename BitSetT = icl::bits<unsigned long>, ICL_COMPARE Compare = ICL_COMPARE_INSTANCE(std::less, DomainT), ICL_INTERVAL(ICL_COMPARE) Interval = ICL_INTERVAL_INSTANCE(ICL_INTERVAL_DEFAULT, DomainT, Compare), ICL_ALLOC Alloc = std::allocator>

typedef boost::icl::bit_element_iterator<reverse_iterator> boost::icl::interval_bitset< DomainT, BitSetT, Compare, Interval, Alloc >::element_reverse_iterator

element reverse iterator: Depreciated, see documentation.

template<typename DomainT = unsigned long, typename BitSetT = icl::bits<unsigned long>, ICL_COMPARE Compare = ICL_COMPARE_INSTANCE(std::less, DomainT), ICL_INTERVAL(ICL_COMPARE) Interval = ICL_INTERVAL_INSTANCE(ICL_INTERVAL_DEFAULT, DomainT, Compare), ICL_ALLOC Alloc = std::allocator>

typedef boost::icl::bit_element_iterator<const_reverse_iterator> boost::icl::interval_bitset< DomainT, BitSetT, Compare, Interval, Alloc >::element_const_reverse_iterator

element const reverse iterator: Depreciated, see documentation.

---

The documentation for this class was generated from the following file:

• boost/icl_xt/interval_bitset.hpp