Scarfski/entt
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

dense_hash_map: less risky but still on the edge :)

Browse Source
This commit is contained in:
Michele Caini
2021-10-29 12:32:09 +02:00
parent 94d0c5fa5c
commit 46598fde32
1 changed files with 6 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
src/entt/container/dense_hash_map.hpp
View File

@@ -299,13 +299,14 @@ class dense_hash_map final {
for(; *curr != last; curr = &packed.first()[*curr].next) {}
*curr = pos;
auto allocator = packed.first().get_allocator();
auto *ptr = packed.first().data() + pos;
using node_allocator_traits = typename alloc_traits::template rebind_traits<decltype(node_type::element)>;
typename node_allocator_traits::allocator_type allocator = packed.first().get_allocator();
auto *ptr = std::addressof(packed.first()[pos].element);
std::destroy_at(ptr);
// no exception guarantees when mapped type has a throwing move constructor
using node_allocator_traits = typename alloc_traits::template rebind_traits<node_type>;
node_allocator_traits::construct(allocator, ptr, std::move(packed.first()[last]));
packed.first()[pos].next = packed.first().back().next;
// no exception guarantees when mapped type has a throwing move constructor (we're technically doomed)
node_allocator_traits::construct(allocator, ptr, std::move(packed.first().back().element));
}
packed.first().pop_back();