pub struct MergeMap<K, V>(/* private fields */);Expand description
Merge two HashMap<K, V>s, right-biased — entries from update
overwrite collisions in current. (Right-bias matches typical
LangGraph / dict-update semantics.)
Implementations§
Trait Implementations§
impl<K: Copy, V: Copy> Copy for MergeMap<K, V>
Auto Trait Implementations§
impl<K, V> Freeze for MergeMap<K, V>
impl<K, V> RefUnwindSafe for MergeMap<K, V>
impl<K, V> Send for MergeMap<K, V>
impl<K, V> Sync for MergeMap<K, V>
impl<K, V> Unpin for MergeMap<K, V>
impl<K, V> UnsafeUnpin for MergeMap<K, V>
impl<K, V> UnwindSafe for MergeMap<K, V>
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