Use stable sort in generation of lookup tables (#2638)

* Add Slang::List::stableSort

* Use stable sort in generation of lookup tables

* Disable newline translation when writing lookup tables

1 files changed, 2 insertions, 2 deletions

diff --git a/tools/slang-lookup-generator/lookup-generator-main.cpp b/tools/slang-lookup-generator/lookup-generator-main.cpp
index 27dae8e54..882563767 100644
--- a/tools/slang-lookup-generator/lookup-generator-main.cpp
+++ b/tools/slang-lookup-generator/lookup-generator-main.cpp
@@ -128,7 +128,7 @@ static HashFindResult minimalPerfectHash(const List<String>& ss, HashParams& has
     {
         initialBuckets[hash(s)].add(s);
     }
-    initialBuckets.sort([](const List<String>& a, const List<String>& b) { return a.getCount() > b.getCount(); });
+    initialBuckets.stableSort([](const List<String>& a, const List<String>& b) { return a.getCount() > b.getCount(); });
 
     // These are our outputs, the salts are calculated such that for all input
     // word, x, hash(x, salt[hash(x, 0)]) is unique
@@ -211,7 +211,7 @@ void writeHashFile(
     const HashParams&  hashParams)
 {
     FILE* f = nullptr;
-    fopen_s(&f, outCppPath, "w");
+    fopen_s(&f, outCppPath, "wb");
     if (!f)
     {
         return;