Struct SharedNode 

pub struct SharedNode(pub Rc<RefCell<HydroNode>>);

Tuple Fields

0: Rc<RefCell<HydroNode>>

Implementations

impl SharedNode

pub fn as_ptr(&self) -> *const RefCell<HydroNode>

Trait Implementations

impl Debug for SharedNode

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

Formats the value using the given formatter.

impl Hash for SharedNode

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Serialize for SharedNode

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Multiple SharedNodes can point to the same underlying HydroNode (via Tee / Partition). A naïve recursive serialization would revisit the same subtree every time and, if the graph ever contains a cycle, loop forever.

We keep a thread-local map (SERIALIZED_SHARED) from raw Rc pointer → integer id. The first time we see a pointer we assign it the next id and emit the full subtree as {"$shared": <id>, "node": …}. Every later encounter of the same pointer emits {"$shared_ref": <id>}, cutting the recursion. Requires an active serialize_dedup_shared scope.