113481Sgiacomo.travaglini@arm.com// Copyright 2007, Google Inc.
213481Sgiacomo.travaglini@arm.com// All rights reserved.
313481Sgiacomo.travaglini@arm.com//
413481Sgiacomo.travaglini@arm.com// Redistribution and use in source and binary forms, with or without
513481Sgiacomo.travaglini@arm.com// modification, are permitted provided that the following conditions are
613481Sgiacomo.travaglini@arm.com// met:
713481Sgiacomo.travaglini@arm.com//
813481Sgiacomo.travaglini@arm.com//     * Redistributions of source code must retain the above copyright
913481Sgiacomo.travaglini@arm.com// notice, this list of conditions and the following disclaimer.
1013481Sgiacomo.travaglini@arm.com//     * Redistributions in binary form must reproduce the above
1113481Sgiacomo.travaglini@arm.com// copyright notice, this list of conditions and the following disclaimer
1213481Sgiacomo.travaglini@arm.com// in the documentation and/or other materials provided with the
1313481Sgiacomo.travaglini@arm.com// distribution.
1413481Sgiacomo.travaglini@arm.com//     * Neither the name of Google Inc. nor the names of its
1513481Sgiacomo.travaglini@arm.com// contributors may be used to endorse or promote products derived from
1613481Sgiacomo.travaglini@arm.com// this software without specific prior written permission.
1713481Sgiacomo.travaglini@arm.com//
1813481Sgiacomo.travaglini@arm.com// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1913481Sgiacomo.travaglini@arm.com// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2013481Sgiacomo.travaglini@arm.com// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2113481Sgiacomo.travaglini@arm.com// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2213481Sgiacomo.travaglini@arm.com// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2313481Sgiacomo.travaglini@arm.com// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2413481Sgiacomo.travaglini@arm.com// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2513481Sgiacomo.travaglini@arm.com// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2613481Sgiacomo.travaglini@arm.com// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2713481Sgiacomo.travaglini@arm.com// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2813481Sgiacomo.travaglini@arm.com// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2913481Sgiacomo.travaglini@arm.com//
3013481Sgiacomo.travaglini@arm.com// Author: wan@google.com (Zhanyong Wan)
3113481Sgiacomo.travaglini@arm.com
3213481Sgiacomo.travaglini@arm.com// Google Mock - a framework for writing C++ mock classes.
3313481Sgiacomo.travaglini@arm.com//
3413481Sgiacomo.travaglini@arm.com// This file implements Matcher<const string&>, Matcher<string>, and
3513481Sgiacomo.travaglini@arm.com// utilities for defining matchers.
3613481Sgiacomo.travaglini@arm.com
3713481Sgiacomo.travaglini@arm.com#include "gmock/gmock-matchers.h"
3813481Sgiacomo.travaglini@arm.com#include "gmock/gmock-generated-matchers.h"
3913481Sgiacomo.travaglini@arm.com
4013481Sgiacomo.travaglini@arm.com#include <string.h>
4113481Sgiacomo.travaglini@arm.com#include <sstream>
4213481Sgiacomo.travaglini@arm.com#include <string>
4313481Sgiacomo.travaglini@arm.com
4413481Sgiacomo.travaglini@arm.comnamespace testing {
4513481Sgiacomo.travaglini@arm.com
4613481Sgiacomo.travaglini@arm.com// Constructs a matcher that matches a const string& whose value is
4713481Sgiacomo.travaglini@arm.com// equal to s.
4813481Sgiacomo.travaglini@arm.comMatcher<const internal::string&>::Matcher(const internal::string& s) {
4913481Sgiacomo.travaglini@arm.com  *this = Eq(s);
5013481Sgiacomo.travaglini@arm.com}
5113481Sgiacomo.travaglini@arm.com
5213481Sgiacomo.travaglini@arm.com// Constructs a matcher that matches a const string& whose value is
5313481Sgiacomo.travaglini@arm.com// equal to s.
5413481Sgiacomo.travaglini@arm.comMatcher<const internal::string&>::Matcher(const char* s) {
5513481Sgiacomo.travaglini@arm.com  *this = Eq(internal::string(s));
5613481Sgiacomo.travaglini@arm.com}
5713481Sgiacomo.travaglini@arm.com
5813481Sgiacomo.travaglini@arm.com// Constructs a matcher that matches a string whose value is equal to s.
5913481Sgiacomo.travaglini@arm.comMatcher<internal::string>::Matcher(const internal::string& s) { *this = Eq(s); }
6013481Sgiacomo.travaglini@arm.com
6113481Sgiacomo.travaglini@arm.com// Constructs a matcher that matches a string whose value is equal to s.
6213481Sgiacomo.travaglini@arm.comMatcher<internal::string>::Matcher(const char* s) {
6313481Sgiacomo.travaglini@arm.com  *this = Eq(internal::string(s));
6413481Sgiacomo.travaglini@arm.com}
6513481Sgiacomo.travaglini@arm.com
6613481Sgiacomo.travaglini@arm.com#if GTEST_HAS_STRING_PIECE_
6713481Sgiacomo.travaglini@arm.com// Constructs a matcher that matches a const StringPiece& whose value is
6813481Sgiacomo.travaglini@arm.com// equal to s.
6913481Sgiacomo.travaglini@arm.comMatcher<const StringPiece&>::Matcher(const internal::string& s) {
7013481Sgiacomo.travaglini@arm.com  *this = Eq(s);
7113481Sgiacomo.travaglini@arm.com}
7213481Sgiacomo.travaglini@arm.com
7313481Sgiacomo.travaglini@arm.com// Constructs a matcher that matches a const StringPiece& whose value is
7413481Sgiacomo.travaglini@arm.com// equal to s.
7513481Sgiacomo.travaglini@arm.comMatcher<const StringPiece&>::Matcher(const char* s) {
7613481Sgiacomo.travaglini@arm.com  *this = Eq(internal::string(s));
7713481Sgiacomo.travaglini@arm.com}
7813481Sgiacomo.travaglini@arm.com
7913481Sgiacomo.travaglini@arm.com// Constructs a matcher that matches a const StringPiece& whose value is
8013481Sgiacomo.travaglini@arm.com// equal to s.
8113481Sgiacomo.travaglini@arm.comMatcher<const StringPiece&>::Matcher(StringPiece s) {
8213481Sgiacomo.travaglini@arm.com  *this = Eq(s.ToString());
8313481Sgiacomo.travaglini@arm.com}
8413481Sgiacomo.travaglini@arm.com
8513481Sgiacomo.travaglini@arm.com// Constructs a matcher that matches a StringPiece whose value is equal to s.
8613481Sgiacomo.travaglini@arm.comMatcher<StringPiece>::Matcher(const internal::string& s) {
8713481Sgiacomo.travaglini@arm.com  *this = Eq(s);
8813481Sgiacomo.travaglini@arm.com}
8913481Sgiacomo.travaglini@arm.com
9013481Sgiacomo.travaglini@arm.com// Constructs a matcher that matches a StringPiece whose value is equal to s.
9113481Sgiacomo.travaglini@arm.comMatcher<StringPiece>::Matcher(const char* s) {
9213481Sgiacomo.travaglini@arm.com  *this = Eq(internal::string(s));
9313481Sgiacomo.travaglini@arm.com}
9413481Sgiacomo.travaglini@arm.com
9513481Sgiacomo.travaglini@arm.com// Constructs a matcher that matches a StringPiece whose value is equal to s.
9613481Sgiacomo.travaglini@arm.comMatcher<StringPiece>::Matcher(StringPiece s) {
9713481Sgiacomo.travaglini@arm.com  *this = Eq(s.ToString());
9813481Sgiacomo.travaglini@arm.com}
9913481Sgiacomo.travaglini@arm.com#endif  // GTEST_HAS_STRING_PIECE_
10013481Sgiacomo.travaglini@arm.com
10113481Sgiacomo.travaglini@arm.comnamespace internal {
10213481Sgiacomo.travaglini@arm.com
10313481Sgiacomo.travaglini@arm.com// Joins a vector of strings as if they are fields of a tuple; returns
10413481Sgiacomo.travaglini@arm.com// the joined string.
10513481Sgiacomo.travaglini@arm.comGTEST_API_ string JoinAsTuple(const Strings& fields) {
10613481Sgiacomo.travaglini@arm.com  switch (fields.size()) {
10713481Sgiacomo.travaglini@arm.com    case 0:
10813481Sgiacomo.travaglini@arm.com      return "";
10913481Sgiacomo.travaglini@arm.com    case 1:
11013481Sgiacomo.travaglini@arm.com      return fields[0];
11113481Sgiacomo.travaglini@arm.com    default:
11213481Sgiacomo.travaglini@arm.com      string result = "(" + fields[0];
11313481Sgiacomo.travaglini@arm.com      for (size_t i = 1; i < fields.size(); i++) {
11413481Sgiacomo.travaglini@arm.com        result += ", ";
11513481Sgiacomo.travaglini@arm.com        result += fields[i];
11613481Sgiacomo.travaglini@arm.com      }
11713481Sgiacomo.travaglini@arm.com      result += ")";
11813481Sgiacomo.travaglini@arm.com      return result;
11913481Sgiacomo.travaglini@arm.com  }
12013481Sgiacomo.travaglini@arm.com}
12113481Sgiacomo.travaglini@arm.com
12213481Sgiacomo.travaglini@arm.com// Returns the description for a matcher defined using the MATCHER*()
12313481Sgiacomo.travaglini@arm.com// macro where the user-supplied description string is "", if
12413481Sgiacomo.travaglini@arm.com// 'negation' is false; otherwise returns the description of the
12513481Sgiacomo.travaglini@arm.com// negation of the matcher.  'param_values' contains a list of strings
12613481Sgiacomo.travaglini@arm.com// that are the print-out of the matcher's parameters.
12713481Sgiacomo.travaglini@arm.comGTEST_API_ string FormatMatcherDescription(bool negation,
12813481Sgiacomo.travaglini@arm.com                                           const char* matcher_name,
12913481Sgiacomo.travaglini@arm.com                                           const Strings& param_values) {
13013481Sgiacomo.travaglini@arm.com  string result = ConvertIdentifierNameToWords(matcher_name);
13113481Sgiacomo.travaglini@arm.com  if (param_values.size() >= 1)
13213481Sgiacomo.travaglini@arm.com    result += " " + JoinAsTuple(param_values);
13313481Sgiacomo.travaglini@arm.com  return negation ? "not (" + result + ")" : result;
13413481Sgiacomo.travaglini@arm.com}
13513481Sgiacomo.travaglini@arm.com
13613481Sgiacomo.travaglini@arm.com// FindMaxBipartiteMatching and its helper class.
13713481Sgiacomo.travaglini@arm.com//
13813481Sgiacomo.travaglini@arm.com// Uses the well-known Ford-Fulkerson max flow method to find a maximum
13913481Sgiacomo.travaglini@arm.com// bipartite matching. Flow is considered to be from left to right.
14013481Sgiacomo.travaglini@arm.com// There is an implicit source node that is connected to all of the left
14113481Sgiacomo.travaglini@arm.com// nodes, and an implicit sink node that is connected to all of the
14213481Sgiacomo.travaglini@arm.com// right nodes. All edges have unit capacity.
14313481Sgiacomo.travaglini@arm.com//
14413481Sgiacomo.travaglini@arm.com// Neither the flow graph nor the residual flow graph are represented
14513481Sgiacomo.travaglini@arm.com// explicitly. Instead, they are implied by the information in 'graph' and
14613481Sgiacomo.travaglini@arm.com// a vector<int> called 'left_' whose elements are initialized to the
14713481Sgiacomo.travaglini@arm.com// value kUnused. This represents the initial state of the algorithm,
14813481Sgiacomo.travaglini@arm.com// where the flow graph is empty, and the residual flow graph has the
14913481Sgiacomo.travaglini@arm.com// following edges:
15013481Sgiacomo.travaglini@arm.com//   - An edge from source to each left_ node
15113481Sgiacomo.travaglini@arm.com//   - An edge from each right_ node to sink
15213481Sgiacomo.travaglini@arm.com//   - An edge from each left_ node to each right_ node, if the
15313481Sgiacomo.travaglini@arm.com//     corresponding edge exists in 'graph'.
15413481Sgiacomo.travaglini@arm.com//
15513481Sgiacomo.travaglini@arm.com// When the TryAugment() method adds a flow, it sets left_[l] = r for some
15613481Sgiacomo.travaglini@arm.com// nodes l and r. This induces the following changes:
15713481Sgiacomo.travaglini@arm.com//   - The edges (source, l), (l, r), and (r, sink) are added to the
15813481Sgiacomo.travaglini@arm.com//     flow graph.
15913481Sgiacomo.travaglini@arm.com//   - The same three edges are removed from the residual flow graph.
16013481Sgiacomo.travaglini@arm.com//   - The reverse edges (l, source), (r, l), and (sink, r) are added
16113481Sgiacomo.travaglini@arm.com//     to the residual flow graph, which is a directional graph
16213481Sgiacomo.travaglini@arm.com//     representing unused flow capacity.
16313481Sgiacomo.travaglini@arm.com//
16413481Sgiacomo.travaglini@arm.com// When the method augments a flow (moving left_[l] from some r1 to some
16513481Sgiacomo.travaglini@arm.com// other r2), this can be thought of as "undoing" the above steps with
16613481Sgiacomo.travaglini@arm.com// respect to r1 and "redoing" them with respect to r2.
16713481Sgiacomo.travaglini@arm.com//
16813481Sgiacomo.travaglini@arm.com// It bears repeating that the flow graph and residual flow graph are
16913481Sgiacomo.travaglini@arm.com// never represented explicitly, but can be derived by looking at the
17013481Sgiacomo.travaglini@arm.com// information in 'graph' and in left_.
17113481Sgiacomo.travaglini@arm.com//
17213481Sgiacomo.travaglini@arm.com// As an optimization, there is a second vector<int> called right_ which
17313481Sgiacomo.travaglini@arm.com// does not provide any new information. Instead, it enables more
17413481Sgiacomo.travaglini@arm.com// efficient queries about edges entering or leaving the right-side nodes
17513481Sgiacomo.travaglini@arm.com// of the flow or residual flow graphs. The following invariants are
17613481Sgiacomo.travaglini@arm.com// maintained:
17713481Sgiacomo.travaglini@arm.com//
17813481Sgiacomo.travaglini@arm.com// left[l] == kUnused or right[left[l]] == l
17913481Sgiacomo.travaglini@arm.com// right[r] == kUnused or left[right[r]] == r
18013481Sgiacomo.travaglini@arm.com//
18113481Sgiacomo.travaglini@arm.com// . [ source ]                                        .
18213481Sgiacomo.travaglini@arm.com// .   |||                                             .
18313481Sgiacomo.travaglini@arm.com// .   |||                                             .
18413481Sgiacomo.travaglini@arm.com// .   ||\--> left[0]=1  ---\    right[0]=-1 ----\     .
18513481Sgiacomo.travaglini@arm.com// .   ||                   |                    |     .
18613481Sgiacomo.travaglini@arm.com// .   |\---> left[1]=-1    \--> right[1]=0  ---\|     .
18713481Sgiacomo.travaglini@arm.com// .   |                                        ||     .
18813481Sgiacomo.travaglini@arm.com// .   \----> left[2]=2  ------> right[2]=2  --\||     .
18913481Sgiacomo.travaglini@arm.com// .                                           |||     .
19013481Sgiacomo.travaglini@arm.com// .         elements           matchers       vvv     .
19113481Sgiacomo.travaglini@arm.com// .                                         [ sink ]  .
19213481Sgiacomo.travaglini@arm.com//
19313481Sgiacomo.travaglini@arm.com// See Also:
19413481Sgiacomo.travaglini@arm.com//   [1] Cormen, et al (2001). "Section 26.2: The Ford-Fulkerson method".
19513481Sgiacomo.travaglini@arm.com//       "Introduction to Algorithms (Second ed.)", pp. 651-664.
19613481Sgiacomo.travaglini@arm.com//   [2] "Ford-Fulkerson algorithm", Wikipedia,
19713481Sgiacomo.travaglini@arm.com//       'http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm'
19813481Sgiacomo.travaglini@arm.comclass MaxBipartiteMatchState {
19913481Sgiacomo.travaglini@arm.com public:
20013481Sgiacomo.travaglini@arm.com  explicit MaxBipartiteMatchState(const MatchMatrix& graph)
20113481Sgiacomo.travaglini@arm.com      : graph_(&graph),
20213481Sgiacomo.travaglini@arm.com        left_(graph_->LhsSize(), kUnused),
20313481Sgiacomo.travaglini@arm.com        right_(graph_->RhsSize(), kUnused) {
20413481Sgiacomo.travaglini@arm.com  }
20513481Sgiacomo.travaglini@arm.com
20613481Sgiacomo.travaglini@arm.com  // Returns the edges of a maximal match, each in the form {left, right}.
20713481Sgiacomo.travaglini@arm.com  ElementMatcherPairs Compute() {
20813481Sgiacomo.travaglini@arm.com    // 'seen' is used for path finding { 0: unseen, 1: seen }.
20913481Sgiacomo.travaglini@arm.com    ::std::vector<char> seen;
21013481Sgiacomo.travaglini@arm.com    // Searches the residual flow graph for a path from each left node to
21113481Sgiacomo.travaglini@arm.com    // the sink in the residual flow graph, and if one is found, add flow
21213481Sgiacomo.travaglini@arm.com    // to the graph. It's okay to search through the left nodes once. The
21313481Sgiacomo.travaglini@arm.com    // edge from the implicit source node to each previously-visited left
21413481Sgiacomo.travaglini@arm.com    // node will have flow if that left node has any path to the sink
21513481Sgiacomo.travaglini@arm.com    // whatsoever. Subsequent augmentations can only add flow to the
21613481Sgiacomo.travaglini@arm.com    // network, and cannot take away that previous flow unit from the source.
21713481Sgiacomo.travaglini@arm.com    // Since the source-to-left edge can only carry one flow unit (or,
21813481Sgiacomo.travaglini@arm.com    // each element can be matched to only one matcher), there is no need
21913481Sgiacomo.travaglini@arm.com    // to visit the left nodes more than once looking for augmented paths.
22013481Sgiacomo.travaglini@arm.com    // The flow is known to be possible or impossible by looking at the
22113481Sgiacomo.travaglini@arm.com    // node once.
22213481Sgiacomo.travaglini@arm.com    for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
22313481Sgiacomo.travaglini@arm.com      // Reset the path-marking vector and try to find a path from
22413481Sgiacomo.travaglini@arm.com      // source to sink starting at the left_[ilhs] node.
22513481Sgiacomo.travaglini@arm.com      GTEST_CHECK_(left_[ilhs] == kUnused)
22613481Sgiacomo.travaglini@arm.com          << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs];
22713481Sgiacomo.travaglini@arm.com      // 'seen' initialized to 'graph_->RhsSize()' copies of 0.
22813481Sgiacomo.travaglini@arm.com      seen.assign(graph_->RhsSize(), 0);
22913481Sgiacomo.travaglini@arm.com      TryAugment(ilhs, &seen);
23013481Sgiacomo.travaglini@arm.com    }
23113481Sgiacomo.travaglini@arm.com    ElementMatcherPairs result;
23213481Sgiacomo.travaglini@arm.com    for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) {
23313481Sgiacomo.travaglini@arm.com      size_t irhs = left_[ilhs];
23413481Sgiacomo.travaglini@arm.com      if (irhs == kUnused) continue;
23513481Sgiacomo.travaglini@arm.com      result.push_back(ElementMatcherPair(ilhs, irhs));
23613481Sgiacomo.travaglini@arm.com    }
23713481Sgiacomo.travaglini@arm.com    return result;
23813481Sgiacomo.travaglini@arm.com  }
23913481Sgiacomo.travaglini@arm.com
24013481Sgiacomo.travaglini@arm.com private:
24113481Sgiacomo.travaglini@arm.com  static const size_t kUnused = static_cast<size_t>(-1);
24213481Sgiacomo.travaglini@arm.com
24313481Sgiacomo.travaglini@arm.com  // Perform a depth-first search from left node ilhs to the sink.  If a
24413481Sgiacomo.travaglini@arm.com  // path is found, flow is added to the network by linking the left and
24513481Sgiacomo.travaglini@arm.com  // right vector elements corresponding each segment of the path.
24613481Sgiacomo.travaglini@arm.com  // Returns true if a path to sink was found, which means that a unit of
24713481Sgiacomo.travaglini@arm.com  // flow was added to the network. The 'seen' vector elements correspond
24813481Sgiacomo.travaglini@arm.com  // to right nodes and are marked to eliminate cycles from the search.
24913481Sgiacomo.travaglini@arm.com  //
25013481Sgiacomo.travaglini@arm.com  // Left nodes will only be explored at most once because they
25113481Sgiacomo.travaglini@arm.com  // are accessible from at most one right node in the residual flow
25213481Sgiacomo.travaglini@arm.com  // graph.
25313481Sgiacomo.travaglini@arm.com  //
25413481Sgiacomo.travaglini@arm.com  // Note that left_[ilhs] is the only element of left_ that TryAugment will
25513481Sgiacomo.travaglini@arm.com  // potentially transition from kUnused to another value. Any other
25613481Sgiacomo.travaglini@arm.com  // left_ element holding kUnused before TryAugment will be holding it
25713481Sgiacomo.travaglini@arm.com  // when TryAugment returns.
25813481Sgiacomo.travaglini@arm.com  //
25913481Sgiacomo.travaglini@arm.com  bool TryAugment(size_t ilhs, ::std::vector<char>* seen) {
26013481Sgiacomo.travaglini@arm.com    for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
26113481Sgiacomo.travaglini@arm.com      if ((*seen)[irhs])
26213481Sgiacomo.travaglini@arm.com        continue;
26313481Sgiacomo.travaglini@arm.com      if (!graph_->HasEdge(ilhs, irhs))
26413481Sgiacomo.travaglini@arm.com        continue;
26513481Sgiacomo.travaglini@arm.com      // There's an available edge from ilhs to irhs.
26613481Sgiacomo.travaglini@arm.com      (*seen)[irhs] = 1;
26713481Sgiacomo.travaglini@arm.com      // Next a search is performed to determine whether
26813481Sgiacomo.travaglini@arm.com      // this edge is a dead end or leads to the sink.
26913481Sgiacomo.travaglini@arm.com      //
27013481Sgiacomo.travaglini@arm.com      // right_[irhs] == kUnused means that there is residual flow from
27113481Sgiacomo.travaglini@arm.com      // right node irhs to the sink, so we can use that to finish this
27213481Sgiacomo.travaglini@arm.com      // flow path and return success.
27313481Sgiacomo.travaglini@arm.com      //
27413481Sgiacomo.travaglini@arm.com      // Otherwise there is residual flow to some ilhs. We push flow
27513481Sgiacomo.travaglini@arm.com      // along that path and call ourselves recursively to see if this
27613481Sgiacomo.travaglini@arm.com      // ultimately leads to sink.
27713481Sgiacomo.travaglini@arm.com      if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) {
27813481Sgiacomo.travaglini@arm.com        // Add flow from left_[ilhs] to right_[irhs].
27913481Sgiacomo.travaglini@arm.com        left_[ilhs] = irhs;
28013481Sgiacomo.travaglini@arm.com        right_[irhs] = ilhs;
28113481Sgiacomo.travaglini@arm.com        return true;
28213481Sgiacomo.travaglini@arm.com      }
28313481Sgiacomo.travaglini@arm.com    }
28413481Sgiacomo.travaglini@arm.com    return false;
28513481Sgiacomo.travaglini@arm.com  }
28613481Sgiacomo.travaglini@arm.com
28713481Sgiacomo.travaglini@arm.com  const MatchMatrix* graph_;  // not owned
28813481Sgiacomo.travaglini@arm.com  // Each element of the left_ vector represents a left hand side node
28913481Sgiacomo.travaglini@arm.com  // (i.e. an element) and each element of right_ is a right hand side
29013481Sgiacomo.travaglini@arm.com  // node (i.e. a matcher). The values in the left_ vector indicate
29113481Sgiacomo.travaglini@arm.com  // outflow from that node to a node on the the right_ side. The values
29213481Sgiacomo.travaglini@arm.com  // in the right_ indicate inflow, and specify which left_ node is
29313481Sgiacomo.travaglini@arm.com  // feeding that right_ node, if any. For example, left_[3] == 1 means
29413481Sgiacomo.travaglini@arm.com  // there's a flow from element #3 to matcher #1. Such a flow would also
29513481Sgiacomo.travaglini@arm.com  // be redundantly represented in the right_ vector as right_[1] == 3.
29613481Sgiacomo.travaglini@arm.com  // Elements of left_ and right_ are either kUnused or mutually
29713481Sgiacomo.travaglini@arm.com  // referent. Mutually referent means that left_[right_[i]] = i and
29813481Sgiacomo.travaglini@arm.com  // right_[left_[i]] = i.
29913481Sgiacomo.travaglini@arm.com  ::std::vector<size_t> left_;
30013481Sgiacomo.travaglini@arm.com  ::std::vector<size_t> right_;
30113481Sgiacomo.travaglini@arm.com
30213481Sgiacomo.travaglini@arm.com  GTEST_DISALLOW_ASSIGN_(MaxBipartiteMatchState);
30313481Sgiacomo.travaglini@arm.com};
30413481Sgiacomo.travaglini@arm.com
30513481Sgiacomo.travaglini@arm.comconst size_t MaxBipartiteMatchState::kUnused;
30613481Sgiacomo.travaglini@arm.com
30713481Sgiacomo.travaglini@arm.comGTEST_API_ ElementMatcherPairs
30813481Sgiacomo.travaglini@arm.comFindMaxBipartiteMatching(const MatchMatrix& g) {
30913481Sgiacomo.travaglini@arm.com  return MaxBipartiteMatchState(g).Compute();
31013481Sgiacomo.travaglini@arm.com}
31113481Sgiacomo.travaglini@arm.com
31213481Sgiacomo.travaglini@arm.comstatic void LogElementMatcherPairVec(const ElementMatcherPairs& pairs,
31313481Sgiacomo.travaglini@arm.com                                     ::std::ostream* stream) {
31413481Sgiacomo.travaglini@arm.com  typedef ElementMatcherPairs::const_iterator Iter;
31513481Sgiacomo.travaglini@arm.com  ::std::ostream& os = *stream;
31613481Sgiacomo.travaglini@arm.com  os << "{";
31713481Sgiacomo.travaglini@arm.com  const char *sep = "";
31813481Sgiacomo.travaglini@arm.com  for (Iter it = pairs.begin(); it != pairs.end(); ++it) {
31913481Sgiacomo.travaglini@arm.com    os << sep << "\n  ("
32013481Sgiacomo.travaglini@arm.com       << "element #" << it->first << ", "
32113481Sgiacomo.travaglini@arm.com       << "matcher #" << it->second << ")";
32213481Sgiacomo.travaglini@arm.com    sep = ",";
32313481Sgiacomo.travaglini@arm.com  }
32413481Sgiacomo.travaglini@arm.com  os << "\n}";
32513481Sgiacomo.travaglini@arm.com}
32613481Sgiacomo.travaglini@arm.com
32713481Sgiacomo.travaglini@arm.com// Tries to find a pairing, and explains the result.
32813481Sgiacomo.travaglini@arm.comGTEST_API_ bool FindPairing(const MatchMatrix& matrix,
32913481Sgiacomo.travaglini@arm.com                            MatchResultListener* listener) {
33013481Sgiacomo.travaglini@arm.com  ElementMatcherPairs matches = FindMaxBipartiteMatching(matrix);
33113481Sgiacomo.travaglini@arm.com
33213481Sgiacomo.travaglini@arm.com  size_t max_flow = matches.size();
33313481Sgiacomo.travaglini@arm.com  bool result = (max_flow == matrix.RhsSize());
33413481Sgiacomo.travaglini@arm.com
33513481Sgiacomo.travaglini@arm.com  if (!result) {
33613481Sgiacomo.travaglini@arm.com    if (listener->IsInterested()) {
33713481Sgiacomo.travaglini@arm.com      *listener << "where no permutation of the elements can "
33813481Sgiacomo.travaglini@arm.com                   "satisfy all matchers, and the closest match is "
33913481Sgiacomo.travaglini@arm.com                << max_flow << " of " << matrix.RhsSize()
34013481Sgiacomo.travaglini@arm.com                << " matchers with the pairings:\n";
34113481Sgiacomo.travaglini@arm.com      LogElementMatcherPairVec(matches, listener->stream());
34213481Sgiacomo.travaglini@arm.com    }
34313481Sgiacomo.travaglini@arm.com    return false;
34413481Sgiacomo.travaglini@arm.com  }
34513481Sgiacomo.travaglini@arm.com
34613481Sgiacomo.travaglini@arm.com  if (matches.size() > 1) {
34713481Sgiacomo.travaglini@arm.com    if (listener->IsInterested()) {
34813481Sgiacomo.travaglini@arm.com      const char *sep = "where:\n";
34913481Sgiacomo.travaglini@arm.com      for (size_t mi = 0; mi < matches.size(); ++mi) {
35013481Sgiacomo.travaglini@arm.com        *listener << sep << " - element #" << matches[mi].first
35113481Sgiacomo.travaglini@arm.com                  << " is matched by matcher #" << matches[mi].second;
35213481Sgiacomo.travaglini@arm.com        sep = ",\n";
35313481Sgiacomo.travaglini@arm.com      }
35413481Sgiacomo.travaglini@arm.com    }
35513481Sgiacomo.travaglini@arm.com  }
35613481Sgiacomo.travaglini@arm.com  return true;
35713481Sgiacomo.travaglini@arm.com}
35813481Sgiacomo.travaglini@arm.com
35913481Sgiacomo.travaglini@arm.combool MatchMatrix::NextGraph() {
36013481Sgiacomo.travaglini@arm.com  for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) {
36113481Sgiacomo.travaglini@arm.com    for (size_t irhs = 0; irhs < RhsSize(); ++irhs) {
36213481Sgiacomo.travaglini@arm.com      char& b = matched_[SpaceIndex(ilhs, irhs)];
36313481Sgiacomo.travaglini@arm.com      if (!b) {
36413481Sgiacomo.travaglini@arm.com        b = 1;
36513481Sgiacomo.travaglini@arm.com        return true;
36613481Sgiacomo.travaglini@arm.com      }
36713481Sgiacomo.travaglini@arm.com      b = 0;
36813481Sgiacomo.travaglini@arm.com    }
36913481Sgiacomo.travaglini@arm.com  }
37013481Sgiacomo.travaglini@arm.com  return false;
37113481Sgiacomo.travaglini@arm.com}
37213481Sgiacomo.travaglini@arm.com
37313481Sgiacomo.travaglini@arm.comvoid MatchMatrix::Randomize() {
37413481Sgiacomo.travaglini@arm.com  for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) {
37513481Sgiacomo.travaglini@arm.com    for (size_t irhs = 0; irhs < RhsSize(); ++irhs) {
37613481Sgiacomo.travaglini@arm.com      char& b = matched_[SpaceIndex(ilhs, irhs)];
37713481Sgiacomo.travaglini@arm.com      b = static_cast<char>(rand() & 1);  // NOLINT
37813481Sgiacomo.travaglini@arm.com    }
37913481Sgiacomo.travaglini@arm.com  }
38013481Sgiacomo.travaglini@arm.com}
38113481Sgiacomo.travaglini@arm.com
38213481Sgiacomo.travaglini@arm.comstring MatchMatrix::DebugString() const {
38313481Sgiacomo.travaglini@arm.com  ::std::stringstream ss;
38413481Sgiacomo.travaglini@arm.com  const char *sep = "";
38513481Sgiacomo.travaglini@arm.com  for (size_t i = 0; i < LhsSize(); ++i) {
38613481Sgiacomo.travaglini@arm.com    ss << sep;
38713481Sgiacomo.travaglini@arm.com    for (size_t j = 0; j < RhsSize(); ++j) {
38813481Sgiacomo.travaglini@arm.com      ss << HasEdge(i, j);
38913481Sgiacomo.travaglini@arm.com    }
39013481Sgiacomo.travaglini@arm.com    sep = ";";
39113481Sgiacomo.travaglini@arm.com  }
39213481Sgiacomo.travaglini@arm.com  return ss.str();
39313481Sgiacomo.travaglini@arm.com}
39413481Sgiacomo.travaglini@arm.com
39513481Sgiacomo.travaglini@arm.comvoid UnorderedElementsAreMatcherImplBase::DescribeToImpl(
39613481Sgiacomo.travaglini@arm.com    ::std::ostream* os) const {
39713481Sgiacomo.travaglini@arm.com  if (matcher_describers_.empty()) {
39813481Sgiacomo.travaglini@arm.com    *os << "is empty";
39913481Sgiacomo.travaglini@arm.com    return;
40013481Sgiacomo.travaglini@arm.com  }
40113481Sgiacomo.travaglini@arm.com  if (matcher_describers_.size() == 1) {
40213481Sgiacomo.travaglini@arm.com    *os << "has " << Elements(1) << " and that element ";
40313481Sgiacomo.travaglini@arm.com    matcher_describers_[0]->DescribeTo(os);
40413481Sgiacomo.travaglini@arm.com    return;
40513481Sgiacomo.travaglini@arm.com  }
40613481Sgiacomo.travaglini@arm.com  *os << "has " << Elements(matcher_describers_.size())
40713481Sgiacomo.travaglini@arm.com      << " and there exists some permutation of elements such that:\n";
40813481Sgiacomo.travaglini@arm.com  const char* sep = "";
40913481Sgiacomo.travaglini@arm.com  for (size_t i = 0; i != matcher_describers_.size(); ++i) {
41013481Sgiacomo.travaglini@arm.com    *os << sep << " - element #" << i << " ";
41113481Sgiacomo.travaglini@arm.com    matcher_describers_[i]->DescribeTo(os);
41213481Sgiacomo.travaglini@arm.com    sep = ", and\n";
41313481Sgiacomo.travaglini@arm.com  }
41413481Sgiacomo.travaglini@arm.com}
41513481Sgiacomo.travaglini@arm.com
41613481Sgiacomo.travaglini@arm.comvoid UnorderedElementsAreMatcherImplBase::DescribeNegationToImpl(
41713481Sgiacomo.travaglini@arm.com    ::std::ostream* os) const {
41813481Sgiacomo.travaglini@arm.com  if (matcher_describers_.empty()) {
41913481Sgiacomo.travaglini@arm.com    *os << "isn't empty";
42013481Sgiacomo.travaglini@arm.com    return;
42113481Sgiacomo.travaglini@arm.com  }
42213481Sgiacomo.travaglini@arm.com  if (matcher_describers_.size() == 1) {
42313481Sgiacomo.travaglini@arm.com    *os << "doesn't have " << Elements(1)
42413481Sgiacomo.travaglini@arm.com        << ", or has " << Elements(1) << " that ";
42513481Sgiacomo.travaglini@arm.com    matcher_describers_[0]->DescribeNegationTo(os);
42613481Sgiacomo.travaglini@arm.com    return;
42713481Sgiacomo.travaglini@arm.com  }
42813481Sgiacomo.travaglini@arm.com  *os << "doesn't have " << Elements(matcher_describers_.size())
42913481Sgiacomo.travaglini@arm.com      << ", or there exists no permutation of elements such that:\n";
43013481Sgiacomo.travaglini@arm.com  const char* sep = "";
43113481Sgiacomo.travaglini@arm.com  for (size_t i = 0; i != matcher_describers_.size(); ++i) {
43213481Sgiacomo.travaglini@arm.com    *os << sep << " - element #" << i << " ";
43313481Sgiacomo.travaglini@arm.com    matcher_describers_[i]->DescribeTo(os);
43413481Sgiacomo.travaglini@arm.com    sep = ", and\n";
43513481Sgiacomo.travaglini@arm.com  }
43613481Sgiacomo.travaglini@arm.com}
43713481Sgiacomo.travaglini@arm.com
43813481Sgiacomo.travaglini@arm.com// Checks that all matchers match at least one element, and that all
43913481Sgiacomo.travaglini@arm.com// elements match at least one matcher. This enables faster matching
44013481Sgiacomo.travaglini@arm.com// and better error reporting.
44113481Sgiacomo.travaglini@arm.com// Returns false, writing an explanation to 'listener', if and only
44213481Sgiacomo.travaglini@arm.com// if the success criteria are not met.
44313481Sgiacomo.travaglini@arm.combool UnorderedElementsAreMatcherImplBase::
44413481Sgiacomo.travaglini@arm.comVerifyAllElementsAndMatchersAreMatched(
44513481Sgiacomo.travaglini@arm.com    const ::std::vector<string>& element_printouts,
44613481Sgiacomo.travaglini@arm.com    const MatchMatrix& matrix,
44713481Sgiacomo.travaglini@arm.com    MatchResultListener* listener) const {
44813481Sgiacomo.travaglini@arm.com  bool result = true;
44913481Sgiacomo.travaglini@arm.com  ::std::vector<char> element_matched(matrix.LhsSize(), 0);
45013481Sgiacomo.travaglini@arm.com  ::std::vector<char> matcher_matched(matrix.RhsSize(), 0);
45113481Sgiacomo.travaglini@arm.com
45213481Sgiacomo.travaglini@arm.com  for (size_t ilhs = 0; ilhs < matrix.LhsSize(); ilhs++) {
45313481Sgiacomo.travaglini@arm.com    for (size_t irhs = 0; irhs < matrix.RhsSize(); irhs++) {
45413481Sgiacomo.travaglini@arm.com      char matched = matrix.HasEdge(ilhs, irhs);
45513481Sgiacomo.travaglini@arm.com      element_matched[ilhs] |= matched;
45613481Sgiacomo.travaglini@arm.com      matcher_matched[irhs] |= matched;
45713481Sgiacomo.travaglini@arm.com    }
45813481Sgiacomo.travaglini@arm.com  }
45913481Sgiacomo.travaglini@arm.com
46013481Sgiacomo.travaglini@arm.com  {
46113481Sgiacomo.travaglini@arm.com    const char* sep =
46213481Sgiacomo.travaglini@arm.com        "where the following matchers don't match any elements:\n";
46313481Sgiacomo.travaglini@arm.com    for (size_t mi = 0; mi < matcher_matched.size(); ++mi) {
46413481Sgiacomo.travaglini@arm.com      if (matcher_matched[mi])
46513481Sgiacomo.travaglini@arm.com        continue;
46613481Sgiacomo.travaglini@arm.com      result = false;
46713481Sgiacomo.travaglini@arm.com      if (listener->IsInterested()) {
46813481Sgiacomo.travaglini@arm.com        *listener << sep << "matcher #" << mi << ": ";
46913481Sgiacomo.travaglini@arm.com        matcher_describers_[mi]->DescribeTo(listener->stream());
47013481Sgiacomo.travaglini@arm.com        sep = ",\n";
47113481Sgiacomo.travaglini@arm.com      }
47213481Sgiacomo.travaglini@arm.com    }
47313481Sgiacomo.travaglini@arm.com  }
47413481Sgiacomo.travaglini@arm.com
47513481Sgiacomo.travaglini@arm.com  {
47613481Sgiacomo.travaglini@arm.com    const char* sep =
47713481Sgiacomo.travaglini@arm.com        "where the following elements don't match any matchers:\n";
47813481Sgiacomo.travaglini@arm.com    const char* outer_sep = "";
47913481Sgiacomo.travaglini@arm.com    if (!result) {
48013481Sgiacomo.travaglini@arm.com      outer_sep = "\nand ";
48113481Sgiacomo.travaglini@arm.com    }
48213481Sgiacomo.travaglini@arm.com    for (size_t ei = 0; ei < element_matched.size(); ++ei) {
48313481Sgiacomo.travaglini@arm.com      if (element_matched[ei])
48413481Sgiacomo.travaglini@arm.com        continue;
48513481Sgiacomo.travaglini@arm.com      result = false;
48613481Sgiacomo.travaglini@arm.com      if (listener->IsInterested()) {
48713481Sgiacomo.travaglini@arm.com        *listener << outer_sep << sep << "element #" << ei << ": "
48813481Sgiacomo.travaglini@arm.com                  << element_printouts[ei];
48913481Sgiacomo.travaglini@arm.com        sep = ",\n";
49013481Sgiacomo.travaglini@arm.com        outer_sep = "";
49113481Sgiacomo.travaglini@arm.com      }
49213481Sgiacomo.travaglini@arm.com    }
49313481Sgiacomo.travaglini@arm.com  }
49413481Sgiacomo.travaglini@arm.com  return result;
49513481Sgiacomo.travaglini@arm.com}
49613481Sgiacomo.travaglini@arm.com
49713481Sgiacomo.travaglini@arm.com}  // namespace internal
49813481Sgiacomo.travaglini@arm.com}  // namespace testing
499