pub struct EdgePayload {
pub assertions: AssertionData,
pub traversal: Option<TraversalData>,
}Fields§
§assertions: AssertionDataAll retained assertions, including withdrawal tombstones. The legacy
SemanticData name is a source compatibility alias for the record store.
traversal: Option<TraversalData>Implementations§
Source§impl EdgePayload
impl EdgePayload
pub fn new() -> Self
pub fn assertions(&self) -> &[SemanticStatement]
pub fn held_assertions(&self) -> impl Iterator<Item = &SemanticStatement>
pub fn semantic_statements(&self) -> &[SemanticStatement]
pub fn held_semantic_statements( &self, ) -> impl Iterator<Item = &SemanticStatement>
pub fn semantic_data(&self) -> Option<SemanticDataView<'_>>
pub fn has_relation(&self, selector: RelationSelector) -> bool
Sourcepub fn assert_relation(&mut self, assertion: EdgeAssertion) -> bool
pub fn assert_relation(&mut self, assertion: EdgeAssertion) -> bool
Legacy membership ensure. A caller who has an independent reason uses the statement-aware Graph writer and its exact returned assertion ID.
pub fn is_empty(&self) -> bool
pub fn label(&self) -> Option<&str>
pub fn set_semantic_predicate(&mut self, predicate: Option<String>)
pub fn traversal_data(&self) -> Option<&TraversalData>
pub fn arrangement_data(&self) -> Option<ArrangementData>
pub fn containment_data(&self) -> Option<ContainmentData>
pub fn imported_data(&self) -> Option<ImportedData>
pub fn provenance_data(&self) -> Option<ProvenanceData>
pub fn has_arrangement_sub_kind(&self, kind: ArrangementSubKind) -> bool
pub fn has_durable_arrangement_relation(&self) -> bool
pub fn has_session_arrangement_relation(&self) -> bool
pub fn traversals(&self) -> &[Traversal]
pub fn metrics(&self) -> EdgeMetrics
pub fn push_traversal(&mut self, traversal: Traversal)
pub fn families(&self) -> BTreeSet<EdgeFamily>
pub fn has_held_topology(&self) -> bool
Trait Implementations§
Source§impl Archive for EdgePayload
impl Archive for EdgePayload
Source§const COPY_OPTIMIZATION: CopyOptimization<Self>
const COPY_OPTIMIZATION: CopyOptimization<Self>
An optimization flag that allows the bytes of this type to be copied
directly to a writer instead of calling
serialize. Read moreSource§type Archived = ArchivedEdgePayload
type Archived = ArchivedEdgePayload
The archived representation of this type. Read more
Source§type Resolver = EdgePayloadResolver
type Resolver = EdgePayloadResolver
The resolver for this type. It must contain all the additional
information from serializing needed to make the archived type from
the normal type.
Source§impl Classified for EdgePayload
impl Classified for EdgePayload
Source§fn class(&self) -> RelationClass
fn class(&self) -> RelationClass
This edge’s relation class.
Source§impl Clone for EdgePayload
impl Clone for EdgePayload
Source§impl Debug for EdgePayload
impl Debug for EdgePayload
Source§impl Default for EdgePayload
impl Default for EdgePayload
Source§impl<'de> Deserialize<'de> for EdgePayload
impl<'de> Deserialize<'de> for EdgePayload
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<__D: Fallible + ?Sized> Deserialize<EdgePayload, __D> for Archived<EdgePayload>where
AssertionData: Archive,
<AssertionData as Archive>::Archived: Deserialize<AssertionData, __D>,
Option<TraversalData>: Archive,
<Option<TraversalData> as Archive>::Archived: Deserialize<Option<TraversalData>, __D>,
impl<__D: Fallible + ?Sized> Deserialize<EdgePayload, __D> for Archived<EdgePayload>where
AssertionData: Archive,
<AssertionData as Archive>::Archived: Deserialize<AssertionData, __D>,
Option<TraversalData>: Archive,
<Option<TraversalData> as Archive>::Archived: Deserialize<Option<TraversalData>, __D>,
Source§fn deserialize(
&self,
deserializer: &mut __D,
) -> Result<EdgePayload, <__D as Fallible>::Error>
fn deserialize( &self, deserializer: &mut __D, ) -> Result<EdgePayload, <__D as Fallible>::Error>
Deserializes using the given deserializer
impl Eq for EdgePayload
Source§impl PartialEq for EdgePayload
impl PartialEq for EdgePayload
Source§impl Predicated for EdgePayload
impl Predicated for EdgePayload
Source§impl Serialize for EdgePayload
impl Serialize for EdgePayload
impl StructuralPartialEq for EdgePayload
Auto Trait Implementations§
impl Freeze for EdgePayload
impl RefUnwindSafe for EdgePayload
impl Send for EdgePayload
impl Sync for EdgePayload
impl Unpin for EdgePayload
impl UnsafeUnpin for EdgePayload
impl UnwindSafe for EdgePayload
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
Source§impl<T> ArchiveUnsized for Twhere
T: Archive,
impl<T> ArchiveUnsized for Twhere
T: Archive,
Source§type Archived = <T as Archive>::Archived
type Archived = <T as Archive>::Archived
The archived counterpart of this type. Unlike
Archive, it may be
unsized. Read moreSource§fn archived_metadata(
&self,
) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
fn archived_metadata( &self, ) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
Creates the archived version of the metadata for this value.
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,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
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.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Returns the layout of the type.
impl<T> MemoryPayload for T
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out indicating that a T is niched.