Lines Matching refs:end

1113   // Are we at the end of either s1 or s2?
1313 *os << "doesn't end with ";
2449 // Implements a matcher that checks the begin()..end() distance of an STL-style
2474 *os << "distance between begin() and end() ";
2478 *os << "distance between begin() and end() ";
2486 using std::end;
2487 DistanceType distance = std::distance(begin(container), end(container));
2489 DistanceType distance = std::distance(container.begin(), container.end());
2494 *listener << "whose distance between begin() and end() " << distance
2519 // begin(), and end().
2564 it != lhs_stl_container.end(); ++it) {
2565 if (internal::ArrayAwareFind(expected_.begin(), expected_.end(), *it) ==
2566 expected_.end()) {
2580 it != expected_.end(); ++it) {
2582 lhs_stl_container.begin(), lhs_stl_container.end(), *it) ==
2583 lhs_stl_container.end()) {
2653 lhs_stl_container.end());
2655 sorted_container.begin(), sorted_container.end(), comparator_);
2822 it != stl_container.end(); ++it, ++i) {
3176 // the end of either the elements or the matchers, or until we find a
3178 for (; it != stl_container.end() && exam_pos != count(); ++it, ++exam_pos) {
3199 for (; it != stl_container.end(); ++it) {
3381 stl_container.end(),
3467 matchers.begin(), matchers.end()));
3492 matchers.begin(), matchers.end()));
3514 matchers_.end()));
3533 matchers_.begin(), matchers_.end()));
3666 return ElementsAreArray(container.begin(), container.end());
3673 return ElementsAreArray(xs.begin(), xs.end());
3709 return UnorderedElementsAreArray(container.begin(), container.end());
3716 return UnorderedElementsAreArray(xs.begin(), xs.end());
4133 // iterator and its end() iterator, i.e. the size of the container. This matcher
4136 // valid iterator_traits), begin() and end().
4241 it != rhs_stl_container.end(); ++it) {
4396 // We must include this header at the end to make sure it can use the