use alloc::vec::Vec;
use core::fmt;
use miden_crypto::{Felt, hash::rpo::RpoDigest};
use super::MastNodeExt;
use crate::{
OPCODE_JOIN,
chiplets::hasher,
mast::{DecoratorId, MastForest, MastForestError, MastNodeId, Remapping},
prettier::PrettyPrint,
};
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct JoinNode {
children: [MastNodeId; 2],
digest: RpoDigest,
before_enter: Vec<DecoratorId>,
after_exit: Vec<DecoratorId>,
}
impl JoinNode {
pub const DOMAIN: Felt = Felt::new(OPCODE_JOIN as u64);
}
impl JoinNode {
pub fn new(
children: [MastNodeId; 2],
mast_forest: &MastForest,
) -> Result<Self, MastForestError> {
let forest_len = mast_forest.nodes.len();
if children[0].as_usize() >= forest_len {
return Err(MastForestError::NodeIdOverflow(children[0], forest_len));
} else if children[1].as_usize() >= forest_len {
return Err(MastForestError::NodeIdOverflow(children[1], forest_len));
}
let digest = {
let left_child_hash = mast_forest[children[0]].digest();
let right_child_hash = mast_forest[children[1]].digest();
hasher::merge_in_domain(&[left_child_hash, right_child_hash], Self::DOMAIN)
};
Ok(Self {
children,
digest,
before_enter: Vec::new(),
after_exit: Vec::new(),
})
}
pub fn new_unsafe(children: [MastNodeId; 2], digest: RpoDigest) -> Self {
Self {
children,
digest,
before_enter: Vec::new(),
after_exit: Vec::new(),
}
}
}
impl JoinNode {
pub fn digest(&self) -> RpoDigest {
self.digest
}
pub fn first(&self) -> MastNodeId {
self.children[0]
}
pub fn second(&self) -> MastNodeId {
self.children[1]
}
pub fn before_enter(&self) -> &[DecoratorId] {
&self.before_enter
}
pub fn after_exit(&self) -> &[DecoratorId] {
&self.after_exit
}
}
impl JoinNode {
pub fn remap_children(&self, remapping: &Remapping) -> Self {
let mut node = self.clone();
node.children[0] = node.children[0].remap(remapping);
node.children[1] = node.children[1].remap(remapping);
node
}
pub fn append_before_enter(&mut self, decorator_ids: &[DecoratorId]) {
self.before_enter.extend_from_slice(decorator_ids);
}
pub fn append_after_exit(&mut self, decorator_ids: &[DecoratorId]) {
self.after_exit.extend_from_slice(decorator_ids);
}
}
impl MastNodeExt for JoinNode {
fn decorators(&self) -> impl Iterator<Item = (usize, DecoratorId)> {
self.before_enter.iter().chain(&self.after_exit).copied().enumerate()
}
}
impl JoinNode {
pub(super) fn to_display<'a>(&'a self, mast_forest: &'a MastForest) -> impl fmt::Display + 'a {
JoinNodePrettyPrint { join_node: self, mast_forest }
}
pub(super) fn to_pretty_print<'a>(
&'a self,
mast_forest: &'a MastForest,
) -> impl PrettyPrint + 'a {
JoinNodePrettyPrint { join_node: self, mast_forest }
}
}
struct JoinNodePrettyPrint<'a> {
join_node: &'a JoinNode,
mast_forest: &'a MastForest,
}
impl PrettyPrint for JoinNodePrettyPrint<'_> {
#[rustfmt::skip]
fn render(&self) -> crate::prettier::Document {
use crate::prettier::*;
let pre_decorators = {
let mut pre_decorators = self
.join_node
.before_enter()
.iter()
.map(|&decorator_id| self.mast_forest[decorator_id].render())
.reduce(|acc, doc| acc + const_text(" ") + doc)
.unwrap_or_default();
if !pre_decorators.is_empty() {
pre_decorators += nl();
}
pre_decorators
};
let post_decorators = {
let mut post_decorators = self
.join_node
.after_exit()
.iter()
.map(|&decorator_id| self.mast_forest[decorator_id].render())
.reduce(|acc, doc| acc + const_text(" ") + doc)
.unwrap_or_default();
if !post_decorators.is_empty() {
post_decorators = nl() + post_decorators;
}
post_decorators
};
let first_child =
self.mast_forest[self.join_node.first()].to_pretty_print(self.mast_forest);
let second_child =
self.mast_forest[self.join_node.second()].to_pretty_print(self.mast_forest);
pre_decorators
+ indent(
4,
const_text("join")
+ nl()
+ first_child.render()
+ nl()
+ second_child.render(),
) + nl() + const_text("end")
+ post_decorators
}
}
impl fmt::Display for JoinNodePrettyPrint<'_> {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
use crate::prettier::PrettyPrint;
self.pretty_print(f)
}
}