pub struct SortedHashMapDebugOutput<'a, K, V>(_);
Expand description
A wrapper for HashMap
which sorts itself for Debug
output
You probably want to use a [BTreeMap
] if you want your data to be sorted, but if
outputting is rare (or is only included transiently for debugging purposes), it may make
more sense to use this trait instead of changing the underlying type.
Also see SortedOutputExt
for a syntactically cleaner method of constructing this type.
Trait Implementations
Auto Trait Implementations
impl<'a, K, V> RefUnwindSafe for SortedHashMapDebugOutput<'a, K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<'a, K, V> Send for SortedHashMapDebugOutput<'a, K, V>where
K: Sync,
V: Sync,
impl<'a, K, V> Sync for SortedHashMapDebugOutput<'a, K, V>where
K: Sync,
V: Sync,
impl<'a, K, V> Unpin for SortedHashMapDebugOutput<'a, K, V>
impl<'a, K, V> UnwindSafe for SortedHashMapDebugOutput<'a, K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more