141 lines
5.9 KiB
OpenEdge ABL
141 lines
5.9 KiB
OpenEdge ABL
// Copyright 2010-2021 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.
|
|
|
|
// This .i file is only used in the open-source export to OR-Tools.
|
|
//
|
|
// It exposes some of the C++ classes in ../, namely :
|
|
// - SimpleMaxFlow, from ../max_flow.h
|
|
// - SimpleMinCostFlow, from ../min_cost_flow.h
|
|
// - LinearSumAssignment, from ../assignment.h
|
|
//
|
|
// USAGE EXAMPLES:
|
|
// - examples/csharp/assignment.cs
|
|
// - examples/csharp/csflow.cs
|
|
|
|
%include "enums.swg"
|
|
%include "stdint.i"
|
|
|
|
%include "ortools/base/base.i"
|
|
|
|
%import "ortools/graph/ebert_graph.h"
|
|
|
|
%{
|
|
#include "ortools/graph/assignment.h"
|
|
#include "ortools/graph/max_flow.h"
|
|
#include "ortools/graph/min_cost_flow.h"
|
|
%}
|
|
|
|
// ############ max_flow.h ############
|
|
|
|
%ignoreall
|
|
|
|
%unignore operations_research;
|
|
%rename (MaxFlow) operations_research::SimpleMaxFlow;
|
|
%ignore operations_research::SimpleMaxFlow::GetSourceSideMinCut; // missing typemap for argument
|
|
%ignore operations_research::SimpleMaxFlow::GetSinkSideMinCut; // missing typemap for argument
|
|
%unignore operations_research::SimpleMaxFlow::SimpleMaxFlow;
|
|
%unignore operations_research::SimpleMaxFlow::~SimpleMaxFlow;
|
|
%unignore operations_research::SimpleMaxFlow::AddArcWithCapacity;
|
|
%unignore operations_research::SimpleMaxFlow::Solve;
|
|
%unignore operations_research::SimpleMaxFlow::NumNodes;
|
|
%unignore operations_research::SimpleMaxFlow::NumArcs;
|
|
%unignore operations_research::SimpleMaxFlow::Tail;
|
|
%unignore operations_research::SimpleMaxFlow::Head;
|
|
%unignore operations_research::SimpleMaxFlow::Capacity;
|
|
%unignore operations_research::SimpleMaxFlow::OptimalFlow;
|
|
%unignore operations_research::SimpleMaxFlow::Flow;
|
|
|
|
// Expose the "operations_research::SimpleMaxFlow::Status" enum.
|
|
%unignore operations_research::SimpleMaxFlow::Status;
|
|
%unignore operations_research::SimpleMaxFlow::OPTIMAL;
|
|
%unignore operations_research::SimpleMaxFlow::POSSIBLE_OVERFLOW;
|
|
%unignore operations_research::SimpleMaxFlow::BAD_INPUT;
|
|
%unignore operations_research::SimpleMaxFlow::BAD_RESULT;
|
|
%include "ortools/graph/max_flow.h"
|
|
|
|
%unignoreall
|
|
|
|
// ############ min_cost_flow.h ############
|
|
|
|
%ignoreall
|
|
|
|
%unignore operations_research;
|
|
|
|
// We prefer our users to access the Status enum via the "SimpleMinCostFlow"
|
|
// class, i.e. SimpleMinCostFlow.OPTIMAL. But since they're defined on a
|
|
// base class in the .h, we must expose it.
|
|
%unignore operations_research::MinCostFlowBase;
|
|
%unignore operations_research::MinCostFlowBase::Status;
|
|
%unignore operations_research::MinCostFlowBase::OPTIMAL;
|
|
%unignore operations_research::MinCostFlowBase::NOT_SOLVED;
|
|
%unignore operations_research::MinCostFlowBase::FEASIBLE;
|
|
%unignore operations_research::MinCostFlowBase::INFEASIBLE;
|
|
%unignore operations_research::MinCostFlowBase::UNBALANCED;
|
|
%unignore operations_research::MinCostFlowBase::BAD_RESULT;
|
|
%unignore operations_research::MinCostFlowBase::BAD_COST_RANGE;
|
|
|
|
%rename (MinCostFlow) operations_research::SimpleMinCostFlow;
|
|
%unignore operations_research::SimpleMinCostFlow::SimpleMinCostFlow;
|
|
%unignore operations_research::SimpleMinCostFlow::~SimpleMinCostFlow;
|
|
%unignore operations_research::SimpleMinCostFlow::AddArcWithCapacityAndUnitCost;
|
|
%unignore operations_research::SimpleMinCostFlow::SetNodeSupply;
|
|
%unignore operations_research::SimpleMinCostFlow::Solve;
|
|
%unignore operations_research::SimpleMinCostFlow::SolveMaxFlowWithMinCost;
|
|
%unignore operations_research::SimpleMinCostFlow::OptimalCost;
|
|
%unignore operations_research::SimpleMinCostFlow::MaximumFlow;
|
|
%unignore operations_research::SimpleMinCostFlow::Flow;
|
|
%unignore operations_research::SimpleMinCostFlow::NumNodes;
|
|
%unignore operations_research::SimpleMinCostFlow::NumArcs;
|
|
%unignore operations_research::SimpleMinCostFlow::Tail;
|
|
%unignore operations_research::SimpleMinCostFlow::Head;
|
|
%unignore operations_research::SimpleMinCostFlow::Capacity;
|
|
%unignore operations_research::SimpleMinCostFlow::Supply;
|
|
%unignore operations_research::SimpleMinCostFlow::UnitCost;
|
|
|
|
%include "ortools/graph/min_cost_flow.h"
|
|
|
|
%unignoreall
|
|
|
|
// ############ assignment.h ############
|
|
|
|
// TODO(user): document which method is tested and which isn't, once the C#
|
|
// example using this code has been backported from or-tools.
|
|
%ignoreall
|
|
|
|
%unignore operations_research;
|
|
// We only expose the C++ "operations_research::SimpleLinearSumAssignment"
|
|
// class, and we rename it "LinearSumAssignment".
|
|
%rename(LinearSumAssignment) operations_research::SimpleLinearSumAssignment;
|
|
%unignore
|
|
operations_research::SimpleLinearSumAssignment::SimpleLinearSumAssignment;
|
|
%unignore operations_research::SimpleLinearSumAssignment::AddArcWithCost;
|
|
%unignore operations_research::SimpleLinearSumAssignment::Solve;
|
|
%unignore operations_research::SimpleLinearSumAssignment::NumNodes;
|
|
%unignore operations_research::SimpleLinearSumAssignment::NumArcs;
|
|
%unignore operations_research::SimpleLinearSumAssignment::LeftNode;
|
|
%unignore operations_research::SimpleLinearSumAssignment::RightNode;
|
|
%unignore operations_research::SimpleLinearSumAssignment::Cost;
|
|
%unignore operations_research::SimpleLinearSumAssignment::OptimalCost;
|
|
%unignore operations_research::SimpleLinearSumAssignment::RightMate;
|
|
%unignore operations_research::SimpleLinearSumAssignment::AssignmentCost;
|
|
|
|
// Expose the "operations_research::SimpleLinearSumAssignment::Status" enum.
|
|
%unignore operations_research::SimpleLinearSumAssignment::Status;
|
|
%unignore operations_research::SimpleLinearSumAssignment::OPTIMAL;
|
|
%unignore operations_research::SimpleLinearSumAssignment::INFEASIBLE;
|
|
%unignore operations_research::SimpleLinearSumAssignment::POSSIBLE_OVERFLOW;
|
|
|
|
%include "ortools/graph/assignment.h"
|
|
|
|
%unignoreall
|