Google's Operations Research tools:
This report presents the forensic synthetic code analysis of google/or-tools, a C++ project with 13,775 GitHub stars. SynthScan v2.0 examined 445,118 lines of code across 1751 source files, recording 5081 pattern matches distributed across 20 syntactic categories. The overall adjusted score of 14.1 places this repository in the Low AI signal band.
The scanner applied 160+ deterministic lexical heuristics, multi-line block detectors, abstract syntax tree depth profilers, and a cross-file Jaccard similarity matrix to construct a statistically normalised synthetic code estimate. All matches are individually weighted by severity coefficient and contextual multiplier before summation, and the resulting headline score is temporally discounted to account for the repository's development history relative to the commercial emergence of large language model coding tooling (November 2022 onward).
This chart maps the temporal evolution of the adjusted synthetic code score across successive scan runs. An upward trajectory indicates ongoing incorporation of AI-generated code or expanding LLM-assisted scaffolding; a stable or declining trajectory may reflect active human refactoring, code removal, or the adoption of stricter authorship policies. The dashed secondary line (right axis) independently tracks total raw pattern hit count, which can diverge from the normalised score when codebase size changes significantly between scans.
Classifies detected patterns by their diagnostic confidence and structural impact. CRITICAL patterns (coefficient 10) represent definitive synthetic signatures — hallucinated imports, explicit LLM attribution metadata — virtually never produced by human authors. HIGH (5) indicates strong structural tells such as cross-file repetition or cross-linguistic idioms. MEDIUM (2) covers recognisable conversational padding and AI-specific vocabulary. LOW (1) captures subtle indicators like tautological comments and generic boilerplate that require density to carry independent signal.
This horizontal bar chart decomposes the repository's raw synthetic code score by top-level directory, allowing you to pinpoint precisely which modules or components carry the highest AI authorship density. Directories with disproportionately high scores relative to their size warrant targeted manual review: concentrated AI signatures often trace back to mass-generated configuration layers, auto-ported test suites, LLM-scaffolded boilerplate classes, or entire subsystems authored under heavy copilot assistance. Use this view to prioritise your human code-review effort.
The scanner identified 5081 distinct pattern matches across 20 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a statistically significant AI authorship indicator. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.
Reading the findings table: The Severity column indicates the diagnostic confidence level (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — comment-context matches receive a ×1.5 weight because LLMs systematically over-annotate. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier as dense clusters constitute far stronger evidence of synthetic authorship than isolated hits.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | CMakeLists.txt | 1 | # Copyright 2010-2025 Google LLC | COMMENT |
| LOW | .cmake-format.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | .cmake-format.py | 101 | # A list of command names which should always be wrapped | COMMENT |
| LOW | .cmake-format.py | 141 | COMMENT | |
| LOW | tools/check_python_deps.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | tools/generate_all_notebooks.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/find_dependencies.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/export_to_ipynb.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | tools/cross_compile.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/docker/python/build-musllinux.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/docker/python/build-manylinux.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/docker/docs/generate_image.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/build_delivery_macos.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/test_delivery_manylinux_arm64.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/build_delivery_manylinux_amd64.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/publish_delivery_manylinux_amd64.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/publish_delivery_macos.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/publish_delivery_meta.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/test_delivery_linux.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/test_delivery_macos.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/test_delivery_manylinux_amd64.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/build_delivery_manylinux_arm64.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/publish_delivery_manylinux_arm64.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/build_delivery_meta.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/publish_delivery_linux.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/release/build_delivery_linux.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | tools/testing/bintest_script_runner_test.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | tools/testing/bintest_run_utils_test.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | tools/testing/bintest_run_utils.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | tools/testing/print_args_test.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | tools/testing/bintest_script_runner.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | tools/testing/bintest_script_launcher.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | tools/testing/binary_test.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | tools/testing/bintest_matchers.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | tools/testing/README.md | 41 | // --fail: If present, the program will exit with a non-zero status code. | COMMENT |
| LOW | tools/testing/bintest_matchers_test.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | tools/doc/doxygen_filter.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | cmake/host.CMakeLists.txt | 1 | # Copyright 2010-2025 Google LLC | COMMENT |
| LOW | cmake/host.CMakeLists.txt | 21 | # Parameters: | COMMENT |
| LOW | cmake/dependencies/CMakeLists.txt | 1 | # Copyright 2010-2025 Google LLC | COMMENT |
| LOW | cmake/docs/generate_image.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | cmake/samples/python/sample.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | …les/java/src/test/java/com/google/ortools/AppTest.java | 1 | // Copyright 2010-2025 Google LLC | COMMENT |
| LOW | …samples/java/src/main/java/com/google/ortools/App.java | 1 | // Copyright 2010-2025 Google LLC | COMMENT |
| LOW | cmake/samples/dotnet/RoutingSample.cs | 1 | // Copyright 2010-2025 Google LLC | COMMENT |
| LOW | cmake/samples/dotnet/LPSample.cs | 1 | // Copyright 2010-2025 Google LLC | COMMENT |
| LOW | cmake/samples/dotnet/SATSample.cs | 1 | // Copyright 2010-2025 Google LLC | COMMENT |
| LOW | cmake/samples/dotnet/CPSample.cs | 1 | // Copyright 2010-2025 Google LLC | COMMENT |
| LOW | cmake/samples/cpp/CMakeLists.txt | 1 | # Copyright 2010-2025 Google LLC | COMMENT |
| LOW | cmake/samples/cpp/main.cpp | 1 | // Copyright 2010-2025 Google LLC | COMMENT |
| LOW | cmake/samples/glop/CMakeLists.txt | 1 | # Copyright 2010-2025 Google LLC | COMMENT |
| LOW | cmake/samples/glop/main.cpp | 1 | // Copyright 2010-2025 Google LLC | COMMENT |
| LOW | makefiles/docs/generate_image.sh | 1 | #!/usr/bin/env bash | COMMENT |
| LOW | examples/python/gate_scheduling_sat.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | examples/python/prize_collecting_tsp.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | examples/python/transit_time.py | 1 | #!/usr/bin/env python | COMMENT |
| LOW | examples/python/clustering_sat.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | examples/python/music_playlist_sat.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | examples/python/music_playlist_sat.py | 101 | COMMENT | |
| LOW | examples/python/music_playlist_sat.py | 141 | model = cp_model.CpModel() | COMMENT |
| 3587 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | tools/check_python_deps.py | 122 | # Create the logger | COMMENT |
| MEDIUM⚡ | examples/python/gate_scheduling_sat.py | 68 | # Create main interval. | COMMENT |
| MEDIUM⚡ | examples/python/gate_scheduling_sat.py | 78 | # Create an optional copy of interval to be executed on machine 0. | COMMENT |
| MEDIUM⚡ | examples/python/gate_scheduling_sat.py | 88 | # Create an optional copy of interval to be executed on machine 1. | COMMENT |
| MEDIUM | examples/python/prize_collecting_tsp.py | 68 | # Create a console solution printer. | COMMENT |
| MEDIUM | examples/python/prize_collecting_tsp.py | 108 | # Create the routing index manager. | COMMENT |
| MEDIUM | examples/python/rcpsp_sat.py | 116 | # Create the model. | COMMENT |
| MEDIUM | examples/python/rcpsp_sat.py | 182 | # Create the duration variable from the accumulated durations. | COMMENT |
| MEDIUM | examples/python/rcpsp_sat.py | 194 | # Create the interval of the task. | COMMENT |
| MEDIUM | examples/python/rcpsp_sat.py | 206 | # Create the demand variable of the task for each resource. | COMMENT |
| MEDIUM | examples/python/rcpsp_sat.py | 223 | # Create the energy expression for (task, resource): | COMMENT |
| MEDIUM | examples/python/vendor_scheduling_sat.py | 68 | # Create the model. | COMMENT |
| MEDIUM | examples/python/weighted_latency_problem_sat.py | 73 | # Create the circuit constraint. | COMMENT |
| MEDIUM | examples/python/magic_sequence_distribute.py | 33 | # Create the solver. | COMMENT |
| MEDIUM | examples/python/magic_sequence_distribute.py | 36 | # Create an array of IntVars to hold the answers. | COMMENT |
| MEDIUM | examples/python/prize_collecting_tsp_sat.py | 73 | # Create a console solution printer. | COMMENT |
| MEDIUM | examples/python/prize_collecting_tsp_sat.py | 128 | # Create the circuit constraint. | COMMENT |
| MEDIUM | examples/python/golomb_sat.py | 43 | # Create the model. | COMMENT |
| MEDIUM | examples/python/wedding_optimal_chart_sat.py | 142 | # Create the cp model. | COMMENT |
| MEDIUM | examples/python/line_balancing_sat.py | 212 | # Create the variables | COMMENT |
| MEDIUM | examples/python/line_balancing_sat.py | 304 | # Create the variables | COMMENT |
| MEDIUM | examples/python/zebra_sat.py | 44 | # Create the model. | COMMENT |
| MEDIUM | examples/python/steel_mill_slab_sat.py | 192 | # Create the model and the decision variables. | COMMENT |
| MEDIUM | examples/python/steel_mill_slab_sat.py | 385 | # Create the model and the decision variables. | COMMENT |
| MEDIUM | examples/python/task_allocation_sat.py | 283 | # Create a solver and solve the problem. | COMMENT |
| MEDIUM | examples/python/jobshop_with_maintenance_sat.py | 41 | # Create the model. | COMMENT |
| MEDIUM | examples/python/hidato_sat.py | 152 | # Create the model. | COMMENT |
| MEDIUM | examples/python/tsp_sat.py | 77 | # Create the circuit constraint. | COMMENT |
| MEDIUM | examples/python/flexible_job_shop_sat.py | 114 | # Create main interval for the task. | COMMENT |
| MEDIUM | examples/python/sudoku_sat.py | 22 | # Create the model. | COMMENT |
| MEDIUM | examples/python/spread_robots_sat.py | 38 | # Create the list of coordinates (x, y) for each robot. | COMMENT |
| MEDIUM | examples/python/prize_collecting_vrp.py | 68 | # Create a console solution printer. | COMMENT |
| MEDIUM | examples/python/prize_collecting_vrp.py | 116 | # Create the routing index manager. | COMMENT |
| MEDIUM | examples/python/prize_collecting_vrp_sat.py | 73 | # Create a console solution printer. | COMMENT |
| MEDIUM | examples/python/prize_collecting_vrp_sat.py | 139 | # Create the circuit constraint. | COMMENT |
| MEDIUM | examples/python/balance_group_sat.py | 30 | # Create a solution printer. | COMMENT |
| MEDIUM | examples/python/golomb8.py | 34 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/game_theory_taha.py | 32 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/costas_array.py | 69 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/p_median.py | 42 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/diet1.py | 50 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/furniture_moving.py | 84 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/knapsack_cp.py | 38 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/organize_day.py | 50 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/curious_set_of_integers.py | 71 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/nqueens2.py | 32 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/strimko2.py | 52 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/nqueens.py | 28 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/regular.py | 170 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/regular_table2.py | 147 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/circuit.py | 87 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/nqueens3.py | 34 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/futoshiki.py | 52 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/3_jugs_regular.py | 125 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/3_jugs_mip.py | 35 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/all_interval.py | 61 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/magic_square.py | 29 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/set_partition.py | 72 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/who_killed_agatha.py | 91 | # Create the solver. | COMMENT |
| MEDIUM | examples/contrib/labeled_dice.py | 54 | # Create the solver. | COMMENT |
| 203 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tools/testing/bintest_script_runner_test.py | 29 | def execute_with_script_content(self, content: str): | CODE |
| LOW | tools/testing/bintest_script_runner_test.py | 38 | def test_non_existing_script_path(self): | CODE |
| LOW | tools/testing/bintest_script_runner_test.py | 65 | def test_run_inexistent_binary(self): | CODE |
| LOW | tools/testing/bintest_script_runner_test.py | 91 | def test_run_and_unquoted_check(self): | CODE |
| LOW⚡ | tools/testing/bintest_run_utils_test.py | 27 | def test_get_path_env_var_not_set(self): | CODE |
| LOW⚡ | tools/testing/bintest_run_utils_test.py | 34 | def test_get_path_env_var_set_and_file_exists(self): | CODE |
| LOW⚡ | tools/testing/bintest_run_utils_test.py | 39 | def test_get_path_env_var_set_and_file_does_not_exists(self): | CODE |
| LOW | tools/testing/bintest_run_utils_test.py | 66 | def test_run_with_arg_expansion(self, mock_run): | CODE |
| LOW | tools/testing/bintest_run_utils_test.py | 89 | def test_run_with_stderr_redirect(self, mock_run): | CODE |
| LOW⚡ | tools/testing/print_args_test.py | 30 | def test_run_get_single_float(self): | CODE |
| LOW⚡ | tools/testing/print_args_test.py | 36 | def test_check_text_and_extract_float(self): | CODE |
| LOW⚡ | tools/testing/print_args_test.py | 42 | def test_check_extract_several_floats(self): | CODE |
| LOW | tools/testing/binary_test.py | 114 | def assert_has_line_with_prefixed_number(self, prefix: str, log: str) -> float: | CODE |
| LOW⚡ | tools/testing/README.md | 180 | def test_run_get_single_float(self): | CODE |
| LOW⚡ | tools/testing/README.md | 186 | def test_check_text_and_extract_float(self): | CODE |
| LOW⚡ | tools/testing/README.md | 192 | def test_check_extract_several_floats(self): | CODE |
| LOW | examples/python/horse_jumping_show.py | 117 | def generate_horse_jumping_show_data() -> HorseJumpingShowData: | CODE |
| LOW | examples/python/arc_flow_cutting_stock_sat.py | 240 | def solve_cutting_stock_with_arc_flow_and_sat(output_proto_file: str, params: str): | CODE |
| LOW | examples/python/arc_flow_cutting_stock_sat.py | 326 | def solve_cutting_stock_with_arc_flow_and_mip(): | CODE |
| LOW | examples/python/spillover_sat.py | 126 | def _random_spillover_problem( | CODE |
| LOW | examples/python/appointments.py | 57 | def enumerate_all_knapsacks_with_repetition( | CODE |
| LOW | examples/python/appointments.py | 88 | def aggregate_item_collections_optimally( | CODE |
| LOW | examples/python/wedding_optimal_chart_sat.py | 133 | def solve_with_discrete_model() -> None: | CODE |
| LOW | examples/python/maximize_combinations_sat.py | 24 | def maximize_combinations_sat() -> None: | CODE |
| LOW | examples/python/bus_driver_scheduling_flow_sat.py | 1665 | def find_minimum_number_of_drivers(shifts, params): | CODE |
| LOW | examples/python/pentominoes_sat.py | 109 | def generate_and_solve_problem(pieces: Dict[str, List[List[int]]]) -> None: | CODE |
| LOW | examples/python/line_balancing_sat.py | 187 | def solve_problem_with_boolean_model( | CODE |
| LOW | examples/python/line_balancing_sat.py | 280 | def solve_problem_with_scheduling_model( | CODE |
| LOW | examples/python/steel_mill_slab_sat.py | 359 | def steel_mill_slab_with_valid_slabs(problem_id: int, break_symmetries: bool) -> None: | CODE |
| LOW | examples/python/steel_mill_slab_sat.py | 495 | def steel_mill_slab_with_column_generation(problem_id: int) -> None: | CODE |
| LOW | …machine_scheduling_with_setup_release_due_dates_sat.py | 54 | def single_machine_scheduling(): | CODE |
| LOW | examples/python/memory_layout_and_infeasibility_sat.py | 85 | def solve_soft_model_with_assumptions() -> None: | CODE |
| LOW | examples/python/memory_layout_and_infeasibility_sat.py | 128 | def solve_soft_model_with_maximization(params: str) -> None: | CODE |
| LOW | examples/python/knapsack_2d_sat.py | 72 | def solve_with_duplicate_items( | STRING |
| LOW | examples/python/knapsack_2d_sat.py | 181 | def solve_with_duplicate_optional_items( | CODE |
| LOW⚡ | examples/python/car_sequencing_optimization_sat.py | 128 | def solve_car_sequencing_optimization() -> None: | CODE |
| LOW | examples/python/tasks_and_workers_assignment_sat.py | 37 | def tasks_and_workers_assignment_sat() -> None: | CODE |
| LOW | examples/python/shift_scheduling_sat.py | 61 | def add_soft_sequence_constraint( | CODE |
| LOW | ortools/set_cover/python/set_cover_test.py | 20 | def create_initial_cover_model(): | CODE |
| LOW | ortools/set_cover/python/set_cover_test.py | 34 | def create_knights_cover_model(num_rows: int, num_cols: int) -> set_cover.SetCoverModel: | CODE |
| LOW | ortools/set_cover/python/set_cover_test.py | 131 | def test_knights_cover_creation(self): | CODE |
| LOW | ortools/set_cover/python/set_cover_test.py | 135 | def test_knights_cover_greedy(self): | CODE |
| LOW | ortools/set_cover/python/set_cover_test.py | 153 | def test_knights_cover_degree(self): | CODE |
| LOW | ortools/set_cover/python/set_cover_test.py | 189 | def test_knights_cover_random(self): | CODE |
| LOW | ortools/set_cover/python/set_cover_test.py | 207 | def test_knights_cover_trivial(self): | CODE |
| LOW | ortools/util/solve_interrupter.h | 125 | // The function RemoveCallbackIfNecessary() can be used to remove the callback | COMMENT |
| LOW | ortools/util/python/pybind_solve_interrupter_test.py | 36 | def test_untriggered_interrupter(self) -> None: | CODE |
| LOW | ortools/util/python/pybind_solve_interrupter_test.py | 48 | def test_triggered_interrupter(self) -> None: | CODE |
| LOW | ortools/util/python/pybind_solve_interrupter_test.py | 92 | def test_remove_existing_target(self) -> None: | CODE |
| LOW | ortools/util/python/pybind_solve_interrupter_test.py | 101 | def test_remove_existing_target_added_twice(self) -> None: | CODE |
| LOW | ortools/util/python/pybind_solve_interrupter_test.py | 119 | def test_remove_existing_target_twice(self) -> None: | CODE |
| LOW | ortools/util/python/solve_interrupter_test.py | 22 | def test_untriggered_interrupter(self) -> None: | CODE |
| LOW | ortools/util/python/solve_interrupter_test.py | 26 | def test_triggered_interrupter(self) -> None: | CODE |
| LOW | ortools/util/python/solve_interrupter_test.py | 39 | def test_remove_existing_target(self) -> None: | CODE |
| LOW | ortools/util/python/solve_interrupter_test.py | 48 | def test_remove_existing_target_added_twice(self) -> None: | CODE |
| LOW | ortools/util/python/solve_interrupter_test.py | 66 | def test_remove_existing_target_twice(self) -> None: | CODE |
| LOW | ortools/util/python/solve_interrupter_test.py | 84 | def test_callback_already_interrupted(self) -> None: | CODE |
| LOW | ortools/util/python/solve_interrupter_test.py | 99 | def test_callback_interruption(self) -> None: | CODE |
| LOW | ortools/util/python/solve_interrupter_test.py | 115 | def test_callback_interruption_after_removal(self) -> None: | CODE |
| LOW | ortools/util/python/solve_interrupter_test.py | 130 | def test_callback_nointerruption(self) -> None: | CODE |
| 542 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | examples/python/transit_time.py | 0 | creates callback to get total times between locations. | STRING |
| HIGH | ortools/constraint_solver/samples/cvrp_reload.py | 0 | creates callback to get total times between locations. | STRING |
| HIGH | ortools/constraint_solver/samples/cvrptw_break.py | 0 | creates callback to get total times between locations. | STRING |
| HIGH | examples/python/integer_programming.py | 0 | integer programming examples that show how to use the apis. | STRING |
| HIGH | ortools/linear_solver/samples/simple_mip_program.py | 0 | integer programming examples that show how to use the apis. | STRING |
| HIGH | ortools/linear_solver/samples/simple_mip_program_mb.py | 0 | integer programming examples that show how to use the apis. | STRING |
| HIGH | examples/python/chemical_balance_lp.py | 0 | we are trying to group items in equal sized groups. each item has a color and a value. we want the sum of values of each | STRING |
| HIGH | examples/python/chemical_balance_sat.py | 0 | we are trying to group items in equal sized groups. each item has a color and a value. we want the sum of values of each | STRING |
| HIGH | examples/python/balance_group_sat.py | 0 | we are trying to group items in equal sized groups. each item has a color and a value. we want the sum of values of each | STRING |
| HIGH | examples/contrib/regular.py | 0 | global constraint regular in google cp solver. this is a translation of minizinc's regular constraint (defined in lib/zi | STRING |
| HIGH | examples/contrib/regular_table2.py | 0 | global constraint regular in google cp solver. this is a translation of minizinc's regular constraint (defined in lib/zi | STRING |
| HIGH | examples/contrib/regular_table.py | 0 | global constraint regular in google cp solver. this is a translation of minizinc's regular constraint (defined in lib/zi | STRING |
| HIGH | examples/contrib/regular.py | 0 | it is, however, translated from the comet model: * comet: http://www.hakank.org/comet/regular.co here we test with the f | STRING |
| HIGH | examples/contrib/regular_table2.py | 0 | it is, however, translated from the comet model: * comet: http://www.hakank.org/comet/regular.co here we test with the f | STRING |
| HIGH | examples/contrib/regular_table.py | 0 | it is, however, translated from the comet model: * comet: http://www.hakank.org/comet/regular.co here we test with the f | STRING |
| HIGH | examples/contrib/regular.py | 0 | * the sequence of values in array 'x' (which must all be in the range 1..s) * is accepted by the dfa of 'q' states with | STRING |
| HIGH | examples/contrib/regular_table2.py | 0 | * the sequence of values in array 'x' (which must all be in the range 1..s) * is accepted by the dfa of 'q' states with | STRING |
| HIGH | examples/contrib/3_jugs_regular.py | 0 | * the sequence of values in array 'x' (which must all be in the range 1..s) * is accepted by the dfa of 'q' states with | STRING |
| HIGH | examples/contrib/contiguity_regular.py | 0 | * the sequence of values in array 'x' (which must all be in the range 1..s) * is accepted by the dfa of 'q' states with | STRING |
| HIGH | examples/contrib/nonogram_table.py | 0 | * the sequence of values in array 'x' (which must all be in the range 1..s) * is accepted by the dfa of 'q' states with | STRING |
| HIGH | examples/contrib/regular_table.py | 0 | * the sequence of values in array 'x' (which must all be in the range 1..s) * is accepted by the dfa of 'q' states with | STRING |
| HIGH | examples/contrib/nonogram_regular.py | 0 | * the sequence of values in array 'x' (which must all be in the range 1..s) * is accepted by the dfa of 'q' states with | STRING |
| HIGH | examples/contrib/nurse_rostering.py | 0 | * the sequence of values in array 'x' (which must all be in the range 1..s) * is accepted by the dfa of 'q' states with | STRING |
| HIGH | examples/contrib/nurse_rostering_regular.cs | 0 | * the sequence of values in array 'x' (which must all be in the range 1..s) * is accepted by the dfa of 'q' states with | STRING |
| HIGH | examples/contrib/3_jugs_regular.cs | 0 | * the sequence of values in array 'x' (which must all be in the range 1..s) * is accepted by the dfa of 'q' states with | STRING |
| HIGH | examples/contrib/contiguity_regular.cs | 0 | * the sequence of values in array 'x' (which must all be in the range 1..s) * is accepted by the dfa of 'q' states with | STRING |
| HIGH | examples/contrib/regex.cs | 0 | * the sequence of values in array 'x' (which must all be in the range 1..s) * is accepted by the dfa of 'q' states with | STRING |
| HIGH | examples/contrib/volsay.py | 0 | volsay problem in google or-tools. from the opl model volsay.mod using arrays. this model was created by hakan kjellerst | STRING |
| HIGH | examples/contrib/blending.py | 0 | volsay problem in google or-tools. from the opl model volsay.mod using arrays. this model was created by hakan kjellerst | STRING |
| HIGH | examples/contrib/volsay2.py | 0 | volsay problem in google or-tools. from the opl model volsay.mod using arrays. this model was created by hakan kjellerst | STRING |
| HIGH | examples/contrib/volsay3.py | 0 | volsay problem in google or-tools. from the opl model volsay.mod using arrays. this model was created by hakan kjellerst | STRING |
| HIGH | examples/contrib/nonogram_table.py | 0 | nonogram (painting by numbers) in google cp solver. http://en.wikipedia.org/wiki/nonogram | STRING |
| HIGH | examples/contrib/nonogram_regular.py | 0 | nonogram (painting by numbers) in google cp solver. http://en.wikipedia.org/wiki/nonogram | STRING |
| HIGH | examples/contrib/nonogram_default_search.py | 0 | nonogram (painting by numbers) in google cp solver. http://en.wikipedia.org/wiki/nonogram | STRING |
| HIGH | examples/contrib/nonogram_table2.py | 0 | nonogram (painting by numbers) in google cp solver. http://en.wikipedia.org/wiki/nonogram | STRING |
| HIGH | examples/contrib/nonogram_table.py | 0 | see problem 12 at http://www.csplib.org/. http://www.puzzlemuseum.com/nonogram.htm haskell solution: http://twan.home.fm | STRING |
| HIGH | examples/contrib/nonogram_regular.py | 0 | see problem 12 at http://www.csplib.org/. http://www.puzzlemuseum.com/nonogram.htm haskell solution: http://twan.home.fm | STRING |
| HIGH | examples/contrib/nonogram_table2.py | 0 | see problem 12 at http://www.csplib.org/. http://www.puzzlemuseum.com/nonogram.htm haskell solution: http://twan.home.fm | STRING |
| HIGH | examples/contrib/steel_lns.py | 0 | post the load constraint on bins. constraints forall j: loadvars[j] == sum_i (binvars[i] == j) * weights[i]) | STRING |
| HIGH | examples/contrib/bacp.py | 0 | post the load constraint on bins. constraints forall j: loadvars[j] == sum_i (binvars[i] == j) * weights[i]) | STRING |
| HIGH | examples/contrib/steel.py | 0 | post the load constraint on bins. constraints forall j: loadvars[j] == sum_i (binvars[i] == j) * weights[i]) | STRING |
| HIGH | ortools/sat/docs/scheduling.md | 0 | code sample to demonstrates how to build an optional interval. | STRING |
| HIGH | ortools/sat/samples/interval_sample_sat.py | 0 | code sample to demonstrates how to build an optional interval. | STRING |
| HIGH | ortools/sat/samples/optional_interval_sample_sat.py | 0 | code sample to demonstrates how to build an optional interval. | STRING |
| HIGH | ortools/sat/docs/boolean_logic.md | 0 | encoding of the product of two boolean variables. p == x * y, which is the same as p <=> x and y | STRING |
| HIGH | ortools/sat/docs/integer_arithmetic.md | 0 | encoding of the product of two boolean variables. p == x * y, which is the same as p <=> x and y | STRING |
| HIGH | ortools/sat/samples/boolean_product_sample_sat.py | 0 | encoding of the product of two boolean variables. p == x * y, which is the same as p <=> x and y | STRING |
| HIGH | …ols/sat/samples/bool_and_int_var_product_sample_sat.py | 0 | encoding of the product of two boolean variables. p == x * y, which is the same as p <=> x and y | STRING |
| HIGH | ortools/sat/docs/solver.md | 0 | minimal cp-sat example to showcase calling the solver. | STRING |
| HIGH | ortools/sat/docs/README.md | 0 | minimal cp-sat example to showcase calling the solver. | STRING |
| HIGH | ortools/sat/samples/simple_sat_program.py | 0 | minimal cp-sat example to showcase calling the solver. | STRING |
| HIGH | ortools/sat/samples/solve_with_time_limit_sample_sat.py | 0 | minimal cp-sat example to showcase calling the solver. | STRING |
| HIGH | ortools/sat/samples/cp_sat_example.py | 0 | minimal cp-sat example to showcase calling the solver. | STRING |
| HIGH | ortools/math_opt/python/linear_constraints.py | 0 | returns the name, or a string containing the id if the name is empty. | STRING |
| HIGH | ortools/math_opt/python/variables.py | 0 | returns the name, or a string containing the id if the name is empty. | STRING |
| HIGH | ortools/math_opt/python/indicator_constraints.py | 0 | returns the name, or a string containing the id if the name is empty. | STRING |
| HIGH | ortools/math_opt/python/quadratic_constraints.py | 0 | returns the name, or a string containing the id if the name is empty. | STRING |
| HIGH | ortools/constraint_solver/docs/routing_svg.py | 0 | returns the manhattan distance between the two nodes. | STRING |
| HIGH | …/constraint_solver/samples/vrp_pickup_delivery_fifo.py | 0 | returns the manhattan distance between the two nodes. | STRING |
| HIGH | ortools/constraint_solver/samples/tsp.py | 0 | returns the manhattan distance between the two nodes. | STRING |
| 7 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | tools/testing/bintest_run_utils.py | 26 | Returns the path to a file from an environment variable. Args: label: The label to access the path to the fil | STRING |
| HIGH | tools/testing/bintest_run_utils.py | 59 | Runs the command denoted by args. Args: binary: The path to the binary to execute. *args: Arguments of | STRING |
| HIGH | tools/testing/binary_test.py | 35 | Runs a command, expanding $(label) expressions, and returns the output. `binary` and `args` can contain express | STRING |
| HIGH | tools/testing/binary_test.py | 67 | Runs a command, expanding $(label) expressions, and asserts that it fails. `binary` and `args` can contain expr | STRING |
| HIGH | tools/testing/binary_test.py | 90 | Extracts floating point numbers from a log string based on patterns. Patterns are applied sequentially. Each pa | STRING |
| HIGH | tools/testing/bintest_matchers.py | 96 | Parses a binary operator and a value into a check function. Args: op: The binary operator string (e.g., '<', | STRING |
| HIGH | tools/testing/bintest_matchers.py | 120 | Parses a specification string into a float checking function. The spec can define almost equality (e.g., "1.0~0.1") | STRING |
| HIGH | tools/testing/bintest_matchers.py | 187 | Extracts and optionally checks numbers from a log string based on patterns. Each pattern can contain "@num(spec)" k | STRING |
| HIGH | ortools/util/python/solve_interrupter.py | 77 | Returns a context manager that (un)register the provided callback. The callback is immediately called if the in | STRING |
| HIGH | ortools/sat/python/cp_model.py | 391 | Creates a series of (scalar-valued) variables with the given name. Args: name (str): Required. The na | STRING |
| HIGH | ortools/sat/python/cp_model.py | 447 | Creates a series of (scalar-valued) variables with the given name. Args: name (str): Required. The na | STRING |
| HIGH | ortools/sat/python/cp_model.py | 510 | Adds a `BoundedLinearExpression` to the model. Args: ct: A [`BoundedLinearExpression`](#boundedlinear | STRING |
| HIGH | ortools/sat/python/cp_model.py | 579 | Adds Circuit(arcs). Adds a circuit constraint from a sparse list of arcs that encode the graph. A circ | STRING |
| HIGH | ortools/sat/python/cp_model.py | 605 | Adds a multiple circuit constraint, aka the 'VRP' constraint. The direct graph where arc #i (from tails[i] to h | STRING |
| HIGH | ortools/sat/python/cp_model.py | 637 | Adds AllowedAssignments(expressions, tuples_list). An AllowedAssignments constraint is a constraint on an array | STRING |
| HIGH | ortools/sat/python/cp_model.py | 671 | Adds add_forbidden_assignments(expressions, [tuples_list]). A ForbiddenAssignments constraint is a constraint o | STRING |
| HIGH | ortools/sat/python/cp_model.py | 706 | Adds an automaton constraint. An automaton constraint takes a list of affine expressions (a * var + b) (of | STRING |
| HIGH | ortools/sat/python/cp_model.py | 771 | Adds Inverse(variables, inverse_variables). An inverse constraint enforces that if `variables[i]` is assigned a | STRING |
| HIGH | ortools/sat/python/cp_model.py | 804 | Adds Reservoir(times, level_changes, min_level, max_level). Maintains a reservoir level within bounds. The wate | STRING |
| HIGH | ortools/sat/python/cp_model.py | 855 | Adds Reservoir(times, level_changes, actives, min_level, max_level). Maintains a reservoir level within bounds. | STRING |
| HIGH | ortools/sat/python/cp_model.py | 1126 | Creates a series of interval variables with the given name. Args: name (str): Required. The name of t | STRING |
| HIGH | ortools/sat/python/cp_model.py | 1195 | Creates a series of interval variables with the given name. Args: name (str): Required. The name of t | STRING |
| HIGH | ortools/sat/python/cp_model.py | 1279 | Creates a series of interval variables with the given name. Args: name (str): Required. The name of t | STRING |
| HIGH | ortools/sat/python/cp_model.py | 1367 | Creates a series of interval variables with the given name. Args: name (str): Required. The name of t | STRING |
| HIGH | ortools/sat/python/cp_model.py | 1792 | Returns the values of the input variables. If `variables` is a `pd.Index`, then the output will be indexed by t | STRING |
| HIGH | ortools/sat/python/cp_model.py | 1820 | Returns the float values of the input linear expressions. If `expressions` is a `pd.Index`, then the output wil | STRING |
| HIGH | ortools/sat/python/cp_model.py | 1850 | Returns the values of the input variables. If `variables` is a `pd.Index`, then the output will be indexed by t | STRING |
| HIGH | ortools/sat/python/cp_model.py | 2120 | Returns the boolean value of a boolean literal. Args: lit: A boolean variable or its negation. | STRING |
| HIGH | ortools/sat/python/cp_model.py | 2136 | Evaluates an linear expression in the current solution. Args: expression: a linear expression of th | STRING |
| HIGH | ortools/sat/python/cp_model.py | 2153 | Evaluates an linear expression in the current solution. Args: expression: a linear expression of th | STRING |
| HIGH | ortools/math_opt/python/callback.py | 105 | Creates a CallbackData from an equivalent proto. Args: cb_data: A protocol buffer with the information the us | STRING |
| HIGH | ortools/math_opt/python/result.py | 516 | The variable values from the best primal feasible solution. An error will be raised if there are no primal feas | STRING |
| HIGH | ortools/math_opt/python/result.py | 582 | The variable values from the first primal ray. An error will be raised if there are no primal rays. Ar | STRING |
| HIGH | ortools/math_opt/python/result.py | 648 | The dual values associated to the best solution. If there is at least one primal feasible solution, this corres | STRING |
| HIGH | ortools/math_opt/python/result.py | 702 | The reduced costs associated to the best solution. If there is at least one primal feasible solution, this corr | STRING |
| HIGH | ortools/math_opt/python/result.py | 767 | The dual values from the first dual ray. An error will be raised if there are no dual rays. Args: | STRING |
| HIGH | ortools/math_opt/python/result.py | 816 | The reduced costs from the first dual ray. An error will be raised if there are no dual rays. Args: | STRING |
| HIGH | ortools/math_opt/python/result.py | 879 | The constraint basis status associated to the best solution. If there is at least one primal feasible solution, | STRING |
| HIGH | ortools/math_opt/python/result.py | 934 | The variable basis status associated to the best solution. If there is at least one primal feasible solution, t | STRING |
| HIGH | ortools/math_opt/python/solve.py | 50 | Solves an optimization model. Thread-safety: this function must not be called while modifying the Model (adding | STRING |
| HIGH | ortools/math_opt/python/solve.py | 225 | Solves the current optimization model. Args: params: The non-model specific solve parameters. | STRING |
| HIGH | ortools/math_opt/python/model_parameters.py | 81 | Returns an equivalent SolutionHint to `hint_proto`. Args: hint_proto: The solution, as encoded by the ids of | STRING |
| HIGH | ortools/math_opt/python/elemental/elemental.py | 119 | Removes `elements` from the model, returning true elementwise on success. A value of false is returned when an | STRING |
| HIGH | ortools/math_opt/python/elemental/elemental.py | 148 | Returns the name of each element in `elements`. Note that elements have a default name of '' if no name is prov | STRING |
| HIGH | ortools/math_opt/python/elemental/elemental.py | 229 | Returns the attribute value for a key. The type of the attribute determines the number of elements in the key a | STRING |
| HIGH | ortools/math_opt/python/elemental/elemental.py | 253 | Returns the values of an attribute for a list of keys. Repeated keys are okay. Args: attr: T | STRING |
| HIGH | ortools/math_opt/python/elemental/elemental.py | 279 | Returns which keys take a value different from the attribute's default. Repeated keys are okay. Args: | STRING |
| HIGH | ortools/math_opt/python/elemental/elemental.py | 312 | Returns the keys with a non-default value for an attribute along a slice. Args: attr: The attribute t | STRING |
| HIGH | ortools/math_opt/python/elemental/elemental.py | 335 | Returns a ModelProto equivalent to this model. Args: remove_names: If True, exclude names (e.g. varia | STRING |
| HIGH | ortools/math_opt/python/elemental/elemental.py | 371 | Returns a ModelUpdateProto with the changes for the Diff `diff_id`. Args: diff_id: The id of the Diff | STRING |
| HIGH | ortools/math_opt/python/ipc/remote_http_solve.py | 45 | Solves a MathOpt model via HTTP request to the OR API. Args: model: The optimization model. solver_type | STRING |
| HIGH | ortools/math_opt/python/ipc/remote_http_solve.py | 123 | Builds a JSON payload. Args: model: The optimization model. solver_type: The underlying solver to use. | STRING |
| HIGH | ortools/math_opt/python/ipc/remote_http_solve.py | 160 | Parses a JSON representation of a response to a SolveResult object. Args: json_response: bytes representing t | STRING |
| HIGH | ortools/math_opt/python/ipc/proto_converter.py | 41 | Converts a `SolveRequest` to a `SolveMathOptModelRequest`. Args: request: A `SolveRequest` request built from | STRING |
| HIGH | ortools/math_opt/samples/python/facility_lp_benders.py | 407 | Build and return a feasibility cut. If the second stage problem is infeasible we get a dual ray (r, y) such | STRING |
| HIGH | ortools/math_opt/samples/python/facility_lp_benders.py | 461 | Build and return an optimality cut. If the second stage problem is optimal we get a dual solution (r, y) such | STRING |
| HIGH | …ols/math_opt/samples/python/time_indexed_scheduling.py | 139 | Solves a time indexed scheduling problem, returning the best schedule. Args: jobs: The jobs to be scheduled, | STRING |
| HIGH | ortools/math_opt/samples/python/cutting_stock.py | 141 | Solves the worker problem. Solves the problem on finding the configuration (with its objective value) to add th | STRING |
| HIGH | ortools/math_opt/samples/python/cutting_stock.py | 186 | Solves the full cutting stock problem by decomposition. Args: instance: A cutting stock instance. Return | STRING |
| HIGH | ortools/linear_solver/python/model_builder.py | 71 | Creates a new linear constraint in the helper. It handles boolean values (which might arise in the construction of | STRING |
| 7 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | .cmake-format.py | 15 | # ---------------------------------- | COMMENT |
| MEDIUM | .cmake-format.py | 17 | # ---------------------------------- | COMMENT |
| MEDIUM | .cmake-format.py | 40 | # ----------------------------- | COMMENT |
| MEDIUM | .cmake-format.py | 42 | # ----------------------------- | COMMENT |
| MEDIUM | .cmake-format.py | 122 | # ------------------------------------------------ | COMMENT |
| MEDIUM | .cmake-format.py | 124 | # ------------------------------------------------ | COMMENT |
| MEDIUM | .cmake-format.py | 166 | # ---------------------------- | COMMENT |
| MEDIUM | .cmake-format.py | 168 | # ---------------------------- | COMMENT |
| MEDIUM | .cmake-format.py | 223 | # ------------------------------- | COMMENT |
| MEDIUM | .cmake-format.py | 225 | # ------------------------------- | COMMENT |
| MEDIUM | .cmake-format.py | 238 | # ------------------------------------- | COMMENT |
| MEDIUM | .cmake-format.py | 240 | # ------------------------------------- | COMMENT |
| MEDIUM | examples/python/music_playlist_sat.py | 38 | # -------------------- | COMMENT |
| MEDIUM | examples/python/music_playlist_sat.py | 40 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/music_playlist_sat.py | 138 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/music_playlist_sat.py | 140 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/music_playlist_sat.py | 143 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/music_playlist_sat.py | 145 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/music_playlist_sat.py | 149 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/music_playlist_sat.py | 151 | # -------------------- | COMMENT |
| MEDIUM | examples/python/music_playlist_sat.py | 200 | # -------------------- | COMMENT |
| MEDIUM | examples/python/music_playlist_sat.py | 202 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/music_playlist_sat.py | 248 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/music_playlist_sat.py | 250 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/music_playlist_sat.py | 256 | # ----------------------- | COMMENT |
| MEDIUM⚡ | examples/python/music_playlist_sat.py | 258 | # ----------------------- | COMMENT |
| MEDIUM | …machine_scheduling_with_setup_release_due_dates_sat.py | 22 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM | …machine_scheduling_with_setup_release_due_dates_sat.py | 37 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM | …machine_scheduling_with_setup_release_due_dates_sat.py | 60 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM | …machine_scheduling_with_setup_release_due_dates_sat.py | 377 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM | …machine_scheduling_with_setup_release_due_dates_sat.py | 382 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | …machine_scheduling_with_setup_release_due_dates_sat.py | 404 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | …machine_scheduling_with_setup_release_due_dates_sat.py | 408 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | …machine_scheduling_with_setup_release_due_dates_sat.py | 415 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | …machine_scheduling_with_setup_release_due_dates_sat.py | 421 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM | …machine_scheduling_with_setup_release_due_dates_sat.py | 442 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | …machine_scheduling_with_setup_release_due_dates_sat.py | 477 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | …machine_scheduling_with_setup_release_due_dates_sat.py | 483 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | …machine_scheduling_with_setup_release_due_dates_sat.py | 489 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | …machine_scheduling_with_setup_release_due_dates_sat.py | 496 | # ---------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | examples/python/car_sequencing_optimization_sat.py | 131 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/car_sequencing_optimization_sat.py | 133 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/car_sequencing_optimization_sat.py | 164 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/car_sequencing_optimization_sat.py | 166 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/car_sequencing_optimization_sat.py | 169 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/car_sequencing_optimization_sat.py | 171 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/car_sequencing_optimization_sat.py | 179 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/car_sequencing_optimization_sat.py | 181 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/car_sequencing_optimization_sat.py | 214 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/car_sequencing_optimization_sat.py | 216 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/car_sequencing_optimization_sat.py | 219 | # -------------------- | COMMENT |
| MEDIUM⚡ | examples/python/car_sequencing_optimization_sat.py | 221 | # -------------------- | COMMENT |
| MEDIUM | examples/contrib/scheduling_with_transitions_sat.py | 13 | #---------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/contrib/scheduling_with_transitions_sat.py | 25 | #---------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/contrib/scheduling_with_transitions_sat.py | 49 | #---------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | examples/contrib/scheduling_with_transitions_sat.py | 103 | #---------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | examples/contrib/scheduling_with_transitions_sat.py | 110 | #---------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | examples/contrib/scheduling_with_transitions_sat.py | 114 | #---------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/contrib/scheduling_with_transitions_sat.py | 126 | #---------------------------------------------------------------------------- | COMMENT |
| MEDIUM | examples/contrib/scheduling_with_transitions_sat.py | 140 | #---------------------------------------------------------------------------- | COMMENT |
| 6 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tools/check_python_deps.py | 42 | CODE | |
| LOW | tools/check_python_deps.py | 23 | CODE | |
| LOW | tools/check_python_deps.py | 24 | CODE | |
| LOW | tools/check_python_deps.py | 27 | CODE | |
| LOW | tools/check_python_deps.py | 200 | CODE | |
| LOW | tools/check_python_deps.py | 203 | CODE | |
| LOW | tools/check_python_deps.py | 206 | CODE | |
| LOW | tools/check_python_deps.py | 209 | CODE | |
| LOW | tools/testing/bintest_script_runner_test.py | 15 | CODE | |
| LOW | examples/python/transit_time.py | 24 | CODE | |
| LOW | examples/contrib/p_median.py | 36 | CODE | |
| LOW | examples/contrib/furniture_moving.py | 38 | CODE | |
| LOW | examples/contrib/organize_day.py | 34 | CODE | |
| LOW | examples/contrib/3_jugs_regular.py | 51 | CODE | |
| LOW | examples/contrib/ski_assignment.py | 50 | CODE | |
| LOW | examples/contrib/olympic.py | 58 | CODE | |
| LOW | examples/contrib/stable_marriage.py | 40 | CODE | |
| LOW | examples/contrib/check_dependencies.py | 22 | CODE | |
| LOW | examples/contrib/check_dependencies.py | 13 | CODE | |
| LOW | examples/contrib/check_dependencies.py | 13 | CODE | |
| LOW | examples/contrib/check_dependencies.py | 14 | CODE | |
| LOW | examples/contrib/check_dependencies.py | 93 | CODE | |
| LOW | examples/contrib/check_dependencies.py | 94 | CODE | |
| LOW | examples/contrib/check_dependencies.py | 95 | CODE | |
| LOW | examples/contrib/check_dependencies.py | 96 | CODE | |
| LOW | examples/contrib/check_dependencies.py | 113 | CODE | |
| LOW | examples/contrib/check_dependencies.py | 114 | CODE | |
| LOW | examples/contrib/grocery.py | 38 | CODE | |
| LOW | examples/contrib/covering_opl.py | 58 | CODE | |
| LOW | examples/contrib/kakuro.py | 57 | CODE | |
| LOW | examples/contrib/marathon2.py | 49 | CODE | |
| LOW | examples/contrib/lectures.py | 46 | CODE | |
| LOW | examples/contrib/wedding_optimal_chart.py | 17 | CODE | |
| LOW | examples/contrib/killer_sudoku.py | 70 | CODE | |
| LOW | examples/contrib/nurses_cp.py | 1 | CODE | |
| LOW | examples/contrib/max_flow_winston1.py | 30 | CODE | |
| LOW | examples/contrib/traffic_lights.py | 72 | CODE | |
| LOW | examples/contrib/bus_schedule.py | 36 | CODE | |
| LOW | examples/contrib/coins3.py | 41 | CODE | |
| LOW | examples/contrib/rogo2.py | 48 | CODE | |
| LOW | examples/contrib/secret_santa2.py | 63 | CODE | |
| LOW | examples/contrib/mr_smith.py | 49 | CODE | |
| LOW | examples/contrib/sicherman_dice.py | 61 | CODE | |
| LOW | examples/contrib/kenken2.py | 58 | CODE | |
| LOW | examples/contrib/production.py | 24 | CODE | |
| LOW | examples/contrib/secret_santa.py | 62 | CODE | |
| LOW | examples/contrib/place_number_puzzle.py | 42 | CODE | |
| LOW | examples/contrib/combinatorial_auction2.py | 31 | CODE | |
| LOW | examples/contrib/combinatorial_auction2.py | 32 | CODE | |
| LOW | ortools/math_opt/python/mathopt.py | 38 | CODE | |
| LOW | ortools/math_opt/python/mathopt.py | 39 | CODE | |
| LOW | ortools/math_opt/python/mathopt.py | 40 | CODE | |
| LOW | ortools/math_opt/python/mathopt.py | 41 | CODE | |
| LOW | ortools/math_opt/python/mathopt.py | 42 | CODE | |
| LOW | ortools/math_opt/python/mathopt.py | 43 | CODE | |
| LOW | ortools/math_opt/python/mathopt.py | 44 | CODE | |
| LOW | ortools/math_opt/python/mathopt.py | 45 | CODE | |
| LOW | ortools/math_opt/python/mathopt.py | 46 | CODE | |
| LOW | ortools/math_opt/python/mathopt.py | 47 | CODE | |
| LOW | ortools/math_opt/python/mathopt.py | 48 | CODE | |
| 133 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tools/testing/bintest_script_runner.py | 42 | CODE | |
| LOW | examples/python/clustering_sat.py | 68 | CODE | |
| LOW | examples/python/rcpsp_sat.py | 46 | CODE | |
| LOW | examples/python/rcpsp_sat.py | 91 | CODE | |
| LOW | examples/python/horse_jumping_show.py | 144 | CODE | |
| LOW | examples/python/arc_flow_cutting_stock_sat.py | 207 | CODE | |
| LOW | examples/python/weighted_latency_problem_sat.py | 60 | CODE | |
| LOW | examples/python/prize_collecting_tsp_sat.py | 74 | CODE | |
| LOW | examples/python/reallocate_sat.py | 21 | CODE | |
| LOW | examples/python/assignment_with_constraints_sat.py | 22 | CODE | |
| LOW | examples/python/bus_driver_scheduling_sat.py | 1711 | CODE | |
| LOW | examples/python/pentominoes_sat.py | 85 | CODE | |
| LOW | examples/python/pentominoes_sat.py | 109 | CODE | |
| LOW | examples/python/line_balancing_sat.py | 69 | CODE | |
| LOW | examples/python/maze_escape_sat.py | 73 | CODE | |
| LOW | examples/python/jobshop_ft06_sat.py | 32 | CODE | |
| LOW | examples/python/steel_mill_slab_sat.py | 160 | CODE | |
| LOW | examples/python/steel_mill_slab_sat.py | 359 | CODE | |
| LOW | examples/python/cover_rectangle_sat.py | 22 | CODE | |
| LOW | examples/python/jobshop_ft06_distance_sat.py | 39 | CODE | |
| LOW | examples/python/hidato_sat.py | 23 | CODE | |
| LOW | examples/python/hidato_sat.py | 81 | CODE | |
| LOW | examples/python/tsp_sat.py | 65 | CODE | |
| LOW | examples/python/flexible_job_shop_sat.py | 49 | CODE | |
| LOW | examples/python/sudoku_sat.py | 20 | CODE | |
| LOW | examples/python/prize_collecting_vrp_sat.py | 74 | CODE | |
| LOW | examples/python/prize_collecting_vrp_sat.py | 125 | CODE | |
| LOW | examples/python/no_wait_baking_scheduling_sat.py | 197 | CODE | |
| LOW | examples/python/car_sequencing_optimization_sat.py | 128 | CODE | |
| LOW | examples/python/tasks_and_workers_assignment_sat.py | 37 | CODE | |
| LOW | examples/python/shift_scheduling_sat.py | 206 | CODE | |
| LOW | examples/contrib/costas_array.py | 67 | CODE | |
| LOW | examples/contrib/nqueens2.py | 31 | CODE | |
| LOW | examples/contrib/nqueens.py | 27 | CODE | |
| LOW | examples/contrib/regular.py | 115 | CODE | |
| LOW | examples/contrib/regular_table2.py | 92 | CODE | |
| LOW | examples/contrib/nqueens3.py | 33 | CODE | |
| LOW | examples/contrib/set_partition.py | 70 | CODE | |
| LOW | examples/contrib/labeled_dice.py | 52 | CODE | |
| LOW | examples/contrib/nonogram_table.py | 140 | CODE | |
| LOW | examples/contrib/nonogram_table.py | 223 | CODE | |
| LOW | examples/contrib/regular_table.py | 108 | CODE | |
| LOW | examples/contrib/young_tableaux.py | 67 | CODE | |
| LOW | examples/contrib/scheduling_with_transitions_sat.py | 42 | CODE | |
| LOW | examples/contrib/kakuro.py | 79 | CODE | |
| LOW | examples/contrib/nonogram_regular.py | 144 | CODE | |
| LOW | examples/contrib/nonogram_regular.py | 227 | CODE | |
| LOW | examples/contrib/marathon2.py | 53 | CODE | |
| LOW | examples/contrib/wedding_optimal_chart.py | 43 | CODE | |
| LOW | examples/contrib/set_covering3.py | 51 | CODE | |
| LOW | examples/contrib/minesweeper.py | 77 | CODE | |
| LOW | examples/contrib/rostering_with_travel.py | 4 | CODE | |
| LOW | examples/contrib/crew.py | 44 | CODE | |
| LOW | examples/contrib/photo_problem.py | 53 | CODE | |
| LOW | examples/contrib/assignment.py | 36 | CODE | |
| LOW | examples/contrib/school_scheduling_sat.py | 80 | CODE | |
| LOW | examples/contrib/school_scheduling_sat.py | 182 | CODE | |
| LOW | examples/contrib/school_scheduling_sat.py | 197 | CODE | |
| LOW | examples/contrib/school_scheduling_sat.py | 215 | CODE | |
| LOW | examples/contrib/max_flow_winston1.py | 34 | CODE | |
| 51 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | examples/python/nqueens_sat.py | 75 | # different, so we just add the all different constraint on the rows. | COMMENT |
| MEDIUM | ortools/util/strong_integers.h | 19 | // other operations from other similar integer-like types. Essentially, the | COMMENT |
| MEDIUM | ortools/util/return_macros.h | 19 | // It is not perfect, but more robust than crashing right away. | COMMENT |
| MEDIUM | ortools/pdlp/test_util.h | 296 | // to the first mismatched element if they do not. Essentially an elementwise | COMMENT |
| MEDIUM | ortools/pdlp/test_util.h | 324 | // within 4 units of least precision (ULP) in float precision. Essentially an | COMMENT |
| MEDIUM | ortools/graph/hamiltonian_path.h | 805 | // make the algorithm not robust because of precision issues. | COMMENT |
| MEDIUM | ortools/graph/hamiltonian_path.h | 955 | // to utilize cache as possible. | COMMENT |
| MEDIUM | ortools/graph/linear_assignment.h | 146 | // Reduced cost: Essentially an arc's reduced cost is its | COMMENT |
| MEDIUM | ortools/sat/linear_constraint_manager.h | 365 | // are robust to collisions because we always relies on the ground truth | COMMENT |
| MEDIUM | ortools/sat/integer.h | 1073 | // TODO(user): Not really robust, try to find a better way. | COMMENT |
| MEDIUM | …ls/sat/samples/transitions_in_no_overlap_sample_sat.py | 158 | # Creates intervals, all present. But the cost is robust w.r.t. optional | COMMENT |
| MEDIUM | ortools/lp_data/lp_data.h | 499 | // does look more robust. | COMMENT |
| MEDIUM | ortools/constraint_solver/routing_filters.h | 1039 | // A straightforward computation would best leverage SIMD instructions when | COMMENT |
| MEDIUM | ortools/constraint_solver/constraint_solver.h | 4219 | /// robust to domain changes. Hole iterators can also report values outside | COMMENT |
| MEDIUM | ortools/base/int_type.h | 17 | // other operations from other similar integer-like types. Essentially, the | COMMENT |
| MEDIUM | ortools/base/int_type.h | 126 | // The following bad usage is permissible although discouraged. Essentially, it | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH⚡ | ortools/sat/python/cp_model.py | 299 | if value_or_series.index.equals(index): | CODE |
| HIGH | ortools/linear_solver/python/model_builder.py | 1403 | if value_or_series.index.equals(index): | CODE |
| HIGH | ortools/linear_solver/python/model_builder.py | 1431 | if var_or_series.index.equals(index): | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | examples/cpp/cgc.h | 27 | // Example usage: | COMMENT |
| LOW | ortools/bop/bop_solver.h | 30 | // Usage example: | COMMENT |
| LOW | ortools/util/stats.h | 16 | // Usage example: | COMMENT |
| LOW | ortools/graph/assignment.h | 25 | // Example usage: | COMMENT |
| LOW | ortools/graph/linear_assignment.h | 31 | // Example usage: | COMMENT |
| LOW | ortools/math_opt/tools/file_format_flags.h | 89 | // Usage example: | COMMENT |
| LOW | ortools/math_opt/tools/file_format_flags.h | 103 | // Usage example: | COMMENT |
| LOW | ortools/math_opt/tools/file_format_flags.h | 130 | // Usage example: | COMMENT |
| LOW | ortools/math_opt/core/sparse_submatrix.h | 50 | // Usage example: | COMMENT |
| LOW | ortools/math_opt/cpp/enums.h | 98 | // Usage example: | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | ortools/graph/shortest_paths.h | 647 | // In this implementation the distance of a node to itself isn't necessarily | COMMENT |
| HIGH | ortools/graph/linear_assignment.h | 131 | // eligible to be pushed from. In this implementation, every active | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | ortools/math_opt/python/linear_constraints.py | 103 | def set_coefficient(self, var: variables.Variable, coefficient: float) -> None: | CODE |
| LOW | ortools/math_opt/python/objectives.py | 131 | def set_linear_coefficient(self, var: variables.Variable, coef: float) -> None: | CODE |
| LOW | ortools/math_opt/python/objectives.py | 239 | def set_to_linear_expression(self, linear_expr: variables.LinearTypes) -> None: | CODE |
| LOW | ortools/math_opt/python/objectives.py | 274 | def set_to_expression(self, expr: variables.QuadraticTypes) -> None: | CODE |
| LOW | ortools/math_opt/python/objectives.py | 320 | def set_linear_coefficient(self, var: variables.Variable, coef: float) -> None: | CODE |
| LOW | ortools/math_opt/python/objectives.py | 471 | def set_linear_coefficient(self, var: variables.Variable, coef: float) -> None: | CODE |
| LOW⚡ | ortools/linear_solver/python/model_builder.py | 1206 | def set_time_limit_in_seconds(self, limit: NumberT) -> None: | CODE |
| LOW⚡ | ortools/linear_solver/python/model_builder.py | 1210 | def set_solver_specific_parameters(self, parameters: str) -> None: | CODE |
| LOW | ortools/linear_solver/python/model_builder.py | 282 | def set_coefficient(self, var: Variable, coeff: NumberT) -> None: | CODE |
| LOW | ortools/linear_solver/python/model_builder.py | 426 | def set_coefficient(self, var: Variable, coeff: NumberT) -> None: | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tools/check_python_deps.py | 196 | # Check if python can load the libraries' modules | COMMENT |
| LOW | examples/contrib/check_dependencies.py | 90 | # Check if python can load the libraries' modules | COMMENT |
| LOW | examples/contrib/check_dependencies.py | 112 | #Check if the protobuf modules were successfully generated | COMMENT |
| LOW | ortools/math_opt/python/message_callback.py | 22 | # Print messages to stdout. | STRING |
| LOW | …s/linear_solver/samples/integer_programming_example.py | 83 | # Print the value of each variable in the solution. | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | ortools/sat/integer_expr.h | 221 | // Complexity: This is a basic implementation in O(num_vars) on each call to | COMMENT |
| LOW | ortools/math_opt/core/solver_interface_mock.h | 59 | // To simulate a error in the instantiation of the solver, don't forget to use | COMMENT |
| MEDIUM | ortools/constraint_solver/routing.h | 112 | Here is a simple example solving a traveling salesman problem given a cost | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tools/testing/bintest_script_runner.py | 67 | except Exception as e: | CODE |
| LOW | ortools/util/python/solve_interrupter.py | 110 | except Exception as e: # pylint: disable=broad-exception-caught | CODE |
| MEDIUM | ortools/sat/docs/integer_arithmetic.md | 1437 | print('Something went wrong. Please check the status and the log') | CODE |
| MEDIUM | …ls/sat/samples/all_different_except_zero_sample_sat.py | 82 | print("Something went wrong. Please check the status and the log") | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | ortools/set_cover/set_cover_cft.h | 137 | // NOTE: This function contains one of the two O(nnz) subgradient steps | COMMENT |
| LOW | ortools/pdlp/iteration_stats.h | 47 | // NOTE: This function assumes that `scaled_primal_solution` satisfies the | COMMENT |
| LOW | ortools/math_opt/core/model_summary.h | 237 | // NOTE: This function is only exposed in the header because we need | COMMENT |
| LOW | ortools/constraint_solver/routing_lp_scheduling.h | 687 | // NOTE: This function is not implemented for the CP-SAT solver. | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | CMakeLists.txt | 14 | # This file is just an orchestration | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | ortools/math_opt/core/python/solver_test.py | 45 | CODE | |
| LOW | ortools/math_opt/python/model.py | 335 | CODE | |
| LOW | ortools/math_opt/python/model.py | 344 | CODE | |
| LOW | ortools/math_opt/python/solve.py | 37 | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | ortools/linear_solver/python/model_builder.py | 222 | def helper(self) -> mbh.ModelBuilderHelper: | CODE |
| LOW | ortools/linear_solver/python/model_builder.py | 343 | def helper(self) -> mbh.ModelBuilderHelper: | CODE |
| LOW | ortools/linear_solver/python/model_builder.py | 1181 | def helper(self) -> mbh.ModelBuilderHelper: | CODE |