From cf712b316a0015e77834104e1bb87a46cc7aa293 Mon Sep 17 00:00:00 2001
From: Alexander McCord <alex@mccord.dev>
Date: Fri, 24 May 2024 10:48:08 -0700
Subject: [PATCH] Rename 3 fields.

---
 EqSat/include/Luau/EGraph.h | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/EqSat/include/Luau/EGraph.h b/EqSat/include/Luau/EGraph.h
index fea10a3a..b5225335 100644
--- a/EqSat/include/Luau/EGraph.h
+++ b/EqSat/include/Luau/EGraph.h
@@ -22,9 +22,9 @@ struct EClass {
 };
 
 /// In Definition 2.1, an EGraph is composed with a tuple (U, M, H) where
-/// - U: [`EGraph::u`]
-/// - M: [`EGraph::m`]
-/// - H: [`EGraph::h`]
+/// - U: [`EGraph::unionfind`]
+/// - M: [`EGraph::classes`]
+/// - H: [`EGraph::hashcons`]
 ///
 /// See <https://arxiv.org/pdf/2004.03082>.
 template<typename L, typename N>
@@ -35,15 +35,15 @@ struct EGraph
 
 private:
     /// A union-find data structure 𝑈 stores an equivalence relation over e-class ids.
-    UnionFind u;
+    UnionFind unionfind;
 
     /// The e-class map 𝑀 maps e-class ids to e-classes. All equivalent e-class ids map to the same
     /// e-class, i.e., 𝑎 ≡id 𝑏 iff 𝑀[𝑎] is the same set as 𝑀[𝑏]. An e-class id 𝑎 is said to refer to the
     /// e-class 𝑀[find(𝑎)].
-    DenseHashMap<Id, EClass<L, typename N::Data>> m;
+    DenseHashMap<Id, EClass<L, typename N::Data>> classes;
 
     /// The hashcons 𝐻 is a map from e-nodes to e-class ids.
-    DenseHashMap<L, Id> h;
+    DenseHashMap<L, Id> hashcons;
 };
 
 } // namespace Luau::EqSat