Struct MemoryPersistedQueryStore 

pub struct MemoryPersistedQueryStore { /* private fields */ }

Available on crate feature async-graphql only.

Default in-memory store backed by scc::HashMap with a hard-capped entry count. The previous implementation was unbounded, which let any client flood the cache with (unique-hash, full-query) pairs and OOM the process. Use Self::with_max_entries to size the cap; the default is 1024 entries.

When the cap is reached, the store performs a bulk flush rather than LRU eviction (the underlying scc::HashMap does not expose ordering hooks). Callers that need finer-grained eviction should wrap their own store implementing PersistedQueryStore.

Soft cap, not hard: the len() >= cap → clear() → insert() sequence in PersistedQueryStore::put is not atomic. Concurrent puts each observe len < cap, all proceed past the check, and each insert lands — the effective ceiling is cap + concurrent_put_count. The race is memory-safe (scc takes care of the per-entry locking) and only ever over-shoots by the number of in-flight puts, which is bounded by your request concurrency. If you need a hard cap, layer in your own PersistedQueryStore impl with Mutex<HashMap> semantics.

Implementations

impl MemoryPersistedQueryStore

pub fn new() -> MemoryPersistedQueryStore

Create a store with the default 1024-entry cap.

pub fn with_max_entries(max_entries: usize) -> MemoryPersistedQueryStore

Create a store that admits at most max_entries cached (hash, query) pairs before the next insert triggers a full flush.

Trait Implementations

impl Clone for MemoryPersistedQueryStore

fn clone(&self) -> MemoryPersistedQueryStore

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for MemoryPersistedQueryStore

fn default() -> MemoryPersistedQueryStore

Returns the “default value” for a type.

impl PersistedQueryStore for MemoryPersistedQueryStore

fn get<'life0, 'life1, 'async_trait>( &'life0 self, hash: &'life1 str, ) -> Pin<Box<dyn Future<Output = Option<String>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, MemoryPersistedQueryStore: 'async_trait,

Retrieve a cached query by its SHA-256 hex hash.

fn put<'life0, 'async_trait>( &'life0 self, hash: String, query: String, ) -> Pin<Box<dyn Future<Output = ()> + Send + 'async_trait>>

where 'life0: 'async_trait, MemoryPersistedQueryStore: 'async_trait,

Cache a (hash, query) pair.