pub enum TimeGroup {
All,
Issue(u32),
Assignee(String),
Unattributed,
Date(String),
Undated,
}Expand description
The dimension a total is grouped by (T014).
The variants are ordered so that a breakdown comes out of a BTreeMap in the
order a reader expects — everything first, then issues ascending, then identities,
then unattributed entries, then dates ascending, undated last — without a second
sort key to keep in step.
Identity groups compare through identity_cmp, so ada and Ada are one
group; Ord and PartialEq are written together here so that two groups that
order equal also compare equal, which the crate’s other Ord implementations are
equally careful about (TimeEntry among them).
Variants§
All
The whole scope, ungrouped.
Issue(u32)
One issue’s entries.
Assignee(String)
One identity’s entries, keyed by canonical identity.
Unattributed
Entries whose author names no identity, so they cannot be attributed to a person. They are shown, not dropped.
Date(String)
One calendar date’s entries.
Undated
Entries no period can place: no date, or a date the calendar validator
refuses (the entry is diagnosed as invalid_date in the same total).
Implementations§
Trait Implementations§
impl Eq for TimeGroup
Source§impl Ord for TimeGroup
impl Ord for TimeGroup
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
1.21.0 (const: unstable) · Source§fn min(self, other: Self) -> Selfwhere
Self: Sized,
fn min(self, other: Self) -> Selfwhere
Self: Sized,
Auto Trait Implementations§
impl Freeze for TimeGroup
impl RefUnwindSafe for TimeGroup
impl Send for TimeGroup
impl Sync for TimeGroup
impl Unpin for TimeGroup
impl UnsafeUnpin for TimeGroup
impl UnwindSafe for TimeGroup
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<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
key and return true if they are equal.Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more