InfoDict in redis - Rust
Description: An info dictionary type.

Skip to main content

## InfoDict

# Struct InfoDict

Source

    pub struct InfoDict { /* private fields */ }

Expand description

An info dictionary type.

## Implementations§

Source§

### impl InfoDict

This type provides convenient access to key/value data returned by the “INFO” command. It acts like a regular mapping but also has a convenience method `get` which can return data in the appropriate type.

For instance this can be used to query the server for the role it’s in (master, slave) etc:

    let info : redis::InfoDict = redis::cmd("INFO").query(&mut con)?;
    let role : Option<String> = info.get("role");

Source

#### pub fn new(kvpairs: &str) -> InfoDict

Creates a new info dictionary from a string in the response of the INFO command. Each line is a key, value pair with the key and value separated by a colon (`:`). Lines starting with a hash (`#`) are ignored.

Source

#### pub fn get<T: FromRedisValue>(&self, key: &str) -> Option<T>

Fetches a value by key and converts it into the given type. Typical types are `String`, `bool` and integer types.

Source

#### pub fn find(&self, key: &&str) -> Option<&Value>

Looks up a key in the info dict.

Source

#### pub fn contains_key(&self, key: &&str) -> bool

Checks if a key is contained in the info dicf.

Source

#### pub fn len(&self) -> usize

Returns the size of the info dict.

Source

#### pub fn is_empty(&self) -> bool

Checks if the dict is empty.

## Methods from Deref<Target = HashMap<String, Value>>§

#### pub fn get<Q>(&self, k: &Q) -> Option<&V>
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Returns a reference to the value corresponding to the key.

The key may be any borrowed form of the map’s key type, but `Hash` and `Eq` on the borrowed form must match those for the key type.

##### §Examples

    use std::collections::HashMap;

    let mut map = HashMap::new();
    map.insert(1, "a");
    assert_eq!(map.get(&1), Some(&"a"));
    assert_eq!(map.get(&2), None);

#### pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Returns the key-value pair corresponding to the supplied key.

The supplied key may be any borrowed form of the map’s key type, but `Hash` and `Eq` on the borrowed form must match those for the key type.

##### §Examples

    use std::collections::HashMap;

    let mut map = HashMap::new();
    map.insert(1, "a");
    assert_eq!(map.get_key_value(&1), Some((&1, &"a")));
    assert_eq!(map.get_key_value(&2), None);

## Methods from Deref<Target = HashMap<K, V, S>>§

1.0.0 · Source

#### pub fn capacity(&self) -> usize

Available on crate features `cluster` and `cluster-async` only.

Returns the number of elements the map can hold without reallocating.

This number is a lower bound; the `HashMap<K, V>` might be able to hold more, but is guaranteed to be able to hold at least this many.

##### §Examples

    use std::collections::HashMap;
    let map: HashMap<i32, i32> = HashMap::with_capacity(100);
    assert!(map.capacity() >= 100);

1.0.0 · Source

#### pub fn keys(&self) -> Keys<'_, K, V>

Available on crate features `cluster` and `cluster-async` only.

An iterator visiting all keys in arbitrary order. The iterator element type is `&'a K`.

##### §Examples

    use std::collections::HashMap;

    let map = HashMap::from([
        ("a", 1),
        ("b", 2),
        ("c", 3),
    ]);

    for key in map.keys() {
        println!("{key}");
    }

##### §Performance

In the current implementation, iterating over keys takes O(capacity) time instead of O(len) because it internally visits empty buckets too.

1.0.0 · Source

#### pub fn values(&self) -> Values<'_, K, V>

Available on crate features `cluster` and `cluster-async` only.

An iterator visiting all values in arbitrary order. The iterator element type is `&'a V`.

##### §Examples

    use std::collections::HashMap;

    let map = HashMap::from([
        ("a", 1),
        ("b", 2),
        ("c", 3),
    ]);

    for val in map.values() {
        println!("{val}");
    }

##### §Performance

In the current implementation, iterating over values takes O(capacity) time instead of O(len) because it internally visits empty buckets too.

1.10.0 · Source

#### pub fn values_mut(&mut self) -> ValuesMut<'_, K, V>

Available on crate features `cluster` and `cluster-async` only.

An iterator visiting all values mutably in arbitrary order. The iterator element type is `&'a mut V`.

##### §Examples

    use std::collections::HashMap;

    let mut map = HashMap::from([
        ("a", 1),
        ("b", 2),
        ("c", 3),
    ]);

    for val in map.values_mut() {
        *val = *val + 10;
    }

    for val in map.values() {
        println!("{val}");
    }

##### §Performance

In the current implementation, iterating over values takes O(capacity) time instead of O(len) because it internally visits empty buckets too.

1.0.0 · Source

#### pub fn iter(&self) -> Iter<'_, K, V>

Available on crate features `cluster` and `cluster-async` only.

An iterator visiting all key-value pairs in arbitrary order. The iterator element type is `(&'a K, &'a V)`.

##### §Examples

    use std::collections::HashMap;

    let map = HashMap::from([
        ("a", 1),
        ("b", 2),
        ("c", 3),
    ]);

    for (key, val) in map.iter() {
        println!("key: {key} val: {val}");
    }

##### §Performance

In the current implementation, iterating over map takes O(capacity) time instead of O(len) because it internally visits empty buckets too.

1.0.0 · Source

#### pub fn iter_mut(&mut self) -> IterMut<'_, K, V>

Available on crate features `cluster` and `cluster-async` only.

An iterator visiting all key-value pairs in arbitrary order, with mutable references to the values. The iterator element type is `(&'a K, &'a mut V)`.

##### §Examples

    use std::collections::HashMap;

    let mut map = HashMap::from([
        ("a", 1),
        ("b", 2),
        ("c", 3),
    ]);

    // Update all values
    for (_, val) in map.iter_mut() {
        *val *= 2;
    }

    for (key, val) in &map {
        println!("key: {key} val: {val}");
    }

##### §Performance

In the current implementation, iterating over map takes O(capacity) time instead of O(len) because it internally visits empty buckets too.

1.0.0 · Source

#### pub fn len(&self) -> usize

Available on crate features `cluster` and `cluster-async` only.

Returns the number of elements in the map.

##### §Examples

    use std::collections::HashMap;

    let mut a = HashMap::new();
    assert_eq!(a.len(), 0);
    a.insert(1, "a");
    assert_eq!(a.len(), 1);

1.0.0 · Source

#### pub fn is_empty(&self) -> bool

Available on crate features `cluster` and `cluster-async` only.

Returns `true` if the map contains no elements.

##### §Examples

    use std::collections::HashMap;

    let mut a = HashMap::new();
    assert!(a.is_empty());
    a.insert(1, "a");
    assert!(!a.is_empty());

1.6.0 · Source

#### pub fn drain(&mut self) -> Drain<'_, K, V, A>

Available on crate features `cluster` and `cluster-async` only.

Clears the map, returning all key-value pairs as an iterator. Keeps the allocated memory for reuse.

If the returned iterator is dropped before being fully consumed, it drops the remaining key-value pairs. The returned iterator keeps a mutable borrow on the map to optimize its implementation.

##### §Examples

    use std::collections::HashMap;

    let mut a = HashMap::new();
    a.insert(1, "a");
    a.insert(2, "b");

    for (k, v) in a.drain().take(1) {
        assert!(k == 1 || k == 2);
        assert!(v == "a" || v == "b");
    }

    assert!(a.is_empty());

1.88.0 · Source

#### pub fn extract_if<F>(&mut self, pred: F) -> ExtractIf<'_, K, V, F, A>
where F: FnMut(&K, &mut V) -> bool,

Available on crate features `cluster` and `cluster-async` only.

Creates an iterator which uses a closure to determine if an element (key-value pair) should be removed.

If the closure returns `true`, the element is removed from the map and yielded. If the closure returns `false`, or panics, the element remains in the map and will not be yielded.

The iterator also lets you mutate the value of each element in the closure, regardless of whether you choose to keep or remove it.

If the returned `ExtractIf` is not exhausted, e.g. because it is dropped without iterating or the iteration short-circuits, then the remaining elements will be retained. Use `retain` with a negated predicate if you do not need the returned iterator.

##### §Examples

Splitting a map into even and odd keys, reusing the original map:

    use std::collections::HashMap;

    let mut map: HashMap<i32, i32> = (0..8).map(|x| (x, x)).collect();
    let extracted: HashMap<i32, i32> = map.extract_if(|k, _v| k % 2 == 0).collect();

    let mut evens = extracted.keys().copied().collect::<Vec<_>>();
    let mut odds = map.keys().copied().collect::<Vec<_>>();
    evens.sort();
    odds.sort();

    assert_eq!(evens, vec![0, 2, 4, 6]);
    assert_eq!(odds, vec![1, 3, 5, 7]);

1.18.0 · Source

#### pub fn retain<F>(&mut self, f: F)
where F: FnMut(&K, &mut V) -> bool,

Available on crate features `cluster` and `cluster-async` only.

Retains only the elements specified by the predicate.

In other words, remove all pairs `(k, v)` for which `f(&k, &mut v)` returns `false`. The elements are visited in unsorted (and unspecified) order.

##### §Examples

    use std::collections::HashMap;

    let mut map: HashMap<i32, i32> = (0..8).map(|x| (x, x*10)).collect();
    map.retain(|&k, _| k % 2 == 0);
    assert_eq!(map.len(), 4);

##### §Performance

In the current implementation, this operation takes O(capacity) time instead of O(len) because it internally visits empty buckets too.

1.0.0 · Source

#### pub fn clear(&mut self)

Available on crate features `cluster` and `cluster-async` only.

Clears the map, removing all key-value pairs. Keeps the allocated memory for reuse.

##### §Examples

    use std::collections::HashMap;

    let mut a = HashMap::new();
    a.insert(1, "a");
    a.clear();
    assert!(a.is_empty());

1.9.0 · Source

#### pub fn hasher(&self) -> &S

Available on crate features `cluster` and `cluster-async` only.

Returns a reference to the map’s `BuildHasher`.

##### §Examples

    use std::collections::HashMap;
    use std::hash::RandomState;

    let hasher = RandomState::new();
    let map: HashMap<i32, i32> = HashMap::with_hasher(hasher);
    let hasher: &RandomState = map.hasher();

1.0.0 · Source

#### pub fn reserve(&mut self, additional: usize)

Available on crate features `cluster` and `cluster-async` only.

Reserves capacity for at least `additional` more elements to be inserted in the `HashMap`. The collection may reserve more space to speculatively avoid frequent reallocations. After calling `reserve`, capacity will be greater than or equal to `self.len() + additional`. Does nothing if capacity is already sufficient.

##### §Panics

Panics if the new allocation size overflows `usize`.

##### §Examples

    use std::collections::HashMap;
    let mut map: HashMap<&str, i32> = HashMap::new();
    map.reserve(10);

1.57.0 · Source

#### pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>

Available on crate features `cluster` and `cluster-async` only.

Tries to reserve capacity for at least `additional` more elements to be inserted in the `HashMap`. The collection may reserve more space to speculatively avoid frequent reallocations. After calling `try_reserve`, capacity will be greater than or equal to `self.len() + additional` if it returns `Ok(())`. Does nothing if capacity is already sufficient.

##### §Errors

If the capacity overflows, or the allocator reports a failure, then an error is returned.

##### §Examples

    use std::collections::HashMap;

    let mut map: HashMap<&str, isize> = HashMap::new();
    map.try_reserve(10).expect("why is the test harness OOMing on a handful of bytes?");

1.0.0 · Source

#### pub fn shrink_to_fit(&mut self)

Available on crate features `cluster` and `cluster-async` only.

Shrinks the capacity of the map as much as possible. It will drop down as much as possible while maintaining the internal rules and possibly leaving some space in accordance with the resize policy.

##### §Examples

    use std::collections::HashMap;

    let mut map: HashMap<i32, i32> = HashMap::with_capacity(100);
    map.insert(1, 2);
    map.insert(3, 4);
    assert!(map.capacity() >= 100);
    map.shrink_to_fit();
    assert!(map.capacity() >= 2);

1.56.0 · Source

#### pub fn shrink_to(&mut self, min_capacity: usize)

Available on crate features `cluster` and `cluster-async` only.

Shrinks the capacity of the map with a lower limit. It will drop down no lower than the supplied limit while maintaining the internal rules and possibly leaving some space in accordance with the resize policy.

If the current capacity is less than the lower limit, this is a no-op.

##### §Examples

    use std::collections::HashMap;

    let mut map: HashMap<i32, i32> = HashMap::with_capacity(100);
    map.insert(1, 2);
    map.insert(3, 4);
    assert!(map.capacity() >= 100);
    map.shrink_to(10);
    assert!(map.capacity() >= 10);
    map.shrink_to(0);
    assert!(map.capacity() >= 2);

1.0.0 · Source

#### pub fn entry(&mut self, key: K) -> Entry<'_, K, V, A>

Available on crate features `cluster` and `cluster-async` only.

Gets the given key’s corresponding entry in the map for in-place manipulation.

##### §Examples

    use std::collections::HashMap;

    let mut letters = HashMap::new();

    for ch in "a short treatise on fungi".chars() {
        letters.entry(ch).and_modify(|counter| *counter += 1).or_insert(1);
    }

    assert_eq!(letters[&'s'], 2);
    assert_eq!(letters[&'t'], 3);
    assert_eq!(letters[&'u'], 1);
    assert_eq!(letters.get(&'y'), None);

1.0.0 · Source

#### pub fn get<Q>(&self, k: &Q) -> Option<&V>
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Available on crate features `cluster` and `cluster-async` only.

Returns a reference to the value corresponding to the key.

The key may be any borrowed form of the map’s key type, but `Hash` and `Eq` on the borrowed form must match those for the key type.

##### §Examples

    use std::collections::HashMap;

    let mut map = HashMap::new();
    map.insert(1, "a");
    assert_eq!(map.get(&1), Some(&"a"));
    assert_eq!(map.get(&2), None);

1.40.0 · Source

#### pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Available on crate features `cluster` and `cluster-async` only.

Returns the key-value pair corresponding to the supplied key. This is potentially useful:

- for key types where non-identical keys can be considered equal;
- for getting the `&K` stored key value from a borrowed `&Q` lookup key; or
- for getting a reference to a key with the same lifetime as the collection.

The supplied key may be any borrowed form of the map’s key type, but `Hash` and `Eq` on the borrowed form must match those for the key type.

##### §Examples

    use std::collections::HashMap;
    use std::hash::{Hash, Hasher};

    #[derive(Clone, Copy, Debug)]
    struct S {
        id: u32,
        name: &'static str, // ignored by equality and hashing operations
    }

    impl PartialEq for S {
        fn eq(&self, other: &S) -> bool {
            self.id == other.id
        }
    }

    impl Eq for S {}

    impl Hash for S {
        fn hash<H: Hasher>(&self, state: &mut H) {
            self.id.hash(state);
        }
    }

    let j_a = S { id: 1, name: "Jessica" };
    let j_b = S { id: 1, name: "Jess" };
    let p = S { id: 2, name: "Paul" };
    assert_eq!(j_a, j_b);

    let mut map = HashMap::new();
    map.insert(j_a, "Paris");
    assert_eq!(map.get_key_value(&j_a), Some((&j_a, &"Paris")));
    assert_eq!(map.get_key_value(&j_b), Some((&j_a, &"Paris"))); // the notable case
    assert_eq!(map.get_key_value(&p), None);

1.86.0 · Source

#### pub fn get_disjoint_mut<Q, const N: usize>( &mut self, ks: [&Q; N], ) -> [Option<&mut V>; N]
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Available on crate features `cluster` and `cluster-async` only.

Attempts to get mutable references to `N` values in the map at once.

Returns an array of length `N` with the results of each query. For soundness, at most one mutable reference will be returned to any value. `None` will be used if the key is missing.

This method performs a check to ensure there are no duplicate keys, which currently has a time-complexity of O(n^2), so be careful when passing many keys.

##### §Panics

Panics if any keys are overlapping.

##### §Examples

    use std::collections::HashMap;

    let mut libraries = HashMap::new();
    libraries.insert("Bodleian Library".to_string(), 1602);
    libraries.insert("Athenæum".to_string(), 1807);
    libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
    libraries.insert("Library of Congress".to_string(), 1800);

    // Get Athenæum and Bodleian Library
    let [Some(a), Some(b)] = libraries.get_disjoint_mut([
        "Athenæum",
        "Bodleian Library",
    ]) else { panic!() };

    // Assert values of Athenæum and Library of Congress
    let got = libraries.get_disjoint_mut([
        "Athenæum",
        "Library of Congress",
    ]);
    assert_eq!(
        got,
        [
            Some(&mut 1807),
            Some(&mut 1800),
        ],
    );

    // Missing keys result in None
    let got = libraries.get_disjoint_mut([
        "Athenæum",
        "New York Public Library",
    ]);
    assert_eq!(
        got,
        [
            Some(&mut 1807),
            None
        ]
    );

ⓘ

    use std::collections::HashMap;

    let mut libraries = HashMap::new();
    libraries.insert("Athenæum".to_string(), 1807);

    // Duplicate keys panic!
    let got = libraries.get_disjoint_mut([
        "Athenæum",
        "Athenæum",
    ]);

1.86.0 · Source

#### pub unsafe fn get_disjoint_unchecked_mut<Q, const N: usize>( &mut self, ks: [&Q; N], ) -> [Option<&mut V>; N]
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Available on crate features `cluster` and `cluster-async` only.

Attempts to get mutable references to `N` values in the map at once, without validating that the values are unique.

Returns an array of length `N` with the results of each query. `None` will be used if the key is missing.

For a safe alternative see `get_disjoint_mut`.

##### §Safety

Calling this method with overlapping keys is undefined behavior even if the resulting references are not used.

##### §Examples

    use std::collections::HashMap;

    let mut libraries = HashMap::new();
    libraries.insert("Bodleian Library".to_string(), 1602);
    libraries.insert("Athenæum".to_string(), 1807);
    libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
    libraries.insert("Library of Congress".to_string(), 1800);

    // SAFETY: The keys do not overlap.
    let [Some(a), Some(b)] = (unsafe { libraries.get_disjoint_unchecked_mut([
        "Athenæum",
        "Bodleian Library",
    ]) }) else { panic!() };

    // SAFETY: The keys do not overlap.
    let got = unsafe { libraries.get_disjoint_unchecked_mut([
        "Athenæum",
        "Library of Congress",
    ]) };
    assert_eq!(
        got,
        [
            Some(&mut 1807),
            Some(&mut 1800),
        ],
    );

    // SAFETY: The keys do not overlap.
    let got = unsafe { libraries.get_disjoint_unchecked_mut([
        "Athenæum",
        "New York Public Library",
    ]) };
    // Missing keys result in None
    assert_eq!(got, [Some(&mut 1807), None]);

1.0.0 · Source

#### pub fn contains_key<Q>(&self, k: &Q) -> bool
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Available on crate features `cluster` and `cluster-async` only.

Returns `true` if the map contains a value for the specified key.

The key may be any borrowed form of the map’s key type, but `Hash` and `Eq` on the borrowed form must match those for the key type.

##### §Examples

    use std::collections::HashMap;

    let mut map = HashMap::new();
    map.insert(1, "a");
    assert_eq!(map.contains_key(&1), true);
    assert_eq!(map.contains_key(&2), false);

1.0.0 · Source

#### pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Available on crate features `cluster` and `cluster-async` only.

Returns a mutable reference to the value corresponding to the key.

The key may be any borrowed form of the map’s key type, but `Hash` and `Eq` on the borrowed form must match those for the key type.

##### §Examples

    use std::collections::HashMap;

    let mut map = HashMap::new();
    map.insert(1, "a");
    if let Some(x) = map.get_mut(&1) {
        *x = "b";
    }
    assert_eq!(map[&1], "b");

1.0.0 · Source

#### pub fn insert(&mut self, k: K, v: V) -> Option<V>

Available on crate features `cluster` and `cluster-async` only.

Inserts a key-value pair into the map.

If the map did not have this key present, `None` is returned.

If the map did have this key present, the value is updated, and the old value is returned. The key is not updated, though; this matters for types that can be `==` without being identical. See the module-level documentation for more.

##### §Examples

    use std::collections::HashMap;

    let mut map = HashMap::new();
    assert_eq!(map.insert(37, "a"), None);
    assert_eq!(map.is_empty(), false);

    map.insert(37, "b");
    assert_eq!(map.insert(37, "c"), Some("b"));
    assert_eq!(map[&37], "c");

Source

#### pub fn try_insert( &mut self, key: K, value: V, ) -> Result<&mut V, OccupiedError<'_, K, V, A>>

🔬This is a nightly-only experimental API. (`map_try_insert`)
Available on crate features `cluster` and `cluster-async` only.

Tries to insert a key-value pair into the map, and returns a mutable reference to the value in the entry.

If the map already had this key present, nothing is updated, and an error containing the occupied entry and the value is returned.

##### §Examples

Basic usage:

    #![feature(map_try_insert)]

    use std::collections::HashMap;

    let mut map = HashMap::new();
    assert_eq!(map.try_insert(37, "a").unwrap(), &"a");

    let err = map.try_insert(37, "b").unwrap_err();
    assert_eq!(err.entry.key(), &37);
    assert_eq!(err.entry.get(), &"a");
    assert_eq!(err.value, "b");

1.0.0 · Source

#### pub fn remove<Q>(&mut self, k: &Q) -> Option<V>
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Available on crate features `cluster` and `cluster-async` only.

Removes a key from the map, returning the value at the key if the key was previously in the map.

The key may be any borrowed form of the map’s key type, but `Hash` and `Eq` on the borrowed form must match those for the key type.

##### §Examples

    use std::collections::HashMap;

    let mut map = HashMap::new();
    map.insert(1, "a");
    assert_eq!(map.remove(&1), Some("a"));
    assert_eq!(map.remove(&1), None);

1.27.0 · Source

#### pub fn remove_entry<Q>(&mut self, k: &Q) -> Option<(K, V)>
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Available on crate features `cluster` and `cluster-async` only.

Removes a key from the map, returning the stored key and value if the key was previously in the map.

The key may be any borrowed form of the map’s key type, but `Hash` and `Eq` on the borrowed form must match those for the key type.

##### §Examples

    use std::collections::HashMap;

    let mut map = HashMap::new();
    map.insert(1, "a");
    assert_eq!(map.remove_entry(&1), Some((1, "a")));
    assert_eq!(map.remove(&1), None);

## Trait Implementations§

Source§

### impl Clone for InfoDict

Source§

#### fn clone(&self) -> InfoDict

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from `source`. Read more
Source§

### impl Debug for InfoDict

Source§

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

Formats the value using the given formatter. Read more
Source§

### impl Deref for InfoDict

Source§

#### type Target = AHashMap<String, Value>

The resulting type after dereferencing.
Source§

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

Dereferences the value.
Source§

### impl FromRedisValue for InfoDict

Source§

#### fn from_redis_value_ref(v: &Value) -> Result<InfoDict, ParsingError>

Given a redis `Value` this attempts to convert it into the given destination type. If that fails because it’s not compatible an appropriate error is generated.
Source§

#### fn from_redis_value(v: Value) -> Result<InfoDict, ParsingError>

Given a redis `Value` this attempts to convert it into the given destination type. If that fails because it’s not compatible an appropriate error is generated.
Source§

#### fn from_redis_value_refs(items: &[Value]) -> Result<Vec<Self>, ParsingError>

Similar to `from_redis_value_ref` but constructs a vector of objects from another vector of values. This primarily exists internally to customize the behavior for vectors of tuples.
Source§

#### fn from_redis_values(items: Vec<Value>) -> Result<Vec<Self>, ParsingError>

The same as `from_redis_value_refs`, but takes a `Vec<Value>` instead of a `&[Value]`.
Source§

#### fn from_each_redis_values(items: Vec<Value>) -> Vec<Result<Self, ParsingError>>

The same as `from_redis_values`, but returns a result for each conversion to make handling them case-by-case possible.
Source§

#### fn from_byte_slice(_vec: &[u8]) -> Option<Vec<Self>>

Convert bytes to a single element vector.
Source§

#### fn from_byte_vec(_vec: Vec<u8>) -> Result<Vec<Self>, ParsingError>

Convert bytes to a single element vector.

## Auto Trait Implementations§

§

### impl Freeze for InfoDict

§

### impl RefUnwindSafe for InfoDict

§

### impl Send for InfoDict

§

### impl Sync for InfoDict

§

### impl Unpin for InfoDict

§

### impl UnwindSafe for InfoDict

## Blanket Implementations§

Source§

### impl<T> Any for T
where T: 'static + ?Sized,

Source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
Source§

### impl<T> Borrow<T> for T
where T: ?Sized,

Source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

### impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

#### fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

### impl<T> CloneToUninit for T
where T: Clone,

Source§

#### unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (`clone_to_uninit`)
Performs copy-assignment from `self` to `dest`. Read more
Source§

### impl<T> DynClone for T
where T: Clone,

Source§

#### fn __clone_box(&self, _: Private) -> *mut ()

Source§

### impl<T> From<T> for T

Source§

#### fn from(t: T) -> T

Returns the argument unchanged.

§

### impl<T> Instrument for T

§

#### fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [`Span`], returning an `Instrumented` wrapper. Read more
§

#### fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current `Span`, returning an `Instrumented` wrapper. Read more
Source§

### impl<T, U> Into<U> for T
where U: From<T>,

Source§

#### fn into(self) -> U

Calls `U::from(self)`.

That is, this conversion is whatever the implementation of `From<T> for U` chooses to do.

§

### impl<T> PolicyExt for T
where T: ?Sized,

§

#### fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new `Policy` that returns [`Action::Follow`] only if `self` and `other` return `Action::Follow`. Read more
§

#### fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new `Policy` that returns [`Action::Follow`] if either `self` or `other` returns `Action::Follow`. Read more
Source§

### impl<P, T> Receiver for P
where P: Deref<Target = T> + ?Sized, T: ?Sized,

Source§

#### type Target = T

🔬This is a nightly-only experimental API. (`arbitrary_self_types`)
The target type on which the method may be called.
Source§

### impl<T> ToOwned for T
where T: Clone,

Source§

#### type Owned = T

The resulting type after obtaining ownership.
Source§

#### fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

#### fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

### impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

#### type Error = Infallible

The type returned in the event of a conversion error.
Source§

#### fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

### impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

#### type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

#### fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

### impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

#### fn vzip(self) -> V

§

### impl<T> WithSubscriber for T

§

#### fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided `Subscriber` to this type, returning a [`WithDispatch`] wrapper. Read more
§

#### fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default `Subscriber` to this type, returning a [`WithDispatch`] wrapper. Read more
§

### impl<T> ErasedDestructor for T
where T: 'static,

§

### impl<T> MaybeSendSync for T