Lines Matching defs:count
162 // what the actual element count is, regardless of the match result,
299 // to hold the reference count, while the latter tracks all
3127 if (count() == 0) {
3129 } else if (count() == 1) {
3133 *os << "has " << Elements(count()) << " where\n";
3134 for (size_t i = 0; i != count(); ++i) {
3137 if (i + 1 < count()) {
3146 if (count() == 0) {
3151 *os << "doesn't have " << Elements(count()) << ", or\n";
3152 for (size_t i = 0; i != count(); ++i) {
3155 if (i + 1 < count()) {
3169 ::std::vector<internal::string> explanations(count());
3178 for (; it != stl_container.end() && exam_pos != count(); ++it, ++exam_pos) {
3203 if (actual_count != count()) {
3204 // The element count doesn't match. If the container is empty,
3215 // The element count matches, but the exam_pos-th element doesn't match.
3227 for (size_t i = 0; i != count(); ++i) {
3242 static Message Elements(size_t count) {
3243 return Message() << count << (count == 1 ? " element" : " elements");
3246 size_t count() const { return matchers_.size(); }
3390 // The element count doesn't match. If the container is empty,
3629 // ElementsAreArray(pointer, count)
3637 // array, a pointer and count, a vector, an initializer list, or an
3653 const T* pointer, size_t count) {
3654 return ElementsAreArray(pointer, pointer + count);
3678 // UnorderedElementsAreArray(pointer, count)
3695 UnorderedElementsAreArray(const T* pointer, size_t count) {
3696 return UnorderedElementsAreArray(pointer, pointer + count);