fix(algos): refactor extrema circular buffer

posts/trading/extrema-circular-buffer.html

@@ -201,11 +201,6 @@
             <div class="code" data-file="monotonic.cpp"></div>
             <h3>further improvements</h3>
             <ol>
-              <li>
-                While the final approach is <i>theoretically</i> faster than the
-                second, with small data sets the overhead of the latter is
-                likely to upset any performance gains.
-              </li>
               <li>
                 The class could leverage templates to take in a comparator
                 <span><code>std::less&lt;double&gt;</code></span>

public/code/trading/extrema-circular-buffer/map.cpp

@@ -4,8 +4,6 @@
 
 class ExtremaCircularBuffer {
 public:
-  ExtremaCircularBuffer(size_t capacity) : capacity(capacity) {}
-
   void push_back(double value) {
     if (prices.size() == capacity) {
       double front = prices.front();
@@ -49,8 +47,5 @@ public:
     return sorted_prices.begin()->first;
   }
 
-private:
+  /* methods & fields omitted for brevity */
-  std::deque<double> prices;
-  std::map<double, size_t> sorted_prices;
-  size_t capacity;
 };

public/code/trading/extrema-circular-buffer/monotonic.cpp

@@ -4,8 +4,6 @@
 
 class ExtremaCircularBuffer {
 public:
-  explicit ExtremaCircularBuffer(size_t capacity) : capacity(capacity) {}
-
   void push_back(double value) {
     if (prices.size() == capacity) {
       double front_value = prices.front();
@@ -27,8 +25,6 @@ public:
     prices.pop_front();
   }
 
-  size_t size() const { return prices.size(); }
-
   double get_max() const {
     if (prices.empty()) {
       throw std::out_of_range("Cannot find max() of empty buffer");
@@ -59,7 +55,5 @@ private:
     }
   }
 
-  std::deque<double> prices;
+  /* methods & fields omitted for brevity */
-  std::deque<std::pair<double, size_t>> maxs;
-  size_t capacity;
 };