Struct TopoSortedNodes 

pub struct TopoSortedNodes {
    pub nodes: Vec<TopoSortedNode>,
}

A topologically sorted sub-graph of the storage graph.

Stored as a sequence of nodes, each referencing their children as indices in this sequence. The final entry in this is the root of the sub-graph (which is assumed to have only one root). Each node in the graph should have its children preceding it in the graph, allowing the graph to be restored from this representation in a single in-order iteration.

Fields

nodes: Vec<TopoSortedNode>

The individual sorted nodes

Trait Implementations

impl Clone for TopoSortedNodes

fn clone(&self) -> TopoSortedNodes

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TopoSortedNodes

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

Formats the value using the given formatter.

impl Deserializable for TopoSortedNodes

fn deserialize( reader: &mut impl Read, recursion_depth: u32, ) -> Result<TopoSortedNodes, Error>

const LIMIT_RECURSION: bool = true

fn check_rec(depth: &mut u32) -> Result<(), Error>

impl PartialEq for TopoSortedNodes

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl Serializable for TopoSortedNodes

fn serialize(&self, writer: &mut impl Write) -> Result<(), Error>

fn serialized_size(&self) -> usize

impl Eq for TopoSortedNodes

impl StructuralPartialEq for TopoSortedNodes