Struct deduplicate::Deduplicate

pub struct Deduplicate<G, K, V>where
    G: Fn(K) -> DeduplicateFuture<V> + Clone,
    K: Clone + Send + Eq + Hash,
    V: Clone + Send,{ /* private fields */ }

Query de-duplication with optional cache.

When trying to avoid multiple slow or expensive gets, use this.

Implementations

impl<G, K, V> Deduplicate<G, K, V>where
    G: Fn(K) -> DeduplicateFuture<V> + Clone,
    K: Clone + Send + Eq + Hash + 'static,
    V: Clone + Send + 'static,

pub fn new(delegate: G) -> Self

Create a new deduplicator for the provided delegate with default cache capacity: 512.

pub fn with_capacity(delegate: G, capacity: usize) -> Self

Create a new deduplicator for the provided delegate with specified cache capacity. Note: If capacity is 0, then caching is disabled.

pub fn set_delegate(&mut self, delegate: G)

Update the delegate to use for future gets. This will also clear the internal cache.

pub fn clear(&mut self)

Clear the internal cache.

pub async fn get(&self, key: K) -> Result<Option<V>, DeduplicateError>

Use the delegate to get a value.

Many concurrent accessors can attempt to get the same key, but the underlying get will only be called once. If the delegate panics or is cancelled, any concurrent accessors will get the error: DeduplicateError::Failed.

pub fn insert(&mut self, key: K, value: V) -> Result<(), DeduplicateError>

Insert an entry directly into the cache. If there is no cache , this will fail with DeduplicateError::NoCache.

Trait Implementations

impl<G, K, V> Clone for Deduplicate<G, K, V>where
    G: Fn(K) -> DeduplicateFuture<V> + Clone + Clone,
    K: Clone + Send + Eq + Hash + Clone,
    V: Clone + Send + Clone,

fn clone(&self) -> Deduplicate<G, K, V>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.