From d68623698c3db34739d5686cf74f0c373bbc4199 Mon Sep 17 00:00:00 2001
From: Linus Groh <mail@linusgroh.de>
Date: Thu, 2 Mar 2023 19:56:06 +0000
Subject: [PATCH] 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).
---
 Userland/Libraries/LibIDL/Types.h | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Userland/Libraries/LibIDL/Types.h b/Userland/Libraries/LibIDL/Types.h
index 7f1c2dd158..f507de1fe3 100644
--- a/Userland/Libraries/LibIDL/Types.h
+++ b/Userland/Libraries/LibIDL/Types.h
@@ -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 };
 };