1
0
mirror of https://github.com/luanti-org/luanti.git synced 2025-12-30 01:55:22 +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/string.h"
#include "util/container.h" #include "util/container.h"
#include <utility> #include <utility>
#include <set>
#define MAPGEN_DEFAULT MAPGEN_V7 #define MAPGEN_DEFAULT MAPGEN_V7
#define MAPGEN_DEFAULT_NAME "v7" #define MAPGEN_DEFAULT_NAME "v7"

View File

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

View File

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