boost::itl::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::itl::bit_element_iterator < const_iterator >	element_const_iterator
	element const iterator: Depreciated, see documentation.
typedef boost::itl::bit_element_iterator < const_reverse_iterator >	element_const_reverse_iterator
	element const reverse iterator: Depreciated, see documentation.
typedef boost::itl::bit_element_iterator < iterator >	element_iterator
	element iterator: Depreciated, see documentation.
typedef boost::itl::bit_element_iterator < reverse_iterator >	element_reverse_iterator
	element reverse iterator: Depreciated, see documentation.

---

Detailed Description

template<typename DomainT = unsigned long, typename BitSetT = itl::bits<unsigned long>, ITL_COMPARE Compare = ITL_COMPARE_INSTANCE(std::less, DomainT), template< class, ITL_COMPARE >class Interval = boost::itl::interval, ITL_ALLOC Alloc = std::allocator>
class boost::itl::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 itl::interval_set or itl::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 itl::interval_map in the project section of the boost book documentation here: http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/projects.html

---

Member Typedef Documentation

template<typename DomainT = unsigned long, typename BitSetT = itl::bits<unsigned long>, ITL_COMPARE Compare = ITL_COMPARE_INSTANCE(std::less, DomainT), template< class, ITL_COMPARE >class Interval = boost::itl::interval, ITL_ALLOC Alloc = std::allocator>

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

element iterator: Depreciated, see documentation.

template<typename DomainT = unsigned long, typename BitSetT = itl::bits<unsigned long>, ITL_COMPARE Compare = ITL_COMPARE_INSTANCE(std::less, DomainT), template< class, ITL_COMPARE >class Interval = boost::itl::interval, ITL_ALLOC Alloc = std::allocator>

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

element const iterator: Depreciated, see documentation.

template<typename DomainT = unsigned long, typename BitSetT = itl::bits<unsigned long>, ITL_COMPARE Compare = ITL_COMPARE_INSTANCE(std::less, DomainT), template< class, ITL_COMPARE >class Interval = boost::itl::interval, ITL_ALLOC Alloc = std::allocator>

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

element reverse iterator: Depreciated, see documentation.

template<typename DomainT = unsigned long, typename BitSetT = itl::bits<unsigned long>, ITL_COMPARE Compare = ITL_COMPARE_INSTANCE(std::less, DomainT), template< class, ITL_COMPARE >class Interval = boost::itl::interval, ITL_ALLOC Alloc = std::allocator>

typedef boost::itl::bit_element_iterator<const_reverse_iterator> boost::itl::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/itl_xt/interval_bitset.hpp