pub struct GraphTypeInlineConstraint {
pub verb: GraphTypeInlineVerb,
pub qualifier: Option<GraphTypeEntityQualifier>,
}Expand description
An inline property-type constraint ({prop :: TYPE IS [qualifier] KEY|UNIQUE}). qualifier records which (if any) NODE/REL/
RELATIONSHIP keyword was written, so the graph-type validator can
enforce that a node type must not contain REL/
RELATIONSHIP; an edge type must not contain NODE.
Fields§
§verb: GraphTypeInlineVerb§qualifier: Option<GraphTypeEntityQualifier>Trait Implementations§
Source§impl Clone for GraphTypeInlineConstraint
impl Clone for GraphTypeInlineConstraint
impl Copy for GraphTypeInlineConstraint
Source§impl Debug for GraphTypeInlineConstraint
impl Debug for GraphTypeInlineConstraint
impl Eq for GraphTypeInlineConstraint
impl StructuralPartialEq for GraphTypeInlineConstraint
Auto Trait Implementations§
impl Forget for GraphTypeInlineConstraint
impl Freeze for GraphTypeInlineConstraint
impl Move for GraphTypeInlineConstraint
impl RefUnwindSafe for GraphTypeInlineConstraint
impl Send for GraphTypeInlineConstraint
impl Sync for GraphTypeInlineConstraint
impl Unpin for GraphTypeInlineConstraint
impl UnsafeUnpin for GraphTypeInlineConstraint
impl UnwindSafe for GraphTypeInlineConstraint
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
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§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.