pub struct ThreadOrder {
pub newest: bool,
pub reverse: bool,
}Expand description
Like thread, ordering threads by their newest message when
newest (mutt’s sort_aux = last-date-sent).
How the threads themselves are ordered, from mutt’s $sort_aux:
by the root’s date or by the newest message under it, oldest
first or newest first.
Fields§
§newest: boolmutt’s last-: order a thread by its newest message rather
than by its root.
reverse: boolmutt’s reverse-: the newest thread first.
Implementations§
Source§impl ThreadOrder
impl ThreadOrder
Sourcepub fn parse(spec: &str) -> ThreadOrder
pub fn parse(spec: &str) -> ThreadOrder
mutt’s $sort_aux, as far as threads care: everything else is a date order under another name.
Trait Implementations§
Source§impl Clone for ThreadOrder
impl Clone for ThreadOrder
impl Copy for ThreadOrder
Source§impl Debug for ThreadOrder
impl Debug for ThreadOrder
Source§impl Default for ThreadOrder
impl Default for ThreadOrder
impl Eq for ThreadOrder
Source§impl PartialEq for ThreadOrder
impl PartialEq for ThreadOrder
impl StructuralPartialEq for ThreadOrder
Auto Trait Implementations§
impl Freeze for ThreadOrder
impl RefUnwindSafe for ThreadOrder
impl Send for ThreadOrder
impl Sync for ThreadOrder
impl Unpin for ThreadOrder
impl UnsafeUnpin for ThreadOrder
impl UnwindSafe for ThreadOrder
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.