zaphar/merkle-dag
1
0
Fork 0
mirror of https://github.com/zaphar/merkle-dag.git synced 2025-07-22 18:50:13 -04:00
Code Issues Packages Projects Releases Wiki Activity

more reliable properties about node size

Browse Source
This commit is contained in:
Jeremy Wall 2022-08-02 17:41:21 -04:00
parent be789a2fee
commit 3d50dda7f8
1 changed files with 5 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
src/proptest.rs
View File

@ -38,9 +38,11 @@ proptest! {
let mut dag = DAG::<String, DefaultHasher, 8>::new(); let mut dag = DAG::<String, DefaultHasher, 8>::new();
let parent_count = parent_idxs.len(); let parent_count = parent_idxs.len();
let mut dependents = BTreeMap::new(); let mut dependents = BTreeMap::new();
let mut node_set = BTreeSet::new();
for (idx, n) in nodes.iter().cloned().enumerate() { for (idx, n) in nodes.iter().cloned().enumerate() {
if !parent_idxs.contains(&idx) { if !parent_idxs.contains(&idx) {
let node_id = dag.add_node(n, BTreeSet::new()).unwrap(); let node_id = dag.add_node(n, BTreeSet::new()).unwrap();
node_set.insert(node_id.clone());
let parent = idx % parent_count; let parent = idx % parent_count;
if dependents.contains_key(&parent) { if dependents.contains_key(&parent) {
dependents.get_mut(&parent).map(|v: &mut BTreeSet<[u8; 8]>| v.insert(node_id)); dependents.get_mut(&parent).map(|v: &mut BTreeSet<[u8; 8]>| v.insert(node_id));
@ -50,9 +52,10 @@ proptest! {
} }
} }
for (pidx, dep_ids) in dependents { for (pidx, dep_ids) in dependents {
dag.add_node(nodes[pidx].clone(), dep_ids).unwrap(); let node_id = dag.add_node(nodes[pidx].clone(), dep_ids).unwrap();
node_set.insert(node_id.clone());
} }
assert!(dag.get_roots().len() <= parent_count); assert!(dag.get_roots().len() <= parent_count);
assert!(dag.get_nodes().len() <= nodes.len()); assert!(dag.get_nodes().len() == node_set.len());
} }
} }