v8
V8 is Google’s open source high-performance JavaScript and WebAssembly engine, written in C++.
Loading...
Searching...
No Matches
v8::internal::swiss_table::BitMask< T, SignificantBits, Shift > Class Template Reference

#include <swiss-hash-table-helpers.h>

Collaboration diagram for v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >:

Public Types

using value_type = int
 
using iterator = BitMask
 
using const_iterator = BitMask
 

Public Member Functions

 BitMask (T mask)
 
BitMaskoperator++ ()
 
 operator bool () const
 
int operator* () const
 
int LowestBitSet () const
 
int HighestBitSet () const
 
BitMask begin () const
 
BitMask end () const
 
int TrailingZeros () const
 
int LeadingZeros () const
 

Private Attributes

T mask_
 

Friends

bool operator== (const BitMask &a, const BitMask &b)
 
bool operator!= (const BitMask &a, const BitMask &b)
 

Detailed Description

template<class T, int SignificantBits, int Shift = 0>
class v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >

Definition at line 122 of file swiss-hash-table-helpers.h.

Member Typedef Documentation

◆ const_iterator

template<class T , int SignificantBits, int Shift = 0>
using v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::const_iterator = BitMask

Definition at line 130 of file swiss-hash-table-helpers.h.

◆ iterator

template<class T , int SignificantBits, int Shift = 0>
using v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::iterator = BitMask

Definition at line 129 of file swiss-hash-table-helpers.h.

◆ value_type

template<class T , int SignificantBits, int Shift = 0>
using v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::value_type = int

Definition at line 128 of file swiss-hash-table-helpers.h.

Constructor & Destructor Documentation

◆ BitMask()

template<class T , int SignificantBits, int Shift = 0>
v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::BitMask ( T mask)
inlineexplicit

Definition at line 132 of file swiss-hash-table-helpers.h.

Here is the caller graph for this function:

Member Function Documentation

◆ begin()

template<class T , int SignificantBits, int Shift = 0>
BitMask v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::begin ( ) const
inline

Definition at line 146 of file swiss-hash-table-helpers.h.

◆ end()

template<class T , int SignificantBits, int Shift = 0>
BitMask v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::end ( ) const
inline

Definition at line 147 of file swiss-hash-table-helpers.h.

Here is the call graph for this function:

◆ HighestBitSet()

template<class T , int SignificantBits, int Shift = 0>
int v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::HighestBitSet ( ) const
inline

Definition at line 141 of file swiss-hash-table-helpers.h.

Here is the call graph for this function:

◆ LeadingZeros()

template<class T , int SignificantBits, int Shift = 0>
int v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::LeadingZeros ( ) const
inline

Definition at line 154 of file swiss-hash-table-helpers.h.

Here is the call graph for this function:

◆ LowestBitSet()

template<class T , int SignificantBits, int Shift = 0>
int v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::LowestBitSet ( ) const
inline

Definition at line 140 of file swiss-hash-table-helpers.h.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ operator bool()

template<class T , int SignificantBits, int Shift = 0>
v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::operator bool ( ) const
inlineexplicit

Definition at line 138 of file swiss-hash-table-helpers.h.

◆ operator*()

template<class T , int SignificantBits, int Shift = 0>
int v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::operator* ( ) const
inline

Definition at line 139 of file swiss-hash-table-helpers.h.

Here is the call graph for this function:

◆ operator++()

template<class T , int SignificantBits, int Shift = 0>
BitMask & v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::operator++ ( )
inline

Definition at line 133 of file swiss-hash-table-helpers.h.

◆ TrailingZeros()

template<class T , int SignificantBits, int Shift = 0>
int v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::TrailingZeros ( ) const
inline

Definition at line 149 of file swiss-hash-table-helpers.h.

Here is the call graph for this function:
Here is the caller graph for this function:

Friends And Related Symbol Documentation

◆ operator!=

template<class T , int SignificantBits, int Shift = 0>
bool operator!= ( const BitMask< T, SignificantBits, Shift > & a,
const BitMask< T, SignificantBits, Shift > & b )
friend

Definition at line 164 of file swiss-hash-table-helpers.h.

◆ operator==

template<class T , int SignificantBits, int Shift = 0>
bool operator== ( const BitMask< T, SignificantBits, Shift > & a,
const BitMask< T, SignificantBits, Shift > & b )
friend

Definition at line 161 of file swiss-hash-table-helpers.h.

Member Data Documentation

◆ mask_

template<class T , int SignificantBits, int Shift = 0>
T v8::internal::swiss_table::BitMask< T, SignificantBits, Shift >::mask_
private

Definition at line 168 of file swiss-hash-table-helpers.h.


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