Safe Haskell | None |
---|
- Referring to persistent tables
- toQ
- Unit
- Boolean logic
- Equality and Ordering
- Conditionals
- Maybe
- Either
- List Construction
- List Operations
- Special folds
- Sublists
- Searching Lists
- Zipping and Unzipping Lists
- Set-oriented operations
- Tuple Projection Functions
- Conversions between numeric types
- Rebind Monadic Combinators
- Construction of tuples and records
- Missing functions
This module is intended to be imported qualified
, to avoid name clashes
with Prelude functions. For example:
import qualified Database.DSH as Q import Database.DSH (Q)
Alternatively you can hide Prelude and import this module like this:
import Prelude () import Database.DSH
In this case you still get Prelude definitions that are not provided by Database.DSH.
- table :: (QA a, TA a) => String -> Q [a]
- tableDB :: (QA a, TA a) => String -> Q [a]
- tableWithKeys :: (QA a, TA a) => String -> [[String]] -> Q [a]
- tableCSV :: (QA a, TA a) => String -> Q [a]
- toQ :: QA a => a -> Q a
- unit :: Q ()
- false :: Q Bool
- true :: Q Bool
- not :: Q Bool -> Q Bool
- (&&) :: Q Bool -> Q Bool -> Q Bool
- (||) :: Q Bool -> Q Bool -> Q Bool
- eq :: (QA a, Eq a) => Q a -> Q a -> Q Bool
- (==) :: (QA a, Eq a) => Q a -> Q a -> Q Bool
- neq :: (QA a, Eq a) => Q a -> Q a -> Q Bool
- (/=) :: (QA a, Eq a) => Q a -> Q a -> Q Bool
- lt :: (QA a, Ord a) => Q a -> Q a -> Q Bool
- (<) :: (QA a, Ord a) => Q a -> Q a -> Q Bool
- lte :: (QA a, Ord a) => Q a -> Q a -> Q Bool
- (<=) :: (QA a, Ord a) => Q a -> Q a -> Q Bool
- gte :: (QA a, Ord a) => Q a -> Q a -> Q Bool
- (>=) :: (QA a, Ord a) => Q a -> Q a -> Q Bool
- gt :: (QA a, Ord a) => Q a -> Q a -> Q Bool
- (>) :: (QA a, Ord a) => Q a -> Q a -> Q Bool
- min :: (QA a, Ord a) => Q a -> Q a -> Q a
- max :: (QA a, Ord a) => Q a -> Q a -> Q a
- bool :: QA a => Q a -> Q a -> Q Bool -> Q a
- cond :: QA a => Q Bool -> Q a -> Q a -> Q a
- (?) :: QA a => Q Bool -> (Q a, Q a) -> Q a
- listToMaybe :: QA a => Q [a] -> Q (Maybe a)
- maybeToList :: QA a => Q (Maybe a) -> Q [a]
- nothing :: QA a => Q (Maybe a)
- just :: QA a => Q a -> Q (Maybe a)
- isNothing :: QA a => Q (Maybe a) -> Q Bool
- isJust :: QA a => Q (Maybe a) -> Q Bool
- fromJust :: QA a => Q (Maybe a) -> Q a
- maybe :: (QA a, QA b) => Q b -> (Q a -> Q b) -> Q (Maybe a) -> Q b
- fromMaybe :: QA a => Q a -> Q (Maybe a) -> Q a
- catMaybes :: QA a => Q [Maybe a] -> Q [a]
- mapMaybe :: (QA a, QA b) => (Q a -> Q (Maybe b)) -> Q [a] -> Q [b]
- pairToEither :: (QA a, QA b) => Q ([a], [b]) -> Q (Either a b)
- eitherToPair :: (QA a, QA b) => Q (Either a b) -> Q ([a], [b])
- left :: (QA a, QA b) => Q a -> Q (Either a b)
- right :: (QA a, QA b) => Q b -> Q (Either a b)
- isLeft :: (QA a, QA b) => Q (Either a b) -> Q Bool
- isRight :: (QA a, QA b) => Q (Either a b) -> Q Bool
- either :: (QA a, QA b, QA c) => (Q a -> Q c) -> (Q b -> Q c) -> Q (Either a b) -> Q c
- lefts :: (QA a, QA b) => Q [Either a b] -> Q [a]
- rights :: (QA a, QA b) => Q [Either a b] -> Q [b]
- partitionEithers :: (QA a, QA b) => Q [Either a b] -> Q ([a], [b])
- nil :: QA a => Q [a]
- empty :: QA a => Q [a]
- cons :: QA a => Q a -> Q [a] -> Q [a]
- (<|) :: QA a => Q a -> Q [a] -> Q [a]
- snoc :: QA a => Q [a] -> Q a -> Q [a]
- (|>) :: QA a => Q [a] -> Q a -> Q [a]
- singleton :: QA a => Q a -> Q [a]
- head :: QA a => Q [a] -> Q a
- tail :: QA a => Q [a] -> Q [a]
- take :: QA a => Q Integer -> Q [a] -> Q [a]
- drop :: QA a => Q Integer -> Q [a] -> Q [a]
- map :: (QA a, QA b) => (Q a -> Q b) -> Q [a] -> Q [b]
- append :: QA a => Q [a] -> Q [a] -> Q [a]
- (++) :: QA a => Q [a] -> Q [a] -> Q [a]
- filter :: QA a => (Q a -> Q Bool) -> Q [a] -> Q [a]
- groupWith :: (QA a, QA b, Ord b) => (Q a -> Q b) -> Q [a] -> Q [[a]]
- sortWith :: (QA a, QA b, Ord b) => (Q a -> Q b) -> Q [a] -> Q [a]
- the :: (QA a, Eq a) => Q [a] -> Q a
- last :: QA a => Q [a] -> Q a
- init :: QA a => Q [a] -> Q [a]
- null :: QA a => Q [a] -> Q Bool
- length :: QA a => Q [a] -> Q Integer
- index :: QA a => Q [a] -> Q Integer -> Q a
- (!!) :: QA a => Q [a] -> Q Integer -> Q a
- reverse :: QA a => Q [a] -> Q [a]
- and :: Q [Bool] -> Q Bool
- or :: Q [Bool] -> Q Bool
- any :: QA a => (Q a -> Q Bool) -> Q [a] -> Q Bool
- all :: QA a => (Q a -> Q Bool) -> Q [a] -> Q Bool
- sum :: (QA a, Num a) => Q [a] -> Q a
- concat :: QA a => Q [[a]] -> Q [a]
- concatMap :: (QA a, QA b) => (Q a -> Q [b]) -> Q [a] -> Q [b]
- maximum :: (QA a, Ord a) => Q [a] -> Q a
- minimum :: (QA a, Ord a) => Q [a] -> Q a
- splitAt :: QA a => Q Integer -> Q [a] -> Q ([a], [a])
- takeWhile :: QA a => (Q a -> Q Bool) -> Q [a] -> Q [a]
- dropWhile :: QA a => (Q a -> Q Bool) -> Q [a] -> Q [a]
- span :: QA a => (Q a -> Q Bool) -> Q [a] -> Q ([a], [a])
- break :: QA a => (Q a -> Q Bool) -> Q [a] -> Q ([a], [a])
- elem :: (QA a, Eq a) => Q a -> Q [a] -> Q Bool
- notElem :: (QA a, Eq a) => Q a -> Q [a] -> Q Bool
- lookup :: (QA a, QA b, Eq a) => Q a -> Q [(a, b)] -> Q (Maybe b)
- zip :: (QA a, QA b) => Q [a] -> Q [b] -> Q [(a, b)]
- zipWith :: (QA a, QA b, QA c) => (Q a -> Q b -> Q c) -> Q [a] -> Q [b] -> Q [c]
- unzip :: (QA a, QA b) => Q [(a, b)] -> Q ([a], [b])
- nub :: (QA a, Eq a) => Q [a] -> Q [a]
- fst :: (QA a, QA b) => Q (a, b) -> Q a
- snd :: (QA a, QA b) => Q (a, b) -> Q b
- pair :: (QA a, QA b) => Q a -> Q b -> Q (a, b)
- integerToDouble :: Q Integer -> Q Double
- return :: QA a => Q a -> Q [a]
- (>>=) :: (QA a, QA b) => Q [a] -> (Q a -> Q [b]) -> Q [b]
- (>>) :: (QA a, QA b) => Q [a] -> Q [b] -> Q [b]
- mzip :: (QA a, QA b) => Q [a] -> Q [b] -> Q [(a, b)]
- guard :: Q Bool -> Q [()]
- tuple :: View a b => b -> a
- record :: View a b => b -> a
- data Q a
- class Reify (Rep a) => QA a
- class (QA a, QA r) => Elim a r where
- class (ToView a ~ b, FromView b ~ a) => View a b where
- module Data.String
- module Data.Text
- module Database.HDBC
- module Prelude
Referring to persistent tables
toQ
Unit
Boolean logic
Equality and Ordering
Conditionals
Maybe
Either
List Construction
List Operations
Special folds
Sublists
Searching Lists
Zipping and Unzipping Lists
Set-oriented operations
Tuple Projection Functions
Conversions between numeric types
Rebind Monadic Combinators
Construction of tuples and records
Missing functions
This module offers most of the functions on lists given in PreludeList for the
Q
type. Missing functions are:
General folds:
foldl foldl1 scanl scanl1 foldr foldr1 scanr scanr1
Infinit lists:
iterate repeat cycle
String functions:
lines words unlines unwords
Zipping and unzipping lists:
zip3 zipWith3 unzip3
Fractional (Q Double) | |
Num (Q Double) | |
Num (Q Integer) | |
IsString (Q Text) | |
View (Q Bool) (Q Bool) | |
View (Q Char) (Q Char) | |
View (Q Double) (Q Double) | |
View (Q Integer) (Q Integer) | |
View (Q ()) (Q ()) | |
View (Q Text) (Q Text) | |
(~ * (ToView (Q (a, b))) (Q a, Q b), ~ * (FromView (Q a, Q b)) (Q (a, b)), QA a, QA b) => View (Q (a, b)) (Q a, Q b) |
class Reify (Rep a) => QA a Source
QA Bool | |
QA Char | |
QA Double | |
QA Integer | |
QA () | |
QA Text | |
(Reify (Rep [a]), QA a) => QA [a] | |
(Reify (Rep (Maybe a)), QA a) => QA (Maybe a) | |
(Reify (Rep (Either a b)), QA a, QA b) => QA (Either a b) | |
(Reify (Rep (a, b)), QA a, QA b) => QA (a, b) | |
(Reify (Rep (a0, b0, c0)), QA a0, QA b0, QA c0) => QA (a0, b0, c0) | |
(Reify (Rep (a0, b0, c0, d0)), QA a0, QA b0, QA c0, QA d0) => QA (a0, b0, c0, d0) | |
(Reify (Rep (a0, b0, c0, d0, e0)), QA a0, QA b0, QA c0, QA d0, QA e0) => QA (a0, b0, c0, d0, e0) | |
(Reify (Rep (a0, b0, c0, d0, e0, f0)), QA a0, QA b0, QA c0, QA d0, QA e0, QA f0) => QA (a0, b0, c0, d0, e0, f0) | |
(Reify (Rep (a0, b0, c0, d0, e0, f0, g0)), QA a0, QA b0, QA c0, QA d0, QA e0, QA f0, QA g0) => QA (a0, b0, c0, d0, e0, f0, g0) | |
(Reify (Rep (a0, b0, c0, d0, e0, f0, g0, h0)), QA a0, QA b0, QA c0, QA d0, QA e0, QA f0, QA g0, QA h0) => QA (a0, b0, c0, d0, e0, f0, g0, h0) | |
(Reify (Rep (a0, b0, c0, d0, e0, f0, g0, h0, i0)), QA a0, QA b0, QA c0, QA d0, QA e0, QA f0, QA g0, QA h0, QA i0) => QA (a0, b0, c0, d0, e0, f0, g0, h0, i0) | |
(Reify (Rep (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0)), QA a0, QA b0, QA c0, QA d0, QA e0, QA f0, QA g0, QA h0, QA i0, QA j0) => QA (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0) | |
(Reify (Rep (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0, k0)), QA a0, QA b0, QA c0, QA d0, QA e0, QA f0, QA g0, QA h0, QA i0, QA j0, QA k0) => QA (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0, k0) | |
(Reify (Rep (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0, k0, l0)), QA a0, QA b0, QA c0, QA d0, QA e0, QA f0, QA g0, QA h0, QA i0, QA j0, QA k0, QA l0) => QA (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0, k0, l0) | |
(Reify (Rep (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0, k0, l0, m0)), QA a0, QA b0, QA c0, QA d0, QA e0, QA f0, QA g0, QA h0, QA i0, QA j0, QA k0, QA l0, QA m0) => QA (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0, k0, l0, m0) | |
(Reify (Rep (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0, k0, l0, m0, n0)), QA a0, QA b0, QA c0, QA d0, QA e0, QA f0, QA g0, QA h0, QA i0, QA j0, QA k0, QA l0, QA m0, QA n0) => QA (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0, k0, l0, m0, n0) | |
(Reify (Rep (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0, k0, l0, m0, n0, o0)), QA a0, QA b0, QA c0, QA d0, QA e0, QA f0, QA g0, QA h0, QA i0, QA j0, QA k0, QA l0, QA m0, QA n0, QA o0) => QA (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0, k0, l0, m0, n0, o0) | |
(Reify (Rep (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0, k0, l0, m0, n0, o0, p0)), QA a0, QA b0, QA c0, QA d0, QA e0, QA f0, QA g0, QA h0, QA i0, QA j0, QA k0, QA l0, QA m0, QA n0, QA o0, QA p0) => QA (a0, b0, c0, d0, e0, f0, g0, h0, i0, j0, k0, l0, m0, n0, o0, p0) |
class (QA a, QA r) => Elim a r whereSource
(QA Bool, QA r) => Elim Bool r | |
(QA Char, QA r) => Elim Char r | |
(QA Double, QA r) => Elim Double r | |
(QA Integer, QA r) => Elim Integer r | |
(QA (), QA r) => Elim () r | |
(QA Text, QA r) => Elim Text r | |
(QA (Maybe a), QA a, QA r) => Elim (Maybe a) r | |
(QA (Either a b), QA a, QA b, QA r) => Elim (Either a b) r | |
(QA (a, b), QA a, QA b, QA r) => Elim (a, b) r |
module Data.String
module Data.Text
module Database.HDBC
module Prelude