LambdaCube.Compiler.Utils

Documentation

(<&>) :: Functor f => f a -> (a -> b) -> f b

dropIndex :: Int -> [a] -> [a]

iterateN :: Int -> (a -> a) -> a -> a

foldlrev :: Foldable t => (a -> b -> a) -> a -> t b -> a

data Void

Instances

Eq Void

Methods

(==) :: Void -> Void -> Bool

(/=) :: Void -> Void -> Bool

PShow Void

Methods

pShow :: Void -> Doc

HasFreeVars Void

Methods

getFreeVars :: Void -> FreeVars

Rearrange Void

Methods

rearrange :: Int -> RearrangeFun -> Void -> Void

SetSourceInfo SExp

Methods

setSI :: SI -> SExp -> SExp

DeBruijnify SIName SExp

Methods

deBruijnify_ :: Int -> [SIName] -> SExp -> SExp

elimVoid :: Void -> a

newtype SData a

Constructors

SData a

Instances

Eq (SData a)

Methods

(==) :: SData a -> SData a -> Bool

(/=) :: SData a -> SData a -> Bool

Ord (SData a)

Methods

compare :: SData a -> SData a -> Ordering

(<) :: SData a -> SData a -> Bool

(<=) :: SData a -> SData a -> Bool

(>) :: SData a -> SData a -> Bool

(>=) :: SData a -> SData a -> Bool

max :: SData a -> SData a -> SData a

min :: SData a -> SData a -> SData a

type Children k = k -> [k]

data Task a

Constructors

Return a

Visit a

scc :: forall k. (k -> Int) -> Children k -> Children k -> [k] -> [[k]]

prettyShowUnlines :: Show a => a -> String

readFileStrict :: FilePath -> IO String

readFileIfExists :: FilePath -> IO (Maybe (IO String))

Orphan instances

(Monoid w, MonadParsec e s m) => MonadParsec e s (RWST r w st m)

Methods

failure :: Set (ErrorItem (Token s)) -> Set (ErrorItem (Token s)) -> Set e -> RWST r w st m a

label :: String -> RWST r w st m a -> RWST r w st m a

hidden :: RWST r w st m a -> RWST r w st m a

try :: RWST r w st m a -> RWST r w st m a

lookAhead :: RWST r w st m a -> RWST r w st m a

notFollowedBy :: RWST r w st m a -> RWST r w st m ()

withRecovery :: (ParseError (Token s) e -> RWST r w st m a) -> RWST r w st m a -> RWST r w st m a

eof :: RWST r w st m ()

token :: (Token s -> Either (Set (ErrorItem (Token s)), Set (ErrorItem (Token s)), Set e) a) -> Maybe (Token s) -> RWST r w st m a

tokens :: (Token s -> Token s -> Bool) -> [Token s] -> RWST r w st m [Token s]

getParserState :: RWST r w st m (State s)

updateParserState :: (State s -> State s) -> RWST r w st m ()