Struct StaticLinkedList

pub struct StaticLinkedList<const SIZE: usize> { /* private fields */ }

Available on crate feature pack-cache-lru-static and (crate features pack-cache-lru-dynamic or pack-cache-lru-static) only.

A cache using a least-recently-used implementation capable of storing the SIZE most recent objects. The cache must be small as the search is ‘naive’ and the underlying data structure is a linked list. Values of 64 seem to improve performance.

Implementations

impl<const SIZE: usize> StaticLinkedList<SIZE>

pub fn new(mem_limit: usize) -> Self

Create a new list with a memory limit of mem_limit in bytes. If 0, there is no memory limit.

Trait Implementations

impl<const SIZE: usize> DecodeEntry for StaticLinkedList<SIZE>

fn put( &mut self, pack_id: u32, offset: u64, data: &[u8], kind: Kind, compressed_size: usize, )

Store a fully decoded object at offset of kind with compressed_size and data in the cache.

fn get( &mut self, pack_id: u32, offset: u64, out: &mut Vec<u8>, ) -> Option<(Kind, usize)>

Attempt to fetch the object at offset and store its decoded bytes in out, as previously stored with DecodeEntry::put(), and return its (object kind, decompressed_size)

impl<const SIZE: usize> Default for StaticLinkedList<SIZE>

fn default() -> Self

Returns the “default value” for a type.