Address review comments

1. Move EdgePriorityQueue to graph.h and inherit from priority_queue
2. Add comment about edge->critical_time()

1 files changed, 0 insertions, 36 deletions

diff --git a/src/build.h b/src/build.h
index 9b49ffb..652bc40 100644
--- a/src/build.h
+++ b/src/build.h
@@ -18,7 +18,6 @@
 #include <cstdio>
 #include <map>
 #include <memory>
-#include <queue>
 #include <string>
 #include <vector>
 
@@ -36,41 +35,6 @@ struct State;
 struct Status;
 
 
-// Set of ready edges, sorted by priority
-class EdgeQueue {
-  struct EdgePriorityCompare {
-    bool operator()(const Edge* e1, const Edge* e2) const;
-  };
-
-  std::priority_queue<Edge*, std::vector<Edge*>, EdgePriorityCompare> queue_;
-
- public:
-  void push(Edge* edge) {
-    queue_.push(edge);
-  }
-
-  template <typename It>
-  void push(It first, It last) {
-    for (; first != last; ++first) {
-      push(*first);
-    }
-  }
-
-  Edge* pop() {
-    Edge* ret = queue_.top();
-    queue_.pop();
-    return ret;
-  }
-
-  void clear() {
-    queue_ = std::priority_queue<Edge*, std::vector<Edge*>, EdgePriorityCompare>();
-  }
-
-  size_t size() const { return queue_.size(); }
-
-  bool empty() const { return queue_.empty(); }
-};
-
 /// Plan stores the state of a build plan: what we intend to build,
 /// which steps we're ready to execute.
 struct Plan {