always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update include guards

Browse Source
This commit is contained in:
Corentin Le Molgat
2025-11-05 11:34:49 +01:00
parent 4793e1acb4
commit b4b226801b
571 changed files with 1713 additions and 1713 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
ortools/algorithms/adjustable_k_ary_heap.h
View File

@@ -11,8 +11,8 @@
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef OR_TOOLS_ALGORITHMS_ADJUSTABLE_K_ARY_HEAP_H_
#define OR_TOOLS_ALGORITHMS_ADJUSTABLE_K_ARY_HEAP_H_
#ifndef ORTOOLS_ALGORITHMS_ADJUSTABLE_K_ARY_HEAP_H_
#define ORTOOLS_ALGORITHMS_ADJUSTABLE_K_ARY_HEAP_H_
#include <algorithm>
#include <limits>
@@ -309,4 +309,4 @@ class AdjustableKAryHeap {
const Index kNonExistent = -1;
};
#endif // OR_TOOLS_ALGORITHMS_ADJUSTABLE_K_ARY_HEAP_H_
#endif // ORTOOLS_ALGORITHMS_ADJUSTABLE_K_ARY_HEAP_H_

6
ortools/algorithms/binary_indexed_tree.h
View File

@@ -11,8 +11,8 @@
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef OR_TOOLS_ALGORITHMS_BINARY_INDEXED_TREE_H_
#define OR_TOOLS_ALGORITHMS_BINARY_INDEXED_TREE_H_
#ifndef ORTOOLS_ALGORITHMS_BINARY_INDEXED_TREE_H_
#define ORTOOLS_ALGORITHMS_BINARY_INDEXED_TREE_H_
#include <vector>
@@ -68,4 +68,4 @@ class BinaryIndexedTree {
} // namespace operations_research
#endif // OR_TOOLS_ALGORITHMS_BINARY_INDEXED_TREE_H_
#endif // ORTOOLS_ALGORITHMS_BINARY_INDEXED_TREE_H_

6
ortools/algorithms/binary_search.h
View File

@@ -11,8 +11,8 @@
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef OR_TOOLS_ALGORITHMS_BINARY_SEARCH_H_
#define OR_TOOLS_ALGORITHMS_BINARY_SEARCH_H_
#ifndef ORTOOLS_ALGORITHMS_BINARY_SEARCH_H_
#define ORTOOLS_ALGORITHMS_BINARY_SEARCH_H_
#include <cmath>
#include <cstdint>
@@ -344,4 +344,4 @@ std::pair<Point, Value> ConvexMinimum(bool is_to_the_right,
}
} // namespace operations_research
#endif // OR_TOOLS_ALGORITHMS_BINARY_SEARCH_H_
#endif // ORTOOLS_ALGORITHMS_BINARY_SEARCH_H_

6
ortools/algorithms/dense_doubly_linked_list.h
View File

@@ -11,8 +11,8 @@
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef OR_TOOLS_ALGORITHMS_DENSE_DOUBLY_LINKED_LIST_H_
#define OR_TOOLS_ALGORITHMS_DENSE_DOUBLY_LINKED_LIST_H_
#ifndef ORTOOLS_ALGORITHMS_DENSE_DOUBLY_LINKED_LIST_H_
#define ORTOOLS_ALGORITHMS_DENSE_DOUBLY_LINKED_LIST_H_
#include <vector>
@@ -94,4 +94,4 @@ DenseDoublyLinkedList::DenseDoublyLinkedList(const T& elements)
} // namespace operations_research
#endif // OR_TOOLS_ALGORITHMS_DENSE_DOUBLY_LINKED_LIST_H_
#endif // ORTOOLS_ALGORITHMS_DENSE_DOUBLY_LINKED_LIST_H_

6
ortools/algorithms/duplicate_remover.h
View File

@@ -11,8 +11,8 @@
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef OR_TOOLS_ALGORITHMS_DUPLICATE_REMOVER_H_
#define OR_TOOLS_ALGORITHMS_DUPLICATE_REMOVER_H_
#ifndef ORTOOLS_ALGORITHMS_DUPLICATE_REMOVER_H_
#define ORTOOLS_ALGORITHMS_DUPLICATE_REMOVER_H_
#include <cstddef>
#include <cstdint>
@@ -139,4 +139,4 @@ inline void DenseIntDuplicateRemover::Truncate(
} // namespace operations_research
#endif // OR_TOOLS_ALGORITHMS_DUPLICATE_REMOVER_H_
#endif // ORTOOLS_ALGORITHMS_DUPLICATE_REMOVER_H_

6
ortools/algorithms/dynamic_partition.h
View File

@@ -27,8 +27,8 @@
// code is responsible for using this class properly. A few DCHECKs() will help
// catch bugs, though.
#ifndef OR_TOOLS_ALGORITHMS_DYNAMIC_PARTITION_H_
#define OR_TOOLS_ALGORITHMS_DYNAMIC_PARTITION_H_
#ifndef ORTOOLS_ALGORITHMS_DYNAMIC_PARTITION_H_
#define ORTOOLS_ALGORITHMS_DYNAMIC_PARTITION_H_
#include <cstdint>
#include <string>
@@ -401,4 +401,4 @@ inline std::vector<absl::Span<const T>> SimpleDynamicPartition::GetParts(
}
} // namespace operations_research
#endif // OR_TOOLS_ALGORITHMS_DYNAMIC_PARTITION_H_
#endif // ORTOOLS_ALGORITHMS_DYNAMIC_PARTITION_H_

6
ortools/algorithms/dynamic_permutation.h
View File

@@ -11,8 +11,8 @@
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef OR_TOOLS_ALGORITHMS_DYNAMIC_PERMUTATION_H_
#define OR_TOOLS_ALGORITHMS_DYNAMIC_PERMUTATION_H_
#ifndef ORTOOLS_ALGORITHMS_DYNAMIC_PERMUTATION_H_
#define ORTOOLS_ALGORITHMS_DYNAMIC_PERMUTATION_H_
#include <memory>
#include <set> // TODO(user): remove when no longer used.
@@ -132,4 +132,4 @@ inline int DynamicPermutation::RootOf(int i) const {
} // namespace operations_research
#endif // OR_TOOLS_ALGORITHMS_DYNAMIC_PERMUTATION_H_
#endif // ORTOOLS_ALGORITHMS_DYNAMIC_PERMUTATION_H_

6
ortools/algorithms/find_graph_symmetries.h
View File

@@ -21,8 +21,8 @@
//
// See the comments on the class below for more details.
#ifndef OR_TOOLS_ALGORITHMS_FIND_GRAPH_SYMMETRIES_H_
#define OR_TOOLS_ALGORITHMS_FIND_GRAPH_SYMMETRIES_H_
#ifndef ORTOOLS_ALGORITHMS_FIND_GRAPH_SYMMETRIES_H_
#define ORTOOLS_ALGORITHMS_FIND_GRAPH_SYMMETRIES_H_
#include <cstdint>
#include <memory>
@@ -353,4 +353,4 @@ void LocalBfs(const ::util::StaticGraph<int, int>& graph, int source,
} // namespace operations_research
#endif // OR_TOOLS_ALGORITHMS_FIND_GRAPH_SYMMETRIES_H_
#endif // ORTOOLS_ALGORITHMS_FIND_GRAPH_SYMMETRIES_H_

6
ortools/algorithms/hungarian.h
View File

@@ -19,8 +19,8 @@
// The code also enables computing a maximum assignment by changing the
// input matrix.
#ifndef OR_TOOLS_ALGORITHMS_HUNGARIAN_H_
#define OR_TOOLS_ALGORITHMS_HUNGARIAN_H_
#ifndef ORTOOLS_ALGORITHMS_HUNGARIAN_H_
#define ORTOOLS_ALGORITHMS_HUNGARIAN_H_
#include <vector>
@@ -43,4 +43,4 @@ void MaximizeLinearAssignment(
} // namespace operations_research
#endif // OR_TOOLS_ALGORITHMS_HUNGARIAN_H_
#endif // ORTOOLS_ALGORITHMS_HUNGARIAN_H_

6
ortools/algorithms/knapsack_solver.h
View File

@@ -11,8 +11,8 @@
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef OR_TOOLS_ALGORITHMS_KNAPSACK_SOLVER_H_
#define OR_TOOLS_ALGORITHMS_KNAPSACK_SOLVER_H_
#ifndef ORTOOLS_ALGORITHMS_KNAPSACK_SOLVER_H_
#define ORTOOLS_ALGORITHMS_KNAPSACK_SOLVER_H_
#include <cstdint>
#include <memory>
@@ -718,4 +718,4 @@ class KnapsackGenericSolver : public BaseKnapsackSolver {
#endif // SWIG
} // namespace operations_research
#endif // OR_TOOLS_ALGORITHMS_KNAPSACK_SOLVER_H_
#endif // ORTOOLS_ALGORITHMS_KNAPSACK_SOLVER_H_

6
ortools/algorithms/n_choose_k.h
View File

@@ -11,8 +11,8 @@
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef OR_TOOLS_ALGORITHMS_N_CHOOSE_K_H_
#define OR_TOOLS_ALGORITHMS_N_CHOOSE_K_H_
#ifndef ORTOOLS_ALGORITHMS_N_CHOOSE_K_H_
#define ORTOOLS_ALGORITHMS_N_CHOOSE_K_H_
#include <cstdint>
@@ -32,4 +32,4 @@ namespace operations_research {
absl::StatusOr<int64_t> NChooseK(int64_t n, int64_t k);
} // namespace operations_research
#endif // OR_TOOLS_ALGORITHMS_N_CHOOSE_K_H_
#endif // ORTOOLS_ALGORITHMS_N_CHOOSE_K_H_

6
ortools/algorithms/python/knapsack_solver_doc.h
View File

@@ -11,8 +11,8 @@
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef OR_TOOLS_ALGORITHMS_PYTHON_KNAPSACK_SOLVER_DOC_H_
#define OR_TOOLS_ALGORITHMS_PYTHON_KNAPSACK_SOLVER_DOC_H_
#ifndef ORTOOLS_ALGORITHMS_PYTHON_KNAPSACK_SOLVER_DOC_H_
#define ORTOOLS_ALGORITHMS_PYTHON_KNAPSACK_SOLVER_DOC_H_
/*
This file contains docstrings for use in the Python bindings.
@@ -298,4 +298,4 @@ static const char* __doc_operations_research_KnapsackState_is_in_2 =
#pragma GCC diagnostic pop
#endif
#endif // OR_TOOLS_ALGORITHMS_PYTHON_KNAPSACK_SOLVER_DOC_H_
#endif // ORTOOLS_ALGORITHMS_PYTHON_KNAPSACK_SOLVER_DOC_H_

6
ortools/algorithms/radix_sort.h
View File

@@ -11,8 +11,8 @@
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef OR_TOOLS_ALGORITHMS_RADIX_SORT_H_
#define OR_TOOLS_ALGORITHMS_RADIX_SORT_H_
#ifndef ORTOOLS_ALGORITHMS_RADIX_SORT_H_
#define ORTOOLS_ALGORITHMS_RADIX_SORT_H_
// This can be MUCH faster than std::sort() on numerical arrays (int32_t, float,
// int64_t, double, ..), when the size is ≥8k:
@@ -348,4 +348,4 @@ void RadixSort(absl::Span<T> values, int num_bits) {
} // namespace operations_research
#endif // OR_TOOLS_ALGORITHMS_RADIX_SORT_H_
#endif // ORTOOLS_ALGORITHMS_RADIX_SORT_H_

6
ortools/algorithms/space_saving_most_frequent.h
View File

@@ -11,8 +11,8 @@
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef OR_TOOLS_ALGORITHMS_SPACE_SAVING_MOST_FREQUENT_H_
#define OR_TOOLS_ALGORITHMS_SPACE_SAVING_MOST_FREQUENT_H_
#ifndef ORTOOLS_ALGORITHMS_SPACE_SAVING_MOST_FREQUENT_H_
#define ORTOOLS_ALGORITHMS_SPACE_SAVING_MOST_FREQUENT_H_
#include <cstddef>
#include <cstdint>
@@ -505,4 +505,4 @@ class DoubleLinkedList {
} // namespace operations_research
#endif // OR_TOOLS_ALGORITHMS_SPACE_SAVING_MOST_FREQUENT_H_
#endif // ORTOOLS_ALGORITHMS_SPACE_SAVING_MOST_FREQUENT_H_

6
ortools/algorithms/sparse_permutation.h
View File

@@ -11,8 +11,8 @@
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef OR_TOOLS_ALGORITHMS_SPARSE_PERMUTATION_H_
#define OR_TOOLS_ALGORITHMS_SPARSE_PERMUTATION_H_
#ifndef ORTOOLS_ALGORITHMS_SPARSE_PERMUTATION_H_
#define ORTOOLS_ALGORITHMS_SPARSE_PERMUTATION_H_
#include <string>
#include <vector>
@@ -157,4 +157,4 @@ void SparsePermutation::ApplyToDenseCollection(Collection& span) const {
} // namespace operations_research
#endif // OR_TOOLS_ALGORITHMS_SPARSE_PERMUTATION_H_
#endif // ORTOOLS_ALGORITHMS_SPARSE_PERMUTATION_H_