Skip to main content

Node

Struct Node 

Source
pub struct Node {
    pub level: u32,
    pub l: Option<Box<Node>>,
    pub entries: Vec<NodeEntry>,
}
Expand description

An in-memory MST over an account repo’s records (all collections, keyed by <collection>/<rkey>).

Internally this is a recursive structure of Nodes, each at a level. The tree shape depends only on the (key → record-CID) map, not insertion order, so any host with the same records builds the same root.

Fields§

§level: u32§l: Option<Box<Node>>§entries: Vec<NodeEntry>

Implementations§

Source§

impl Node

Source

pub fn empty() -> Self

An empty MST root (level 0, no entries).

Source

pub fn from_records(collection: &str, records: &BTreeMap<Tid, Cid>) -> Self

Build an MST from a key → record CID map. The collection name is used to form the full record keys (<collection>/<rkey>).

The resulting tree shape is a pure function of the key set — independent of insertion order — because each key’s level (and thus its position in the tree) is trailing_zero_bits(sha256(key)).

Source

pub fn from_keyed_records(records: &BTreeMap<String, Cid>) -> Self

Build an MST from already-formed full record keys ("<collection>/<rkey>") to record CID.

Unlike Self::from_records (single collection, keyed by Tid), this accepts keys spanning multiple collections in one tree — the real atproto shape (one MST per account repo, not per collection; a repo’s records live at keys like ai.hyprstream.model/<rkey> and ai.hyprstream.placement.node/<rkey> side by side in the same tree). A directory walker enumerates a collection’s records by filtering entries whose key starts with "<collection>/".

Source

pub fn from_keyed_records_atproto(records: &BTreeMap<String, Cid>) -> Self

Build an MST using the public AT Protocol layer function. The native Self::from_keyed_records constructor remains unchanged for native artifacts; callers producing public roots should use this constructor.

Source

pub fn to_node_data_with_blocks(&self) -> (NodeData, Vec<(Cid, NodeData)>)

Serialize this subtree to a NodeData (resolving child CIDs recursively), returning the NodeData and the list of all node blocks (for CAR export).

Source

pub fn root_cid(&self) -> Cid

The root CID of this MST (CIDv1 dag-cbor over the root node’s bytes).

Source

pub fn all_blocks(&self) -> Vec<(Cid, NodeData)>

All node blocks in the tree (including the root), as (cid, NodeData). Useful for full-repo CAR export.

Source

pub fn to_node_data_with_blocks_atproto( &self, ) -> Result<(NodeData, Vec<(Cid, NodeData)>)>

Serialize this tree with public AT Protocol node ordering and CIDs.

Source

pub fn proof_atproto<K>(&self, collection: &str, rkey: K) -> Option<Proof>

Build an inclusion proof whose node CIDs use public AT serialization.

Source

pub fn proof(&self, collection: &str, rkey: &Tid) -> Option<Proof>

Compute the MST path (inclusion proof) for rkey: the chain of (NodeData, entry_index) pairs from the root down to the entry whose key matches, plus the sibling-subtree CIDs needed to verify the chain.

Returns None if the rkey is not present.

Trait Implementations§

Source§

impl Clone for Node

Source§

fn clone(&self) -> Node

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for Node

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl PartialEq for Node

Source§

fn eq(&self, other: &Node) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl Eq for Node

Source§

impl StructuralPartialEq for Node

Auto Trait Implementations§

§

impl Freeze for Node

§

impl RefUnwindSafe for Node

§

impl Send for Node

§

impl Sync for Node

§

impl Unpin for Node

§

impl UnsafeUnpin for Node

§

impl UnwindSafe for Node

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
§

impl<T> PolicyExt for T
where T: ?Sized,

§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns [Action::Follow] only if self and other return Action::Follow. Read more
§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns [Action::Follow] if either self or other returns Action::Follow. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<T> ServiceExt for T

§

fn map_response_body<F>(self, f: F) -> MapResponseBody<Self, F>
where Self: Sized,

Apply a transformation to the response body. Read more
§

fn trace_for_http(self) -> Trace<Self, SharedClassifier<ServerErrorsAsFailures>>
where Self: Sized,

High level tracing that classifies responses using HTTP status codes. Read more
§

fn trace_for_grpc(self) -> Trace<Self, SharedClassifier<GrpcErrorsAsFailures>>
where Self: Sized,

High level tracing that classifies responses using gRPC headers. Read more
§

fn follow_redirects(self) -> FollowRedirect<Self>
where Self: Sized,

Follow redirect resposes using the Standard policy. Read more
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

impl<T> ErasedDestructor for T
where T: 'static,

§

impl<T> MaybeSend for T
where T: Send,

§

impl<T> MaybeSend for T
where T: Send,

§

impl<T> MaybeSync for T
where T: Sync,

§

impl<T> MaybeSync for T
where T: Sync,

§

impl<T> TerminalState for T
where T: Clone + Send + Sync,