keyset 0.1.1

A Rust tool to create pretty keyset layout diagrams using correct fonts and icons.
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94

use std::collections::HashMap;

use maplit::hashmap;

#[derive(Debug, Clone)]
pub struct Kerning {
    pairs: HashMap<(char, char), f32>,
}

impl Kerning {
    pub fn new() -> Self {
        Self { pairs: hashmap! {} }
    }

    pub fn get(&self, lhs: char, rhs: char) -> f32 {
        self.pairs.get(&(lhs, rhs)).copied().unwrap_or(0.)
    }

    pub fn set(&mut self, lhs: char, rhs: char, kern: f32) {
        // Kern should be an integer here
        if kern.abs() > 0.5 {
            self.pairs.insert((lhs, rhs), kern);
        }
    }

    pub fn len(&self) -> usize {
        self.pairs.len()
    }

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

impl Default for Kerning {
    fn default() -> Self {
        Self::new()
    }
}

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

    #[test]
    fn test_get() {
        let kerning = Kerning {
            pairs: hashmap! {('A', 'V') => -50.},
        };

        assert_eq!(kerning.get('A', 'V'), -50.);
        assert_eq!(kerning.get('A', 'B'), 0.);
    }

    #[test]
    fn test_set() {
        let mut kerning = Kerning::new();
        kerning.set('A', 'V', -50.);
        kerning.set('A', 'B', 0.);

        assert!(kerning.pairs.contains_key(&('A', 'V')));
        assert!(!kerning.pairs.contains_key(&('A', 'B')));
    }

    #[test]
    fn test_len() {
        let mut kerning = Kerning::new();

        assert_eq!(kerning.len(), 0);

        kerning.set('A', 'V', -50.);
        kerning.set('A', 'B', 0.);

        assert_eq!(kerning.len(), 1);
    }

    #[test]
    fn test_is_empty() {
        let mut kerning = Kerning::new();

        assert!(kerning.is_empty());

        kerning.set('A', 'V', -50.);
        kerning.set('A', 'B', 0.);

        assert!(!kerning.is_empty());
    }

    #[test]
    fn test_default() {
        let kerning = Kerning::default();
        assert_eq!(kerning.pairs, hashmap! {});
    }
}