Struct dtypes::redis::ListCache

pub struct ListCache<T> { /* private fields */ }

A list that caches the values in memory It improves the performance, if you perform a lot of read only operations on the list.

All manipulations are done on the cache and synced with the redis server.

Example

use dtypes::redis::{ListCache, Mutex};

let client = redis::Client::open("redis://localhost:6379").unwrap();
let mut list = ListCache::new("test_list2", client);
list.push_back(1);
list.push_back(2);
assert_eq!(list.len(), 2);
assert_eq!(list.pop_front(), Some(1));
list.clear();

Implementations

impl<T> ListCache<T>where T: Serialize + DeserializeOwned,

pub fn new(key: &str, client: Client) -> Self

Creates a new ListCache The list is loaded from the redis server. If you want to create an empty list, use ListCache::without_load

pub fn without_load(key: &str, client: Client) -> Self

Creates a new ListCache without loading the list from the redis server.

pub fn pull(&mut self)

pub fn push_back(&mut self, val: T)

pub fn push_front(&mut self, val: T)

pub fn pop_back(&mut self) -> Option<T>

pub fn pop_front(&mut self) -> Option<T>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn insert(&mut self, index: usize, val: T)

pub fn front(&self) -> Option<&T>

pub fn back(&self) -> Option<&T>

pub fn get(&self, index: usize) -> Option<&T>

Methods from Deref<Target = List<T>>

pub fn iter(&self) -> ListIter<'_, T>

Returns an iterator over the list.

pub fn push_front(&mut self, val: &T)

Add a value to the front of the list

pub fn push_back(&mut self, val: &T)

Add a value to the back of the list

pub fn pop_front(&mut self) -> Option<T>

Removes and returns the first value of the list

pub fn pop_back(&mut self) -> Option<T>

Removes and returns the last value of the list

pub fn len(&self) -> usize

Returns the length of the list

pub fn clear(&self)

Removes all values from the list

pub fn contains(&self, val: &T) -> boolwhere T: PartialEq,

Returns true if the list contains the value

pub fn is_empty(&self) -> bool

Returns true if the list is empty

Trait Implementations

impl<T> Deref for ListCache<T>

type Target = List<T>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T> DerefMut for ListCache<T>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.