Refugee from Dead Machine 13: New version of the convex AA tessellator

src/core/SkTDPQueue.h

 /*
  * Copyright 2015 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkTDPQueue_DEFINED
 #define SkTDPQueue_DEFINED
 
 #include "SkTDArray.h"
 
 /**
  * This class implements a priority queue. T is the type of the elements in the queue. LESS is a
  * function that compares two Ts and returns true if the first is higher priority than the second.
  *
  * Optionally objects may know their index into the priority queue. The queue will update the index
  * as the objects move through the queue. This is enabled by using a non-NULL function for INDEX.
  * When an INDEX function is provided random deletes from the queue are allowed using remove().
- * Additionally, the * priority is allowed to change as long as priorityDidChange() is called
+ * Additionally, the priority is allowed to change as long as priorityDidChange() is called
  * afterwards. In debug builds the index will be set to -1 before an element is removed from the
  * queue.
  */
 template <typename T,
           bool (*LESS)(const T&, const T&),
           int* (*INDEX)(const T&) = (int* (*)(const T&))NULL>
 class SkTDPQueue : public SkNoncopyable {
 public:
     SkTDPQueue() {}
 
     /** Number of items in the queue. */
     int count() const { return fArray.count(); }
 
+    void setReserve(int reserve) { fArray.setReserve(reserve); }
+    void rewind() { fArray.rewind(); }
+
     /** Gets the next item in the queue without popping it. */
     const T& peek() const { return fArray[0]; }
     T& peek() { return fArray[0]; }
     
     /** Removes the next item. */
     void pop() {
         this->validate();
         SkDEBUGCODE(if (SkToBool(INDEX)) { *INDEX(fArray[0]) = -1; })
         if (1 == fArray.count()) {
             fArray.pop();
@@ skipping 142 matching lines @@
         }
 #endif
     }
 
     SkTDArray<T> fArray;
     
     typedef SkNoncopyable INHERITED;
 };
 
 #endif