Sort and group include directives

landerrosette · Jan 20, 2025 · f376f86 · f376f86
1 parent ff11447
commit f376f86
Show file tree

Hide file tree

Showing 82 changed files with 174 additions and 96 deletions.
diff --git a/AcyclicSP.cpp b/AcyclicSP.cpp
@@ -1,4 +1,5 @@
 #include "AcyclicSP.h"
+
 #include "Topological.h"
 
 AcyclicSP::AcyclicSP(const EdgeWeightedDigraph &G, int s) : SP(G, s) {

diff --git a/BST.h b/BST.h
@@ -2,10 +2,11 @@
 #define ALGS4_BST_H
 
 
-#include "OrderedST.h"
 #include <memory>
 #include <utility>
 
+#include "OrderedST.h"
+
 template<typename Key, typename Value>
 class BST : public OrderedST<Key, Value> {
 protected:

diff --git a/BellmanFordSP.cpp b/BellmanFordSP.cpp
@@ -1,4 +1,5 @@
 #include "BellmanFordSP.h"
+
 #include "DirectedCycle.h"
 
 void BellmanFordSP::onRelaxationSuccess(const EdgeWeightedDigraph &G, int v, const DirectedEdge &e, int w) {

diff --git a/BellmanFordSP.h b/BellmanFordSP.h
@@ -2,9 +2,10 @@
 #define BELLMANFORDSP_H
 
 
-#include "SP.h"
-#include <vector>
 #include <list>
+#include <vector>
+
+#include "SP.h"
 
 class BellmanFordSP : public SP {
 private:

diff --git a/BinarySearchST.h b/BinarySearchST.h
@@ -2,10 +2,11 @@
 #define ALGS4_BINARYSEARCHST_H
 
 
-#include "OrderedST.h"
 #include <optional>
 #include <vector>
 
+#include "OrderedST.h"
+
 template<typename Key, typename Value>
 class BinarySearchST : public OrderedST<Key, Value> {
 private:

diff --git a/BinaryStdIO.cpp b/BinaryStdIO.cpp
@@ -1,4 +1,5 @@
 #include "BinaryStdIO.h"
+
 #include <iostream>
 
 void BinaryStdIO::writeBit(std::byte bit) {

diff --git a/BinaryStdIO.h b/BinaryStdIO.h
@@ -2,8 +2,8 @@
 #define BINARYSTDIO_H
 
 
-#include <string>
 #include <cstddef>
+#include <string>
 
 class BinaryStdIO {
 private:

diff --git a/BoyerMoore.cpp b/BoyerMoore.cpp
@@ -1,4 +1,5 @@
 #include "BoyerMoore.h"
+
 #include <utility>
 
 // Compute skip table.

diff --git a/BoyerMoore.h b/BoyerMoore.h
@@ -2,9 +2,10 @@
 #define BOYERMOORE_H
 
 
-#include "SubstrSearcher.h"
-#include <vector>
 #include <string>
+#include <vector>
+
+#include "SubstrSearcher.h"
 
 class BoyerMoore : public SubstrSearcher {
 private:

diff --git a/BreadthFirstPaths.cpp b/BreadthFirstPaths.cpp
@@ -1,4 +1,5 @@
 #include "BreadthFirstPaths.h"
+
 #include <queue>
 
 void BreadthFirstPaths::bfs(const Graph &G, int s) {

diff --git a/CCBase.h b/CCBase.h
@@ -2,9 +2,10 @@
 #define ALGS4_CCBASE_H
 
 
-#include "GraphBase.h"
 #include <vector>
 
+#include "GraphBase.h"
+
 class CCBase {
 protected:
     std::vector<bool> marked;

diff --git a/DepthFirstOrder.h b/DepthFirstOrder.h
@@ -2,11 +2,12 @@
 #define ALGS4_DEPTHFIRSTORDER_H
 
 
-#include "GraphBase.h"
 #include <list>
+#include <type_traits>
 #include <vector>
+
 #include "DirectedEdge.h"
-#include <type_traits>
+#include "GraphBase.h"
 
 class DepthFirstOrder {
 private:

diff --git a/Digraph.h b/Digraph.h
@@ -2,9 +2,10 @@
 #define ALGS4_DIGRAPH_H
 
 
-#include "GraphBase.h"
 #include <iostream>
 
+#include "GraphBase.h"
+
 class Digraph : public GraphBase<int> {
 public:
     explicit Digraph(int V) : GraphBase(V) {}

diff --git a/DijkstraSP.h b/DijkstraSP.h
@@ -2,8 +2,8 @@
 #define DIJKSTRASP_H
 
 
-#include "SP.h"
 #include "IndexMinPQ.h"
+#include "SP.h"
 
 class DijkstraSP : public SP {
 private:

diff --git a/DirectedCycle.h b/DirectedCycle.h
@@ -3,11 +3,12 @@
 
 
 #include <list>
-#include "GraphBase.h"
-#include <vector>
-#include "DirectedEdge.h"
 #include <optional>
 #include <type_traits>
+#include <vector>
+
+#include "DirectedEdge.h"
+#include "GraphBase.h"
 
 template<typename T>
 class DirectedCycle {

diff --git a/DirectedDFS.h b/DirectedDFS.h
@@ -2,9 +2,10 @@
 #define ALGS4_DIRECTEDDFS_H
 
 
-#include "Digraph.h"
-#include <vector>
 #include <list>
+#include <vector>
+
+#include "Digraph.h"
 
 class DirectedDFS {
 private:

diff --git a/DirectedEdge.h b/DirectedEdge.h
@@ -2,9 +2,10 @@
 #define DIRECTEDEDGE_H
 
 
-#include "Edge.h"
-#include <iostream>
 #include <iomanip>
+#include <iostream>
+
+#include "Edge.h"
 
 class DirectedEdge : private Edge {
 public:

diff --git a/Edge.cpp b/Edge.cpp
@@ -1,4 +1,5 @@
 #include "Edge.h"
+
 #include <stdexcept>
 
 int Edge::other(int vertex) const {

diff --git a/Edge.h b/Edge.h
@@ -2,8 +2,8 @@
 #define ALGS4_EDGE_H
 
 
-#include <iostream>
 #include <iomanip>
+#include <iostream>
 
 class Edge {
 protected:

diff --git a/EdgeWeightedDigraph.h b/EdgeWeightedDigraph.h
@@ -2,11 +2,12 @@
 #define EDGEWEIGHTEDDIGRAPH_H
 
 
-#include "GraphBase.h"
-#include "DirectedEdge.h"
 #include <iostream>
 #include <list>
 
+#include "DirectedEdge.h"
+#include "GraphBase.h"
+
 class EdgeWeightedDigraph : public GraphBase<DirectedEdge> {
 public:
     explicit EdgeWeightedDigraph(int V) : GraphBase(V) {}

diff --git a/EdgeWeightedGraph.h b/EdgeWeightedGraph.h
@@ -2,11 +2,12 @@
 #define ALGS4_EDGEWEIGHTEDGRAPH_H
 
 
-#include "GraphBase.h"
-#include "Edge.h"
 #include <iostream>
 #include <list>
 
+#include "Edge.h"
+#include "GraphBase.h"
+
 class EdgeWeightedGraph : public GraphBase<Edge> {
 public:
     explicit EdgeWeightedGraph(int V) : GraphBase(V) {}

diff --git a/Graph.h b/Graph.h
@@ -2,9 +2,10 @@
 #define ALGS4_GRAPH_H
 
 
-#include "GraphBase.h"
 #include <iostream>
 
+#include "GraphBase.h"
+
 class Graph : public GraphBase<int> {
 public:
     explicit Graph(int V) : GraphBase(V) {}

diff --git a/GraphBase.h b/GraphBase.h
@@ -2,9 +2,9 @@
 #define ALGS4_GRAPHBASE_H
 
 
+#include <iostream>
 #include <list>
 #include <vector>
-#include <iostream>
 
 template<typename T>
 class GraphBase {

diff --git a/Heap.h b/Heap.h
@@ -2,9 +2,10 @@
 #define ALGS4_HEAP_H
 
 
-#include "Sorting.h"
 #include <utility>
 
+#include "Sorting.h"
+
 class Heap : public Sorting {
 private:
     template<typename T>

diff --git a/Huffman.cpp b/Huffman.cpp
@@ -1,9 +1,11 @@
 #include "Huffman.h"
-#include "MinPQ.h"
-#include "BinaryStdIO.h"
+
 #include <iostream>
 #include <vector>
 
+#include "BinaryStdIO.h"
+#include "MinPQ.h"
+
 // Make a lookup table from trie.
 std::vector<std::string> Huffman::buildCode(const std::shared_ptr<Node> &root) {
     std::vector<std::string> st(R);

diff --git a/IndexMinPQ.h b/IndexMinPQ.h
@@ -2,9 +2,10 @@
 #define ALGS4_INDEXMINPQ_H
 
 
-#include "MinPQ.h"
-#include <vector>
 #include <optional>
+#include <vector>
+
+#include "MinPQ.h"
 
 template<typename Key>
 class IndexMinPQ : private MinPQ<int> {

diff --git a/KMP.cpp b/KMP.cpp
@@ -1,4 +1,5 @@
 #include "KMP.h"
+
 #include <utility>
 
 // Build DFA from pattern.

diff --git a/KMP.h b/KMP.h
@@ -2,9 +2,10 @@
 #define KMP_H
 
 
-#include "SubstrSearcher.h"
-#include <vector>
 #include <string>
+#include <vector>
+
+#include "SubstrSearcher.h"
 
 class KMP : public SubstrSearcher {
 private:

diff --git a/KosarajuSCC.cpp b/KosarajuSCC.cpp
@@ -1,4 +1,5 @@
 #include "KosarajuSCC.h"
+
 #include "DepthFirstOrder.h"
 
 KosarajuSCC::KosarajuSCC(const Digraph &G) : CCBase(G) {

diff --git a/KruskalMST.cpp b/KruskalMST.cpp
@@ -1,4 +1,5 @@
 #include "KruskalMST.h"
+
 #include "MinPQ.h"
 #include "UF.h"
 

diff --git a/KruskalMST.h b/KruskalMST.h
@@ -2,9 +2,10 @@
 #define KRUSKALMST_H
 
 
-#include "MST.h"
 #include <list>
+
 #include "EdgeWeightedGraph.h"
+#include "MST.h"
 
 class KruskalMST : public MST {
 private:

diff --git a/LZW.cpp b/LZW.cpp
@@ -1,9 +1,11 @@
 #include "LZW.h"
-#include "TST.h"
+
 #include <string>
-#include "BinaryStdIO.h"
 #include <vector>
 
+#include "BinaryStdIO.h"
+#include "TST.h"
+
 void LZW::compress() {
     std::string input = BinaryStdIO::readString();
     TST<int> st;

diff --git a/LinearProbingHashST.h b/LinearProbingHashST.h
@@ -2,10 +2,11 @@
 #define ALGS4_LINEARPROBINGHASHST_H
 
 
-#include "ST.h"
-#include <vector>
 #include <functional>
 #include <optional>
+#include <vector>
+
+#include "ST.h"
 
 template<typename Key, typename Value>
 class LinearProbingHashST : public ST<Key, Value> {

diff --git a/MSD.h b/MSD.h
@@ -3,6 +3,7 @@
 
 
 #include <string_view>
+
 #include "Sorting.h"
 #include "StringSorting.h"
 

diff --git a/MST.h b/MST.h
@@ -2,9 +2,10 @@
 #define ALGS4_MST_H
 
 
-#include "Edge.h"
 #include <list>
 
+#include "Edge.h"
+
 class MST {
 public:
     virtual ~MST() = default;

diff --git a/MaxPQ.h b/MaxPQ.h
@@ -2,9 +2,10 @@
 #define ALGS4_MAXPQ_H
 
 
-#include "PQ.h"
 #include <optional>
 
+#include "PQ.h"
+
 template<typename Key>
 class MaxPQ : public PQ<Key> {
 private:
Original file line number	Diff line number	Diff line change
Expand Up		@@ -3,6 +3,7 @@


		#include <string_view>

		#include "Sorting.h"
		#include "StringSorting.h"

Expand Down