Struct SortOrderCache 

pub struct SortOrderCache { /* private fields */ }

Previous back-to-front ordering for each view rendering the same batch.

Keyed by crate::ViewBuilderId so several views can display the same primitives from different angles without their orderings clobbering each other. Reused across frames: the eye usually moves only a little, so last frame’s ordering is a near-sorted starting point.

Trait Implementations

impl Clone for SortOrderCache

fn clone(&self) -> SortOrderCache

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for SortOrderCache

fn default() -> SortOrderCache

Returns the “default value” for a type.

impl SizeBytes for SortOrderCache

const IS_POD: bool = <Arc<Mutex<HashMap<crate::ViewBuilderId, Vec<u32>>>> as ::re_byte_size::SizeBytes>::IS_POD

fn heap_size_bytes(&self) -> u64

Returns how many bytes self uses on the heap.

fn total_size_bytes(&self) -> u64

Returns the total size of self in bytes, accounting for both stack and heap space.

fn stack_size_bytes(&self) -> u64

Returns the total size of self on the stack, in bytes.