add explicit specifier

landerrosette · Nov 27, 2024 · 62b9e41 · 62b9e41
1 parent 0dcfdeb
commit 62b9e41
Show file tree

Hide file tree

Showing 22 changed files with 27 additions and 27 deletions.
diff --git a/BinarySearchST.h b/BinarySearchST.h
@@ -13,7 +13,7 @@ class BinarySearchST : public OrderedST<Key, Value> {
     int N = 0;
 
 public:
-    BinarySearchST(int capacity) : keys_(capacity), vals(capacity) {}
+    explicit BinarySearchST(int capacity) : keys_(capacity), vals(capacity) {}
 
     std::optional<Value> get(const Key &key) const override;
 

diff --git a/BoyerMoore.h b/BoyerMoore.h
@@ -11,7 +11,7 @@ class BoyerMoore : public SubstrSearcher {
     std::string pat;
 
 public:
-    BoyerMoore(const std::string &pat);
+    explicit BoyerMoore(const std::string &pat);
 
     int search(const std::string &txt) const override;
 };

diff --git a/CC.h b/CC.h
@@ -7,7 +7,7 @@
 
 class CC : public CCBase {
 public:
-    CC(const Graph &G);
+    explicit CC(const Graph &G);
 };
 
 

diff --git a/CCBase.h b/CCBase.h
@@ -14,7 +14,7 @@ class CCBase {
     void dfs(const GraphBase<int> &G, int v);
 
 public:
-    CCBase(const GraphBase<int> &G) : marked(G.V()), id_(G.V()) {}
+    explicit CCBase(const GraphBase<int> &G) : marked(G.V()), id_(G.V()) {}
 
     virtual ~CCBase() = default;
 

diff --git a/DepthFirstOrder.h b/DepthFirstOrder.h
@@ -18,7 +18,7 @@ class DepthFirstOrder {
 
 public:
     template<typename T>
-    DepthFirstOrder(const GraphBase<T> &G);
+    explicit DepthFirstOrder(const GraphBase<T> &G);
 
     std::list<int> pre() const { return pre_; }
 

diff --git a/Digraph.h b/Digraph.h
@@ -7,9 +7,9 @@
 
 class Digraph : public GraphBase<int> {
 public:
-    Digraph(int V) : GraphBase(V) {}
+    explicit Digraph(int V) : GraphBase(V) {}
 
-    Digraph(std::istream &in);
+    explicit Digraph(std::istream &in);
 
     void addEdge(int v, int w);
 

diff --git a/DirectedCycle.h b/DirectedCycle.h
@@ -19,7 +19,7 @@ class DirectedCycle {
     void dfs(const GraphBase<T> &G, int v);
 
 public:
-    DirectedCycle(const GraphBase<T> &G);
+    explicit DirectedCycle(const GraphBase<T> &G);
 
     bool hasCycle() const { return !cycle_.empty(); }
 

diff --git a/EdgeWeightedDigraph.h b/EdgeWeightedDigraph.h
@@ -9,9 +9,9 @@
 
 class EdgeWeightedDigraph : public GraphBase<DirectedEdge> {
 public:
-    EdgeWeightedDigraph(int V) : GraphBase(V) {}
+    explicit EdgeWeightedDigraph(int V) : GraphBase(V) {}
 
-    EdgeWeightedDigraph(std::istream &in);
+    explicit EdgeWeightedDigraph(std::istream &in);
 
     void addEdge(const DirectedEdge &e);
 

diff --git a/EdgeWeightedGraph.h b/EdgeWeightedGraph.h
@@ -9,9 +9,9 @@
 
 class EdgeWeightedGraph : public GraphBase<Edge> {
 public:
-    EdgeWeightedGraph(int V) : GraphBase(V) {}
+    explicit EdgeWeightedGraph(int V) : GraphBase(V) {}
 
-    EdgeWeightedGraph(std::istream &in);
+    explicit EdgeWeightedGraph(std::istream &in);
 
     void addEdge(const Edge &e);
 

diff --git a/Graph.h b/Graph.h
@@ -7,9 +7,9 @@
 
 class Graph : public GraphBase<int> {
 public:
-    Graph(int V) : GraphBase(V) {}
+    explicit Graph(int V) : GraphBase(V) {}
 
-    Graph(std::istream &in);
+    explicit Graph(std::istream &in);
 
     void addEdge(int v, int w);
 };

diff --git a/GraphBase.h b/GraphBase.h
@@ -14,9 +14,9 @@ class GraphBase {
     std::vector<std::list<T> > adj_; // 邻接表
 
 public:
-    GraphBase(int V) : V_(V), E_(0), adj_(V) {}
+    explicit GraphBase(int V) : V_(V), E_(0), adj_(V) {}
 
-    GraphBase(std::istream &in);
+    explicit GraphBase(std::istream &in);
 
     virtual ~GraphBase() = default;
 

diff --git a/IndexMinPQ.h b/IndexMinPQ.h
@@ -17,7 +17,7 @@ class IndexMinPQ : private MinPQ<int> {
     void exch(int i, int j) override;
 
 public:
-    IndexMinPQ(int maxN) : MinPQ(maxN), qp(maxN + 1), keys(maxN + 1) {}
+    explicit IndexMinPQ(int maxN) : MinPQ(maxN), qp(maxN + 1), keys(maxN + 1) {}
 
     using MinPQ::isEmpty, MinPQ::size;
 

diff --git a/KMP.h b/KMP.h
@@ -11,7 +11,7 @@ class KMP : public SubstrSearcher {
     std::vector<std::vector<int> > dfa;
 
 public:
-    KMP(const std::string &pat);
+    explicit KMP(const std::string &pat);
 
     int search(const std::string &txt) const override;
 };

diff --git a/KosarajuSCC.h b/KosarajuSCC.h
@@ -7,7 +7,7 @@
 
 class KosarajuSCC : public CCBase {
 public:
-    KosarajuSCC(const Digraph &G);
+    explicit KosarajuSCC(const Digraph &G);
 
     bool stronglyConnected(int v, int w) const { return connected(v, w); }
 };

diff --git a/KruskalMST.h b/KruskalMST.h
@@ -11,7 +11,7 @@ class KruskalMST : public MST {
     std::list<Edge> mst;
 
 public:
-    KruskalMST(const EdgeWeightedGraph &G);
+    explicit KruskalMST(const EdgeWeightedGraph &G);
 
     std::list<Edge> edges() const override { return mst; }
 };

diff --git a/LinearProbingHashST.h b/LinearProbingHashST.h
@@ -16,7 +16,7 @@ class LinearProbingHashST : public ST<Key, Value> {
 
     int hash(const Key &key) const;
 
-    LinearProbingHashST(int M) : M(M), keys_(M), vals(M) {}
+    explicit LinearProbingHashST(int M) : M(M), keys_(M), vals(M) {}
 
     void resize(int cap);
 

diff --git a/PQ.h b/PQ.h
@@ -22,7 +22,7 @@ class PQ {
     std::optional<Key> delTop();
 
 public:
-    PQ(int maxN) : pq(maxN + 1) {}
+    explicit PQ(int maxN) : pq(maxN + 1) {}
 
     virtual ~PQ() = default;
 

diff --git a/PrimMST.h b/PrimMST.h
@@ -17,7 +17,7 @@ class PrimMST : public MST {
     void visit(const EdgeWeightedGraph &G, int v);
 
 public:
-    PrimMST(const EdgeWeightedGraph &G);
+    explicit PrimMST(const EdgeWeightedGraph &G);
 
     std::list<Edge> edges() const override;
 };

diff --git a/SeparateChainingHashST.h b/SeparateChainingHashST.h
@@ -16,7 +16,7 @@ class SeparateChainingHashST : public ST<Key, Value> {
     int hash(const Key &key) const;
 
 public:
-    SeparateChainingHashST(int M) : M(M), st(M) {}
+    explicit SeparateChainingHashST(int M) : M(M), st(M) {}
 
     std::optional<Value> get(const Key &key) const override { return st[hash(key)].get(key); }
 

diff --git a/TST.h b/TST.h
@@ -16,7 +16,7 @@ class TST : public StringST<Value> {
         std::shared_ptr<Node> left, mid, right;
         std::optional<Value> val;
 
-        Node(char c) : c(c) {}
+        explicit Node(char c) : c(c) {}
     };
 
     std::shared_ptr<Node> root;

diff --git a/Topological.h b/Topological.h
@@ -13,7 +13,7 @@ class Topological {
 
 public:
     template<typename T>
-    Topological(const GraphBase<T> &G);
+    explicit Topological(const GraphBase<T> &G);
 
     std::list<int> order() const { return order_; }
 

diff --git a/UF.h b/UF.h
@@ -11,7 +11,7 @@ class UF {
     int count_;          // 分量数量
 
 public:
-    UF(int N);
+    explicit UF(int N);
 
     int count() const { return count_; }
-Original file line number
+Diff line change
@@ Expand Up / @@ -7,7 +7,7 @@ @@
     class CC : public CCBase {
     public:
-        CC(const Graph &G);
+        explicit CC(const Graph &G);
     };
@@ Expand Down @@