Formatting fixup.

Author: tturocy

src/games/game.h

@@ -670,8 +670,9 @@ Game ReadGame(std::istream &p_stream);
 template <class Generator>
 std::list<Rational> UniformOnSimplex(int p_denom, size_t p_dim, Generator &generator)
 {
-  std::uniform_int_distribution dist(1,
-                                     p_denom + int(p_dim) - 1); // NOLINT(misc-const-correctness)
+  // NOLINTBEGIN(misc-const-correctness)
+  std::uniform_int_distribution dist(1, p_denom + int(p_dim) - 1);
+  // NOLINTEND(misc-const-correctness)
   std::set<int> cutoffs;
   while (cutoffs.size() < p_dim - 1) {
     cutoffs.insert(dist(generator));

src/solvers/enumpoly/ndarray.h

@@ -69,8 +69,9 @@ template <class T> class NDArray {
     m_offsets.front() = 1;
     std::partial_sum(m_index_dim.begin(), m_index_dim.end(), std::next(m_offsets.begin()),
                      std::multiplies<>());
-    m_offsets_sum = std::accumulate(m_offsets.begin(), m_offsets.end(),
-                                    0); // NOLINT(cppcoreguidelines-prefer-member-initializer)
+    // NOLINTBEGIN(cppcoreguidelines-prefer-member-initializer)
+    m_offsets_sum = std::accumulate(m_offsets.begin(), m_offsets.end(), 0);
+    // NOLINTEND(cppcoreguidelines-prefer-member-initializer)
   }
 
   NDArray(const NDArray<T> &) = default;

src/solvers/linalg/lpsolve.imp

@@ -37,10 +37,10 @@ template <class T> Array<int> MakeArtificials(const Vector<T> &b)
 
 template <class T>
 LPSolve<T>::LPSolve(const Matrix<T> &A, const Vector<T> &b, const Vector<T> &c, int nequals)
-  : nvars(c.size()), neqns(b.size()),
-    nequals(nequals), total_cost(0), tmin(0), tab(A, MakeArtificials(b), b), UB(nvars + neqns),
-    LB(nvars + neqns), ub(nvars + neqns), lb(nvars + neqns), xx(nvars + neqns),
-    cost(nvars + neqns), y(b.size()), x(b.size()), d(b.size())
+  : nvars(c.size()), neqns(b.size()), nequals(nequals), total_cost(0), tmin(0),
+    tab(A, MakeArtificials(b), b), UB(nvars + neqns), LB(nvars + neqns), ub(nvars + neqns),
+    lb(nvars + neqns), xx(nvars + neqns), cost(nvars + neqns), y(b.size()), x(b.size()),
+    d(b.size())
 {
   // These are the values recommended by Murtagh (1981) for 15 digit
   // accuracy in LP problems

src/solvers/linalg/vertenum.imp

@@ -29,7 +29,7 @@ VertexEnumerator<T>::VertexEnumerator(const Matrix<T> &A, const Vector<T> &b)
   : mult_opt(std::any_of(b.begin(), b.end(), [](const T &v) { return v == static_cast<T>(0); })),
     A(A), b(b), btemp(b)
 {
-  btemp = static_cast<T>(-1);  // NOLINT(cppcoreguidelines-prefer-member-initializer)
+  btemp = static_cast<T>(-1); // NOLINT(cppcoreguidelines-prefer-member-initializer)
   LPTableau<T> tab(A, b);
   Vector<T> c(A.MinCol(), A.MaxCol());
   c = static_cast<T>(1);

src/solvers/logit/logbehav.imp

@@ -30,8 +30,7 @@
 
 template <class T>
 LogBehavProfile<T>::LogBehavProfile(const Game &p_game)
-  : m_game(p_game), m_probs(m_game->BehavProfileLength()),
-    m_logProbs(m_game->BehavProfileLength())
+  : m_game(p_game), m_probs(m_game->BehavProfileLength()), m_logProbs(m_game->BehavProfileLength())
 {
   int index = 1;
   for (const auto &player : p_game->GetPlayers()) {