Files
ortools-clone/ortools/constraint_solver/sched_expr.cc
Corentin Le Molgat b027e57e95 dotnet: Remove reference to dotnet release command
- Currently not implemented...

Add abseil patch

- Add patches/absl-config.cmake

Makefile: Add abseil-cpp on unix

- Force abseil-cpp SHA1 to 45221cc
  note: Just before the PR #136 which break all CMake

Makefile: Add abseil-cpp on windows

- Force abseil-cpp SHA1 to 45221cc
  note: Just before the PR #136 which break all CMake

CMake: Add abseil-cpp

- Force abseil-cpp SHA1 to 45221cc
  note: Just before the PR #136 which break all CMake

port to absl: C++ Part

- Fix warning with the use of ABSL_MUST_USE_RESULT
  > The macro must appear as the very first part of a function
    declaration or definition:
    ...
    Note: past advice was to place the macro after the argument list.
  src: dependencies/sources/abseil-cpp-master/absl/base/attributes.h:418
- Rename enum after windows clash
- Remove non compact table constraints
- Change index type from int64 to int in routing library
- Fix file_nonport compilation on windows
- Fix another naming conflict with windows (NO_ERROR is a macro)
- Cleanup hash containers; work on sat internals
- Add optional_boolean sub-proto

Sync cpp examples with internal code
- reenable issue173 after reducing number of loops

port to absl: Python Part

- Add back cp_model.INT32_MIN|MAX for examples

Update Python examples

- Add random_tsp.py
- Run words_square example
- Run magic_square in python tests

port to absl: Java Part

- Fix compilation of the new routing parameters in java
- Protect some code from SWIG parsing

Update Java Examples

port to absl: .Net Part

Update .Net examples

work on sat internals; Add C++ CP-SAT CpModelBuilder API; update sample code and recipes to use the new API; sync with internal code

Remove VS 2015 in Appveyor-CI

- abseil-cpp does not support VS 2015...

improve tables

upgrade C++ sat examples to use the new API; work on sat internals

update license dates

rewrite jobshop_ft06_distance.py to use the CP-SAT solver

rename last example

revert last commit

more work on SAT internals

fix
2018-11-30 14:48:55 +01:00

197 lines
6.2 KiB
C++

// Copyright 2010-2018 Google LLC
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include <string>
#include <vector>
#include "absl/strings/str_format.h"
#include "ortools/base/integral_types.h"
#include "ortools/base/logging.h"
#include "ortools/base/macros.h"
#include "ortools/constraint_solver/constraint_solver.h"
#include "ortools/constraint_solver/constraint_solveri.h"
#if defined(_MSC_VER)
#pragma warning(disable : 4351 4355 4804 4805)
#endif
namespace operations_research {
namespace {
class IntervalVarStartExpr : public BaseIntExpr {
public:
explicit IntervalVarStartExpr(IntervalVar* const i)
: BaseIntExpr(i->solver()), interval_(i) {}
~IntervalVarStartExpr() override {}
int64 Min() const override { return interval_->StartMin(); }
void SetMin(int64 m) override { interval_->SetStartMin(m); }
int64 Max() const override { return interval_->StartMax(); }
void SetMax(int64 m) override { interval_->SetStartMax(m); }
void SetRange(int64 l, int64 u) override { interval_->SetStartRange(l, u); }
void SetValue(int64 v) override { interval_->SetStartRange(v, v); }
bool Bound() const override {
return interval_->StartMin() == interval_->StartMax();
}
void WhenRange(Demon* d) override { interval_->WhenStartRange(d); }
std::string DebugString() const override {
return absl::StrFormat("start(%s)", interval_->DebugString());
}
void Accept(ModelVisitor* const visitor) const override {
visitor->BeginVisitIntegerExpression(ModelVisitor::kStartExpr, this);
visitor->VisitIntervalArgument(ModelVisitor::kIntervalArgument, interval_);
visitor->EndVisitIntegerExpression(ModelVisitor::kStartExpr, this);
}
private:
IntervalVar* interval_;
DISALLOW_COPY_AND_ASSIGN(IntervalVarStartExpr);
};
class IntervalVarEndExpr : public BaseIntExpr {
public:
explicit IntervalVarEndExpr(IntervalVar* const i)
: BaseIntExpr(i->solver()), interval_(i) {}
~IntervalVarEndExpr() override {}
int64 Min() const override { return interval_->EndMin(); }
void SetMin(int64 m) override { interval_->SetEndMin(m); }
int64 Max() const override { return interval_->EndMax(); }
void SetMax(int64 m) override { interval_->SetEndMax(m); }
void SetRange(int64 l, int64 u) override { interval_->SetEndRange(l, u); }
void SetValue(int64 v) override { interval_->SetEndRange(v, v); }
bool Bound() const override {
return interval_->EndMin() == interval_->EndMax();
}
void WhenRange(Demon* d) override { interval_->WhenEndRange(d); }
std::string DebugString() const override {
return absl::StrFormat("end(%s)", interval_->DebugString());
}
void Accept(ModelVisitor* const visitor) const override {
visitor->BeginVisitIntegerExpression(ModelVisitor::kEndExpr, this);
visitor->VisitIntervalArgument(ModelVisitor::kIntervalArgument, interval_);
visitor->EndVisitIntegerExpression(ModelVisitor::kEndExpr, this);
}
private:
IntervalVar* interval_;
DISALLOW_COPY_AND_ASSIGN(IntervalVarEndExpr);
};
class IntervalVarDurationExpr : public BaseIntExpr {
public:
explicit IntervalVarDurationExpr(IntervalVar* const i)
: BaseIntExpr(i->solver()), interval_(i) {}
~IntervalVarDurationExpr() override {}
int64 Min() const override { return interval_->DurationMin(); }
void SetMin(int64 m) override { interval_->SetDurationMin(m); }
int64 Max() const override { return interval_->DurationMax(); }
void SetMax(int64 m) override { interval_->SetDurationMax(m); }
void SetRange(int64 l, int64 u) override {
interval_->SetDurationRange(l, u);
}
void SetValue(int64 v) override { interval_->SetDurationRange(v, v); }
bool Bound() const override {
return interval_->DurationMin() == interval_->DurationMax();
}
void WhenRange(Demon* d) override { interval_->WhenDurationRange(d); }
std::string DebugString() const override {
return absl::StrFormat("duration(%s)", interval_->DebugString());
}
void Accept(ModelVisitor* const visitor) const override {
visitor->BeginVisitIntegerExpression(ModelVisitor::kDurationExpr, this);
visitor->VisitIntervalArgument(ModelVisitor::kIntervalArgument, interval_);
visitor->EndVisitIntegerExpression(ModelVisitor::kDurationExpr, this);
}
private:
IntervalVar* interval_;
DISALLOW_COPY_AND_ASSIGN(IntervalVarDurationExpr);
};
} // namespace
// ----- API -----
IntExpr* BuildStartExpr(IntervalVar* var) {
Solver* const s = var->solver();
IntExpr* const expr =
s->RegisterIntExpr(s->RevAlloc(new IntervalVarStartExpr(var)));
if (var->HasName()) {
expr->set_name(absl::StrFormat("start<%s>", var->name()));
}
return expr;
}
IntExpr* BuildDurationExpr(IntervalVar* var) {
Solver* const s = var->solver();
IntExpr* const expr =
s->RegisterIntExpr(s->RevAlloc(new IntervalVarDurationExpr(var)));
if (var->HasName()) {
expr->set_name(absl::StrFormat("duration<%s>", var->name()));
}
return expr;
}
IntExpr* BuildEndExpr(IntervalVar* var) {
Solver* const s = var->solver();
IntExpr* const expr =
s->RegisterIntExpr(s->RevAlloc(new IntervalVarEndExpr(var)));
if (var->HasName()) {
expr->set_name(absl::StrFormat("end<%s>", var->name()));
}
return expr;
}
IntExpr* BuildSafeStartExpr(IntervalVar* var, int64 unperformed_value) {
return var->solver()->MakeConditionalExpression(
var->PerformedExpr()->Var(), var->StartExpr(), unperformed_value);
}
IntExpr* BuildSafeDurationExpr(IntervalVar* var, int64 unperformed_value) {
return var->solver()->MakeConditionalExpression(
var->PerformedExpr()->Var(), var->DurationExpr(), unperformed_value);
}
IntExpr* BuildSafeEndExpr(IntervalVar* var, int64 unperformed_value) {
return var->solver()->MakeConditionalExpression(
var->PerformedExpr()->Var(), var->EndExpr(), unperformed_value);
}
} // namespace operations_research