llvm::IntervalMapImpl::NodeSizer< KeyT, ValT > Struct Template Reference

#include <IntervalMap.h>

Public Types
enum	{ DesiredLeafSize, MinLeafSize = 3 }
enum	{ AllocBytes = (sizeof(LeafBase) + CacheLineBytes-1) & ~(CacheLineBytes-1), BranchSize }
typedef NodeBase< std::pair < KeyT, KeyT >, ValT, LeafSize >	LeafBase
typedef RecyclingAllocator < BumpPtrAllocator, char, AllocBytes, CacheLineBytes >	Allocator

Detailed Description

template<typename KeyT, typename ValT>
struct llvm::IntervalMapImpl::NodeSizer< KeyT, ValT >

Definition at line 430 of file IntervalMap.h.

Member Typedef Documentation

template<typename KeyT , typename ValT >

typedef RecyclingAllocator<BumpPtrAllocator, char, AllocBytes, CacheLineBytes> llvm::IntervalMapImpl::NodeSizer< KeyT, ValT >::Allocator

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 460 of file IntervalMap.h.

template<typename KeyT , typename ValT >

typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> llvm::IntervalMapImpl::NodeSizer< KeyT, ValT >::LeafBase

Definition at line 443 of file IntervalMap.h.

Member Enumeration Documentation

template<typename KeyT , typename ValT >

anonymous enum

Enumerator
DesiredLeafSize
MinLeafSize

Definition at line 431 of file IntervalMap.h.

template<typename KeyT , typename ValT >

anonymous enum

Enumerator
AllocBytes
BranchSize

Definition at line 445 of file IntervalMap.h.

---

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

• IntervalMap.h