Lines Matching defs:first
370 // (first to create T from M and then to create Matcher<T> from T).
386 // Note that we first attempt to perform an implicit cast on the value and
614 // if and only if the first N fields of matcher_tuple matches
615 // the first N fields of value_tuple, respectively.
624 // describes failures in matching the first N fields of matchers
625 // against the first N fields of values. If there is no failure,
631 // First, describes failures in the first N - 1 fields.
1212 static const char* Desc() { return "a pair where the first < the second"; }
1216 static const char* Desc() { return "a pair where the first > the second"; }
1220 static const char* Desc() { return "a pair where the first <= the second"; }
1224 static const char* Desc() { return "a pair where the first >= the second"; }
1470 SomeOfArrayMatcher(Iter first, Iter last) : matchers_(first, last) {}
1680 // Compares NaNs first, if nan_eq_nan_ is true.
2095 // the first argument.
2163 // false_type() as the first argument.
2443 // Something is different. Check for extra values first.
2930 auto First(T& x, Rank0) -> decltype((x.first)) { // NOLINT
2931 return x.first;
2945 // Key(inner_matcher) matches an std::pair whose 'first' field matches
2959 // Returns true if and only if 'key_value.first' (the key) matches the inner
2968 *listener << "whose first field is a value " << explanation;
3066 *os << "has a first field that ";
3074 *os << "has a first field that ";
3080 // Returns true if and only if 'a_pair.first' matches first_matcher and
3093 *listener << "whose first field does not match";
3115 *listener << ", where the first field is a value " << first_explanation;
3375 ElementsAreMatcherImpl(InputIter first, InputIter last) {
3376 while (first != last) {
3377 matchers_.push_back(MatcherCast<const Element&>(*first++));
3620 InputIter first, InputIter last)
3622 for (; first != last; ++first) {
3623 matchers_.push_back(MatcherCast<const Element&>(*first));
3756 Iter first, Iter last)
3757 : match_flags_(match_flags), matchers_(first, last) {}
3776 ElementsAreArrayMatcher(Iter first, Iter last) : matchers_(first, last) {}
4104 // and may have been trying to use the first operation of the comma operator
4150 ElementsAreArray(Iter first, Iter last) {
4152 return internal::ElementsAreArrayMatcher<T>(first, last);
4195 UnorderedElementsAreArray(Iter first, Iter last) {
4198 internal::UnorderedMatcherRequire::ExactMatch, first, last);
4581 // first field == the second field.
4585 // first field >= the second field.
4589 // first field > the second field.
4593 // first field <= the second field.
4597 // first field < the second field.
4601 // first field != the second field.
4605 // FloatEq(first field) matches the second field.
4611 // DoubleEq(first field) matches the second field.
4617 // FloatEq(first field) matches the second field with NaN equality.
4623 // DoubleEq(first field) matches the second field with NaN equality.
4629 // FloatNear(first field, max_abs_error) matches the second field.
4635 // DoubleNear(first field, max_abs_error) matches the second field.
4641 // FloatNear(first field, max_abs_error) matches the second field with NaN
4649 // DoubleNear(first field, max_abs_error) matches the second field with NaN
4847 // - {1, 1, 2} matches IsSupersetOf({Eq(1), Lt(2)}), as (the first) 1 matches
4849 // - {1, 2, 3} matches IsSupersetOf(Gt(1), Gt(1)), as 2 matches (the first)
4859 IsSupersetOf(Iter first, Iter last) {
4862 internal::UnorderedMatcherRequire::Superset, first, last);
4916 IsSubsetOf(Iter first, Iter last) {
4919 internal::UnorderedMatcherRequire::Subset, first, last);
4979 // Key(inner_matcher) matches an std::pair whose 'first' field matches
4987 // Pair(first_matcher, second_matcher) matches a std::pair whose 'first' field
5000 // Conditional() creates a matcher that conditionally uses either the first or
5150 AnyOfArray(Iter first, Iter last) {
5152 typename ::std::iterator_traits<Iter>::value_type>(first, last);
5158 AllOfArray(Iter first, Iter last) {
5160 typename ::std::iterator_traits<Iter>::value_type>(first, last);