// Copyright 2022 Google LLC // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. use crate::{ description::Description, matcher::{Matcher, MatcherResult}, }; use std::{fmt::Debug, marker::PhantomData}; /// Matches an empty container. /// /// `T` can be any container such that `&T` implements `IntoIterator`. For /// instance, `T` can be a common container like `Vec` and /// [`HashSet`][std::collections::HashSet]. /// /// ``` /// # use googletest::prelude::*; /// # use std::collections::HashSet; /// # fn should_pass() -> Result<()> { /// let value: Vec = vec![]; /// verify_that!(value, empty())?; /// let value: HashSet = HashSet::new(); /// verify_that!(value, empty())?; /// # Ok(()) /// # } /// # should_pass().unwrap(); /// ``` /// /// One can also check whether a slice is empty by dereferencing it: /// /// ``` /// # use googletest::prelude::*; /// # use std::collections::HashSet; /// # fn should_pass() -> Result<()> { /// let value: &[u32] = &[]; /// verify_that!(*value, empty())?; /// # Ok(()) /// # } /// # should_pass().unwrap(); /// ``` pub fn empty() -> impl Matcher where for<'a> &'a T: IntoIterator, { EmptyMatcher { phantom: Default::default() } } struct EmptyMatcher { phantom: PhantomData, } impl Matcher for EmptyMatcher where for<'a> &'a T: IntoIterator, { type ActualT = T; fn matches(&self, actual: &T) -> MatcherResult { actual.into_iter().next().is_none().into() } fn describe(&self, matcher_result: MatcherResult) -> Description { if matcher_result.into() { "is empty" } else { "isn't empty" }.into() } } #[cfg(test)] mod tests { use super::empty; use crate::prelude::*; use std::collections::HashSet; #[test] fn empty_matcher_match_empty_vec() -> Result<()> { let value: Vec = vec![]; verify_that!(value, empty()) } #[test] fn empty_matcher_does_not_match_empty_vec() -> Result<()> { let value = vec![1, 2, 3]; verify_that!(value, not(empty())) } #[test] fn empty_matcher_matches_empty_slice() -> Result<()> { let value: &[i32] = &[]; verify_that!(*value, empty()) } #[test] fn empty_matcher_matches_empty_hash_set() -> Result<()> { let value: HashSet = HashSet::new(); verify_that!(value, empty()) } }