Struct MemoryReport 

pub struct MemoryReport {

    pub live_node_count: usize,
    pub live_relationship_count: usize,
    pub node_tombstone_count: usize,
    pub relationship_tombstone_count: usize,
    pub nodes_bytes: usize,
    pub relationships_bytes: usize,
    pub outgoing_bytes: usize,
    pub incoming_bytes: usize,
    pub label_index_bytes: usize,
    pub type_index_bytes: usize,
    pub property_index_bytes: usize,
    pub sorted_index_bytes: usize,
    pub text_index_bytes: usize,
    pub point_index_bytes: usize,
    pub fulltext_index_bytes: usize,
    pub vector_index_bytes: usize,
    pub index_catalog_bytes: usize,
    pub constraint_catalog_bytes: usize,
}

Aggregated retained-heap breakdown of an [InMemoryGraph].

All fields are in bytes. usize was chosen over u64 so call sites can use cargo bench reports and pretty-print without casts; on 32-bit hosts a graph that overflowed this would already have failed earlier.

Fields

live_node_count: usize

live_relationship_count: usize

node_tombstone_count: usize

relationship_tombstone_count: usize

nodes_bytes: usize

nodes: Vec<Option<Arc<NodeRecord>>> — slot vector plus the Arc headers plus deep payload of each live record (labels, properties — see property_value_heap_bytes).

relationships_bytes: usize

relationships: Vec<Option<Arc<RelationshipRecord>>>.

outgoing_bytes: usize

outgoing: Vec<Vec<RelationshipId>> — outer Vec capacity plus the sum of each inner Vec’s capacity in bytes.

incoming_bytes: usize

Same for incoming.

label_index_bytes: usize

nodes_by_label: BTreeMap<String, ChunkedVec<NodeId>>.

type_index_bytes: usize

relationships_by_type: BTreeMap<String, ChunkedVec<RelationshipId>>.

property_index_bytes: usize

Hash-bucket property registry (find_*_by_property).

sorted_index_bytes: usize

Sorted-range property index (RANGE catalog entries).

text_index_bytes: usize

Trigram TEXT indexes.

point_index_bytes: usize

Spatial grid POINT indexes.

fulltext_index_bytes: usize

FULLTEXT inverted indexes.

vector_index_bytes: usize

VECTOR indexes (Flat and HNSW backends).

index_catalog_bytes: usize

constraint_catalog_bytes: usize

Implementations

impl MemoryReport

pub fn graph_core_bytes(&self) -> usize

Bytes attributable to the core graph shape: slabs, adjacency, and the label/type indexes. This is the floor every workload pays regardless of which secondary indexes are installed.

pub fn secondary_index_bytes(&self) -> usize

Bytes attributable to secondary indexes — the amount that would be reclaimed by dropping every index.

pub fn catalog_bytes(&self) -> usize

pub fn total_bytes(&self) -> usize

pub fn bytes_per_live_node(&self) -> f64

Average retained bytes per live node, including its share of the slab tombstone overhead. Returns 0 when there are no nodes.

pub fn bytes_per_live_relationship(&self) -> f64

pub fn summary(&self) -> String

One-line breakdown for bench / probe output. Stable enough for grep-friendly snapshot diffs across runs.

Trait Implementations

impl Clone for MemoryReport

fn clone(&self) -> MemoryReport

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for MemoryReport

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Default for MemoryReport

fn default() -> MemoryReport

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for MemoryReport

fn deserialize<__D>( __deserializer: __D, ) -> Result<MemoryReport, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for MemoryReport

fn eq(&self, other: &MemoryReport) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for MemoryReport

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for MemoryReport