dart::BitSet< N > Class Template Reference

#include <bit_set.h>

Public Member Functions
	BitSet ()
void	Set (intptr_t i, bool value)
bool	Test (intptr_t i) const
intptr_t	Next (intptr_t i) const
intptr_t	Last () const
intptr_t	ClearLastAndFindPrevious (intptr_t current_last)
void	Reset ()
intptr_t	Size () const

Detailed Description

template<intptr_t N>
class dart::BitSet< N >

Definition at line 16 of file bit_set.h.

Constructor & Destructor Documentation

BitSet()

template<intptr_t N>

dart::BitSet< N >::BitSet ( )

inline

Definition at line 18 of file bit_set.h.

{ Reset(); }

Member Function Documentation

ClearLastAndFindPrevious()

template<intptr_t N>

intptr_t dart::BitSet< N >::ClearLastAndFindPrevious ( intptr_t  current_last )

inline

Definition at line 67 of file bit_set.h.

                                                           {
    ASSERT(Test(current_last));
    ASSERT(Last() == current_last);
    intptr_t w = current_last >> kBitsPerWordLog2;
    uword bits = data_[w];
    // Clear the current last.
    bits ^= (static_cast<uword>(1) << (current_last & (kBitsPerWord - 1)));
    data_[w] = bits;
    // Search backwards for a non-zero word.
    while (bits == 0 && w > 0) {
      bits = data_[--w];
    }
    if (bits == 0) {
      // None found.
      return -1;
    } else {
      // Bitlength incl. w, minus leading zeroes of w, minus 1 to 0-based index.
      return ((w + 1) << kBitsPerWordLog2) -
             Utils::CountLeadingZerosWord(bits) - 1;
    }
  }

Last()

template<intptr_t N>

intptr_t dart::BitSet< N >::Last ( ) const

inline

Definition at line 56 of file bit_set.h.

                        {
    for (int w = kLengthInWords - 1; w >= 0; --w) {
      uword d = data_[w];
      if (d != 0) {
        return ((w + 1) << kBitsPerWordLog2) - Utils::CountLeadingZerosWord(d) -
               1;
      }
    }
    return -1;
  }

Next()

template<intptr_t N>

intptr_t dart::BitSet< N >::Next ( intptr_t  i ) const

inline

Definition at line 38 of file bit_set.h.

                                  {
    ASSERT(i >= 0);
    ASSERT(i < N);
    intptr_t w = i >> kBitsPerWordLog2;
    uword mask = ~static_cast<uword>(0) << (i & (kBitsPerWord - 1));
    if ((data_[w] & mask) != 0) {
      uword tz = Utils::CountTrailingZerosWord(data_[w] & mask);
      return (w << kBitsPerWordLog2) + tz;
    }
    while (++w < kLengthInWords) {
      if (data_[w] != 0) {
        return (w << kBitsPerWordLog2) +
               Utils::CountTrailingZerosWord(data_[w]);
      }
    }
    return -1;
  }

Reset()

template<intptr_t N>

void dart::BitSet< N >::Reset ( )

inline

Definition at line 89 of file bit_set.h.

{ memset(data_, 0, sizeof(data_)); }

Set()

template<intptr_t N>

void dart::BitSet< N >::Set ( intptr_t  i, bool  value  )

inline

Definition at line 20 of file bit_set.h.

                                   {
    ASSERT(i >= 0);
    ASSERT(i < N);
    uword mask = (static_cast<uword>(1) << (i & (kBitsPerWord - 1)));
    if (value) {
      data_[i >> kBitsPerWordLog2] |= mask;
    } else {
      data_[i >> kBitsPerWordLog2] &= ~mask;
    }
  }

Size()

template<intptr_t N>

intptr_t dart::BitSet< N >::Size ( ) const

inline

Definition at line 91 of file bit_set.h.

{ return N; }

Test()

template<intptr_t N>

bool dart::BitSet< N >::Test ( intptr_t  i ) const

inline

Definition at line 31 of file bit_set.h.

                              {
    ASSERT(i >= 0);
    ASSERT(i < N);
    uword mask = (static_cast<uword>(1) << (i & (kBitsPerWord - 1)));
    return (data_[i >> kBitsPerWordLog2] & mask) != 0;
  }

---

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

• third_party/dart-lang/sdk/runtime/vm/bit_set.h