lambdacube-compiler-0.6.0.1: LambdaCube 3D is a DSL to program GPUs

Safe HaskellNone
LanguageHaskell2010

LambdaCube.Compiler.Utils

Contents

Documentation

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

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

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

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

data Void Source #

Instances

elimVoid :: Void -> a Source #

newtype SData a Source #

Constructors

SData a 

Instances

Eq (SData a) Source # 

Methods

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

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

Ord (SData a) Source # 

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] Source #

data Task a Source #

Constructors

Return a 
Visit a 

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

prettyShowUnlines :: Show a => a -> String Source #

readFileStrict :: FilePath -> IO String Source #

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

Orphan instances

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

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 () #