Struct RedisCache 

pub struct RedisCache { /* private fields */ }

Available on crate feature redis only.

Cache using redis.

It uses redis::Client to connect to redis. Feature redis must be enabled.

A custom map should be specified. It will be used as the map of the redis key.

RedisCache implements Cache. See Cache for more details.

Example

let client = redis::Client::open("redis://127.0.0.1:6379/").unwrap();
 
// `aaa` is the hash map name
let map = "aaa";
let cache = RedisCache::new(client, map).await.unwrap(); 
 
cache.set("a", 1).await.unwrap();
assert_eq!(cache.get::<u8>("a").await.unwrap().unwrap(), 1);
 
// Redis Data ('aaa' is a redis hash map):
// aaa: a -> Encoded(1)

Implementations

impl RedisCache

pub async fn new<S: ToString>(client: Client, map: S) -> Result<Self>

Trait Implementations

impl Cache for RedisCache

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

where T: 'async_trait + Cacheable + Send + Sync, Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

fn set<'life0, 'life1, 'async_trait, T>( &'life0 self, key: &'life1 str, value: T, ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

where T: 'async_trait + Cacheable + Send + Sync, Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

fn delete<'life0, 'life1, 'async_trait>( &'life0 self, key: &'life1 str, ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

fn len<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = Result<usize>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

impl Clone for RedisCache

fn clone(&self) -> RedisCache

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RedisCache

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.