LLVM: llvm::CoalescingBitVector< IndexT >::const_iterator Class Reference (original) (raw)
#include "[llvm/ADT/CoalescingBitVector.h](CoalescingBitVector%5F8h%5Fsource.html)"
| Public Types | |
|---|---|
| using | iterator_category = std::forward_iterator_tag |
| using | value_type = IndexT |
| using | difference_type = std::ptrdiff_t |
| using | pointer = value_type * |
| using | reference = value_type & |
| Public Member Functions | |
|---|---|
| const_iterator () | |
| bool | operator== (const const_iterator &RHS) const |
| bool | operator!= (const const_iterator &RHS) const |
| IndexT | operator* () const |
| const_iterator & | operator++ () |
| const_iterator | operator++ (int) |
| void | advanceToLowerBound (IndexT Index) |
| Advance the iterator to the first set bit AT, OR AFTER, Index. |
| Friends | |
|---|---|
| class | CoalescingBitVector |
template
class llvm::CoalescingBitVector< IndexT >::const_iterator
Definition at line 232 of file CoalescingBitVector.h.
◆ difference_type
template
◆ iterator_category
template
◆ pointer
template
template
◆ value_type
template
◆ const_iterator()
template
◆ advanceToLowerBound()
template
Advance the iterator to the first set bit AT, OR AFTER, Index.
If no such set bit exists, advance to end(). This is like std::lower_bound. This is useful if Index is close to the current iterator position. However, unlike find(), this has worst-case O(n) performance.
Definition at line 327 of file CoalescingBitVector.h.
◆ operator!=()
template
◆ operator*()
template
◆ operator++() [1/2]
template
◆ operator++() [2/2]
template
◆ operator==()
template
◆ CoalescingBitVector
template
The documentation for this class was generated from the following file:
- include/llvm/ADT/CoalescingBitVector.h