Struct PropertySort 

pub struct PropertySort { /* private fields */ }

The property values a listing (sidebar, file finder) orders by: one async fetch per key, cached only while the list keeps sorting by that key (an Order / Group toggle reuses them; leaving the property sort or a failed read does not count as a cache). Results arrive on a channel the owner polls each frame; a result for a key the list no longer sorts by is dropped.

Implementations

impl PropertySort

pub fn values_for(&self, key: &str) -> Option<PropertyValues>

The cached values, if they are for key (compared in core’s search form, so Rank and rank share them).

pub fn values_for_field(&self, field: &SortField) -> Option<PropertyValues>

The cached values a listing sorted by field orders with: None for Name / Title, or while a property sort’s values are still awaited.

pub fn is_awaiting(&self, field: &SortField) -> bool

A property sort whose values have not landed yet — the listing keeps its current order until they do.

pub fn fetch(&mut self, vault: &Arc<NoteVault>, key: &str, tx: &AppTx)

Fetch key’s values in the background (a redraw follows the result). Values cached for another key are dropped; for the same key they stay in use until the fresh ones land. A blank key fetches nothing.

pub fn ensure(&mut self, vault: &Arc<NoteVault>, key: &str, tx: &AppTx)

Make key’s values available: fetch them unless a read for that key is in flight or succeeded while the list kept sorting by it (so Order / Group toggles reuse what was read). A list that reloads calls Self::fetch instead, so edits since the last read show up.

pub fn sync(&mut self, vault: &Arc<NoteVault>, field: &SortField, tx: &AppTx)

Follow a sort the list just applied: a property sort makes its values available (Self::ensure); Name / Title forget the cache, so coming back to a property later reads fresh values.

pub fn clear(&mut self)

Drop the cached values and any fetch in flight.

pub fn poll(&mut self) -> Option<(String, PropertyValues)>

Take a fetched result if one has landed, for the owner to hand to Self::receive (through its own re-sorting entry point).

pub fn receive(&mut self, key: &str, values: PropertyValues) -> bool

Accept values if they are for the key the list sorts by.

Trait Implementations

impl Default for PropertySort

fn default() -> Self

Returns the “default value” for a type.