5cd352588c
`unordered_map`/`unordered_set` does an allocation per insert, use mimalloc for them for important hash maps
44 lines
1.2 KiB
C++
44 lines
1.2 KiB
C++
/*
|
|
Copyright (c) 2025 Lean FRO. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
|
|
Authors: Sebastian Ullrich
|
|
*/
|
|
#pragma once
|
|
#include <lean/config.h>
|
|
#include <unordered_map>
|
|
#include <unordered_set>
|
|
|
|
#ifdef LEAN_MIMALLOC
|
|
#include <lean/mimalloc.h>
|
|
#endif
|
|
|
|
namespace lean {
|
|
|
|
// We do not override `new` to avoid FFI issues for users but use `lean::allocator`
|
|
// explicitly where using the custom allocator is important.
|
|
|
|
#ifdef LEAN_MIMALLOC
|
|
template<class T> using allocator = mi_stl_allocator<T>;
|
|
#else
|
|
template<class T> using allocator = std::allocator<T>;
|
|
#endif
|
|
|
|
// `unordered_map/set` allocates per insert, so specializing to the custom allocator can
|
|
// save significant time for maps with frequent inserts.
|
|
|
|
template<
|
|
class Key,
|
|
class T,
|
|
class Hash = std::hash<Key>,
|
|
class KeyEqual = std::equal_to<Key>,
|
|
class Allocator = lean::allocator<std::pair<const Key, T>>
|
|
> using unordered_map = std::unordered_map<Key, T, Hash, KeyEqual, Allocator>;
|
|
|
|
template<
|
|
class Key,
|
|
class Hash = std::hash<Key>,
|
|
class KeyEqual = std::equal_to<Key>,
|
|
class Allocator = lean::allocator<Key>
|
|
> using unordered_set = std::unordered_set<Key, Hash, KeyEqual, Allocator>;
|
|
};
|