pub struct PoetGeometryView<'a> { /* private fields */ }Expand description
Zero-copy view over a GTOP Geometry-Topology Complex segment harbouring $M$ graphs.
Implementations§
Source§impl<'a> PoetGeometryView<'a>
impl<'a> PoetGeometryView<'a>
Sourcepub fn from_segment_bytes(segment: &'a [u8]) -> Result<Self, TopologyError>
pub fn from_segment_bytes(segment: &'a [u8]) -> Result<Self, TopologyError>
Construct a PoetGeometryView over a 64-byte-aligned GTOP segment buffer.
pub const fn segment(&self) -> &'a [u8] ⓘ
pub const fn header(&self) -> &'a PoetGeometryHeader
pub const fn graph_headers(&self) -> &'a [HarbouredGraphHeader]
pub const fn harboured_graph_count(&self) -> usize
Sourcepub fn active_graph(&self) -> Result<HarbouredCsrView<'a>, TopologyError>
pub fn active_graph(&self) -> Result<HarbouredCsrView<'a>, TopologyError>
Resolve the currently active harboured graph (header.active_graph_slot) in $O(1)$.
Sourcepub fn graph_at_slot(
&self,
slot: u16,
) -> Result<HarbouredCsrView<'a>, TopologyError>
pub fn graph_at_slot( &self, slot: u16, ) -> Result<HarbouredCsrView<'a>, TopologyError>
Resolve the harboured graph at slot ($m \in [0, M)$) in $O(1)$.
Sourcepub fn graph_by_id(
&self,
graph_id: u64,
) -> Result<(u16, HarbouredCsrView<'a>), TopologyError>
pub fn graph_by_id( &self, graph_id: u64, ) -> Result<(u16, HarbouredCsrView<'a>), TopologyError>
Resolve a harboured graph by its 64-bit graph_id (q_hash), returning (slot, view).
Sourcepub fn first_graph_by_role(
&self,
role: GraphEmbedRole,
) -> Result<(u16, HarbouredCsrView<'a>), TopologyError>
pub fn first_graph_by_role( &self, role: GraphEmbedRole, ) -> Result<(u16, HarbouredCsrView<'a>), TopologyError>
Resolve the first harboured graph matching role, returning (slot, view).
Sourcepub fn hop_via_cell_anchor(
&self,
from_slot: u16,
from_vertex: u32,
to_slot: u16,
out_vertices: &mut [u32],
) -> Result<usize, TopologyError>
pub fn hop_via_cell_anchor( &self, from_slot: u16, from_vertex: u32, to_slot: u16, out_vertices: &mut [u32], ) -> Result<usize, TopologyError>
Functorial cross-graph hop: reads the CellAnchor of from_vertex in from_slot
and collects all vertices in to_slot sharing the same (anchor_domain, cell_index)
(or matching entity_hash when anchor_domain == AnchorDomain::SemanticQuin).
Trait Implementations§
Source§impl<'a> Clone for PoetGeometryView<'a>
impl<'a> Clone for PoetGeometryView<'a>
impl<'a> Copy for PoetGeometryView<'a>
Source§impl<'a> Debug for PoetGeometryView<'a>
impl<'a> Debug for PoetGeometryView<'a>
impl<'a> Eq for PoetGeometryView<'a>
Source§impl<'a> PartialEq for PoetGeometryView<'a>
impl<'a> PartialEq for PoetGeometryView<'a>
impl<'a> StructuralPartialEq for PoetGeometryView<'a>
Auto Trait Implementations§
impl<'a> Freeze for PoetGeometryView<'a>
impl<'a> RefUnwindSafe for PoetGeometryView<'a>
impl<'a> Send for PoetGeometryView<'a>
impl<'a> Sync for PoetGeometryView<'a>
impl<'a> Unpin for PoetGeometryView<'a>
impl<'a> UnsafeUnpin for PoetGeometryView<'a>
impl<'a> UnwindSafe for PoetGeometryView<'a>
Blanket Implementations§
§impl<S, A> Aggregate<Result<S, Error>> for Awhere
A: Aggregate<S>,
impl<S, A> Aggregate<Result<S, Error>> for Awhere
A: Aggregate<S>,
Aggregate shares in an MPC protocol.
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,
§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
Checks if this value is equivalent to the given key. Read more
§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
Compare self to
key and return true if they are equal.§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
Checks if this value is equivalent to the given key. Read more
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more