caramelo 0.1.1

Idiomatic unit test framework for rust
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154

use crate::{
    MatchType::{self, ToHave},
    Matcher, TypedMatcher,
};
use std::collections::{BTreeMap, BTreeSet, HashMap, HashSet, LinkedList, VecDeque};

/// Creates a matcher that matches values with the given length
///
/// # Examples
///
/// ```
/// use caramelo::{expect, matchers::length};
///
/// expect(vec![1, 2, 3]).to_have(length(3));
/// ```
pub fn length(value: usize) -> Length {
    Length(value)
}

/// Creates a matcher that matches values with the given length (alias for length)
///
/// # Examples
///
/// ```
/// use caramelo::{expect, matchers::len};
///
/// expect(vec![1, 2, 3]).to_have(len(3));
/// ```
pub fn len(value: usize) -> Length {
    length(value)
}

/// Matcher that matches values with a specific length
///
/// # Examples
///
/// ```
/// use caramelo::{expect, matchers::length};
///
/// expect(vec![1, 2, 3]).to_have(length(3));
/// ```
pub struct Length(usize);

impl<T> Matcher<Vec<T>> for Length {
    fn matches(&self, value: &Vec<T>) -> bool {
        self.0 == value.len()
    }

    fn description(&self) -> String {
        format!("length equals to {}", self.0)
    }
}

impl<T> TypedMatcher<Vec<T>> for Length {
    fn matcher_type(&self) -> MatchType {
        ToHave
    }
}

impl<T> Matcher<VecDeque<T>> for Length {
    fn matches(&self, value: &VecDeque<T>) -> bool {
        self.0 == value.len()
    }

    fn description(&self) -> String {
        format!("length equals to {}", self.0)
    }
}

impl<T> TypedMatcher<VecDeque<T>> for Length {
    fn matcher_type(&self) -> MatchType {
        ToHave
    }
}

impl<T> Matcher<LinkedList<T>> for Length {
    fn matches(&self, value: &LinkedList<T>) -> bool {
        self.0 == value.len()
    }

    fn description(&self) -> String {
        format!("length equals to {}", self.0)
    }
}

impl<T> TypedMatcher<LinkedList<T>> for Length {
    fn matcher_type(&self) -> MatchType {
        ToHave
    }
}

impl<K, V> Matcher<HashMap<K, V>> for Length {
    fn matches(&self, value: &HashMap<K, V>) -> bool {
        self.0 == value.len()
    }

    fn description(&self) -> String {
        format!("length equals to {}", self.0)
    }
}

impl<K, V> TypedMatcher<HashMap<K, V>> for Length {
    fn matcher_type(&self) -> MatchType {
        ToHave
    }
}

impl<K, V> Matcher<BTreeMap<K, V>> for Length {
    fn matches(&self, value: &BTreeMap<K, V>) -> bool {
        self.0 == value.len()
    }

    fn description(&self) -> String {
        format!("length equals to {}", self.0)
    }
}

impl<K, V> TypedMatcher<BTreeMap<K, V>> for Length {
    fn matcher_type(&self) -> MatchType {
        ToHave
    }
}

impl<K, V> Matcher<HashSet<K, V>> for Length {
    fn matches(&self, value: &HashSet<K, V>) -> bool {
        self.0 == value.len()
    }

    fn description(&self) -> String {
        format!("length equals to {}", self.0)
    }
}

impl<K, V> TypedMatcher<HashSet<K, V>> for Length {
    fn matcher_type(&self) -> MatchType {
        ToHave
    }
}

impl<T> Matcher<BTreeSet<T>> for Length {
    fn matches(&self, value: &BTreeSet<T>) -> bool {
        self.0 == value.len()
    }

    fn description(&self) -> String {
        format!("length equals to {}", self.0)
    }
}

impl<T> TypedMatcher<BTreeSet<T>> for Length {
    fn matcher_type(&self) -> MatchType {
        ToHave
    }
}