luau-lang/luau
1
0
Fork 0
mirror of https://github.com/luau-lang/luau.git synced 2025-04-04 10:50:54 +01:00
Code Issues Projects Releases Packages Wiki Activity

Rename 3 fields.

Browse source
This commit is contained in:
Alexander McCord 2024-05-24 10:48:08 -07:00
parent b44c525f10
commit cf712b316a
1 changed files with 6 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
EqSat/include/Luau/EGraph.h
View file

@ -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