ortools.constraint_solver.routing_parameters_pb2

Generated protocol buffer code.

 1# -*- coding: utf-8 -*-
 2# Generated by the protocol buffer compiler.  DO NOT EDIT!
 3# NO CHECKED-IN PROTOBUF GENCODE
 4# source: ortools/constraint_solver/routing_parameters.proto
 5# Protobuf Python Version: 5.29.3
 6"""Generated protocol buffer code."""
 7from google.protobuf import descriptor as _descriptor
 8from google.protobuf import descriptor_pool as _descriptor_pool
 9from google.protobuf import runtime_version as _runtime_version
10from google.protobuf import symbol_database as _symbol_database
11from google.protobuf.internal import builder as _builder
12_runtime_version.ValidateProtobufRuntimeVersion(
13    _runtime_version.Domain.PUBLIC,
14    5,
15    29,
16    3,
17    '',
18    'ortools/constraint_solver/routing_parameters.proto'
19)
20# @@protoc_insertion_point(imports)
21
22_sym_db = _symbol_database.Default()
23
24
25from google.protobuf import duration_pb2 as google_dot_protobuf_dot_duration__pb2
26from ortools.constraint_solver import routing_enums_pb2 as ortools_dot_constraint__solver_dot_routing__enums__pb2
27from ortools.constraint_solver import routing_ils_pb2 as ortools_dot_constraint__solver_dot_routing__ils__pb2
28from ortools.constraint_solver import solver_parameters_pb2 as ortools_dot_constraint__solver_dot_solver__parameters__pb2
29from ortools.sat import sat_parameters_pb2 as ortools_dot_sat_dot_sat__parameters__pb2
30from ortools.util import optional_boolean_pb2 as ortools_dot_util_dot_optional__boolean__pb2
31
32
33DESCRIPTOR = _descriptor_pool.Default().AddSerializedFile(b'\n2ortools/constraint_solver/routing_parameters.proto\x12\x13operations_research\x1a\x1egoogle/protobuf/duration.proto\x1a-ortools/constraint_solver/routing_enums.proto\x1a+ortools/constraint_solver/routing_ils.proto\x1a\x31ortools/constraint_solver/solver_parameters.proto\x1a ortools/sat/sat_parameters.proto\x1a#ortools/util/optional_boolean.proto\"\xba\x37\n\x17RoutingSearchParameters\x12Q\n\x17\x66irst_solution_strategy\x18\x01 \x01(\x0e\x32\x30.operations_research.FirstSolutionStrategy.Value\x12.\n&use_unfiltered_first_solution_strategy\x18\x02 \x01(\x08\x12\x1f\n\x17savings_neighbors_ratio\x18\x0e \x01(\x01\x12&\n\x1esavings_max_memory_usage_bytes\x18\x17 \x01(\x01\x12 \n\x18savings_add_reverse_arcs\x18\x0f \x01(\x08\x12\x1f\n\x17savings_arc_coefficient\x18\x12 \x01(\x01\x12/\n\'cheapest_insertion_farthest_seeds_ratio\x18\x10 \x01(\x01\x12\x39\n1cheapest_insertion_first_solution_neighbors_ratio\x18\x15 \x01(\x01\x12\x37\n/cheapest_insertion_first_solution_min_neighbors\x18, \x01(\x05\x12\x36\n.cheapest_insertion_ls_operator_neighbors_ratio\x18\x1f \x01(\x01\x12\x34\n,cheapest_insertion_ls_operator_min_neighbors\x18- \x01(\x05\x12P\nHcheapest_insertion_first_solution_use_neighbors_ratio_for_initialization\x18. \x01(\x08\x12\x32\n*cheapest_insertion_add_unperformed_entries\x18( \x01(\x08\x12}\n1local_cheapest_insertion_pickup_delivery_strategy\x18\x31 \x01(\x0e\x32\x42.operations_research.RoutingSearchParameters.PairInsertionStrategy\x12\x82\x01\n6local_cheapest_cost_insertion_pickup_delivery_strategy\x18\x37 \x01(\x0e\x32\x42.operations_research.RoutingSearchParameters.PairInsertionStrategy\x12z\n+local_cheapest_insertion_sorting_properties\x18\x43 \x03(\x0e\x32\x45.operations_research.RoutingSearchParameters.InsertionSortingProperty\x12)\n!christofides_use_minimum_matching\x18\x1e \x01(\x08\x12*\n\"first_solution_optimization_period\x18; \x01(\x05\x12m\n\x16local_search_operators\x18\x03 \x01(\x0b\x32M.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators\x12#\n\x1bls_operator_neighbors_ratio\x18\x35 \x01(\x01\x12!\n\x19ls_operator_min_neighbors\x18\x36 \x01(\x05\x12\x34\n,use_multi_armed_bandit_concatenate_operators\x18) \x01(\x08\x12?\n7multi_armed_bandit_compound_operator_memory_coefficient\x18* \x01(\x01\x12\x44\n<multi_armed_bandit_compound_operator_exploration_coefficient\x18+ \x01(\x01\x12\"\n\x1amax_swap_active_chain_size\x18\x42 \x01(\x05\x12\x35\n-relocate_expensive_chain_num_arcs_to_consider\x18\x14 \x01(\x05\x12:\n2heuristic_expensive_chain_lns_num_arcs_to_consider\x18  \x01(\x05\x12+\n#heuristic_close_nodes_lns_num_nodes\x18# \x01(\x05\x12W\n\x1alocal_search_metaheuristic\x18\x04 \x01(\x0e\x32\x33.operations_research.LocalSearchMetaheuristic.Value\x12X\n\x1blocal_search_metaheuristics\x18? \x03(\x0e\x32\x33.operations_research.LocalSearchMetaheuristic.Value\x12\x38\n0num_max_local_optima_before_metaheuristic_switch\x18@ \x01(\x05\x12.\n&guided_local_search_lambda_coefficient\x18\x05 \x01(\x01\x12@\n8guided_local_search_reset_penalties_on_new_best_solution\x18\x33 \x01(\x08\x12\x39\n1guided_local_search_penalize_with_vehicle_classes\x18= \x01(\x08\x12\x43\n;use_guided_local_search_penalties_in_local_search_operators\x18> \x01(\x08\x12\x1e\n\x16use_depth_first_search\x18\x06 \x01(\x08\x12\x34\n\x06use_cp\x18\x1c \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x38\n\nuse_cp_sat\x18\x1b \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x44\n\x16use_generalized_cp_sat\x18/ \x01(\x0e\x32$.operations_research.OptionalBoolean\x12>\n\x0esat_parameters\x18\x30 \x01(\x0b\x32&.operations_research.sat.SatParameters\x12,\n$report_intermediate_cp_sat_solutions\x18\x38 \x01(\x08\x12)\n!fallback_to_cp_sat_size_threshold\x18\x34 \x01(\x05\x12\x63\n\x1c\x63ontinuous_scheduling_solver\x18! \x01(\x0e\x32=.operations_research.RoutingSearchParameters.SchedulingSolver\x12\x66\n\x1fmixed_integer_scheduling_solver\x18\" \x01(\x0e\x32=.operations_research.RoutingSearchParameters.SchedulingSolver\x12\x43\n6disable_scheduling_beware_this_may_degrade_performance\x18\x32 \x01(\x08H\x00\x88\x01\x01\x12\x19\n\x11optimization_step\x18\x07 \x01(\x01\x12&\n\x1enumber_of_solutions_to_collect\x18\x11 \x01(\x05\x12\x16\n\x0esolution_limit\x18\x08 \x01(\x03\x12-\n\ntime_limit\x18\t \x01(\x0b\x32\x19.google.protobuf.Duration\x12\x31\n\x0elns_time_limit\x18\n \x01(\x0b\x32\x19.google.protobuf.Duration\x12%\n\x1dsecondary_ls_time_limit_ratio\x18\x39 \x01(\x01\x12s\n\x1cimprovement_limit_parameters\x18% \x01(\x0b\x32M.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters\x12\x1c\n\x14use_full_propagation\x18\x0b \x01(\x08\x12\x12\n\nlog_search\x18\r \x01(\x08\x12\x1f\n\x17log_cost_scaling_factor\x18\x16 \x01(\x01\x12\x17\n\x0flog_cost_offset\x18\x1d \x01(\x01\x12\x0f\n\x07log_tag\x18$ \x01(\t\x12!\n\x19use_iterated_local_search\x18: \x01(\x08\x12\\\n iterated_local_search_parameters\x18< \x01(\x0b\x32\x32.operations_research.IteratedLocalSearchParameters\x1a\xda\x15\n LocalSearchNeighborhoodOperators\x12:\n\x0cuse_relocate\x18\x01 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12?\n\x11use_relocate_pair\x18\x02 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x45\n\x17use_light_relocate_pair\x18\x18 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x44\n\x16use_relocate_neighbors\x18\x03 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x42\n\x14use_relocate_subtrip\x18\x19 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12:\n\x0cuse_exchange\x18\x04 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12?\n\x11use_exchange_pair\x18\x16 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x42\n\x14use_exchange_subtrip\x18\x1a \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x37\n\tuse_cross\x18\x05 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12@\n\x12use_cross_exchange\x18\x06 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12J\n\x1cuse_relocate_expensive_chain\x18\x17 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x39\n\x0buse_two_opt\x18\x07 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x38\n\nuse_or_opt\x18\x08 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12?\n\x11use_lin_kernighan\x18\t \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x39\n\x0buse_tsp_opt\x18\n \x01(\x0e\x32$.operations_research.OptionalBoolean\x12=\n\x0fuse_make_active\x18\x0b \x01(\x0e\x32$.operations_research.OptionalBoolean\x12J\n\x1cuse_relocate_and_make_active\x18\x15 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12J\n\x1cuse_exchange_and_make_active\x18% \x01(\x0e\x32$.operations_research.OptionalBoolean\x12Z\n,use_exchange_path_start_ends_and_make_active\x18& \x01(\x0e\x32$.operations_research.OptionalBoolean\x12?\n\x11use_make_inactive\x18\x0c \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x45\n\x17use_make_chain_inactive\x18\r \x01(\x0e\x32$.operations_research.OptionalBoolean\x12=\n\x0fuse_swap_active\x18\x0e \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x43\n\x15use_swap_active_chain\x18# \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x46\n\x18use_extended_swap_active\x18\x0f \x01(\x0e\x32$.operations_research.OptionalBoolean\x12K\n\x1duse_shortest_path_swap_active\x18\" \x01(\x0e\x32$.operations_research.OptionalBoolean\x12G\n\x19use_shortest_path_two_opt\x18$ \x01(\x0e\x32$.operations_research.OptionalBoolean\x12G\n\x19use_node_pair_swap_active\x18\x14 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12:\n\x0cuse_path_lns\x18\x10 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12?\n\x11use_full_path_lns\x18\x11 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12\x39\n\x0buse_tsp_lns\x18\x12 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12>\n\x10use_inactive_lns\x18\x13 \x01(\x0e\x32$.operations_research.OptionalBoolean\x12T\n&use_global_cheapest_insertion_path_lns\x18\x1b \x01(\x0e\x32$.operations_research.OptionalBoolean\x12S\n%use_local_cheapest_insertion_path_lns\x18\x1c \x01(\x0e\x32$.operations_research.OptionalBoolean\x12l\n>use_relocate_path_global_cheapest_insertion_insert_unperformed\x18! \x01(\x0e\x32$.operations_research.OptionalBoolean\x12_\n1use_global_cheapest_insertion_expensive_chain_lns\x18\x1d \x01(\x0e\x32$.operations_research.OptionalBoolean\x12^\n0use_local_cheapest_insertion_expensive_chain_lns\x18\x1e \x01(\x0e\x32$.operations_research.OptionalBoolean\x12[\n-use_global_cheapest_insertion_close_nodes_lns\x18\x1f \x01(\x0e\x32$.operations_research.OptionalBoolean\x12Z\n,use_local_cheapest_insertion_close_nodes_lns\x18  \x01(\x0e\x32$.operations_research.OptionalBoolean\x1au\n ImprovementSearchLimitParameters\x12$\n\x1cimprovement_rate_coefficient\x18& \x01(\x01\x12+\n#improvement_rate_solutions_distance\x18\' \x01(\x05\"\x92\x01\n\x15PairInsertionStrategy\x12\r\n\tAUTOMATIC\x10\x00\x12\"\n\x1e\x42\x45ST_PICKUP_THEN_BEST_DELIVERY\x10\x01\x12\x1d\n\x19\x42\x45ST_PICKUP_DELIVERY_PAIR\x10\x02\x12\'\n#BEST_PICKUP_DELIVERY_PAIR_MULTITOUR\x10\x03\"\xaa\x03\n\x18InsertionSortingProperty\x12 \n\x1cSORTING_PROPERTY_UNSPECIFIED\x10\x00\x12%\n!SORTING_PROPERTY_ALLOWED_VEHICLES\x10\x01\x12\x1c\n\x18SORTING_PROPERTY_PENALTY\x10\x02\x12\x38\n4SORTING_PROPERTY_PENALTY_OVER_ALLOWED_VEHICLES_RATIO\x10\x03\x12?\n;SORTING_PROPERTY_HIGHEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS\x10\x04\x12>\n:SORTING_PROPERTY_LOWEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS\x10\x05\x12>\n:SORTING_PROPERTY_LOWEST_MIN_ARC_COST_TO_VEHICLE_START_ENDS\x10\x06\x12,\n(SORTING_PROPERTY_HIGHEST_DIMENSION_USAGE\x10\x07\"T\n\x10SchedulingSolver\x12\x14\n\x10SCHEDULING_UNSET\x10\x00\x12\x13\n\x0fSCHEDULING_GLOP\x10\x01\x12\x15\n\x11SCHEDULING_CP_SAT\x10\x02\x42\x39\n7_disable_scheduling_beware_this_may_degrade_performanceJ\x04\x08\x13\x10\x14J\x04\x08\x41\x10\x42\"\xa8\x01\n\x16RoutingModelParameters\x12J\n\x11solver_parameters\x18\x01 \x01(\x0b\x32/.operations_research.ConstraintSolverParameters\x12!\n\x19reduce_vehicle_cost_model\x18\x02 \x01(\x08\x12\x1f\n\x17max_callback_cache_size\x18\x03 \x01(\x05\x42I\n#com.google.ortools.constraintsolverP\x01\xaa\x02\x1fGoogle.OrTools.ConstraintSolverb\x06proto3')
34
35_globals = globals()
36_builder.BuildMessageAndEnumDescriptors(DESCRIPTOR, _globals)
37_builder.BuildTopDescriptorsAndMessages(DESCRIPTOR, 'ortools.constraint_solver.routing_parameters_pb2', _globals)
38if not _descriptor._USE_C_DESCRIPTORS:
39  _globals['DESCRIPTOR']._loaded_options = None
40  _globals['DESCRIPTOR']._serialized_options = b'\n#com.google.ortools.constraintsolverP\001\252\002\037Google.OrTools.ConstraintSolver'
41  _globals['_ROUTINGSEARCHPARAMETERS']._serialized_start=322
42  _globals['_ROUTINGSEARCHPARAMETERS']._serialized_end=7420
43  _globals['_ROUTINGSEARCHPARAMETERS_LOCALSEARCHNEIGHBORHOODOPERATORS']._serialized_start=3788
44  _globals['_ROUTINGSEARCHPARAMETERS_LOCALSEARCHNEIGHBORHOODOPERATORS']._serialized_end=6566
45  _globals['_ROUTINGSEARCHPARAMETERS_IMPROVEMENTSEARCHLIMITPARAMETERS']._serialized_start=6568
46  _globals['_ROUTINGSEARCHPARAMETERS_IMPROVEMENTSEARCHLIMITPARAMETERS']._serialized_end=6685
47  _globals['_ROUTINGSEARCHPARAMETERS_PAIRINSERTIONSTRATEGY']._serialized_start=6688
48  _globals['_ROUTINGSEARCHPARAMETERS_PAIRINSERTIONSTRATEGY']._serialized_end=6834
49  _globals['_ROUTINGSEARCHPARAMETERS_INSERTIONSORTINGPROPERTY']._serialized_start=6837
50  _globals['_ROUTINGSEARCHPARAMETERS_INSERTIONSORTINGPROPERTY']._serialized_end=7263
51  _globals['_ROUTINGSEARCHPARAMETERS_SCHEDULINGSOLVER']._serialized_start=7265
52  _globals['_ROUTINGSEARCHPARAMETERS_SCHEDULINGSOLVER']._serialized_end=7349
53  _globals['_ROUTINGMODELPARAMETERS']._serialized_start=7423
54  _globals['_ROUTINGMODELPARAMETERS']._serialized_end=7591
55# @@protoc_insertion_point(module_scope)
DESCRIPTOR = <google.protobuf.descriptor.FileDescriptor object>
class RoutingSearchParameters(google.protobuf.message.Message):

Abstract base class for protocol messages.

Protocol message classes are almost always generated by the protocol compiler. These generated types subclass Message and implement the methods shown below.

RoutingSearchParameters(**kwargs)
498  def init(self, **kwargs):
499    self._cached_byte_size = 0
500    self._cached_byte_size_dirty = len(kwargs) > 0
501    self._fields = {}
502    # Contains a mapping from oneof field descriptors to the descriptor
503    # of the currently set field in that oneof field.
504    self._oneofs = {}
505
506    # _unknown_fields is () when empty for efficiency, and will be turned into
507    # a list if fields are added.
508    self._unknown_fields = ()
509    self._is_present_in_parent = False
510    self._listener = message_listener_mod.NullMessageListener()
511    self._listener_for_children = _Listener(self)
512    for field_name, field_value in kwargs.items():
513      field = _GetFieldByName(message_descriptor, field_name)
514      if field is None:
515        raise TypeError('%s() got an unexpected keyword argument "%s"' %
516                        (message_descriptor.name, field_name))
517      if field_value is None:
518        # field=None is the same as no field at all.
519        continue
520      if field.label == _FieldDescriptor.LABEL_REPEATED:
521        field_copy = field._default_constructor(self)
522        if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE:  # Composite
523          if _IsMapField(field):
524            if _IsMessageMapField(field):
525              for key in field_value:
526                field_copy[key].MergeFrom(field_value[key])
527            else:
528              field_copy.update(field_value)
529          else:
530            for val in field_value:
531              if isinstance(val, dict):
532                field_copy.add(**val)
533              else:
534                field_copy.add().MergeFrom(val)
535        else:  # Scalar
536          if field.cpp_type == _FieldDescriptor.CPPTYPE_ENUM:
537            field_value = [_GetIntegerEnumValue(field.enum_type, val)
538                           for val in field_value]
539          field_copy.extend(field_value)
540        self._fields[field] = field_copy
541      elif field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE:
542        field_copy = field._default_constructor(self)
543        new_val = None
544        if isinstance(field_value, message_mod.Message):
545          new_val = field_value
546        elif isinstance(field_value, dict):
547          if field.message_type.full_name == _StructFullTypeName:
548            field_copy.Clear()
549            if len(field_value) == 1 and 'fields' in field_value:
550              try:
551                field_copy.update(field_value)
552              except:
553                # Fall back to init normal message field
554                field_copy.Clear()
555                new_val = field.message_type._concrete_class(**field_value)
556            else:
557              field_copy.update(field_value)
558          else:
559            new_val = field.message_type._concrete_class(**field_value)
560        elif hasattr(field_copy, '_internal_assign'):
561          field_copy._internal_assign(field_value)
562        else:
563          raise TypeError(
564              'Message field {0}.{1} must be initialized with a '
565              'dict or instance of same class, got {2}.'.format(
566                  message_descriptor.name,
567                  field_name,
568                  type(field_value).__name__,
569              )
570          )
571
572        if new_val != None:
573          try:
574            field_copy.MergeFrom(new_val)
575          except TypeError:
576            _ReraiseTypeErrorWithFieldName(message_descriptor.name, field_name)
577        self._fields[field] = field_copy
578      else:
579        if field.cpp_type == _FieldDescriptor.CPPTYPE_ENUM:
580          field_value = _GetIntegerEnumValue(field.enum_type, field_value)
581        try:
582          setattr(self, field_name, field_value)
583        except TypeError:
584          _ReraiseTypeErrorWithFieldName(message_descriptor.name, field_name)
DESCRIPTOR = <google.protobuf.descriptor.Descriptor object>
def MergeFrom(self, msg):
1364  def MergeFrom(self, msg):
1365    if not isinstance(msg, cls):
1366      raise TypeError(
1367          'Parameter to MergeFrom() must be instance of same class: '
1368          'expected %s got %s.' % (_FullyQualifiedClassName(cls),
1369                                   _FullyQualifiedClassName(msg.__class__)))
1370
1371    assert msg is not self
1372    self._Modified()
1373
1374    fields = self._fields
1375
1376    for field, value in msg._fields.items():
1377      if field.label == LABEL_REPEATED:
1378        field_value = fields.get(field)
1379        if field_value is None:
1380          # Construct a new object to represent this field.
1381          field_value = field._default_constructor(self)
1382          fields[field] = field_value
1383        field_value.MergeFrom(value)
1384      elif field.cpp_type == CPPTYPE_MESSAGE:
1385        if value._is_present_in_parent:
1386          field_value = fields.get(field)
1387          if field_value is None:
1388            # Construct a new object to represent this field.
1389            field_value = field._default_constructor(self)
1390            fields[field] = field_value
1391          field_value.MergeFrom(value)
1392      else:
1393        self._fields[field] = value
1394        if field.containing_oneof:
1395          self._UpdateOneofState(field)
1396
1397    if msg._unknown_fields:
1398      if not self._unknown_fields:
1399        self._unknown_fields = []
1400      self._unknown_fields.extend(msg._unknown_fields)

Merges the contents of the specified message into current message.

This method merges the contents of the specified message into the current message. Singular fields that are set in the specified message overwrite the corresponding fields in the current message. Repeated fields are appended. Singular sub-messages and groups are recursively merged.

Arguments:
  • other_msg (Message): A message to merge into the current message.
def Clear(self):
1423def _Clear(self):
1424  # Clear fields.
1425  self._fields = {}
1426  self._unknown_fields = ()
1427
1428  self._oneofs = {}
1429  self._Modified()

Clears all data that was set in the message.

def SetInParent(self):
1489  def Modified(self):
1490    """Sets the _cached_byte_size_dirty bit to true,
1491    and propagates this to our listener iff this was a state change.
1492    """
1493
1494    # Note:  Some callers check _cached_byte_size_dirty before calling
1495    #   _Modified() as an extra optimization.  So, if this method is ever
1496    #   changed such that it does stuff even when _cached_byte_size_dirty is
1497    #   already true, the callers need to be updated.
1498    if not self._cached_byte_size_dirty:
1499      self._cached_byte_size_dirty = True
1500      self._listener_for_children.dirty = True
1501      self._is_present_in_parent = True
1502      self._listener.Modified()

Sets the _cached_byte_size_dirty bit to true, and propagates this to our listener iff this was a state change.

def IsInitialized(self, errors=None):
1265  def IsInitialized(self, errors=None):
1266    """Checks if all required fields of a message are set.
1267
1268    Args:
1269      errors:  A list which, if provided, will be populated with the field
1270               paths of all missing required fields.
1271
1272    Returns:
1273      True iff the specified message has all required fields set.
1274    """
1275
1276    # Performance is critical so we avoid HasField() and ListFields().
1277
1278    for field in required_fields:
1279      if (field not in self._fields or
1280          (field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE and
1281           not self._fields[field]._is_present_in_parent)):
1282        if errors is not None:
1283          errors.extend(self.FindInitializationErrors())
1284        return False
1285
1286    for field, value in list(self._fields.items()):  # dict can change size!
1287      if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE:
1288        if field.label == _FieldDescriptor.LABEL_REPEATED:
1289          if (field.message_type._is_map_entry):
1290            continue
1291          for element in value:
1292            if not element.IsInitialized():
1293              if errors is not None:
1294                errors.extend(self.FindInitializationErrors())
1295              return False
1296        elif value._is_present_in_parent and not value.IsInitialized():
1297          if errors is not None:
1298            errors.extend(self.FindInitializationErrors())
1299          return False
1300
1301    return True

Checks if all required fields of a message are set.

Arguments:
  • errors: A list which, if provided, will be populated with the field paths of all missing required fields.
Returns:

True iff the specified message has all required fields set.

def MergeFromString(self, serialized):
1180  def MergeFromString(self, serialized):
1181    serialized = memoryview(serialized)
1182    length = len(serialized)
1183    try:
1184      if self._InternalParse(serialized, 0, length) != length:
1185        # The only reason _InternalParse would return early is if it
1186        # encountered an end-group tag.
1187        raise message_mod.DecodeError('Unexpected end-group tag.')
1188    except (IndexError, TypeError):
1189      # Now ord(buf[p:p+1]) == ord('') gets TypeError.
1190      raise message_mod.DecodeError('Truncated message.')
1191    except struct.error as e:
1192      raise message_mod.DecodeError(e)
1193    return length   # Return this for legacy reasons.

Merges serialized protocol buffer data into this message.

When we find a field in serialized that is already present in this message:

  • If it's a "repeated" field, we append to the end of our list.
  • Else, if it's a scalar, we overwrite our field.
  • Else, (it's a nonrepeated composite), we recursively merge into the existing composite.
Arguments:
  • serialized (bytes): Any object that allows us to call memoryview(serialized) to access a string of bytes using the buffer interface.
Returns:

int: The number of bytes read from serialized. For non-group messages, this will always be len(serialized), but for messages which are actually groups, this will generally be less than len(serialized), since we must stop when we reach an END_GROUP tag. Note that if we do stop because of an END_GROUP tag, the number of bytes returned does not include the bytes for the END_GROUP tag information.

Raises:
  • DecodeError: if the input cannot be parsed.
def SerializeToString(self, **kwargs):
1133  def SerializeToString(self, **kwargs):
1134    # Check if the message has all of its required fields set.
1135    if not self.IsInitialized():
1136      raise message_mod.EncodeError(
1137          'Message %s is missing required fields: %s' % (
1138          self.DESCRIPTOR.full_name, ','.join(self.FindInitializationErrors())))
1139    return self.SerializePartialToString(**kwargs)

Serializes the protocol message to a binary string.

Keyword Args:

deterministic (bool): If true, requests deterministic serialization of the protobuf, with predictable ordering of map keys.

Returns:

A binary string representation of the message if all of the required fields in the message are set (i.e. the message is initialized).

Raises:
def SerializePartialToString(self, **kwargs):
1146  def SerializePartialToString(self, **kwargs):
1147    out = BytesIO()
1148    self._InternalSerialize(out.write, **kwargs)
1149    return out.getvalue()

Serializes the protocol message to a binary string.

This method is similar to SerializeToString but doesn't check if the message is initialized.

Keyword Args:

deterministic (bool): If true, requests deterministic serialization of the protobuf, with predictable ordering of map keys.

Returns:

bytes: A serialized representation of the partial message.

def ListFields(self):
848  def ListFields(self):
849    all_fields = [item for item in self._fields.items() if _IsPresent(item)]
850    all_fields.sort(key = lambda item: item[0].number)
851    return all_fields

Returns a list of (FieldDescriptor, value) tuples for present fields.

A message field is non-empty if HasField() would return true. A singular primitive field is non-empty if HasField() would return true in proto2 or it is non zero in proto3. A repeated field is non-empty if it contains at least one element. The fields are ordered by field number.

Returns:

list[tuple(FieldDescriptor, value)]: field descriptors and values for all fields in the message which are not empty. The values vary by field type.

def HasField(self, field_name):
872  def HasField(self, field_name):
873    try:
874      field = hassable_fields[field_name]
875    except KeyError as exc:
876      raise ValueError('Protocol message %s has no non-repeated field "%s" '
877                       'nor has presence is not available for this field.' % (
878                           message_descriptor.full_name, field_name)) from exc
879
880    if isinstance(field, descriptor_mod.OneofDescriptor):
881      try:
882        return HasField(self, self._oneofs[field].name)
883      except KeyError:
884        return False
885    else:
886      if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE:
887        value = self._fields.get(field)
888        return value is not None and value._is_present_in_parent
889      else:
890        return field in self._fields

Checks if a certain field is set for the message.

For a oneof group, checks if any field inside is set. Note that if the field_name is not defined in the message descriptor, ValueError will be raised.

Arguments:
  • field_name (str): The name of the field to check for presence.
Returns:

bool: Whether a value has been set for the named field.

Raises:
  • ValueError: if the field_name is not a member of this message.
def ClearField(self, field_name):
897  def ClearField(self, field_name):
898    try:
899      field = message_descriptor.fields_by_name[field_name]
900    except KeyError:
901      try:
902        field = message_descriptor.oneofs_by_name[field_name]
903        if field in self._oneofs:
904          field = self._oneofs[field]
905        else:
906          return
907      except KeyError:
908        raise ValueError('Protocol message %s has no "%s" field.' %
909                         (message_descriptor.name, field_name))
910
911    if field in self._fields:
912      # To match the C++ implementation, we need to invalidate iterators
913      # for map fields when ClearField() happens.
914      if hasattr(self._fields[field], 'InvalidateIterators'):
915        self._fields[field].InvalidateIterators()
916
917      # Note:  If the field is a sub-message, its listener will still point
918      #   at us.  That's fine, because the worst than can happen is that it
919      #   will call _Modified() and invalidate our byte size.  Big deal.
920      del self._fields[field]
921
922      if self._oneofs.get(field.containing_oneof, None) is field:
923        del self._oneofs[field.containing_oneof]
924
925    # Always call _Modified() -- even if nothing was changed, this is
926    # a mutating method, and thus calling it should cause the field to become
927    # present in the parent message.
928    self._Modified()

Clears the contents of a given field.

Inside a oneof group, clears the field set. If the name neither refers to a defined field or oneof group, ValueError is raised.

Arguments:
  • field_name (str): The name of the field to check for presence.
Raises:
  • ValueError: if the field_name is not a member of this message.
def WhichOneof(self, oneof_name):
1406  def WhichOneof(self, oneof_name):
1407    """Returns the name of the currently set field inside a oneof, or None."""
1408    try:
1409      field = message_descriptor.oneofs_by_name[oneof_name]
1410    except KeyError:
1411      raise ValueError(
1412          'Protocol message has no oneof "%s" field.' % oneof_name)
1413
1414    nested_field = self._oneofs.get(field, None)
1415    if nested_field is not None and self.HasField(nested_field.name):
1416      return nested_field.name
1417    else:
1418      return None

Returns the name of the currently set field inside a oneof, or None.

def DiscardUnknownFields(self):
1438def _DiscardUnknownFields(self):
1439  self._unknown_fields = []
1440  for field, value in self.ListFields():
1441    if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE:
1442      if _IsMapField(field):
1443        if _IsMessageMapField(field):
1444          for key in value:
1445            value[key].DiscardUnknownFields()
1446      elif field.label == _FieldDescriptor.LABEL_REPEATED:
1447        for sub_message in value:
1448          sub_message.DiscardUnknownFields()
1449      else:
1450        value.DiscardUnknownFields()

Clears all fields in the UnknownFieldSet.

This operation is recursive for nested message.

def ByteSize(self):
1101  def ByteSize(self):
1102    if not self._cached_byte_size_dirty:
1103      return self._cached_byte_size
1104
1105    size = 0
1106    descriptor = self.DESCRIPTOR
1107    if descriptor._is_map_entry:
1108      # Fields of map entry should always be serialized.
1109      key_field = descriptor.fields_by_name['key']
1110      _MaybeAddEncoder(cls, key_field)
1111      size = key_field._sizer(self.key)
1112      value_field = descriptor.fields_by_name['value']
1113      _MaybeAddEncoder(cls, value_field)
1114      size += value_field._sizer(self.value)
1115    else:
1116      for field_descriptor, field_value in self.ListFields():
1117        _MaybeAddEncoder(cls, field_descriptor)
1118        size += field_descriptor._sizer(field_value)
1119      for tag_bytes, value_bytes in self._unknown_fields:
1120        size += len(tag_bytes) + len(value_bytes)
1121
1122    self._cached_byte_size = size
1123    self._cached_byte_size_dirty = False
1124    self._listener_for_children.dirty = False
1125    return size

Returns the serialized size of this message.

Recursively calls ByteSize() on all contained messages.

Returns:

int: The number of bytes required to serialize this message.

def FromString(s):
826  def FromString(s):
827    message = cls()
828    message.MergeFromString(s)
829    return message
PairInsertionStrategy = <google.protobuf.internal.enum_type_wrapper.EnumTypeWrapper object>
AUTOMATIC = 0
BEST_PICKUP_THEN_BEST_DELIVERY = 1
BEST_PICKUP_DELIVERY_PAIR = 2
BEST_PICKUP_DELIVERY_PAIR_MULTITOUR = 3
InsertionSortingProperty = <google.protobuf.internal.enum_type_wrapper.EnumTypeWrapper object>
SORTING_PROPERTY_UNSPECIFIED = 0
SORTING_PROPERTY_ALLOWED_VEHICLES = 1
SORTING_PROPERTY_PENALTY = 2
SORTING_PROPERTY_PENALTY_OVER_ALLOWED_VEHICLES_RATIO = 3
SORTING_PROPERTY_HIGHEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS = 4
SORTING_PROPERTY_LOWEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS = 5
SORTING_PROPERTY_LOWEST_MIN_ARC_COST_TO_VEHICLE_START_ENDS = 6
SORTING_PROPERTY_HIGHEST_DIMENSION_USAGE = 7
SchedulingSolver = <google.protobuf.internal.enum_type_wrapper.EnumTypeWrapper object>
SCHEDULING_UNSET = 0
SCHEDULING_GLOP = 1
SCHEDULING_CP_SAT = 2
FIRST_SOLUTION_STRATEGY_FIELD_NUMBER = 1
first_solution_strategy
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for first_solution_strategy.

USE_UNFILTERED_FIRST_SOLUTION_STRATEGY_FIELD_NUMBER = 2
use_unfiltered_first_solution_strategy
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for use_unfiltered_first_solution_strategy.

SAVINGS_NEIGHBORS_RATIO_FIELD_NUMBER = 14
savings_neighbors_ratio
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for savings_neighbors_ratio.

SAVINGS_MAX_MEMORY_USAGE_BYTES_FIELD_NUMBER = 23
savings_max_memory_usage_bytes
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for savings_max_memory_usage_bytes.

SAVINGS_ADD_REVERSE_ARCS_FIELD_NUMBER = 15
savings_add_reverse_arcs
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for savings_add_reverse_arcs.

SAVINGS_ARC_COEFFICIENT_FIELD_NUMBER = 18
savings_arc_coefficient
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for savings_arc_coefficient.

CHEAPEST_INSERTION_FARTHEST_SEEDS_RATIO_FIELD_NUMBER = 16
cheapest_insertion_farthest_seeds_ratio
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for cheapest_insertion_farthest_seeds_ratio.

CHEAPEST_INSERTION_FIRST_SOLUTION_NEIGHBORS_RATIO_FIELD_NUMBER = 21
cheapest_insertion_first_solution_neighbors_ratio
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for cheapest_insertion_first_solution_neighbors_ratio.

CHEAPEST_INSERTION_FIRST_SOLUTION_MIN_NEIGHBORS_FIELD_NUMBER = 44
cheapest_insertion_first_solution_min_neighbors
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for cheapest_insertion_first_solution_min_neighbors.

CHEAPEST_INSERTION_LS_OPERATOR_NEIGHBORS_RATIO_FIELD_NUMBER = 31
cheapest_insertion_ls_operator_neighbors_ratio
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for cheapest_insertion_ls_operator_neighbors_ratio.

CHEAPEST_INSERTION_LS_OPERATOR_MIN_NEIGHBORS_FIELD_NUMBER = 45
cheapest_insertion_ls_operator_min_neighbors
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for cheapest_insertion_ls_operator_min_neighbors.

CHEAPEST_INSERTION_FIRST_SOLUTION_USE_NEIGHBORS_RATIO_FOR_INITIALIZATION_FIELD_NUMBER = 46
cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization.

CHEAPEST_INSERTION_ADD_UNPERFORMED_ENTRIES_FIELD_NUMBER = 40
cheapest_insertion_add_unperformed_entries
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for cheapest_insertion_add_unperformed_entries.

LOCAL_CHEAPEST_INSERTION_PICKUP_DELIVERY_STRATEGY_FIELD_NUMBER = 49
local_cheapest_insertion_pickup_delivery_strategy
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for local_cheapest_insertion_pickup_delivery_strategy.

LOCAL_CHEAPEST_COST_INSERTION_PICKUP_DELIVERY_STRATEGY_FIELD_NUMBER = 55
local_cheapest_cost_insertion_pickup_delivery_strategy
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for local_cheapest_cost_insertion_pickup_delivery_strategy.

LOCAL_CHEAPEST_INSERTION_SORTING_PROPERTIES_FIELD_NUMBER = 67
local_cheapest_insertion_sorting_properties
668  def getter(self):
669    field_value = self._fields.get(field)
670    if field_value is None:
671      # Construct a new object to represent this field.
672      field_value = field._default_constructor(self)
673
674      # Atomically check if another thread has preempted us and, if not, swap
675      # in the new object we just created.  If someone has preempted us, we
676      # take that object and discard ours.
677      # WARNING:  We are relying on setdefault() being atomic.  This is true
678      #   in CPython but we haven't investigated others.  This warning appears
679      #   in several other locations in this file.
680      field_value = self._fields.setdefault(field, field_value)
681    return field_value

Getter for local_cheapest_insertion_sorting_properties.

CHRISTOFIDES_USE_MINIMUM_MATCHING_FIELD_NUMBER = 30
christofides_use_minimum_matching
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for christofides_use_minimum_matching.

FIRST_SOLUTION_OPTIMIZATION_PERIOD_FIELD_NUMBER = 59
first_solution_optimization_period
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for first_solution_optimization_period.

LOCAL_SEARCH_OPERATORS_FIELD_NUMBER = 3
local_search_operators
767  def getter(self):
768    field_value = self._fields.get(field)
769    if field_value is None:
770      # Construct a new object to represent this field.
771      field_value = field._default_constructor(self)
772
773      # Atomically check if another thread has preempted us and, if not, swap
774      # in the new object we just created.  If someone has preempted us, we
775      # take that object and discard ours.
776      # WARNING:  We are relying on setdefault() being atomic.  This is true
777      #   in CPython but we haven't investigated others.  This warning appears
778      #   in several other locations in this file.
779      field_value = self._fields.setdefault(field, field_value)
780    return field_value

Getter for local_search_operators.

LS_OPERATOR_NEIGHBORS_RATIO_FIELD_NUMBER = 53
ls_operator_neighbors_ratio
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for ls_operator_neighbors_ratio.

LS_OPERATOR_MIN_NEIGHBORS_FIELD_NUMBER = 54
ls_operator_min_neighbors
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for ls_operator_min_neighbors.

USE_MULTI_ARMED_BANDIT_CONCATENATE_OPERATORS_FIELD_NUMBER = 41
use_multi_armed_bandit_concatenate_operators
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for use_multi_armed_bandit_concatenate_operators.

MULTI_ARMED_BANDIT_COMPOUND_OPERATOR_MEMORY_COEFFICIENT_FIELD_NUMBER = 42
multi_armed_bandit_compound_operator_memory_coefficient
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for multi_armed_bandit_compound_operator_memory_coefficient.

MULTI_ARMED_BANDIT_COMPOUND_OPERATOR_EXPLORATION_COEFFICIENT_FIELD_NUMBER = 43
multi_armed_bandit_compound_operator_exploration_coefficient
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for multi_armed_bandit_compound_operator_exploration_coefficient.

MAX_SWAP_ACTIVE_CHAIN_SIZE_FIELD_NUMBER = 66
max_swap_active_chain_size
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for max_swap_active_chain_size.

RELOCATE_EXPENSIVE_CHAIN_NUM_ARCS_TO_CONSIDER_FIELD_NUMBER = 20
relocate_expensive_chain_num_arcs_to_consider
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for relocate_expensive_chain_num_arcs_to_consider.

HEURISTIC_EXPENSIVE_CHAIN_LNS_NUM_ARCS_TO_CONSIDER_FIELD_NUMBER = 32
heuristic_expensive_chain_lns_num_arcs_to_consider
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for heuristic_expensive_chain_lns_num_arcs_to_consider.

HEURISTIC_CLOSE_NODES_LNS_NUM_NODES_FIELD_NUMBER = 35
heuristic_close_nodes_lns_num_nodes
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for heuristic_close_nodes_lns_num_nodes.

LOCAL_SEARCH_METAHEURISTIC_FIELD_NUMBER = 4
local_search_metaheuristic
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for local_search_metaheuristic.

LOCAL_SEARCH_METAHEURISTICS_FIELD_NUMBER = 63
local_search_metaheuristics
668  def getter(self):
669    field_value = self._fields.get(field)
670    if field_value is None:
671      # Construct a new object to represent this field.
672      field_value = field._default_constructor(self)
673
674      # Atomically check if another thread has preempted us and, if not, swap
675      # in the new object we just created.  If someone has preempted us, we
676      # take that object and discard ours.
677      # WARNING:  We are relying on setdefault() being atomic.  This is true
678      #   in CPython but we haven't investigated others.  This warning appears
679      #   in several other locations in this file.
680      field_value = self._fields.setdefault(field, field_value)
681    return field_value

Getter for local_search_metaheuristics.

NUM_MAX_LOCAL_OPTIMA_BEFORE_METAHEURISTIC_SWITCH_FIELD_NUMBER = 64
num_max_local_optima_before_metaheuristic_switch
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for num_max_local_optima_before_metaheuristic_switch.

GUIDED_LOCAL_SEARCH_LAMBDA_COEFFICIENT_FIELD_NUMBER = 5
guided_local_search_lambda_coefficient
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for guided_local_search_lambda_coefficient.

GUIDED_LOCAL_SEARCH_RESET_PENALTIES_ON_NEW_BEST_SOLUTION_FIELD_NUMBER = 51
guided_local_search_reset_penalties_on_new_best_solution
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for guided_local_search_reset_penalties_on_new_best_solution.

GUIDED_LOCAL_SEARCH_PENALIZE_WITH_VEHICLE_CLASSES_FIELD_NUMBER = 61
guided_local_search_penalize_with_vehicle_classes
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for guided_local_search_penalize_with_vehicle_classes.

USE_GUIDED_LOCAL_SEARCH_PENALTIES_IN_LOCAL_SEARCH_OPERATORS_FIELD_NUMBER = 62
use_guided_local_search_penalties_in_local_search_operators
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for use_guided_local_search_penalties_in_local_search_operators.

USE_DEPTH_FIRST_SEARCH_FIELD_NUMBER = 6
USE_CP_FIELD_NUMBER = 28
use_cp
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for use_cp.

USE_CP_SAT_FIELD_NUMBER = 27
use_cp_sat
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for use_cp_sat.

USE_GENERALIZED_CP_SAT_FIELD_NUMBER = 47
use_generalized_cp_sat
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for use_generalized_cp_sat.

SAT_PARAMETERS_FIELD_NUMBER = 48
sat_parameters
767  def getter(self):
768    field_value = self._fields.get(field)
769    if field_value is None:
770      # Construct a new object to represent this field.
771      field_value = field._default_constructor(self)
772
773      # Atomically check if another thread has preempted us and, if not, swap
774      # in the new object we just created.  If someone has preempted us, we
775      # take that object and discard ours.
776      # WARNING:  We are relying on setdefault() being atomic.  This is true
777      #   in CPython but we haven't investigated others.  This warning appears
778      #   in several other locations in this file.
779      field_value = self._fields.setdefault(field, field_value)
780    return field_value

Getter for sat_parameters.

REPORT_INTERMEDIATE_CP_SAT_SOLUTIONS_FIELD_NUMBER = 56
report_intermediate_cp_sat_solutions
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for report_intermediate_cp_sat_solutions.

FALLBACK_TO_CP_SAT_SIZE_THRESHOLD_FIELD_NUMBER = 52
fallback_to_cp_sat_size_threshold
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for fallback_to_cp_sat_size_threshold.

CONTINUOUS_SCHEDULING_SOLVER_FIELD_NUMBER = 33
continuous_scheduling_solver
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for continuous_scheduling_solver.

MIXED_INTEGER_SCHEDULING_SOLVER_FIELD_NUMBER = 34
mixed_integer_scheduling_solver
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for mixed_integer_scheduling_solver.

DISABLE_SCHEDULING_BEWARE_THIS_MAY_DEGRADE_PERFORMANCE_FIELD_NUMBER = 50
disable_scheduling_beware_this_may_degrade_performance
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for disable_scheduling_beware_this_may_degrade_performance.

OPTIMIZATION_STEP_FIELD_NUMBER = 7
optimization_step
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for optimization_step.

NUMBER_OF_SOLUTIONS_TO_COLLECT_FIELD_NUMBER = 17
number_of_solutions_to_collect
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for number_of_solutions_to_collect.

SOLUTION_LIMIT_FIELD_NUMBER = 8
solution_limit
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for solution_limit.

TIME_LIMIT_FIELD_NUMBER = 9
time_limit
767  def getter(self):
768    field_value = self._fields.get(field)
769    if field_value is None:
770      # Construct a new object to represent this field.
771      field_value = field._default_constructor(self)
772
773      # Atomically check if another thread has preempted us and, if not, swap
774      # in the new object we just created.  If someone has preempted us, we
775      # take that object and discard ours.
776      # WARNING:  We are relying on setdefault() being atomic.  This is true
777      #   in CPython but we haven't investigated others.  This warning appears
778      #   in several other locations in this file.
779      field_value = self._fields.setdefault(field, field_value)
780    return field_value

Getter for time_limit.

LNS_TIME_LIMIT_FIELD_NUMBER = 10
lns_time_limit
767  def getter(self):
768    field_value = self._fields.get(field)
769    if field_value is None:
770      # Construct a new object to represent this field.
771      field_value = field._default_constructor(self)
772
773      # Atomically check if another thread has preempted us and, if not, swap
774      # in the new object we just created.  If someone has preempted us, we
775      # take that object and discard ours.
776      # WARNING:  We are relying on setdefault() being atomic.  This is true
777      #   in CPython but we haven't investigated others.  This warning appears
778      #   in several other locations in this file.
779      field_value = self._fields.setdefault(field, field_value)
780    return field_value

Getter for lns_time_limit.

SECONDARY_LS_TIME_LIMIT_RATIO_FIELD_NUMBER = 57
secondary_ls_time_limit_ratio
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for secondary_ls_time_limit_ratio.

IMPROVEMENT_LIMIT_PARAMETERS_FIELD_NUMBER = 37
improvement_limit_parameters
767  def getter(self):
768    field_value = self._fields.get(field)
769    if field_value is None:
770      # Construct a new object to represent this field.
771      field_value = field._default_constructor(self)
772
773      # Atomically check if another thread has preempted us and, if not, swap
774      # in the new object we just created.  If someone has preempted us, we
775      # take that object and discard ours.
776      # WARNING:  We are relying on setdefault() being atomic.  This is true
777      #   in CPython but we haven't investigated others.  This warning appears
778      #   in several other locations in this file.
779      field_value = self._fields.setdefault(field, field_value)
780    return field_value

Getter for improvement_limit_parameters.

USE_FULL_PROPAGATION_FIELD_NUMBER = 11
use_full_propagation
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for use_full_propagation.

LOG_SEARCH_FIELD_NUMBER = 13
LOG_COST_SCALING_FACTOR_FIELD_NUMBER = 22
log_cost_scaling_factor
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for log_cost_scaling_factor.

LOG_COST_OFFSET_FIELD_NUMBER = 29
log_cost_offset
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for log_cost_offset.

LOG_TAG_FIELD_NUMBER = 36
log_tag
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for log_tag.

USE_ITERATED_LOCAL_SEARCH_FIELD_NUMBER = 58
ITERATED_LOCAL_SEARCH_PARAMETERS_FIELD_NUMBER = 60
iterated_local_search_parameters
767  def getter(self):
768    field_value = self._fields.get(field)
769    if field_value is None:
770      # Construct a new object to represent this field.
771      field_value = field._default_constructor(self)
772
773      # Atomically check if another thread has preempted us and, if not, swap
774      # in the new object we just created.  If someone has preempted us, we
775      # take that object and discard ours.
776      # WARNING:  We are relying on setdefault() being atomic.  This is true
777      #   in CPython but we haven't investigated others.  This warning appears
778      #   in several other locations in this file.
779      field_value = self._fields.setdefault(field, field_value)
780    return field_value

Getter for iterated_local_search_parameters.

def FindInitializationErrors(self):
1305  def FindInitializationErrors(self):
1306    """Finds required fields which are not initialized.
1307
1308    Returns:
1309      A list of strings.  Each string is a path to an uninitialized field from
1310      the top-level message, e.g. "foo.bar[5].baz".
1311    """
1312
1313    errors = []  # simplify things
1314
1315    for field in required_fields:
1316      if not self.HasField(field.name):
1317        errors.append(field.name)
1318
1319    for field, value in self.ListFields():
1320      if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE:
1321        if field.is_extension:
1322          name = '(%s)' % field.full_name
1323        else:
1324          name = field.name
1325
1326        if _IsMapField(field):
1327          if _IsMessageMapField(field):
1328            for key in value:
1329              element = value[key]
1330              prefix = '%s[%s].' % (name, key)
1331              sub_errors = element.FindInitializationErrors()
1332              errors += [prefix + error for error in sub_errors]
1333          else:
1334            # ScalarMaps can't have any initialization errors.
1335            pass
1336        elif field.label == _FieldDescriptor.LABEL_REPEATED:
1337          for i in range(len(value)):
1338            element = value[i]
1339            prefix = '%s[%d].' % (name, i)
1340            sub_errors = element.FindInitializationErrors()
1341            errors += [prefix + error for error in sub_errors]
1342        else:
1343          prefix = name + '.'
1344          sub_errors = value.FindInitializationErrors()
1345          errors += [prefix + error for error in sub_errors]
1346
1347    return errors

Finds required fields which are not initialized.

Returns:

A list of strings. Each string is a path to an uninitialized field from the top-level message, e.g. "foo.bar[5].baz".

class RoutingSearchParameters.LocalSearchNeighborhoodOperators(google.protobuf.message.Message):

Abstract base class for protocol messages.

Protocol message classes are almost always generated by the protocol compiler. These generated types subclass Message and implement the methods shown below.

Inherited Members
LocalSearchNeighborhoodOperators
LocalSearchNeighborhoodOperators
DESCRIPTOR
MergeFrom
Clear
SetInParent
IsInitialized
MergeFromString
SerializeToString
SerializePartialToString
ListFields
HasField
ClearField
WhichOneof
DiscardUnknownFields
ByteSize
FromString
USE_RELOCATE_FIELD_NUMBER
use_relocate
USE_RELOCATE_PAIR_FIELD_NUMBER
use_relocate_pair
USE_LIGHT_RELOCATE_PAIR_FIELD_NUMBER
use_light_relocate_pair
USE_RELOCATE_NEIGHBORS_FIELD_NUMBER
use_relocate_neighbors
USE_RELOCATE_SUBTRIP_FIELD_NUMBER
use_relocate_subtrip
USE_EXCHANGE_FIELD_NUMBER
use_exchange
USE_EXCHANGE_PAIR_FIELD_NUMBER
use_exchange_pair
USE_EXCHANGE_SUBTRIP_FIELD_NUMBER
use_exchange_subtrip
USE_CROSS_FIELD_NUMBER
use_cross
USE_CROSS_EXCHANGE_FIELD_NUMBER
use_cross_exchange
USE_RELOCATE_EXPENSIVE_CHAIN_FIELD_NUMBER
use_relocate_expensive_chain
USE_TWO_OPT_FIELD_NUMBER
use_two_opt
USE_OR_OPT_FIELD_NUMBER
use_or_opt
USE_LIN_KERNIGHAN_FIELD_NUMBER
use_lin_kernighan
USE_TSP_OPT_FIELD_NUMBER
use_tsp_opt
USE_MAKE_ACTIVE_FIELD_NUMBER
use_make_active
USE_RELOCATE_AND_MAKE_ACTIVE_FIELD_NUMBER
use_relocate_and_make_active
USE_EXCHANGE_AND_MAKE_ACTIVE_FIELD_NUMBER
use_exchange_and_make_active
USE_EXCHANGE_PATH_START_ENDS_AND_MAKE_ACTIVE_FIELD_NUMBER
use_exchange_path_start_ends_and_make_active
USE_MAKE_INACTIVE_FIELD_NUMBER
use_make_inactive
USE_MAKE_CHAIN_INACTIVE_FIELD_NUMBER
use_make_chain_inactive
USE_SWAP_ACTIVE_FIELD_NUMBER
use_swap_active
USE_SWAP_ACTIVE_CHAIN_FIELD_NUMBER
use_swap_active_chain
USE_EXTENDED_SWAP_ACTIVE_FIELD_NUMBER
use_extended_swap_active
USE_SHORTEST_PATH_SWAP_ACTIVE_FIELD_NUMBER
use_shortest_path_swap_active
USE_SHORTEST_PATH_TWO_OPT_FIELD_NUMBER
use_shortest_path_two_opt
USE_NODE_PAIR_SWAP_ACTIVE_FIELD_NUMBER
use_node_pair_swap_active
USE_PATH_LNS_FIELD_NUMBER
use_path_lns
USE_FULL_PATH_LNS_FIELD_NUMBER
use_full_path_lns
USE_TSP_LNS_FIELD_NUMBER
use_tsp_lns
USE_INACTIVE_LNS_FIELD_NUMBER
use_inactive_lns
USE_GLOBAL_CHEAPEST_INSERTION_PATH_LNS_FIELD_NUMBER
use_global_cheapest_insertion_path_lns
USE_LOCAL_CHEAPEST_INSERTION_PATH_LNS_FIELD_NUMBER
use_local_cheapest_insertion_path_lns
USE_RELOCATE_PATH_GLOBAL_CHEAPEST_INSERTION_INSERT_UNPERFORMED_FIELD_NUMBER
use_relocate_path_global_cheapest_insertion_insert_unperformed
USE_GLOBAL_CHEAPEST_INSERTION_EXPENSIVE_CHAIN_LNS_FIELD_NUMBER
use_global_cheapest_insertion_expensive_chain_lns
USE_LOCAL_CHEAPEST_INSERTION_EXPENSIVE_CHAIN_LNS_FIELD_NUMBER
use_local_cheapest_insertion_expensive_chain_lns
USE_GLOBAL_CHEAPEST_INSERTION_CLOSE_NODES_LNS_FIELD_NUMBER
use_global_cheapest_insertion_close_nodes_lns
USE_LOCAL_CHEAPEST_INSERTION_CLOSE_NODES_LNS_FIELD_NUMBER
use_local_cheapest_insertion_close_nodes_lns
FindInitializationErrors
class RoutingSearchParameters.ImprovementSearchLimitParameters(google.protobuf.message.Message):

Abstract base class for protocol messages.

Protocol message classes are almost always generated by the protocol compiler. These generated types subclass Message and implement the methods shown below.

class RoutingModelParameters(google.protobuf.message.Message):

Abstract base class for protocol messages.

Protocol message classes are almost always generated by the protocol compiler. These generated types subclass Message and implement the methods shown below.

RoutingModelParameters(**kwargs)
498  def init(self, **kwargs):
499    self._cached_byte_size = 0
500    self._cached_byte_size_dirty = len(kwargs) > 0
501    self._fields = {}
502    # Contains a mapping from oneof field descriptors to the descriptor
503    # of the currently set field in that oneof field.
504    self._oneofs = {}
505
506    # _unknown_fields is () when empty for efficiency, and will be turned into
507    # a list if fields are added.
508    self._unknown_fields = ()
509    self._is_present_in_parent = False
510    self._listener = message_listener_mod.NullMessageListener()
511    self._listener_for_children = _Listener(self)
512    for field_name, field_value in kwargs.items():
513      field = _GetFieldByName(message_descriptor, field_name)
514      if field is None:
515        raise TypeError('%s() got an unexpected keyword argument "%s"' %
516                        (message_descriptor.name, field_name))
517      if field_value is None:
518        # field=None is the same as no field at all.
519        continue
520      if field.label == _FieldDescriptor.LABEL_REPEATED:
521        field_copy = field._default_constructor(self)
522        if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE:  # Composite
523          if _IsMapField(field):
524            if _IsMessageMapField(field):
525              for key in field_value:
526                field_copy[key].MergeFrom(field_value[key])
527            else:
528              field_copy.update(field_value)
529          else:
530            for val in field_value:
531              if isinstance(val, dict):
532                field_copy.add(**val)
533              else:
534                field_copy.add().MergeFrom(val)
535        else:  # Scalar
536          if field.cpp_type == _FieldDescriptor.CPPTYPE_ENUM:
537            field_value = [_GetIntegerEnumValue(field.enum_type, val)
538                           for val in field_value]
539          field_copy.extend(field_value)
540        self._fields[field] = field_copy
541      elif field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE:
542        field_copy = field._default_constructor(self)
543        new_val = None
544        if isinstance(field_value, message_mod.Message):
545          new_val = field_value
546        elif isinstance(field_value, dict):
547          if field.message_type.full_name == _StructFullTypeName:
548            field_copy.Clear()
549            if len(field_value) == 1 and 'fields' in field_value:
550              try:
551                field_copy.update(field_value)
552              except:
553                # Fall back to init normal message field
554                field_copy.Clear()
555                new_val = field.message_type._concrete_class(**field_value)
556            else:
557              field_copy.update(field_value)
558          else:
559            new_val = field.message_type._concrete_class(**field_value)
560        elif hasattr(field_copy, '_internal_assign'):
561          field_copy._internal_assign(field_value)
562        else:
563          raise TypeError(
564              'Message field {0}.{1} must be initialized with a '
565              'dict or instance of same class, got {2}.'.format(
566                  message_descriptor.name,
567                  field_name,
568                  type(field_value).__name__,
569              )
570          )
571
572        if new_val != None:
573          try:
574            field_copy.MergeFrom(new_val)
575          except TypeError:
576            _ReraiseTypeErrorWithFieldName(message_descriptor.name, field_name)
577        self._fields[field] = field_copy
578      else:
579        if field.cpp_type == _FieldDescriptor.CPPTYPE_ENUM:
580          field_value = _GetIntegerEnumValue(field.enum_type, field_value)
581        try:
582          setattr(self, field_name, field_value)
583        except TypeError:
584          _ReraiseTypeErrorWithFieldName(message_descriptor.name, field_name)
DESCRIPTOR = <google.protobuf.descriptor.Descriptor object>
def MergeFrom(self, msg):
1364  def MergeFrom(self, msg):
1365    if not isinstance(msg, cls):
1366      raise TypeError(
1367          'Parameter to MergeFrom() must be instance of same class: '
1368          'expected %s got %s.' % (_FullyQualifiedClassName(cls),
1369                                   _FullyQualifiedClassName(msg.__class__)))
1370
1371    assert msg is not self
1372    self._Modified()
1373
1374    fields = self._fields
1375
1376    for field, value in msg._fields.items():
1377      if field.label == LABEL_REPEATED:
1378        field_value = fields.get(field)
1379        if field_value is None:
1380          # Construct a new object to represent this field.
1381          field_value = field._default_constructor(self)
1382          fields[field] = field_value
1383        field_value.MergeFrom(value)
1384      elif field.cpp_type == CPPTYPE_MESSAGE:
1385        if value._is_present_in_parent:
1386          field_value = fields.get(field)
1387          if field_value is None:
1388            # Construct a new object to represent this field.
1389            field_value = field._default_constructor(self)
1390            fields[field] = field_value
1391          field_value.MergeFrom(value)
1392      else:
1393        self._fields[field] = value
1394        if field.containing_oneof:
1395          self._UpdateOneofState(field)
1396
1397    if msg._unknown_fields:
1398      if not self._unknown_fields:
1399        self._unknown_fields = []
1400      self._unknown_fields.extend(msg._unknown_fields)

Merges the contents of the specified message into current message.

This method merges the contents of the specified message into the current message. Singular fields that are set in the specified message overwrite the corresponding fields in the current message. Repeated fields are appended. Singular sub-messages and groups are recursively merged.

Arguments:
  • other_msg (Message): A message to merge into the current message.
def Clear(self):
1423def _Clear(self):
1424  # Clear fields.
1425  self._fields = {}
1426  self._unknown_fields = ()
1427
1428  self._oneofs = {}
1429  self._Modified()

Clears all data that was set in the message.

def SetInParent(self):
1489  def Modified(self):
1490    """Sets the _cached_byte_size_dirty bit to true,
1491    and propagates this to our listener iff this was a state change.
1492    """
1493
1494    # Note:  Some callers check _cached_byte_size_dirty before calling
1495    #   _Modified() as an extra optimization.  So, if this method is ever
1496    #   changed such that it does stuff even when _cached_byte_size_dirty is
1497    #   already true, the callers need to be updated.
1498    if not self._cached_byte_size_dirty:
1499      self._cached_byte_size_dirty = True
1500      self._listener_for_children.dirty = True
1501      self._is_present_in_parent = True
1502      self._listener.Modified()

Sets the _cached_byte_size_dirty bit to true, and propagates this to our listener iff this was a state change.

def IsInitialized(self, errors=None):
1265  def IsInitialized(self, errors=None):
1266    """Checks if all required fields of a message are set.
1267
1268    Args:
1269      errors:  A list which, if provided, will be populated with the field
1270               paths of all missing required fields.
1271
1272    Returns:
1273      True iff the specified message has all required fields set.
1274    """
1275
1276    # Performance is critical so we avoid HasField() and ListFields().
1277
1278    for field in required_fields:
1279      if (field not in self._fields or
1280          (field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE and
1281           not self._fields[field]._is_present_in_parent)):
1282        if errors is not None:
1283          errors.extend(self.FindInitializationErrors())
1284        return False
1285
1286    for field, value in list(self._fields.items()):  # dict can change size!
1287      if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE:
1288        if field.label == _FieldDescriptor.LABEL_REPEATED:
1289          if (field.message_type._is_map_entry):
1290            continue
1291          for element in value:
1292            if not element.IsInitialized():
1293              if errors is not None:
1294                errors.extend(self.FindInitializationErrors())
1295              return False
1296        elif value._is_present_in_parent and not value.IsInitialized():
1297          if errors is not None:
1298            errors.extend(self.FindInitializationErrors())
1299          return False
1300
1301    return True

Checks if all required fields of a message are set.

Arguments:
  • errors: A list which, if provided, will be populated with the field paths of all missing required fields.
Returns:

True iff the specified message has all required fields set.

def MergeFromString(self, serialized):
1180  def MergeFromString(self, serialized):
1181    serialized = memoryview(serialized)
1182    length = len(serialized)
1183    try:
1184      if self._InternalParse(serialized, 0, length) != length:
1185        # The only reason _InternalParse would return early is if it
1186        # encountered an end-group tag.
1187        raise message_mod.DecodeError('Unexpected end-group tag.')
1188    except (IndexError, TypeError):
1189      # Now ord(buf[p:p+1]) == ord('') gets TypeError.
1190      raise message_mod.DecodeError('Truncated message.')
1191    except struct.error as e:
1192      raise message_mod.DecodeError(e)
1193    return length   # Return this for legacy reasons.

Merges serialized protocol buffer data into this message.

When we find a field in serialized that is already present in this message:

  • If it's a "repeated" field, we append to the end of our list.
  • Else, if it's a scalar, we overwrite our field.
  • Else, (it's a nonrepeated composite), we recursively merge into the existing composite.
Arguments:
  • serialized (bytes): Any object that allows us to call memoryview(serialized) to access a string of bytes using the buffer interface.
Returns:

int: The number of bytes read from serialized. For non-group messages, this will always be len(serialized), but for messages which are actually groups, this will generally be less than len(serialized), since we must stop when we reach an END_GROUP tag. Note that if we do stop because of an END_GROUP tag, the number of bytes returned does not include the bytes for the END_GROUP tag information.

Raises:
  • DecodeError: if the input cannot be parsed.
def SerializeToString(self, **kwargs):
1133  def SerializeToString(self, **kwargs):
1134    # Check if the message has all of its required fields set.
1135    if not self.IsInitialized():
1136      raise message_mod.EncodeError(
1137          'Message %s is missing required fields: %s' % (
1138          self.DESCRIPTOR.full_name, ','.join(self.FindInitializationErrors())))
1139    return self.SerializePartialToString(**kwargs)

Serializes the protocol message to a binary string.

Keyword Args:

deterministic (bool): If true, requests deterministic serialization of the protobuf, with predictable ordering of map keys.

Returns:

A binary string representation of the message if all of the required fields in the message are set (i.e. the message is initialized).

Raises:
def SerializePartialToString(self, **kwargs):
1146  def SerializePartialToString(self, **kwargs):
1147    out = BytesIO()
1148    self._InternalSerialize(out.write, **kwargs)
1149    return out.getvalue()

Serializes the protocol message to a binary string.

This method is similar to SerializeToString but doesn't check if the message is initialized.

Keyword Args:

deterministic (bool): If true, requests deterministic serialization of the protobuf, with predictable ordering of map keys.

Returns:

bytes: A serialized representation of the partial message.

def ListFields(self):
848  def ListFields(self):
849    all_fields = [item for item in self._fields.items() if _IsPresent(item)]
850    all_fields.sort(key = lambda item: item[0].number)
851    return all_fields

Returns a list of (FieldDescriptor, value) tuples for present fields.

A message field is non-empty if HasField() would return true. A singular primitive field is non-empty if HasField() would return true in proto2 or it is non zero in proto3. A repeated field is non-empty if it contains at least one element. The fields are ordered by field number.

Returns:

list[tuple(FieldDescriptor, value)]: field descriptors and values for all fields in the message which are not empty. The values vary by field type.

def HasField(self, field_name):
872  def HasField(self, field_name):
873    try:
874      field = hassable_fields[field_name]
875    except KeyError as exc:
876      raise ValueError('Protocol message %s has no non-repeated field "%s" '
877                       'nor has presence is not available for this field.' % (
878                           message_descriptor.full_name, field_name)) from exc
879
880    if isinstance(field, descriptor_mod.OneofDescriptor):
881      try:
882        return HasField(self, self._oneofs[field].name)
883      except KeyError:
884        return False
885    else:
886      if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE:
887        value = self._fields.get(field)
888        return value is not None and value._is_present_in_parent
889      else:
890        return field in self._fields

Checks if a certain field is set for the message.

For a oneof group, checks if any field inside is set. Note that if the field_name is not defined in the message descriptor, ValueError will be raised.

Arguments:
  • field_name (str): The name of the field to check for presence.
Returns:

bool: Whether a value has been set for the named field.

Raises:
  • ValueError: if the field_name is not a member of this message.
def ClearField(self, field_name):
897  def ClearField(self, field_name):
898    try:
899      field = message_descriptor.fields_by_name[field_name]
900    except KeyError:
901      try:
902        field = message_descriptor.oneofs_by_name[field_name]
903        if field in self._oneofs:
904          field = self._oneofs[field]
905        else:
906          return
907      except KeyError:
908        raise ValueError('Protocol message %s has no "%s" field.' %
909                         (message_descriptor.name, field_name))
910
911    if field in self._fields:
912      # To match the C++ implementation, we need to invalidate iterators
913      # for map fields when ClearField() happens.
914      if hasattr(self._fields[field], 'InvalidateIterators'):
915        self._fields[field].InvalidateIterators()
916
917      # Note:  If the field is a sub-message, its listener will still point
918      #   at us.  That's fine, because the worst than can happen is that it
919      #   will call _Modified() and invalidate our byte size.  Big deal.
920      del self._fields[field]
921
922      if self._oneofs.get(field.containing_oneof, None) is field:
923        del self._oneofs[field.containing_oneof]
924
925    # Always call _Modified() -- even if nothing was changed, this is
926    # a mutating method, and thus calling it should cause the field to become
927    # present in the parent message.
928    self._Modified()

Clears the contents of a given field.

Inside a oneof group, clears the field set. If the name neither refers to a defined field or oneof group, ValueError is raised.

Arguments:
  • field_name (str): The name of the field to check for presence.
Raises:
  • ValueError: if the field_name is not a member of this message.
def WhichOneof(self, oneof_name):
1406  def WhichOneof(self, oneof_name):
1407    """Returns the name of the currently set field inside a oneof, or None."""
1408    try:
1409      field = message_descriptor.oneofs_by_name[oneof_name]
1410    except KeyError:
1411      raise ValueError(
1412          'Protocol message has no oneof "%s" field.' % oneof_name)
1413
1414    nested_field = self._oneofs.get(field, None)
1415    if nested_field is not None and self.HasField(nested_field.name):
1416      return nested_field.name
1417    else:
1418      return None

Returns the name of the currently set field inside a oneof, or None.

def DiscardUnknownFields(self):
1438def _DiscardUnknownFields(self):
1439  self._unknown_fields = []
1440  for field, value in self.ListFields():
1441    if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE:
1442      if _IsMapField(field):
1443        if _IsMessageMapField(field):
1444          for key in value:
1445            value[key].DiscardUnknownFields()
1446      elif field.label == _FieldDescriptor.LABEL_REPEATED:
1447        for sub_message in value:
1448          sub_message.DiscardUnknownFields()
1449      else:
1450        value.DiscardUnknownFields()

Clears all fields in the UnknownFieldSet.

This operation is recursive for nested message.

def ByteSize(self):
1101  def ByteSize(self):
1102    if not self._cached_byte_size_dirty:
1103      return self._cached_byte_size
1104
1105    size = 0
1106    descriptor = self.DESCRIPTOR
1107    if descriptor._is_map_entry:
1108      # Fields of map entry should always be serialized.
1109      key_field = descriptor.fields_by_name['key']
1110      _MaybeAddEncoder(cls, key_field)
1111      size = key_field._sizer(self.key)
1112      value_field = descriptor.fields_by_name['value']
1113      _MaybeAddEncoder(cls, value_field)
1114      size += value_field._sizer(self.value)
1115    else:
1116      for field_descriptor, field_value in self.ListFields():
1117        _MaybeAddEncoder(cls, field_descriptor)
1118        size += field_descriptor._sizer(field_value)
1119      for tag_bytes, value_bytes in self._unknown_fields:
1120        size += len(tag_bytes) + len(value_bytes)
1121
1122    self._cached_byte_size = size
1123    self._cached_byte_size_dirty = False
1124    self._listener_for_children.dirty = False
1125    return size

Returns the serialized size of this message.

Recursively calls ByteSize() on all contained messages.

Returns:

int: The number of bytes required to serialize this message.

def FromString(s):
826  def FromString(s):
827    message = cls()
828    message.MergeFromString(s)
829    return message
SOLVER_PARAMETERS_FIELD_NUMBER = 1
solver_parameters
767  def getter(self):
768    field_value = self._fields.get(field)
769    if field_value is None:
770      # Construct a new object to represent this field.
771      field_value = field._default_constructor(self)
772
773      # Atomically check if another thread has preempted us and, if not, swap
774      # in the new object we just created.  If someone has preempted us, we
775      # take that object and discard ours.
776      # WARNING:  We are relying on setdefault() being atomic.  This is true
777      #   in CPython but we haven't investigated others.  This warning appears
778      #   in several other locations in this file.
779      field_value = self._fields.setdefault(field, field_value)
780    return field_value

Getter for solver_parameters.

REDUCE_VEHICLE_COST_MODEL_FIELD_NUMBER = 2
reduce_vehicle_cost_model
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for reduce_vehicle_cost_model.

MAX_CALLBACK_CACHE_SIZE_FIELD_NUMBER = 3
max_callback_cache_size
711  def getter(self):
712    # TODO: This may be broken since there may not be
713    # default_value.  Combine with has_default_value somehow.
714    return self._fields.get(field, default_value)

Getter for max_callback_cache_size.

def FindInitializationErrors(self):
1305  def FindInitializationErrors(self):
1306    """Finds required fields which are not initialized.
1307
1308    Returns:
1309      A list of strings.  Each string is a path to an uninitialized field from
1310      the top-level message, e.g. "foo.bar[5].baz".
1311    """
1312
1313    errors = []  # simplify things
1314
1315    for field in required_fields:
1316      if not self.HasField(field.name):
1317        errors.append(field.name)
1318
1319    for field, value in self.ListFields():
1320      if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE:
1321        if field.is_extension:
1322          name = '(%s)' % field.full_name
1323        else:
1324          name = field.name
1325
1326        if _IsMapField(field):
1327          if _IsMessageMapField(field):
1328            for key in value:
1329              element = value[key]
1330              prefix = '%s[%s].' % (name, key)
1331              sub_errors = element.FindInitializationErrors()
1332              errors += [prefix + error for error in sub_errors]
1333          else:
1334            # ScalarMaps can't have any initialization errors.
1335            pass
1336        elif field.label == _FieldDescriptor.LABEL_REPEATED:
1337          for i in range(len(value)):
1338            element = value[i]
1339            prefix = '%s[%d].' % (name, i)
1340            sub_errors = element.FindInitializationErrors()
1341            errors += [prefix + error for error in sub_errors]
1342        else:
1343          prefix = name + '.'
1344          sub_errors = value.FindInitializationErrors()
1345          errors += [prefix + error for error in sub_errors]
1346
1347    return errors

Finds required fields which are not initialized.

Returns:

A list of strings. Each string is a path to an uninitialized field from the top-level message, e.g. "foo.bar[5].baz".