#include <sql_bitmap.h>
◆ anonymous enum
◆ Bitmap() [1/2]
◆ Bitmap() [2/2]
◆ bits_set()
uint Bitmap< 64 >::bits_set |
( |
| ) |
const |
|
inline |
◆ clear_all()
void Bitmap< 64 >::clear_all |
( |
| ) |
|
|
inline |
◆ clear_bit()
void Bitmap< 64 >::clear_bit |
( |
uint |
n | ) |
|
|
inline |
◆ get_first_set()
uint Bitmap< 64 >::get_first_set |
( |
| ) |
const |
|
inline |
◆ get_next_set()
uint Bitmap< 64 >::get_next_set |
( |
uint |
bit_no | ) |
const |
|
inline |
Find the next set bit after 'bit_no'.
- Parameters
-
bit_no | Start search at bit_no+1. |
- Returns
- index of next set bit, or MY_BIT_NONE.
◆ init() [1/2]
void Bitmap< 64 >::init |
( |
void |
| ) |
|
|
inline |
◆ init() [2/2]
void Bitmap< 64 >::init |
( |
uint |
prefix_to_set | ) |
|
|
inline |
◆ intersect() [1/2]
◆ intersect() [2/2]
◆ intersect_extended()
◆ is_clear_all()
bool Bitmap< 64 >::is_clear_all |
( |
| ) |
const |
|
inline |
◆ is_overlapping()
bool Bitmap< 64 >::is_overlapping |
( |
const Bitmap< 64 > & |
map2 | ) |
const |
|
inline |
◆ is_prefix()
bool Bitmap< 64 >::is_prefix |
( |
uint |
n | ) |
const |
|
inline |
◆ is_set()
bool Bitmap< 64 >::is_set |
( |
uint |
n | ) |
const |
|
inline |
◆ is_set_all()
bool Bitmap< 64 >::is_set_all |
( |
| ) |
const |
|
inline |
◆ is_subset()
bool Bitmap< 64 >::is_subset |
( |
const Bitmap< 64 > & |
map2 | ) |
const |
|
inline |
◆ length()
uint Bitmap< 64 >::length |
( |
| ) |
const |
|
inline |
◆ merge()
◆ operator!=()
◆ operator==()
bool Bitmap< 64 >::operator== |
( |
const Bitmap< 64 > & |
map2 | ) |
const |
|
inline |
◆ print()
char * Bitmap< 64 >::print |
( |
char * |
buf | ) |
const |
|
inline |
◆ set_all()
void Bitmap< 64 >::set_all |
( |
| ) |
|
|
inline |
◆ set_bit()
void Bitmap< 64 >::set_bit |
( |
uint |
n | ) |
|
|
inline |
◆ set_prefix()
void Bitmap< 64 >::set_prefix |
( |
uint |
n | ) |
|
|
inline |
◆ subtract()
◆ to_ulonglong()
◆ map
The documentation for this class was generated from the following file: