ortools.sat.sat_parameters_pb2
Generated protocol buffer code.
1# -*- coding: utf-8 -*- 2# Generated by the protocol buffer compiler. DO NOT EDIT! 3# source: ortools/sat/sat_parameters.proto 4# Protobuf Python Version: 4.25.3 5"""Generated protocol buffer code.""" 6from google.protobuf import descriptor as _descriptor 7from google.protobuf import descriptor_pool as _descriptor_pool 8from google.protobuf import symbol_database as _symbol_database 9from google.protobuf.internal import builder as _builder 10# @@protoc_insertion_point(imports) 11 12_sym_db = _symbol_database.Default() 13 14 15 16 17DESCRIPTOR = _descriptor_pool.Default().AddSerializedFile(b'\n ortools/sat/sat_parameters.proto\x12\x17operations_research.sat\"\xac]\n\rSatParameters\x12\x0f\n\x04name\x18\xab\x01 \x01(\t:\x00\x12`\n\x18preferred_variable_order\x18\x01 \x01(\x0e\x32\x34.operations_research.sat.SatParameters.VariableOrder:\x08IN_ORDER\x12Y\n\x10initial_polarity\x18\x02 \x01(\x0e\x32/.operations_research.sat.SatParameters.Polarity:\x0ePOLARITY_FALSE\x12\x1e\n\x10use_phase_saving\x18, \x01(\x08:\x04true\x12)\n\x1apolarity_rephase_increment\x18\xa8\x01 \x01(\x05:\x04\x31\x30\x30\x30\x12 \n\x15random_polarity_ratio\x18- \x01(\x01:\x01\x30\x12 \n\x15random_branches_ratio\x18 \x01(\x01:\x01\x30\x12!\n\x12use_erwa_heuristic\x18K \x01(\x08:\x05\x66\x61lse\x12%\n\x1ainitial_variables_activity\x18L \x01(\x01:\x01\x30\x12\x36\n\'also_bump_variables_in_conflict_reasons\x18M \x01(\x08:\x05\x66\x61lse\x12o\n\x16minimization_algorithm\x18\x04 \x01(\x0e\x32\x44.operations_research.sat.SatParameters.ConflictMinimizationAlgorithm:\tRECURSIVE\x12\x82\x01\n\x1d\x62inary_minimization_algorithm\x18\" \x01(\x0e\x32@.operations_research.sat.SatParameters.BinaryMinizationAlgorithm:\x19\x42INARY_MINIMIZATION_FIRST\x12\x32\n$subsumption_during_conflict_analysis\x18\x38 \x01(\x08:\x04true\x12$\n\x15\x63lause_cleanup_period\x18\x0b \x01(\x05:\x05\x31\x30\x30\x30\x30\x12 \n\x15\x63lause_cleanup_target\x18\r \x01(\x05:\x01\x30\x12\"\n\x14\x63lause_cleanup_ratio\x18\xbe\x01 \x01(\x01:\x03\x30.5\x12k\n\x19\x63lause_cleanup_protection\x18: \x01(\x0e\x32\x37.operations_research.sat.SatParameters.ClauseProtection:\x0fPROTECTION_NONE\x12#\n\x18\x63lause_cleanup_lbd_bound\x18; \x01(\x05:\x01\x35\x12g\n\x17\x63lause_cleanup_ordering\x18< \x01(\x0e\x32\x35.operations_research.sat.SatParameters.ClauseOrdering:\x0f\x43LAUSE_ACTIVITY\x12!\n\x14pb_cleanup_increment\x18. \x01(\x05:\x03\x32\x30\x30\x12\x1d\n\x10pb_cleanup_ratio\x18/ \x01(\x01:\x03\x30.5\x12$\n\x17variable_activity_decay\x18\x0f \x01(\x01:\x03\x30.8\x12+\n\x1bmax_variable_activity_value\x18\x10 \x01(\x01:\x06\x31\x65+100\x12\x1f\n\x11glucose_max_decay\x18\x16 \x01(\x01:\x04\x30.95\x12%\n\x17glucose_decay_increment\x18\x17 \x01(\x01:\x04\x30.01\x12,\n\x1eglucose_decay_increment_period\x18\x18 \x01(\x05:\x04\x35\x30\x30\x30\x12$\n\x15\x63lause_activity_decay\x18\x11 \x01(\x01:\x05\x30.999\x12(\n\x19max_clause_activity_value\x18\x12 \x01(\x01:\x05\x31\x65+20\x12S\n\x12restart_algorithms\x18= \x03(\x0e\x32\x37.operations_research.sat.SatParameters.RestartAlgorithm\x12\x65\n\x1a\x64\x65\x66\x61ult_restart_algorithms\x18\x46 \x01(\t:ALUBY_RESTART,LBD_MOVING_AVERAGE_RESTART,DL_MOVING_AVERAGE_RESTART\x12\x1a\n\x0erestart_period\x18\x1e \x01(\x05:\x02\x35\x30\x12\'\n\x1brestart_running_window_size\x18> \x01(\x05:\x02\x35\x30\x12#\n\x18restart_dl_average_ratio\x18? \x01(\x01:\x01\x31\x12$\n\x19restart_lbd_average_ratio\x18G \x01(\x01:\x01\x31\x12#\n\x14use_blocking_restart\x18@ \x01(\x08:\x05\x66\x61lse\x12*\n\x1c\x62locking_restart_window_size\x18\x41 \x01(\x05:\x04\x35\x30\x30\x30\x12(\n\x1b\x62locking_restart_multiplier\x18\x42 \x01(\x01:\x03\x31.4\x12\x30\n%num_conflicts_before_strategy_changes\x18\x44 \x01(\x05:\x01\x30\x12)\n\x1estrategy_change_increase_ratio\x18\x45 \x01(\x01:\x01\x30\x12 \n\x13max_time_in_seconds\x18$ \x01(\x01:\x03inf\x12#\n\x16max_deterministic_time\x18\x43 \x01(\x01:\x03inf\x12\x34\n\x17max_number_of_conflicts\x18% \x01(\x03:\x13\x39\x32\x32\x33\x33\x37\x32\x30\x33\x36\x38\x35\x34\x37\x37\x35\x38\x30\x37\x12\x1f\n\x10max_memory_in_mb\x18( \x01(\x03:\x05\x31\x30\x30\x30\x30\x12#\n\x12\x61\x62solute_gap_limit\x18\x9f\x01 \x01(\x01:\x06\x30.0001\x12\x1e\n\x12relative_gap_limit\x18\xa0\x01 \x01(\x01:\x01\x30\x12\x16\n\x0brandom_seed\x18\x1f \x01(\x05:\x01\x31\x12)\n\x19permute_variable_randomly\x18\xb2\x01 \x01(\x08:\x05\x66\x61lse\x12\x31\n!permute_presolve_constraint_order\x18\xb3\x01 \x01(\x08:\x05\x66\x61lse\x12\x1f\n\x0fuse_absl_random\x18\xb4\x01 \x01(\x08:\x05\x66\x61lse\x12\"\n\x13log_search_progress\x18) \x01(\x08:\x05\x66\x61lse\x12(\n\x18log_subsolver_statistics\x18\xbd\x01 \x01(\x08:\x05\x66\x61lse\x12\x15\n\nlog_prefix\x18\xb9\x01 \x01(\t:\x00\x12\x1c\n\rlog_to_stdout\x18\xba\x01 \x01(\x08:\x04true\x12\x1f\n\x0flog_to_response\x18\xbb\x01 \x01(\x08:\x05\x66\x61lse\x12 \n\x11use_pb_resolution\x18+ \x01(\x08:\x05\x66\x61lse\x12\x36\n\'minimize_reduction_during_pb_resolution\x18\x30 \x01(\x08:\x05\x66\x61lse\x12,\n\x1e\x63ount_assumption_levels_in_lbd\x18\x31 \x01(\x08:\x04true\x12#\n\x16presolve_bve_threshold\x18\x36 \x01(\x05:\x03\x35\x30\x30\x12%\n\x1apresolve_bve_clause_weight\x18\x37 \x01(\x05:\x01\x33\x12,\n probing_deterministic_time_limit\x18\xe2\x01 \x01(\x01:\x01\x31\x12\x35\n)presolve_probing_deterministic_time_limit\x18\x39 \x01(\x01:\x02\x33\x30\x12%\n\x17presolve_blocked_clause\x18X \x01(\x08:\x04true\x12\x1e\n\x10presolve_use_bva\x18H \x01(\x08:\x04true\x12!\n\x16presolve_bva_threshold\x18I \x01(\x05:\x01\x31\x12#\n\x17max_presolve_iterations\x18\x8a\x01 \x01(\x05:\x01\x33\x12\x1f\n\x11\x63p_model_presolve\x18V \x01(\x08:\x04true\x12!\n\x16\x63p_model_probing_level\x18n \x01(\x05:\x01\x32\x12\'\n\x19\x63p_model_use_sat_presolve\x18] \x01(\x08:\x04true\x12&\n\x16\x64\x65tect_table_with_cost\x18\xd8\x01 \x01(\x08:\x05\x66\x61lse\x12#\n\x17table_compression_level\x18\xd9\x01 \x01(\x05:\x01\x32\x12*\n\x1a\x65xpand_alldiff_constraints\x18\xaa\x01 \x01(\x08:\x05\x66\x61lse\x12+\n\x1c\x65xpand_reservoir_constraints\x18\xb6\x01 \x01(\x08:\x04true\x12,\n\x1c\x64isable_constraint_expansion\x18\xb5\x01 \x01(\x08:\x05\x66\x61lse\x12=\n-encode_complex_linear_constraint_with_integer\x18\xdf\x01 \x01(\x08:\x05\x66\x61lse\x12\x33\n\x1bmerge_no_overlap_work_limit\x18\x91\x01 \x01(\x01:\r1000000000000\x12\x30\n\x1cmerge_at_most_one_work_limit\x18\x92\x01 \x01(\x01:\t100000000\x12\'\n\x1bpresolve_substitution_level\x18\x93\x01 \x01(\x05:\x01\x31\x12\x34\n$presolve_extract_integer_enforcement\x18\xae\x01 \x01(\x08:\x05\x66\x61lse\x12\x31\n\x1dpresolve_inclusion_work_limit\x18\xc9\x01 \x01(\x03:\t100000000\x12\x1b\n\x0cignore_names\x18\xca\x01 \x01(\x08:\x04true\x12\x1e\n\x0finfer_all_diffs\x18\xe9\x01 \x01(\x08:\x04true\x12&\n\x17\x66ind_big_linear_overlap\x18\xea\x01 \x01(\x08:\x04true\x12#\n\x14use_sat_inprocessing\x18\xa3\x01 \x01(\x08:\x04true\x12&\n\x18inprocessing_dtime_ratio\x18\x91\x02 \x01(\x01:\x03\x30.2\x12&\n\x1ainprocessing_probing_dtime\x18\x92\x02 \x01(\x01:\x01\x31\x12+\n\x1finprocessing_minimization_dtime\x18\x93\x02 \x01(\x01:\x01\x31\x12\x17\n\x0bnum_workers\x18\xce\x01 \x01(\x05:\x01\x30\x12\x1d\n\x12num_search_workers\x18\x64 \x01(\x05:\x01\x30\x12\x1f\n\x13min_num_lns_workers\x18\xd3\x01 \x01(\x05:\x01\x32\x12\x13\n\nsubsolvers\x18\xcf\x01 \x03(\t\x12\x19\n\x10\x65xtra_subsolvers\x18\xdb\x01 \x03(\t\x12\x1a\n\x11ignore_subsolvers\x18\xd1\x01 \x03(\t\x12\x41\n\x10subsolver_params\x18\xd2\x01 \x03(\x0b\x32&.operations_research.sat.SatParameters\x12!\n\x11interleave_search\x18\x88\x01 \x01(\x08:\x05\x66\x61lse\x12!\n\x15interleave_batch_size\x18\x86\x01 \x01(\x05:\x01\x30\x12$\n\x16share_objective_bounds\x18q \x01(\x08:\x04true\x12%\n\x17share_level_zero_bounds\x18r \x01(\x08:\x04true\x12#\n\x14share_binary_clauses\x18\xcb\x01 \x01(\x08:\x04true\x12\x30\n debug_postsolve_with_full_solver\x18\xa2\x01 \x01(\x08:\x05\x66\x61lse\x12-\n!debug_max_num_presolve_operations\x18\x97\x01 \x01(\x05:\x01\x30\x12\'\n\x17\x64\x65\x62ug_crash_on_bad_hint\x18\xc3\x01 \x01(\x08:\x05\x66\x61lse\x12$\n\x16use_optimization_hints\x18# \x01(\x08:\x04true\x12\"\n\x17\x63ore_minimization_level\x18\x32 \x01(\x05:\x01\x32\x12!\n\x13\x66ind_multiple_cores\x18T \x01(\x08:\x04true\x12 \n\x12\x63over_optimization\x18Y \x01(\x08:\x04true\x12x\n\x18max_sat_assumption_order\x18\x33 \x01(\x0e\x32<.operations_research.sat.SatParameters.MaxSatAssumptionOrder:\x18\x44\x45\x46\x41ULT_ASSUMPTION_ORDER\x12/\n max_sat_reverse_assumption_order\x18\x34 \x01(\x08:\x05\x66\x61lse\x12|\n\x16max_sat_stratification\x18\x35 \x01(\x0e\x32\x44.operations_research.sat.SatParameters.MaxSatStratificationAlgorithm:\x16STRATIFICATION_DESCENT\x12.\n!propagation_loop_detection_factor\x18\xdd\x01 \x01(\x01:\x02\x31\x30\x12\x37\n)use_precedences_in_disjunctive_constraint\x18J \x01(\x08:\x04true\x12\x42\n5max_size_to_create_precedence_literals_in_disjunctive\x18\xe5\x01 \x01(\x05:\x02\x36\x30\x12\x35\n%use_strong_propagation_in_disjunctive\x18\xe6\x01 \x01(\x08:\x05\x66\x61lse\x12\x35\n%use_dynamic_precedence_in_disjunctive\x18\x87\x02 \x01(\x08:\x05\x66\x61lse\x12\x34\n$use_dynamic_precedence_in_cumulative\x18\x8c\x02 \x01(\x08:\x05\x66\x61lse\x12\x31\n\"use_overload_checker_in_cumulative\x18N \x01(\x08:\x05\x66\x61lse\x12\x37\n(use_timetable_edge_finding_in_cumulative\x18O \x01(\x08:\x05\x66\x61lse\x12:\n,max_num_intervals_for_timetable_edge_finding\x18\x84\x02 \x01(\x05:\x03\x31\x30\x30\x12\x32\n\"use_hard_precedences_in_cumulative\x18\xd7\x01 \x01(\x08:\x05\x66\x61lse\x12\'\n\x17\x65xploit_all_precedences\x18\xdc\x01 \x01(\x08:\x05\x66\x61lse\x12\x36\n(use_disjunctive_constraint_in_cumulative\x18P \x01(\x08:\x04true\x12\x30\n use_timetabling_in_no_overlap_2d\x18\xc8\x01 \x01(\x08:\x05\x66\x61lse\x12\x38\n(use_energetic_reasoning_in_no_overlap_2d\x18\xd5\x01 \x01(\x08:\x05\x66\x61lse\x12=\n-use_area_energetic_reasoning_in_no_overlap_2d\x18\x8f\x02 \x01(\x08:\x05\x66\x61lse\x12<\n-max_pairs_pairwise_reasoning_in_no_overlap_2d\x18\x94\x02 \x01(\x05:\x04\x31\x32\x35\x30\x12-\n\x1euse_dual_scheduling_heuristics\x18\xd6\x01 \x01(\x08:\x04true\x12\x62\n\x10search_branching\x18R \x01(\x0e\x32\x36.operations_research.sat.SatParameters.SearchBranching:\x10\x41UTOMATIC_SEARCH\x12 \n\x13hint_conflict_limit\x18\x99\x01 \x01(\x05:\x02\x31\x30\x12\x1b\n\x0brepair_hint\x18\xa7\x01 \x01(\x08:\x05\x66\x61lse\x12\x33\n#fix_variables_to_their_hinted_value\x18\xc0\x01 \x01(\x08:\x05\x66\x61lse\x12\"\n\x12use_probing_search\x18\xb0\x01 \x01(\x08:\x05\x66\x61lse\x12#\n\x14use_extended_probing\x18\x8d\x02 \x01(\x08:\x04true\x12.\n\x1eprobing_num_combinations_limit\x18\x90\x02 \x01(\x05:\x05\x32\x30\x30\x30\x30\x12,\n\x1duse_shaving_in_probing_search\x18\xcc\x01 \x01(\x08:\x04true\x12\x31\n!shaving_search_deterministic_time\x18\xcd\x01 \x01(\x01:\x05\x30.001\x12\'\n\x17use_objective_lb_search\x18\xe4\x01 \x01(\x08:\x05\x66\x61lse\x12,\n\x1cuse_objective_shaving_search\x18\xfd\x01 \x01(\x08:\x05\x66\x61lse\x12.\n!pseudo_cost_reliability_threshold\x18{ \x01(\x03:\x03\x31\x30\x30\x12!\n\x12optimize_with_core\x18S \x01(\x08:\x05\x66\x61lse\x12,\n\x1coptimize_with_lb_tree_search\x18\xbc\x01 \x01(\x08:\x05\x66\x61lse\x12\'\n\x1b\x62inary_search_num_conflicts\x18\x63 \x01(\x05:\x02-1\x12#\n\x14optimize_with_max_hs\x18U \x01(\x08:\x05\x66\x61lse\x12#\n\x14use_feasibility_jump\x18\x89\x02 \x01(\x08:\x04true\x12%\n\x15test_feasibility_jump\x18\xf0\x01 \x01(\x08:\x05\x66\x61lse\x12%\n\x16\x66\x65\x61sibility_jump_decay\x18\xf2\x01 \x01(\x01:\x04\x30.95\x12\x30\n$feasibility_jump_linearization_level\x18\x81\x02 \x01(\x05:\x01\x32\x12+\n\x1f\x66\x65\x61sibility_jump_restart_factor\x18\x82\x02 \x01(\x05:\x01\x31\x12:\n.feasibility_jump_var_randomization_probability\x18\xf7\x01 \x01(\x01:\x01\x30\x12;\n-feasibility_jump_var_perburbation_range_ratio\x18\xf8\x01 \x01(\x01:\x03\x30.2\x12/\n feasibility_jump_enable_restarts\x18\xfa\x01 \x01(\x08:\x04true\x12;\n-feasibility_jump_max_expanded_constraint_size\x18\x88\x02 \x01(\x05:\x03\x31\x30\x30\x12\x1c\n\x10num_violation_ls\x18\xf4\x01 \x01(\x05:\x01\x30\x12.\n violation_ls_perturbation_period\x18\xf9\x01 \x01(\x05:\x03\x31\x30\x30\x12\x34\n&violation_ls_compound_move_probability\x18\x83\x02 \x01(\x01:\x03\x30.5\x12#\n\x17shared_tree_num_workers\x18\xeb\x01 \x01(\x05:\x01\x30\x12&\n\x16use_shared_tree_search\x18\xec\x01 \x01(\x08:\x05\x66\x61lse\x12<\n.shared_tree_worker_objective_split_probability\x18\xed\x01 \x01(\x01:\x03\x30.5\x12.\n shared_tree_max_nodes_per_worker\x18\xee\x01 \x01(\x05:\x03\x31\x32\x38\x12x\n\x1ashared_tree_split_strategy\x18\xef\x01 \x01(\x0e\x32>.operations_research.sat.SatParameters.SharedTreeSplitStrategy:\x13SPLIT_STRATEGY_AUTO\x12&\n\x17\x65numerate_all_solutions\x18W \x01(\x08:\x05\x66\x61lse\x12\x37\n\'keep_all_feasible_solutions_in_presolve\x18\xad\x01 \x01(\x08:\x05\x66\x61lse\x12\x32\n\"fill_tightened_domains_in_response\x18\x84\x01 \x01(\x08:\x05\x66\x61lse\x12\x35\n%fill_additional_solutions_in_response\x18\xc2\x01 \x01(\x08:\x05\x66\x61lse\x12\'\n\x19instantiate_all_variables\x18j \x01(\x08:\x04true\x12\x36\n(auto_detect_greater_than_at_least_one_of\x18_ \x01(\x08:\x04true\x12(\n\x19stop_after_first_solution\x18\x62 \x01(\x08:\x05\x66\x61lse\x12#\n\x13stop_after_presolve\x18\x95\x01 \x01(\x08:\x05\x66\x61lse\x12+\n\x1bstop_after_root_propagation\x18\xfc\x01 \x01(\x08:\x05\x66\x61lse\x12\x1b\n\x0cuse_lns_only\x18\x65 \x01(\x08:\x05\x66\x61lse\x12\x1e\n\x12solution_pool_size\x18\xc1\x01 \x01(\x05:\x01\x33\x12\x1b\n\x0cuse_rins_lns\x18\x81\x01 \x01(\x08:\x04true\x12#\n\x14use_feasibility_pump\x18\xa4\x01 \x01(\x08:\x04true\x12 \n\x10use_lb_relax_lns\x18\xff\x01 \x01(\x08:\x05\x66\x61lse\x12\x63\n\x0b\x66p_rounding\x18\xa5\x01 \x01(\x0e\x32\x37.operations_research.sat.SatParameters.FPRoundingMethod:\x14PROPAGATION_ASSISTED\x12$\n\x14\x64iversify_lns_params\x18\x89\x01 \x01(\x08:\x05\x66\x61lse\x12\x1f\n\x10randomize_search\x18g \x01(\x08:\x05\x66\x61lse\x12+\n search_random_variable_pool_size\x18h \x01(\x03:\x01\x30\x12+\n\x1bpush_all_tasks_toward_start\x18\x86\x02 \x01(\x08:\x05\x66\x61lse\x12%\n\x16use_optional_variables\x18l \x01(\x08:\x05\x66\x61lse\x12!\n\x13use_exact_lp_reason\x18m \x01(\x08:\x04true\x12\'\n\x17use_combined_no_overlap\x18\x85\x01 \x01(\x08:\x05\x66\x61lse\x12*\n\x1e\x61t_most_one_max_expansion_size\x18\x8e\x02 \x01(\x05:\x01\x33\x12\"\n\x13\x63\x61tch_sigint_signal\x18\x87\x01 \x01(\x08:\x04true\x12!\n\x12use_implied_bounds\x18\x90\x01 \x01(\x08:\x04true\x12\"\n\x12polish_lp_solution\x18\xaf\x01 \x01(\x08:\x05\x66\x61lse\x12#\n\x13lp_primal_tolerance\x18\x8a\x02 \x01(\x01:\x05\x31\x65-07\x12!\n\x11lp_dual_tolerance\x18\x8b\x02 \x01(\x01:\x05\x31\x65-07\x12 \n\x11\x63onvert_intervals\x18\xb1\x01 \x01(\x08:\x04true\x12\x1a\n\x0esymmetry_level\x18\xb7\x01 \x01(\x05:\x01\x32\x12&\n\x16new_linear_propagation\x18\xe0\x01 \x01(\x08:\x05\x66\x61lse\x12\x1f\n\x11linear_split_size\x18\x80\x02 \x01(\x05:\x03\x31\x30\x30\x12\x1e\n\x13linearization_level\x18Z \x01(\x05:\x01\x31\x12!\n\x16\x62oolean_encoding_level\x18k \x01(\x05:\x01\x31\x12=\n0max_domain_size_when_encoding_eq_neq_constraints\x18\xbf\x01 \x01(\x05:\x02\x31\x36\x12\x1b\n\x0cmax_num_cuts\x18[ \x01(\x05:\x05\x31\x30\x30\x30\x30\x12\x15\n\tcut_level\x18\xc4\x01 \x01(\x05:\x01\x31\x12*\n\x1bonly_add_cuts_at_level_zero\x18\\ \x01(\x08:\x05\x66\x61lse\x12!\n\x11\x61\x64\x64_objective_cut\x18\xc5\x01 \x01(\x08:\x05\x66\x61lse\x12\x19\n\x0b\x61\x64\x64_cg_cuts\x18u \x01(\x08:\x04true\x12\x1a\n\x0c\x61\x64\x64_mir_cuts\x18x \x01(\x08:\x04true\x12!\n\x12\x61\x64\x64_zero_half_cuts\x18\xa9\x01 \x01(\x08:\x04true\x12\x1e\n\x0f\x61\x64\x64_clique_cuts\x18\xac\x01 \x01(\x08:\x04true\x12\x1b\n\x0c\x61\x64\x64_rlt_cuts\x18\x97\x02 \x01(\x08:\x04true\x12\"\n\x15max_all_diff_cut_size\x18\x94\x01 \x01(\x05:\x02\x36\x34\x12\x1f\n\x10\x61\x64\x64_lin_max_cuts\x18\x98\x01 \x01(\x08:\x04true\x12)\n\x1cmax_integer_rounding_scaling\x18w \x01(\x05:\x03\x36\x30\x30\x12\'\n\x19\x61\x64\x64_lp_constraints_lazily\x18p \x01(\x08:\x04true\x12!\n\x12root_lp_iterations\x18\xe3\x01 \x01(\x05:\x04\x32\x30\x30\x30\x12\x32\n$min_orthogonality_for_lp_constraints\x18s \x01(\x01:\x04\x30.05\x12(\n\x1cmax_cut_rounds_at_level_zero\x18\x9a\x01 \x01(\x05:\x01\x31\x12+\n\x1emax_consecutive_inactive_count\x18y \x01(\x05:\x03\x31\x30\x30\x12\x30\n\x1a\x63ut_max_active_count_value\x18\x9b\x01 \x01(\x01:\x0b\x31\x30\x30\x30\x30\x30\x30\x30\x30\x30\x30\x12$\n\x16\x63ut_active_count_decay\x18\x9c\x01 \x01(\x01:\x03\x30.8\x12!\n\x12\x63ut_cleanup_target\x18\x9d\x01 \x01(\x05:\x04\x31\x30\x30\x30\x12&\n\x1anew_constraints_batch_size\x18z \x01(\x05:\x02\x35\x30\x12)\n\x1b\x65xploit_integer_lp_solution\x18^ \x01(\x08:\x04true\x12%\n\x17\x65xploit_all_lp_solution\x18t \x01(\x08:\x04true\x12%\n\x15\x65xploit_best_solution\x18\x82\x01 \x01(\x08:\x05\x66\x61lse\x12+\n\x1b\x65xploit_relaxation_solution\x18\xa1\x01 \x01(\x08:\x05\x66\x61lse\x12 \n\x11\x65xploit_objective\x18\x83\x01 \x01(\x08:\x04true\x12)\n\x19\x64\x65tect_linearized_product\x18\x95\x02 \x01(\x08:\x05\x66\x61lse\x12\x1f\n\rmip_max_bound\x18| \x01(\x01:\x08\x31\x30\x30\x30\x30\x30\x30\x30\x12\x1a\n\x0fmip_var_scaling\x18} \x01(\x01:\x01\x31\x12&\n\x16mip_scale_large_domain\x18\xe1\x01 \x01(\x08:\x05\x66\x61lse\x12\x30\n!mip_automatically_scale_variables\x18\xa6\x01 \x01(\x08:\x04true\x12\x1d\n\ronly_solve_ip\x18\xde\x01 \x01(\x08:\x05\x66\x61lse\x12#\n\x14mip_wanted_precision\x18~ \x01(\x01:\x05\x31\x65-06\x12%\n\x19mip_max_activity_exponent\x18\x7f \x01(\x05:\x02\x35\x33\x12$\n\x13mip_check_precision\x18\x80\x01 \x01(\x01:\x06\x30.0001\x12/\n mip_compute_true_objective_bound\x18\xc6\x01 \x01(\x08:\x04true\x12\'\n\x17mip_max_valid_magnitude\x18\xc7\x01 \x01(\x01:\x05\x31\x65+20\x12;\n+mip_treat_high_magnitude_bounds_as_infinity\x18\x96\x02 \x01(\x08:\x05\x66\x61lse\x12\"\n\x12mip_drop_tolerance\x18\xe8\x01 \x01(\x01:\x05\x31\x65-16\x12\x1e\n\x12mip_presolve_level\x18\x85\x02 \x01(\x05:\x01\x32\"H\n\rVariableOrder\x12\x0c\n\x08IN_ORDER\x10\x00\x12\x14\n\x10IN_REVERSE_ORDER\x10\x01\x12\x13\n\x0fIN_RANDOM_ORDER\x10\x02\"F\n\x08Polarity\x12\x11\n\rPOLARITY_TRUE\x10\x00\x12\x12\n\x0ePOLARITY_FALSE\x10\x01\x12\x13\n\x0fPOLARITY_RANDOM\x10\x02\"V\n\x1d\x43onflictMinimizationAlgorithm\x12\x08\n\x04NONE\x10\x00\x12\n\n\x06SIMPLE\x10\x01\x12\r\n\tRECURSIVE\x10\x02\x12\x10\n\x0c\x45XPERIMENTAL\x10\x03\"\xe0\x01\n\x19\x42inaryMinizationAlgorithm\x12\x1a\n\x16NO_BINARY_MINIMIZATION\x10\x00\x12\x1d\n\x19\x42INARY_MINIMIZATION_FIRST\x10\x01\x12\x37\n3BINARY_MINIMIZATION_FIRST_WITH_TRANSITIVE_REDUCTION\x10\x04\x12)\n%BINARY_MINIMIZATION_WITH_REACHABILITY\x10\x02\x12$\n EXPERIMENTAL_BINARY_MINIMIZATION\x10\x03\"R\n\x10\x43lauseProtection\x12\x13\n\x0fPROTECTION_NONE\x10\x00\x12\x15\n\x11PROTECTION_ALWAYS\x10\x01\x12\x12\n\x0ePROTECTION_LBD\x10\x02\"5\n\x0e\x43lauseOrdering\x12\x13\n\x0f\x43LAUSE_ACTIVITY\x10\x00\x12\x0e\n\nCLAUSE_LBD\x10\x01\"\x86\x01\n\x10RestartAlgorithm\x12\x0e\n\nNO_RESTART\x10\x00\x12\x10\n\x0cLUBY_RESTART\x10\x01\x12\x1d\n\x19\x44L_MOVING_AVERAGE_RESTART\x10\x02\x12\x1e\n\x1aLBD_MOVING_AVERAGE_RESTART\x10\x03\x12\x11\n\rFIXED_RESTART\x10\x04\"t\n\x15MaxSatAssumptionOrder\x12\x1c\n\x18\x44\x45\x46\x41ULT_ASSUMPTION_ORDER\x10\x00\x12\x1d\n\x19ORDER_ASSUMPTION_BY_DEPTH\x10\x01\x12\x1e\n\x1aORDER_ASSUMPTION_BY_WEIGHT\x10\x02\"o\n\x1dMaxSatStratificationAlgorithm\x12\x17\n\x13STRATIFICATION_NONE\x10\x00\x12\x1a\n\x16STRATIFICATION_DESCENT\x10\x01\x12\x19\n\x15STRATIFICATION_ASCENT\x10\x02\"\xe1\x01\n\x0fSearchBranching\x12\x14\n\x10\x41UTOMATIC_SEARCH\x10\x00\x12\x10\n\x0c\x46IXED_SEARCH\x10\x01\x12\x14\n\x10PORTFOLIO_SEARCH\x10\x02\x12\r\n\tLP_SEARCH\x10\x03\x12\x16\n\x12PSEUDO_COST_SEARCH\x10\x04\x12\'\n#PORTFOLIO_WITH_QUICK_RESTART_SEARCH\x10\x05\x12\x0f\n\x0bHINT_SEARCH\x10\x06\x12\x18\n\x14PARTIAL_FIXED_SEARCH\x10\x07\x12\x15\n\x11RANDOMIZED_SEARCH\x10\x08\"\xb8\x01\n\x17SharedTreeSplitStrategy\x12\x17\n\x13SPLIT_STRATEGY_AUTO\x10\x00\x12\x1e\n\x1aSPLIT_STRATEGY_DISCREPANCY\x10\x01\x12\x1f\n\x1bSPLIT_STRATEGY_OBJECTIVE_LB\x10\x02\x12 \n\x1cSPLIT_STRATEGY_BALANCED_TREE\x10\x03\x12!\n\x1dSPLIT_STRATEGY_FIRST_PROPOSAL\x10\x04\"h\n\x10\x46PRoundingMethod\x12\x13\n\x0fNEAREST_INTEGER\x10\x00\x12\x0e\n\nLOCK_BASED\x10\x01\x12\x15\n\x11\x41\x43TIVE_LOCK_BASED\x10\x03\x12\x18\n\x14PROPAGATION_ASSISTED\x10\x02\x42/\n\x16\x63om.google.ortools.satP\x01\xaa\x02\x12Google.OrTools.Sat') 18 19_globals = globals() 20_builder.BuildMessageAndEnumDescriptors(DESCRIPTOR, _globals) 21_builder.BuildTopDescriptorsAndMessages(DESCRIPTOR, 'ortools.sat.sat_parameters_pb2', _globals) 22if _descriptor._USE_C_DESCRIPTORS == False: 23 _globals['DESCRIPTOR']._options = None 24 _globals['DESCRIPTOR']._serialized_options = b'\n\026com.google.ortools.satP\001\252\002\022Google.OrTools.Sat' 25 _globals['_SATPARAMETERS']._serialized_start=62 26 _globals['_SATPARAMETERS']._serialized_end=12010 27 _globals['_SATPARAMETERS_VARIABLEORDER']._serialized_start=10523 28 _globals['_SATPARAMETERS_VARIABLEORDER']._serialized_end=10595 29 _globals['_SATPARAMETERS_POLARITY']._serialized_start=10597 30 _globals['_SATPARAMETERS_POLARITY']._serialized_end=10667 31 _globals['_SATPARAMETERS_CONFLICTMINIMIZATIONALGORITHM']._serialized_start=10669 32 _globals['_SATPARAMETERS_CONFLICTMINIMIZATIONALGORITHM']._serialized_end=10755 33 _globals['_SATPARAMETERS_BINARYMINIZATIONALGORITHM']._serialized_start=10758 34 _globals['_SATPARAMETERS_BINARYMINIZATIONALGORITHM']._serialized_end=10982 35 _globals['_SATPARAMETERS_CLAUSEPROTECTION']._serialized_start=10984 36 _globals['_SATPARAMETERS_CLAUSEPROTECTION']._serialized_end=11066 37 _globals['_SATPARAMETERS_CLAUSEORDERING']._serialized_start=11068 38 _globals['_SATPARAMETERS_CLAUSEORDERING']._serialized_end=11121 39 _globals['_SATPARAMETERS_RESTARTALGORITHM']._serialized_start=11124 40 _globals['_SATPARAMETERS_RESTARTALGORITHM']._serialized_end=11258 41 _globals['_SATPARAMETERS_MAXSATASSUMPTIONORDER']._serialized_start=11260 42 _globals['_SATPARAMETERS_MAXSATASSUMPTIONORDER']._serialized_end=11376 43 _globals['_SATPARAMETERS_MAXSATSTRATIFICATIONALGORITHM']._serialized_start=11378 44 _globals['_SATPARAMETERS_MAXSATSTRATIFICATIONALGORITHM']._serialized_end=11489 45 _globals['_SATPARAMETERS_SEARCHBRANCHING']._serialized_start=11492 46 _globals['_SATPARAMETERS_SEARCHBRANCHING']._serialized_end=11717 47 _globals['_SATPARAMETERS_SHAREDTREESPLITSTRATEGY']._serialized_start=11720 48 _globals['_SATPARAMETERS_SHAREDTREESPLITSTRATEGY']._serialized_end=11904 49 _globals['_SATPARAMETERS_FPROUNDINGMETHOD']._serialized_start=11906 50 _globals['_SATPARAMETERS_FPROUNDINGMETHOD']._serialized_end=12010 51# @@protoc_insertion_point(module_scope)
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.
496 def init(self, **kwargs): 497 self._cached_byte_size = 0 498 self._cached_byte_size_dirty = len(kwargs) > 0 499 self._fields = {} 500 # Contains a mapping from oneof field descriptors to the descriptor 501 # of the currently set field in that oneof field. 502 self._oneofs = {} 503 504 # _unknown_fields is () when empty for efficiency, and will be turned into 505 # a list if fields are added. 506 self._unknown_fields = () 507 # _unknown_field_set is None when empty for efficiency, and will be 508 # turned into UnknownFieldSet struct if fields are added. 509 self._unknown_field_set = None # pylint: disable=protected-access 510 self._is_present_in_parent = False 511 self._listener = message_listener_mod.NullMessageListener() 512 self._listener_for_children = _Listener(self) 513 for field_name, field_value in kwargs.items(): 514 field = _GetFieldByName(message_descriptor, field_name) 515 if field is None: 516 raise TypeError('%s() got an unexpected keyword argument "%s"' % 517 (message_descriptor.name, field_name)) 518 if field_value is None: 519 # field=None is the same as no field at all. 520 continue 521 if field.label == _FieldDescriptor.LABEL_REPEATED: 522 copy = field._default_constructor(self) 523 if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE: # Composite 524 if _IsMapField(field): 525 if _IsMessageMapField(field): 526 for key in field_value: 527 copy[key].MergeFrom(field_value[key]) 528 else: 529 copy.update(field_value) 530 else: 531 for val in field_value: 532 if isinstance(val, dict): 533 copy.add(**val) 534 else: 535 copy.add().MergeFrom(val) 536 else: # Scalar 537 if field.cpp_type == _FieldDescriptor.CPPTYPE_ENUM: 538 field_value = [_GetIntegerEnumValue(field.enum_type, val) 539 for val in field_value] 540 copy.extend(field_value) 541 self._fields[field] = copy 542 elif field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE: 543 copy = field._default_constructor(self) 544 new_val = field_value 545 if isinstance(field_value, dict): 546 new_val = field.message_type._concrete_class(**field_value) 547 try: 548 copy.MergeFrom(new_val) 549 except TypeError: 550 _ReraiseTypeErrorWithFieldName(message_descriptor.name, field_name) 551 self._fields[field] = copy 552 else: 553 if field.cpp_type == _FieldDescriptor.CPPTYPE_ENUM: 554 field_value = _GetIntegerEnumValue(field.enum_type, field_value) 555 try: 556 setattr(self, field_name, field_value) 557 except TypeError: 558 _ReraiseTypeErrorWithFieldName(message_descriptor.name, field_name)
1312 def MergeFrom(self, msg): 1313 if not isinstance(msg, cls): 1314 raise TypeError( 1315 'Parameter to MergeFrom() must be instance of same class: ' 1316 'expected %s got %s.' % (_FullyQualifiedClassName(cls), 1317 _FullyQualifiedClassName(msg.__class__))) 1318 1319 assert msg is not self 1320 self._Modified() 1321 1322 fields = self._fields 1323 1324 for field, value in msg._fields.items(): 1325 if field.label == LABEL_REPEATED: 1326 field_value = fields.get(field) 1327 if field_value is None: 1328 # Construct a new object to represent this field. 1329 field_value = field._default_constructor(self) 1330 fields[field] = field_value 1331 field_value.MergeFrom(value) 1332 elif field.cpp_type == CPPTYPE_MESSAGE: 1333 if value._is_present_in_parent: 1334 field_value = fields.get(field) 1335 if field_value is None: 1336 # Construct a new object to represent this field. 1337 field_value = field._default_constructor(self) 1338 fields[field] = field_value 1339 field_value.MergeFrom(value) 1340 else: 1341 self._fields[field] = value 1342 if field.containing_oneof: 1343 self._UpdateOneofState(field) 1344 1345 if msg._unknown_fields: 1346 if not self._unknown_fields: 1347 self._unknown_fields = [] 1348 self._unknown_fields.extend(msg._unknown_fields) 1349 # pylint: disable=protected-access 1350 if self._unknown_field_set is None: 1351 self._unknown_field_set = containers.UnknownFieldSet() 1352 self._unknown_field_set._extend(msg._unknown_field_set)
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.
1375def _Clear(self): 1376 # Clear fields. 1377 self._fields = {} 1378 self._unknown_fields = () 1379 # pylint: disable=protected-access 1380 if self._unknown_field_set is not None: 1381 self._unknown_field_set._clear() 1382 self._unknown_field_set = None 1383 1384 self._oneofs = {} 1385 self._Modified()
Clears all data that was set in the message.
1452 def Modified(self): 1453 """Sets the _cached_byte_size_dirty bit to true, 1454 and propagates this to our listener iff this was a state change. 1455 """ 1456 1457 # Note: Some callers check _cached_byte_size_dirty before calling 1458 # _Modified() as an extra optimization. So, if this method is ever 1459 # changed such that it does stuff even when _cached_byte_size_dirty is 1460 # already true, the callers need to be updated. 1461 if not self._cached_byte_size_dirty: 1462 self._cached_byte_size_dirty = True 1463 self._listener_for_children.dirty = True 1464 self._is_present_in_parent = True 1465 self._listener.Modified()
Sets the _cached_byte_size_dirty bit to true, and propagates this to our listener iff this was a state change.
1213 def IsInitialized(self, errors=None): 1214 """Checks if all required fields of a message are set. 1215 1216 Args: 1217 errors: A list which, if provided, will be populated with the field 1218 paths of all missing required fields. 1219 1220 Returns: 1221 True iff the specified message has all required fields set. 1222 """ 1223 1224 # Performance is critical so we avoid HasField() and ListFields(). 1225 1226 for field in required_fields: 1227 if (field not in self._fields or 1228 (field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE and 1229 not self._fields[field]._is_present_in_parent)): 1230 if errors is not None: 1231 errors.extend(self.FindInitializationErrors()) 1232 return False 1233 1234 for field, value in list(self._fields.items()): # dict can change size! 1235 if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE: 1236 if field.label == _FieldDescriptor.LABEL_REPEATED: 1237 if (field.message_type._is_map_entry): 1238 continue 1239 for element in value: 1240 if not element.IsInitialized(): 1241 if errors is not None: 1242 errors.extend(self.FindInitializationErrors()) 1243 return False 1244 elif value._is_present_in_parent and not value.IsInitialized(): 1245 if errors is not None: 1246 errors.extend(self.FindInitializationErrors()) 1247 return False 1248 1249 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.
1119 def MergeFromString(self, serialized): 1120 serialized = memoryview(serialized) 1121 length = len(serialized) 1122 try: 1123 if self._InternalParse(serialized, 0, length) != length: 1124 # The only reason _InternalParse would return early is if it 1125 # encountered an end-group tag. 1126 raise message_mod.DecodeError('Unexpected end-group tag.') 1127 except (IndexError, TypeError): 1128 # Now ord(buf[p:p+1]) == ord('') gets TypeError. 1129 raise message_mod.DecodeError('Truncated message.') 1130 except struct.error as e: 1131 raise message_mod.DecodeError(e) 1132 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 belen(serialized)
, but for messages which are actually groups, this will generally be less thanlen(serialized)
, since we must stop when we reach anEND_GROUP
tag. Note that if we do stop because of anEND_GROUP
tag, the number of bytes returned does not include the bytes for theEND_GROUP
tag information.
Raises:
- DecodeError: if the input cannot be parsed.
1072 def SerializeToString(self, **kwargs): 1073 # Check if the message has all of its required fields set. 1074 if not self.IsInitialized(): 1075 raise message_mod.EncodeError( 1076 'Message %s is missing required fields: %s' % ( 1077 self.DESCRIPTOR.full_name, ','.join(self.FindInitializationErrors()))) 1078 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:
- EncodeError: if the message isn't initialized (see
IsInitialized()
).
1085 def SerializePartialToString(self, **kwargs): 1086 out = BytesIO() 1087 self._InternalSerialize(out.write, **kwargs) 1088 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.
814 def ListFields(self): 815 all_fields = [item for item in self._fields.items() if _IsPresent(item)] 816 all_fields.sort(key = lambda item: item[0].number) 817 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.
838 def HasField(self, field_name): 839 try: 840 field = hassable_fields[field_name] 841 except KeyError as exc: 842 raise ValueError('Protocol message %s has no non-repeated field "%s" ' 843 'nor has presence is not available for this field.' % ( 844 message_descriptor.full_name, field_name)) from exc 845 846 if isinstance(field, descriptor_mod.OneofDescriptor): 847 try: 848 return HasField(self, self._oneofs[field].name) 849 except KeyError: 850 return False 851 else: 852 if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE: 853 value = self._fields.get(field) 854 return value is not None and value._is_present_in_parent 855 else: 856 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.
863 def ClearField(self, field_name): 864 try: 865 field = message_descriptor.fields_by_name[field_name] 866 except KeyError: 867 try: 868 field = message_descriptor.oneofs_by_name[field_name] 869 if field in self._oneofs: 870 field = self._oneofs[field] 871 else: 872 return 873 except KeyError: 874 raise ValueError('Protocol message %s has no "%s" field.' % 875 (message_descriptor.name, field_name)) 876 877 if field in self._fields: 878 # To match the C++ implementation, we need to invalidate iterators 879 # for map fields when ClearField() happens. 880 if hasattr(self._fields[field], 'InvalidateIterators'): 881 self._fields[field].InvalidateIterators() 882 883 # Note: If the field is a sub-message, its listener will still point 884 # at us. That's fine, because the worst than can happen is that it 885 # will call _Modified() and invalidate our byte size. Big deal. 886 del self._fields[field] 887 888 if self._oneofs.get(field.containing_oneof, None) is field: 889 del self._oneofs[field.containing_oneof] 890 891 # Always call _Modified() -- even if nothing was changed, this is 892 # a mutating method, and thus calling it should cause the field to become 893 # present in the parent message. 894 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.
1358 def WhichOneof(self, oneof_name): 1359 """Returns the name of the currently set field inside a oneof, or None.""" 1360 try: 1361 field = message_descriptor.oneofs_by_name[oneof_name] 1362 except KeyError: 1363 raise ValueError( 1364 'Protocol message has no oneof "%s" field.' % oneof_name) 1365 1366 nested_field = self._oneofs.get(field, None) 1367 if nested_field is not None and self.HasField(nested_field.name): 1368 return nested_field.name 1369 else: 1370 return None
Returns the name of the currently set field inside a oneof, or None.
1388def _UnknownFields(self): 1389 warnings.warn( 1390 'message.UnknownFields() is deprecated. Please use the add one ' 1391 'feature unknown_fields.UnknownFieldSet(message) in ' 1392 'unknown_fields.py instead.' 1393 ) 1394 if self._unknown_field_set is None: # pylint: disable=protected-access 1395 # pylint: disable=protected-access 1396 self._unknown_field_set = containers.UnknownFieldSet() 1397 return self._unknown_field_set # pylint: disable=protected-access
Returns the UnknownFieldSet.
Returns:
UnknownFieldSet: The unknown fields stored in this message.
1400def _DiscardUnknownFields(self): 1401 self._unknown_fields = [] 1402 self._unknown_field_set = None # pylint: disable=protected-access 1403 for field, value in self.ListFields(): 1404 if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE: 1405 if _IsMapField(field): 1406 if _IsMessageMapField(field): 1407 for key in value: 1408 value[key].DiscardUnknownFields() 1409 elif field.label == _FieldDescriptor.LABEL_REPEATED: 1410 for sub_message in value: 1411 sub_message.DiscardUnknownFields() 1412 else: 1413 value.DiscardUnknownFields()
Clears all fields in the UnknownFieldSet
.
This operation is recursive for nested message.
1040 def ByteSize(self): 1041 if not self._cached_byte_size_dirty: 1042 return self._cached_byte_size 1043 1044 size = 0 1045 descriptor = self.DESCRIPTOR 1046 if descriptor._is_map_entry: 1047 # Fields of map entry should always be serialized. 1048 key_field = descriptor.fields_by_name['key'] 1049 _MaybeAddEncoder(cls, key_field) 1050 size = key_field._sizer(self.key) 1051 value_field = descriptor.fields_by_name['value'] 1052 _MaybeAddEncoder(cls, value_field) 1053 size += value_field._sizer(self.value) 1054 else: 1055 for field_descriptor, field_value in self.ListFields(): 1056 _MaybeAddEncoder(cls, field_descriptor) 1057 size += field_descriptor._sizer(field_value) 1058 for tag_bytes, value_bytes in self._unknown_fields: 1059 size += len(tag_bytes) + len(value_bytes) 1060 1061 self._cached_byte_size = size 1062 self._cached_byte_size_dirty = False 1063 self._listener_for_children.dirty = False 1064 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.
784 def RegisterExtension(field_descriptor): 785 field_descriptor.containing_type = cls.DESCRIPTOR 786 # TODO: Use cls.MESSAGE_FACTORY.pool when available. 787 # pylint: disable=protected-access 788 cls.DESCRIPTOR.file.pool._AddExtensionDescriptor(field_descriptor) 789 _AttachFieldHelpers(cls, field_descriptor)
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for name.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for preferred_variable_order.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for initial_polarity.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_phase_saving.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for polarity_rephase_increment.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for random_polarity_ratio.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for random_branches_ratio.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_erwa_heuristic.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for initial_variables_activity.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for also_bump_variables_in_conflict_reasons.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for minimization_algorithm.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for binary_minimization_algorithm.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for subsumption_during_conflict_analysis.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for clause_cleanup_period.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for clause_cleanup_target.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for clause_cleanup_ratio.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for clause_cleanup_protection.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for clause_cleanup_lbd_bound.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for clause_cleanup_ordering.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for pb_cleanup_increment.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for pb_cleanup_ratio.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for variable_activity_decay.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_variable_activity_value.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for glucose_max_decay.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for glucose_decay_increment.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for glucose_decay_increment_period.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for clause_activity_decay.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_clause_activity_value.
642 def getter(self): 643 field_value = self._fields.get(field) 644 if field_value is None: 645 # Construct a new object to represent this field. 646 field_value = field._default_constructor(self) 647 648 # Atomically check if another thread has preempted us and, if not, swap 649 # in the new object we just created. If someone has preempted us, we 650 # take that object and discard ours. 651 # WARNING: We are relying on setdefault() being atomic. This is true 652 # in CPython but we haven't investigated others. This warning appears 653 # in several other locations in this file. 654 field_value = self._fields.setdefault(field, field_value) 655 return field_value
Getter for restart_algorithms.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for default_restart_algorithms.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for restart_period.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for restart_running_window_size.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for restart_dl_average_ratio.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for restart_lbd_average_ratio.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_blocking_restart.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for blocking_restart_window_size.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for blocking_restart_multiplier.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for num_conflicts_before_strategy_changes.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for strategy_change_increase_ratio.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_time_in_seconds.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_deterministic_time.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_number_of_conflicts.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_memory_in_mb.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for absolute_gap_limit.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for relative_gap_limit.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for random_seed.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for permute_variable_randomly.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for permute_presolve_constraint_order.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_absl_random.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for log_search_progress.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for log_subsolver_statistics.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for log_prefix.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for log_to_stdout.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for log_to_response.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_pb_resolution.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for minimize_reduction_during_pb_resolution.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for count_assumption_levels_in_lbd.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for presolve_bve_threshold.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for presolve_bve_clause_weight.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for probing_deterministic_time_limit.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for presolve_probing_deterministic_time_limit.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for presolve_blocked_clause.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for presolve_use_bva.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for presolve_bva_threshold.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_presolve_iterations.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for cp_model_presolve.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for cp_model_probing_level.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for cp_model_use_sat_presolve.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for detect_table_with_cost.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for table_compression_level.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for expand_alldiff_constraints.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for expand_reservoir_constraints.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for disable_constraint_expansion.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for encode_complex_linear_constraint_with_integer.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for merge_no_overlap_work_limit.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for merge_at_most_one_work_limit.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for presolve_substitution_level.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for presolve_extract_integer_enforcement.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for presolve_inclusion_work_limit.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for ignore_names.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for infer_all_diffs.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for find_big_linear_overlap.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_sat_inprocessing.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for inprocessing_dtime_ratio.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for inprocessing_probing_dtime.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for inprocessing_minimization_dtime.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for num_workers.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for num_search_workers.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for min_num_lns_workers.
642 def getter(self): 643 field_value = self._fields.get(field) 644 if field_value is None: 645 # Construct a new object to represent this field. 646 field_value = field._default_constructor(self) 647 648 # Atomically check if another thread has preempted us and, if not, swap 649 # in the new object we just created. If someone has preempted us, we 650 # take that object and discard ours. 651 # WARNING: We are relying on setdefault() being atomic. This is true 652 # in CPython but we haven't investigated others. This warning appears 653 # in several other locations in this file. 654 field_value = self._fields.setdefault(field, field_value) 655 return field_value
Getter for subsolvers.
642 def getter(self): 643 field_value = self._fields.get(field) 644 if field_value is None: 645 # Construct a new object to represent this field. 646 field_value = field._default_constructor(self) 647 648 # Atomically check if another thread has preempted us and, if not, swap 649 # in the new object we just created. If someone has preempted us, we 650 # take that object and discard ours. 651 # WARNING: We are relying on setdefault() being atomic. This is true 652 # in CPython but we haven't investigated others. This warning appears 653 # in several other locations in this file. 654 field_value = self._fields.setdefault(field, field_value) 655 return field_value
Getter for extra_subsolvers.
642 def getter(self): 643 field_value = self._fields.get(field) 644 if field_value is None: 645 # Construct a new object to represent this field. 646 field_value = field._default_constructor(self) 647 648 # Atomically check if another thread has preempted us and, if not, swap 649 # in the new object we just created. If someone has preempted us, we 650 # take that object and discard ours. 651 # WARNING: We are relying on setdefault() being atomic. This is true 652 # in CPython but we haven't investigated others. This warning appears 653 # in several other locations in this file. 654 field_value = self._fields.setdefault(field, field_value) 655 return field_value
Getter for ignore_subsolvers.
642 def getter(self): 643 field_value = self._fields.get(field) 644 if field_value is None: 645 # Construct a new object to represent this field. 646 field_value = field._default_constructor(self) 647 648 # Atomically check if another thread has preempted us and, if not, swap 649 # in the new object we just created. If someone has preempted us, we 650 # take that object and discard ours. 651 # WARNING: We are relying on setdefault() being atomic. This is true 652 # in CPython but we haven't investigated others. This warning appears 653 # in several other locations in this file. 654 field_value = self._fields.setdefault(field, field_value) 655 return field_value
Getter for subsolver_params.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for interleave_search.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for interleave_batch_size.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for debug_postsolve_with_full_solver.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for debug_max_num_presolve_operations.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for debug_crash_on_bad_hint.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_optimization_hints.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for core_minimization_level.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for find_multiple_cores.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for cover_optimization.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_sat_assumption_order.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_sat_reverse_assumption_order.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_sat_stratification.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for propagation_loop_detection_factor.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_precedences_in_disjunctive_constraint.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_size_to_create_precedence_literals_in_disjunctive.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_strong_propagation_in_disjunctive.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_dynamic_precedence_in_disjunctive.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_dynamic_precedence_in_cumulative.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_overload_checker_in_cumulative.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_timetable_edge_finding_in_cumulative.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_num_intervals_for_timetable_edge_finding.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_hard_precedences_in_cumulative.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for exploit_all_precedences.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_disjunctive_constraint_in_cumulative.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_timetabling_in_no_overlap_2d.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_energetic_reasoning_in_no_overlap_2d.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_area_energetic_reasoning_in_no_overlap_2d.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_pairs_pairwise_reasoning_in_no_overlap_2d.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_dual_scheduling_heuristics.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for search_branching.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for hint_conflict_limit.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for repair_hint.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for fix_variables_to_their_hinted_value.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_probing_search.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_extended_probing.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for probing_num_combinations_limit.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_shaving_in_probing_search.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for shaving_search_deterministic_time.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_objective_lb_search.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_objective_shaving_search.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for pseudo_cost_reliability_threshold.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for optimize_with_core.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for optimize_with_lb_tree_search.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for binary_search_num_conflicts.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for optimize_with_max_hs.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_feasibility_jump.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for test_feasibility_jump.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for feasibility_jump_decay.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for feasibility_jump_linearization_level.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for feasibility_jump_restart_factor.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for feasibility_jump_var_randomization_probability.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for feasibility_jump_var_perburbation_range_ratio.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for feasibility_jump_enable_restarts.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for feasibility_jump_max_expanded_constraint_size.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for num_violation_ls.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for violation_ls_perturbation_period.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for violation_ls_compound_move_probability.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for enumerate_all_solutions.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for keep_all_feasible_solutions_in_presolve.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for fill_tightened_domains_in_response.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for fill_additional_solutions_in_response.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for instantiate_all_variables.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for auto_detect_greater_than_at_least_one_of.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for stop_after_first_solution.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for stop_after_presolve.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for stop_after_root_propagation.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_lns_only.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for solution_pool_size.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_rins_lns.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_feasibility_pump.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_lb_relax_lns.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for fp_rounding.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for diversify_lns_params.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for randomize_search.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for search_random_variable_pool_size.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for push_all_tasks_toward_start.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_optional_variables.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_exact_lp_reason.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_combined_no_overlap.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for at_most_one_max_expansion_size.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for catch_sigint_signal.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for use_implied_bounds.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for polish_lp_solution.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for lp_primal_tolerance.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for lp_dual_tolerance.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for convert_intervals.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for symmetry_level.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for new_linear_propagation.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for linear_split_size.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for linearization_level.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for boolean_encoding_level.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_domain_size_when_encoding_eq_neq_constraints.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_num_cuts.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for cut_level.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for only_add_cuts_at_level_zero.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for add_objective_cut.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for add_cg_cuts.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for add_mir_cuts.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for add_zero_half_cuts.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for add_clique_cuts.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for add_rlt_cuts.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_all_diff_cut_size.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for add_lin_max_cuts.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_integer_rounding_scaling.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for add_lp_constraints_lazily.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for root_lp_iterations.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for min_orthogonality_for_lp_constraints.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_cut_rounds_at_level_zero.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for max_consecutive_inactive_count.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for cut_max_active_count_value.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for cut_active_count_decay.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for cut_cleanup_target.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for new_constraints_batch_size.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for exploit_integer_lp_solution.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for exploit_all_lp_solution.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for exploit_best_solution.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for exploit_relaxation_solution.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for exploit_objective.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for detect_linearized_product.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for mip_max_bound.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for mip_var_scaling.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for mip_scale_large_domain.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for mip_automatically_scale_variables.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for only_solve_ip.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for mip_wanted_precision.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for mip_max_activity_exponent.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for mip_check_precision.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for mip_compute_true_objective_bound.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for mip_max_valid_magnitude.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for mip_treat_high_magnitude_bounds_as_infinity.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for mip_drop_tolerance.
685 def getter(self): 686 # TODO: This may be broken since there may not be 687 # default_value. Combine with has_default_value somehow. 688 return self._fields.get(field, default_value)
Getter for mip_presolve_level.
1253 def FindInitializationErrors(self): 1254 """Finds required fields which are not initialized. 1255 1256 Returns: 1257 A list of strings. Each string is a path to an uninitialized field from 1258 the top-level message, e.g. "foo.bar[5].baz". 1259 """ 1260 1261 errors = [] # simplify things 1262 1263 for field in required_fields: 1264 if not self.HasField(field.name): 1265 errors.append(field.name) 1266 1267 for field, value in self.ListFields(): 1268 if field.cpp_type == _FieldDescriptor.CPPTYPE_MESSAGE: 1269 if field.is_extension: 1270 name = '(%s)' % field.full_name 1271 else: 1272 name = field.name 1273 1274 if _IsMapField(field): 1275 if _IsMessageMapField(field): 1276 for key in value: 1277 element = value[key] 1278 prefix = '%s[%s].' % (name, key) 1279 sub_errors = element.FindInitializationErrors() 1280 errors += [prefix + error for error in sub_errors] 1281 else: 1282 # ScalarMaps can't have any initialization errors. 1283 pass 1284 elif field.label == _FieldDescriptor.LABEL_REPEATED: 1285 for i in range(len(value)): 1286 element = value[i] 1287 prefix = '%s[%d].' % (name, i) 1288 sub_errors = element.FindInitializationErrors() 1289 errors += [prefix + error for error in sub_errors] 1290 else: 1291 prefix = name + '.' 1292 sub_errors = value.FindInitializationErrors() 1293 errors += [prefix + error for error in sub_errors] 1294 1295 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".
Inherited Members
- google.protobuf.message.Message
- CopyFrom
- ParseFromString
- HasExtension
- ClearExtension