Lines Matching refs:container

2397 // Implements a matcher that checks the size of an STL-style container.
2428 virtual bool MatchAndExplain(Container container,
2430 SizeType size = container.size();
2450 // container.
2482 virtual bool MatchAndExplain(Container container,
2487 DistanceType distance = std::distance(begin(container), end(container));
2489 DistanceType distance = std::distance(container.begin(), container.end());
2510 // Implements an equality matcher for any STL-style container whose elements
2512 // more detailed information that is useful when the container is used as a set.
2518 // Uses the container's const_iterator, value_type, operator ==,
2691 // container and the RHS container respectively.
2814 // * All elements in the container match, if all_elements_should_match.
2815 // * Any element in the container matches, if !all_elements_should_match.
2817 Container container,
2819 StlContainerReference stl_container = View::ConstReference(container);
2862 virtual bool MatchAndExplain(Container container,
2864 return this->MatchAndExplainImpl(false, container, listener);
2891 virtual bool MatchAndExplain(Container container,
2893 return this->MatchAndExplainImpl(true, container, listener);
3161 virtual bool MatchAndExplain(Container container,
3170 StlContainerReference stl_container = View::ConstReference(container);
3195 // Find how many elements the actual container has. We avoid
3204 // The element count doesn't match. If the container is empty,
3206 // prints the empty container. Otherwise we just need to show
3376 virtual bool MatchAndExplain(Container container,
3378 StlContainerReference stl_container = View::ConstReference(container);
3390 // The element count doesn't match. If the container is empty,
3392 // prints the empty container. Otherwise we just need to show
3631 // ElementsAreArray(container)
3665 ElementsAreArray(const Container& container) {
3666 return ElementsAreArray(container.begin(), container.end());
3680 // UnorderedElementsAreArray(container)
3708 UnorderedElementsAreArray(const Container& container) {
3709 return UnorderedElementsAreArray(container.begin(), container.end());
4120 // Returns a matcher that matches the container size. The container must
4124 // EXPECT_THAT(container, SizeIs(2)); // Checks container has 2 elements.
4125 // EXPECT_THAT(container, SizeIs(Le(2)); // Checks container has at most 2.
4132 // Returns a matcher that matches the distance between the container's begin()
4133 // iterator and its end() iterator, i.e. the size of the container. This matcher
4135 // do not implement size(). The container must provide const_iterator (with
4143 // Returns a matcher that matches an equal container.
4145 // values that are included in one container but not the other. (Duplicate
4158 // Returns a matcher that matches a container that, when sorted using
4168 // Returns a matcher that matches a container that, when sorted using
4178 // Matches an STL-style container or a native array that contains the
4183 // LHS container and the RHS container respectively.
4208 // container or a native array that contains the same number of
4209 // elements as in rhs, where in some permutation of the container, its
4213 // the types of elements in the LHS container and the RHS container
4231 // STL-style container and it being a native C-style array.
4263 // Matches an STL-style container or a native array that contains at
4286 // Matches an STL-style container or a native array that contains only
4294 // // Each(m) matches an empty container, regardless of what m is.