pub struct PathMap(/* private fields */);Expand description
Path mapping for conditional edges
Maps router return values to target node names. Used for validation and graph visualization.
§Examples
use juncture_core::edge::PathMap;
use std::collections::HashMap;
// From HashMap
let mut map = HashMap::new();
map.insert("approve".to_string(), "publish".to_string());
map.insert("reject".to_string(), "archive".to_string());
let path_map = PathMap::from(map);
// From slice
let path_map = PathMap::from(&[("approve", "publish"), ("reject", "archive")][..]);Implementations§
Trait Implementations§
impl Eq for PathMap
impl StructuralPartialEq for PathMap
Auto Trait Implementations§
impl Freeze for PathMap
impl RefUnwindSafe for PathMap
impl Send for PathMap
impl Sync for PathMap
impl Unpin for PathMap
impl UnsafeUnpin for PathMap
impl UnwindSafe for PathMap
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.