pub enum ContextRef<'a, T = IriBuf, B = BlankIdBuf> {
Borrowed(&'a Context<T, B>),
Owned(Box<Context<T, B>>),
}Expand description
Either a borrowed context or an owned one held behind a box.
Expansion and compaction repeatedly rebind an active context that may or may
not have been replaced by a processed one. A Cow-like type is the natural
fit, but Context is over 250 bytes and storing it inline makes every
async state machine holding one that much larger — the value is memmoved on
every recursion. Boxing the owned arm keeps this two words wide however
Context grows, at the cost of one allocation on a path that has just
built a whole context anyway.
Variants§
Borrowed(&'a Context<T, B>)
Borrowed from the caller.
Owned(Box<Context<T, B>>)
Owned by this value.
Implementations§
Source§impl<T, B> ContextRef<'_, T, B>
impl<T, B> ContextRef<'_, T, B>
Methods from Deref<Target = Context<T, B>>§
Sourcepub fn with_private_caches(&self) -> Context<T, B>
pub fn with_private_caches(&self) -> Context<T, B>
Returns a copy of this context whose IRI memoisation caches are private to the copy.
Self::term_resolution_cache maps a term to an already-resolved
Term, which carries T-typed identifiers. Sharing it across
vocabulary forks is unsound: a term that one fork resolved by interning
a new IRI would be served to another fork, where that identifier
denotes something else entirely — or nothing. Concurrent expansion
therefore gives each task a context of its own.
Only the caches are fresh. Definitions, prefix terms and keyword
aliases are shared through their Arcs: they are derived from the
context’s own definitions, whose identifiers every fork inherits, so
they stay valid. The same reasoning covers the inverse context.
Sourcepub fn processing_mode(&self) -> ProcessingMode
pub fn processing_mode(&self) -> ProcessingMode
Returns the processing mode this context was processed under.
Sourcepub fn get<Q>(&self, term: &Q) -> Option<TermDefinitionRef<'_, T, B>>
pub fn get<Q>(&self, term: &Q) -> Option<TermDefinitionRef<'_, T, B>>
Returns a reference to the given term definition, if any.
Sourcepub fn get_normal<Q>(&self, term: &Q) -> Option<&NormalTermDefinition<T, B>>
pub fn get_normal<Q>(&self, term: &Q) -> Option<&NormalTermDefinition<T, B>>
Returns a reference to the given term normal definition, if any.
Sourcepub fn get_type(&self) -> Option<&TypeTermDefinition>
pub fn get_type(&self) -> Option<&TypeTermDefinition>
Returns a reference to the @type definition, if any.
Sourcepub fn contains_term<Q>(&self, term: &Q) -> bool
pub fn contains_term<Q>(&self, term: &Q) -> bool
Checks if the given term is defined.
Sourcepub fn original_base_url(&self) -> Option<&T>
pub fn original_base_url(&self) -> Option<&T>
Returns the original base URL of the context.
Sourcepub fn vocabulary(&self) -> Option<&Term<T, B>>
pub fn vocabulary(&self) -> Option<&Term<T, B>>
Returns the @vocab value, if any.
Sourcepub fn default_language(&self) -> Option<&LenientLangTag>
pub fn default_language(&self) -> Option<&LenientLangTag>
Returns the default @language value.
Sourcepub fn default_base_direction(&self) -> Option<Direction>
pub fn default_base_direction(&self) -> Option<Direction>
Returns the default @direction value.
Sourcepub fn previous_context(&self) -> Option<&Self>
pub fn previous_context(&self) -> Option<&Self>
Returns a reference to the previous context.
Sourcepub fn definitions_arc_ptr(&self) -> *const Definitions<T, B>
pub fn definitions_arc_ptr(&self) -> *const Definitions<T, B>
Returns the address of the Arc backing the term definitions.
Two contexts that share this pointer share the exact same definitions
(copy-on-write via Arc::make_mut). Useful as a cheap fingerprint
for memoization keys.
Sourcepub fn previous_context_arc_ptr(&self) -> *const Self
pub fn previous_context_arc_ptr(&self) -> *const Self
Returns the address of the Arc backing the previous context, or null
when there is none. See Self::definitions_arc_ptr.
Sourcepub fn definitions(&self) -> &Definitions<T, B>
pub fn definitions(&self) -> &Definitions<T, B>
Returns a handle to the term definitions.
Sourcepub fn has_protected_items(&self) -> bool
pub fn has_protected_items(&self) -> bool
Checks if the context has a protected definition.
Sourcepub fn inverse(&self) -> &InverseContext<T, B>
pub fn inverse(&self) -> &InverseContext<T, B>
Returns the inverse context, computing and caching it on first access.
Sourcepub fn prefix_terms(&self) -> &[PrefixTerm<T, B>] ⓘ
pub fn prefix_terms(&self) -> &[PrefixTerm<T, B>] ⓘ
Returns the term definitions whose prefix flag is true, each paired
with its IRI mapping.
The mapping is carried alongside the key so that compaction’s candidate loop does not have to look the definition back up — which would re-hash the very key this list just handed it. Definitions with no IRI mapping cannot form a compact IRI and are left out.
Lazily computed and cached; invalidated whenever a definition is added, removed, or replaced.
Sourcepub fn compact_iri_cache(
&self,
) -> &ShardedMemo<CompactIriKey<T, B>, Option<Arc<str>>>
pub fn compact_iri_cache( &self, ) -> &ShardedMemo<CompactIriKey<T, B>, Option<Arc<str>>>
Returns the per-context memoization map for the compact-IRI algorithm.
The cache stores results keyed on (var, vocab, reverse, mode). It is
invalidated whenever the context’s term definitions, base IRI,
vocabulary, language, or direction change, since those affect
compaction output.
Sourcepub fn term_resolution_cache(&self) -> &ShardedMemo<Box<str>, Arc<Term<T, B>>>
pub fn term_resolution_cache(&self) -> &ShardedMemo<Box<str>, Arc<Term<T, B>>>
Returns the per-context memoization map for IRI expansion of term keys.
Maps the input string to the resolved Arc<Term>. Populated only by
the dominant key-expansion call shape (vocab=Some(Keep),
document_relative=false); other shapes bypass this cache. Invalidated
alongside the compact-IRI / inverse caches whenever the context’s term
definitions, base IRI, vocabulary, language, or direction change.
Sourcepub fn keyword_aliases_or_init<F: FnOnce() -> KeywordAliases>(
&self,
mode: ProcessingMode,
init: F,
) -> &KeywordAliases
pub fn keyword_aliases_or_init<F: FnOnce() -> KeywordAliases>( &self, mode: ProcessingMode, init: F, ) -> &KeywordAliases
Returns the cached keyword aliases of this context for the given
processing mode, computing them via init on first access. The
closure runs once per (context, mode); subsequent calls return the
cached value. Aliases are cached per mode because compact-IRI
selection is mode-dependent.
Trait Implementations§
Auto Trait Implementations§
impl<'a, T = Iri<String>, B = BlankIdBuf> !RefUnwindSafe for ContextRef<'a, T, B>
impl<'a, T = Iri<String>, B = BlankIdBuf> !UnwindSafe for ContextRef<'a, T, B>
impl<'a, T, B> Freeze for ContextRef<'a, T, B>
impl<'a, T, B> Send for ContextRef<'a, T, B>
impl<'a, T, B> Sync for ContextRef<'a, T, B>
impl<'a, T, B> Unpin for ContextRef<'a, T, B>
impl<'a, T, B> UnsafeUnpin for ContextRef<'a, T, B>
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> BorrowUnordered for T
impl<T> BorrowUnordered for T
Source§fn as_unordered(&self) -> &Unordered<T>
fn as_unordered(&self) -> &Unordered<T>
Unordered reference.