foch 0.0.2

EU4 mod analysis and merge toolkit
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65

use std::collections::BTreeSet;

use serde::{Deserialize, Serialize};

use crate::merge::kernel::{NodeId, RevisionId};

#[derive(Clone, Copy, Debug, Eq, Ord, PartialEq, PartialOrd, Serialize, Deserialize)]
pub struct RevisionNode {
	pub revision: RevisionId,
	pub node: NodeId,
}

impl RevisionNode {
	pub const fn new(revision: RevisionId, node: NodeId) -> Self {
		Self { revision, node }
	}
}

#[derive(Clone, Debug, Default, Eq, PartialEq, Serialize, Deserialize)]
pub struct SourceSet {
	nodes: BTreeSet<RevisionNode>,
}

impl SourceSet {
	pub fn new(nodes: impl IntoIterator<Item = RevisionNode>) -> Self {
		Self {
			nodes: nodes.into_iter().collect(),
		}
	}

	pub fn insert(&mut self, node: RevisionNode) -> bool {
		self.nodes.insert(node)
	}

	pub fn iter(&self) -> impl Iterator<Item = &RevisionNode> {
		self.nodes.iter()
	}

	pub fn is_empty(&self) -> bool {
		self.nodes.is_empty()
	}

	#[cfg(test)]
	pub fn len(&self) -> usize {
		self.nodes.len()
	}
}

#[cfg(test)]
mod tests {
	use super::*;

	#[test]
	fn source_sets_are_sorted_and_deduplicated() {
		let source = RevisionNode::new(RevisionId::new(2), NodeId::new(4));
		let set = SourceSet::new([
			source,
			RevisionNode::new(RevisionId::new(1), NodeId::new(8)),
			source,
		]);

		assert_eq!(set.iter().copied().collect::<Vec<_>>().len(), 2);
		assert_eq!(set.iter().next().unwrap().revision, RevisionId::new(1));
	}
}