Struct LemmaSpecSet 

pub struct LemmaSpecSet {
    pub repository: Arc<LemmaRepository>,
    pub name: String,
    /* private fields */
}

All spec versions sharing a (repository, name) identity, keyed by effective_from.

The owning LemmaRepository is held by Arc so the set carries repository identity as a real memory reference instead of relying on string parsing.

Fields

repository: Arc<LemmaRepository>

name: String

Implementations

impl LemmaSpecSet

pub fn new(repository: Arc<LemmaRepository>, name: String) -> Self

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn first(&self) -> Option<&Arc<LemmaSpec>>

pub fn get_exact( &self, effective_from: Option<&DateTimeValue>, ) -> Option<&Arc<LemmaSpec>>

Exact identity by effective_from key.

pub fn insert(&mut self, spec: Arc<LemmaSpec>) -> bool

Insert a spec. Returns false if the same effective_from already exists.

pub fn remove(&mut self, effective_from: Option<&DateTimeValue>) -> bool

Remove by effective_from key. Returns whether a row was removed.

pub fn iter_specs(&self) -> impl Iterator<Item = Arc<LemmaSpec>> + '_

pub fn iter_with_ranges( &self, ) -> impl Iterator<Item = (Arc<LemmaSpec>, Option<DateTimeValue>, Option<DateTimeValue>)> + '_

Every spec paired with its half-open [effective_from, effective_to) range.

• effective_from = None on the first row means no earlier version exists.
• effective_to = None on the last row means no successor (this is the latest loaded version; its validity is unbounded forward).
• Otherwise effective_to equals the next row’s effective_from (exclusive end of this row’s validity).

Iteration order matches Self::iter_specs (ascending by effective_from).

pub fn specs_iter(&self) -> impl Iterator<Item = &Arc<LemmaSpec>> + '_

Borrowed iteration in key order (for planning loops without allocating a Vec).

pub fn spec_at(&self, effective: &EffectiveDate) -> Option<Arc<LemmaSpec>>

Spec active at effective. Each spec covers [effective_from, next.effective_from). The last spec covers [effective_from, +∞).

pub fn effective_range( &self, spec: &Arc<LemmaSpec>, ) -> (Option<DateTimeValue>, Option<DateTimeValue>)

Returns the effective range [from, to) for a spec in this set.

• from: spec.effective_from() (None = -∞)
• to: next temporal version’s effective_from, or None (+∞) if no successor.

pub fn temporal_boundaries(&self) -> Vec<DateTimeValue>

All effective_from dates, sorted ascending. Specs without effective_from excluded (-∞).

pub fn effective_dates( &self, spec: &Arc<LemmaSpec>, context: &Context, ) -> Vec<EffectiveDate>

Global effective dates filtered to the [eff_from, eff_to) validity range of spec.

pub fn coverage_gaps( &self, required_from: Option<&DateTimeValue>, required_to: Option<&DateTimeValue>, ) -> Vec<(Option<DateTimeValue>, Option<DateTimeValue>)>

Gaps where this spec set’s specs do not cover [required_from, required_to).

Start: None = −∞, end: None = +∞. Empty result means full coverage. When the set is empty, the entire required range is one gap.

Trait Implementations

impl Clone for LemmaSpecSet

fn clone(&self) -> LemmaSpecSet

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LemmaSpecSet

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Serialize for LemmaSpecSet

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.