| ! | 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 |
| addM | |
| 1 (Function) | Data.Equality.Graph |
| 2 (Function) | Data.Equality.Graph.Monad |
| allOf | Data.Equality.Graph.Lens |
| Analysis | Data.Equality.Analysis |
| AnalysisM | Data.Equality.Analysis.Monadic |
| ASetter | Data.Equality.Graph.Lens |
| Atom | |
| 1 (Type/Class) | Data.Equality.Matching.Database |
| 2 (Data Constructor) | Data.Equality.Matching.Database |
| BackoffScheduler | |
| 1 (Type/Class) | Data.Equality.Saturation.Scheduler |
| 2 (Data Constructor) | Data.Equality.Saturation.Scheduler |
| banLength | Data.Equality.Saturation.Scheduler |
| canonicalize | Data.Equality.Graph, Data.Equality.Graph.Monad |
| cata | Data.Equality.Utils, Data.Equality.Saturation |
| CClassId | Data.Equality.Matching.Database |
| children | Data.Equality.Graph.Nodes, Data.Equality.Graph |
| ClassId | Data.Equality.Graph.Classes.Id, Data.Equality.Graph.Classes, Data.Equality.Graph |
| ClassIdMap | Data.Equality.Graph.Classes.Id, Data.Equality.Graph.Classes, Data.Equality.Graph |
| ClassIdOrVar | Data.Equality.Matching.Database |
| compileToQuery | Data.Equality.Matching |
| CostFunction | Data.Equality.Extraction, Data.Equality.Saturation |
| CVar | Data.Equality.Matching.Database |
| Database | Data.Equality.Matching.Database |
| DB | Data.Equality.Matching.Database |
| defaultBackoffScheduler | Data.Equality.Saturation.Scheduler |
| deleteNM | Data.Equality.Graph.Nodes, Data.Equality.Graph |
| depthCost | Data.Equality.Extraction |
| EClass | |
| 1 (Type/Class) | Data.Equality.Graph.Classes, Data.Equality.Graph |
| 2 (Data Constructor) | Data.Equality.Graph.Classes, Data.Equality.Graph |
| eClassData | Data.Equality.Graph.Classes, Data.Equality.Graph |
| eClassId | Data.Equality.Graph.Classes, Data.Equality.Graph |
| eClassNodes | Data.Equality.Graph.Classes, Data.Equality.Graph |
| eClassParents | Data.Equality.Graph.Classes, Data.Equality.Graph |
| EGraph | Data.Equality.Graph, Data.Equality.Graph.Monad |
| egraph | Data.Equality.Graph.Monad |
| EGraphM | Data.Equality.Graph.Monad |
| EGraphMT | Data.Equality.Graph.Monad |
| eGraphToDatabase | Data.Equality.Matching |
| ematch | Data.Equality.Matching |
| emptyEGraph | Data.Equality.Graph, Data.Equality.Graph.Monad |
| emptyUF | Data.Equality.Graph.ReprUnionFind |
| ENode | Data.Equality.Graph.Nodes, Data.Equality.Graph |
| equalitySaturation | Data.Equality.Saturation |
| equalitySaturation' | Data.Equality.Saturation |
| extractBest | Data.Equality.Extraction |
| find | |
| 1 (Function) | Data.Equality.Utils.IntToIntMap |
| 2 (Function) | Data.Equality.Graph, Data.Equality.Graph.Monad |
| findRepr | Data.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 |
| genericJoin | Data.Equality.Matching.Database |
| get | Data.Equality.Graph.Monad |
| gets | Data.Equality.Graph.Monad |
| hashString | Data.Equality.Utils |
| insert | Data.Equality.Utils.IntToIntMap |
| insertLookupNM | Data.Equality.Graph.Nodes, Data.Equality.Graph |
| insertNM | Data.Equality.Graph.Nodes, Data.Equality.Graph |
| IntToIntMap | Data.Equality.Utils.IntToIntMap |
| IntTrie | Data.Equality.Matching.Database |
| isBanned | Data.Equality.Saturation.Scheduler |
| joinA | |
| 1 (Function) | Data.Equality.Analysis.Monadic |
| 2 (Function) | Data.Equality.Analysis |
| Key | Data.Equality.Utils.IntToIntMap |
| Language | Data.Equality.Language, Data.Equality.Graph |
| Lens | Data.Equality.Graph.Lens |
| Lens' | Data.Equality.Graph.Lens |
| lookupNM | Data.Equality.Graph.Nodes, Data.Equality.Graph |
| makeA | |
| 1 (Function) | Data.Equality.Analysis.Monadic |
| 2 (Function) | Data.Equality.Analysis |
| makeNewSet | Data.Equality.Graph.ReprUnionFind |
| Match | |
| 1 (Type/Class) | Data.Equality.Matching |
| 2 (Data Constructor) | Data.Equality.Matching |
| matchClassId | Data.Equality.Matching |
| matchLimit | Data.Equality.Saturation.Scheduler |
| matchSubst | Data.Equality.Matching |
| merge | |
| 1 (Function) | Data.Equality.Graph |
| 2 (Function) | Data.Equality.Graph.Monad |
| mergeM | |
| 1 (Function) | Data.Equality.Graph |
| 2 (Function) | Data.Equality.Graph.Monad |
| MkIntTrie | Data.Equality.Matching.Database |
| modify | Data.Equality.Graph.Monad |
| modifyA | |
| 1 (Function) | Data.Equality.Analysis.Monadic |
| 2 (Function) | Data.Equality.Analysis |
| newEClass | Data.Equality.Graph |
| Nil | Data.Equality.Utils.IntToIntMap |
| Node | Data.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 |
| NonVariablePattern | Data.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 |
| operator | Data.Equality.Graph.Nodes, Data.Equality.Graph |
| over | Data.Equality.Graph.Lens |
| pat | Data.Equality.Matching.Pattern, Data.Equality.Matching |
| Pattern | Data.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 |
| rebuildM | |
| 1 (Function) | Data.Equality.Graph |
| 2 (Function) | Data.Equality.Graph.Monad |
| represent | |
| 1 (Function) | Data.Equality.Graph |
| 2 (Function) | Data.Equality.Graph.Monad |
| representM | |
| 1 (Function) | Data.Equality.Graph |
| 2 (Function) | Data.Equality.Graph.Monad |
| ReprUnionFind | Data.Equality.Graph.ReprUnionFind |
| Rewrite | Data.Equality.Saturation.Rewrites, Data.Equality.Saturation |
| RewriteCondition | Data.Equality.Saturation.Rewrites, Data.Equality.Saturation |
| runEGraphM | Data.Equality.Graph.Monad |
| runEGraphMT | Data.Equality.Graph.Monad |
| runEqualitySaturation | Data.Equality.Saturation |
| Scheduler | Data.Equality.Saturation.Scheduler |
| SelectAllQuery | Data.Equality.Matching.Database |
| set | Data.Equality.Graph.Lens |
| sizeNM | Data.Equality.Graph.Nodes, Data.Equality.Graph |
| sizeSL | Data.Equality.Utils.SizedList |
| SList | |
| 1 (Type/Class) | Data.Equality.Utils.SizedList |
| 2 (Data Constructor) | Data.Equality.Utils.SizedList |
| Stat | Data.Equality.Saturation.Scheduler |
| Subst | Data.Equality.Matching.Database |
| tkeys | Data.Equality.Matching.Database |
| toListSL | Data.Equality.Utils.SizedList |
| Traversal | Data.Equality.Graph.Lens |
| traverseOf | Data.Equality.Graph.Lens |
| traverseWithKeyNM | Data.Equality.Graph.Nodes, Data.Equality.Graph |
| trie | Data.Equality.Matching.Database |
| unFix | Data.Equality.Utils, Data.Equality.Saturation |
| unionSets | Data.Equality.Graph.ReprUnionFind |
| unliftedFoldr | Data.Equality.Utils.IntToIntMap |
| unNode | Data.Equality.Graph.Nodes, Data.Equality.Graph |
| unNodeMap | Data.Equality.Graph.Nodes, Data.Equality.Graph |
| unOperator | Data.Equality.Graph.Nodes, Data.Equality.Graph |
| updateStats | Data.Equality.Saturation.Scheduler |
| Val | Data.Equality.Utils.IntToIntMap |
| Var | Data.Equality.Matching.Database |
| VariablePattern | Data.Equality.Matching.Pattern, Data.Equality.Matching |
| view | Data.Equality.Graph.Lens |
| ^. | Data.Equality.Graph.Lens |
| _class | Data.Equality.Graph.Lens |
| _classes | Data.Equality.Graph.Lens |
| _data | Data.Equality.Graph.Lens |
| _iclasses | Data.Equality.Graph.Lens |
| _memo | Data.Equality.Graph.Lens |
| _nodes | Data.Equality.Graph.Lens |
| _parents | Data.Equality.Graph.Lens |
| |: | Data.Equality.Utils.SizedList |