aboutsummaryrefslogtreecommitdiff
path: root/src/common/container
diff options
context:
space:
mode:
authorcrueter <crueter@eden-emu.dev>2026-08-31 02:58:09 +0200
committercrueter <crueter@eden-emu.dev>2026-08-31 02:58:09 +0200
commit7fda6dde73ab9fa1eab40d43c90720a1d9ba054f (patch)
tree12753135a33c3002ecb35734ac7c79adc5de85b7 /src/common/container
parent106a61c9434b8d61ab8cde0170f6fcac403b28f1 (diff)
[common] Switch to boost::unordered_flat containers (#4326)
Replaces all instances of ankerl's unordered map/set with boost's `unordered_flat_*` classes. This uses std::hash since boost::hash is actually a lot slower. Also adds an abstraction layer in `Common` so future changes are quicker and easier. Other implementation details: - ankerl provided hash specializations for tuple and pair, so those were ported here - std::erase_if doesn't work on boost, so just used the ADL'd erase_if This should be about equal or superior performance as unordered_dense for everything except iteration. Signed-off-by: crueter <crueter@eden-emu.dev> - [x] I have read and followed the [Contribution Guidelines](https://git.eden-emu.dev/eden-emu/eden/src/branch/master/CONTRIBUTING.md#code-contributions). - [x] I have read and followed the [AI Policy](https://git.eden-emu.dev/eden-emu/eden/src/branch/master/docs/policies/AI.md) - [x] I have read and followed the [Coding Guidelines](https://git.eden-emu.dev/eden-emu/eden/src/branch/master/docs/policies/Coding.md) to the best of my ability. ------------------- Reviewed-on: https://git.eden-emu.dev/eden-emu/eden/pulls/4326 Reviewed-by: Lizzie and Samuel <lizzie@eden-emu.dev> Reviewed-by: MaranBr <maranbr@eden-emu.dev>
Diffstat (limited to 'src/common/container')
-rw-r--r--src/common/container/unordered_map.h16
-rw-r--r--src/common/container/unordered_set.h16
2 files changed, 32 insertions, 0 deletions
diff --git a/src/common/container/unordered_map.h b/src/common/container/unordered_map.h
new file mode 100644
index 0000000000..7d9e49fd80
--- /dev/null
+++ b/src/common/container/unordered_map.h
@@ -0,0 +1,16 @@
+// SPDX-FileCopyrightText: Copyright 2026 Eden Emulator Project
+// SPDX-License-Identifier: GPL-3.0-or-later
+
+#pragma once
+
+#include "common/container_hash.h"
+
+#include <boost/unordered/unordered_flat_map.hpp>
+
+namespace Common {
+
+template <class Key, class T, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>,
+ class Allocator = std::allocator<std::pair<const Key, T>>>
+using unordered_map = boost::unordered::unordered_flat_map<Key, T, Hash, Pred, Allocator>;
+
+}
diff --git a/src/common/container/unordered_set.h b/src/common/container/unordered_set.h
new file mode 100644
index 0000000000..54d71406a1
--- /dev/null
+++ b/src/common/container/unordered_set.h
@@ -0,0 +1,16 @@
+// SPDX-FileCopyrightText: Copyright 2026 Eden Emulator Project
+// SPDX-License-Identifier: GPL-3.0-or-later
+
+#pragma once
+
+#include "common/container_hash.h"
+
+#include <boost/unordered/unordered_flat_set.hpp>
+
+namespace Common {
+
+template <class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>,
+ class Allocator = std::allocator<Key>>
+using unordered_set = boost::unordered::unordered_flat_set<Key, Hash, Pred, Allocator>;
+
+}