Add a new HashMap implementation
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<>
This commit is contained in:
parent
9b7e16a6b8
commit
8b7c7f5a75
95 changed files with 1434 additions and 1874 deletions
|
|
@ -89,7 +89,7 @@ class EditorSettingsDialog : public AcceptDialog {
|
|||
void _event_config_confirmed();
|
||||
|
||||
void _create_shortcut_treeitem(TreeItem *p_parent, const String &p_shortcut_identifier, const String &p_display, Array &p_events, bool p_allow_revert, bool p_is_common, bool p_is_collapsed);
|
||||
Array _event_list_to_array_helper(List<Ref<InputEvent>> &p_events);
|
||||
Array _event_list_to_array_helper(const List<Ref<InputEvent>> &p_events);
|
||||
void _update_builtin_action(const String &p_name, const Array &p_events);
|
||||
void _update_shortcut_events(const String &p_path, const Array &p_events);
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue