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
use crate::assertion_hook::{AssertionHook, NoOpAssertionHook}; use crate::epsilon_provider::EpsilonProvider; use crate::{Should, ShouldaEqual}; use std::borrow::Borrow; use std::fmt::Debug; fn contains_sequence<Epsilon: EpsilonProvider, K: ShouldaEqual, L: Borrow<K>>( sequence: &Vec<L>, v: &Vec<&K>, ) -> bool { if sequence.is_empty() { return true; } let mut curr: Option<usize> = None; let mut iter = v.iter(); (loop { match iter.next() { None => break false, Some(v) => { curr = match curr { None => { if sequence.first().unwrap().borrow().should_eq::<Epsilon>(v) { Some(1) } else { None } } Some(curr) => { if curr == sequence.len() { break true; } if sequence[curr].borrow().should_eq::<Epsilon>(v) { Some(curr + 1) } else { None } } } } } } || (curr.is_some() && curr.unwrap() == sequence.len())) } impl<'a, T, K, Hook, Epsilon> Should<'a, T, Hook, Epsilon> where &'a T: IntoIterator<Item = &'a K>, T: Debug, K: Debug, K: ShouldaEqual, K: 'a, Hook: AssertionHook, Epsilon: EpsilonProvider, { pub fn contain<I: Borrow<K>>(mut self, item: I) -> Should<'a, T, NoOpAssertionHook, Epsilon> { let item = item.borrow(); let v = self.inner.into_iter().collect::<Vec<&K>>(); self.internal_assert( v.iter().any(|x| x.should_eq::<Epsilon>(&item)), format!("{:?} did not contain {:?}", v, item,), ); self.normalize() } pub fn contain_sequence<L: Borrow<K>, I: IntoIterator<Item = L>>( mut self, items: I, ) -> Should<'a, T, NoOpAssertionHook, Epsilon> { let sequence = items.into_iter().collect::<Vec<L>>(); let v = self.inner.into_iter().collect::<Vec<&K>>(); self.internal_assert( contains_sequence::<Epsilon, _, _>(&sequence, &v), format!( "{:?} does not contain the sequence {:?}", v, sequence.iter().map(|x| x.borrow()).collect::<Vec<&K>>() ), ); self.normalize() } pub fn contains<I: Fn(&K) -> bool>( mut self, predicate: I, ) -> Should<'a, T, NoOpAssertionHook, Epsilon> { let v = self.inner.into_iter().collect::<Vec<&K>>(); self.internal_assert( v.iter().map(|x| *x).any(predicate), format!("{:?} did not fufill the predicate", v), ); self.normalize() } } #[cfg(test)] mod tests { use crate::Shoulda; #[test] fn should_contain() { vec![1, 2, 3].should().contain(2); } #[test] fn should_not_contain() { vec![1, 2, 3].should().not().contain(4); } #[test] fn should_contains() { vec![1, 2, 3].should().contains(|x| x % 2 == 0); } #[test] fn should_not_contains() { vec![1, 2, 3].should().not().contains(|x| x % 4 == 0); } #[test] fn should_contain_sequence() { vec![1, 2, 3, 4] .should() .contain_sequence(vec![2, 3]) .and() .contain_sequence(vec![1, 2]) .and() .contain_sequence(vec![2, 3]); } #[test] fn should_not_contain_sequence() { vec![1, 2, 3, 4] .should() .not() .contain_sequence(vec![1, 3]) .and() .not() .contain_sequence(vec![4, 3]) .and() .not() .contain_sequence(vec![3, 2]); } }