Lines Matching defs:Elements
6491 // Implements an equality matcher for any STL-style container whose elements
6494 // The failure message reports elements that are in one of the operands but not
6496 // elements in the containers (which don't properly matter to sets, but can
6508 // We make a copy of rhs in case the elements in it are modified
6550 *os << "which has these unexpected elements: ";
6568 << " doesn't have these expected elements: ";
6587 // T2&> >, where T1 and T2 are the types of elements in the LHS
6596 // Like ContainerEq, we make a copy of rhs in case the elements in
6711 // * All elements in the container match, if all_elements_should_match.
6779 *os << "only contains elements that ";
7032 *os << "has " << Elements(count()) << " where\n";
7050 *os << "doesn't have " << Elements(count()) << ", or\n";
7068 // how many elements there actually are.
7070 *listener << "which has " << Elements(actual_count);
7109 static Message Elements(size_t count) {
7110 return Message() << count << (count == 1 ? " element" : " elements");
7545 // same number of elements as in rhs, where its i-th element and rhs's
7548 // T1&, const T2&> >, where T1 and T2 are the types of elements in the
7585 // elements matching the given value or matcher.
10982 // (n + 1) elements, where the i-th element in the container must
10987 // NOTE: Since ElementsAre() cares about the order of the elements, it
10988 // must not be used with containers whose elements's order is
12470 // Action SetArrayArgument<k>(first, last) copies the elements in
12473 // iterator. The action does not take ownership of the elements in the
