Copyright	(c) Fabricio Olivetti 2021 - 2024
License	BSD3
Maintainer	fabricio.olivetti@gmail.com
Stability	experimental
Portability
Safe Haskell	None
Language	Haskell2010

Algorithm.EqSat.Egraph

Contents

Serialization
E-Graph basic supporting functions
Orphan instances

Description

Equality Graph data structure Heavily based on hegg (https:/github.comalt-romes/hegg by alt-romes)

Synopsis

type EClassId = Int
type ClassIdMap = IntMap
type ENode = SRTree EClassId
type ENodeEnc = (Int, Int, Int, Double)
type EGraphST (m :: Type -> Type) a = StateT EGraph m a
type Cost = Int
type CostFun = SRTree Cost -> Cost
type RangeTree a = Seq (a, EClassId)
encodeEnode :: ENode -> ENodeEnc
decodeEnode :: ENodeEnc -> ENode
insertRange :: (Ord a, Show a) => EClassId -> a -> RangeTree a -> RangeTree a
removeRange :: (Ord a, Show a) => EClassId -> a -> RangeTree a -> RangeTree a
getWithinRange :: Ord a => a -> a -> RangeTree a -> [EClassId]
getSmallest :: Ord a => RangeTree a -> (a, EClassId)
getGreatest :: Ord a => RangeTree a -> (a, EClassId)
data EGraph = EGraph {
- _canonicalMap :: ClassIdMap EClassId
- _eNodeToEClass :: Map ENode EClassId
- _eClass :: ClassIdMap EClass
- _eDB :: EGraphDB
}
data EGraphDB = EDB {
- _worklist :: HashSet (EClassId, ENode)
- _analysis :: HashSet (EClassId, ENode)
- _refits :: HashSet EClassId
- _patDB :: DB
- _fitRangeDB :: RangeTree Double
- _dlRangeDB :: RangeTree Double
- _sizeDB :: IntMap IntSet
- _sizeFitDB :: IntMap (RangeTree Double)
- _sizeDLDB :: IntMap (RangeTree Double)
- _unevaluated :: IntSet
- _nextId :: Int
}
data EClass = EClass {
- _eClassId :: Int
- _eNodes :: HashSet ENodeEnc
- _parents :: HashSet (EClassId, ENode)
- _height :: Int
- _info :: EClassData
}
data Consts
- = NotConst
- | ParamIx Int
- | ConstVal Double
data Property
- = Positive
- | Negative
- | NonZero
- | Real
data EClassData = EData {
- _cost :: Cost
- _best :: ENode
- _consts :: Consts
- _fitness :: Maybe Double
- _dl :: Maybe Double
- _theta :: Maybe PVector
- _size :: Int
}
type DB = Map (SRTree ()) IntTrie
data IntTrie = IntTrie {
- _keys :: HashSet EClassId
- _trie :: IntMap IntTrie
}
canonicalMap :: Lens' EGraph (ClassIdMap EClassId)
eClass :: Lens' EGraph (ClassIdMap EClass)
eDB :: Lens' EGraph EGraphDB
eNodeToEClass :: Lens' EGraph (Map ENode EClassId)
eClassId :: Lens' EClass Int
eNodes :: Lens' EClass (HashSet ENodeEnc)
height :: Lens' EClass Int
info :: Lens' EClass EClassData
parents :: Lens' EClass (HashSet (EClassId, ENode))
best :: Lens' EClassData ENode
consts :: Lens' EClassData Consts
cost :: Lens' EClassData Cost
dl :: Lens' EClassData (Maybe Double)
fitness :: Lens' EClassData (Maybe Double)
size :: Lens' EClassData Int
theta :: Lens' EClassData (Maybe PVector)
analysis :: Lens' EGraphDB (HashSet (EClassId, ENode))
dlRangeDB :: Lens' EGraphDB (RangeTree Double)
fitRangeDB :: Lens' EGraphDB (RangeTree Double)
nextId :: Lens' EGraphDB Int
patDB :: Lens' EGraphDB DB
refits :: Lens' EGraphDB (HashSet EClassId)
sizeDB :: Lens' EGraphDB (IntMap IntSet)
sizeDLDB :: Lens' EGraphDB (IntMap (RangeTree Double))
sizeFitDB :: Lens' EGraphDB (IntMap (RangeTree Double))
unevaluated :: Lens' EGraphDB IntSet
worklist :: Lens' EGraphDB (HashSet (EClassId, ENode))
emptyGraph :: EGraph
emptyDB :: EGraphDB
createEClass :: EClassId -> ENode -> EClassData -> Int -> EClass
canonical :: forall (m :: Type -> Type). Monad m => EClassId -> EGraphST m EClassId
canonize :: forall (m :: Type -> Type). Monad m => ENode -> EGraphST m ENode
getEClass :: forall (m :: Type -> Type). Monad m => EClassId -> EGraphST m EClass
trie :: EClassId -> IntMap IntTrie -> IntTrie
isConst :: forall (m :: Type -> Type). Monad m => EClassId -> EGraphST m Bool

Documentation

type EClassId = Int Source #

type ClassIdMap = IntMap Source #

type ENode = SRTree EClassId Source #

type ENodeEnc = (Int, Int, Int, Double) Source #

type EGraphST (m :: Type -> Type) a = StateT EGraph m a Source #

type Cost = Int Source #

type CostFun = SRTree Cost -> Cost Source #

type RangeTree a = Seq (a, EClassId) Source #

encodeEnode :: ENode -> ENodeEnc Source #

this assumes up to 999 variables and params

decodeEnode :: ENodeEnc -> ENode Source #

insertRange :: (Ord a, Show a) => EClassId -> a -> RangeTree a -> RangeTree a Source #

removeRange :: (Ord a, Show a) => EClassId -> a -> RangeTree a -> RangeTree a Source #

getWithinRange :: Ord a => a -> a -> RangeTree a -> [EClassId] Source #

getSmallest :: Ord a => RangeTree a -> (a, EClassId) Source #

getGreatest :: Ord a => RangeTree a -> (a, EClassId) Source #

data EGraph Source #

Constructors

EGraph
Fields _canonicalMap :: ClassIdMap EClassId _eNodeToEClass :: Map ENode EClassId _eClass :: ClassIdMap EClass _eDB :: EGraphDB

Instances

Instances details

Binary EGraph Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

put :: EGraph -> Put #

get :: Get EGraph #

putList :: [EGraph] -> Put #

Generic EGraph Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Associated Types

type Rep EGraph

Instance details

Defined in Algorithm.EqSat.Egraph

type Rep EGraph = D1 ('MetaData "EGraph" "Algorithm.EqSat.Egraph" "srtree-2.0.0.4-inplace" 'False) (C1 ('MetaCons "EGraph" 'PrefixI 'True) ((S1 ('MetaSel ('Just "_canonicalMap") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (ClassIdMap EClassId)) :*: S1 ('MetaSel ('Just "_eNodeToEClass") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (Map ENode EClassId))) :*: (S1 ('MetaSel ('Just "_eClass") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (ClassIdMap EClass)) :*: S1 ('MetaSel ('Just "_eDB") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 EGraphDB))))

Methods

from :: EGraph -> Rep EGraph x #

to :: Rep EGraph x -> EGraph #

Show EGraph Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

showsPrec :: Int -> EGraph -> ShowS #

show :: EGraph -> String #

showList :: [EGraph] -> ShowS #

type Rep EGraph Source #

Instance details

Defined in Algorithm.EqSat.Egraph

type Rep EGraph = D1 ('MetaData "EGraph" "Algorithm.EqSat.Egraph" "srtree-2.0.0.4-inplace" 'False) (C1 ('MetaCons "EGraph" 'PrefixI 'True) ((S1 ('MetaSel ('Just "_canonicalMap") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (ClassIdMap EClassId)) :*: S1 ('MetaSel ('Just "_eNodeToEClass") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (Map ENode EClassId))) :*: (S1 ('MetaSel ('Just "_eClass") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (ClassIdMap EClass)) :*: S1 ('MetaSel ('Just "_eDB") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 EGraphDB))))

data EGraphDB Source #

Constructors

EDB
Fields _worklist :: HashSet (EClassId, ENode) _analysis :: HashSet (EClassId, ENode) _refits :: HashSet EClassId _patDB :: DB _fitRangeDB :: RangeTree Double _dlRangeDB :: RangeTree Double _sizeDB :: IntMap IntSet _sizeFitDB :: IntMap (RangeTree Double) _sizeDLDB :: IntMap (RangeTree Double) _unevaluated :: IntSet _nextId :: Int

Instances

Instances details

Binary EGraphDB Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

put :: EGraphDB -> Put #

get :: Get EGraphDB #

putList :: [EGraphDB] -> Put #

Generic EGraphDB Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Associated Types

type Rep EGraphDB

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

from :: EGraphDB -> Rep EGraphDB x #

to :: Rep EGraphDB x -> EGraphDB #

Show EGraphDB Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

showsPrec :: Int -> EGraphDB -> ShowS #

show :: EGraphDB -> String #

showList :: [EGraphDB] -> ShowS #

type Rep EGraphDB Source #

Instance details

Defined in Algorithm.EqSat.Egraph

data EClass Source #

Constructors

EClass
Fields _eClassId :: Int _eNodes :: HashSet ENodeEnc _parents :: HashSet (EClassId, ENode) _height :: Int _info :: EClassData

Instances

Instances details

Binary EClass Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

put :: EClass -> Put #

get :: Get EClass #

putList :: [EClass] -> Put #

Generic EClass Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Associated Types

type Rep EClass

Instance details

Defined in Algorithm.EqSat.Egraph

type Rep EClass = D1 ('MetaData "EClass" "Algorithm.EqSat.Egraph" "srtree-2.0.0.4-inplace" 'False) (C1 ('MetaCons "EClass" 'PrefixI 'True) ((S1 ('MetaSel ('Just "_eClassId") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Int) :*: S1 ('MetaSel ('Just "_eNodes") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (HashSet ENodeEnc))) :*: (S1 ('MetaSel ('Just "_parents") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (HashSet (EClassId, ENode))) :*: (S1 ('MetaSel ('Just "_height") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Int) :*: S1 ('MetaSel ('Just "_info") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 EClassData)))))

Methods

from :: EClass -> Rep EClass x #

to :: Rep EClass x -> EClass #

Show EClass Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

showsPrec :: Int -> EClass -> ShowS #

show :: EClass -> String #

showList :: [EClass] -> ShowS #

Eq EClass Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

(==) :: EClass -> EClass -> Bool #

(/=) :: EClass -> EClass -> Bool #

type Rep EClass Source #

Instance details

Defined in Algorithm.EqSat.Egraph

type Rep EClass = D1 ('MetaData "EClass" "Algorithm.EqSat.Egraph" "srtree-2.0.0.4-inplace" 'False) (C1 ('MetaCons "EClass" 'PrefixI 'True) ((S1 ('MetaSel ('Just "_eClassId") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Int) :*: S1 ('MetaSel ('Just "_eNodes") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (HashSet ENodeEnc))) :*: (S1 ('MetaSel ('Just "_parents") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (HashSet (EClassId, ENode))) :*: (S1 ('MetaSel ('Just "_height") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Int) :*: S1 ('MetaSel ('Just "_info") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 EClassData)))))

data Consts Source #

Constructors

NotConst
ParamIx Int
ConstVal Double

Instances

Instances details

Binary Consts Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

put :: Consts -> Put #

get :: Get Consts #

putList :: [Consts] -> Put #

Generic Consts Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Associated Types

type Rep Consts

Instance details

Defined in Algorithm.EqSat.Egraph

type Rep Consts = D1 ('MetaData "Consts" "Algorithm.EqSat.Egraph" "srtree-2.0.0.4-inplace" 'False) (C1 ('MetaCons "NotConst" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "ParamIx" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Int)) :+: C1 ('MetaCons "ConstVal" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Double))))

Methods

from :: Consts -> Rep Consts x #

to :: Rep Consts x -> Consts #

Show Consts Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

showsPrec :: Int -> Consts -> ShowS #

show :: Consts -> String #

showList :: [Consts] -> ShowS #

Eq Consts Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

(==) :: Consts -> Consts -> Bool #

(/=) :: Consts -> Consts -> Bool #

type Rep Consts Source #

Instance details

Defined in Algorithm.EqSat.Egraph

type Rep Consts = D1 ('MetaData "Consts" "Algorithm.EqSat.Egraph" "srtree-2.0.0.4-inplace" 'False) (C1 ('MetaCons "NotConst" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "ParamIx" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Int)) :+: C1 ('MetaCons "ConstVal" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Double))))

data Property Source #

Constructors

Positive
Negative
NonZero
Real

Instances

Instances details

Binary Property Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

put :: Property -> Put #

get :: Get Property #

putList :: [Property] -> Put #

Generic Property Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Associated Types

type Rep Property

Instance details

Defined in Algorithm.EqSat.Egraph

type Rep Property = D1 ('MetaData "Property" "Algorithm.EqSat.Egraph" "srtree-2.0.0.4-inplace" 'False) ((C1 ('MetaCons "Positive" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Negative" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "NonZero" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Real" 'PrefixI 'False) (U1 :: Type -> Type)))

Methods

from :: Property -> Rep Property x #

to :: Rep Property x -> Property #

Show Property Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

showsPrec :: Int -> Property -> ShowS #

show :: Property -> String #

showList :: [Property] -> ShowS #

Eq Property Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

(==) :: Property -> Property -> Bool #

(/=) :: Property -> Property -> Bool #

type Rep Property Source #

Instance details

Defined in Algorithm.EqSat.Egraph

type Rep Property = D1 ('MetaData "Property" "Algorithm.EqSat.Egraph" "srtree-2.0.0.4-inplace" 'False) ((C1 ('MetaCons "Positive" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Negative" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "NonZero" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Real" 'PrefixI 'False) (U1 :: Type -> Type)))

data EClassData Source #

Constructors

EData
Fields _cost :: Cost _best :: ENode _consts :: Consts _fitness :: Maybe Double _dl :: Maybe Double _theta :: Maybe PVector _size :: Int

Instances

Instances details

Binary EClassData Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

put :: EClassData -> Put #

get :: Get EClassData #

putList :: [EClassData] -> Put #

Generic EClassData Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Associated Types

type Rep EClassData

Instance details

Defined in Algorithm.EqSat.Egraph

type Rep EClassData = D1 ('MetaData "EClassData" "Algorithm.EqSat.Egraph" "srtree-2.0.0.4-inplace" 'False) (C1 ('MetaCons "EData" 'PrefixI 'True) ((S1 ('MetaSel ('Just "_cost") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Cost) :*: (S1 ('MetaSel ('Just "_best") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 ENode) :*: S1 ('MetaSel ('Just "_consts") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Consts))) :*: ((S1 ('MetaSel ('Just "_fitness") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (Maybe Double)) :*: S1 ('MetaSel ('Just "_dl") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (Maybe Double))) :*: (S1 ('MetaSel ('Just "_theta") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (Maybe PVector)) :*: S1 ('MetaSel ('Just "_size") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Int)))))

Methods

from :: EClassData -> Rep EClassData x #

to :: Rep EClassData x -> EClassData #

Show EClassData Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

showsPrec :: Int -> EClassData -> ShowS #

show :: EClassData -> String #

showList :: [EClassData] -> ShowS #

Eq EClassData Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

(==) :: EClassData -> EClassData -> Bool #

(/=) :: EClassData -> EClassData -> Bool #

type Rep EClassData Source #

Instance details

Defined in Algorithm.EqSat.Egraph

type Rep EClassData = D1 ('MetaData "EClassData" "Algorithm.EqSat.Egraph" "srtree-2.0.0.4-inplace" 'False) (C1 ('MetaCons "EData" 'PrefixI 'True) ((S1 ('MetaSel ('Just "_cost") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Cost) :*: (S1 ('MetaSel ('Just "_best") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 ENode) :*: S1 ('MetaSel ('Just "_consts") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Consts))) :*: ((S1 ('MetaSel ('Just "_fitness") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (Maybe Double)) :*: S1 ('MetaSel ('Just "_dl") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (Maybe Double))) :*: (S1 ('MetaSel ('Just "_theta") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (Maybe PVector)) :*: S1 ('MetaSel ('Just "_size") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Int)))))

Serialization

type DB = Map (SRTree ()) IntTrie Source #

data IntTrie Source #

Constructors

IntTrie
Fields _keys :: HashSet EClassId _trie :: IntMap IntTrie

Instances

Instances details

Binary IntTrie Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

put :: IntTrie -> Put #

get :: Get IntTrie #

putList :: [IntTrie] -> Put #

Generic IntTrie Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Associated Types

type Rep IntTrie

Instance details

Defined in Algorithm.EqSat.Egraph

type Rep IntTrie = D1 ('MetaData "IntTrie" "Algorithm.EqSat.Egraph" "srtree-2.0.0.4-inplace" 'False) (C1 ('MetaCons "IntTrie" 'PrefixI 'True) (S1 ('MetaSel ('Just "_keys") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (HashSet EClassId)) :*: S1 ('MetaSel ('Just "_trie") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (IntMap IntTrie))))

Methods

from :: IntTrie -> Rep IntTrie x #

to :: Rep IntTrie x -> IntTrie #

Show IntTrie Source #

Instance details

Defined in Algorithm.EqSat.Egraph

Methods

showsPrec :: Int -> IntTrie -> ShowS #

show :: IntTrie -> String #

showList :: [IntTrie] -> ShowS #

type Rep IntTrie Source #

Instance details

Defined in Algorithm.EqSat.Egraph

type Rep IntTrie = D1 ('MetaData "IntTrie" "Algorithm.EqSat.Egraph" "srtree-2.0.0.4-inplace" 'False) (C1 ('MetaCons "IntTrie" 'PrefixI 'True) (S1 ('MetaSel ('Just "_keys") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (HashSet EClassId)) :*: S1 ('MetaSel ('Just "_trie") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 (IntMap IntTrie))))

canonicalMap :: Lens' EGraph (ClassIdMap EClassId) Source #

eClass :: Lens' EGraph (ClassIdMap EClass) Source #

eDB :: Lens' EGraph EGraphDB Source #

eNodeToEClass :: Lens' EGraph (Map ENode EClassId) Source #

eClassId :: Lens' EClass Int Source #

eNodes :: Lens' EClass (HashSet ENodeEnc) Source #

height :: Lens' EClass Int Source #

info :: Lens' EClass EClassData Source #

parents :: Lens' EClass (HashSet (EClassId, ENode)) Source #

best :: Lens' EClassData ENode Source #

consts :: Lens' EClassData Consts Source #

cost :: Lens' EClassData Cost Source #

dl :: Lens' EClassData (Maybe Double) Source #

fitness :: Lens' EClassData (Maybe Double) Source #

size :: Lens' EClassData Int Source #

theta :: Lens' EClassData (Maybe PVector) Source #

analysis :: Lens' EGraphDB (HashSet (EClassId, ENode)) Source #

dlRangeDB :: Lens' EGraphDB (RangeTree Double) Source #

fitRangeDB :: Lens' EGraphDB (RangeTree Double) Source #

nextId :: Lens' EGraphDB Int Source #

patDB :: Lens' EGraphDB DB Source #

refits :: Lens' EGraphDB (HashSet EClassId) Source #

sizeDB :: Lens' EGraphDB (IntMap IntSet) Source #

sizeDLDB :: Lens' EGraphDB (IntMap (RangeTree Double)) Source #

sizeFitDB :: Lens' EGraphDB (IntMap (RangeTree Double)) Source #

unevaluated :: Lens' EGraphDB IntSet Source #

worklist :: Lens' EGraphDB (HashSet (EClassId, ENode)) Source #

E-Graph basic supporting functions

emptyGraph :: EGraph Source #

returns an empty e-graph

emptyDB :: EGraphDB Source #

returns an empty e-graph DB

createEClass :: EClassId -> ENode -> EClassData -> Int -> EClass Source #

Creates a new e-class from an e-class id, a new e-node, and the info of this e-class

canonical :: forall (m :: Type -> Type). Monad m => EClassId -> EGraphST m EClassId Source #

gets the canonical id of an e-class

canonize :: forall (m :: Type -> Type). Monad m => ENode -> EGraphST m ENode Source #

canonize the e-node children

getEClass :: forall (m :: Type -> Type). Monad m => EClassId -> EGraphST m EClass Source #

gets an e-class with id c

trie :: EClassId -> IntMap IntTrie -> IntTrie Source #

Creates a singleton trie from an e-class id

isConst :: forall (m :: Type -> Type). Monad m => EClassId -> EGraphST m Bool Source #

Check whether an e-class is a constant value

Orphan instances

Binary PVector Source #

Instance details

Methods

put :: PVector -> Put #

get :: Get PVector #

putList :: [PVector] -> Put #

Hashable ENode Source #

Instance details

Methods

hashWithSalt :: Int -> ENode -> Int #

hash :: ENode -> Int #

Binary (SRTree EClassId) Source #

Instance details

Methods

put :: SRTree EClassId -> Put #

get :: Get (SRTree EClassId) #

putList :: [SRTree EClassId] -> Put #

Binary (SRTree ()) Source #

Instance details

Methods

put :: SRTree () -> Put #

get :: Get (SRTree ()) #

putList :: [SRTree ()] -> Put #

(Binary a, Hashable a) => Binary (HashSet a) Source #

Instance details

Methods

put :: HashSet a -> Put #

get :: Get (HashSet a) #

putList :: [HashSet a] -> Put #

Generic (EClassId, ENode) Source #

Instance details

Associated Types

type Rep (a, b)	Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics type Rep (a, b) = D1 ('MetaData "Tuple2" "GHC.Tuple" "ghc-prim" 'False) (C1 ('MetaCons "(,)" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b)))

Methods

from :: (EClassId, ENode) -> Rep (EClassId, ENode) x #

to :: Rep (EClassId, ENode) x -> (EClassId, ENode) #

Key	Shortcut
s	Open this search box
esc	Close this search box
↓,ctrl + j	Move down in search results
↑,ctrl + k	Move up in search results
↵	Go to active search result