RoutingEnums.java

Go to the documentation of this file.

// Generated by the protocol buffer compiler.  DO NOT EDIT!
// source: ortools/constraint_solver/routing_enums.proto
 
package com.google.ortools.constraintsolver;
 
public final class RoutingEnums {
  private RoutingEnums() {}
  public static void registerAllExtensions(
      com.google.protobuf.ExtensionRegistryLite registry) {
  }
 
  public static void registerAllExtensions(
      com.google.protobuf.ExtensionRegistry registry) {
    registerAllExtensions(
        (com.google.protobuf.ExtensionRegistryLite) registry);
  }
  static final com.google.protobuf.Descriptors.Descriptor
    internal_static_operations_research_FirstSolutionStrategy_descriptor;
  static final 
    com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
      internal_static_operations_research_FirstSolutionStrategy_fieldAccessorTable;
  static final com.google.protobuf.Descriptors.Descriptor
    internal_static_operations_research_LocalSearchMetaheuristic_descriptor;
  static final 
    com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
      internal_static_operations_research_LocalSearchMetaheuristic_fieldAccessorTable;
 
  public static com.google.protobuf.Descriptors.FileDescriptor
      getDescriptor() {
    return descriptor;
  }
  private static  com.google.protobuf.Descriptors.FileDescriptor
      descriptor;
  static {
    java.lang.String[] descriptorData = {
      "\n-ortools/constraint_solver/routing_enum" +
      "s.proto\022\023operations_research\"\214\003\n\025FirstSo" +
      "lutionStrategy\"\362\002\n\005Value\022\t\n\005UNSET\020\000\022\r\n\tA" +
      "UTOMATIC\020\017\022\025\n\021PATH_CHEAPEST_ARC\020\003\022\035\n\031PAT" +
      "H_MOST_CONSTRAINED_ARC\020\004\022\026\n\022EVALUATOR_ST" +
      "RATEGY\020\005\022\013\n\007SAVINGS\020\n\022\t\n\005SWEEP\020\013\022\020\n\014CHRI" +
      "STOFIDES\020\r\022\023\n\017ALL_UNPERFORMED\020\006\022\022\n\016BEST_" +
      "INSERTION\020\007\022\037\n\033PARALLEL_CHEAPEST_INSERTI" +
      "ON\020\010\022!\n\035SEQUENTIAL_CHEAPEST_INSERTION\020\016\022" +
      "\034\n\030LOCAL_CHEAPEST_INSERTION\020\t\022\027\n\023GLOBAL_" +
      "CHEAPEST_ARC\020\001\022\026\n\022LOCAL_CHEAPEST_ARC\020\002\022\033" +
      "\n\027FIRST_UNBOUND_MIN_VALUE\020\014\"\256\001\n\030LocalSea" +
      "rchMetaheuristic\"\221\001\n\005Value\022\t\n\005UNSET\020\000\022\r\n" +
      "\tAUTOMATIC\020\006\022\022\n\016GREEDY_DESCENT\020\001\022\027\n\023GUID" +
      "ED_LOCAL_SEARCH\020\002\022\027\n\023SIMULATED_ANNEALING" +
      "\020\003\022\017\n\013TABU_SEARCH\020\004\022\027\n\023GENERIC_TABU_SEAR" +
      "CH\020\005BI\n#com.google.ortools.constraintsol" +
      "verP\001\252\002\037Google.OrTools.ConstraintSolverb" +
      "\006proto3"
    };
    descriptor = com.google.protobuf.Descriptors.FileDescriptor
      .internalBuildGeneratedFileFrom(descriptorData,
        new com.google.protobuf.Descriptors.FileDescriptor[] {
        });
    internal_static_operations_research_FirstSolutionStrategy_descriptor =
      getDescriptor().getMessageTypes().get(0);
    internal_static_operations_research_FirstSolutionStrategy_fieldAccessorTable = new
      com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
        internal_static_operations_research_FirstSolutionStrategy_descriptor,
        new java.lang.String[] { });
    internal_static_operations_research_LocalSearchMetaheuristic_descriptor =
      getDescriptor().getMessageTypes().get(1);
    internal_static_operations_research_LocalSearchMetaheuristic_fieldAccessorTable = new
      com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
        internal_static_operations_research_LocalSearchMetaheuristic_descriptor,
        new java.lang.String[] { });
  }
 
  // @@protoc_insertion_point(outer_class_scope)
}