Trait InteractsWithData 

pub trait InteractsWithData {
    type Value;
    type Item;

    // Required method
    fn data(&self) -> &Self::Value;

    // Provided methods
    fn all(&self) -> Self::Value
       where Self::Value: Clone { ... }
    fn exists(&self, key: &Self::Item) -> bool
       where Self::Value: Contains<Self::Item> { ... }
    fn has(&self, key: &Self::Item) -> bool
       where Self::Value: Contains<Self::Item> { ... }
    fn when_has<F>(&mut self, key: &Self::Item, closure: F)
       where Self::Value: Contains<Self::Item>,
             F: FnMut(&mut Self) { ... }
    fn filled(&self, key: &Self::Item) -> bool { ... }
    fn is_not_filled(&self, key: &Self::Item) -> bool { ... }
    fn any_filled(&self, keys: Vec<&Self::Item>) -> bool { ... }
}

Required Associated Types

type Value

type Item

Required Methods

fn data(&self) -> &Self::Value

Get the data for the container.

Provided Methods

fn all(&self) -> Self::Value

where Self::Value: Clone,

Get all of the data

fn exists(&self, key: &Self::Item) -> bool

where Self::Value: Contains<Self::Item>,

Does the data container the key?

fn has(&self, key: &Self::Item) -> bool

where Self::Value: Contains<Self::Item>,

Does the data contain the key?

fn when_has<F>(&mut self, key: &Self::Item, closure: F)

where Self::Value: Contains<Self::Item>, F: FnMut(&mut Self),

Execute the closure when the instnce contains the given key.

fn filled(&self, key: &Self::Item) -> bool

Determine if the instance contains a non-empty value for the key.

fn is_not_filled(&self, key: &Self::Item) -> bool

Determine if the instance contains an empty value for the key.

fn any_filled(&self, keys: Vec<&Self::Item>) -> bool

Do any of the given keys contain a non-empty value?

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl<K: Eq + Hash, V: BuildHasher> InteractsWithData for HashSet<K, V>

type Value = HashSet<K, V>

type Item = K

fn data(&self) -> &Self::Value

impl<K: Eq + Hash, V> InteractsWithData for BTreeMap<K, V>

type Value = BTreeMap<K, V>

type Item = K

fn data(&self) -> &Self::Value

impl<K: Eq + Hash, V> InteractsWithData for HashMap<K, V>

type Value = HashMap<K, V>

type Item = K

fn data(&self) -> &Self::Value

impl<T, const N: usize> InteractsWithData for [T; N]

type Value = [T; N]

type Item = T

fn data(&self) -> &Self::Value

impl<T: Clone + PartialEq> InteractsWithData for Option<T>

type Value = Option<T>

type Item = T

fn data(&self) -> &Self::Value

fn exists(&self, key: &Self::Item) -> bool

impl<T: Clone + PartialEq> InteractsWithData for Vec<T>

type Value = Vec<T>

type Item = T

fn data(&self) -> &Self::Value

impl<T: Clone + PartialEq> InteractsWithData for VecDeque<T>

type Value = VecDeque<T>

type Item = T

fn data(&self) -> &Self::Value

impl<T: PartialEq, E> InteractsWithData for Result<T, E>

type Value = Result<T, E>

type Item = T

fn data(&self) -> &Self::Value

fn exists(&self, key: &Self::Item) -> bool

impl<T> InteractsWithData for LinkedList<T>

type Value = LinkedList<T>

type Item = T

fn data(&self) -> &Self::Value

Implementors