1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-07-27 14:17:36 +00:00

LibIDL: Use OrderedHash{Table,Map} to store Enumeration values

Seems nice to keep these in the same order as the input and have
deterministic codegen of interfaces in LibWeb (for the purpose of
diffing two build revisions, for example).
This commit is contained in:
Linus Groh 2023-03-02 19:56:06 +00:00
parent b898a46d7f
commit d68623698c

View file

@ -206,8 +206,8 @@ struct Typedef {
};
struct Enumeration {
HashTable<DeprecatedString> values;
HashMap<DeprecatedString, DeprecatedString> translated_cpp_names;
OrderedHashTable<DeprecatedString> values;
OrderedHashMap<DeprecatedString, DeprecatedString> translated_cpp_names;
DeprecatedString first_member;
bool is_original_definition { true };
};