mirror of
https://github.com/RGBCube/serenity
synced 2025-07-27 18:57:35 +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:
parent
b898a46d7f
commit
d68623698c
1 changed files with 2 additions and 2 deletions
|
@ -206,8 +206,8 @@ struct Typedef {
|
||||||
};
|
};
|
||||||
|
|
||||||
struct Enumeration {
|
struct Enumeration {
|
||||||
HashTable<DeprecatedString> values;
|
OrderedHashTable<DeprecatedString> values;
|
||||||
HashMap<DeprecatedString, DeprecatedString> translated_cpp_names;
|
OrderedHashMap<DeprecatedString, DeprecatedString> translated_cpp_names;
|
||||||
DeprecatedString first_member;
|
DeprecatedString first_member;
|
||||||
bool is_original_definition { true };
|
bool is_original_definition { true };
|
||||||
};
|
};
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue