![]() |
QuickRank
v2.0
QuickRank: A C++ suite of Learning to Rank algorithms
|
#include "utils/bitarray.h"Macros | |
| #define | DIV32(i) ((i)>>5) |
| integer division of i by 32 by means of the bit-wise SHIFT operator More... | |
| #define | MUL32(i) ((i)<<5) |
| multiply i by 32 by means of the bit-wise SHIFT operator More... | |
| #define | MOD32(i) ((i)&0x1F) |
| return i mod 32 by means of the bit-wise AND operator More... | |
Functions | |
| int32_t | bitcounter (int32_t n) |
| #define DIV32 | ( | i | ) | ((i)>>5) |
integer division of i by 32 by means of the bit-wise SHIFT operator
| #define MOD32 | ( | i | ) | ((i)&0x1F) |
return i mod 32 by means of the bit-wise AND operator
| #define MUL32 | ( | i | ) | ((i)<<5) |
multiply i by 32 by means of the bit-wise SHIFT operator
|
inline |
return the number of set bit in a 32bits value
| n | input value |
1.8.11