Top-1.7: Constraint solving framework employed by the Helium Compiler.
Top.Ordering.Tree
Description
type Trees a = [Tree a]Source
data Tree a Source
Constructors
Instances
emptyTree :: Tree aSource
unitTree :: a -> Tree aSource
listTree :: [a] -> Tree aSource
binTree :: Tree a -> Tree a -> Tree aSource
(.>.), (.<<.), (.<.), (.>>.) :: [a] -> Tree a -> Tree aSource
makeTreeHelper :: (t -> [a] -> t1 -> t1) -> t -> [a] -> t1 -> t1Source
data Direction Source
type Spreaded a = Map Int [a]Source
type Phased a = Map Int (List a)Source
flattenTree :: TreeWalk -> Tree a -> [a]Source
spreadTree :: (a -> Maybe Int) -> Tree a -> Tree aSource
phaseTree :: a -> Tree a -> Tree aSource
chunkTree :: Tree a -> [(Int, Tree a)]Source