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

Get rid of the const generics

Browse Source
This commit is contained in:
Jeremy Wall 2022-08-24 10:00:08 -04:00
parent d723d427e6
commit fac65fe8cf
8 changed files with 108 additions and 226 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
src/blake2.rs
View File

@ -16,24 +16,24 @@ use blake2::digest::Digest;
pub use blake2::{Blake2b512, Blake2s256}; pub use blake2::{Blake2b512, Blake2s256};
macro_rules! hash_writer_impl { macro_rules! hash_writer_impl {
($tname:ident, $size:expr) => { ($tname:ident) => {
impl HashWriter<$size> for $tname { impl HashWriter for $tname {
fn record<I: Iterator<Item = u8>>(&mut self, bs: I) { fn record<I: Iterator<Item = u8>>(&mut self, bs: I) {
let vec: Vec<u8> = bs.collect(); let vec: Vec<u8> = bs.collect();
self.update(&vec); self.update(&vec);
} }
fn hash(&self) -> [u8; $size] { fn hash(&self) -> Vec<u8> {
let mut out: [u8; $size] = Default::default(); let mut out = Vec::new();
// This is gross but Blake2 doesn't support the // This is gross but Blake2 doesn't support the
// non consuming version of this. // non consuming version of this.
let mut arr = self.clone().finalize(); let arr = self.clone().finalize();
arr.swap_with_slice(&mut out); out.extend(arr);
out out
} }
} }
}; };
} }
hash_writer_impl!(Blake2b512, 8); hash_writer_impl!(Blake2b512);
hash_writer_impl!(Blake2s256, 4); hash_writer_impl!(Blake2s256);

54
src/dag.rs
View File

@ -44,20 +44,20 @@ pub enum NodeCompare {
/// A merkle DAG instance is tied to a specific implementation of the HashWriter interface to ensure /// A merkle DAG instance is tied to a specific implementation of the HashWriter interface to ensure
/// that all hash identifiers are of the same hash algorithm. /// that all hash identifiers are of the same hash algorithm.
#[derive(Clone, Debug)] #[derive(Clone, Debug)]
pub struct Merkle<S, HW, const HASH_LEN: usize> pub struct Merkle<S, HW>
where where
HW: HashWriter<HASH_LEN>, HW: HashWriter,
S: Store<HW, HASH_LEN>, S: Store<HW>,
{ {
roots: BTreeSet<[u8; HASH_LEN]>, roots: BTreeSet<Vec<u8>>,
nodes: S, nodes: S,
_phantom_node: PhantomData<Node<HW, HASH_LEN>>, _phantom_node: PhantomData<Node<HW>>,
} }
impl<S, HW, const HASH_LEN: usize> Merkle<S, HW, HASH_LEN> impl<S, HW> Merkle<S, HW>
where where
HW: HashWriter<HASH_LEN>, HW: HashWriter,
S: Store<HW, HASH_LEN>, S: Store<HW>,
{ {
/// Construct a new empty DAG. The empty DAG is also the default for a DAG. /// Construct a new empty DAG. The empty DAG is also the default for a DAG.
pub fn new() -> Self { pub fn new() -> Self {
@ -73,13 +73,19 @@ where
pub fn add_node<'a, N: Into<Vec<u8>>>( pub fn add_node<'a, N: Into<Vec<u8>>>(
&'a mut self, &'a mut self,
item: N, item: N,
dependency_ids: BTreeSet<[u8; HASH_LEN]>, dependency_ids: BTreeSet<Vec<u8>>,
) -> Result<[u8; HASH_LEN]> { ) -> Result<Vec<u8>> {
let node = Node::<HW, HASH_LEN>::new(item.into(), dependency_ids.clone()); let node = Node::<HW>::new(item.into(), dependency_ids.clone());
let id = node.id().clone(); let id = node.id().to_vec();
if self.nodes.contains(&id)? { if self.nodes.contains(id.as_slice())? {
// We've already added this node so there is nothing left to do. // We've already added this node so there is nothing left to do.
return Ok(id); return Ok(self
.nodes
.get(id.as_slice())
.unwrap()
.unwrap()
.id()
.to_vec());
} }
let mut root_removals = Vec::new(); let mut root_removals = Vec::new();
for dep_id in dependency_ids.iter() { for dep_id in dependency_ids.iter() {
@ -96,22 +102,22 @@ where
for removal in root_removals { for removal in root_removals {
self.roots.remove(removal); self.roots.remove(removal);
} }
self.roots.insert(id); self.roots.insert(id.to_vec());
Ok(id) Ok(id.to_vec())
} }
/// Check if we already have a copy of a node. /// Check if we already have a copy of a node.
pub fn check_for_node(&self, id: &[u8; HASH_LEN]) -> Result<bool> { pub fn check_for_node(&self, id: &[u8]) -> Result<bool> {
return self.nodes.contains(id); return self.nodes.contains(id);
} }
/// Get a node from the DAG by it's hash identifier if it exists. /// Get a node from the DAG by it's hash identifier if it exists.
pub fn get_node_by_id(&self, id: &[u8; HASH_LEN]) -> Result<Option<Node<HW, HASH_LEN>>> { pub fn get_node_by_id(&self, id: &[u8]) -> Result<Option<Node<HW>>> {
self.nodes.get(id) self.nodes.get(id)
} }
/// Get the set of root node ids. /// Get the set of root node ids.
pub fn get_roots(&self) -> &BTreeSet<[u8; HASH_LEN]> { pub fn get_roots(&self) -> &BTreeSet<Vec<u8>> {
&self.roots &self.roots
} }
@ -125,7 +131,7 @@ where
/// then returns `NodeCompare::After`. If both id's are equal then the returns /// then returns `NodeCompare::After`. If both id's are equal then the returns
/// `NodeCompare::Equivalent`. If neither id are parts of the same subgraph then returns /// `NodeCompare::Equivalent`. If neither id are parts of the same subgraph then returns
/// `NodeCompare::Uncomparable`. /// `NodeCompare::Uncomparable`.
pub fn compare(&self, left: &[u8; HASH_LEN], right: &[u8; HASH_LEN]) -> Result<NodeCompare> { pub fn compare(&self, left: &[u8], right: &[u8]) -> Result<NodeCompare> {
Ok(if left == right { Ok(if left == right {
NodeCompare::Equivalent NodeCompare::Equivalent
} else { } else {
@ -141,7 +147,7 @@ where
}) })
} }
fn search_graph(&self, root_id: &[u8; HASH_LEN], search_id: &[u8; HASH_LEN]) -> Result<bool> { fn search_graph(&self, root_id: &[u8], search_id: &[u8]) -> Result<bool> {
if root_id == search_id { if root_id == search_id {
return Ok(true); return Ok(true);
} }
@ -169,10 +175,10 @@ where
} }
} }
impl<S, HW, const HASH_LEN: usize> Default for Merkle<S, HW, HASH_LEN> impl<S, HW> Default for Merkle<S, HW>
where where
HW: HashWriter<HASH_LEN>, HW: HashWriter,
S: Store<HW, HASH_LEN>, S: Store<HW>,
{ {
fn default() -> Self { fn default() -> Self {
Self { Self {

10
src/hash.rs
View File

@ -17,21 +17,21 @@ use std::hash::Hasher;
/// Utility Trait to specify the hashing algorithm and provide a common /// Utility Trait to specify the hashing algorithm and provide a common
/// interface for that algorithm to provide. This interface is expected to /// interface for that algorithm to provide. This interface is expected to
/// be stateful. /// be stateful.
pub trait HashWriter<const LEN: usize>: Default { pub trait HashWriter: Default {
/// Record bytes from an iterator into our hash algorithm. /// Record bytes from an iterator into our hash algorithm.
fn record<I: Iterator<Item = u8>>(&mut self, bs: I); fn record<I: Iterator<Item = u8>>(&mut self, bs: I);
/// Provide the current hash value based on the bytes that have so far been recorded. /// Provide the current hash value based on the bytes that have so far been recorded.
fn hash(&self) -> [u8; LEN]; fn hash(&self) -> Vec<u8>;
} }
impl HashWriter<8> for DefaultHasher { impl HashWriter for DefaultHasher {
fn record<I: Iterator<Item = u8>>(&mut self, iter: I) { fn record<I: Iterator<Item = u8>>(&mut self, iter: I) {
let bytes = iter.collect::<Vec<u8>>(); let bytes = iter.collect::<Vec<u8>>();
self.write(bytes.as_slice()); self.write(bytes.as_slice());
} }
fn hash(&self) -> [u8; 8] { fn hash(&self) -> Vec<u8> {
self.finish().to_le_bytes() self.finish().to_le_bytes().to_vec()
} }
} }

8
src/leveldb/mod.rs
View File

@ -37,12 +37,12 @@ impl LevelStore {
}) })
} }
} }
impl Store<Blake2b512, 8> for LevelStore { impl Store<Blake2b512> for LevelStore {
fn contains(&self, id: &[u8; 8]) -> Result<bool> { fn contains(&self, id: &[u8]) -> Result<bool> {
Ok(self.store.borrow_mut().get(id).is_some()) Ok(self.store.borrow_mut().get(id).is_some())
} }
fn get(&self, id: &[u8; 8]) -> Result<Option<Node<Blake2b512, 8>>> { fn get(&self, id: &[u8]) -> Result<Option<Node<Blake2b512>>> {
Ok(match self.store.borrow_mut().get(id) { Ok(match self.store.borrow_mut().get(id) {
Some(bs) => ciborium::de::from_reader(bs.as_slice()) Some(bs) => ciborium::de::from_reader(bs.as_slice())
.map_err(|e| StoreError::StoreFailure(format!("Invalid serialization {:?}", e)))?, .map_err(|e| StoreError::StoreFailure(format!("Invalid serialization {:?}", e)))?,
@ -50,7 +50,7 @@ impl Store<Blake2b512, 8> for LevelStore {
}) })
} }
fn store(&mut self, node: Node<Blake2b512, 8>) -> Result<()> { fn store(&mut self, node: Node<Blake2b512>) -> Result<()> {
let mut buf = Vec::new(); let mut buf = Vec::new();
ciborium::ser::into_writer(&node, &mut buf).unwrap(); ciborium::ser::into_writer(&node, &mut buf).unwrap();
self.store.borrow_mut().put(node.id(), &buf)?; self.store.borrow_mut().put(node.id(), &buf)?;

172
src/node.rs
View File

@ -13,7 +13,7 @@
// limitations under the License. // limitations under the License.
use std::{collections::BTreeSet, marker::PhantomData}; use std::{collections::BTreeSet, marker::PhantomData};
use serde::{de::Visitor, ser::SerializeStruct, Deserialize, Deserializer, Serialize, Serializer}; use serde::{Deserialize, Serialize};
use crate::hash::HashWriter; use crate::hash::HashWriter;
@ -27,21 +27,21 @@ use crate::hash::HashWriter;
/// Nodes are tied to a specific implementation of the HashWriter trait which is itself tied /// Nodes are tied to a specific implementation of the HashWriter trait which is itself tied
/// to the DAG they are stored in guaranteeing that the same Hashing implementation is used /// to the DAG they are stored in guaranteeing that the same Hashing implementation is used
/// for each node in the DAG. /// for each node in the DAG.
#[derive(Debug, PartialEq, Eq)] #[derive(Debug, PartialEq, Eq, Serialize, Deserialize)]
pub struct Node<HW, const HASH_LEN: usize> pub struct Node<HW>
where where
HW: HashWriter<HASH_LEN>, HW: HashWriter,
{ {
id: [u8; HASH_LEN], id: Vec<u8>,
item: Vec<u8>, item: Vec<u8>,
item_id: [u8; HASH_LEN], item_id: Vec<u8>,
dependency_ids: BTreeSet<[u8; HASH_LEN]>, dependency_ids: BTreeSet<Vec<u8>>,
_phantom: PhantomData<HW>, _phantom: PhantomData<HW>,
} }
impl<HW, const HASH_LEN: usize> Clone for Node<HW, HASH_LEN> impl<HW> Clone for Node<HW>
where where
HW: HashWriter<HASH_LEN>, HW: HashWriter,
{ {
fn clone(&self) -> Self { fn clone(&self) -> Self {
Self { Self {
@ -54,149 +54,12 @@ where
} }
} }
fn coerce_non_const_generic_set<const HASH_LEN: usize>( impl<HW> Node<HW>
set: &BTreeSet<[u8; HASH_LEN]>,
) -> BTreeSet<&[u8]> {
let mut coerced_item = BTreeSet::new();
for arr in set {
coerced_item.insert(arr.as_slice());
}
coerced_item
}
impl<HW, const HASH_LEN: usize> Serialize for Node<HW, HASH_LEN>
where where
HW: HashWriter<HASH_LEN>, HW: HashWriter,
{
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
S: Serializer,
{
let mut structor = serializer.serialize_struct("Node", 4)?;
structor.serialize_field("item", &self.item)?;
structor.serialize_field(
"dependency_ids",
&coerce_non_const_generic_set(&self.dependency_ids),
)?;
structor.end()
}
}
fn coerce_const_generic_array<const HASH_LEN: usize>(
slice: &[u8],
) -> Result<[u8; HASH_LEN], String> {
let mut coerced_item: [u8; HASH_LEN] = [0; HASH_LEN];
if slice.len() > coerced_item.len() {
return Err(format!(
"Expected slice of length: {} but got slice of length: {}",
coerced_item.len(),
slice.len()
));
} else {
coerced_item.copy_from_slice(slice);
}
Ok(coerced_item)
}
fn coerce_const_generic_set<const HASH_LEN: usize>(
set: BTreeSet<&[u8]>,
) -> Result<BTreeSet<[u8; HASH_LEN]>, String> {
let mut coerced_item = BTreeSet::new();
for slice in set {
coerced_item.insert(coerce_const_generic_array(slice)?);
}
Ok(coerced_item)
}
impl<'de, HW, const HASH_LEN: usize> Deserialize<'de> for Node<HW, HASH_LEN>
where
HW: HashWriter<HASH_LEN>,
{
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
D: Deserializer<'de>,
{
#[derive(Deserialize)]
#[serde(field_identifier, rename_all = "lowercase")]
#[allow(non_camel_case_types)]
enum Field {
Item,
Dependency_Ids,
}
struct NodeVisitor<HW, const HASH_LEN: usize>(PhantomData<HW>);
impl<'de, HW, const HASH_LEN: usize> Visitor<'de> for NodeVisitor<HW, HASH_LEN>
where
HW: HashWriter<HASH_LEN>,
{
type Value = Node<HW, HASH_LEN>;
fn expecting(&self, formatter: &mut std::fmt::Formatter) -> std::fmt::Result {
formatter.write_str("struct Node")
}
fn visit_seq<A>(self, mut seq: A) -> Result<Self::Value, A::Error>
where
A: serde::de::SeqAccess<'de>,
{
let item = seq
.next_element::<Vec<u8>>()?
.ok_or_else(|| serde::de::Error::invalid_length(1, &self))?;
let dependency_ids: BTreeSet<[u8; HASH_LEN]> = coerce_const_generic_set(
seq.next_element::<BTreeSet<&[u8]>>()?
.ok_or_else(|| serde::de::Error::invalid_length(3, &self))?,
)
.map_err(serde::de::Error::custom)?;
Ok(Self::Value::new(item, dependency_ids))
}
fn visit_map<A>(self, mut map: A) -> Result<Self::Value, A::Error>
where
A: serde::de::MapAccess<'de>,
{
let mut item: Option<Vec<u8>> = None;
let mut dependency_ids: Option<BTreeSet<[u8; HASH_LEN]>> = None;
while let Some(key) = map.next_key()? {
match key {
Field::Item => {
if item.is_some() {
return Err(serde::de::Error::duplicate_field("item"));
} else {
item = Some(map.next_value()?);
}
}
Field::Dependency_Ids => {
if dependency_ids.is_some() {
return Err(serde::de::Error::duplicate_field("dependency_ids"));
} else {
dependency_ids = Some(
coerce_const_generic_set(map.next_value()?)
.map_err(serde::de::Error::custom)?,
);
}
}
}
}
let item = item.ok_or_else(|| serde::de::Error::missing_field("item"))?;
let dependency_ids = dependency_ids
.ok_or_else(|| serde::de::Error::missing_field("dependency_ids"))?;
Ok(Self::Value::new(item, dependency_ids))
}
}
const FIELDS: &'static [&'static str] = &["item", "dependency_ids"];
deserializer.deserialize_struct("Node", FIELDS, NodeVisitor::<HW, HASH_LEN>(PhantomData))
}
}
impl<HW, const HASH_LEN: usize> Node<HW, HASH_LEN>
where
HW: HashWriter<HASH_LEN>,
{ {
/// Construct a new node with a payload and a set of dependency_ids. /// Construct a new node with a payload and a set of dependency_ids.
pub fn new<P: Into<Vec<u8>>>(item: P, dependency_ids: BTreeSet<[u8; HASH_LEN]>) -> Self { pub fn new<P: Into<Vec<u8>>>(item: P, dependency_ids: BTreeSet<Vec<u8>>) -> Self {
let mut hw = HW::default(); let mut hw = HW::default();
let item = item.into(); let item = item.into();
// NOTE(jwall): The order here is important. Our reliable id creation must be stable // NOTE(jwall): The order here is important. Our reliable id creation must be stable
@ -205,10 +68,7 @@ where
hw.record(item.iter().cloned()); hw.record(item.iter().cloned());
let item_id = hw.hash(); let item_id = hw.hash();
// 2. Sort the dependency ids before recording them into our node id hash. // 2. Sort the dependency ids before recording them into our node id hash.
let mut dependency_list = dependency_ids let mut dependency_list = dependency_ids.iter().cloned().collect::<Vec<Vec<u8>>>();
.iter()
.cloned()
.collect::<Vec<[u8; HASH_LEN]>>();
dependency_list.sort(); dependency_list.sort();
// 3. record the dependency ids into our node id hash in the sorted order. // 3. record the dependency ids into our node id hash in the sorted order.
for d in dependency_list.iter() { for d in dependency_list.iter() {
@ -223,7 +83,7 @@ where
} }
} }
pub fn id(&self) -> &[u8; HASH_LEN] { pub fn id(&self) -> &[u8] {
&self.id &self.id
} }
@ -231,11 +91,11 @@ where
&self.item &self.item
} }
pub fn item_id(&self) -> &[u8; HASH_LEN] { pub fn item_id(&self) -> &[u8] {
&self.item_id &self.item_id
} }
pub fn dependency_ids(&self) -> &BTreeSet<[u8; HASH_LEN]> { pub fn dependency_ids(&self) -> &BTreeSet<Vec<u8>> {
&self.dependency_ids &self.dependency_ids
} }
} }

8
src/proptest.rs
View File

@ -17,7 +17,7 @@ use proptest::prelude::*;
use crate::prelude::*; use crate::prelude::*;
type TestDag = Merkle<BTreeMap<[u8; 8], Node<DefaultHasher, 8>>, DefaultHasher, 8>; type TestDag = Merkle<BTreeMap<Vec<u8>, Node<DefaultHasher>>, DefaultHasher>;
fn simple_edge_strategy( fn simple_edge_strategy(
nodes_count: usize, nodes_count: usize,
@ -42,10 +42,10 @@ fn complex_dag_strategy(
let nodes_len = payloads.len(); let nodes_len = payloads.len();
let mut dag = TestDag::new(); let mut dag = TestDag::new();
// partition the payloads into depth pieces // partition the payloads into depth pieces
let mut id_stack: Vec<[u8; 8]> = Vec::new(); let mut id_stack: Vec<Vec<u8>> = Vec::new();
for chunk in payloads.chunks(nodes_len / depth) { for chunk in payloads.chunks(nodes_len / depth) {
// loop through the partions adding each partions nodes to the dag. // loop through the partions adding each partions nodes to the dag.
let dep_sets: Vec<BTreeSet<[u8; 8]>> = if id_stack.is_empty() { let dep_sets: Vec<BTreeSet<Vec<u8>>> = if id_stack.is_empty() {
vec![BTreeSet::new()] vec![BTreeSet::new()]
} else { } else {
let mut dep_sets = Vec::new(); let mut dep_sets = Vec::new();
@ -83,7 +83,7 @@ proptest! {
node_set.insert(node_id.clone()); 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<Vec<u8>>| v.insert(node_id));
} else { } else {
dependents.insert(parent, BTreeSet::from([node_id])); dependents.insert(parent, BTreeSet::from([node_id]));
} }

22
src/store.rs
View File

@ -23,29 +23,29 @@ pub enum StoreError {
NoSuchDependents, NoSuchDependents,
} }
pub trait Store<HW, const HASH_LEN: usize>: Default pub trait Store<HW>: Default
where where
HW: HashWriter<HASH_LEN>, HW: HashWriter,
{ {
fn contains(&self, id: &[u8; HASH_LEN]) -> Result<bool>; fn contains(&self, id: &[u8]) -> Result<bool>;
fn get(&self, id: &[u8; HASH_LEN]) -> Result<Option<Node<HW, HASH_LEN>>>; fn get(&self, id: &[u8]) -> Result<Option<Node<HW>>>;
fn store(&mut self, node: Node<HW, HASH_LEN>) -> Result<()>; fn store(&mut self, node: Node<HW>) -> Result<()>;
} }
impl<HW, const HASH_LEN: usize> Store<HW, HASH_LEN> for BTreeMap<[u8; HASH_LEN], Node<HW, HASH_LEN>> impl<HW> Store<HW> for BTreeMap<Vec<u8>, Node<HW>>
where where
HW: HashWriter<HASH_LEN>, HW: HashWriter,
{ {
fn contains(&self, id: &[u8; HASH_LEN]) -> Result<bool> { fn contains(&self, id: &[u8]) -> Result<bool> {
Ok(self.contains_key(id)) Ok(self.contains_key(id))
} }
fn get(&self, id: &[u8; HASH_LEN]) -> Result<Option<Node<HW, HASH_LEN>>> { fn get(&self, id: &[u8]) -> Result<Option<Node<HW>>> {
Ok(self.get(id).cloned()) Ok(self.get(id).cloned())
} }
fn store(&mut self, node: Node<HW, HASH_LEN>) -> Result<()> { fn store(&mut self, node: Node<HW>) -> Result<()> {
self.insert(node.id().clone(), node); self.insert(node.id().to_vec(), node);
Ok(()) Ok(())
} }
} }

44
src/test.rs
View File

@ -17,9 +17,8 @@ use std::collections::{BTreeMap, BTreeSet};
use crate::prelude::*; use crate::prelude::*;
type TestDag<'a> = Merkle< type TestDag<'a> = Merkle<
BTreeMap<[u8; 8], Node<std::collections::hash_map::DefaultHasher, 8>>, BTreeMap<Vec<u8>, Node<std::collections::hash_map::DefaultHasher>>,
std::collections::hash_map::DefaultHasher, std::collections::hash_map::DefaultHasher,
8,
>; >;
#[test] #[test]
@ -32,7 +31,7 @@ fn test_root_pointer_hygiene() {
); );
assert!(dag.get_roots().contains(&quax_node_id)); assert!(dag.get_roots().contains(&quax_node_id));
let mut dep_set = BTreeSet::new(); let mut dep_set = BTreeSet::new();
dep_set.insert(quax_node_id); dep_set.insert(quax_node_id.clone());
let quux_node_id = dag.add_node("quux", dep_set).unwrap(); let quux_node_id = dag.add_node("quux", dep_set).unwrap();
assert!(!dag.get_roots().contains(&quax_node_id)); assert!(!dag.get_roots().contains(&quax_node_id));
assert!(dag.get_roots().contains(&quux_node_id)); assert!(dag.get_roots().contains(&quux_node_id));
@ -45,10 +44,10 @@ fn test_root_pointer_hygiene() {
#[test] #[test]
fn test_insert_no_such_dependents_error() { fn test_insert_no_such_dependents_error() {
let missing_dependent = let missing_dependent =
Node::<DefaultHasher, 8>::new("missing".as_bytes().to_vec(), BTreeSet::new()); Node::<DefaultHasher>::new("missing".as_bytes().to_vec(), BTreeSet::new());
let mut dag = TestDag::new(); let mut dag = TestDag::new();
let mut dep_set = BTreeSet::new(); let mut dep_set = BTreeSet::new();
dep_set.insert(*missing_dependent.id()); dep_set.insert(missing_dependent.id().to_vec());
assert!(dag.add_node("foo", dep_set).is_err()); assert!(dag.add_node("foo", dep_set).is_err());
assert!(dag.get_roots().is_empty()); assert!(dag.get_roots().is_empty());
assert!(dag.get_nodes().is_empty()); assert!(dag.get_nodes().is_empty());
@ -76,17 +75,29 @@ fn test_adding_nodes_is_idempotent_regardless_of_dep_order() {
let quake_node_id = dag.add_node("quake", BTreeSet::new()).unwrap(); let quake_node_id = dag.add_node("quake", BTreeSet::new()).unwrap();
let qualm_node_id = dag.add_node("qualm", BTreeSet::new()).unwrap(); let qualm_node_id = dag.add_node("qualm", BTreeSet::new()).unwrap();
let quell_node_id = dag.add_node("quell", BTreeSet::new()).unwrap(); let quell_node_id = dag.add_node("quell", BTreeSet::new()).unwrap();
let dep_ids = BTreeSet::from([quake_node_id, qualm_node_id, quell_node_id]); let dep_ids = BTreeSet::from([
quake_node_id.clone(),
qualm_node_id.clone(),
quell_node_id.clone(),
]);
dag.add_node("foo", dep_ids).unwrap(); dag.add_node("foo", dep_ids).unwrap();
let root_size = dag.get_roots().len(); let root_size = dag.get_roots().len();
let nodes_size = dag.get_nodes().len(); let nodes_size = dag.get_nodes().len();
let dep_ids = BTreeSet::from([quell_node_id, quake_node_id, qualm_node_id]); let dep_ids = BTreeSet::from([
quell_node_id.clone(),
quake_node_id.clone(),
qualm_node_id.clone(),
]);
dag.add_node("foo", dep_ids).unwrap(); dag.add_node("foo", dep_ids).unwrap();
assert_eq!(root_size, dag.get_roots().len()); assert_eq!(root_size, dag.get_roots().len());
assert_eq!(nodes_size, dag.get_nodes().len()); assert_eq!(nodes_size, dag.get_nodes().len());
let dep_ids = BTreeSet::from([qualm_node_id, quell_node_id, quake_node_id]); let dep_ids = BTreeSet::from([
qualm_node_id.clone(),
quell_node_id.clone(),
quake_node_id.clone(),
]);
dag.add_node("foo", dep_ids).unwrap(); dag.add_node("foo", dep_ids).unwrap();
assert_eq!(root_size, dag.get_roots().len()); assert_eq!(root_size, dag.get_roots().len());
assert_eq!(nodes_size, dag.get_nodes().len()); assert_eq!(nodes_size, dag.get_nodes().len());
@ -174,20 +185,25 @@ mod cbor_serialization_tests {
let mut dag = TestDag::new(); let mut dag = TestDag::new();
let simple_node_id = dag.add_node("simple", BTreeSet::new()).unwrap(); let simple_node_id = dag.add_node("simple", BTreeSet::new()).unwrap();
let mut dep_set = BTreeSet::new(); let mut dep_set = BTreeSet::new();
dep_set.insert(simple_node_id); dep_set.insert(simple_node_id.clone());
let root_node_id = dag.add_node("root", dep_set).unwrap(); let root_node_id = dag.add_node("root", dep_set).unwrap();
let simple_node_to_serialize = dag.get_node_by_id(&simple_node_id).unwrap().unwrap(); let simple_node_to_serialize = dag
let root_node_to_serialize = dag.get_node_by_id(&root_node_id).unwrap().unwrap(); .get_node_by_id(simple_node_id.as_slice())
.unwrap()
.unwrap();
let root_node_to_serialize = dag
.get_node_by_id(root_node_id.as_slice())
.unwrap()
.unwrap();
let mut simple_node_vec: Vec<u8> = Vec::new(); let mut simple_node_vec: Vec<u8> = Vec::new();
let mut root_node_vec: Vec<u8> = Vec::new(); let mut root_node_vec: Vec<u8> = Vec::new();
into_writer(&simple_node_to_serialize, &mut simple_node_vec).unwrap(); into_writer(&simple_node_to_serialize, &mut simple_node_vec).unwrap();
into_writer(&root_node_to_serialize, &mut root_node_vec).unwrap(); into_writer(&root_node_to_serialize, &mut root_node_vec).unwrap();
let simple_node_de: Node<DefaultHasher, 8> = let simple_node_de: Node<DefaultHasher> = from_reader(simple_node_vec.as_slice()).unwrap();
from_reader(simple_node_vec.as_slice()).unwrap(); let root_node_de: Node<DefaultHasher> = from_reader(root_node_vec.as_slice()).unwrap();
let root_node_de: Node<DefaultHasher, 8> = from_reader(root_node_vec.as_slice()).unwrap();
assert_eq!(simple_node_to_serialize.id(), simple_node_de.id()); assert_eq!(simple_node_to_serialize.id(), simple_node_de.id());
assert_eq!(simple_node_to_serialize.item_id(), simple_node_de.item_id()); assert_eq!(simple_node_to_serialize.item_id(), simple_node_de.item_id());
assert_eq!(simple_node_to_serialize.item(), simple_node_de.item()); assert_eq!(simple_node_to_serialize.item(), simple_node_de.item());