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

#include "llvm/ADT/IntervalMap.h"

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 = RecyclingAllocator< BumpPtrAllocator, char, AllocBytes, CacheLineBytes >
	Allocator - The recycling allocator used for both branch and leaf nodes. More...

Detailed Description

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

Definition at line 437 of file IntervalMap.h.

Member Typedef Documentation

Allocator

template<typename KeyT, typename ValT>

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

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

LeafBase

template<typename KeyT, typename ValT>

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

Definition at line 450 of file IntervalMap.h.

Member Enumeration Documentation

anonymous enum

template<typename KeyT, typename ValT>

anonymous enum

Enumerator
DesiredLeafSize
MinLeafSize

Definition at line 438 of file IntervalMap.h.

anonymous enum

template<typename KeyT, typename ValT>

anonymous enum

Enumerator
AllocBytes
BranchSize

Definition at line 452 of file IntervalMap.h.

---

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

• include/llvm/ADT/IntervalMap.h