Add using std::size_t

lxylxy123456 · May 15, 2021 · 60f60a5 · 60f60a5
1 parent 1f19363
commit 60f60a5
Show file tree

Hide file tree

Showing 96 changed files with 192 additions and 0 deletions.
diff --git a/include/ActivitySelector.hpp b/include/ActivitySelector.hpp
@@ -25,6 +25,8 @@
 #include <iostream>
 #include <vector>
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/AllPairsShortestPaths.hpp b/include/AllPairsShortestPaths.hpp
@@ -23,6 +23,8 @@
 
 #include "Graph.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/AnySegmentsIntersect.hpp b/include/AnySegmentsIntersect.hpp
@@ -26,6 +26,8 @@
 #include "RedBlackTree.hpp"
 #include "SegmentsIntersect.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 /*

diff --git a/include/ApproxMinWeightVC.hpp b/include/ApproxMinWeightVC.hpp
@@ -22,6 +22,8 @@
 #include "Graph.hpp"
 #include "Simplex.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename GT, typename T, typename WT>

diff --git a/include/ApproxTSPTour.hpp b/include/ApproxTSPTour.hpp
@@ -24,6 +24,8 @@
 #include "MST.hpp"
 #include "SegmentsIntersect.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename GT, typename T>

diff --git a/include/ApproxVertexCover.hpp b/include/ApproxVertexCover.hpp
@@ -21,6 +21,8 @@
 
 #include "Graph.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename GT, typename T>

diff --git a/include/BFS.hpp b/include/BFS.hpp
@@ -24,6 +24,8 @@
 #include "Graph.hpp"
 #include "Queue.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 enum BFSColor { bfs_white, bfs_gray, bfs_black };

diff --git a/include/BTree.hpp b/include/BTree.hpp
@@ -25,6 +25,8 @@
 #include <string>
 #include <vector>
 
+using std::size_t;
+
 namespace algorithms {
 
 size_t debug;

diff --git a/include/BellmanFord.hpp b/include/BellmanFord.hpp
@@ -23,6 +23,8 @@
 
 #include "Graph.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T, typename WT>

diff --git a/include/BinaryCounter.hpp b/include/BinaryCounter.hpp
@@ -21,6 +21,8 @@
 
 #include <vector>
 
+using std::size_t;
+
 namespace algorithms {
 
 class BinaryCounter {

diff --git a/include/BinarySearchTree.hpp b/include/BinarySearchTree.hpp
@@ -27,6 +27,8 @@
 #include "output_integers.hpp"
 #include "print_ptr.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/BinaryTree.hpp b/include/BinaryTree.hpp
@@ -24,6 +24,8 @@
 
 #include "print_tree.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/BucketSort.hpp b/include/BucketSort.hpp
@@ -25,6 +25,8 @@
 
 #include "InsertSort.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/ChainedHash.hpp b/include/ChainedHash.hpp
@@ -23,6 +23,8 @@
 
 #include "LinkedList.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/ClosestPairPoints.hpp b/include/ClosestPairPoints.hpp
@@ -26,6 +26,8 @@
 
 #include "SegmentsIntersect.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 #define uset_vec typename std::unordered_set<Vector<T>, VectorHash<T>>

diff --git a/include/CountingSort.hpp b/include/CountingSort.hpp
@@ -21,6 +21,8 @@
 
 #include <vector>
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/CutRod.hpp b/include/CutRod.hpp
@@ -25,6 +25,8 @@
 #include <map>
 #include <vector>
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/DFS.hpp b/include/DFS.hpp
@@ -23,6 +23,8 @@
 
 #include "Graph.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 enum DFSColor { dfs_white, dfs_gray, dfs_black };

diff --git a/include/DagShortestPaths.hpp b/include/DagShortestPaths.hpp
@@ -24,6 +24,8 @@
 #include "BellmanFord.hpp"
 #include "TopologicalSort.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename GT, typename T, typename WT>

diff --git a/include/Dijkstra.hpp b/include/Dijkstra.hpp
@@ -24,6 +24,8 @@
 #include "BellmanFord.hpp"
 #include "FibHeap.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename GT, typename T, typename WT>

diff --git a/include/DirectAddress.hpp b/include/DirectAddress.hpp
@@ -21,6 +21,8 @@
 
 #include <cstddef>
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/DisjointSet.hpp b/include/DisjointSet.hpp
@@ -24,6 +24,8 @@
 #include "Graph.hpp"
 #include "ProtovEB.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/DynamicTable.hpp b/include/DynamicTable.hpp
@@ -22,6 +22,8 @@
 #include <algorithm>
 #include <vector>
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/Euclid.hpp b/include/Euclid.hpp
@@ -19,6 +19,8 @@
 #ifndef ALGORITHMS_EUCLID
 #define ALGORITHMS_EUCLID
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/Fib.hpp b/include/Fib.hpp
@@ -21,6 +21,8 @@
 
 #include <thread>
 
+using std::size_t;
+
 namespace algorithms {
 
 size_t Fib(size_t n) {

diff --git a/include/FibHeap.hpp b/include/FibHeap.hpp
@@ -26,6 +26,8 @@
 
 #include "RedBlackTree.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/FindMaximumSubarray.hpp b/include/FindMaximumSubarray.hpp
@@ -22,6 +22,8 @@
 #include <algorithm>
 #include <vector>
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/FiniteAutomatonMatcher.hpp b/include/FiniteAutomatonMatcher.hpp
@@ -24,6 +24,8 @@
 
 #include "NaiveStringMatcher.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/FloydWarshall.hpp b/include/FloydWarshall.hpp
@@ -24,6 +24,8 @@
 
 #include "Graph.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 void PrintAllPairsShortestPath(Matrix<T_ptr<size_t>>& PI, size_t i, size_t j,

diff --git a/include/FordFulkerson.hpp b/include/FordFulkerson.hpp
@@ -24,6 +24,8 @@
 
 #include "BFS.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename GT, typename T, typename WT>

diff --git a/include/GrahamScan.hpp b/include/GrahamScan.hpp
@@ -24,6 +24,8 @@
 
 #include "SegmentsIntersect.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/Graph.hpp b/include/Graph.hpp
@@ -31,6 +31,8 @@
 #include "SquareMatrixMultiply.hpp"
 #include "random_integers.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 #define uset typename std::unordered_set

diff --git a/include/Greedy.hpp b/include/Greedy.hpp
@@ -22,6 +22,8 @@
 #include <map>
 #include <set>
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/GreedySetCover.hpp b/include/GreedySetCover.hpp
@@ -23,6 +23,8 @@
 #include <set>
 #include <vector>
 
+using std::size_t;
+
 namespace algorithms {
 
 #define set_T typename std::set<T>

diff --git a/include/Hash.hpp b/include/Hash.hpp
@@ -23,6 +23,8 @@
 
 #include "random_integers.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 class DivisionHash {

diff --git a/include/HireAssistant.hpp b/include/HireAssistant.hpp
@@ -22,6 +22,8 @@
 #include <cassert>
 #include <vector>
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/Huffman.hpp b/include/Huffman.hpp
@@ -26,6 +26,8 @@
 
 #include "MaxHeap.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/InsertSort.hpp b/include/InsertSort.hpp
@@ -21,6 +21,8 @@
 
 #include <vector>
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/IntervalTree.hpp b/include/IntervalTree.hpp
@@ -25,6 +25,8 @@
 
 #include "RedBlackTree.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/IterativeFFT.hpp b/include/IterativeFFT.hpp
@@ -23,6 +23,8 @@
 
 #include "RecursiveFFT.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 size_t rev(size_t k, size_t n) {

diff --git a/include/JarvisMarch.hpp b/include/JarvisMarch.hpp
@@ -23,6 +23,8 @@
 
 #include "SegmentsIntersect.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/Johnson.hpp b/include/Johnson.hpp
@@ -26,6 +26,8 @@
 #include "Dijkstra.hpp"
 #include "SquareMatrixMultiply.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename GT, typename T, typename WT>

diff --git a/include/KMPMatcher.hpp b/include/KMPMatcher.hpp
@@ -23,6 +23,8 @@
 
 #include "NaiveStringMatcher.hpp"
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>

diff --git a/include/LCSLength.hpp b/include/LCSLength.hpp
@@ -25,6 +25,8 @@
 #include <iostream>
 #include <vector>
 
+using std::size_t;
+
 namespace algorithms {
 
 template <typename T>