class CoalescingBitVector::const_iterator

Declaration

class CoalescingBitVector::const_iterator { /* full declaration omitted */ };

Declared at: llvm/include/llvm/ADT/CoalescingBitVector.h:235

Member Variables

private llvm::CoalescingBitVector::UnderlyingIterator MapIterator
private unsigned int OffsetIntoMapIterator = 0
private IndexT CachedStart = type-parameter-0-0()
private IndexT CachedStop = type-parameter-0-0()
private static const unsigned int kIteratorAtTheEndOffset = ~0U

Method Overview

Methods

void advanceTo(IndexT Index)

Description

Advance the iterator to \p Index, if it is contained within the current interval. The public-facing method which supports advancing past the current interval is \ref advanceToLowerBound.

Declared at: llvm/include/llvm/ADT/CoalescingBitVector.h:279

Parameters

IndexT Index

void advanceToLowerBound(IndexT Index)

Description

Advance the iterator to the first set bit AT, OR AFTER, \p Index. If no such set bit exists, advance to end(). This is like std::lower_bound. This is useful if \p Index is close to the current iterator position. However, unlike \ref find(), this has worst-case O(n) performance.

Declared at: llvm/include/llvm/ADT/CoalescingBitVector.h:330

Parameters

IndexT Index

const_iterator(
    llvm::CoalescingBitVector::UnderlyingIterator
        MapIt)

Declared at: llvm/include/llvm/ADT/CoalescingBitVector.h:287

Parameters

llvm::CoalescingBitVector::UnderlyingIterator MapIt

const_iterator()

Declared at: llvm/include/llvm/ADT/CoalescingBitVector.h:292

void resetCache()

Description

MapIterator has just changed, reset the cached state to point to the start of the new underlying iterator.

Declared at: llvm/include/llvm/ADT/CoalescingBitVector.h:266

void setToEnd()

Declared at: llvm/include/llvm/ADT/CoalescingBitVector.h:258