Module

Type.Data.Symbol

#append 

append :: forall l r o. Append l r o => Proxy l -> Proxy r -> Proxy o

#compare 

compare :: forall l r o. Compare l r o => Proxy l -> Proxy r -> Proxy o

#uncons 

uncons :: forall h t s. Cons h t s => Proxy s -> { head :: Proxy h, tail :: Proxy t }

#Equals 

class Equals :: Symbol -> Symbol -> Boolean -> Constraintclass Equals lhs rhs out | lhs rhs -> out

Instances

#equals 

equals :: forall l r o. Equals l r o => Proxy l -> Proxy r -> Proxy o

Re-exports from Data.Symbol

#IsSymbol 

class IsSymbol :: Symbol -> Constraintclass IsSymbol (sym :: Symbol)  where

A class for known symbols

Members

#reifySymbol 

reifySymbol :: forall r. String -> (forall sym. IsSymbol sym => Proxy sym -> r) -> r

Re-exports from Prim.Symbol

#Append 

class Append (left :: Symbol) (right :: Symbol) (appended :: Symbol) | left right -> appended, right appended -> left, appended left -> right

Compiler solved type class for appending Symbols together.

#Compare 

class Compare (left :: Symbol) (right :: Symbol) (ordering :: Ordering) | left right -> ordering

Compiler solved type class for comparing two Symbols. Produces an Ordering.

#Cons 

class Cons (head :: Symbol) (tail :: Symbol) (symbol :: Symbol) | head tail -> symbol, symbol -> head tail

Compiler solved type class for either splitting up a symbol into its head and tail or for combining a head and tail into a new symbol. Requires the head to be a single character and the combined string cannot be empty.

Modules