Use bazel as a build tool

Author: xirc

.devcontainer/.dockerignore

@@ -1,7 +1,6 @@
 {
 	"name": "cp-algorithm",
-	"context": "..",
-	"dockerFile": "Dockerfile",
+	"image": "xirc/cp-algorithm",
 	"runArgs": [
 		"--cap-add=SYS_PTRACE",
 		"--security-opt",
@@ -11,7 +10,8 @@
 		"terminal.integrated.shell.linux": "/bin/bash"
 	},
 	"extensions": [
-		"ms-vscode.cpptools"
+		"ms-vscode.cpptools",
+		"bazelbuild.vscode-bazel"
 	],
 	"postCreateCommand": "g++ -v",
 }

.devcontainer/Dockerfile

@@ -0,0 +1,27 @@
+### https://github.com/bazelbuild/bazel/blob/master/.gitignore
+
+# Ignore backup files.
+*~
+# Ignore Vim swap files.
+.*.swp
+# Ignore files generated by IDEs.
+/.classpath
+/.factorypath
+/.idea/
+/.ijwb/
+/.project
+/.settings
+/.vscode/
+/bazel.iml
+# Ignore all bazel-* symlinks. There is no full list since this can change
+# based on the name of the directory bazel is cloned into.
+/bazel-*
+# Ignore outputs generated during Bazel bootstrapping.
+/output/
+# Ignore jekyll build output.
+/production
+/.sass-cache
+# Bazelisk version file
+.bazelversion
+# User-specific .bazelrc
+user.bazelrc

.devcontainer/devcontainer.json

@@ -0,0 +1,11 @@
+load("@rules_cc//cc:defs.bzl", "cc_library")
+load("//:variables.bzl", "COPTS")
+
+
+cc_library(
+    name = "main",
+    hdrs = glob([ "**/*.hpp" ]),
+    include_prefix = "cpalgo",
+    copts = COPTS,
+    visibility = [ "//visibility:public" ],
+)

lib/.gitignore

@@ -1,4 +1,4 @@
-#pragma
+#pragma once
 
 #include <bits/stdc++.h>
 

lib/BUILD

@@ -1,4 +1,4 @@
-#pragma
+#pragma once
 
 #include <bits/stdc++.h>
 

lib/Makefile

@@ -5,7 +5,7 @@
 
 #include <stack>
 #include <algorithm>
-#include "../data-structure_stack/minimum-stack.hpp"
+#include "minimum-stack.hpp"
 
 // MinimumQueue
 // Memory: O(N)

lib/WORKSPACE

@@ -5,8 +5,8 @@
 
 #include <vector>
 #include <limits>
-#include "../data-structure_union-find-tree/union-find-tree.hpp"
-#include "../data-structure_heap/randomized-heap.hpp"
+#include "cpalgo/ds/union-find-tree.hpp"
+#include "cpalgo/ds/randomized-heap.hpp"
 
 // Minimum Cost Arborescence
 // Memory: O(V + E)

lib/algebra_binary-exponentiation/Makefile

@@ -6,7 +6,7 @@
 #include <vector>
 #include <set>
 #include <algorithm>
-#include "../data-structure_union-find-tree/union-find-tree.hpp"
+#include "cpalgo/ds/union-find-tree.hpp"
 
 // Minimum Spanning Tree
 // Kruskal's Algorithm

lib/algebra_binomial-coefficient/Makefile

@@ -4,7 +4,7 @@
 // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_5_C
 
 #include <vector>
-#include "../data-structure_union-find-tree/union-find-tree.hpp"
+#include "cpalgo/ds/union-find-tree.hpp"
 
 // LCA: Lowest Common Ancestor
 // Memory: O(V + E + Q)