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

examples/java/Tsp.java

@@ -1,5 +1,5 @@
 //
-// Copyright 2012 Google
+// Copyright 2010-2017 Google LLC
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.
@@ -12,25 +12,28 @@
 // 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.
-import java.io.*;
-import java.util.*;
-import java.text.*;
-
 import com.google.ortools.constraintsolver.Assignment;
-import com.google.ortools.constraintsolver.NodeEvaluator2;
-import com.google.ortools.constraintsolver.RoutingModel;
 import com.google.ortools.constraintsolver.FirstSolutionStrategy;
+import com.google.ortools.constraintsolver.IntIntToLong;
+import com.google.ortools.constraintsolver.IntToLong;
+import com.google.ortools.constraintsolver.RoutingIndexManager;
+import com.google.ortools.constraintsolver.RoutingModel;
 import com.google.ortools.constraintsolver.RoutingSearchParameters;
+import com.google.ortools.constraintsolver.main;
+import java.io.*;
+import java.text.*;
+import java.util.*;
 
 class Tsp {
   static {
     System.loadLibrary("jniortools");
   }
 
-  static class RandomManhattan extends NodeEvaluator2 {
-    public RandomManhattan(int size, int seed) {
+  static class RandomManhattan extends IntIntToLong {
+    public RandomManhattan(RoutingIndexManager manager, int size, int seed) {
       this.xs = new int[size];
       this.ys = new int[size];
+      this.indexManager = manager;
       Random generator = new Random(seed);
       for (int i = 0; i < size; ++i) {
         xs[i] = generator.nextInt(1000);
@@ -40,30 +43,33 @@ class Tsp {
 
     @Override
     public long run(int firstIndex, int secondIndex) {
-      return Math.abs(xs[firstIndex] - xs[secondIndex])
-          + Math.abs(ys[firstIndex] - ys[secondIndex]);
+      int firstNode = indexManager.indexToNode(firstIndex);
+      int secondNode = indexManager.indexToNode(secondIndex);
+      return Math.abs(xs[firstNode] - xs[secondNode]) + Math.abs(ys[firstNode] - ys[secondNode]);
     }
 
     private int[] xs;
     private int[] ys;
+    private RoutingIndexManager indexManager;
   }
 
-  static class ConstantCallback extends NodeEvaluator2 {
+  static class ConstantCallback extends IntToLong {
     @Override
-    public long run(int firstIndex, int secondIndex) {
+    public long run(int index) {
       return 1;
     }
   }
 
   static void solve(int size, int forbidden, int seed) {
-    RoutingModel routing = new RoutingModel(size, 1, 0);
+    RoutingIndexManager manager = new RoutingIndexManager(size, 1, 0);
+    RoutingModel routing = new RoutingModel(manager);
 
     // Setting the cost function.
     // Put a permanent callback to the distance accessor here. The callback
     // has the following signature: ResultCallback2<int64, int64, int64>.
     // The two arguments are the from and to node inidices.
-    NodeEvaluator2 distances = new RandomManhattan(size, seed);
-    routing.setArcCostEvaluatorOfAllVehicles(distances);
+    IntIntToLong distances = new RandomManhattan(manager, size, seed);
+    routing.setArcCostEvaluatorOfAllVehicles(routing.registerTransitCallback(distances));
 
     // Forbid node connections (randomly).
     Random randomizer = new Random();
@@ -79,12 +85,17 @@ class Tsp {
     }
 
     // Add dummy dimension to test API.
-    routing.addDimension(new ConstantCallback(), size + 1, size + 1, true, "dummy");
+    routing.addDimension(
+        routing.registerUnaryTransitCallback(new ConstantCallback()),
+        size + 1,
+        size + 1,
+        true,
+        "dummy");
 
     // Solve, returns a solution if any (owned by RoutingModel).
     RoutingSearchParameters search_parameters =
         RoutingSearchParameters.newBuilder()
-            .mergeFrom(RoutingModel.defaultSearchParameters())
+            .mergeFrom(main.defaultRoutingSearchParameters())
             .setFirstSolutionStrategy(FirstSolutionStrategy.Value.PATH_CHEAPEST_ARC)
             .build();
 
@@ -95,8 +106,9 @@ class Tsp {
       // Inspect solution.
       // Only one route here; otherwise iterate from 0 to routing.vehicles() - 1
       int route_number = 0;
-      for (long node = routing.start(route_number); !routing.isEnd(node);
-           node = solution.value(routing.nextVar(node))) {
+      for (long node = routing.start(route_number);
+          !routing.isEnd(node);
+          node = solution.value(routing.nextVar(node))) {
         System.out.print("" + node + " -> ");
       }
       System.out.println("0");