remove duplicate asserts

1 files changed, 0 insertions, 11 deletions

diff --git a/cli/src/search.rs b/cli/src/search.rs
index 1febc83..816dca8 100644
--- a/cli/src/search.rs
+++ b/cli/src/search.rs
@@ -326,7 +326,6 @@ mod test {
         assert_eq!(search.get().len(), 3);
         let category_filter = Filter::Intersect(Constraint::Category("C1".to_string()));
         search = search.apply(category_filter);
-        assert_eq!(search.get().len(), 2);
         assert_eq!(ids(&search), vec![0, 1]);
     }
 
@@ -358,19 +357,16 @@ mod test {
         let mut search_before = search.clone();
         let before_filter = Filter::Intersect(Constraint::Before(date.clone()));
         search_before = search_before.apply(before_filter);
-        assert_eq!(search_before.get().len(), 1);
         assert_eq!(ids(&search_before), vec![0]);
 
         let mut search_after = search.clone();
         let after_filter = Filter::Intersect(Constraint::After(date.clone()));
         search_after = search_after.apply(after_filter);
-        assert_eq!(search_after.get().len(), 3);
         assert_eq!(ids(&search_after), vec![1, 2, 3]);
 
         let mut search_on = search.clone();
         let on_filter = Filter::Intersect(Constraint::On(date.clone()));
         search_on = search_on.apply(on_filter);
-        assert_eq!(search_on.get().len(), 1);
         assert_eq!(ids(&search_on), vec![1]);
     }
 
@@ -401,7 +397,6 @@ mod test {
         let less_filter =
             Filter::Intersect(Constraint::AmountCompare(160.into(), Comparison::Less));
         search_less = search_less.apply(less_filter);
-        assert_eq!(search_less.get().len(), 1);
         assert_eq!(ids(&search_less), vec![0]);
 
         let mut search_less_eq = search.clone();
@@ -410,20 +405,17 @@ mod test {
             Comparison::LessOrEqual,
         ));
         search_less_eq = search_less_eq.apply(less_eq_filter);
-        assert_eq!(search_less_eq.get().len(), 2);
         assert_eq!(ids(&search_less_eq), vec![0, 1]);
 
         let mut search_eq = search.clone();
         let eq_filter = Filter::Intersect(Constraint::AmountCompare(160.into(), Comparison::Equal));
         search_eq = search_eq.apply(eq_filter);
-        assert_eq!(search_eq.get().len(), 1);
         assert_eq!(ids(&search_eq), vec![1]);
 
         let mut search_greater = search.clone();
         let greater_filter =
             Filter::Intersect(Constraint::AmountCompare(160.into(), Comparison::Greater));
         search_greater = search_greater.apply(greater_filter);
-        assert_eq!(search_greater.get().len(), 2);
         assert_eq!(ids(&search_greater), vec![2, 3]);
 
         let mut search_greater_eq = search.clone();
@@ -432,7 +424,6 @@ mod test {
             Comparison::GreaterOrEqual,
         ));
         search_greater_eq = search_greater_eq.apply(greater_eq_filter);
-        assert_eq!(search_greater_eq.get().len(), 3);
         assert_eq!(ids(&search_greater_eq), vec![1, 2, 3]);
     }
 
@@ -468,7 +459,6 @@ mod test {
         let mut search_filters_1 = search.clone();
         search_filters_1 = search_filters_1.apply(Filter::Intersect(c1.clone()));
         search_filters_1 = search_filters_1.apply(Filter::Union(amount_150.clone()));
-        assert_eq!(search_filters_1.get().len(), 3);
         assert_eq!(ids(&search_filters_1), vec![0, 1, 2]);
 
         // Wrap an intersect in a union.
@@ -476,7 +466,6 @@ mod test {
         let inner_filters = Constraint::Filters(vec![Filter::Intersect(amount_150)]);
         search_filters_2 = search_filters_2.apply(Filter::Intersect(c1));
         search_filters_2 = search_filters_2.apply(Filter::Union(inner_filters));
-        assert_eq!(search_filters_2.get().len(), 3);
         assert_eq!(ids(&search_filters_2), vec![0, 1, 2]);
     }