Requested live tree bytes, excluding heap free lists and RSS. More...

#include <immer_sequence.h>

Public Attributes
std::size_t	blocks = 0
	Number of live leaf allocations, including the tail.

std::size_t	nodes = 0
	Number of live internal nodes.

std::size_t	block_bytes = 0
	Leaf allocation bytes including unused capacity.

std::size_t	node_bytes = 0
	Internal node and relaxed-size-table allocation bytes.

std::size_t	total_bytes = sizeof(ImmerPermutableSequence)
	Facade plus block_bytes plus node_bytes; saturates at SIZE_MAX.

Detailed Description

template<std::copy_constructible T = std::uint64_t, class HeapPolicy = immer::default_heap_policy>
struct pixie::ImmerPermutableSequence< T, HeapPolicy >::MemoryUsage

Requested live tree bytes, excluding heap free lists and RSS.

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

include/pixie/permutations/immer_sequence.h

Public Attributes

Detailed Description