hugopeixoto/yuzu
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

thread_queue_list: Make contains() and get_first() const member functions

Browse Source 
These don't directly modify the contained data.
This commit is contained in:
Lioncash 2018-08-12 12:52:25 -04:00
parent 55c73e10a7
commit 11470f331a
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/common/thread_queue_list.h
View File

@ -26,9 +26,9 @@ struct ThreadQueueList {
} }
// Only for debugging, returns priority level. // Only for debugging, returns priority level.
Priority contains(const T& uid) { Priority contains(const T& uid) const {
for (Priority i = 0; i < NUM_QUEUES; ++i) { for (Priority i = 0; i < NUM_QUEUES; ++i) {
Queue& cur = queues[i]; const Queue& cur = queues[i];
if (std::find(cur.data.cbegin(), cur.data.cend(), uid) != cur.data.cend()) { if (std::find(cur.data.cbegin(), cur.data.cend(), uid) != cur.data.cend()) {
return i; return i;
} }
@ -37,8 +37,8 @@ struct ThreadQueueList {
return -1; return -1;
} }
T get_first() { T get_first() const {
Queue* cur = first; const Queue* cur = first;
while (cur != nullptr) { while (cur != nullptr) {
if (!cur->data.empty()) { if (!cur->data.empty()) {
return cur->data.front(); return cur->data.front();