Struct DefaultListFilesCache 

pub struct DefaultListFilesCache { /* private fields */ }

Default implementation of ListFilesCache

Caches file metadata for file listing operations.

Internal details

The memory_limit parameter controls the maximum size of the cache, which uses a Least Recently Used eviction algorithm. When adding a new entry, if the total number of entries in the cache exceeds memory_limit, the least recently used entries are evicted until the total size is lower than the memory_limit.

Extra Handling

Users should use the Self::get and Self::put methods. The Self::get_with_extra and Self::put_with_extra methods simply call get and put, respectively.

Implementations

impl DefaultListFilesCache

pub fn new(memory_limit: usize, ttl: Option<Duration>) -> Self

Creates a new instance of DefaultListFilesCache.

Arguments

• memory_limit - The maximum size of the cache, in bytes.
• ttl - The TTL (time-to-live) of entries in the cache.

pub fn cache_limit(&self) -> usize

Returns the cache’s memory limit in bytes.

pub fn update_cache_limit(&self, limit: usize)

Updates the cache with a new memory limit in bytes.

pub fn cache_ttl(&self) -> Option<Duration>

Returns the TTL (time-to-live) applied to cache entries.

Trait Implementations

impl CacheAccessor<TableScopedPath, Arc<Vec<ObjectMeta>>> for DefaultListFilesCache

fn get(&self, k: &TableScopedPath) -> Option<Arc<Vec<ObjectMeta>>>

Gets all files for the given table base path.

This is equivalent to calling get_with_extra(k, &None).

fn get_with_extra( &self, table_scoped_path: &TableScopedPath, prefix: &Self::Extra, ) -> Option<Arc<Vec<ObjectMeta>>>

Performs a prefix-aware cache lookup.

Arguments

• table_base - The table’s base path (the cache key)
• prefix - Optional prefix filter (relative to table base) for partition filtering

Behavior

• Fetches the cache entry for table_base
• If prefix is Some, filters results to only files matching table_base/prefix
• Returns the (potentially filtered) results

This enables efficient partition pruning - a single cached listing of the full table can serve queries for any partition subset without additional storage calls.

type Extra = Option<Path>

fn put( &self, key: &TableScopedPath, value: Arc<Vec<ObjectMeta>>, ) -> Option<Arc<Vec<ObjectMeta>>>

Put value into cache. Returns the old value associated with the key if there was one.

fn put_with_extra( &self, key: &TableScopedPath, value: Arc<Vec<ObjectMeta>>, _e: &Self::Extra, ) -> Option<Arc<Vec<ObjectMeta>>>

Put value into cache. Returns the old value associated with the key if there was one.

fn remove(&self, k: &TableScopedPath) -> Option<Arc<Vec<ObjectMeta>>>

Remove an entry from the cache, returning value if they existed in the map.

fn contains_key(&self, k: &TableScopedPath) -> bool

Check if the cache contains a specific key.

fn len(&self) -> usize

Fetch the total number of cache entries.

fn clear(&self)

Remove all entries from the cache.

fn name(&self) -> String

Return the cache name.

fn is_empty(&self) -> bool

Check if the Cache collection is empty or not.

impl Default for DefaultListFilesCache

fn default() -> Self

Returns the “default value” for a type.

impl ListFilesCache for DefaultListFilesCache

fn cache_limit(&self) -> usize

Returns the cache’s memory limit in bytes.

fn cache_ttl(&self) -> Option<Duration>

Returns the TTL (time-to-live) for cache entries, if configured.

fn update_cache_limit(&self, limit: usize)

Updates the cache with a new memory limit in bytes.

fn update_cache_ttl(&self, ttl: Option<Duration>)

Updates the cache with a new TTL (time-to-live).

fn list_entries(&self) -> HashMap<TableScopedPath, ListFilesEntry>

Retrieves the information about the entries currently cached.

fn drop_table_entries(&self, table_ref: &Option<TableReference>) -> Result<()>