Make STDPQueue::at() available in all builds.

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
 
@@ skipping 74 matching lines @@
         allowed if an INDEX function is provided. */
     void priorityDidChange(T entry) {
         SkASSERT(NULL != INDEX);
         int index = *INDEX(entry);
         SkASSERT(index >= 0 && index < fArray.count());
         this->validate(index);
         this->percolateUpOrDown(index);
         this->validate();
     }
 
-#ifdef SK_DEBUG
+    /** Gets the item at index i in the priority queue (for i < this->count()). at(0) is equivalent
+        to peek(). Otherwise, there is no guarantee about ordering of elements in the queue. */
     T at(int i) const { return fArray[i]; }
-#endif
 
 private:
     static int LeftOf(int x) { SkASSERT(x >= 0); return 2 * x + 1; }
     static int ParentOf(int x) { SkASSERT(x > 0); return (x - 1) >> 1; }
 
     void percolateUpOrDown(int index) {
         SkASSERT(index >= 0);
         if (!percolateUpIfNecessary(index)) {
             this->validate(index);
             this->percolateDownIfNecessary(index);
@@ skipping 78 matching lines @@
         }
 #endif
     }
 
     SkTDArray<T> fArray;
     
     typedef SkNoncopyable INHERITED;
 };
 
 #endif