1
0
mirror of https://github.com/luanti-org/luanti.git synced 2025-12-26 16:25:25 +01:00

Make UniqueQueue use unordered_set

This commit is contained in:
sfan5
2025-12-23 12:42:03 +01:00
parent 8883c4cb23
commit 8d1db8413f
3 changed files with 6 additions and 4 deletions

View File

@@ -12,6 +12,7 @@
#include "util/string.h"
#include "util/container.h"
#include <utility>
#include <set>
#define MAPGEN_DEFAULT MAPGEN_V7
#define MAPGEN_DEFAULT_NAME "v7"

View File

@@ -6,6 +6,7 @@
#include <functional>
#include <vector>
#include <set>
#include "../activeobjectmgr.h"
#include "serveractiveobject.h"
#include "util/k_d_tree.h"

View File

@@ -12,7 +12,7 @@
#include <list>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <queue>
#include <cassert>
#include <limits>
@@ -32,7 +32,7 @@ public:
true: value added
false: value already exists
*/
bool push_back(const Value& value)
bool push_back(const Value &value)
{
if (m_set.insert(value).second)
{
@@ -48,7 +48,7 @@ public:
m_queue.pop();
}
const Value& front() const
const Value &front() const
{
return m_queue.front();
}
@@ -64,7 +64,7 @@ public:
}
private:
std::set<Value> m_set;
std::unordered_set<Value> m_set;
std::queue<Value> m_queue;
};