You've already forked godot
mirror of
https://github.com/godotengine/godot.git
synced 2025-11-05 12:10:55 +00:00
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:
@@ -4218,13 +4218,11 @@ Error GDScriptAnalyzer::resolve_program() {
|
||||
resolve_class_interface(parser->head);
|
||||
resolve_class_body(parser->head);
|
||||
|
||||
List<String> parser_keys;
|
||||
depended_parsers.get_key_list(&parser_keys);
|
||||
for (const String &E : parser_keys) {
|
||||
if (depended_parsers[E].is_null()) {
|
||||
for (KeyValue<String, Ref<GDScriptParserRef>> &K : depended_parsers) {
|
||||
if (K.value.is_null()) {
|
||||
return ERR_PARSE_ERROR;
|
||||
}
|
||||
depended_parsers[E]->raise_status(GDScriptParserRef::FULLY_SOLVED);
|
||||
K.value->raise_status(GDScriptParserRef::FULLY_SOLVED);
|
||||
}
|
||||
return parser->errors.is_empty() ? OK : ERR_PARSE_ERROR;
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user