Web.Routes.Nested.Types

Documentation

data Tries x s

The internal data structure built during route declaration.

Constructors

Tries

Fields

trieContent :: !(RootedPredTrie Text x)

trieCatchAll :: !(RootedPredTrie Text x)

trieSecurity :: !(RootedPredTrie Text s)

Instances

Monoid (Tries x s)

Monad m => MonadState (Tries x sec) (HandlerT x sec m)

trieContentMutable :: (Typeable x, Typeable s) => Tries x s' -> ST s (RootedHashTableTrie s Text x)

trieCatchAllMutable :: (Typeable x, Typeable s) => Tries x s' -> ST s (RootedHashTableTrie s Text x)

trieSecurityMutable :: (Typeable s', Typeable s) => Tries x s' -> ST s (RootedHashTableTrie s Text s')

newtype HandlerT x sec m a

The return type of a route building expression like match - it should have a shape of HandlerT (MiddlewareT m) (SecurityToken s) m a when used with route.

Constructors

HandlerT

Fields

runHandlerT :: StateT (Tries x sec) m a

Instances

MonadTrans (HandlerT x sec)

Monad m => MonadState (Tries x sec) (HandlerT x sec m)

Monad m => Monad (HandlerT x sec m)

Functor m => Functor (HandlerT x sec m)

Monad m => Applicative (HandlerT x sec m)

MonadIO m => MonadIO (HandlerT x sec m)

execHandlerT :: Monad m => HandlerT x sec m a -> m (Tries x sec)

Run the monad, only getting the built state and throwing away a.

type ExtrudeSoundly cleanxs xs c r = (cleanxs ~ CatMaybes xs, ArityTypeListIso c cleanxs r, Extrude (UrlChunks xs) (RootedPredTrie Text c) (RootedPredTrie Text r))

Deductive proof that prepending a list of types to a function as arity can be deconstructed.

type ActionT m a = VerbListenerT (FileExtListenerT m a) m a

The type of content builders.

action :: Monad m => ActionT m () -> MiddlewareT m

Run the content builder into a middleware that responds when the content is satisfiable (i.e. Accept headers are O.K., etc.)