From dcc22079fc1c455df70ab1263ea09400e4c948d6 Mon Sep 17 00:00:00 2001
From: bd <bdunahu@operationnull.com>
Date: Sat, 8 Mar 2025 15:19:57 -0500
Subject: Remove queue in storage.h

---
 inc/storage.h | 23 +++--------------------
 1 file changed, 3 insertions(+), 20 deletions(-)

(limited to 'inc/storage.h')

diff --git a/inc/storage.h b/inc/storage.h
index 95b6749..4bf4591 100644
--- a/inc/storage.h
+++ b/inc/storage.h
@@ -4,33 +4,16 @@
 #include "response.h"
 #include <algorithm>
 #include <array>
-#include <deque>
 #include <vector>
 
 enum Accessor {
+	IDLE,
 	MEM,
 	FETCH,
 	L1CACHE,
 	SIDE,
 };
 
-/**
- * Wrapper class for std::deque.
- *
- * Implements a deque that does not push duplicate objects.
- */
-template <typename T> class Deque : public std::deque<T>
-{
-  public:
-	using std::deque<T>::deque;
-
-	void push_back(const T &value)
-	{
-		if (std::find(this->begin(), this->end(), value) == this->end())
-			std::deque<T>::push_back(value);
-	}
-};
-
 class Storage
 {
   public:
@@ -83,9 +66,9 @@ class Storage
 	 */
 	int delay;
 	/**
-	 * The accessors currently being serviced, in first come first serve order.
+	 * The accessor currently being serviced.
 	 */
-	Deque<enum Accessor> deque;
+	enum Accessor requester;
 	/**
 	 * The number of cycles until the current request is completed.
 	 */
-- 
cgit v1.2.3