Struct non_std::dependencies::former::dependency::former_runtime::HashMapFormer

[−]

pub struct HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
    K: Eq + Hash,
    HashMap: HashMapLike<K, E> + Default,
    ContainerEnd: for<'_> Fn(&mut Former, Option<HashMap>),  { /* private fields */ }

Expand description

Class for forming hashmap-like fields.

Implementations

impl<K, E, HashMap, Former, ContainerEnd> HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
 K: Eq + Hash,
 HashMap: HashMapLike<K, E> + Default,
 ContainerEnd: for<'_> Fn(&mut Former, Option<HashMap>),

pub fn new(
 former: Former,
 container: Option<HashMap>,
 on_end: ContainerEnd
) -> HashMapFormer<K, E, HashMap, Former, ContainerEnd>

Make a new HashMapFormer. It should be called by a former generated for your structure.

pub fn replace(
self,
container: HashMap
) -> HashMapFormer<K, E, HashMap, Former, ContainerEnd>

Set the whole container instead of setting each element individually.

pub fn end(self) -> Former

Return former of your struct moving container there. Should be called after configuring the container.

pub fn insert<K2, E2>(
 self,
 k: K2,
 e: E2
) -> HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
 K2: Into<K>,
 E2: Into<E>,

Inserts a key-value pair into the map. Make a new container if it was not made so far.

Trait Implementations

impl<K, E, HashMap, Former, ContainerEnd> Debug for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
 K: Debug + Eq + Hash,
 E: Debug,
 HashMap: Debug + HashMapLike<K, E> + Default,
 Former: Debug,
 ContainerEnd: Debug + for<'_> Fn(&mut Former, Option<HashMap>),

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

Formats the value using the given formatter. Read more

impl<K, E, HashMap, Former, ContainerEnd> Default for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
 K: Default + Eq + Hash,
 E: Default,
 HashMap: Default + HashMapLike<K, E>,
 Former: Default,
 ContainerEnd: Default + for<'_> Fn(&mut Former, Option<HashMap>),

fn default() -> HashMapFormer<K, E, HashMap, Former, ContainerEnd>

Returns the “default value” for a type. Read more

Auto Trait Implementations

impl<K, E, HashMap, Former, ContainerEnd> RefUnwindSafe for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
 ContainerEnd: RefUnwindSafe,
 E: RefUnwindSafe,
 Former: RefUnwindSafe,
 HashMap: RefUnwindSafe,
 K: RefUnwindSafe,

impl<K, E, HashMap, Former, ContainerEnd> Send for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
 ContainerEnd: Send,
 E: Send,
 Former: Send,
 HashMap: Send,
 K: Send,

impl<K, E, HashMap, Former, ContainerEnd> Sync for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
 ContainerEnd: Sync,
 E: Sync,
 Former: Sync,
 HashMap: Sync,
 K: Sync,

impl<K, E, HashMap, Former, ContainerEnd> Unpin for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
 ContainerEnd: Unpin,
 E: Unpin,
 Former: Unpin,
 HashMap: Unpin,
 K: Unpin,

impl<K, E, HashMap, Former, ContainerEnd> UnwindSafe for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
 ContainerEnd: UnwindSafe,
 E: UnwindSafe,
 Former: UnwindSafe,
 HashMap: UnwindSafe,
 K: UnwindSafe,

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,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · 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.

source

impl<T> IntoResult<T> for T

type Err = Infallible

source

fn into_result(self) -> Result<T, <T as IntoResult<T>>::Err>

source

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

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<Target, Original> VectorizedInto<Target> for Original where
Target: VectorizedFrom<Original>,

source

fn vectorized_into(self) -> Target

Performs the conversion.

Struct non_std::dependencies::former::dependency::former_runtime::HashMapFormer

Implementations

impl<K, E, HashMap, Former, ContainerEnd> HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
    K: Eq + Hash,
    HashMap: HashMapLike<K, E> + Default,
    ContainerEnd: for<'_> Fn(&mut Former, Option<HashMap>),

pub fn new(
    former: Former,
    container: Option<HashMap>,
    on_end: ContainerEnd
) -> HashMapFormer<K, E, HashMap, Former, ContainerEnd>

pub fn replace(
self,
container: HashMap
) -> HashMapFormer<K, E, HashMap, Former, ContainerEnd>

pub fn end(self) -> Former

pub fn insert<K2, E2>(
    self,
    k: K2,
    e: E2
) -> HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
    K2: Into<K>,
    E2: Into<E>,

Trait Implementations

impl<K, E, HashMap, Former, ContainerEnd> Debug for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
    K: Debug + Eq + Hash,
    E: Debug,
    HashMap: Debug + HashMapLike<K, E> + Default,
    Former: Debug,
    ContainerEnd: Debug + for<'_> Fn(&mut Former, Option<HashMap>),

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

impl<K, E, HashMap, Former, ContainerEnd> Default for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
    K: Default + Eq + Hash,
    E: Default,
    HashMap: Default + HashMapLike<K, E>,
    Former: Default,
    ContainerEnd: Default + for<'_> Fn(&mut Former, Option<HashMap>),

fn default() -> HashMapFormer<K, E, HashMap, Former, ContainerEnd>

Auto Trait Implementations

impl<K, E, HashMap, Former, ContainerEnd> RefUnwindSafe for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
    ContainerEnd: RefUnwindSafe,
    E: RefUnwindSafe,
    Former: RefUnwindSafe,
    HashMap: RefUnwindSafe,
    K: RefUnwindSafe,

impl<K, E, HashMap, Former, ContainerEnd> Send for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
    ContainerEnd: Send,
    E: Send,
    Former: Send,
    HashMap: Send,
    K: Send,

impl<K, E, HashMap, Former, ContainerEnd> Sync for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
    ContainerEnd: Sync,
    E: Sync,
    Former: Sync,
    HashMap: Sync,
    K: Sync,

impl<K, E, HashMap, Former, ContainerEnd> Unpin for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
    ContainerEnd: Unpin,
    E: Unpin,
    Former: Unpin,
    HashMap: Unpin,
    K: Unpin,

impl<K, E, HashMap, Former, ContainerEnd> UnwindSafe for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
    ContainerEnd: UnwindSafe,
    E: UnwindSafe,
    Former: UnwindSafe,
    HashMap: UnwindSafe,
    K: UnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T> IntoResult<T> for T

type Err = Infallible

fn into_result(self) -> Result<T, <T as IntoResult<T>>::Err>

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

type Error = Infallible

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

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

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

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

impl<Target, Original> VectorizedInto<Target> for Original where
Target: VectorizedFrom<Original>,

fn vectorized_into(self) -> Target

Struct non_std::dependencies::former::dependency::former_runtime::HashMapFormer

Implementations

impl<K, E, HashMap, Former, ContainerEnd> HashMapFormer<K, E, HashMap, Former, ContainerEnd> where K: Eq + Hash, HashMap: HashMapLike<K, E> + Default, ContainerEnd: for<'_> Fn(&mut Former, Option<HashMap>),

pub fn new( former: Former, container: Option<HashMap>, on_end: ContainerEnd) -> HashMapFormer<K, E, HashMap, Former, ContainerEnd>

pub fn replace( self, container: HashMap) -> HashMapFormer<K, E, HashMap, Former, ContainerEnd>

pub fn end(self) -> Former

pub fn insert<K2, E2>( self, k: K2, e: E2) -> HashMapFormer<K, E, HashMap, Former, ContainerEnd> where K2: Into<K>, E2: Into<E>,

Trait Implementations

impl<K, E, HashMap, Former, ContainerEnd> Debug for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where K: Debug + Eq + Hash, E: Debug, HashMap: Debug + HashMapLike<K, E> + Default, Former: Debug, ContainerEnd: Debug + for<'_> Fn(&mut Former, Option<HashMap>),

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

impl<K, E, HashMap, Former, ContainerEnd> Default for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where K: Default + Eq + Hash, E: Default, HashMap: Default + HashMapLike<K, E>, Former: Default, ContainerEnd: Default + for<'_> Fn(&mut Former, Option<HashMap>),

fn default() -> HashMapFormer<K, E, HashMap, Former, ContainerEnd>

Auto Trait Implementations

impl<K, E, HashMap, Former, ContainerEnd> RefUnwindSafe for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where ContainerEnd: RefUnwindSafe, E: RefUnwindSafe, Former: RefUnwindSafe, HashMap: RefUnwindSafe, K: RefUnwindSafe,

impl<K, E, HashMap, Former, ContainerEnd> Send for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where ContainerEnd: Send, E: Send, Former: Send, HashMap: Send, K: Send,

impl<K, E, HashMap, Former, ContainerEnd> Sync for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where ContainerEnd: Sync, E: Sync, Former: Sync, HashMap: Sync, K: Sync,

impl<K, E, HashMap, Former, ContainerEnd> Unpin for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where ContainerEnd: Unpin, E: Unpin, Former: Unpin, HashMap: Unpin, K: Unpin,

impl<K, E, HashMap, Former, ContainerEnd> UnwindSafe for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where ContainerEnd: UnwindSafe, E: UnwindSafe, Former: UnwindSafe, HashMap: UnwindSafe, K: UnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T> IntoResult<T> for T

type Err = Infallible

fn into_result(self) -> Result<T, <T as IntoResult<T>>::Err>

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

type Error = Infallible

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

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

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

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

impl<Target, Original> VectorizedInto<Target> for Original where Target: VectorizedFrom<Original>,

fn vectorized_into(self) -> Target

impl<K, E, HashMap, Former, ContainerEnd> HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
K: Eq + Hash,
HashMap: HashMapLike<K, E> + Default,
ContainerEnd: for<'_> Fn(&mut Former, Option<HashMap>),

pub fn new(
former: Former,
container: Option<HashMap>,
on_end: ContainerEnd
) -> HashMapFormer<K, E, HashMap, Former, ContainerEnd>

pub fn replace(
self,
container: HashMap
) -> HashMapFormer<K, E, HashMap, Former, ContainerEnd>

pub fn insert<K2, E2>(
self,
k: K2,
e: E2
) -> HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
K2: Into<K>,
E2: Into<E>,

impl<K, E, HashMap, Former, ContainerEnd> Debug for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
K: Debug + Eq + Hash,
E: Debug,
HashMap: Debug + HashMapLike<K, E> + Default,
Former: Debug,
ContainerEnd: Debug + for<'_> Fn(&mut Former, Option<HashMap>),

impl<K, E, HashMap, Former, ContainerEnd> Default for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
K: Default + Eq + Hash,
E: Default,
HashMap: Default + HashMapLike<K, E>,
Former: Default,
ContainerEnd: Default + for<'_> Fn(&mut Former, Option<HashMap>),

impl<K, E, HashMap, Former, ContainerEnd> RefUnwindSafe for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
ContainerEnd: RefUnwindSafe,
E: RefUnwindSafe,
Former: RefUnwindSafe,
HashMap: RefUnwindSafe,
K: RefUnwindSafe,

impl<K, E, HashMap, Former, ContainerEnd> Send for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
ContainerEnd: Send,
E: Send,
Former: Send,
HashMap: Send,
K: Send,

impl<K, E, HashMap, Former, ContainerEnd> Sync for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
ContainerEnd: Sync,
E: Sync,
Former: Sync,
HashMap: Sync,
K: Sync,

impl<K, E, HashMap, Former, ContainerEnd> Unpin for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
ContainerEnd: Unpin,
E: Unpin,
Former: Unpin,
HashMap: Unpin,
K: Unpin,

impl<K, E, HashMap, Former, ContainerEnd> UnwindSafe for HashMapFormer<K, E, HashMap, Former, ContainerEnd> where
ContainerEnd: UnwindSafe,
E: UnwindSafe,
Former: UnwindSafe,
HashMap: UnwindSafe,
K: UnwindSafe,

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

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

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

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

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

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

impl<Target, Original> VectorizedInto<Target> for Original where
Target: VectorizedFrom<Original>,