Refactored CL for moving the output to a separate thread.

webrtc/call/ringbuffer.h

Index: webrtc/call/ringbuffer.h
diff --git a/webrtc/call/ringbuffer.h b/webrtc/call/ringbuffer.h
new file mode 100644
index 0000000000000000000000000000000000000000..814545fbfcf42cfd3a8b9e9dc04aaf6179b7a4f4
--- /dev/null
+++ b/webrtc/call/ringbuffer.h
@@ -0,0 +1,100 @@
+/*
+ *  Copyright (c) 2015 The WebRTC project authors. All Rights Reserved.
+ *
+ *  Use of this source code is governed by a BSD-style license
+ *  that can be found in the LICENSE file in the root of the source
+ *  tree. An additional intellectual property rights grant can be found
+ *  in the file PATENTS.  All contributing project authors may
+ *  be found in the AUTHORS file in the root of the source tree.
+ *
+ */
+
+#ifndef WEBRTC_CALL_RINGBUFFER_H_
+#define WEBRTC_CALL_RINGBUFFER_H_
+
+#include <memory>
+#include <utility>
+
+#include "webrtc/base/checks.h"
+
+namespace webrtc {
+
+// A RingBuffer works like a fixed size queue which starts discarding
+// the oldest elements when it becomes full.
+template <typename T>
+class RingBuffer {
+ public:
+  // Creates a RingBuffer with space for |capacity| elements.
+  explicit RingBuffer(size_t capacity)
+      :  // We allocate space for one extra sentinel element.
+        data_(new T[capacity + 1]) {
+    RTC_DCHECK(capacity > 0);
+    end_ = data_.get() + (capacity + 1);
+    front_ = data_.get();
+    back_ = data_.get();
+  }
+
+  ~RingBuffer() {
+    // The unique_ptr will free the memory.
+  }
+
+  // Removes an element from the front of the queue.
+  void pop_front() {
+    RTC_DCHECK(!empty());
+    ++front_;
+    if (front_ == end_) {
+      front_ = data_.get();
+    }
+  }
+
+  // Appends an element to the back of the queue (and removes an
+  // element from the front if there is no space at the back of the queue).
+  void push_back(const T& elem) {
+    *back_ = elem;
+    ++back_;
+    if (back_ == end_) {
+      back_ = data_.get();
+    }
+    if (back_ == front_) {
+      ++front_;
+    }
+    if (front_ == end_) {
+      front_ = data_.get();
+    }
+  }
+
+  // Appends an element to the back of the queue (and removes an
+  // element from the front if there is no space at the back of the queue).
+  void push_back(T&& elem) {
+    using std::swap;
+    swap(*back_, elem);

[stefan-webrtc, 2016/04/19 08:23:04]

I'd prefer std::swap() without using.

[terelius, 2016/04/19 09:21:56]

I believe "using std::swap" is the idiomatic way to swap things in templated
code. After "using std::swap", argument dependent lookup will resolve swap to
T::swap if that's available and std::swap otherwise.

[stefan-webrtc, 2016/04/19 09:33:32]

I see, I thought

using std::swap;
swap(*back_, elem);

was identical to:

std::swap(*back_, elem);

+    ++back_;
+    if (back_ == end_) {
+      back_ = data_.get();
+    }
+    if (back_ == front_) {
+      ++front_;
+    }
+    if (front_ == end_) {
+      front_ = data_.get();
+    }
+  }
+
+  T& front() { return *front_; }
+
+  const T& front() const { return *front_; }
+
+  bool empty() const { return (front_ == back_); }
+
+ private:
+  std::unique_ptr<T[]> data_;
+  T* end_;
+  T* front_;
+  T* back_;
+
+  RTC_DISALLOW_IMPLICIT_CONSTRUCTORS(RingBuffer);
+};
+
+}  // namespace webrtc
+
+#endif  // WEBRTC_CALL_RINGBUFFER_H_