Struct re_query::latest_at::LatestAtCache

pub struct LatestAtCache {
    pub cache_key: QueryCacheKey,
    pub per_query_time: BTreeMap<TimeInt, LatestAtCachedChunk>,
    pub pending_invalidations: BTreeSet<TimeInt>,
}

Caches the results of LatestAt queries for a given QueryCacheKey.

Fields

cache_key: QueryCacheKey

For debugging purposes.

per_query_time: BTreeMap<TimeInt, LatestAtCachedChunk>

Organized by query time.

If the key is present but has a None value associated with it, it means we cached the lack of result. This is important to do performance-wise: we run a lot of queries each frame to figure out what to render, and this scales linearly with the number of entity.

pending_invalidations: BTreeSet<TimeInt>

These timestamps have been invalidated asynchronously.

The next time this cache gets queried, it must remove any invalidated entries accordingly.

Invalidation is deferred to query time because it is far more efficient that way: the frame time effectively behaves as a natural micro-batching mechanism.

Implementations

impl LatestAtCache

pub fn new(cache_key: QueryCacheKey) -> Self

impl LatestAtCache

pub fn latest_at( &mut self, store: &ChunkStore, query: &LatestAtQuery, entity_path: &EntityPath, component_name: ComponentName ) -> Option<UnitChunkShared>

Queries cached latest-at data for a single component.

pub fn handle_pending_invalidation(&mut self)

Trait Implementations

impl Debug for LatestAtCache

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

Formats the value using the given formatter.

impl SizeBytes for LatestAtCache

fn heap_size_bytes(&self) -> u64

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

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.

fn is_pod() -> bool

Is Self just plain old data?