From f2989d319d20ca8df4ca3b17ae61d8a197cd0952 Mon Sep 17 00:00:00 2001 From: Corentin Le Molgat Date: Mon, 10 Sep 2018 13:32:30 +0200 Subject: [PATCH] =?UTF-8?q?Replace=20non=20ASCII=20character=20'=E2=80=93'?= =?UTF-8?q?=20in=20comments?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit - Crash on ubuntu 16.04 during 'make java'... --- ortools/constraint_solver/constraint_solver.h | 2 +- ortools/constraint_solver/expr_array.cc | 2 +- ortools/graph/cliques.h | 2 +- ortools/graph/connectivity.h | 6 +++--- ortools/graph/hamiltonian_path.h | 2 +- ortools/sat/optimization.h | 2 +- ortools/sat/sat_parameters.proto | 2 +- ortools/sat/simplification.cc | 2 +- 8 files changed, 10 insertions(+), 10 deletions(-) diff --git a/ortools/constraint_solver/constraint_solver.h b/ortools/constraint_solver/constraint_solver.h index 8c5b1a7b87..8c6b575dfc 100644 --- a/ortools/constraint_solver/constraint_solver.h +++ b/ortools/constraint_solver/constraint_solver.h @@ -569,7 +569,7 @@ class Solver { // This enum is used in Solver::MakeOperator associated with an evaluator // to specify the neighborhood to create. enum EvaluatorLocalSearchOperators { - // Lin–Kernighan local search. + // Lin-Kernighan local search. // While the accumulated local gain is positive, perform a 2opt or a 3opt // move followed by a series of 2opt moves. Return a neighbor for which the // global gain is positive. diff --git a/ortools/constraint_solver/expr_array.cc b/ortools/constraint_solver/expr_array.cc index a6b98d98a3..5d1ae25889 100644 --- a/ortools/constraint_solver/expr_array.cc +++ b/ortools/constraint_solver/expr_array.cc @@ -155,7 +155,7 @@ class TreeArrayConstraint : public CastConstraint { // Workshop on Techniques for Implementing Constraint Programming // Systems (TRICS), a workshop of CP 2002, N. Beldiceanu, W. Harvey, // Martin Henz, Francois Laburthe, Eric Monfroy, Tobias Müller, -// Laurent Perron and Christian Schulte editors, pages 39–46, 2002. +// Laurent Perron and Christian Schulte editors, pages 39-46, 2002. // ----- SumConstraint ----- diff --git a/ortools/graph/cliques.h b/ortools/graph/cliques.h index e2f3c9c8f7..00f8015afb 100644 --- a/ortools/graph/cliques.h +++ b/ortools/graph/cliques.h @@ -16,7 +16,7 @@ // See http://en.wikipedia.org/wiki/Bron-Kerbosch_algorithm // and // C. Bron and J. Kerbosch, Joep, "Algorithm 457: finding all cliques of an -// undirected graph", CACM 16 (9): 575–577, 1973. +// undirected graph", CACM 16 (9): 575-577, 1973. // http://dl.acm.org/citation.cfm?id=362367&bnc=1. // // Keywords: undirected graph, clique, clique cover, Bron, Kerbosch. diff --git a/ortools/graph/connectivity.h b/ortools/graph/connectivity.h index 6423e1f25b..e5d91fba3c 100644 --- a/ortools/graph/connectivity.h +++ b/ortools/graph/connectivity.h @@ -31,9 +31,9 @@ namespace operations_research { // Template class implementing a Union-Find algorithm with path compression for // maintaining the connected components of a graph. // See Cormen et al. 2nd Edition. MIT Press, 2001. ISBN 0-262-03293-7. -// Chapter 21: Data structures for Disjoint Sets, pp. 498–524. +// Chapter 21: Data structures for Disjoint Sets, pp. 498-524. // and Tarjan (1975). Efficiency of a Good But Not Linear Set -// Union Algorithm. Journal of the ACM 22(2):215–225 +// Union Algorithm. Journal of the ACM 22(2):215-225 // It is implemented as a template so that the size of NodeIndex can be chosen // depending on the size of the graphs considered. // The main interest is that arcs do not need to be kept. Thus the memory @@ -42,7 +42,7 @@ namespace operations_research { // the inverse Ackermann function. alpha(n) <= log(log(log(..log(log(n))..) // In practice alpha(n) <= 5. // See Tarjan and van Leeuwen (1984). Worst-case analysis of set union -// algorithms. Journal of the ACM 31(2):245–281. +// algorithms. Journal of the ACM 31(2):245-281. // // Usage example: // ConnectedComponents components; diff --git a/ortools/graph/hamiltonian_path.h b/ortools/graph/hamiltonian_path.h index 31e90ee4df..1b7dc67523 100644 --- a/ortools/graph/hamiltonian_path.h +++ b/ortools/graph/hamiltonian_path.h @@ -17,7 +17,7 @@ // Solves the Shortest Hamiltonian Path Problem using a complete algorithm. // The algorithm was first described in // M. Held, R.M. Karp, A dynamic programming approach to sequencing problems, -// J. SIAM 10 (1962) 196–210 +// J. SIAM 10 (1962) 196-210 // // The Shortest Hamiltonian Path Problem (SHPP) is similar to the Traveling // Salesperson Problem (TSP). diff --git a/ortools/sat/optimization.h b/ortools/sat/optimization.h index 74ec9b28c6..ccd1a5c9e6 100644 --- a/ortools/sat/optimization.h +++ b/ortools/sat/optimization.h @@ -86,7 +86,7 @@ SatSolver::Status SolveWithFuMalik(LogBehavior log, // // Ansotegui, C., Bonet, M.L., Levy, J.: Solving (weighted) partial MaxSAT // through satisfiability testing. In: Proc. of the 12th Int. Conf. on Theory and -// Applications of Satisfiability Testing (SAT’09). pp. 427–440 (2009) +// Applications of Satisfiability Testing (SAT’09). pp. 427-440 (2009) SatSolver::Status SolveWithWPM1(LogBehavior log, const LinearBooleanProblem& problem, SatSolver* solver, std::vector* solution); diff --git a/ortools/sat/sat_parameters.proto b/ortools/sat/sat_parameters.proto index 9ef7d66247..9047cbaba7 100644 --- a/ortools/sat/sat_parameters.proto +++ b/ortools/sat/sat_parameters.proto @@ -350,7 +350,7 @@ message SatParameters { // // Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, "Improving Glucose for // Incremental SAT Solving with Assumptions: Application to MUS Extraction" - // Theory and Applications of Satisfiability Testing – SAT 2013, Lecture Notes + // Theory and Applications of Satisfiability Testing - SAT 2013, Lecture Notes // in Computer Science Volume 7962, 2013, pp 309-317. optional bool count_assumption_levels_in_lbd = 49 [default = true]; diff --git a/ortools/sat/simplification.cc b/ortools/sat/simplification.cc index 956f88ee60..19a6b41f50 100644 --- a/ortools/sat/simplification.cc +++ b/ortools/sat/simplification.cc @@ -651,7 +651,7 @@ bool SatPresolver::CrossProduct(Literal x) { // // For more details, see the paper "Blocked clause elimination", Matti // Jarvisalo, Armin Biere, Marijn Heule. TACAS, volume 6015 of Lecture - // Notes in Computer Science, pages 129–144. Springer, 2010. + // Notes in Computer Science, pages 129-144. Springer, 2010. // // TODO(user): Choose if we use x or x.Negated() depending on the list // sizes? The function achieve the same if x = x.Negated(), however the