squeal/README.md
Eitan Chatav b2955a57b2 readme
2019-04-25 11:35:55 -07:00

281 lines
9.4 KiB
Markdown

# squeal
![squeal-icon](http://www.emoticonswallpapers.com/emotion/cute-big-pig/cute-pig-smiley-046.gif)
[![CircleCI](https://circleci.com/gh/echatav/squeal.svg?style=svg&circle-token=a699a654ef50db2c3744fb039cf2087c484d1226)](https://circleci.com/gh/morphismtech/squeal)
[Github](https://github.com/morphismtech/squeal)
[Hackage](https://hackage.haskell.org/package/squeal-postgresql)
[Stackage](https://www.stackage.org/package/squeal-postgresql)
[YouTube](https://www.youtube.com/watch?v=rWfEQfAaNc4)
## introduction
Squeal is a deep embedding of SQL into Haskell. By "deep embedding", I am abusing the
term somewhat. What I mean is that Squeal embeds both SQL terms and SQL types
into Haskell at the term and type levels respectively. This leads to a very high level
of type-safety in Squeal.
Squeal embeds not just the structured query language of SQL but also the
data manipulation language and the data definition language; that's `SELECT`,
`INSERT`, `UPDATE`, `DELETE`, `WITH`, `CREATE`, `DROP`, and `ALTER` commands.
Squeal expressions closely match their corresponding SQL expressions so that
the SQL they actually generate is completely predictable. They are also highly
composable and cover a large portion of SQL.
## features
* generic encoding of Haskell tuples and records into query parameters
and generic decoding of query results into Haskell records
using [`generics-sop`](https://hackage.haskell.org/package/generics-sop)
* access to SQL alias system using the `OverloadedLabels` extension
* type-safe `NULL` and `DEFAULT`
* type-safe SQL constraints `CHECK`, `UNIQUE`, `PRIMARY KEY` and `FOREIGN KEY`
* type-safe aggregation
* escape hatches for writing raw SQL
* [`mtl`](https://hackage.haskell.org/package/mtl) compatible monad transformer
for executing as well as preparing queries and manipulations
and [Atkey](https://bentnib.org/paramnotions-jfp.pdf) indexed monad transformer
for executing definitions.
* linear, invertible migrations
* connection pools
* transactions
* views
* array, composite and enumerated types
* json functions and operations
* multischema support
* correlated subqueries
* window functions
* text search
## installation
`stack install squeal-postgresql`
## testing
Start postgres on localhost port `5432` and create a database named `exampledb`.
`stack test`
## contributing
We welcome contributors.
Please make pull requests on the `dev` branch instead of `master`.
The `Issues` page is a good place to communicate.
## usage
Let's see an example!
First, we need some language extensions because Squeal uses modern GHC
features.
```Haskell
>>> :set -XDataKinds -XDeriveGeneric -XOverloadedLabels -XFlexibleContexts
>>> :set -XOverloadedStrings -XTypeApplications -XTypeOperators -XGADTs
```
We'll need some imports.
```Haskell
>>> import Control.Monad.IO.Class (liftIO)
>>> import Data.Int (Int32)
>>> import Data.Text (Text)
>>> import Squeal.PostgreSQL
```
We'll use generics to easily convert between Haskell and PostgreSQL values.
```Haskell
>>> import qualified Generics.SOP as SOP
>>> import qualified GHC.Generics as GHC
```
The first step is to define the schema of our database. This is where
we use `DataKinds` and `TypeOperators`.
```Haskell
>>> :{
type UsersColumns =
'[ "id" ::: 'Def :=> 'NotNull 'PGint4
, "name" ::: 'NoDef :=> 'NotNull 'PGtext ]
type UsersConstraints = '[ "pk_users" ::: 'PrimaryKey '["id"] ]
type EmailsColumns =
'[ "id" ::: 'Def :=> 'NotNull 'PGint4
, "user_id" ::: 'NoDef :=> 'NotNull 'PGint4
, "email" ::: 'NoDef :=> 'Null 'PGtext ]
type EmailsConstraints =
'[ "pk_emails" ::: 'PrimaryKey '["id"]
, "fk_user_id" ::: 'ForeignKey '["user_id"] "users" '["id"] ]
type Schema =
'[ "users" ::: 'Table (UsersConstraints :=> UsersColumns)
, "emails" ::: 'Table (EmailsConstraints :=> EmailsColumns) ]
type Schemas = Public Schema
:}
```
Notice the use of type operators.
`:::` is used to pair an alias `GHC.TypeLits.Symbol` with a `SchemumType`,
a `TableConstraint` or a `ColumnType`. It is intended to connote Haskell's `::`
operator.
`:=>` is used to pair `TableConstraints` with a `ColumnsType`,
yielding a `TableType`, or to pair a `ColumnConstraint` with a `NullityType`,
yielding a `ColumnType`. It is intended to connote Haskell's `=>` operator
Next, we'll write `Definition`s to set up and tear down the schema. In
Squeal, a `Definition` like `createTable`, `alterTable` or `dropTable`
has two type parameters, corresponding to the schema
before being run and the schema after. We can compose definitions using `>>>`.
Here and in the rest of our commands we make use of overloaded
labels to refer to named tables and columns in our schema.
```Haskell
>>> :{
let
setup :: Definition (Public '[]) Schemas
setup =
createTable #users
( serial `as` #id :*
(text & notNullable) `as` #name )
( primaryKey #id `as` #pk_users ) >>>
createTable #emails
( serial `as` #id :*
(int & notNullable) `as` #user_id :*
(text & nullable) `as` #email )
( primaryKey #id `as` #pk_emails :*
foreignKey #user_id #users #id
OnDeleteCascade OnUpdateCascade `as` #fk_user_id )
:}
```
We can easily see the generated SQL is unsurprising looking.
```Haskell
>>> printSQL setup
CREATE TABLE "users" ("id" serial, "name" text NOT NULL, CONSTRAINT "pk_users" PRIMARY KEY ("id"));
CREATE TABLE "emails" ("id" serial, "user_id" int NOT NULL, "email" text NULL, CONSTRAINT "pk_emails" PRIMARY KEY ("id"), CONSTRAINT "fk_user_id" FOREIGN KEY ("user_id") REFERENCES "users" ("id") ON DELETE CASCADE ON UPDATE CASCADE);
```
Notice that `setup` starts with an empty schema `'[]` and produces `Schema`.
In our `createTable` commands we included `TableConstraint`s to define
primary and foreign keys, making them somewhat complex. Our `teardown`
`Definition` is simpler.
```Haskell
>>> :{
let
teardown :: Definition Schemas (Public '[])
teardown = dropTable #emails >>> dropTable #users
:}
>>> printSQL teardown
DROP TABLE "emails";
DROP TABLE "users";
```
We'll need a Haskell type for @User@s. We give the type `Generics.SOP.Generic` and
`Generics.SOP.HasDatatypeInfo` instances so that we can encode and decode @User@s.
```Haskell
>>> data User = User { userName :: Text, userEmail :: Maybe Text } deriving (Show, GHC.Generic)
>>> instance SOP.Generic User
>>> instance SOP.HasDatatypeInfo User
```
Next, we'll write `Manipulation_`s to insert @User@s into our two tables.
A `Manipulation_` like `insertInto`, `update` or `deleteFrom`
has three type parameters, the schemas it refers to, input parameters
and an output row. When
we insert into the users table, we will need a parameter for the @name@
field but not for the @id@ field. Since it's serial, we can use a default
value. However, since the emails table refers to the users table, we will
need to retrieve the user id that the insert generates and insert it into
the emails table. We can do this in a single `Manipulation_` by using a
`with` statement.
```Haskell
>>> :{
let
insertUser :: Manipulation_ Schemas User ()
insertUser = with (u `as` #u) e
where
u = insertInto #users
(Values_ (Default `as` #id :* Set (param @1) `as` #name))
OnConflictDoRaise (Returning_ (#id :* param @2 `as` #email))
e = insertInto_ #emails $ Select
(Default `as` #id :* Set (#u ! #id) `as` #user_id :* Set (#u ! #email) `as` #email)
(from (common #u))
:}
>>> printSQL insertUser
WITH "u" AS (INSERT INTO "users" ("id", "name") VALUES (DEFAULT, ($1 :: text)) RETURNING "id" AS "id", ($2 :: text) AS "email") INSERT INTO "emails" ("user_id", "email") SELECT "u"."id", "u"."email" FROM "u" AS "u"
```
Next we write a `Query_` to retrieve users from the database. We're not
interested in the ids here, just the usernames and email addresses. We
need to use an `innerJoin` to get the right result. A `Query_` is like a
`Manipulation_` with the same kind of type parameters.
```Haskell
>>> :{
let
getUsers :: Query_ Schemas () User
getUsers = select_
(#u ! #name `as` #userName :* #e ! #email `as` #userEmail)
( from (table (#users `as` #u)
& innerJoin (table (#emails `as` #e))
(#u ! #id .== #e ! #user_id)) )
:}
>>> printSQL getUsers
SELECT "u"."name" AS "userName", "e"."email" AS "userEmail" FROM "users" AS "u" INNER JOIN "emails" AS "e" ON ("u"."id" = "e"."user_id")
```
Let's create some users to add to the database.
```Haskell
>>> :{
let
users :: [User]
users =
[ User "Alice" (Just "alice@gmail.com")
, User "Bob" Nothing
, User "Carole" (Just "carole@hotmail.com")
]
:}
```
Now we can put together all the pieces into a program. The program
connects to the database, sets up the schema, inserts the user data
(using prepared statements as an optimization), queries the user
data and prints it out and finally closes the connection. We can thread
the changing schema information through by using the indexed `PQ` monad
transformer and when the schema doesn't change we can use `Monad` and
`MonadPQ` functionality.
```Haskell
>>> :{
let
session :: PQ Schemas Schemas IO ()
session = do
_ <- traversePrepared_ insertUser users
usersResult <- runQuery getUsers
usersRows <- getRows usersResult
liftIO $ print (usersRows :: [User])
in
withConnection "host=localhost port=5432 dbname=exampledb" $
define setup
& pqThen session
& pqThen (define teardown)
:}
[User {userName = "Alice", userEmail = Just "alice@gmail.com"},User {userName = "Bob", userEmail = Nothing},User {userName = "Carole", userEmail = Just "carole@hotmail.com"}]
-}
```