Top-1.7: Constraint solving framework employed by the Helium Compiler.

Safe HaskellSafe-Infered

Top.Ordering.Tree

Description

 

Documentation

type Trees a = [Tree a]Source

data Tree a Source

Constructors

Node (Trees a) 
AddList Direction [a] (Tree a) 
StrictOrder (Tree a) (Tree a) 
Spread Direction [a] (Tree a) 
Receive Int 
Phase Int [a] 
Chunk Int (Tree a) 

Instances

Functor Tree 
Show a => Show (Tree a) 

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

Constructors

Up 
Down 

type Spreaded a = Map Int [a]Source

type Phased a = Map Int (List a)Source

spreadTree :: (a -> Maybe Int) -> Tree a -> Tree aSource

phaseTree :: a -> Tree a -> Tree aSource

chunkTree :: Tree a -> [(Int, Tree a)]Source