mirror of
https://github.com/godotengine/godot.git
synced 2024-11-27 09:16:35 +08:00
8b7c7f5a75
Adds a new, cleaned up, HashMap implementation. * Uses Robin Hood Hashing (https://en.wikipedia.org/wiki/Hash_table#Robin_Hood_hashing). * Keeps elements in a double linked list for simpler, ordered, iteration. * Allows keeping iterators for later use in removal (Unlike Map<>, it does not do much for performance vs keeping the key, but helps replace old code). * Uses a more modern C++ iterator API, deprecates the old one. * Supports custom allocator (in case there is a wish to use a paged one). This class aims to unify all the associative template usage and replace it by this one: * Map<> (whereas key order does not matter, which is 99% of cases) * HashMap<> * OrderedHashMap<> * OAHashMap<> |
||
---|---|---|
.. | ||
array.cpp | ||
array.h | ||
binder_common.h | ||
callable_bind.cpp | ||
callable_bind.h | ||
callable.cpp | ||
callable.h | ||
container_type_validate.h | ||
dictionary.cpp | ||
dictionary.h | ||
method_ptrcall.h | ||
native_ptr.h | ||
SCsub | ||
type_info.h | ||
typed_array.h | ||
variant_call.cpp | ||
variant_construct.cpp | ||
variant_construct.h | ||
variant_destruct.cpp | ||
variant_destruct.h | ||
variant_internal.h | ||
variant_op.cpp | ||
variant_op.h | ||
variant_parser.cpp | ||
variant_parser.h | ||
variant_setget.cpp | ||
variant_setget.h | ||
variant_utility.cpp | ||
variant.cpp | ||
variant.h |