update include guards

Author: Mizux

examples/cpp/course_scheduling.h

@@ -11,8 +11,8 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-#ifndef OR_TOOLS_EXAMPLES_COURSE_SCHEDULING_H_
-#define OR_TOOLS_EXAMPLES_COURSE_SCHEDULING_H_
+#ifndef ORTOOLS_EXAMPLES_COURSE_SCHEDULING_H_
+#define ORTOOLS_EXAMPLES_COURSE_SCHEDULING_H_
 
 #include <utility>
 #include <vector>
@@ -83,4 +83,4 @@ class CourseSchedulingSolver {
 
 }  // namespace operations_research
 
-#endif  // OR_TOOLS_EXAMPLES_COURSE_SCHEDULING_H_
+#endif  // ORTOOLS_EXAMPLES_COURSE_SCHEDULING_H_

examples/cpp/fap_model_printer.h

@@ -14,8 +14,8 @@
 // Prints a model of Frequency Assignment Problem.
 // Format: http://www.inra.fr/mia/T/schiex/Doc/CELAR.shtml#synt
 
-#ifndef OR_TOOLS_EXAMPLES_FAP_MODEL_PRINTER_H_
-#define OR_TOOLS_EXAMPLES_FAP_MODEL_PRINTER_H_
+#ifndef ORTOOLS_EXAMPLES_FAP_MODEL_PRINTER_H_
+#define ORTOOLS_EXAMPLES_FAP_MODEL_PRINTER_H_
 
 #include <string>
 #include <vector>
@@ -51,4 +51,4 @@ class FapModelPrinter {
 };
 
 }  // namespace operations_research
-#endif  // OR_TOOLS_EXAMPLES_FAP_MODEL_PRINTER_H_
+#endif  // ORTOOLS_EXAMPLES_FAP_MODEL_PRINTER_H_

examples/cpp/fap_parser.h

@@ -14,8 +14,8 @@
 // Reading and parsing the data of Frequency Assignment Problem
 // Format: http://www.inra.fr/mia/T/schiex/Doc/CELAR.shtml#synt
 
-#ifndef OR_TOOLS_EXAMPLES_FAP_PARSER_H_
-#define OR_TOOLS_EXAMPLES_FAP_PARSER_H_
+#ifndef ORTOOLS_EXAMPLES_FAP_PARSER_H_
+#define ORTOOLS_EXAMPLES_FAP_PARSER_H_
 
 #include <string>
 #include <vector>
@@ -230,4 +230,4 @@ void ParseInstance(const std::string& data_directory, bool find_components,
                    std::string* objective, std::vector<int>* frequencies,
                    absl::flat_hash_map<int, FapComponent>* components);
 }  // namespace operations_research
-#endif  // OR_TOOLS_EXAMPLES_FAP_PARSER_H_
+#endif  // ORTOOLS_EXAMPLES_FAP_PARSER_H_

examples/cpp/fap_utilities.h

@@ -13,8 +13,8 @@
 
 // Utilities used by frequency_assignment_problem.cc.
 
-#ifndef OR_TOOLS_EXAMPLES_FAP_UTILITIES_H_
-#define OR_TOOLS_EXAMPLES_FAP_UTILITIES_H_
+#ifndef ORTOOLS_EXAMPLES_FAP_UTILITIES_H_
+#define ORTOOLS_EXAMPLES_FAP_UTILITIES_H_
 
 #include <cstdint>
 #include <vector>
@@ -66,4 +66,4 @@ void PrintResultsSoft(SolutionCollector* collector,
                       absl::Span<const int> key_from_index);
 
 }  // namespace operations_research
-#endif  // OR_TOOLS_EXAMPLES_FAP_UTILITIES_H_
+#endif  // ORTOOLS_EXAMPLES_FAP_UTILITIES_H_

examples/cpp/parse_dimacs_assignment.h

@@ -15,8 +15,8 @@
 // http://lpsolve.sourceforge.net/5.5/DIMACS_asn.htm
 //
 
-#ifndef OR_TOOLS_EXAMPLES_PARSE_DIMACS_ASSIGNMENT_H_
-#define OR_TOOLS_EXAMPLES_PARSE_DIMACS_ASSIGNMENT_H_
+#ifndef ORTOOLS_EXAMPLES_PARSE_DIMACS_ASSIGNMENT_H_
+#define ORTOOLS_EXAMPLES_PARSE_DIMACS_ASSIGNMENT_H_
 
 #include <algorithm>
 #include <cinttypes>
@@ -252,4 +252,4 @@ LinearSumAssignment<GraphType>* DimacsAssignmentParser<GraphType>::Parse(
 
 }  // namespace operations_research
 
-#endif  // OR_TOOLS_EXAMPLES_PARSE_DIMACS_ASSIGNMENT_H_
+#endif  // ORTOOLS_EXAMPLES_PARSE_DIMACS_ASSIGNMENT_H_

examples/cpp/print_dimacs_assignment.h

@@ -14,8 +14,8 @@
 // Function for outputting an assignment problem in DIMACS format:
 // http://lpsolve.sourceforge.net/5.5/DIMACS_asn.htm
 //
-#ifndef OR_TOOLS_EXAMPLES_PRINT_DIMACS_ASSIGNMENT_H_
-#define OR_TOOLS_EXAMPLES_PRINT_DIMACS_ASSIGNMENT_H_
+#ifndef ORTOOLS_EXAMPLES_PRINT_DIMACS_ASSIGNMENT_H_
+#define ORTOOLS_EXAMPLES_PRINT_DIMACS_ASSIGNMENT_H_
 
 #include <cstdio>
 #include <string>
@@ -60,4 +60,4 @@ void PrintDimacsAssignmentProblem(
 
 }  // namespace operations_research
 
-#endif  // OR_TOOLS_EXAMPLES_PRINT_DIMACS_ASSIGNMENT_H_
+#endif  // ORTOOLS_EXAMPLES_PRINT_DIMACS_ASSIGNMENT_H_

ortools/algorithms/adjustable_k_ary_heap.h

@@ -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_

ortools/algorithms/binary_indexed_tree.h

@@ -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_

ortools/algorithms/binary_search.h

@@ -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_

ortools/algorithms/dense_doubly_linked_list.h

@@ -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_