pub struct Cache<DC>{ /* private fields */ }Expand description
This is where all the magic happens!
let controller = MyDataController::new(host, port);
let cache = Cache::builder()
.data_controller(controller)
.max_updates(1000)
.max_capacity(100_000)
.flush_interval(Duration::from_secs(10))
.build();
// The key type is defined by the data controller implementation of DataController.
cache.entry(key).await?
.and_try_compute_with(|entry| async {
let record = if let Some(entry) = entry {
modify(entry.into_value()).await?
}
else {
create_new().await?
};
Ok(Op::Put(record))
})
.await?;Implementations§
Source§impl<DC> Cache<DC>
impl<DC> Cache<DC>
Sourcepub fn error(&self) -> Option<Arc<DC::Error>>
pub fn error(&self) -> Option<Arc<DC::Error>>
The last error that occurred within the background task. If set, any subsequent call to a public method operating on the cache object will return this error.
Sourcepub fn clear_error(&self) -> Option<Arc<DC::Error>>
pub fn clear_error(&self) -> Option<Arc<DC::Error>>
Clears and returns the last error or None.
Sourcepub fn data_controller(&self) -> Arc<DC>
pub fn data_controller(&self) -> Arc<DC>
The data controller object.
Sourcepub fn max_updates(&self) -> u64
pub fn max_updates(&self) -> u64
The maximum size of the updates pool. This not a hard limit but a threshold that triggers automatic flushing by the background task.
Defaults to 100.
Sourcepub fn max_capacity(&self) -> u64
pub fn max_capacity(&self) -> u64
The maximum cache capacity. This is a hard limit on the number of key entries (not records). See the crate documentation for details.
Defaults to 10000.
Sourcepub fn flush_interval(&self) -> Duration
pub fn flush_interval(&self) -> Duration
The delay between two consecutive flushes. If a flush was manually requested then the timer is reset.
Sourcepub fn set_flush_interval(&mut self, value: Duration) -> Duration
pub fn set_flush_interval(&mut self, value: Duration) -> Duration
Change the flush interval.
Sourcepub fn monitor_tick_duration(&self) -> u64
pub fn monitor_tick_duration(&self) -> u64
The period of time between two consecutive checks of the cache state by the background task.
Sourcepub fn builder() -> CacheBuilder<DC>
pub fn builder() -> CacheBuilder<DC>
Implement builder pattern for Cache.
Source§impl<DC> Cache<DC>where
DC: DataController,
impl<DC> Cache<DC>where
DC: DataController,
Sourcepub async fn entry(
&self,
key: DC::Key,
) -> Result<EntryKeySelector<DC>, Arc<DC::Error>>
pub async fn entry( &self, key: DC::Key, ) -> Result<EntryKeySelector<DC>, Arc<DC::Error>>
Returns an object that represents a key in the cache.
Sourcepub async fn get(
&self,
key: &DC::Key,
) -> Result<Option<DC::Value>, Arc<DC::Error>>
pub async fn get( &self, key: &DC::Key, ) -> Result<Option<DC::Value>, Arc<DC::Error>>
Try to get a value from the cache by its key. If the value is not present, the controller attempts to fetch it
via the data controller. Returns None if such a key does not exist.
Sourcepub async fn insert(
&self,
value: DC::Value,
) -> Result<Option<DC::Value>, Arc<DC::Error>>
pub async fn insert( &self, value: DC::Value, ) -> Result<Option<DC::Value>, Arc<DC::Error>>
Insert a value into the cache. This operation triggers the on_new data controller
chain of events even in case there is already a value present for the same key.
Sourcepub async fn delete(
&self,
key: &DC::Key,
) -> Result<Option<DC::Value>, Arc<DC::Error>>
pub async fn delete( &self, key: &DC::Key, ) -> Result<Option<DC::Value>, Arc<DC::Error>>
Delete a value from the cache by its key. If the value is not cached yet, it will be fetched from the backend first. This behavior is subject to further optimization. In most cases, however, this should not be a problem because if one knows what to delete without inspecting it first or using it in other ways, then it would be more efficient to delete directly in the backend.
Sourcepub async fn invalidate(&self, key: &DC::Key) -> Result<(), Arc<DC::Error>>
pub async fn invalidate(&self, key: &DC::Key) -> Result<(), Arc<DC::Error>>
Invalidate a key in the cache. A secondary key is invalidated by removing it from the cache, while a primary key is invalidated by removing it and all its secondary keys from the cache.
Sourcepub async fn flush_many_raw(
&self,
keys: Vec<DC::Key>,
) -> Result<usize, DC::Error>
pub async fn flush_many_raw( &self, keys: Vec<DC::Key>, ) -> Result<usize, DC::Error>
Low-level immediate flush operation that requires a list of keys to flush. It does not check for error generated by the background task.
Sourcepub async fn flush(&self) -> Result<usize, Arc<DC::Error>>
pub async fn flush(&self) -> Result<usize, Arc<DC::Error>>
Immediately flushes all updates in the pool but will do nothing and immediately error out if the background task has encountered an error.
Sourcepub async fn soft_flush(&self) -> Result<(), Arc<DC::Error>>
pub async fn soft_flush(&self) -> Result<(), Arc<DC::Error>>
Initiates a flush via the background task.
This method does not wait for the flush to complete; it returns immediately. If the background task has previously encountered an error, this method will do nothing and return that error.
Sourcepub async fn flush_one(&self, key: &DC::Key) -> Result<usize, Arc<DC::Error>>
pub async fn flush_one(&self, key: &DC::Key) -> Result<usize, Arc<DC::Error>>
Flushes a single key in the cache. Although the operation itself is inefficient from the caching perspective, it is useful in a multi-cache environment where values in one backend refer to values in another. For example, when there is a foreign key relationship between two tables in a database, a dependent record cannot be written into the backend until its dependency is written first.
This method is most useful when invoked by an observer.
Does nothing and returns an error if the background task has encountered an error.
Sourcepub async fn close(&self) -> Result<(), Arc<DC::Error>>
pub async fn close(&self) -> Result<(), Arc<DC::Error>>
Prepares the cache for shutdown. This method will notify the background task to stop and flush all updates. It will block until the task is finished.
The method is mandatory to be called before the cache is dropped to ensure that no data is lost.
Will do nothing and return an error if the background task has encountered an error.
Sourcepub fn is_shut_down(&self) -> bool
pub fn is_shut_down(&self) -> bool
Returns the shutdown status of the cache.
Trait Implementations§
Source§impl<DC> Debug for Cache<DC>where
DC: DataController,
impl<DC> Debug for Cache<DC>where
DC: DataController,
impl<DC> FXStruct for Cache<DC>
Auto Trait Implementations§
impl<DC> !Freeze for Cache<DC>
impl<DC> !RefUnwindSafe for Cache<DC>
impl<DC> Send for Cache<DC>
impl<DC> Sync for Cache<DC>
impl<DC> Unpin for Cache<DC>
impl<DC> !UnwindSafe for Cache<DC>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> FutureExt for T
impl<T> FutureExt for T
Source§fn with_context(self, otel_cx: Context) -> WithContext<Self>
fn with_context(self, otel_cx: Context) -> WithContext<Self>
Source§fn with_current_context(self) -> WithContext<Self>
fn with_current_context(self) -> WithContext<Self>
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
Source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T in a tonic::RequestSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.