antifacet 0.1.0

crate for general utilities
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

use std::collections::HashMap;

use antifacet::{
	Aktion,
	cmp::*,
};

fn main() -> eyre::Result<()> {
	let mut lhs = HashMap::new();
	let mut rhs = HashMap::new();

	let mut l = vec![];
	let mut r = vec![];
	for i in 0..10 {
		l.push(i as f64 * 0.3421);
		r.push(i as f64 * 0.3421);
	}
	lhs.insert("first entry", l);
	rhs.insert("first entry", r);

	let mut l = vec![];
	let mut r = vec![];
	for i in 10..12 {
		l.push(i as f64 * 0.3421 - 0.1);
		r.push(i as f64 * 0.3421 + 0.8);
	}
	lhs.insert("second entry", l);
	rhs.insert("second entry", r);

	let mut l = vec![];
	let mut r = vec![];
	for i in 12..20 {
		l.push(i as f64 * 0.3421);
		r.push(i as f64 * 0.3421 + 24.0 / (i * i) as f64);
	}
	lhs.insert("entry in lhs only", l);
	rhs.insert("entry in rhs only", r);

	let mut l = vec![];
	let mut r = vec![];
	for i in 20..22 {
		l.push(i as f64 * 0.3421);
		r.push(i as f64 * 0.3421);
	}
	for i in 22..24 {
		r.push(i as f64 * 0.3421);
	}
	lhs.insert("entry with different lengths", l);
	rhs.insert("entry with different lengths", r);

	antifacet::assert_eq!(lhs, rhs, AbsTol(0.1).boxed().boxed());

	Ok(())
}