summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorbunnei <bunneidev@gmail.com>2014-09-10 02:56:28 +0200
committerbunnei <bunneidev@gmail.com>2014-09-10 02:56:28 +0200
commit249a567834798d97d1281d7cc2209f6c52b80f8b (patch)
tree1d3966269d5986e91561e16c15bb363140592fc0
parentMerge pull request #101 from lioncash/inf-loop (diff)
parentRemoved fixed_size_queue.h (diff)
downloadyuzu-249a567834798d97d1281d7cc2209f6c52b80f8b.tar
yuzu-249a567834798d97d1281d7cc2209f6c52b80f8b.tar.gz
yuzu-249a567834798d97d1281d7cc2209f6c52b80f8b.tar.bz2
yuzu-249a567834798d97d1281d7cc2209f6c52b80f8b.tar.lz
yuzu-249a567834798d97d1281d7cc2209f6c52b80f8b.tar.xz
yuzu-249a567834798d97d1281d7cc2209f6c52b80f8b.tar.zst
yuzu-249a567834798d97d1281d7cc2209f6c52b80f8b.zip
-rw-r--r--src/common/CMakeLists.txt1
-rw-r--r--src/common/fixed_size_queue.h70
2 files changed, 0 insertions, 71 deletions
diff --git a/src/common/CMakeLists.txt b/src/common/CMakeLists.txt
index 868fda55e..3a82f5b80 100644
--- a/src/common/CMakeLists.txt
+++ b/src/common/CMakeLists.txt
@@ -38,7 +38,6 @@ set(HEADERS
fifo_queue.h
file_search.h
file_util.h
- fixed_size_queue.h
hash.h
linear_disk_cache.h
log.h
diff --git a/src/common/fixed_size_queue.h b/src/common/fixed_size_queue.h
deleted file mode 100644
index 1e3a5dea6..000000000
--- a/src/common/fixed_size_queue.h
+++ /dev/null
@@ -1,70 +0,0 @@
-// Copyright 2013 Dolphin Emulator Project
-// Licensed under GPLv2
-// Refer to the license.txt file included.
-
-#pragma once
-
-// STL-look-a-like interface, but name is mixed case to distinguish it clearly from the
-// real STL classes.
-
-// Not fully featured, no safety checking yet. Add features as needed.
-
-// TODO: "inline" storage?
-
-template <class T, int N>
-class fixed_size_queue.h
-{
- T *storage;
- int head;
- int tail;
- int count; // sacrifice 4 bytes for a simpler implementation. may optimize away in the future.
-
- // Make copy constructor private for now.
- fixed_size_queue.h(fixed_size_queue.h &other) { }
-
-public:
- fixed_size_queue.h()
- {
- storage = new T[N];
- clear();
- }
-
- ~fixed_size_queue.h()
- {
- delete [] storage;
- }
-
- void clear() {
- head = 0;
- tail = 0;
- count = 0;
- }
-
- void push(T t) {
- storage[tail] = t;
- tail++;
- if (tail == N)
- tail = 0;
- count++;
- }
-
- void pop() {
- head++;
- if (head == N)
- head = 0;
- count--;
- }
-
- T pop_front() {
- const T &temp = storage[head];
- pop();
- return temp;
- }
-
- T &front() { return storage[head]; }
- const T &front() const { return storage[head]; }
-
- size_t size() const {
- return count;
- }
-};