mirror of
https://github.com/revng/revng
synced 2026-06-21 14:07:57 +00:00
57 lines
1.0 KiB
C++
57 lines
1.0 KiB
C++
#pragma once
|
|
|
|
//
|
|
// This file is distributed under the MIT License. See LICENSE.md for details.
|
|
//
|
|
|
|
#include <queue>
|
|
#include <set>
|
|
|
|
#include "revng/Support/Assert.h"
|
|
|
|
/// Queue where an element cannot be re-inserted if it's already in the queue
|
|
template<typename T, bool Once>
|
|
class QueueImpl {
|
|
public:
|
|
void insert(T Element) {
|
|
if (!Set.contains(Element)) {
|
|
Set.insert(Element);
|
|
Queue.push(Element);
|
|
}
|
|
}
|
|
|
|
bool empty() const { return Queue.empty(); }
|
|
|
|
T head() const { return Queue.front(); }
|
|
|
|
T pop() {
|
|
T Result = head();
|
|
Queue.pop();
|
|
if (!Once)
|
|
Set.erase(Result);
|
|
return Result;
|
|
}
|
|
|
|
size_t size() const { return Queue.size(); }
|
|
|
|
std::set<T> visited() {
|
|
revng_assert(Once);
|
|
return std::move(Set);
|
|
}
|
|
|
|
void clear() {
|
|
std::set<T>().swap(Set);
|
|
std::queue<T>().swap(Queue);
|
|
}
|
|
|
|
private:
|
|
std::set<T> Set;
|
|
std::queue<T> Queue;
|
|
};
|
|
|
|
template<typename T>
|
|
using UniquedQueue = QueueImpl<T, false>;
|
|
|
|
template<typename T>
|
|
using OnceQueue = QueueImpl<T, true>;
|