LLVM: llvm::IntervalMapImpl::NodeSizer< KeyT, ValT > Struct Template Reference (original) (raw)
#include "[llvm/ADT/IntervalMap.h](IntervalMap%5F8h%5Fsource.html)"
| Public Types | |
|---|---|
| enum | { DesiredLeafSize, MinLeafSize = 3 } |
| enum | { AllocBytes = (sizeof(LeafBase) + CacheLineBytes-1) & ~(CacheLineBytes-1) , BranchSize } |
| using | LeafBase = NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> |
| using | Allocator |
| Allocator - The recycling allocator used for both branch and leaf nodes. |
template<typename KeyT, typename ValT>
struct llvm::IntervalMapImpl::NodeSizer< KeyT, ValT >
Definition at line 440 of file IntervalMap.h.
◆ Allocator
Initial value:
RecyclingAllocator - This class wraps an Allocator, adding the functionality of recycling deleted obj...
Allocator - The recycling allocator used for both branch and leaf nodes.
This typedef is very likely to be identical for all IntervalMaps with reasonably sized entries, so the same allocator can be shared among different kinds of maps.
Definition at line 469 of file IntervalMap.h.
◆ LeafBase
◆ anonymous enum
◆ anonymous enum
| Enumerator |
|---|
| DesiredLeafSize |
| MinLeafSize |
Definition at line 441 of file IntervalMap.h.
The documentation for this struct was generated from the following file:
- include/llvm/ADT/IntervalMap.h