Trait HeapSize 

pub trait HeapSize {
    // Required method
    fn heap_size(&self) -> usize;
}

Trait for calculating the heap size of an object’s owned data. Arc’s and references are not included in the sum by default. Set CAIRO_HEAPSIZE_COUNT_SHARED=1 to include shared allocations (may double-count).

Required Methods

fn heap_size(&self) -> usize

Returns the size of the heap-allocated, owned data in bytes. It does not include the size of the object itself (stack size), nor references.

Implementations on Foreign Types

impl HeapSize for bool

fn heap_size(&self) -> usize

impl HeapSize for char

fn heap_size(&self) -> usize

impl HeapSize for i8

fn heap_size(&self) -> usize

impl HeapSize for i32

fn heap_size(&self) -> usize

impl HeapSize for i64

fn heap_size(&self) -> usize

impl HeapSize for isize

fn heap_size(&self) -> usize

impl HeapSize for u8

fn heap_size(&self) -> usize

impl HeapSize for u32

fn heap_size(&self) -> usize

impl HeapSize for u64

fn heap_size(&self) -> usize

impl HeapSize for ()

fn heap_size(&self) -> usize

impl HeapSize for usize

fn heap_size(&self) -> usize

impl HeapSize for String

fn heap_size(&self) -> usize

impl HeapSize for PathBuf

fn heap_size(&self) -> usize

impl HeapSize for BigInt

fn heap_size(&self) -> usize

impl HeapSize for BigUint

fn heap_size(&self) -> usize

impl HeapSize for SmolStr

fn heap_size(&self) -> usize

impl<K: HeapSize, V: HeapSize> HeapSize for HashMap<K, V>

fn heap_size(&self) -> usize

impl<T0: HeapSize> HeapSize for (T0,)

fn heap_size(&self) -> usize

impl<T0: HeapSize, T1: HeapSize> HeapSize for (T0, T1)

fn heap_size(&self) -> usize

impl<T0: HeapSize, T1: HeapSize, T2: HeapSize> HeapSize for (T0, T1, T2)

fn heap_size(&self) -> usize

impl<T0: HeapSize, T1: HeapSize, T2: HeapSize, T3: HeapSize> HeapSize for (T0, T1, T2, T3)

fn heap_size(&self) -> usize

impl<T0: HeapSize, T1: HeapSize, T2: HeapSize, T3: HeapSize, T4: HeapSize> HeapSize for (T0, T1, T2, T3, T4)

fn heap_size(&self) -> usize

impl<T0: HeapSize, T1: HeapSize, T2: HeapSize, T3: HeapSize, T4: HeapSize, T5: HeapSize> HeapSize for (T0, T1, T2, T3, T4, T5)

fn heap_size(&self) -> usize

impl<T0: HeapSize, T1: HeapSize, T2: HeapSize, T3: HeapSize, T4: HeapSize, T5: HeapSize, T6: HeapSize> HeapSize for (T0, T1, T2, T3, T4, T5, T6)

fn heap_size(&self) -> usize

impl<T0: HeapSize, T1: HeapSize, T2: HeapSize, T3: HeapSize, T4: HeapSize, T5: HeapSize, T6: HeapSize, T7: HeapSize> HeapSize for (T0, T1, T2, T3, T4, T5, T6, T7)

fn heap_size(&self) -> usize

impl<T0: HeapSize, T1: HeapSize, T2: HeapSize, T3: HeapSize, T4: HeapSize, T5: HeapSize, T6: HeapSize, T7: HeapSize, T8: HeapSize> HeapSize for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

fn heap_size(&self) -> usize

impl<T0: HeapSize, T1: HeapSize, T2: HeapSize, T3: HeapSize, T4: HeapSize, T5: HeapSize, T6: HeapSize, T7: HeapSize, T8: HeapSize, T9: HeapSize> HeapSize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

fn heap_size(&self) -> usize

impl<T0: HeapSize, T1: HeapSize, T2: HeapSize, T3: HeapSize, T4: HeapSize, T5: HeapSize, T6: HeapSize, T7: HeapSize, T8: HeapSize, T9: HeapSize, T10: HeapSize> HeapSize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

fn heap_size(&self) -> usize

impl<T0: HeapSize, T1: HeapSize, T2: HeapSize, T3: HeapSize, T4: HeapSize, T5: HeapSize, T6: HeapSize, T7: HeapSize, T8: HeapSize, T9: HeapSize, T10: HeapSize, T11: HeapSize> HeapSize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

fn heap_size(&self) -> usize

impl<T> HeapSize for PhantomData<T>

fn heap_size(&self) -> usize

impl<T: HeapSize> HeapSize for Option<T>

fn heap_size(&self) -> usize

impl<T: HeapSize> HeapSize for Box<T>

fn heap_size(&self) -> usize

impl<T: HeapSize> HeapSize for BTreeSet<T>

fn heap_size(&self) -> usize

impl<T: HeapSize> HeapSize for Rc<T>

fn heap_size(&self) -> usize

impl<T: HeapSize> HeapSize for Arc<T>

fn heap_size(&self) -> usize

impl<T: HeapSize> HeapSize for Vec<T>

fn heap_size(&self) -> usize

impl<T: HeapSize> HeapSize for HashSet<T>

fn heap_size(&self) -> usize

impl<T: HeapSize, E: HeapSize> HeapSize for Result<T, E>

fn heap_size(&self) -> usize

Implementors

impl<K: HeapSize, V: HeapSize, BH> HeapSize for OrderedHashMap<K, V, BH>