ortools: cleanup export form google3
This commit is contained in:
@@ -43,12 +43,10 @@
|
||||
#include <ostream>
|
||||
#include <sstream>
|
||||
#include <string>
|
||||
#include <type_traits>
|
||||
#include <utility>
|
||||
#include <vector>
|
||||
|
||||
#include "absl/container/inlined_vector.h"
|
||||
#include "ortools/base/strong_int.h"
|
||||
#include "ortools/base/strong_vector.h"
|
||||
|
||||
/* need extra level to force extra eval */
|
||||
|
||||
@@ -16,7 +16,7 @@
|
||||
// This file should only be included in base.i inside Python-specific part:
|
||||
// #ifdef SWIGPYTHON
|
||||
// %{
|
||||
// #include "ortools/base/swig/python-swig.cc"
|
||||
// #include "ortools/base/python-swig.h"
|
||||
// %}
|
||||
// #endif
|
||||
// It has no XXX_H_ guard because SWIG protects all %include'd files to be used
|
||||
|
||||
@@ -174,7 +174,7 @@ public static class IntVarArrayHelper
|
||||
}
|
||||
}
|
||||
|
||||
// TODO(user): Try to move this code back to the .swig with @define macros.
|
||||
// TODO(user): Try to move this code back to the .i with @define macros.
|
||||
public partial class IntVarVector : IDisposable,
|
||||
System.Collections.IEnumerable
|
||||
#if !SWIG_DOTNET_1
|
||||
|
||||
@@ -21,22 +21,19 @@
|
||||
#include <utility>
|
||||
#include <vector>
|
||||
|
||||
#include "absl/container/flat_hash_map.h"
|
||||
#include "absl/flags/flag.h"
|
||||
#include "absl/strings/str_cat.h"
|
||||
#include "absl/strings/str_format.h"
|
||||
#include "absl/strings/string_view.h"
|
||||
#include "absl/types/span.h"
|
||||
#include "ortools/base/commandlineflags.h"
|
||||
#include "ortools/base/logging.h"
|
||||
#include "ortools/base/map_util.h"
|
||||
#include "ortools/base/mathutil.h"
|
||||
#include "ortools/base/stl_util.h"
|
||||
#include "ortools/base/types.h"
|
||||
#include "ortools/constraint_solver/constraint_solver.h"
|
||||
#include "ortools/constraint_solver/constraint_solveri.h"
|
||||
#include "ortools/util/bitset.h"
|
||||
#include "ortools/util/piecewise_linear_function.h"
|
||||
#include "ortools/util/saturated_arithmetic.h"
|
||||
#include "ortools/util/string_array.h"
|
||||
|
||||
ABSL_FLAG(bool, cp_disable_expression_optimization, false,
|
||||
"Disable special optimization when creating expressions.");
|
||||
@@ -5849,8 +5846,8 @@ class SimpleConvexPiecewiseExpr : public BaseIntExpr {
|
||||
DCHECK_GE(lc, int64_t{0});
|
||||
DCHECK_GE(ld, ed);
|
||||
|
||||
// If the penalty is 0, we can push the "confort zone or zone
|
||||
// of no cost towards infinity.
|
||||
// If the penalty is 0, we can push the "comfort zone or zone of no cost
|
||||
// towards infinity.
|
||||
}
|
||||
|
||||
~SimpleConvexPiecewiseExpr() override {}
|
||||
|
||||
@@ -273,7 +273,7 @@ void BM_ChristofidesPathSolver(benchmark::State& state) {
|
||||
}
|
||||
}
|
||||
auto cost = [&costs](int i, int j) { return costs[i][j]; };
|
||||
// TODO: MSVC v19.41 can't convert lambda to std::function.
|
||||
// TODO(user) MSVC v19.41 can't convert lambda to std::function.
|
||||
#if defined(_MSC_VER)
|
||||
using Cost = std::function<int(int, int)>;
|
||||
#else
|
||||
|
||||
@@ -22,6 +22,7 @@
|
||||
#include "absl/log/log.h"
|
||||
#include "absl/types/span.h"
|
||||
#include "gtest/gtest.h"
|
||||
#include "ortools/base/gmock.h"
|
||||
#include "ortools/base/path.h"
|
||||
#include "ortools/routing/parsers/tsplib_parser.h"
|
||||
|
||||
|
||||
@@ -5,13 +5,14 @@ quadratic programming (QP) problems using first-order methods.
|
||||
|
||||
The implementation is based on the Primal-Dual Hybrid Gradient (PDHG) algorithm,
|
||||
which is preprocessed with scaling and optional presolving to improve
|
||||
performance and numerical stability.
|
||||
performance and numerical stability. See also
|
||||
[Mathematical background for PDLP][background].
|
||||
|
||||
## Core C++ libraries:
|
||||
|
||||
* [`primal_dual_hybrid_gradient.h`][primal_dual_hybrid_gradient_h]: The main
|
||||
entry point for the solver, which takes a `QuadraticProgram` and solver
|
||||
parameters.
|
||||
entry point `PrimalDualHybridGradient()` for the solver, which takes a
|
||||
`QuadraticProgram` and solver parameters.
|
||||
* [`quadratic_program.h`][quadratic_program_h]: Defines the `QuadraticProgram`
|
||||
struct to represent the optimization problem, including objective vectors,
|
||||
constraint matrices, and bounds.
|
||||
@@ -41,6 +42,7 @@ performance and numerical stability.
|
||||
* [`samples/`](samples): This directory provides example usage of the library.
|
||||
|
||||
<!-- Links used throughout the document. -->
|
||||
[background]: https://developers.google.com/optimization/lp/pdlp_math
|
||||
[primal_dual_hybrid_gradient_h]: ../pdlp/primal_dual_hybrid_gradient.h
|
||||
[quadratic_program_h]: ../pdlp/quadratic_program.h
|
||||
[quadratic_program_io_h]: ../pdlp/quadratic_program_io.h
|
||||
|
||||
Reference in New Issue
Block a user