hegg-0.1.0.0: Fast equality saturation in Haskell

Index

!Data.Equality.Utils.IntToIntMap
%~Data.Equality.Graph.Lens
.~Data.Equality.Graph.Lens
:=Data.Equality.Saturation.Rewrites, Data.Equality.Saturation
:|Data.Equality.Saturation.Rewrites, Data.Equality.Saturation
add 
1 (Function)Data.Equality.Graph
2 (Function)Data.Equality.Graph.Monad
AnalysisData.Equality.Analysis
analysisWorklistData.Equality.Graph
Atom 
1 (Type/Class)Data.Equality.Matching.Database
2 (Data Constructor)Data.Equality.Matching.Database
BackoffSchedulerData.Equality.Saturation.Scheduler
canonicalizeData.Equality.Graph, Data.Equality.Graph.Monad
cataData.Equality.Utils, Data.Equality.Saturation
CClassIdData.Equality.Matching.Database
childrenData.Equality.Graph.Nodes, Data.Equality.Graph
classesData.Equality.Graph
ClassIdData.Equality.Graph.Classes.Id, Data.Equality.Graph.Classes, Data.Equality.Graph
ClassIdMapData.Equality.Graph.Classes.Id, Data.Equality.Graph.Classes, Data.Equality.Graph
ClassIdOrVarData.Equality.Matching.Database
compileToQueryData.Equality.Matching
CostData.Equality.Extraction
CostFunctionData.Equality.Extraction, Data.Equality.Saturation
CVarData.Equality.Matching.Database
DatabaseData.Equality.Matching.Database
DBData.Equality.Matching.Database
deleteNMData.Equality.Graph.Nodes, Data.Equality.Graph
depthCostData.Equality.Extraction
DomainData.Equality.Analysis
EClass 
1 (Type/Class)Data.Equality.Graph.Classes, Data.Equality.Graph
2 (Data Constructor)Data.Equality.Graph.Classes, Data.Equality.Graph
eClassDataData.Equality.Graph.Classes, Data.Equality.Graph
eClassIdData.Equality.Graph.Classes, Data.Equality.Graph
eClassNodesData.Equality.Graph.Classes, Data.Equality.Graph
eClassParentsData.Equality.Graph.Classes, Data.Equality.Graph
EGraph 
1 (Type/Class)Data.Equality.Graph, Data.Equality.Graph.Monad
2 (Data Constructor)Data.Equality.Graph
egraphData.Equality.Graph.Monad
EGraphMData.Equality.Graph.Monad
eGraphToDatabaseData.Equality.Matching
ematchData.Equality.Matching
emptyEGraphData.Equality.Graph, Data.Equality.Graph.Monad
emptyUFData.Equality.Graph.ReprUnionFind
ENodeData.Equality.Graph.Nodes, Data.Equality.Graph
equalitySaturationData.Equality.Saturation
equalitySaturation'Data.Equality.Saturation
extractBestData.Equality.Extraction
find 
1 (Function)Data.Equality.Utils.IntToIntMap
2 (Function)Data.Equality.Graph, Data.Equality.Graph.Monad
findReprData.Equality.Graph.ReprUnionFind
Fix 
1 (Type/Class)Data.Equality.Utils, Data.Equality.Saturation
2 (Data Constructor)Data.Equality.Utils, Data.Equality.Saturation
foldlWithKeyNM'Data.Equality.Graph.Nodes, Data.Equality.Graph
foldrWithKeyNM'Data.Equality.Graph.Nodes, Data.Equality.Graph
genericJoinData.Equality.Matching.Database
getData.Equality.Graph.Monad
getsData.Equality.Graph.Monad
hashStringData.Equality.Utils
insertData.Equality.Utils.IntToIntMap
insertLookupNMData.Equality.Graph.Nodes, Data.Equality.Graph
insertNMData.Equality.Graph.Nodes, Data.Equality.Graph
IntToIntMapData.Equality.Utils.IntToIntMap
IntTrieData.Equality.Matching.Database
isBannedData.Equality.Saturation.Scheduler
joinAData.Equality.Analysis
KeyData.Equality.Utils.IntToIntMap
LanguageData.Equality.Language, Data.Equality.Graph
Lens'Data.Equality.Graph.Lens
lookupNMData.Equality.Graph.Nodes, Data.Equality.Graph
makeAData.Equality.Analysis
makeNewSetData.Equality.Graph.ReprUnionFind
Match 
1 (Type/Class)Data.Equality.Matching
2 (Data Constructor)Data.Equality.Matching
matchClassIdData.Equality.Matching
matchSubstData.Equality.Matching
MemoData.Equality.Graph
memoData.Equality.Graph
merge 
1 (Function)Data.Equality.Graph
2 (Function)Data.Equality.Graph.Monad
MkIntTrieData.Equality.Matching.Database
modifyData.Equality.Graph.Monad
modifyAData.Equality.Analysis
NilData.Equality.Utils.IntToIntMap
NodeData.Equality.Graph.Nodes, Data.Equality.Graph
NodeMap 
1 (Type/Class)Data.Equality.Graph.Nodes, Data.Equality.Graph
2 (Data Constructor)Data.Equality.Graph.Nodes, Data.Equality.Graph
NonVariablePatternData.Equality.Matching.Pattern, Data.Equality.Matching
Operator 
1 (Type/Class)Data.Equality.Graph.Nodes, Data.Equality.Graph
2 (Data Constructor)Data.Equality.Graph.Nodes, Data.Equality.Graph
operatorData.Equality.Graph.Nodes, Data.Equality.Graph
overData.Equality.Graph.Lens
patData.Equality.Matching.Pattern, Data.Equality.Matching
PatternData.Equality.Matching.Pattern, Data.Equality.Matching
Query 
1 (Type/Class)Data.Equality.Matching.Database
2 (Data Constructor)Data.Equality.Matching.Database
rebuild 
1 (Function)Data.Equality.Graph
2 (Function)Data.Equality.Graph.Monad
representData.Equality.Graph.Monad
ReprUnionFindData.Equality.Graph.ReprUnionFind
RewriteData.Equality.Saturation.Rewrites, Data.Equality.Saturation
RewriteConditionData.Equality.Saturation.Rewrites, Data.Equality.Saturation
runEGraphMData.Equality.Graph.Monad
SchedulerData.Equality.Saturation.Scheduler
SelectAllQueryData.Equality.Matching.Database
setData.Equality.Graph.Lens
sizeNMData.Equality.Graph.Nodes, Data.Equality.Graph
sizeNodeMapData.Equality.Graph.Nodes, Data.Equality.Graph
StatData.Equality.Saturation.Scheduler
SubstData.Equality.Matching.Database
tkeysData.Equality.Matching.Database
traverseWithKeyNMData.Equality.Graph.Nodes, Data.Equality.Graph
trieData.Equality.Matching.Database
unFixData.Equality.Utils, Data.Equality.Saturation
unionFindData.Equality.Graph
unionSetsData.Equality.Graph.ReprUnionFind
unliftedFoldrData.Equality.Utils.IntToIntMap
unNodeData.Equality.Graph.Nodes, Data.Equality.Graph
unNodeMapData.Equality.Graph.Nodes, Data.Equality.Graph
unOperatorData.Equality.Graph.Nodes, Data.Equality.Graph
updateStatsData.Equality.Saturation.Scheduler
ValData.Equality.Utils.IntToIntMap
VarData.Equality.Matching.Database
VariablePatternData.Equality.Matching.Pattern, Data.Equality.Matching
viewData.Equality.Graph.Lens
WorklistData.Equality.Graph
worklistData.Equality.Graph
^.Data.Equality.Graph.Lens
_classData.Equality.Graph.Lens
_classesData.Equality.Graph.Lens
_dataData.Equality.Graph.Lens
_memoData.Equality.Graph.Lens
_nodesData.Equality.Graph.Lens
_parentsData.Equality.Graph.Lens