pub enum AnyNodeMode {
Separate,
Single,
}Expand description
CIP-257’s “Future improvements” any-node keyword, controlling how many
synthetic (:AnyLabel {}) nodes an unconstrained relationship endpoint
gets: Separate (the default, whether or not the keyword is written) –
one any-node per relationship that needs one; Single – every
unconstrained endpoint across the whole graph type shares one any-node.
Variants§
Trait Implementations§
Source§impl Clone for AnyNodeMode
impl Clone for AnyNodeMode
impl Copy for AnyNodeMode
Source§impl Debug for AnyNodeMode
impl Debug for AnyNodeMode
Source§impl Default for AnyNodeMode
impl Default for AnyNodeMode
impl Eq for AnyNodeMode
Source§impl PartialEq for AnyNodeMode
impl PartialEq for AnyNodeMode
impl StructuralPartialEq for AnyNodeMode
Auto Trait Implementations§
impl Forget for AnyNodeMode
impl Freeze for AnyNodeMode
impl Move for AnyNodeMode
impl RefUnwindSafe for AnyNodeMode
impl Send for AnyNodeMode
impl Sync for AnyNodeMode
impl Unpin for AnyNodeMode
impl UnsafeUnpin for AnyNodeMode
impl UnwindSafe for AnyNodeMode
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.