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
use super::Mapper;
use std::borrow::{Borrow, ToOwned};
#[derive(Debug, PartialEq, PartialOrd)]
pub struct KV<K, V>
where
Self: Sized,
K: ToOwned + ?Sized,
V: ToOwned + ?Sized,
{
pub k: K::Owned,
pub v: V::Owned,
}
pub fn contains<M>(inner: M) -> Contains<M> {
Contains(inner)
}
#[derive(Debug)]
pub struct Contains<M>(M);
impl<M, E> Mapper<[E]> for Contains<M>
where
M: Mapper<E, Out = bool>,
{
type Out = bool;
fn map(&mut self, input: &[E]) -> bool {
for elem in input {
if self.0.map(elem) {
return true;
}
}
false
}
}
impl<K, V, KMapper, VMapper> Mapper<KV<K, V>> for (KMapper, VMapper)
where
K: ToOwned + ?Sized,
V: ToOwned + ?Sized,
KMapper: Mapper<K, Out = bool>,
VMapper: Mapper<V, Out = bool>,
{
type Out = bool;
fn map(&mut self, input: &KV<K, V>) -> bool {
self.0.map(input.k.borrow()) && self.1.map(input.v.borrow())
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::mappers::*;
#[test]
fn test_contains() {
let mut c = contains(eq(100));
assert_eq!(true, c.map(vec![100, 200, 300].as_slice()));
assert_eq!(false, c.map(vec![99, 200, 300].as_slice()));
}
#[test]
fn test_tuple() {
let kv: KV<str, str> = KV {
k: "key1".to_owned(),
v: "value1".to_owned(),
};
assert_eq!(true, (matches("key1"), any()).map(&kv));
assert_eq!(true, (matches("key1"), matches("value1")).map(&kv));
assert_eq!(false, (matches("key1"), matches("value2")).map(&kv));
assert_eq!(false, (matches("key2"), matches("value1")).map(&kv));
}
}