Struct re_query::QueryCache

pub struct QueryCache {
    pub(crate) store: ChunkStoreHandle,
    pub(crate) store_id: StoreId,
    pub(crate) might_require_clearing: RwLock<IntSet<EntityPath>>,
    pub(crate) latest_at_per_cache_key: RwLock<HashMap<QueryCacheKey, Arc<RwLock<LatestAtCache>>>>,
    pub(crate) range_per_cache_key: RwLock<HashMap<QueryCacheKey, Arc<RwLock<RangeCache>>>>,
}

Fields

store: ChunkStoreHandle

Handle to the associated ChunkStoreHandle.

store_id: StoreId

The StoreId of the associated ChunkStoreHandle.

might_require_clearing: RwLock<IntSet<EntityPath>>

Keeps track of which entities have had any Clear-related data on any timeline at any point in time.

This is used to optimized read-time clears, so that we don’t unnecessarily pay for the fixed overhead of all the query layers when we know for a fact that there won’t be any data there. This is a huge performance improvement in practice, especially in recordings with many entities.

latest_at_per_cache_key: RwLock<HashMap<QueryCacheKey, Arc<RwLock<LatestAtCache>>>>

range_per_cache_key: RwLock<HashMap<QueryCacheKey, Arc<RwLock<RangeCache>>>>

Implementations

impl QueryCache

pub fn new(store: ChunkStoreHandle) -> Self

pub fn new_handle(store: ChunkStoreHandle) -> QueryCacheHandle

pub fn clear(&self)

impl QueryCache

pub fn stats(&self) -> CachesStats

Computes the stats for all primary caches.

impl QueryCache

pub fn latest_at<'d>( &self, query: &LatestAtQuery, entity_path: &EntityPath, component_descrs: impl IntoIterator<Item = impl Into<Cow<'d, ComponentDescriptor>>>, ) -> LatestAtResults

Queries for the given component_names using latest-at semantics.

See LatestAtResults for more information about how to handle the results.

This is a cached API – data will be lazily cached upon access.

pub fn purge_fraction_of_ram(&self, fraction_to_purge: f32)

Free up some RAM by forgetting the older parts of all timelines.

impl QueryCache

pub fn range<'a>( &self, query: &RangeQuery, entity_path: &EntityPath, component_descrs: impl IntoIterator<Item = impl Into<Cow<'a, ComponentDescriptor>>>, ) -> RangeResults

Queries for the given component_names using range semantics.

See RangeResults for more information about how to handle the results.

This is a cached API – data will be lazily cached upon access.

Trait Implementations

impl ChunkStoreSubscriber for QueryCache

fn name(&self) -> String

Arbitrary name for the subscriber.

fn as_any(&self) -> &dyn Any

Workaround for downcasting support, simply return self:

fn as_any_mut(&mut self) -> &mut dyn Any

Workaround for downcasting support, simply return self:

fn on_events(&mut self, events: &[ChunkStoreEvent])

The core of this trait: get notified of changes happening in all ChunkStores.

fn on_drop(&mut self, store_id: &StoreId)

Notifies a subscriber that an entire store was dropped.

impl Debug for QueryCache

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

Formats the value using the given formatter.