pub struct LexPair<A: Ord, B: Ord> {
pub fst: A,
pub snd: B,
}Expand description
LexPair represents a lexicographically ordered pair.
Fields§
§fst: A§snd: BImplementations§
Trait Implementations§
Source§impl<A: Ord, B: Ord> Ord for LexPair<A, B>
impl<A: Ord, B: Ord> Ord for LexPair<A, B>
Source§impl<A: Ord, B: Ord> PartialOrd for LexPair<A, B>
impl<A: Ord, B: Ord> PartialOrd for LexPair<A, B>
impl<A: Eq + Ord, B: Eq + Ord> Eq for LexPair<A, B>
impl<A: Ord, B: Ord> StructuralPartialEq for LexPair<A, B>
Auto Trait Implementations§
impl<A, B> Freeze for LexPair<A, B>
impl<A, B> RefUnwindSafe for LexPair<A, B>where
A: RefUnwindSafe,
B: RefUnwindSafe,
impl<A, B> Send for LexPair<A, B>
impl<A, B> Sync for LexPair<A, B>
impl<A, B> Unpin for LexPair<A, B>
impl<A, B> UnsafeUnpin for LexPair<A, B>where
A: UnsafeUnpin,
B: UnsafeUnpin,
impl<A, B> UnwindSafe for LexPair<A, B>where
A: UnwindSafe,
B: UnwindSafe,
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