| Copyright | (c) Fabricio Olivetti 2021 - 2024 |
|---|---|
| License | BSD3 |
| Maintainer | [email protected] |
| Stability | experimental |
| Portability | |
| Safe Haskell | None |
| Language | Haskell2010 |
Algorithm.EqSat.Queries
Description
Query functions for e-graphs Heavily based on hegg (https:/github.comalt-romes/hegg by alt-romes)
Synopsis
- getEClassesThat :: forall (m :: Type -> Type). Monad m => (EClass -> Bool) -> EGraphST m [EClassId]
- updateFitness :: forall (m :: Type -> Type). Monad m => Double -> EClassId -> EGraphST m ()
- findRootClasses :: forall (m :: Type -> Type). Monad m => EGraphST m [EClassId]
- getTopECLassThat :: forall (m :: Type -> Type). Monad m => Int -> (EClass -> Bool) -> EGraphST m [EClassId]
- getTopECLassWithSize :: forall (m :: Type -> Type). Monad m => Int -> Int -> EGraphST m [EClassId]
Documentation
getEClassesThat :: forall (m :: Type -> Type). Monad m => (EClass -> Bool) -> EGraphST m [EClassId] Source #
updateFitness :: forall (m :: Type -> Type). Monad m => Double -> EClassId -> EGraphST m () Source #
findRootClasses :: forall (m :: Type -> Type). Monad m => EGraphST m [EClassId] Source #
returns all the root e-classes (e-class without parents)