2021-06-20 20:36:53 -07:00
|
|
|
use crate::commitment::{CTree, Witness};
|
2021-06-20 18:41:47 -07:00
|
|
|
use rayon::prelude::IntoParallelIterator;
|
|
|
|
use rayon::prelude::*;
|
|
|
|
use zcash_primitives::merkle_tree::Hashable;
|
|
|
|
use zcash_primitives::sapling::Node;
|
|
|
|
|
2021-06-20 20:36:53 -07:00
|
|
|
trait Builder<T, C> {
|
|
|
|
fn collect(&mut self, commitments: &[Node], context: &C) -> usize;
|
2021-06-20 18:41:47 -07:00
|
|
|
fn up(&mut self);
|
|
|
|
fn finished(&self) -> bool;
|
2021-06-20 22:07:46 -07:00
|
|
|
fn finalize(self, context: &C) -> T;
|
2021-06-20 18:41:47 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
struct CTreeBuilder {
|
|
|
|
left: Option<Node>,
|
|
|
|
right: Option<Node>,
|
|
|
|
prev_tree: CTree,
|
|
|
|
next_tree: CTree,
|
2021-06-20 20:36:53 -07:00
|
|
|
start: usize,
|
2021-06-20 18:41:47 -07:00
|
|
|
depth: usize,
|
2021-06-20 20:36:53 -07:00
|
|
|
offset: Option<Node>,
|
2021-06-20 18:41:47 -07:00
|
|
|
}
|
|
|
|
|
2021-06-20 20:36:53 -07:00
|
|
|
impl Builder<CTree, ()> for CTreeBuilder {
|
|
|
|
fn collect(&mut self, commitments: &[Node], _context: &()) -> usize {
|
2021-06-20 18:41:47 -07:00
|
|
|
// assert!(!commitments.is_empty() || self.left.is_some() || self.right.is_some());
|
|
|
|
assert!(self.right.is_none() || self.left.is_some()); // R can't be set without L
|
|
|
|
|
|
|
|
let offset: Option<Node>;
|
|
|
|
let m: usize;
|
|
|
|
|
|
|
|
if self.left.is_some() && self.right.is_none() {
|
|
|
|
offset = self.left;
|
|
|
|
m = commitments.len() + 1;
|
|
|
|
} else {
|
|
|
|
offset = None;
|
|
|
|
m = commitments.len();
|
|
|
|
};
|
|
|
|
|
|
|
|
let n = if self.depth == 0 {
|
|
|
|
if m % 2 == 0 {
|
2021-06-20 22:07:46 -07:00
|
|
|
self.next_tree.left = Some(*Self::get(commitments, m - 2, &offset));
|
|
|
|
self.next_tree.right = Some(*Self::get(commitments, m - 1, &offset));
|
2021-06-20 18:41:47 -07:00
|
|
|
m - 2
|
|
|
|
} else {
|
2021-06-20 22:07:46 -07:00
|
|
|
self.next_tree.left = Some(*Self::get(commitments, m - 1, &offset));
|
2021-06-20 18:41:47 -07:00
|
|
|
self.next_tree.right = None;
|
|
|
|
m - 1
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if m % 2 == 0 {
|
|
|
|
self.next_tree.parents.push(None);
|
|
|
|
m
|
|
|
|
} else {
|
2021-06-20 22:07:46 -07:00
|
|
|
let last_node = Self::get(commitments, m - 1, &offset);
|
|
|
|
self.next_tree.parents.push(Some(*last_node));
|
2021-06-20 18:41:47 -07:00
|
|
|
m - 1
|
|
|
|
}
|
|
|
|
};
|
|
|
|
assert_eq!(n % 2, 0);
|
|
|
|
|
2021-06-20 20:36:53 -07:00
|
|
|
self.offset = offset;
|
|
|
|
n
|
2021-06-20 18:41:47 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
fn up(&mut self) {
|
|
|
|
let h = if self.left.is_some() && self.right.is_some() {
|
2021-06-20 22:07:46 -07:00
|
|
|
Some(Node::combine(
|
|
|
|
self.depth,
|
|
|
|
&self.left.unwrap(),
|
|
|
|
&self.right.unwrap(),
|
|
|
|
))
|
2021-06-20 18:41:47 -07:00
|
|
|
} else {
|
|
|
|
None
|
|
|
|
};
|
|
|
|
let (l, r) = match self.prev_tree.parents.get(self.depth) {
|
|
|
|
Some(Some(p)) => (Some(*p), h),
|
|
|
|
Some(None) => (h, None),
|
|
|
|
None => (h, None),
|
|
|
|
};
|
|
|
|
|
|
|
|
self.left = l;
|
|
|
|
self.right = r;
|
2021-06-20 20:36:53 -07:00
|
|
|
|
|
|
|
assert!(self.start % 2 == 0 || self.offset.is_some());
|
|
|
|
self.start /= 2;
|
|
|
|
|
2021-06-20 18:41:47 -07:00
|
|
|
self.depth += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
fn finished(&self) -> bool {
|
|
|
|
self.depth >= self.prev_tree.parents.len() && self.left.is_none() && self.right.is_none()
|
|
|
|
}
|
|
|
|
|
2021-06-20 22:07:46 -07:00
|
|
|
fn finalize(self, _context: &()) -> CTree {
|
2021-06-20 18:41:47 -07:00
|
|
|
self.next_tree
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl CTreeBuilder {
|
|
|
|
fn new(prev_tree: CTree) -> CTreeBuilder {
|
2021-06-20 20:36:53 -07:00
|
|
|
let start = prev_tree.get_position();
|
2021-06-20 18:41:47 -07:00
|
|
|
CTreeBuilder {
|
|
|
|
left: prev_tree.left,
|
|
|
|
right: prev_tree.right,
|
|
|
|
prev_tree,
|
|
|
|
next_tree: CTree::new(),
|
2021-06-20 20:36:53 -07:00
|
|
|
start,
|
2021-06-20 18:41:47 -07:00
|
|
|
depth: 0,
|
2021-06-20 20:36:53 -07:00
|
|
|
offset: None,
|
2021-06-20 18:41:47 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[inline(always)]
|
2021-06-20 22:07:46 -07:00
|
|
|
fn get_opt<'a>(
|
|
|
|
commitments: &'a [Node],
|
|
|
|
index: usize,
|
|
|
|
offset: &'a Option<Node>,
|
|
|
|
) -> Option<&'a Node> {
|
|
|
|
if offset.is_some() {
|
|
|
|
if index > 0 {
|
|
|
|
commitments.get(index - 1)
|
|
|
|
} else {
|
|
|
|
offset.as_ref()
|
2021-06-20 18:41:47 -07:00
|
|
|
}
|
2021-06-20 22:07:46 -07:00
|
|
|
} else {
|
|
|
|
commitments.get(index)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[inline(always)]
|
|
|
|
fn get<'a>(commitments: &'a [Node], index: usize, offset: &'a Option<Node>) -> &'a Node {
|
|
|
|
Self::get_opt(commitments, index, offset).unwrap()
|
|
|
|
}
|
|
|
|
|
2021-06-21 07:04:45 -07:00
|
|
|
fn adjusted_start(&self, prev: &Option<Node>, depth: usize) -> usize {
|
|
|
|
if depth != 0 && prev.is_some() {
|
2021-06-20 22:07:46 -07:00
|
|
|
self.start - 1
|
|
|
|
} else {
|
|
|
|
self.start
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn clone_trimmed(&self, mut depth: usize) -> CTree {
|
|
|
|
if depth == 0 {
|
|
|
|
return CTree::new()
|
|
|
|
}
|
|
|
|
let mut tree = self.next_tree.clone();
|
|
|
|
while depth > 0 && depth <= tree.parents.len() && tree.parents[depth - 1].is_none() {
|
|
|
|
depth -= 1;
|
2021-06-20 18:41:47 -07:00
|
|
|
}
|
2021-06-20 22:07:46 -07:00
|
|
|
tree.parents.truncate(depth);
|
|
|
|
tree
|
2021-06-20 18:41:47 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn combine_level(commitments: &mut [Node], offset: Option<Node>, n: usize, depth: usize) -> usize {
|
|
|
|
assert_eq!(n % 2, 0);
|
|
|
|
|
|
|
|
let nn = n / 2;
|
|
|
|
let next_level: Vec<Node> = (0..nn)
|
|
|
|
.into_par_iter()
|
|
|
|
.map(|i| {
|
|
|
|
Node::combine(
|
|
|
|
depth,
|
2021-06-20 22:07:46 -07:00
|
|
|
CTreeBuilder::get(commitments, 2 * i, &offset),
|
|
|
|
CTreeBuilder::get(commitments, 2 * i + 1, &offset),
|
2021-06-20 18:41:47 -07:00
|
|
|
)
|
|
|
|
})
|
|
|
|
.collect();
|
|
|
|
commitments[0..nn].copy_from_slice(&next_level);
|
|
|
|
nn
|
|
|
|
}
|
|
|
|
|
2021-06-20 20:36:53 -07:00
|
|
|
struct WitnessBuilder {
|
|
|
|
witness: Witness,
|
|
|
|
p: usize,
|
|
|
|
inside: bool,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl WitnessBuilder {
|
|
|
|
fn new(tree_builder: &CTreeBuilder, prev_witness: Witness, count: usize) -> WitnessBuilder {
|
|
|
|
let position = prev_witness.position;
|
|
|
|
let inside = position >= tree_builder.start && position < tree_builder.start + count;
|
|
|
|
WitnessBuilder {
|
|
|
|
witness: prev_witness,
|
|
|
|
p: position,
|
|
|
|
inside,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl Builder<Witness, CTreeBuilder> for WitnessBuilder {
|
|
|
|
fn collect(&mut self, commitments: &[Node], context: &CTreeBuilder) -> usize {
|
|
|
|
let offset = context.offset;
|
|
|
|
let depth = context.depth;
|
|
|
|
|
2021-06-20 22:07:46 -07:00
|
|
|
let tree = &mut self.witness.tree;
|
2021-06-21 07:04:45 -07:00
|
|
|
let right = if depth != 0 { context.right } else { None };
|
2021-06-20 22:07:46 -07:00
|
|
|
|
2021-06-20 20:36:53 -07:00
|
|
|
if self.inside {
|
2021-06-21 07:04:45 -07:00
|
|
|
let rp = self.p - context.adjusted_start(&offset, depth);
|
2021-06-20 20:36:53 -07:00
|
|
|
if depth == 0 {
|
|
|
|
if self.p % 2 == 1 {
|
2021-06-20 22:07:46 -07:00
|
|
|
tree.left = Some(*CTreeBuilder::get(commitments, rp - 1, &offset));
|
|
|
|
tree.right = Some(*CTreeBuilder::get(commitments, rp, &offset));
|
|
|
|
} else {
|
|
|
|
tree.left = Some(*CTreeBuilder::get(commitments, rp, &offset));
|
|
|
|
tree.right = None;
|
2021-06-20 20:36:53 -07:00
|
|
|
}
|
2021-06-20 22:07:46 -07:00
|
|
|
} else {
|
|
|
|
if self.p % 2 == 1 {
|
|
|
|
tree.parents
|
|
|
|
.push(Some(*CTreeBuilder::get(commitments, rp - 1, &offset)));
|
|
|
|
} else if self.p != 0 {
|
|
|
|
tree.parents.push(None);
|
2021-06-20 20:36:53 -07:00
|
|
|
}
|
|
|
|
}
|
2021-06-20 22:07:46 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
let p1 = self.p + 1;
|
2021-06-21 07:04:45 -07:00
|
|
|
let has_p1 = p1 >= context.adjusted_start(&right, depth) && p1 < context.start + commitments.len();
|
2021-06-20 22:07:46 -07:00
|
|
|
if has_p1 {
|
2021-06-21 07:04:45 -07:00
|
|
|
let p1 = CTreeBuilder::get(commitments, p1 - context.adjusted_start(&right, depth), &right);
|
2021-06-20 22:07:46 -07:00
|
|
|
if depth == 0 {
|
|
|
|
if tree.right.is_none() {
|
|
|
|
self.witness.filled.push(*p1);
|
2021-06-20 20:36:53 -07:00
|
|
|
}
|
2021-06-20 22:07:46 -07:00
|
|
|
} else {
|
|
|
|
if depth - 1 >= tree.parents.len() || tree.parents[depth - 1].is_none() {
|
|
|
|
self.witness.filled.push(*p1);
|
2021-06-20 20:36:53 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
0
|
|
|
|
}
|
|
|
|
|
|
|
|
fn up(&mut self) {
|
|
|
|
self.p /= 2;
|
|
|
|
}
|
|
|
|
|
|
|
|
fn finished(&self) -> bool {
|
|
|
|
false
|
|
|
|
}
|
|
|
|
|
2021-06-20 22:07:46 -07:00
|
|
|
fn finalize(mut self, context: &CTreeBuilder) -> Witness {
|
|
|
|
let tree = &self.witness.tree;
|
|
|
|
let mut num_filled = self.witness.filled.len();
|
|
|
|
|
2021-06-21 07:04:45 -07:00
|
|
|
if self.witness.position + 1 == context.next_tree.get_position() {
|
|
|
|
self.witness.cursor = CTree::new();
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
let mut depth = 0;
|
|
|
|
loop {
|
|
|
|
let is_none = if depth == 0 { // check if this level is occupied
|
|
|
|
tree.right.is_none()
|
|
|
|
} else {
|
|
|
|
depth > tree.parents.len() || tree.parents[depth - 1].is_none()
|
|
|
|
};
|
|
|
|
if is_none {
|
|
|
|
if num_filled > 0 {
|
|
|
|
num_filled -= 1; // we filled it
|
|
|
|
} else {
|
|
|
|
break
|
|
|
|
}
|
2021-06-20 22:07:46 -07:00
|
|
|
}
|
2021-06-21 07:04:45 -07:00
|
|
|
depth += 1;
|
|
|
|
// loop terminates because we are eventually going to run out of ancestors and filled
|
2021-06-20 22:07:46 -07:00
|
|
|
}
|
|
|
|
|
2021-06-21 07:04:45 -07:00
|
|
|
self.witness.cursor = context.clone_trimmed(depth - 1);
|
|
|
|
}
|
2021-06-20 20:36:53 -07:00
|
|
|
self.witness
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-06-20 18:41:47 -07:00
|
|
|
#[allow(dead_code)]
|
2021-06-21 07:04:45 -07:00
|
|
|
pub fn advance_tree(
|
2021-06-20 22:07:46 -07:00
|
|
|
prev_tree: CTree,
|
|
|
|
prev_witnesses: &[Witness],
|
|
|
|
mut commitments: &mut [Node],
|
|
|
|
) -> (CTree, Vec<Witness>) {
|
2021-06-20 18:41:47 -07:00
|
|
|
if commitments.is_empty() {
|
2021-06-20 20:36:53 -07:00
|
|
|
return (prev_tree, prev_witnesses.to_vec());
|
2021-06-20 18:41:47 -07:00
|
|
|
}
|
|
|
|
let mut builder = CTreeBuilder::new(prev_tree);
|
2021-06-20 22:07:46 -07:00
|
|
|
let mut witness_builders: Vec<_> = prev_witnesses
|
|
|
|
.iter()
|
|
|
|
.map(|witness| WitnessBuilder::new(&builder, witness.clone(), commitments.len()))
|
|
|
|
.collect();
|
2021-06-20 18:41:47 -07:00
|
|
|
while !commitments.is_empty() || !builder.finished() {
|
2021-06-20 20:36:53 -07:00
|
|
|
let n = builder.collect(commitments, &());
|
|
|
|
for b in witness_builders.iter_mut() {
|
|
|
|
b.collect(commitments, &builder);
|
|
|
|
}
|
|
|
|
let nn = combine_level(commitments, builder.offset, n, builder.depth);
|
2021-06-20 18:41:47 -07:00
|
|
|
commitments = &mut commitments[0..nn];
|
|
|
|
builder.up();
|
2021-06-20 20:36:53 -07:00
|
|
|
for b in witness_builders.iter_mut() {
|
|
|
|
b.up();
|
|
|
|
}
|
2021-06-20 18:41:47 -07:00
|
|
|
}
|
|
|
|
|
2021-06-20 22:07:46 -07:00
|
|
|
let witnesses = witness_builders
|
|
|
|
.into_iter()
|
|
|
|
.map(|b| b.finalize(&builder))
|
|
|
|
.collect();
|
|
|
|
let tree = builder.finalize(&());
|
2021-06-20 20:36:53 -07:00
|
|
|
(tree, witnesses)
|
2021-06-20 18:41:47 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
#[cfg(test)]
|
2021-06-20 22:07:46 -07:00
|
|
|
#[allow(unused_imports)]
|
2021-06-20 18:41:47 -07:00
|
|
|
mod tests {
|
2021-06-20 22:07:46 -07:00
|
|
|
use crate::builder::advance_tree;
|
2021-06-20 20:36:53 -07:00
|
|
|
use crate::commitment::{CTree, Witness};
|
2021-06-20 22:07:46 -07:00
|
|
|
use crate::print::{print_tree, print_witness};
|
2021-06-20 20:36:53 -07:00
|
|
|
use zcash_primitives::merkle_tree::{CommitmentTree, IncrementalWitness};
|
2021-06-20 22:07:46 -07:00
|
|
|
use zcash_primitives::sapling::Node;
|
2021-06-20 18:41:47 -07:00
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_advance_tree() {
|
2021-06-21 07:04:45 -07:00
|
|
|
const NUM_NODES: usize = 1000;
|
|
|
|
const NUM_CHUNKS: usize = 50;
|
|
|
|
const WITNESS_PERCENT: f64 = 1.0; // percentage of notes that are ours
|
2021-06-20 22:07:46 -07:00
|
|
|
const DEBUG_PRINT: bool = true;
|
|
|
|
let witness_freq = (100.0 / WITNESS_PERCENT) as usize;
|
|
|
|
|
2021-06-20 18:41:47 -07:00
|
|
|
let mut tree1: CommitmentTree<Node> = CommitmentTree::empty();
|
|
|
|
let mut tree2 = CTree::new();
|
2021-06-20 20:36:53 -07:00
|
|
|
let mut ws: Vec<IncrementalWitness<Node>> = vec![];
|
|
|
|
let mut ws2: Vec<Witness> = vec![];
|
2021-06-20 18:41:47 -07:00
|
|
|
for i in 0..NUM_CHUNKS {
|
2021-06-21 07:04:45 -07:00
|
|
|
println!("{}", i);
|
2021-06-20 22:07:46 -07:00
|
|
|
let mut nodes: Vec<_> = vec![];
|
|
|
|
for j in 0..NUM_NODES {
|
2021-06-20 18:41:47 -07:00
|
|
|
let mut bb = [0u8; 32];
|
2021-06-20 22:07:46 -07:00
|
|
|
let v = i * NUM_NODES + j;
|
2021-06-20 18:41:47 -07:00
|
|
|
bb[0..8].copy_from_slice(&v.to_be_bytes());
|
|
|
|
let node = Node::new(bb);
|
|
|
|
tree1.append(node).unwrap();
|
2021-06-20 20:36:53 -07:00
|
|
|
for w in ws.iter_mut() {
|
|
|
|
w.append(node).unwrap();
|
|
|
|
}
|
2021-06-21 07:04:45 -07:00
|
|
|
if v % witness_freq == 0 {
|
|
|
|
// if v == 499 {
|
2021-06-20 20:36:53 -07:00
|
|
|
let w = IncrementalWitness::from_tree(&tree1);
|
|
|
|
ws.push(w);
|
|
|
|
ws2.push(Witness::new(v));
|
|
|
|
}
|
2021-06-20 22:07:46 -07:00
|
|
|
nodes.push(node);
|
|
|
|
}
|
2021-06-20 18:41:47 -07:00
|
|
|
|
2021-06-20 20:36:53 -07:00
|
|
|
let (new_tree, new_witnesses) = advance_tree(tree2, &ws2, &mut nodes);
|
|
|
|
tree2 = new_tree;
|
|
|
|
ws2 = new_witnesses;
|
2021-06-20 18:41:47 -07:00
|
|
|
}
|
2021-06-20 22:07:46 -07:00
|
|
|
|
|
|
|
// check final state
|
2021-06-20 18:41:47 -07:00
|
|
|
let mut bb1: Vec<u8> = vec![];
|
|
|
|
tree1.write(&mut bb1).unwrap();
|
|
|
|
|
|
|
|
let mut bb2: Vec<u8> = vec![];
|
|
|
|
tree2.write(&mut bb2).unwrap();
|
|
|
|
|
|
|
|
let equal = bb1.as_slice() == bb2.as_slice();
|
|
|
|
|
2021-06-20 22:07:46 -07:00
|
|
|
println!("# witnesses = {}", ws.len());
|
|
|
|
|
|
|
|
// check witnesses
|
|
|
|
let mut failed_index: Option<usize> = None;
|
|
|
|
for (i, (w1, w2)) in ws.iter().zip(&ws2).enumerate() {
|
|
|
|
let mut bb1: Vec<u8> = vec![];
|
|
|
|
w1.write(&mut bb1).unwrap();
|
|
|
|
|
|
|
|
let mut bb2: Vec<u8> = vec![];
|
|
|
|
w2.write(&mut bb2).unwrap();
|
|
|
|
|
|
|
|
if bb1.as_slice() != bb2.as_slice() {
|
|
|
|
failed_index = Some(i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if DEBUG_PRINT && (failed_index.is_some() || !equal) {
|
|
|
|
let i = failed_index.unwrap();
|
|
|
|
println!("FAILED AT {}", i);
|
|
|
|
print_witness(&ws[i]);
|
|
|
|
|
|
|
|
// println!("-----");
|
|
|
|
// println!("Final-----");
|
|
|
|
//
|
|
|
|
// println!("{:?}", tree2.left.map(|n| hex::encode(n.repr)));
|
|
|
|
// println!("{:?}", tree2.right.map(|n| hex::encode(n.repr)));
|
|
|
|
// for p in tree2.parents.iter() {
|
|
|
|
// println!("{:?}", p.map(|n| hex::encode(n.repr)));
|
|
|
|
// }
|
|
|
|
// println!("-----");
|
|
|
|
|
|
|
|
// println!("{:?}", tree1.left.map(|n| hex::encode(n.repr)));
|
|
|
|
// println!("{:?}", tree1.right.map(|n| hex::encode(n.repr)));
|
|
|
|
// for p in tree1.parents.iter() {
|
|
|
|
// println!("{:?}", p.map(|n| hex::encode(n.repr)));
|
|
|
|
// }
|
|
|
|
println!("----- {}", ws2[i].position);
|
|
|
|
let tree2 = &ws2[i].tree;
|
|
|
|
println!("{:?}", tree2.left.map(|n| hex::encode(n.repr)));
|
|
|
|
println!("{:?}", tree2.right.map(|n| hex::encode(n.repr)));
|
|
|
|
for p in tree2.parents.iter() {
|
|
|
|
println!("{:?}", p.map(|n| hex::encode(n.repr)));
|
|
|
|
}
|
|
|
|
println!("-----");
|
|
|
|
let filled2 = &ws2[i].filled;
|
|
|
|
println!("Filled");
|
|
|
|
for f in filled2.iter() {
|
|
|
|
println!("{:?}", hex::encode(f.repr));
|
|
|
|
}
|
|
|
|
println!("Cursor");
|
|
|
|
let cursor2 = &ws2[i].cursor;
|
|
|
|
println!("{:?}", cursor2.left.map(|n| hex::encode(n.repr)));
|
|
|
|
println!("{:?}", cursor2.right.map(|n| hex::encode(n.repr)));
|
|
|
|
for p in cursor2.parents.iter() {
|
|
|
|
println!("{:?}", p.map(|n| hex::encode(n.repr)));
|
|
|
|
}
|
|
|
|
|
|
|
|
assert!(false);
|
2021-06-20 18:41:47 -07:00
|
|
|
}
|
|
|
|
}
|
2021-06-20 22:07:46 -07:00
|
|
|
}
|