diff options
author | archshift <admin@archshift.com> | 2014-09-09 03:49:41 +0200 |
---|---|---|
committer | archshift <admin@archshift.com> | 2014-09-09 03:49:41 +0200 |
commit | 727bad24a26e97fd834265a980f9b7473c11574f (patch) | |
tree | 21193ad7ed09edccee04f0b111a3224171b31230 /src/common/fixed_size_queue.h | |
parent | Merge pull request #95 from lioncash/disassembler (diff) | |
download | yuzu-727bad24a26e97fd834265a980f9b7473c11574f.tar yuzu-727bad24a26e97fd834265a980f9b7473c11574f.tar.gz yuzu-727bad24a26e97fd834265a980f9b7473c11574f.tar.bz2 yuzu-727bad24a26e97fd834265a980f9b7473c11574f.tar.lz yuzu-727bad24a26e97fd834265a980f9b7473c11574f.tar.xz yuzu-727bad24a26e97fd834265a980f9b7473c11574f.tar.zst yuzu-727bad24a26e97fd834265a980f9b7473c11574f.zip |
Diffstat (limited to '')
-rw-r--r-- | src/common/fixed_size_queue.h | 70 |
1 files changed, 0 insertions, 70 deletions
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; - } -}; |