Struct RedisCacheStore 

pub struct RedisCacheStore { /* private fields */ }

The cache operations (Java RedisCacheStore).

Implementations

impl RedisCacheStore

pub fn new( backend: RedisBackend, key_prefix: impl Into<String>, default_ttl_seconds: u64, ) -> Self

backend is the standalone-or-cluster backend (one shared, multiplexed connection); key_prefix is prepended to every key (blank = none); default_ttl_seconds applies to writes that do not specify one.

pub fn default_ttl_seconds(&self) -> u64

The default TTL (seconds) applied when a write omits one.

pub fn backend(&self) -> &RedisBackend

The backend this store runs on (diagnostics: cluster(), endpoint()).

pub async fn put( &self, key: Option<&str>, value: &[u8], ttl_seconds: u64, ) -> Result<(), AppError>

SETEX key ttl value.

pub async fn get(&self, key: Option<&str>) -> Result<Option<Vec<u8>>, AppError>

GET key — the value, or None on a miss.

pub async fn mget( &self, keys: &[String], ) -> Result<Vec<(String, Vec<u8>)>, AppError>

MGET k1 k2 … — misses omitted, request order kept, keys returned without the prefix. On a cluster the keys may span slots; the cluster client scatter-gathers the request.

pub async fn mput( &self, entries: &[(String, Vec<u8>)], ttl_seconds: u64, ) -> Result<(), AppError>

Bulk write as a pipelined batch of single-key SETEX — one round trip, each key keeping its TTL (raw MSET sets none). Non-atomic across the map, and each key routes to its own slot, so the map may span cluster slots freely.

pub async fn delete(&self, key: Option<&str>) -> Result<i64, AppError>

DEL key — the number of keys removed (0 or 1).

pub async fn put_if_absent( &self, key: Option<&str>, value: &[u8], ttl_seconds: u64, ) -> Result<bool, AppError>

SET key value NX EX ttl — atomic put-if-absent with a TTL in one command (not SETNX then EXPIRE, which leaves a TTL-less key if the process dies between them). true if stored, false if the key existed.

pub async fn list_push( &self, key: Option<&str>, value: &[u8], ttl_seconds: u64, ) -> Result<i64, AppError>

RPUSH key value then EXPIRE key ttl as one atomic MULTI/EXEC step (so the list key is never left TTL-less). The new list length.

pub async fn list_pop( &self, key: Option<&str>, ) -> Result<Option<Vec<u8>>, AppError>

LPOP key — destructive: the oldest value, or None when the list is empty.

pub async fn list_len(&self, key: Option<&str>) -> Result<i64, AppError>

LLEN key — the list length (0 for an absent list).