pub struct Vocab {
pub labels: Vec<LabelInfo>,
pub edges: Vec<EdgeInfo>,
}Expand description
What a plane holds, as far as completing a query needs to know: the soft-schema catalog, which a server has already computed.
Counts are what make one suggestion better than another, so they are part
of the vocabulary rather than an afterthought. An empty Vocab is
perfectly usable — completion falls back to the language’s own keywords and
to (n), which names no label and so cannot be wrong.
Fields§
§labels: Vec<LabelInfo>§edges: Vec<EdgeInfo>Trait Implementations§
impl Eq for Vocab
impl StructuralPartialEq for Vocab
Auto Trait Implementations§
impl Freeze for Vocab
impl RefUnwindSafe for Vocab
impl Send for Vocab
impl Sync for Vocab
impl Unpin for Vocab
impl UnsafeUnpin for Vocab
impl UnwindSafe for Vocab
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
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
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§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.