pub enum Found<'a> {
Records(&'a Value),
Nothing,
Unknown(&'a str),
}Expand description
What reading one declared lookup established.
Three cases, and the third is the one that decides the design: a reader that turned “somebody’s server did not answer” into a value would have a rule refuse, or permit, on a fact nobody established. So the reader says it does not know, and each statement declares what an unknown means for itself.
Variants§
Records(&'a Value)
The records found: an array, each element {"uri": …, "value": …}.
A lookup naming one record finds at most one; a lookup naming a
collection finds every record in it. One shape means a statement
reads both the same way, and each uri is what a refusal carries so
a person can open the record it came from.
Nothing
The repository answered, and holds nothing there.
Unknown(&'a str)
Neither was established, carrying the short word the reader named the case with: not fetched, past its deadline, refused, unresolvable, unreachable.
Trait Implementations§
impl<'a> Copy for Found<'a>
impl<'a> Eq for Found<'a>
impl<'a> StructuralPartialEq for Found<'a>
Auto Trait Implementations§
impl<'a> Freeze for Found<'a>
impl<'a> RefUnwindSafe for Found<'a>
impl<'a> Send for Found<'a>
impl<'a> Sync for Found<'a>
impl<'a> Unpin for Found<'a>
impl<'a> UnsafeUnpin for Found<'a>
impl<'a> UnwindSafe for Found<'a>
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,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.