pub struct Grouping {
pub keys: Vec<String>,
pub by: Option<Grain>,
}Expand description
What a view sorts records by — MoReq2010’s classification.
One shape, not a set of blessed kinds: an ordered chain of field keys, and
an optional grain to cut the chosen value at. See the module docs for why
there is no date variant.
Fields§
§keys: Vec<String>The field keys to read, in order — the first that carries a value wins,
and supplies all of that view’s group keys for the document.
Guaranteed non-empty by ViewSpec::parse.
by: Option<Grain>The grain the chosen value is cut at, or None to group on the value
itself.
Implementations§
Source§impl Grouping
impl Grouping
Sourcepub fn keys_of(&self, meta: &Value) -> Vec<String>
pub fn keys_of(&self, meta: &Value) -> Vec<String>
The group keys meta falls under — empty when no field in the chain
carries a usable value, which is the ungrouped bucket.
A sequence-valued field yields one key per element, so a letter about two people appears under both. That is the whole point of a view: the same document reached several ways, with retrieval decoupled from the single containment spine.
The chain stops at the first key that is present and non-empty, and
its values are used even if the grain rejects all of them. Falling
through to created because date_of_document held something
unparseable would silently file the document under a date it does not
claim; leaving it ungrouped shows the bad value instead.
Trait Implementations§
impl Eq for Grouping
impl StructuralPartialEq for Grouping
Auto Trait Implementations§
impl Freeze for Grouping
impl RefUnwindSafe for Grouping
impl Send for Grouping
impl Sync for Grouping
impl Unpin for Grouping
impl UnsafeUnpin for Grouping
impl UnwindSafe for Grouping
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> 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
key and return true if they are equal.