#include <openvdb/tree/LeafBuffer.h>
|
| static const Index | WORD_COUNT = NodeMaskType::WORD_COUNT |
| static const Index | SIZE = 1 << 3 * Log2Dim |
| static const bool | sOn = true |
| static const bool | sOff = false |
◆ NodeMaskType
◆ StorageType
◆ ValueType
◆ WordType
◆ LeafBuffer() [1/4]
◆ LeafBuffer() [2/4]
◆ LeafBuffer() [3/4]
◆ LeafBuffer() [4/4]
◆ ~LeafBuffer()
◆ allocate()
Allocate memory for this buffer if it has not already been allocated.
◆ data() [1/2]
Return a pointer to the C-style array of words encoding the bits.
- Warning
- This method should only be used by experts seeking low-level optimizations.
◆ data() [2/2]
Return a const pointer to the C-style array of words encoding the bits.
- Warning
- This method should only be used by experts seeking low-level optimizations.
◆ empty()
Return true if memory for this buffer has not yet been allocated.
◆ fill()
◆ getValue()
| const bool & getValue |
( |
Index | i | ) |
const |
|
inline |
◆ isOutOfCore()
| bool isOutOfCore |
( |
| ) |
const |
|
inline |
Return true if this buffer's values have not yet been read from disk.
◆ memUsage()
◆ memUsageIfLoaded()
| Index memUsageIfLoaded |
( |
| ) |
const |
|
inline |
◆ operator!=()
| bool operator!= |
( |
const LeafBuffer< bool, Log2Dim > & | other | ) |
const |
|
inline |
◆ operator=()
◆ operator==()
| bool operator== |
( |
const LeafBuffer< bool, Log2Dim > & | other | ) |
const |
|
inline |
◆ operator[]()
| const bool & operator[] |
( |
Index | i | ) |
const |
|
inline |
◆ setValue()
| void setValue |
( |
Index | i, |
|
|
bool | val ) |
|
inline |
◆ size()
◆ swap()
◆ ::TestLeaf
◆ LeafNode
template<typename,
Index>
◆ SIZE
| const Index SIZE = 1 << 3 * Log2Dim |
|
static |
◆ sOff
◆ sOn
◆ WORD_COUNT
| const Index WORD_COUNT = NodeMaskType::WORD_COUNT |
|
static |