on 7c5422f help sign in
.github/workflows/build.yaml+3−3
since splitsnapshots
unifiedsplit
@@ -9,14 +9,14 @@ jobs:
9 persist-credentials: false
9 persist-credentials: false
10 submodules: true
10 submodules: true
11
11
12− - uses: cachix/install-nix-action@v14.1
12+ - uses: cachix/install-nix-action@v12
13 with:
13 with:
14 nix_path: nixpkgs=channel:nixos-unstable
14 nix_path: nixpkgs=channel:nixos-unstable
15 extra_nix_config: |
15 extra_nix_config: |
16 trusted-public-keys = cache.nixos.org-1:6NCHdD59X431o0gWypbMrAURkbJ16ZPMQFGspcDShjY= hydra.iohk.io:f/Ea+s+dFdN+3Y/G+FDgSq+a5NEWhJGzdjvKNGv0/EQ=
16 trusted-public-keys = cache.nixos.org-1:6NCHdD59X431o0gWypbMrAURkbJ16ZPMQFGspcDShjY= hydra.iohk.io:f/Ea+s+dFdN+3Y/G+FDgSq+a5NEWhJGzdjvKNGv0/EQ=
17− substituters = https://cache.nixos.org/ https://cache.iog.io
17+ substituters = https://cache.nixos.org/ https://hydra.iohk.io
18
18
19− - uses: cachix/cachix-action@v10
19+ - uses: cachix/cachix-action@v8
20 with:
20 with:
21 name: rel8
21 name: rel8
22 authToken: '${{ secrets.CACHIX_AUTH_TOKEN }}'
22 authToken: '${{ secrets.CACHIX_AUTH_TOKEN }}'
Changelog.md+1−128
@@ -1,140 +1,13 @@
1−# 1.4.0.0 (2002-08-17)
1+# 1.1.0.0 (??)
2
2
3## Breaking changes
3## Breaking changes
4
4
5−* The behavior of `greatest`/`least` has been corrected, and was previously flipped. ([#183](https://github.com/circuithub/rel8/pull/183))
6−
7−## New features
8−
9−* `NullTable`/`HNull` have been added. This is an alternative to `MaybeTable` that doesn't use a tag columns. It's less flexible (no `Functor` or `Applicative` instance) and is meaningless when used with a table that has no non-nullable columns (so nesting `NullTable` is redundant). But in situations where the underlying `Table` does have non-nullable columns, it can losslessly converted to and from `MaybeTable`. It is useful for embedding into a base table when you don't want to store the extra tag column in your schema. ([#173](https://github.com/circuithub/rel8/pull/173))
10−* Add `fromMaybeTable`. ([#179](https://github.com/circuithub/rel8/pull/179))
11−* Add `alignMaybeTable`. ([#196](https://github.com/circuithub/rel8/pull/196))
12−
13−## Improvements
14−
15−* Optimize implementation of `AltTable` for `Tabulation` ([#178](https://github.com/circuithub/rel8/pull/178))
16−
17−## Other
18−
19−* Documentation improvements for `HADT`. ([#177](https://github.com/circuithub/rel8/pull/177))
20−* Document example usage of `groupBy`. ([#184](https://github.com/circuithub/rel8/pull/184))
21−* Build with and require Opaleye >= 0.9.3.3. ([#190](https://github.com/circuithub/rel8/pull/190))
22−* Build with `hasql` 1.6. ([#195](https://github.com/circuithub/rel8/pull/195))
23−
24−# 1.3.1.0 (2022-01-20)
25−
26−## Other
27−
28−* Rel8 now requires Opaleye >= 0.9.1. ([#165](https://github.com/circuithub/rel8/pull/165))
29−
30−# 1.3.0.0 (2022-01-31)
31−
32−## Breaking changes
33−
34−* `div` and `mod` have been changed to match Haskell semantics. If you need the PostgreSQL `div()` and `mod()` functions, use `quot` and `rem`. While this is not an API change, we feel this is a breaking change in semantics and have bumped the major version number. ([#155](https://github.com/circuithub/rel8/pull/155))
35−
36−## New features
37−
38−* `divMod` and `quotRem` functions have been added, matching Haskell's `Prelude` functions. ([#155](https://github.com/circuithub/rel8/pull/155))
39−* `avg` and `mode` aggregation functions to find the mean value of an expression, or the most common row in a query, respectively. ([#152](https://github.com/circuithub/rel8/pull/152))
40−* The full `EqTable` and `OrdTable` classes have been exported, allowing for instances to be manually created. ([#157](https://github.com/circuithub/rel8/pull/157))
41−* Added `like` and `ilike` (for the `LIKE` and `ILIKE` operators). ([#146](https://github.com/circuithub/rel8/pull/146))
42−
43−## Other
44−
45−* Rel8 now requires Opaleye 0.9. ([#158](https://github.com/circuithub/rel8/pull/158))
46−* Rel8's test suite supports Hedgehog 1.1. ([#160](https://github.com/circuithub/rel8/pull/160))
47−* The documentation for binary operations has been corrected. ([#162](https://github.com/circuithub/rel8/pull/162))
48−
49−# 1.2.2.0 (2021-11-21)
50−
51−## Other
52−
53−* Support GHC 9.2 ([#145](https://github.com/circuithub/rel8/pull/145))
54−* Correct the documentation for `except` ([#147](https://github.com/circuithub/rel8/pull/147))
55−* Support `hasql` 1.5 ([#149](https://github.com/circuithub/rel8/pull/149))
56−
57−# 1.2.1.0 (2021-11-21)
58−
59−## New features
60−
61−* `castTable` has been added, which casts all columns selected from in `Query` according to the types of columns. This can occasionally be useful when using `many`/`some` on older PostgreSQL versions. ([#137](https://github.com/circuithub/rel8/pull/137))
62−
63−* Added `<:`, `<=:`, `>:`, `>=:`, `greatest` and `least`, which sort all columns in a table lexicographically. These operators are like the `<.` operators which operate on `Expr`s, but the `<:` operate on entire tables. ([#139](https://github.com/circuithub/rel8/pull/139))
64−
65−## Other
66−
67−* Support opaleye-0.8 ([#142](https://github.com/circuithub/rel8/pull/142))
68−
69−# 1.2.0.0 (2021-10-22)
70−
71−## New features
72−
73−* New `$*` and `$+` operators for projecting out of `ListTable` and `NonEmptyTable` respectively (analogous to the existing `$?` for `MaybeTable`). ([#125](https://github.com/circuithub/rel8/pull/125))
74−
75−## Bug fixes
76−
77−* Fix `UPSERT` support (and add tests), which was broken due to a typo inside Rel8 that made it impossible to construct `Projection`s which are needed by `UPSERT`. ([#134](https://github.com/circuithub/rel8/pull/134))
78−
79−* Remove `DBMin` and `DBMax` instances for `Bool`, which are invalid as far as Postgres is concerned. `and` and `or` can be used to achieve the same thing. ([#126](https://github.com/circuithub/rel8/pull/126))
80−
81−* Fix `aggregateMaybeTable`, `aggregateEitherTable` and `aggregateTheseTable`, which generated invalid SQL previously. ([#127](https://github.com/circuithub/rel8/pull/127))
82−
83−## Breaking changes
84−
85−* `rebind` now takes an additional argument for the "name" of the binding. ([#128](https://github.com/circuithub/rel8/pull/128))
86−
87−# 1.1.0.0 (2021-07-16)
88−
89−## New features
90−
91−* You can derive `Rel8able` for "vanilla" higher-kinded data types - data types that don't use the `Column` type family. For example, the following is now possible:
92−
93− ```haskell
94− data MyTable f = MyTable
95− { myTableX :: f Int32
96− , myTableY :: f Text
97− } deriving (Generic, Rel8able)
98− ```
99−
100−* The `Projectable` and `Biprojectable` type classes have been introduced. These classes model a type of functors and bifunctors (respectively) on tables, where the mapping function is only able to rearrange columns. For example, the following is now possible:
101−
102− ```haskell
103− x <- project myTableX <$> many ...
104− ```
105−
106−* `Insert`'s `onConflict` field now has a new option - `DoUpdate`. This maps to PostgreSQL's `ON CONFLICT DO UPDATE` syntax, which provides upsert support. ([#85](https://github.com/circuithub/rel8/pull/85))
107−
108−* `Insert`, `Update` and `Delete` has all been expanded to work with `Query`s. In particular:
109−
110− * `Delete` now supports a `USING` sub-query
111− * `Update` now supports a `FROM` sub-query
112− * `Insert` can delete the result of any arbitrary `Query` (providing the types match)
113−
114−* The new `Rel8.Tabulate` module has been added, which gives a `Map`-esque interface to writing and composing queries. ([#70](https://github.com/circuithub/rel8/pull/70))
115−
116−* The new `indexed` `Query -> Query` function was added. This function augments each row in a query with it's 0-based index. ([#117](https://github.com/circuithub/rel8/pull/117))
117−
118−## Breaking changes
119−
120−* `Insert`, `Delete` and `Update` have all changed. In particular, for `Insert` users should now replace `rows = xs` with `rows = values xs`. ([#85](https://github.com/circuithub/rel8/pull/85))
121−
122* Rename `whereExists` and `whereNotExists` to `present` and `absent` respectively. ([#57](https://github.com/circuithub/rel8/pull/57))
5* Rename `whereExists` and `whereNotExists` to `present` and `absent` respectively. ([#57](https://github.com/circuithub/rel8/pull/57))
123
6
124* Simplify `evaluate` to run directly inside the `Query` monad, rendering the `Evaluate` monad unnecessary. ([#56](https://github.com/circuithub/rel8/pull/56))
7* Simplify `evaluate` to run directly inside the `Query` monad, rendering the `Evaluate` monad unnecessary. ([#56](https://github.com/circuithub/rel8/pull/56))
125
8
126* The `Labelable` type class has been removed as it's no longer necessary. This class was mostly internal, though was visible in some public API functions. ([#76](https://github.com/circuithub/rel8/pull/76))
9* The `Labelable` type class has been removed as it's no longer necessary. This class was mostly internal, though was visible in some public API functions. ([#76](https://github.com/circuithub/rel8/pull/76))
127
10
128−* `EitherTable`, `ListTable`, `MaybeTable`, `NonEmptyTable` and `TheseTable` now all have an extra parameter which tracks the context of the table. If you manually specified any types before, you need to provide this parameter - usually `Expr` will be the correct choice. ([#101](https://github.com/circuithub/rel8/pull/101))
129−
130−* We've done a lot of work to simplify the internals of Rel8, but some of these are breaking changes. However, most of these API changes shouldn't affect users as they are mostly types used in type inference, or affect classes where users don't need to define their own instances.
131−
132− * The kind of a `Rel8able` is now `(Type -> Type) -> Type`. Previously it was `(X -> Type) -> Type`.
133− * `Table` has a new associated type - `FromExprs`. This was previously an open type family.
134− * `Table` has a new associated type - `Transpose` - and `Recontextualise` has been renamed to `Transposes`. This `Transposes` class now operates in terms of `Transpose`.
135−
136−* `select`, `insert`, `update` and `delete` now produce Hasql `Statement`s, rather than actually running the statement as IO. This allows Rel8 to be used with transaction/connection-managing monads like [`hasql-transaction`](https://hackage.haskell.org/package/hasql-transaction). ([#94](https://github.com/circuithub/rel8/pull/94))
137−
138## Bug fixes
11## Bug fixes
139
12
140* Fixes a bug where cartesian products of queries using `catListTable`, `catNonEmptyTable`, `catList` and `catNonEmpty` would incorrectly be zipped instead. ([#61](https://github.com/circuithub/rel8/pull/61))
13* Fixes a bug where cartesian products of queries using `catListTable`, `catNonEmptyTable`, `catList` and `catNonEmpty` would incorrectly be zipped instead. ([#61](https://github.com/circuithub/rel8/pull/61))
cabal.project+5
@@ -1 +1,6 @@
1packages: .
1packages: .
2+
3+allow-newer: generic-monoid:base
4+allow-newer: cryptohash-sha1:base
5+allow-newer: cryptohash-md5:base
6+allow-newer: entropy:Cabal
cabal.project.haskell-nix+6
@@ -2,3 +2,9 @@
2-- will interpret them as local packages, and try to build them when we cabal
2-- will interpret them as local packages, and try to build them when we cabal
3-- build. The only reason we have to specify these is for Haskell.nix to know to
3-- build. The only reason we have to specify these is for Haskell.nix to know to
4-- override these packages by fetching them rather than using Hackage.
4-- override these packages by fetching them rather than using Hackage.
5+
6+source-repository-package
7+ type: git
8+ location: git://github.com/jcpetruzza/barbies
9+ tag: f99b05454874192e3511bd133555dfb6cc6a6ecb
10+ --sha256: 0yy2i2jbllwavv5d2176rf8lmm4l1ws90lxkmdlfgvfzqxidx0gi
default.nix+2−2
@@ -1,11 +1,11 @@
1let
1let
2 haskellNix = import (import ./nix/sources.nix)."haskell.nix" {};
2 haskellNix = import (import ./nix/sources.nix)."haskell.nix" {};
3
3
4− nixpkgsSrc = haskellNix.sources.nixpkgs-unstable;
4+ nixpkgsSrc = haskellNix.sources.nixpkgs-2009;
5
5
6 nixpkgsArgs = haskellNix.nixpkgsArgs;
6 nixpkgsArgs = haskellNix.nixpkgsArgs;
7
7
8− compiler-nix-name = "ghc924";
8+ compiler-nix-name = "ghc901";
9
9
10 pkgs = import nixpkgsSrc nixpkgsArgs;
10 pkgs = import nixpkgsSrc nixpkgsArgs;
11
11
docs/concepts/insert.rst+10−37
@@ -21,16 +21,9 @@ using ``delete``. ``Delete`` takes:
21``from``
21``from``
22 The ``TableSchema`` for the table to delete rows from.
22 The ``TableSchema`` for the table to delete rows from.
23
23
24−``using``
25− This is a simple ``Query`` that forms the ``USING`` clause of the ``DELETE``
26− statement. This can be used to join against other tables, and the results
27− can be referenced in the ``deleteWhere`` parameter. For simple ``DELETE``\s
28− where you don't need to do this, you can set ``using = pure ()``.
29−
30``deleteWhere``
24``deleteWhere``
31 The ``WHERE`` clause of the ``DELETE`` statement. This is a function that
25 The ``WHERE`` clause of the ``DELETE`` statement. This is a function that
32− takes two inputs: the result of the ``using`` query, and the current value
26+ takes a single ``Expr`` table as input.
33− of the row.
34
27
35``returning``
28``returning``
36 What to return - see :ref:`returning`.
29 What to return - see :ref:`returning`.
@@ -44,23 +37,16 @@ using ``update``. ``Update`` takes:
44``target``
37``target``
45 The ``TableSchema`` for the table to update rows in.
38 The ``TableSchema`` for the table to update rows in.
46
39
47−``from``
40+``updateWhere``
48− This is a simple ``Query`` that forms the ``FROM`` clause of the ``UPDATE``
41+ The ``WHERE`` clause of the ``UPDATE`` statement. This is a function that
49− statement. This can be used to join against other tables, and the results
42+ takes a single ``Expr`` table as input.
50− can be referenced in the ``set`` and ``updateWhere`` parameters. For simple
51− ``UPDATE``\s where you don't need to do this, you can set ``from = pure ()``.
52
43
53``set``
44``set``
54 A row to row transformation function, indicating how to update selected rows.
45 A row to row transformation function, indicating how to update selected rows.
55 This function takes rows of the same shape as ``target`` but in the ``Expr``
46 This function takes rows of the same shape as ``target`` but in the ``Expr``
56 context. One way to write this function is to use record update syntax::
47 context. One way to write this function is to use record update syntax::
57
48
58− set = \from row -> row { rowName = "new name" }
49+ set = \row -> row { rowName = "new name" }
59−
60−``updateWhere``
61− The ``WHERE`` clause of the ``UPDATE`` statement. This is a function that
62− takes two inputs: the result of the ``from`` query, and the current value of
63− the row.
64
50
65``returning``
51``returning``
66 What to return - see :ref:`returning`.
52 What to return - see :ref:`returning`.
@@ -78,11 +64,11 @@ using ``insert``. ``Insert`` takes:
78 The rows to insert. These are the same as ``into``, but in the ``Expr``
64 The rows to insert. These are the same as ``into``, but in the ``Expr``
79 context. You can construct rows from their individual fields::
65 context. You can construct rows from their individual fields::
80
66
81− rows = values [ MyTable { myTableA = lit "A", myTableB = lit 42 }
67+ rows = [ MyTable { myTableA = lit "A", myTableB = lit 42 }
82
68
83 or you can use ``lit`` on a table value in the ``Result`` context::
69 or you can use ``lit`` on a table value in the ``Result`` context::
84
70
85− rows = values [ lit MyTable { myTableA = "A", myTableB = 42 }
71+ rows = [ lit MyTable { myTableA = "A", myTableB = 42 }
86
72
87``onConflict``
73``onConflict``
88 What should happen if an insert clashes with rows that already exist. This
74 What should happen if an insert clashes with rows that already exist. This
@@ -94,10 +80,6 @@ using ``insert``. ``Insert`` takes:
94 ``DoNothing``
80 ``DoNothing``
95 PostgreSQL should not insert the duplicate rows.
81 PostgreSQL should not insert the duplicate rows.
96
82
97− ``DoUpdate``
98− PostgreSQL should instead try to update any existing rows that conflict
99− with rows proposed for insertion.
100−
101``returning``
83``returning``
102 What to return - see :ref:`returning`.
84 What to return - see :ref:`returning`.
103
85
@@ -117,20 +99,11 @@ For example, if we are inserting orders, we might want the order ids returned::
117
99
118 insert Insert
100 insert Insert
119 { into = orderSchema
101 { into = orderSchema
120− , rows = values [ order ]
102+ , rows = [ order ]
121 , onConflict = Abort
103 , onConflict = Abort
122 , returning = Projection orderId
104 , returning = Projection orderId
123 }
105 }
124
106
125−If we don't want to return anything, we can use ``pure ()``::
126−
127− insert Insert
128− { into = orderSchema
129− , rows = values [ order ]
130− , onConflict = Abort
131− , returning = pure ()
132− }
133−
134Default values
107Default values
135--------------
108--------------
136
109
@@ -146,7 +119,7 @@ construct the ``DEFAULT`` expression::
146
119
147 insert Insert
120 insert Insert
148 { into = orderSchema
121 { into = orderSchema
149− , rows = values [ Order { orderId = unsafeDefault, ... } ]
122+ , rows = [ Order { orderId = unsafeDefault, ... } ]
150 , onConflict = Abort
123 , onConflict = Abort
151 , returning = Projection orderId
124 , returning = Projection orderId
152 }
125 }
@@ -175,7 +148,7 @@ them in Rel8, rather than in your database schema.
175
148
176 insert Insert
149 insert Insert
177 { into = orderSchema
150 { into = orderSchema
178− , rows = values [ Order { orderId = nextval "order_id_seq", ... } ]
151+ , rows = [ Order { orderId = nextval "order_id_seq", ... } ]
179 , onConflict = Abort
152 , onConflict = Abort
180 , returning = Projection orderId
153 , returning = Projection orderId
181 }
154 }
docs/cookbook.rst+7−9
@@ -142,25 +142,23 @@ rows, but can also return *tree*\s.
142To understand what this means, we'll consider a small example query for blog
142To understand what this means, we'll consider a small example query for blog
143posts. We want our query to return:
143posts. We want our query to return:
144
144
145−1. The latest 5 blog posts that have at least one tag each.
145+1. The latest 5 blog posts.
1462. For each blog post, all tags.
1462. For each blog post, all tags.
147−3. For each blog post, the latest 3 comments if they exist.
147+3. For each blog post, the latest 3 comments.
148
148
149In Rel8, we can write this query as::
149In Rel8, we can write this query as::
150
150
151 latestBlogPosts = do
151 latestBlogPosts = do
152 post <- each postSchema
152 post <- each postSchema
153
153
154− -- Returns a `NonEmptyTable a` which ends up as a `Data.List.NonEmpty a` after the query is run
155− tags <- some $ do
154+ tags <- aggregate do
156 tag <- each tagSchema
155 tag <- each tagSchema
157 where_ (tagPostId tag ==. postId post)
156 where_ (tagPostId tag ==. postId post)
158− return (tagName tag)
157+ return (listAgg (tagName tag))
159
158
160− -- Returns a `ListTable a` which ends up as a `[a]` after the query is run
161− latestComments <-
159+ latestComments <-
162− many $
160+ many $
163− limit 3 $
161+ limit 3 $
164 orderBy (commentCreatedAt >$< desc) do
162 orderBy (commentCreatedAt >$< desc) do
165 comment <- each commentSchema
163 comment <- each commentSchema
166 where_ (commentPostId comment ==. postId post)
164 where_ (commentPostId comment ==. postId post)
nix/sources.json+9−9
@@ -5,10 +5,10 @@
5 "homepage": "https://input-output-hk.github.io/haskell.nix",
5 "homepage": "https://input-output-hk.github.io/haskell.nix",
6 "owner": "input-output-hk",
6 "owner": "input-output-hk",
7 "repo": "haskell.nix",
7 "repo": "haskell.nix",
8− "rev": "0837156c56cb5350dd9bd84eb424187e00aa1e8a",
8+ "rev": "3856d2d24dca0ecc71fcfc314253a2a2d07a3c4f",
9− "sha256": "1djmv5a0vfj78csw2cad6nicrs8iqrp928b9b3v4h7lwwhhzliwl",
9+ "sha256": "0s69nasqhkv8n0qmdv075k83p3z584ja9vkzdnp2291mymghvx87",
10 "type": "tarball",
10 "type": "tarball",
11− "url": "https://github.com/input-output-hk/haskell.nix/archive/0837156c56cb5350dd9bd84eb424187e00aa1e8a.tar.gz",
11+ "url": "https://github.com/input-output-hk/haskell.nix/archive/3856d2d24dca0ecc71fcfc314253a2a2d07a3c4f.tar.gz",
12 "url_template": "https://github.com/<owner>/<repo>/archive/<rev>.tar.gz"
12 "url_template": "https://github.com/<owner>/<repo>/archive/<rev>.tar.gz"
13 },
13 },
14 "niv": {
14 "niv": {
@@ -17,10 +17,10 @@
17 "homepage": "https://github.com/nmattia/niv",
17 "homepage": "https://github.com/nmattia/niv",
18 "owner": "nmattia",
18 "owner": "nmattia",
19 "repo": "niv",
19 "repo": "niv",
20− "rev": "acdb1726783637852c01e0ad639ac9cbec28d8c8",
20+ "rev": "e0ca65c81a2d7a4d82a189f1e23a48d59ad42070",
21− "sha256": "1wszl8q70z6wfgkh2dvgmhhry6qp9nar421qq2ifd17hq2jj9ck3",
21+ "sha256": "1pq9nh1d8nn3xvbdny8fafzw87mj7gsmp6pxkdl65w2g18rmcmzx",
22 "type": "tarball",
22 "type": "tarball",
23− "url": "https://github.com/nmattia/niv/archive/acdb1726783637852c01e0ad639ac9cbec28d8c8.tar.gz",
23+ "url": "https://github.com/nmattia/niv/archive/e0ca65c81a2d7a4d82a189f1e23a48d59ad42070.tar.gz",
24 "url_template": "https://github.com/<owner>/<repo>/archive/<rev>.tar.gz"
24 "url_template": "https://github.com/<owner>/<repo>/archive/<rev>.tar.gz"
25 },
25 },
26 "nixpkgs": {
26 "nixpkgs": {
@@ -29,10 +29,10 @@
29 "homepage": null,
29 "homepage": null,
30 "owner": "nixos",
30 "owner": "nixos",
31 "repo": "nixpkgs",
31 "repo": "nixpkgs",
32− "rev": "1c1f5649bb9c1b0d98637c8c365228f57126f361",
32+ "rev": "59b8d9cf24e9fcf10341a0923c9bdca088dca8c8",
33− "sha256": "0f2nvdijyxfgl5kwyb4465pppd5vkhqxddx6v40k2s0z9jfhj0xl",
33+ "sha256": "08f38v4b2kcxnbapdwrb54bglka92cxj9qlnqlk5px206jyq9v4c",
34 "type": "tarball",
34 "type": "tarball",
35− "url": "https://github.com/nixos/nixpkgs/archive/1c1f5649bb9c1b0d98637c8c365228f57126f361.tar.gz",
35+ "url": "https://github.com/nixos/nixpkgs/archive/59b8d9cf24e9fcf10341a0923c9bdca088dca8c8.tar.gz",
36 "url_template": "https://github.com/<owner>/<repo>/archive/<rev>.tar.gz"
36 "url_template": "https://github.com/<owner>/<repo>/archive/<rev>.tar.gz"
37 }
37 }
38}
38}
nix/sources.nix+1−21
@@ -31,28 +31,8 @@ let
31 if spec ? branch then "refs/heads/${spec.branch}" else
31 if spec ? branch then "refs/heads/${spec.branch}" else
32 if spec ? tag then "refs/tags/${spec.tag}" else
32 if spec ? tag then "refs/tags/${spec.tag}" else
33 abort "In git source '${name}': Please specify `ref`, `tag` or `branch`!";
33 abort "In git source '${name}': Please specify `ref`, `tag` or `branch`!";
34− submodules = if spec ? submodules then spec.submodules else false;
35− submoduleArg =
36− let
37− nixSupportsSubmodules = builtins.compareVersions builtins.nixVersion "2.4" >= 0;
38− emptyArgWithWarning =
39− if submodules == true
40− then
41− builtins.trace
42− (
43− "The niv input \"${name}\" uses submodules "
44− + "but your nix's (${builtins.nixVersion}) builtins.fetchGit "
45− + "does not support them"
46− )
47− {}
48− else {};
49− in
50− if nixSupportsSubmodules
51− then { inherit submodules; }
52− else emptyArgWithWarning;
53 in
34 in
54− builtins.fetchGit
55− ({ url = spec.repo; inherit (spec) rev; inherit ref; } // submoduleArg);
35+ builtins.fetchGit { url = spec.repo; inherit (spec) rev; inherit ref; };
56
36
57 fetch_local = spec: spec.path;
37 fetch_local = spec: spec.path;
58
38
rel8.cabal+12−32
@@ -1,6 +1,6 @@
1cabal-version: 2.0
1cabal-version: 2.0
2name: rel8
2name: rel8
3−version: 1.4.0.0
3+version: 1.0.0.1
4synopsis: Hey! Hey! Can u rel8?
4synopsis: Hey! Hey! Can u rel8?
5license: BSD3
5license: BSD3
6license-file: LICENSE
6license-file: LICENSE
@@ -20,23 +20,21 @@ source-repository head
20library
20library
21 build-depends:
21 build-depends:
22 aeson
22 aeson
23− , base ^>= 4.14 || ^>=4.15 || ^>=4.16
23+ , base ^>= 4.14 || ^>=4.15
24− , bifunctors
25 , bytestring
24 , bytestring
26 , case-insensitive
25 , case-insensitive
27 , comonad
26 , comonad
28 , contravariant
27 , contravariant
29− , hasql ^>= 1.4.5.1 || ^>= 1.5.0.0 || ^>= 1.6.0.0
28+ , hasql ^>= 1.4.5.1
30− , opaleye ^>= 0.9.6.1
29+ , opaleye ^>= 0.7.3.0
31− , pretty
32 , profunctors
30 , profunctors
33− , product-profunctors
34 , scientific
31 , scientific
35 , semialign
32 , semialign
36 , semigroupoids
33 , semigroupoids
37 , text
34 , text
38 , these
35 , these
39 , time
36 , time
37+ , transformers
40 , uuid
38 , uuid
41 default-language:
39 default-language:
42 Haskell2010
40 Haskell2010
@@ -46,7 +44,6 @@ library
46 -Wno-missing-import-lists -Wno-prepositive-qualified-module
44 -Wno-missing-import-lists -Wno-prepositive-qualified-module
47 -Wno-monomorphism-restriction
45 -Wno-monomorphism-restriction
48 -Wno-missing-local-signatures
46 -Wno-missing-local-signatures
49− -Wno-missing-kind-signatures
50 hs-source-dirs:
47 hs-source-dirs:
51 src
48 src
52 exposed-modules:
49 exposed-modules:
@@ -54,7 +51,6 @@ library
54 Rel8.Expr.Num
51 Rel8.Expr.Num
55 Rel8.Expr.Text
52 Rel8.Expr.Text
56 Rel8.Expr.Time
53 Rel8.Expr.Time
57− Rel8.Tabulate
58
54
59 other-modules:
55 other-modules:
60 Rel8.Aggregate
56 Rel8.Aggregate
@@ -66,7 +62,6 @@ library
66 Rel8.Column.List
62 Rel8.Column.List
67 Rel8.Column.Maybe
63 Rel8.Column.Maybe
68 Rel8.Column.NonEmpty
64 Rel8.Column.NonEmpty
69− Rel8.Column.Null
70 Rel8.Column.These
65 Rel8.Column.These
71
66
72 Rel8.Expr
67 Rel8.Expr
@@ -82,7 +77,6 @@ library
82 Rel8.Expr.Order
77 Rel8.Expr.Order
83 Rel8.Expr.Sequence
78 Rel8.Expr.Sequence
84 Rel8.Expr.Serialize
79 Rel8.Expr.Serialize
85− Rel8.Expr.Window
86
80
87 Rel8.FCF
81 Rel8.FCF
88
82
@@ -109,23 +103,21 @@ library
109 Rel8.Query.Evaluate
103 Rel8.Query.Evaluate
110 Rel8.Query.Exists
104 Rel8.Query.Exists
111 Rel8.Query.Filter
105 Rel8.Query.Filter
112− Rel8.Query.Indexed
113 Rel8.Query.Limit
106 Rel8.Query.Limit
114 Rel8.Query.List
107 Rel8.Query.List
115 Rel8.Query.Maybe
108 Rel8.Query.Maybe
116 Rel8.Query.Null
109 Rel8.Query.Null
117 Rel8.Query.Opaleye
110 Rel8.Query.Opaleye
118 Rel8.Query.Order
111 Rel8.Query.Order
119− Rel8.Query.Rebind
120 Rel8.Query.Set
112 Rel8.Query.Set
121 Rel8.Query.SQL
113 Rel8.Query.SQL
122 Rel8.Query.These
114 Rel8.Query.These
123 Rel8.Query.Values
115 Rel8.Query.Values
124− Rel8.Query.Window
125
116
117+ Rel8.Schema.Context
126 Rel8.Schema.Context.Nullify
118 Rel8.Schema.Context.Nullify
119+ Rel8.Schema.Context.Virtual
127 Rel8.Schema.Dict
120 Rel8.Schema.Dict
128− Rel8.Schema.Field
129 Rel8.Schema.HTable
121 Rel8.Schema.HTable
130 Rel8.Schema.HTable.Either
122 Rel8.Schema.HTable.Either
131 Rel8.Schema.HTable.Identity
123 Rel8.Schema.HTable.Identity
@@ -143,26 +135,21 @@ library
143 Rel8.Schema.Null
135 Rel8.Schema.Null
144 Rel8.Schema.Result
136 Rel8.Schema.Result
145 Rel8.Schema.Spec
137 Rel8.Schema.Spec
138+ Rel8.Schema.Spec.Constrain
146 Rel8.Schema.Table
139 Rel8.Schema.Table
147
140
148 Rel8.Statement.Delete
141 Rel8.Statement.Delete
149 Rel8.Statement.Insert
142 Rel8.Statement.Insert
150− Rel8.Statement.OnConflict
151 Rel8.Statement.Returning
143 Rel8.Statement.Returning
152 Rel8.Statement.Select
144 Rel8.Statement.Select
153− Rel8.Statement.Set
154− Rel8.Statement.SQL
155 Rel8.Statement.Update
145 Rel8.Statement.Update
156− Rel8.Statement.Using
157 Rel8.Statement.View
146 Rel8.Statement.View
158− Rel8.Statement.Where
159
147
160 Rel8.Table
148 Rel8.Table
161 Rel8.Table.ADT
149 Rel8.Table.ADT
162 Rel8.Table.Aggregate
150 Rel8.Table.Aggregate
163 Rel8.Table.Alternative
151 Rel8.Table.Alternative
164 Rel8.Table.Bool
152 Rel8.Table.Bool
165− Rel8.Table.Cols
166 Rel8.Table.Either
153 Rel8.Table.Either
167 Rel8.Table.Eq
154 Rel8.Table.Eq
168 Rel8.Table.HKD
155 Rel8.Table.HKD
@@ -170,18 +157,15 @@ library
170 Rel8.Table.Maybe
157 Rel8.Table.Maybe
171 Rel8.Table.Name
158 Rel8.Table.Name
172 Rel8.Table.NonEmpty
159 Rel8.Table.NonEmpty
173− Rel8.Table.Null
174 Rel8.Table.Nullify
160 Rel8.Table.Nullify
175 Rel8.Table.Opaleye
161 Rel8.Table.Opaleye
176 Rel8.Table.Ord
162 Rel8.Table.Ord
177 Rel8.Table.Order
163 Rel8.Table.Order
178− Rel8.Table.Projection
164+ Rel8.Table.Recontextualize
179 Rel8.Table.Rel8able
165 Rel8.Table.Rel8able
180 Rel8.Table.Serialize
166 Rel8.Table.Serialize
181 Rel8.Table.These
167 Rel8.Table.These
182− Rel8.Table.Transpose
183 Rel8.Table.Undefined
168 Rel8.Table.Undefined
184− Rel8.Table.Window
185
169
186 Rel8.Type
170 Rel8.Type
187 Rel8.Type.Array
171 Rel8.Type.Array
@@ -200,9 +184,6 @@ library
200 Rel8.Type.Sum
184 Rel8.Type.Sum
201 Rel8.Type.Tag
185 Rel8.Type.Tag
202
186
203− Rel8.Window
204−
205−
206test-suite tests
187test-suite tests
207 type: exitcode-stdio-1.0
188 type: exitcode-stdio-1.0
208 build-depends:
189 build-depends:
@@ -211,9 +192,9 @@ test-suite tests
211 , case-insensitive
192 , case-insensitive
212 , containers
193 , containers
213 , hasql
194 , hasql
214− , hasql-transaction
215− , hedgehog ^>= 1.0 || ^>= 1.1
195+ , hedgehog ^>=1.0.2
216− , mmorph
196+ , lifted-base ^>=0.2.3.12
197+ , monad-control ^>=1.0.2.3
217 , rel8
198 , rel8
218 , scientific
199 , scientific
219 , tasty
200 , tasty
@@ -221,7 +202,6 @@ test-suite tests
221 , text
202 , text
222 , time
203 , time
223 , tmp-postgres ^>=1.34.1.0
204 , tmp-postgres ^>=1.34.1.0
224− , transformers
225 , uuid
205 , uuid
226
206
227 other-modules:
207 other-modules:
shell.nix+1−1
@@ -1,6 +1,6 @@
1let
1let
2 sources = import ./nix/sources.nix;
2 sources = import ./nix/sources.nix;
3− pkgs = import sources.nixpkgs {overlays = [];};
3+ pkgs = import sources.nixpkgs {};
4 hsPkgs = import ./default.nix;
4 hsPkgs = import ./default.nix;
5in
5in
6 hsPkgs.shellFor {
6 hsPkgs.shellFor {
src/Rel8.hs+10−297
@@ -38,27 +38,24 @@ module Rel8
38 , HMaybe
38 , HMaybe
39 , HList
39 , HList
40 , HNonEmpty
40 , HNonEmpty
41− , HNull
42 , HThese
41 , HThese
43 , Lift
42 , Lift
44
43
45 , Table(..)
44 , Table(..)
46 , HTable
45 , HTable
47− , Transposes
46+ , Recontextualize
48 , AltTable((<|>:))
47 , AltTable((<|>:))
49 , AlternativeTable( emptyTable )
48 , AlternativeTable( emptyTable )
50− , EqTable(..), (==:), (/=:)
49+ , EqTable, (==:), (/=:)
51− , OrdTable(..), (<:), (<=:), (>:), (>=:), ascTable, descTable, greatest, least
50+ , OrdTable, ascTable, descTable
52 , lit
51 , lit
53 , bool
52 , bool
54 , case_
53 , case_
55− , castTable
56
54
57 -- ** @MaybeTable@
55 -- ** @MaybeTable@
58 , MaybeTable
56 , MaybeTable
59 , maybeTable, ($?), nothingTable, justTable
57 , maybeTable, ($?), nothingTable, justTable
60 , isNothingTable, isJustTable
58 , isNothingTable, isJustTable
61− , fromMaybeTable
62 , optional
59 , optional
63 , catMaybeTable
60 , catMaybeTable
64 , traverseMaybeTable
61 , traverseMaybeTable
@@ -81,7 +78,6 @@ module Rel8
81 , isThisTable, isThatTable, isThoseTable
78 , isThisTable, isThatTable, isThoseTable
82 , hasHereTable, hasThereTable
79 , hasHereTable, hasThereTable
83 , justHereTable, justThereTable
80 , justHereTable, justThereTable
84− , alignMaybeTable
85 , alignBy
81 , alignBy
86 , keepHereTable, loseHereTable
82 , keepHereTable, loseHereTable
87 , keepThereTable, loseThereTable
83 , keepThereTable, loseThereTable
@@ -94,7 +90,7 @@ module Rel8
94
90
95 -- ** @ListTable@
91 -- ** @ListTable@
96 , ListTable
92 , ListTable
97− , listTable, ($*)
93+ , listTable
98 , nameListTable
94 , nameListTable
99 , many
95 , many
100 , manyExpr
96 , manyExpr
@@ -103,44 +99,21 @@ module Rel8
103
99
104 -- ** @NonEmptyTable@
100 -- ** @NonEmptyTable@
105 , NonEmptyTable
101 , NonEmptyTable
106− , nonEmptyTable, ($+)
102+ , nonEmptyTable
107 , nameNonEmptyTable
103 , nameNonEmptyTable
108 , some
104 , some
109 , someExpr
105 , someExpr
110 , catNonEmptyTable
106 , catNonEmptyTable
111 , catNonEmpty
107 , catNonEmpty
112
108
113− -- ** @NullTable@
109+ -- ** @ADT@
114− , NullTable
115− , nullableTable, nullTable, nullifyTable
116− , isNullTable, isNonNullTable
117− , catNullTable
118− , nameNullTable
119− , toNullTable, toMaybeTable
120−
121− -- ** Algebraic data types / sum types
122− -- $adts
123−
124− -- *** Naming of ADTs
125− -- $naming
126− , NameADT, nameADT
127 , ADT, ADTable
110 , ADT, ADTable
128−
129− -- *** Deconstruction of ADTs
130− -- $deconstruction
131− , DeconstructADT, deconstructADT
132−
133− -- *** Construction of ADTs
134− -- $construction
135 , BuildADT, buildADT
111 , BuildADT, buildADT
136 , ConstructADT, constructADT
112 , ConstructADT, constructADT
137−
113+ , DeconstructADT, deconstructADT
138− -- *** Other ADT operations
114+ , NameADT, nameADT
139 , AggregateADT, aggregateADT
115 , AggregateADT, aggregateADT
140
116
141− -- *** Miscellaneous notes
142− -- $misc-notes
143−
144 -- ** @HKD@
117 -- ** @HKD@
145 , HKD, HKDable
118 , HKD, HKDable
146 , BuildHKD, buildHKD
119 , BuildHKD, buildHKD
@@ -165,7 +138,6 @@ module Rel8
165 -- ** @null@
138 -- ** @null@
166 , NotNull
139 , NotNull
167 , Nullable
140 , Nullable
168− , Homonullable
169 , null
141 , null
170 , nullify
142 , nullify
171 , nullable
143 , nullable
@@ -184,7 +156,6 @@ module Rel8
184 , (==.), (/=.), (==?), (/=?)
156 , (==.), (/=.), (==?), (/=?)
185 , in_
157 , in_
186 , boolExpr, caseExpr
158 , boolExpr, caseExpr
187− , like, ilike
188
159
189 -- ** Ordering
160 -- ** Ordering
190 , DBOrd
161 , DBOrd
@@ -202,13 +173,6 @@ module Rel8
202 , Query
173 , Query
203 , showQuery
174 , showQuery
204
175
205− -- ** Projection
206− , Projection
207− , Projectable( project )
208− , Biprojectable( biproject )
209− , Projecting
210− , Field
211−
212 -- ** Selecting rows
176 -- ** Selecting rows
213 , Selects
177 , Selects
214 , each
178 , each
@@ -253,11 +217,10 @@ module Rel8
253 , countRows
217 , countRows
254 , groupBy
218 , groupBy
255 , listAgg, listAggExpr
219 , listAgg, listAggExpr
256− , mode
257 , nonEmptyAgg, nonEmptyAggExpr
220 , nonEmptyAgg, nonEmptyAggExpr
258 , DBMax, max
221 , DBMax, max
259 , DBMin, min
222 , DBMin, min
260− , DBSum, sum, sumWhere, avg
223+ , DBSum, sum, sumWhere
261 , DBString, stringAgg
224 , DBString, stringAgg
262 , count
225 , count
263 , countStar
226 , countStar
@@ -274,32 +237,6 @@ module Rel8
274 , nullsFirst
237 , nullsFirst
275 , nullsLast
238 , nullsLast
276
239
277− -- ** Window functions
278− , Window
279− , window
280− , Partition
281− , over
282− , partitionBy
283− , orderPartitionBy
284− , cumulative
285− , cumulative_
286− , currentRow
287− , rowNumber
288− , rank
289− , denseRank
290− , percentRank
291− , cumeDist
292− , ntile
293− , lag
294− , lead
295− , firstValue
296− , lastValue
297− , nthValue
298− , indexed
299−
300− -- ** Bindings
301− , rebind
302−
303 -- * IO
240 -- * IO
304 , Serializable
241 , Serializable
305 , ToExprs
242 , ToExprs
@@ -314,27 +251,22 @@ module Rel8
314 -- ** @INSERT@
251 -- ** @INSERT@
315 , Insert(..)
252 , Insert(..)
316 , OnConflict(..)
253 , OnConflict(..)
317− , Upsert(..)
318 , insert
254 , insert
319 , unsafeDefault
255 , unsafeDefault
320− , showInsert
321
256
322 -- ** @DELETE@
257 -- ** @DELETE@
323 , Delete(..)
258 , Delete(..)
324 , delete
259 , delete
325− , showDelete
326
260
327 -- ** @UPDATE@
261 -- ** @UPDATE@
328 , Update(..)
262 , Update(..)
329 , update
263 , update
330− , showUpdate
331
264
332 -- ** @.. RETURNING@
265 -- ** @.. RETURNING@
333 , Returning(..)
266 , Returning(..)
334
267
335 -- ** @CREATE VIEW@
268 -- ** @CREATE VIEW@
336 , createView
269 , createView
337− , createOrReplaceView
338
270
339 -- ** Sequences
271 -- ** Sequences
340 , nextval
272 , nextval
@@ -353,7 +285,6 @@ import Rel8.Column.Lift
353import Rel8.Column.List
285import Rel8.Column.List
354import Rel8.Column.Maybe
286import Rel8.Column.Maybe
355import Rel8.Column.NonEmpty
287import Rel8.Column.NonEmpty
356−import Rel8.Column.Null
357import Rel8.Column.These
288import Rel8.Column.These
358import Rel8.Expr
289import Rel8.Expr
359import Rel8.Expr.Aggregate
290import Rel8.Expr.Aggregate
@@ -367,8 +298,6 @@ import Rel8.Expr.Ord
367import Rel8.Expr.Order
298import Rel8.Expr.Order
368import Rel8.Expr.Serialize
299import Rel8.Expr.Serialize
369import Rel8.Expr.Sequence
300import Rel8.Expr.Sequence
370−import Rel8.Expr.Text ( like, ilike )
371−import Rel8.Expr.Window hiding ( cumulative )
372import Rel8.Generic.Rel8able ( KRel8able, Rel8able )
301import Rel8.Generic.Rel8able ( KRel8able, Rel8able )
373import Rel8.Order
302import Rel8.Order
374import Rel8.Query
303import Rel8.Query
@@ -379,19 +308,15 @@ import Rel8.Query.Either
379import Rel8.Query.Evaluate
308import Rel8.Query.Evaluate
380import Rel8.Query.Exists
309import Rel8.Query.Exists
381import Rel8.Query.Filter
310import Rel8.Query.Filter
382−import Rel8.Query.Indexed
383import Rel8.Query.Limit
311import Rel8.Query.Limit
384import Rel8.Query.List
312import Rel8.Query.List
385import Rel8.Query.Maybe
313import Rel8.Query.Maybe
386import Rel8.Query.Null
314import Rel8.Query.Null
387import Rel8.Query.Order
315import Rel8.Query.Order
388−import Rel8.Query.Rebind
389import Rel8.Query.SQL (showQuery)
316import Rel8.Query.SQL (showQuery)
390import Rel8.Query.Set
317import Rel8.Query.Set
391import Rel8.Query.These
318import Rel8.Query.These
392import Rel8.Query.Values
319import Rel8.Query.Values
393−import Rel8.Query.Window
394−import Rel8.Schema.Field
395import Rel8.Schema.HTable
320import Rel8.Schema.HTable
396import Rel8.Schema.Name
321import Rel8.Schema.Name
397import Rel8.Schema.Null hiding ( nullable )
322import Rel8.Schema.Null hiding ( nullable )
@@ -399,10 +324,8 @@ import Rel8.Schema.Result ( Result )
399import Rel8.Schema.Table
324import Rel8.Schema.Table
400import Rel8.Statement.Delete
325import Rel8.Statement.Delete
401import Rel8.Statement.Insert
326import Rel8.Statement.Insert
402−import Rel8.Statement.OnConflict
403import Rel8.Statement.Returning
327import Rel8.Statement.Returning
404import Rel8.Statement.Select
328import Rel8.Statement.Select
405−import Rel8.Statement.SQL
406import Rel8.Statement.Update
329import Rel8.Statement.Update
407import Rel8.Statement.View
330import Rel8.Statement.View
408import Rel8.Table
331import Rel8.Table
@@ -417,16 +340,12 @@ import Rel8.Table.List
417import Rel8.Table.Maybe
340import Rel8.Table.Maybe
418import Rel8.Table.Name
341import Rel8.Table.Name
419import Rel8.Table.NonEmpty
342import Rel8.Table.NonEmpty
420−import Rel8.Table.Null
421−import Rel8.Table.Opaleye ( castTable )
422import Rel8.Table.Ord
343import Rel8.Table.Ord
423import Rel8.Table.Order
344import Rel8.Table.Order
424−import Rel8.Table.Projection
345+import Rel8.Table.Recontextualize
425import Rel8.Table.Rel8able ()
346import Rel8.Table.Rel8able ()
426import Rel8.Table.Serialize
347import Rel8.Table.Serialize
427import Rel8.Table.These
348import Rel8.Table.These
428−import Rel8.Table.Transpose
429−import Rel8.Table.Window
430import Rel8.Type
349import Rel8.Type
431import Rel8.Type.Composite
350import Rel8.Type.Composite
432import Rel8.Type.Eq
351import Rel8.Type.Eq
@@ -441,7 +360,6 @@ import Rel8.Type.ReadShow
441import Rel8.Type.Semigroup
360import Rel8.Type.Semigroup
442import Rel8.Type.String
361import Rel8.Type.String
443import Rel8.Type.Sum
362import Rel8.Type.Sum
444−import Rel8.Window
445
363
446
364
447-- $running
365-- $running
@@ -449,208 +367,3 @@ import Rel8.Window
449-- provides 'select', 'insert', 'update' and 'delete' functions. Note that
367-- provides 'select', 'insert', 'update' and 'delete' functions. Note that
450-- 'insert', 'update' and 'delete' will generally need the
368-- 'insert', 'update' and 'delete' will generally need the
451-- `DuplicateRecordFields` language extension enabled.
369-- `DuplicateRecordFields` language extension enabled.
452−
453−-- $adts
454−-- Algebraic data types can be modelled between Haskell and SQL.
455−--
456−-- * Your SQL table needs a certain text field that tags which Haskell constructor is in use.
457−-- * You have to use a few combinators to specify the sum type's individual constructors.
458−-- * If you want to do case analysis at the @Expr@ (SQL) level, you can use 'maybe'/'either'-like eliminators.
459−--
460−-- The documentation in this section will assume a set of database types like this:
461−--
462−-- @
463−-- data Thing f = ThingEmployer (Employer f) | ThingPotato (Potato f) | Nullary
464−-- deriving stock Generic
465−--
466−-- data Employer f = Employer { employerId :: f Int32, employerName :: f Text}
467−-- deriving stock Generic
468−-- deriving anyclass Rel8able
469−--
470−-- data Potato f = Potato { size :: f Int32, grower :: f Text }
471−-- deriving stock Generic
472−-- deriving anyclass Rel8able
473−-- @
474−
475−-- $naming
476−--
477−-- First, in your 'TableSchema', name your type like this:
478−--
479−-- @
480−-- thingSchema :: TableSchema (ADT Thing Name)
481−-- thingSchema =
482−-- TableSchema
483−-- { schema = Nothing,
484−-- name = \"thing\",
485−-- columns =
486−-- nameADT @Thing
487−-- \"tag\"
488−-- Employer
489−-- { employerName = \"name\",
490−-- employerId = \"id\"
491−-- }
492−-- Potato {size = \"size\", grower = \"Mary\"}
493−-- }
494−-- @
495−--
496−-- Note that @nameADT \@Thing "tag"@ is variadic: it accepts one
497−-- argument per constructor, except the nullary ones (Nullary) because
498−-- there's nothing to do for them.
499−
500−-- $deconstruction
501−--
502−-- To deconstruct sum types at the SQL level, use 'deconstructADT',
503−-- which is also variadic, and has one argument for each
504−-- constructor. Similar to 'maybe'.
505−--
506−-- @
507−-- query :: Query (ADT Thing Expr)
508−-- query = do
509−-- thingExpr <- each thingSchema
510−-- where_ $
511−-- deconstructADT @Thing
512−-- (\employer -> employerName employer ==. lit \"Mary\")
513−-- (\potato -> grower potato ==. lit \"Mary\")
514−-- (lit False) -- Nullary case
515−-- thingExpr
516−-- pure thingExpr
517−-- @
518−--
519−-- SQL output:
520−--
521−-- @
522−-- SELECT
523−-- CAST("tag0_1" AS text) as "tag",
524−-- CAST("id1_1" AS int4) as "ThingEmployer/_1/employerId",
525−-- CAST("name2_1" AS text) as "ThingEmployer/_1/employerName",
526−-- CAST("size3_1" AS int4) as "ThingPotato/_1/size",
527−-- CAST("Mary4_1" AS text) as "ThingPotato/_1/grower"
528−-- FROM (SELECT
529−-- *
530−-- FROM (SELECT
531−-- "tag" as "tag0_1",
532−-- "id" as "id1_1",
533−-- "name" as "name2_1",
534−-- "size" as "size3_1",
535−-- "Mary" as "Mary4_1"
536−-- FROM "thing" as "T1") as "T1"
537−-- WHERE (CASE WHEN ("tag0_1") = (CAST(E'ThingPotato' AS text)) THEN ("Mary4_1") = (CAST(E'Mary' AS text))
538−-- WHEN ("tag0_1") = (CAST(E'Nullary' AS text)) THEN CAST(FALSE AS bool) ELSE ("name2_1") = (CAST(E'Mary' AS text)) END)) as "T1"
539−-- @
540−
541−-- $construction
542−--
543−-- To construct an ADT, you can use 'buildADT' or 'constructADT'. Consider the following type:
544−--
545−-- @
546−-- data Task f = Pending | Complete (CompletedTask f)
547−-- @
548−--
549−-- 'buildADT' is for constructing values of 'Task' in the 'Expr'
550−-- context. 'buildADT' needs two type-level arguments before its type
551−-- makes any sense. The first argument is the type of the "ADT", which
552−-- in our case is 'Task'. The second is the name of the constructor we
553−-- want to use. So that means we have the following possible
554−-- instantiations of 'buildADT' for 'Task':
555−--
556−-- @
557−-- > :t buildADT @Task @\"Pending\"
558−-- buildADT @Task @\"Pending\" :: ADT Task Expr
559−-- > :t buildADT @Task @\"Complete\"
560−-- buildADT @Task @\"Complete\" :: CompletedTask Expr -> ADT Task Expr
561−-- @
562−--
563−-- Note that as the "Pending" constructor has no fields, @buildADT
564−-- \@Task \@"Pending"@ is equivalent to @lit Pending@. But @buildADT
565−-- \@Task \@"Complete"@ is not the same as @lit . Complete@:
566−--
567−-- @
568−-- > :t lit . Complete
569−-- lit . Complete :: CompletedTask Result -> ADT Task Expr
570−-- @
571−--
572−--
573−-- Note that the former takes a @CompletedTask Expr@ while the latter
574−-- takes a @CompletedTask Result@. The former is more powerful because
575−-- you can construct @Task@s using dynamic values coming a database
576−-- query.
577−--
578−-- To show what this can look like in SQL, consider:
579−--
580−-- @
581−-- > :{
582−-- showQuery $ values
583−-- [ buildADT @Task @\"Pending\"
584−-- , buildADT @Task @\"Complete\" CompletedTask {date = Rel8.Expr.Time.now}
585−-- ]
586−-- :}
587−-- @
588−--
589−-- This produces the following SQL:
590−--
591−-- @
592−-- SELECT
593−-- CAST(\"values0_1\" AS text) as \"tag\",
594−-- CAST(\"values1_1\" AS timestamptz) as \"Complete/_1/date\"
595−-- FROM (SELECT
596−-- *
597−-- FROM (SELECT \"column1\" as \"values0_1\",
598−-- \"column2\" as \"values1_1\"
599−-- FROM
600−-- (VALUES
601−-- (CAST(E'Pending' AS text),CAST(NULL AS timestamptz)),
602−-- (CAST(E'Complete' AS text),CAST(now() AS timestamptz))) as \"V\") as \"T1\") as \"T1\"
603−-- @
604−--
605−-- This is what you get if you run it in @psql@:
606−--
607−--
608−-- @
609−-- tag | Complete/_1/date
610−-- ----------+-------------------------------
611−-- Pending |
612−-- Complete | 2022-05-19 21:28:23.969065+00
613−-- (2 rows)
614−-- @
615−--
616−-- "constructADT" is less convenient but more general alternative to
617−-- "buildADT". It requires only one type-level argument for its type
618−-- to make sense:
619−--
620−-- @
621−-- > :t constructADT @Task
622−-- constructADT @Task
623−-- :: (forall r. r -> (CompletedTask Expr -> r) -> r) -> ADT Task Expr
624−-- @
625−--
626−-- This might still seem a bit opaque, but basically it gives you a
627−-- Church-encoded constructor for arbitrary algebraic data types. You
628−-- might use it as follows:
629−--
630−-- @
631−-- let
632−-- pending :: ADT Task Expr
633−-- pending = constructADT @Task $ \pending _complete -> pending
634−--
635−-- complete :: ADT Task Expr
636−-- complete = constructADT @Task $ \_pending complete -> complete CompletedTask {date = Rel8.Expr.Time.now}
637−-- @
638−--
639−-- These values are otherwise identical to the ones we saw above with
640−-- @buildADT@, it's just a different style of constructing them.
641−--
642−
643−-- $misc-notes
644−--
645−-- 1. Note that the order of the arguments for all of these functions
646−-- is determined by the order of the constructors in the data
647−-- definition. If it were @data Task = Complete (CompletedTask f) |
648−-- Pending@ then the order of all the invocations of @constructADT@
649−-- and @deconstructADT@ would need to change.
650−--
651−-- 2. Maybe this is obvious, but just to spell it out: once you're in
652−-- the @Result@ context, you can of course construct @Task@ values
653−-- normally and use standard Haskell pattern-matching. @constructADT@
654−-- and @deconstructADT@ are specifically only needed in the @Expr@
655−-- context, and they allow you to do the equivalent of pattern
656−-- matching in PostgreSQL.
src/Rel8/Aggregate.hs+90−35
@@ -1,83 +1,138 @@
1{-# language DataKinds #-}
1{-# language DataKinds #-}
2{-# language FlexibleContexts #-}
2{-# language FlexibleContexts #-}
3{-# language FlexibleInstances #-}
3{-# language FlexibleInstances #-}
4+{-# language GADTs #-}
4{-# language MultiParamTypeClasses #-}
5{-# language MultiParamTypeClasses #-}
5−{-# language RankNTypes #-}
6+{-# language NamedFieldPuns #-}
7+{-# language PolyKinds #-}
6{-# language StandaloneKindSignatures #-}
8{-# language StandaloneKindSignatures #-}
7{-# language TypeFamilies #-}
9{-# language TypeFamilies #-}
8{-# language UndecidableInstances #-}
10{-# language UndecidableInstances #-}
11+{-# language UndecidableSuperClasses #-}
9
12
10module Rel8.Aggregate
13module Rel8.Aggregate
11− ( Aggregate(..), zipOutputs
14+ ( Aggregate(..), foldInputs, mapInputs
12− , unsafeMakeAggregate
15+ , Aggregator(..), unsafeMakeAggregate
13 , Aggregates
16 , Aggregates
17+ , Col( A, unA )
14 )
18 )
15where
19where
16
20
17-- base
21-- base
18−import Control.Applicative ( liftA2 )
22+import Data.Functor.Const ( Const( Const ), getConst )
19−import Data.Functor.Identity ( Identity( Identity ) )
20import Data.Kind ( Constraint, Type )
23import Data.Kind ( Constraint, Type )
21import Prelude
24import Prelude
22
25
23−-- profunctors
24−import Data.Profunctor ( dimap )
25−
26-- opaleye
26-- opaleye
27−import qualified Opaleye.Aggregate as Opaleye
27+import qualified Opaleye.Internal.Aggregate as Opaleye
28import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
28import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
29−import qualified Opaleye.Internal.Column as Opaleye
29+import qualified Opaleye.Internal.PackMap as Opaleye
30
30
31-- rel8
31-- rel8
32import Rel8.Expr ( Expr )
32import Rel8.Expr ( Expr )
33+import Rel8.Schema.Context ( Interpretation(..) )
33−import Rel8.Schema.HTable.Identity ( HIdentity(..) )
34+import Rel8.Schema.HTable.Identity ( HIdentity(..), HType )
34−import qualified Rel8.Schema.Kind as K
35+import Rel8.Schema.Name ( Name )
35import Rel8.Schema.Null ( Sql )
36import Rel8.Schema.Null ( Sql )
37+import Rel8.Schema.Result ( Col( R ) )
38+import Rel8.Schema.Spec ( Spec( Spec ) )
36import Rel8.Table
39import Rel8.Table
37 ( Table, Columns, Context, fromColumns, toColumns
40 ( Table, Columns, Context, fromColumns, toColumns
38 , FromExprs, fromResult, toResult
41 , FromExprs, fromResult, toResult
39− , Transpose
40 )
42 )
41−import Rel8.Table.Transpose ( Transposes )
43+import Rel8.Table.Recontextualize ( Recontextualize )
42import Rel8.Type ( DBType )
44import Rel8.Type ( DBType )
43
45
44
46
45−-- | 'Aggregate' is a special context used by 'Rel8.aggregate'.
47+-- | An @Aggregate a@ describes how to aggregate @Table@s of type @a@. You can
48+-- unpack an @Aggregate@ back to @a@ by running it with 'Rel8.aggregate'. As
49+-- @Aggregate@ is almost an 'Applicative' functor - but there is no 'pure'
50+-- operation. This means 'Aggregate' is an instance of 'Apply', and you can
51+-- combine @Aggregate@s using the @<.>@ combinator.
46−type Aggregate :: K.Context
52+type Aggregate :: k -> Type
53+data Aggregate a where
47−newtype Aggregate a = Aggregate (Opaleye.Aggregator () (Expr a))
54+ Aggregate :: !(Opaleye.Aggregator () (Expr a)) -> Aggregate a
55+
56+
57+instance Interpretation Aggregate where
58+ data Col Aggregate _spec where
59+ A :: ()
60+ => { unA :: !(Aggregate a) }
61+ -> Col Aggregate ('Spec a)
48
62
49
63
50instance Sql DBType a => Table Aggregate (Aggregate a) where
64instance Sql DBType a => Table Aggregate (Aggregate a) where
51− type Columns (Aggregate a) = HIdentity a
65+ type Columns (Aggregate a) = HType a
52 type Context (Aggregate a) = Aggregate
66 type Context (Aggregate a) = Aggregate
53 type FromExprs (Aggregate a) = a
67 type FromExprs (Aggregate a) = a
54− type Transpose to (Aggregate a) = to a
55
68
56− toColumns = HIdentity
69+ toColumns = HIdentity . A
57− fromColumns (HIdentity a) = a
70+ fromColumns (HIdentity (A a)) = a
58− toResult = HIdentity . Identity
71+ toResult = HIdentity . R
59− fromResult (HIdentity (Identity a)) = a
72+ fromResult (HIdentity (R a)) = a
73+
74+
75+instance Sql DBType a =>
76+ Recontextualize Aggregate Aggregate (Aggregate a) (Aggregate a)
77+
78+
79+instance Sql DBType a =>
80+ Recontextualize Aggregate Expr (Aggregate a) (Expr a)
81+
82+
83+instance Sql DBType a =>
84+ Recontextualize Aggregate Name (Aggregate a) (Name a)
60
85
61
86
87+instance Sql DBType a =>
88+ Recontextualize Expr Aggregate (Expr a) (Aggregate a)
89+
90+
91+instance Sql DBType a =>
92+ Recontextualize Name Aggregate (Name a) (Aggregate a)
93+
94+
62−-- | @Aggregates a b@ means that the columns in @a@ are all 'Aggregate's
95+-- | @Aggregates a b@ means that the columns in @a@ are all 'Aggregate' 'Expr's
63−-- for the 'Expr' columns in @b@.
96+-- for the columns in @b@.
64type Aggregates :: Type -> Type -> Constraint
97type Aggregates :: Type -> Type -> Constraint
65−class Transposes Aggregate Expr aggregates exprs => Aggregates aggregates exprs
98+class Recontextualize Aggregate Expr aggregates exprs => Aggregates aggregates exprs
66−instance Transposes Aggregate Expr aggregates exprs => Aggregates aggregates exprs
99+instance Recontextualize Aggregate Expr aggregates exprs => Aggregates aggregates exprs
100+
101+
102+foldInputs :: Monoid b
103+ => (Maybe Aggregator -> Opaleye.PrimExpr -> b) -> Aggregate a -> b
104+foldInputs f (Aggregate (Opaleye.Aggregator (Opaleye.PackMap agg))) =
105+ getConst $ flip agg () $ \(aggregator, a) ->
106+ Const $ f (detuplize <$> aggregator) a
107+ where
108+ detuplize (operation, ordering, distinction) =
109+ Aggregator {operation, ordering, distinction}
110+
111+
112+mapInputs :: ()
113+ => (Opaleye.PrimExpr -> Opaleye.PrimExpr) -> Aggregate a -> Aggregate a
114+mapInputs transform (Aggregate (Opaleye.Aggregator (Opaleye.PackMap agg))) =
115+ Aggregate $ Opaleye.Aggregator $ Opaleye.PackMap $ agg . \f input ->
116+ f (fmap transform input)
67
117
68
118
69−zipOutputs :: ()
119+type Aggregator :: Type
70− => (Expr a -> Expr b -> Expr c) -> Aggregate a -> Aggregate b -> Aggregate c
120+data Aggregator = Aggregator
71−zipOutputs f (Aggregate a) (Aggregate b) = Aggregate (liftA2 f a b)
121+ { operation :: Opaleye.AggrOp
122+ , ordering :: [Opaleye.OrderExpr]
123+ , distinction :: Opaleye.AggrDistinct
124+ }
72
125
73
126
74−unsafeMakeAggregate :: forall (input :: Type) (output :: Type) n n' a a'. ()
127+unsafeMakeAggregate :: ()
75 => (Expr input -> Opaleye.PrimExpr)
128 => (Expr input -> Opaleye.PrimExpr)
76 -> (Opaleye.PrimExpr -> Expr output)
129 -> (Opaleye.PrimExpr -> Expr output)
77− -> Opaleye.Aggregator (Opaleye.Field_ n a) (Opaleye.Field_ n' a')
130+ -> Maybe Aggregator
78 -> Expr input
131 -> Expr input
79 -> Aggregate output
132 -> Aggregate output
80unsafeMakeAggregate input output aggregator expr =
133unsafeMakeAggregate input output aggregator expr =
81− Aggregate $ dimap in_ out aggregator
134+ Aggregate $ Opaleye.Aggregator $ Opaleye.PackMap $ \f _ ->
82− where out = output . Opaleye.unColumn
135+ output <$> f (tuplize <$> aggregator, input expr)
83− in_ = Opaleye.Column . input . const expr
136+ where
137+ tuplize Aggregator {operation, ordering, distinction} =
138+ (operation, ordering, distinction)
src/Rel8/Column.hs+7−2
@@ -13,8 +13,11 @@ import Data.Kind ( Type )
13import Prelude ()
13import Prelude ()
14
14
15-- rel8
15-- rel8
16+import Rel8.Aggregate ( Aggregate )
17+import Rel8.Expr ( Expr )
16import Rel8.FCF ( Eval, Exp )
18import Rel8.FCF ( Eval, Exp )
17import qualified Rel8.Schema.Kind as K
19import qualified Rel8.Schema.Kind as K
20+import Rel8.Schema.Name ( Name(..) )
18import Rel8.Schema.Result ( Result )
21import Rel8.Schema.Result ( Result )
19
22
20
23
@@ -23,8 +26,10 @@ import Rel8.Schema.Result ( Result )
23-- 'Rel8able' definitions), and @a@ is the type of the column.
26-- 'Rel8able' definitions), and @a@ is the type of the column.
24type Column :: K.Context -> Type -> Type
27type Column :: K.Context -> Type -> Type
25type family Column context a where
28type family Column context a where
29+ Column Aggregate a = Aggregate a
30+ Column Expr a = Expr a
31+ Column Name a = Name a
26− Column Result a = a
32+ Column Result a = a
27− Column context a = context a
28
33
29
34
30data TColumn :: K.Context -> Type -> Exp Type
35data TColumn :: K.Context -> Type -> Exp Type
src/Rel8/Column/Either.hs+6−1
@@ -12,7 +12,10 @@ import Data.Kind ( Type )
12import Prelude
12import Prelude
13
13
14-- rel8
14-- rel8
15+import Rel8.Aggregate ( Aggregate )
16+import Rel8.Expr ( Expr )
15import qualified Rel8.Schema.Kind as K
17import qualified Rel8.Schema.Kind as K
18+import Rel8.Schema.Name ( Name )
16import Rel8.Schema.Result ( Result )
19import Rel8.Schema.Result ( Result )
17import Rel8.Table.Either ( EitherTable )
20import Rel8.Table.Either ( EitherTable )
18
21
@@ -22,5 +25,7 @@ import Rel8.Table.Either ( EitherTable )
22-- 'Result' context.
25-- 'Result' context.
23type HEither :: K.Context -> Type -> Type -> Type
26type HEither :: K.Context -> Type -> Type -> Type
24type family HEither context = either | either -> context where
27type family HEither context = either | either -> context where
28+ HEither Aggregate = EitherTable Aggregate
29+ HEither Expr = EitherTable Expr
30+ HEither Name = EitherTable Name
25 HEither Result = Either
31 HEither Result = Either
26− HEither context = EitherTable context
src/Rel8/Column/List.hs+6−1
@@ -12,7 +12,10 @@ import Data.Kind ( Type )
12import Prelude ()
12import Prelude ()
13
13
14-- rel8
14-- rel8
15+import Rel8.Aggregate ( Aggregate )
16+import Rel8.Expr ( Expr )
15import qualified Rel8.Schema.Kind as K
17import qualified Rel8.Schema.Kind as K
18+import Rel8.Schema.Name ( Name )
16import Rel8.Schema.Result ( Result )
19import Rel8.Schema.Result ( Result )
17import Rel8.Table.List ( ListTable )
20import Rel8.Table.List ( ListTable )
18
21
@@ -21,5 +24,7 @@ import Rel8.Table.List ( ListTable )
21-- @a@ in the 'Expr' context, and a @[a]@ in the 'Result' context.
24-- @a@ in the 'Expr' context, and a @[a]@ in the 'Result' context.
22type HList :: K.Context -> Type -> Type
25type HList :: K.Context -> Type -> Type
23type family HList context = list | list -> context where
26type family HList context = list | list -> context where
27+ HList Aggregate = ListTable Aggregate
28+ HList Expr = ListTable Expr
29+ HList Name = ListTable Name
24 HList Result = []
30 HList Result = []
25− HList context = ListTable context
src/Rel8/Column/Maybe.hs+6−1
@@ -12,7 +12,10 @@ import Data.Kind ( Type )
12import Prelude
12import Prelude
13
13
14-- rel8
14-- rel8
15+import Rel8.Aggregate ( Aggregate )
16+import Rel8.Expr ( Expr )
15import qualified Rel8.Schema.Kind as K
17import qualified Rel8.Schema.Kind as K
18+import Rel8.Schema.Name ( Name )
16import Rel8.Schema.Result ( Result )
19import Rel8.Schema.Result ( Result )
17import Rel8.Table.Maybe ( MaybeTable )
20import Rel8.Table.Maybe ( MaybeTable )
18
21
@@ -22,5 +25,7 @@ import Rel8.Table.Maybe ( MaybeTable )
22-- context.
25-- context.
23type HMaybe :: K.Context -> Type -> Type
26type HMaybe :: K.Context -> Type -> Type
24type family HMaybe context = maybe | maybe -> context where
27type family HMaybe context = maybe | maybe -> context where
28+ HMaybe Aggregate = MaybeTable Aggregate
29+ HMaybe Expr = MaybeTable Expr
30+ HMaybe Name = MaybeTable Name
25 HMaybe Result = Maybe
31 HMaybe Result = Maybe
26− HMaybe context = MaybeTable context
src/Rel8/Column/NonEmpty.hs+6−1
@@ -13,7 +13,10 @@ import Data.List.NonEmpty ( NonEmpty )
13import Prelude ()
13import Prelude ()
14
14
15-- rel8
15-- rel8
16+import Rel8.Aggregate ( Aggregate )
17+import Rel8.Expr ( Expr )
16import qualified Rel8.Schema.Kind as K
18import qualified Rel8.Schema.Kind as K
19+import Rel8.Schema.Name ( Name )
17import Rel8.Schema.Result ( Result )
20import Rel8.Schema.Result ( Result )
18import Rel8.Table.NonEmpty ( NonEmptyTable )
21import Rel8.Table.NonEmpty ( NonEmptyTable )
19
22
@@ -23,5 +26,7 @@ import Rel8.Table.NonEmpty ( NonEmptyTable )
23-- 'Result' context.
26-- 'Result' context.
24type HNonEmpty :: K.Context -> Type -> Type
27type HNonEmpty :: K.Context -> Type -> Type
25type family HNonEmpty context = nonEmpty | nonEmpty -> context where
28type family HNonEmpty context = nonEmpty | nonEmpty -> context where
29+ HNonEmpty Aggregate = NonEmptyTable Aggregate
30+ HNonEmpty Expr = NonEmptyTable Expr
31+ HNonEmpty Name = NonEmptyTable Name
26 HNonEmpty Result = NonEmpty
32 HNonEmpty Result = NonEmpty
27− HNonEmpty context = NonEmptyTable context
src/Rel8/Column/Null.hsdeleted−26
@@ -1,26 +0,0 @@
1−{-# language DataKinds #-}
2−{-# language StandaloneKindSignatures #-}
3−{-# language TypeFamilyDependencies #-}
4−
5−module Rel8.Column.Null
6− ( HNull
7− )
8−where
9−
10−-- base
11−import Data.Kind ( Type )
12−import Prelude
13−
14−-- rel8
15−import qualified Rel8.Schema.Kind as K
16−import Rel8.Schema.Result ( Result )
17−import Rel8.Table.Null ( NullTable )
18−
19−
20−-- | Nest a 'Null' value within a 'Rel8able'. @HNull f a@ will produce a
21−-- 'NullTable' @a@ in the 'Expr' context, and a @'Maybe' a@ in the 'Result'
22−-- context.
23−type HNull :: K.Context -> Type -> Type
24−type family HNull context = maybe | maybe -> context where
25− HNull Result = Maybe
26− HNull context = NullTable context
src/Rel8/Column/These.hs+6−1
@@ -12,7 +12,10 @@ import Data.Kind ( Type )
12import Prelude ()
12import Prelude ()
13
13
14-- rel8
14-- rel8
15+import Rel8.Aggregate ( Aggregate )
16+import Rel8.Expr ( Expr )
15import qualified Rel8.Schema.Kind as K
17import qualified Rel8.Schema.Kind as K
18+import Rel8.Schema.Name ( Name )
16import Rel8.Schema.Result ( Result )
19import Rel8.Schema.Result ( Result )
17import Rel8.Table.These ( TheseTable )
20import Rel8.Table.These ( TheseTable )
18
21
@@ -25,5 +28,7 @@ import Data.These ( These )
25-- 'Result' context.
28-- 'Result' context.
26type HThese :: K.Context -> Type -> Type -> Type
29type HThese :: K.Context -> Type -> Type -> Type
27type family HThese context = these | these -> context where
30type family HThese context = these | these -> context where
31+ HThese Aggregate = TheseTable Aggregate
32+ HThese Expr = TheseTable Expr
33+ HThese Name = TheseTable Name
28 HThese Result = These
34 HThese Result = These
29− HThese context = TheseTable context
src/Rel8/Expr.hs+32−14
@@ -1,21 +1,26 @@
1{-# language DataKinds #-}
1{-# language DataKinds #-}
2{-# language DerivingStrategies #-}
2{-# language DerivingStrategies #-}
3−{-# language FlexibleContexts #-}
4{-# language FlexibleInstances #-}
3{-# language FlexibleInstances #-}
4+{-# language GADTs #-}
5{-# language MultiParamTypeClasses #-}
5{-# language MultiParamTypeClasses #-}
6+{-# language PolyKinds #-}
7+{-# language RoleAnnotations #-}
6{-# language ScopedTypeVariables #-}
8{-# language ScopedTypeVariables #-}
9+{-# language StandaloneDeriving #-}
7{-# language StandaloneKindSignatures #-}
10{-# language StandaloneKindSignatures #-}
8{-# language TypeApplications #-}
11{-# language TypeApplications #-}
9{-# language TypeFamilies #-}
12{-# language TypeFamilies #-}
10{-# language UndecidableInstances #-}
13{-# language UndecidableInstances #-}
14+{-# language UndecidableSuperClasses #-}
11
15
12module Rel8.Expr
16module Rel8.Expr
13 ( Expr(..)
17 ( Expr(..)
18+ , Col( E, unE )
14 )
19 )
15where
20where
16
21
17-- base
22-- base
18−import Data.Functor.Identity ( Identity( Identity ) )
23+import Data.Kind ( Type )
19import Data.String ( IsString, fromString )
24import Data.String ( IsString, fromString )
20import Prelude hiding ( null )
25import Prelude hiding ( null )
21
26
@@ -32,14 +37,16 @@ import Rel8.Expr.Opaleye
32 , zipPrimExprsWith
37 , zipPrimExprsWith
33 )
38 )
34import Rel8.Expr.Serialize ( litExpr )
39import Rel8.Expr.Serialize ( litExpr )
40+import Rel8.Schema.Context ( Interpretation, Col )
35−import Rel8.Schema.HTable.Identity ( HIdentity( HIdentity ) )
41+import Rel8.Schema.HTable.Identity ( HIdentity( HType ), HType )
36−import qualified Rel8.Schema.Kind as K
37import Rel8.Schema.Null ( Nullity( Null, NotNull ), Sql, nullable )
42import Rel8.Schema.Null ( Nullity( Null, NotNull ), Sql, nullable )
43+import Rel8.Schema.Result ( Col( R ) )
44+import Rel8.Schema.Spec ( Spec( Spec ) )
38import Rel8.Table
45import Rel8.Table
39 ( Table, Columns, Context, fromColumns, toColumns
46 ( Table, Columns, Context, fromColumns, toColumns
40 , FromExprs, fromResult, toResult
47 , FromExprs, fromResult, toResult
41− , Transpose
42 )
48 )
49+import Rel8.Table.Recontextualize ( Recontextualize )
43import Rel8.Type ( DBType )
50import Rel8.Type ( DBType )
44import Rel8.Type.Monoid ( DBMonoid, memptyExpr )
51import Rel8.Type.Monoid ( DBMonoid, memptyExpr )
45import Rel8.Type.Num ( DBFloating, DBFractional, DBNum )
52import Rel8.Type.Num ( DBFloating, DBFractional, DBNum )
@@ -47,9 +54,13 @@ import Rel8.Type.Semigroup ( DBSemigroup, (<>.) )
47
54
48
55
49-- | Typed SQL expressions.
56-- | Typed SQL expressions.
50−type Expr :: K.Context
57+type role Expr representational
58+type Expr :: k -> Type
59+data Expr a where
51−newtype Expr a = Expr Opaleye.PrimExpr
60+ Expr :: k ~ Type => !Opaleye.PrimExpr -> Expr (a :: k)
61+
62+
52− deriving stock Show
63+deriving stock instance Show (Expr a)
53
64
54
65
55instance Sql DBSemigroup a => Semigroup (Expr a) where
66instance Sql DBSemigroup a => Semigroup (Expr a) where
@@ -113,13 +124,20 @@ instance Sql DBFloating a => Floating (Expr a) where
113 atanh = function "atanh"
124 atanh = function "atanh"
114
125
115
126
127+instance Interpretation Expr where
128+ data Col Expr _spec where
129+ E :: {unE :: !(Expr a)} -> Col Expr ('Spec a)
130+
131+
116instance Sql DBType a => Table Expr (Expr a) where
132instance Sql DBType a => Table Expr (Expr a) where
117− type Columns (Expr a) = HIdentity a
133+ type Columns (Expr a) = HType a
118 type Context (Expr a) = Expr
134 type Context (Expr a) = Expr
119 type FromExprs (Expr a) = a
135 type FromExprs (Expr a) = a
120− type Transpose to (Expr a) = to a
121
136
122− toColumns a = HIdentity a
137+ toColumns a = HType (E a)
123− fromColumns (HIdentity a) = a
138+ fromColumns (HType (E a)) = a
124− toResult a = HIdentity (Identity a)
139+ toResult a = HType (R a)
125− fromResult (HIdentity (Identity a)) = a
140+ fromResult (HType (R a)) = a
141+
142+
143+instance Sql DBType a => Recontextualize Expr Expr (Expr a) (Expr a)
src/Rel8/Expr.hs-boot+8−6
@@ -1,4 +1,6 @@
1−{-# language DataKinds #-}
1+{-# language GADTs #-}
2+{-# language PolyKinds #-}
3+{-# language RoleAnnotations #-}
2{-# language StandaloneKindSignatures #-}
4{-# language StandaloneKindSignatures #-}
3
5
4module Rel8.Expr
6module Rel8.Expr
@@ -7,14 +9,14 @@ module Rel8.Expr
7where
9where
8
10
9-- base
11-- base
12+import Data.Kind ( Type )
10import Prelude ()
13import Prelude ()
11
14
12-- opaleye
15-- opaleye
13import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
16import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
14
17
15−-- rel8
16−import Rel8.Schema.Kind ( Context )
17
18
18−
19+type role Expr representational
19−type Expr :: Context
20+type Expr :: k -> Type
21+data Expr a where
20−newtype Expr a = Expr Opaleye.PrimExpr
22+ Expr :: k ~ Type => !Opaleye.PrimExpr -> Expr (a :: k)
src/Rel8/Expr/Aggregate.hs+64−25
@@ -10,7 +10,6 @@ module Rel8.Expr.Aggregate
10 , and, or
10 , and, or
11 , min, max
11 , min, max
12 , sum, sumWhere
12 , sum, sumWhere
13− , avg
14 , stringAgg
13 , stringAgg
15 , groupByExpr
14 , groupByExpr
16 , listAggExpr, nonEmptyAggExpr
15 , listAggExpr, nonEmptyAggExpr
@@ -24,12 +23,10 @@ import Data.List.NonEmpty ( NonEmpty )
24import Prelude hiding ( and, max, min, null, or, sum )
23import Prelude hiding ( and, max, min, null, or, sum )
25
24
26-- opaleye
25-- opaleye
27−import qualified Opaleye.Internal.Aggregate as Opaleye
26+import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
28−import Opaleye.Internal.Column ( Field_( Column ) )
29−import qualified Opaleye.Aggregate as Opaleye
30
27
31-- rel8
28-- rel8
32−import Rel8.Aggregate ( Aggregate, unsafeMakeAggregate )
29+import Rel8.Aggregate ( Aggregate, Aggregator(..), unsafeMakeAggregate )
33import Rel8.Expr ( Expr )
30import Rel8.Expr ( Expr )
34import Rel8.Expr.Bool ( caseExpr )
31import Rel8.Expr.Bool ( caseExpr )
35import Rel8.Expr.Opaleye
32import Rel8.Expr.Opaleye
@@ -53,13 +50,23 @@ import Rel8.Type.Sum ( DBSum )
53
50
54-- | Count the occurances of a single column. Corresponds to @COUNT(a)@
51-- | Count the occurances of a single column. Corresponds to @COUNT(a)@
55count :: Expr a -> Aggregate Int64
52count :: Expr a -> Aggregate Int64
56−count = unsafeMakeAggregate toPrimExpr fromPrimExpr Opaleye.count
53+count = unsafeMakeAggregate toPrimExpr fromPrimExpr $
54+ Just Aggregator
55+ { operation = Opaleye.AggrCount
56+ , ordering = []
57+ , distinction = Opaleye.AggrAll
58+ }
59+
57
60
58-- | Count the number of distinct occurances of a single column. Corresponds to
61-- | Count the number of distinct occurances of a single column. Corresponds to
59-- @COUNT(DISTINCT a)@
62-- @COUNT(DISTINCT a)@
60countDistinct :: Sql DBEq a => Expr a -> Aggregate Int64
63countDistinct :: Sql DBEq a => Expr a -> Aggregate Int64
61countDistinct = unsafeMakeAggregate toPrimExpr fromPrimExpr $
64countDistinct = unsafeMakeAggregate toPrimExpr fromPrimExpr $
62− Opaleye.distinctAggregator Opaleye.count
65+ Just Aggregator
66+ { operation = Opaleye.AggrCount
67+ , ordering = []
68+ , distinction = Opaleye.AggrDistinct
69+ }
63
70
64
71
65-- | Corresponds to @COUNT(*)@.
72-- | Corresponds to @COUNT(*)@.
@@ -74,39 +81,56 @@ countWhere condition = count (caseExpr [(condition, litExpr (Just True))] null)
74
81
75-- | Corresponds to @bool_and@.
82-- | Corresponds to @bool_and@.
76and :: Expr Bool -> Aggregate Bool
83and :: Expr Bool -> Aggregate Bool
77−and = unsafeMakeAggregate toPrimExpr fromPrimExpr Opaleye.boolAnd
84+and = unsafeMakeAggregate toPrimExpr fromPrimExpr $
85+ Just Aggregator
86+ { operation = Opaleye.AggrBoolAnd
87+ , ordering = []
88+ , distinction = Opaleye.AggrAll
89+ }
78
90
79
91
80-- | Corresponds to @bool_or@.
92-- | Corresponds to @bool_or@.
81or :: Expr Bool -> Aggregate Bool
93or :: Expr Bool -> Aggregate Bool
82−or = unsafeMakeAggregate toPrimExpr fromPrimExpr Opaleye.boolOr
94+or = unsafeMakeAggregate toPrimExpr fromPrimExpr $
95+ Just Aggregator
96+ { operation = Opaleye.AggrBoolOr
97+ , ordering = []
98+ , distinction = Opaleye.AggrAll
99+ }
83
100
84
101
85-- | Produce an aggregation for @Expr a@ using the @max@ function.
102-- | Produce an aggregation for @Expr a@ using the @max@ function.
86max :: Sql DBMax a => Expr a -> Aggregate a
103max :: Sql DBMax a => Expr a -> Aggregate a
87−max = unsafeMakeAggregate toPrimExpr fromPrimExpr Opaleye.unsafeMax
104+max = unsafeMakeAggregate toPrimExpr fromPrimExpr $
105+ Just Aggregator
106+ { operation = Opaleye.AggrMax
107+ , ordering = []
108+ , distinction = Opaleye.AggrAll
109+ }
88
110
89
111
90-- | Produce an aggregation for @Expr a@ using the @max@ function.
112-- | Produce an aggregation for @Expr a@ using the @max@ function.
91min :: Sql DBMin a => Expr a -> Aggregate a
113min :: Sql DBMin a => Expr a -> Aggregate a
92−min = unsafeMakeAggregate toPrimExpr fromPrimExpr Opaleye.unsafeMin
114+min = unsafeMakeAggregate toPrimExpr fromPrimExpr $
115+ Just Aggregator
116+ { operation = Opaleye.AggrMin
117+ , ordering = []
118+ , distinction = Opaleye.AggrAll
119+ }
93
120
94-- | Corresponds to @sum@. Note that in SQL, @sum@ is type changing - for
121-- | Corresponds to @sum@. Note that in SQL, @sum@ is type changing - for
95-- example the @sum@ of @integer@ returns a @bigint@. Rel8 doesn't support
122-- example the @sum@ of @integer@ returns a @bigint@. Rel8 doesn't support
96−-- this, and will add explicit casts back to the original input type. This can
123+-- this, and will add explicit cast back to the original input type. This can
97-- lead to overflows, and if you anticipate very large sums, you should upcast
124-- lead to overflows, and if you anticipate very large sums, you should upcast
98-- your input.
125-- your input.
99sum :: Sql DBSum a => Expr a -> Aggregate a
126sum :: Sql DBSum a => Expr a -> Aggregate a
100−sum = unsafeMakeAggregate toPrimExpr (castExpr . fromPrimExpr) Opaleye.unsafeSum
127+sum = unsafeMakeAggregate toPrimExpr (castExpr . fromPrimExpr) $
101−
128+ Just Aggregator
129+ { operation = Opaleye.AggrSum
130+ , ordering = []
131+ , distinction = Opaleye.AggrAll
132+ }
102
133
103−-- | Corresponds to @avg@. Note that in SQL, @avg@ is type changing - for
104−-- example, the @avg@ of @integer@ returns a @numeric@. Rel8 doesn't support
105−-- this, and will add explicit casts back to the original input type. If you
106−-- need a fractional result on an integral column, you should cast your input
107−-- to 'Double' or 'Data.Scientific.Scientific' before calling 'avg'.
108−avg :: Sql DBSum a => Expr a -> Aggregate a
109−avg = unsafeMakeAggregate toPrimExpr (castExpr . fromPrimExpr) Opaleye.unsafeAvg
110
134
111-- | Take the sum of all expressions that satisfy a predicate.
135-- | Take the sum of all expressions that satisfy a predicate.
112sumWhere :: (Sql DBNum a, Sql DBSum a)
136sumWhere :: (Sql DBNum a, Sql DBSum a)
@@ -118,12 +142,17 @@ sumWhere condition a = sum (caseExpr [(condition, a)] 0)
118stringAgg :: Sql DBString a
142stringAgg :: Sql DBString a
119 => Expr db -> Expr a -> Aggregate a
143 => Expr db -> Expr a -> Aggregate a
120stringAgg delimiter =
144stringAgg delimiter =
121− unsafeMakeAggregate toPrimExpr (castExpr . fromPrimExpr) (Opaleye.stringAgg (Column (toPrimExpr delimiter)))
145+ unsafeMakeAggregate toPrimExpr (castExpr . fromPrimExpr) $
146+ Just Aggregator
147+ { operation = Opaleye.AggrStringAggr (toPrimExpr delimiter)
148+ , ordering = []
149+ , distinction = Opaleye.AggrAll
150+ }
122
151
123
152
124-- | Aggregate a value by grouping by it.
153-- | Aggregate a value by grouping by it.
125groupByExpr :: Sql DBEq a => Expr a -> Aggregate a
154groupByExpr :: Sql DBEq a => Expr a -> Aggregate a
126−groupByExpr = unsafeMakeAggregate toPrimExpr fromPrimExpr Opaleye.groupBy
155+groupByExpr = unsafeMakeAggregate toPrimExpr fromPrimExpr Nothing
127
156
128
157
129-- | Collect expressions values as a list.
158-- | Collect expressions values as a list.
@@ -138,13 +167,23 @@ nonEmptyAggExpr = snonEmptyAggExpr typeInformation
138
167
139slistAggExpr :: ()
168slistAggExpr :: ()
140 => TypeInformation (Unnullify a) -> Expr a -> Aggregate [a]
169 => TypeInformation (Unnullify a) -> Expr a -> Aggregate [a]
141−slistAggExpr info = unsafeMakeAggregate to fromPrimExpr Opaleye.arrayAgg
170+slistAggExpr info = unsafeMakeAggregate to fromPrimExpr $ Just
171+ Aggregator
172+ { operation = Opaleye.AggrArr
173+ , ordering = []
174+ , distinction = Opaleye.AggrAll
175+ }
142 where
176 where
143 to = encodeArrayElement info . toPrimExpr
177 to = encodeArrayElement info . toPrimExpr
144
178
145
179
146snonEmptyAggExpr :: ()
180snonEmptyAggExpr :: ()
147 => TypeInformation (Unnullify a) -> Expr a -> Aggregate (NonEmpty a)
181 => TypeInformation (Unnullify a) -> Expr a -> Aggregate (NonEmpty a)
148−snonEmptyAggExpr info = unsafeMakeAggregate to fromPrimExpr Opaleye.arrayAgg
182+snonEmptyAggExpr info = unsafeMakeAggregate to fromPrimExpr $ Just
183+ Aggregator
184+ { operation = Opaleye.AggrArr
185+ , ordering = []
186+ , distinction = Opaleye.AggrAll
187+ }
149 where
188 where
150 to = encodeArrayElement info . toPrimExpr
189 to = encodeArrayElement info . toPrimExpr
src/Rel8/Expr/Num.hs+6−39
@@ -4,24 +4,18 @@
4{-# options_ghc -fno-warn-redundant-constraints #-}
4{-# options_ghc -fno-warn-redundant-constraints #-}
5
5
6module Rel8.Expr.Num
6module Rel8.Expr.Num
7− ( fromIntegral
8− , realToFrac
9− , div, mod, divMod
10− , quot, rem, quotRem
11− , ceiling, floor, round, truncate
7+ ( fromIntegral, realToFrac, div, mod, ceiling, floor, round, truncate
12 )
8 )
13where
9where
14
10
15-- base
11-- base
16−import Prelude ( (+), (-), fst, negate, signum, snd )
12+import Prelude ()
17
13
18-- rel
14-- rel
19import Rel8.Expr ( Expr( Expr ) )
15import Rel8.Expr ( Expr( Expr ) )
20−import Rel8.Expr.Eq ( (==.) )
21import Rel8.Expr.Function ( function )
16import Rel8.Expr.Function ( function )
22import Rel8.Expr.Opaleye ( castExpr )
17import Rel8.Expr.Opaleye ( castExpr )
23import Rel8.Schema.Null ( Homonullable, Sql )
18import Rel8.Schema.Null ( Homonullable, Sql )
24−import Rel8.Table.Bool ( bool )
25import Rel8.Type.Num ( DBFractional, DBIntegral, DBNum )
19import Rel8.Type.Num ( DBFractional, DBIntegral, DBNum )
26
20
27
21
@@ -48,41 +42,14 @@ ceiling :: (Sql DBFractional a, Sql DBIntegral b, Homonullable a b)
48ceiling = function "ceiling"
42ceiling = function "ceiling"
49
43
50
44
51−-- | Emulates the behaviour of the Haskell function 'Prelude.div' in
45+-- | Perform integral division. Corresponds to the @div()@ function.
52−-- PostgreSQL.
53div :: Sql DBIntegral a => Expr a -> Expr a -> Expr a
46div :: Sql DBIntegral a => Expr a -> Expr a -> Expr a
54−div n d = fst (divMod n d)
47+div = function "div"
55
48
56
49
57−-- | Emulates the behaviour of the Haskell function 'Prelude.mod' in
50+-- | Corresponds to the @mod()@ function.
58−-- PostgreSQL.
59mod :: Sql DBIntegral a => Expr a -> Expr a -> Expr a
51mod :: Sql DBIntegral a => Expr a -> Expr a -> Expr a
60−mod n d = snd (divMod n d)
52+mod = function "mod"
61−
62−
63−-- | Simultaneous 'div' and 'mod'.
64−divMod :: Sql DBIntegral a => Expr a -> Expr a -> (Expr a, Expr a)
65−divMod n d = bool qr (q - 1, r + d) (signum r ==. negate (signum d))
66− where
67− qr@(q, r) = quotRem n d
68−
69−
70−-- | Perform integral division. Corresponds to the @div()@ function in
71−-- PostgreSQL, which behaves like Haskell's 'Prelude.quot' rather than
72−-- 'Prelude.div'.
73−quot :: Sql DBIntegral a => Expr a -> Expr a -> Expr a
74−quot = function "div"
75−
76−
77−-- | Corresponds to the @mod()@ function in PostgreSQL, which behaves like
78−-- Haskell's 'Prelude.rem' rather than 'Prelude.mod'.
79−rem :: Sql DBIntegral a => Expr a -> Expr a -> Expr a
80−rem = function "mod"
81−
82−
83−-- | Simultaneous 'quot' and 'rem'.
84−quotRem :: Sql DBIntegral a => Expr a -> Expr a -> (Expr a, Expr a)
85−quotRem n d = (quot n d, rem n d)
86
53
87
54
88-- | Round a 'DFractional' to a 'DBIntegral' by rounding to the nearest smaller
55-- | Round a 'DFractional' to a 'DBIntegral' by rounding to the nearest smaller
src/Rel8/Expr/Opaleye.hs+3−12
@@ -10,7 +10,7 @@ module Rel8.Expr.Opaleye
10 , scastExpr, sunsafeCastExpr
10 , scastExpr, sunsafeCastExpr
11 , unsafeLiteral
11 , unsafeLiteral
12 , fromPrimExpr, toPrimExpr, mapPrimExpr, zipPrimExprsWith, traversePrimExpr
12 , fromPrimExpr, toPrimExpr, mapPrimExpr, zipPrimExprsWith, traversePrimExpr
13− , toColumn, fromColumn, traverseFieldP
13+ , toColumn, fromColumn
14 )
14 )
15where
15where
16
16
@@ -27,9 +27,6 @@ import Rel8.Schema.Null ( Unnullify, Sql )
27import Rel8.Type ( DBType, typeInformation )
27import Rel8.Type ( DBType, typeInformation )
28import Rel8.Type.Information ( TypeInformation(..) )
28import Rel8.Type.Information ( TypeInformation(..) )
29
29
30−-- profunctors
31−import Data.Profunctor ( Profunctor, dimap )
32−
33
30
34castExpr :: Sql DBType a => Expr a -> Expr a
31castExpr :: Sql DBType a => Expr a -> Expr a
35castExpr = scastExpr typeInformation
32castExpr = scastExpr typeInformation
@@ -83,15 +80,9 @@ traversePrimExpr :: Functor f
83traversePrimExpr f = fmap fromPrimExpr . f . toPrimExpr
80traversePrimExpr f = fmap fromPrimExpr . f . toPrimExpr
84
81
85
82
86−traverseFieldP :: Profunctor p
87− => p (Opaleye.Field_ n x) (Opaleye.Field_ m y)
88− -> p (Expr a) (Expr b)
89−traverseFieldP = dimap (toColumn . toPrimExpr) (fromPrimExpr . fromColumn)
90−
91−
92−toColumn :: Opaleye.PrimExpr -> Opaleye.Field_ n b
83+toColumn :: Opaleye.PrimExpr -> Opaleye.Column b
93toColumn = Opaleye.Column
84toColumn = Opaleye.Column
94
85
95
86
96−fromColumn :: Opaleye.Field_ n b -> Opaleye.PrimExpr
87+fromColumn :: Opaleye.Column b -> Opaleye.PrimExpr
97fromColumn (Opaleye.Column a) = a
88fromColumn (Opaleye.Column a) = a
src/Rel8/Expr/Sequence.hs+1−2
@@ -11,7 +11,6 @@ import Prelude
11import Rel8.Expr ( Expr )
11import Rel8.Expr ( Expr )
12import Rel8.Expr.Function ( function )
12import Rel8.Expr.Function ( function )
13import Rel8.Expr.Serialize ( litExpr )
13import Rel8.Expr.Serialize ( litExpr )
14−import Rel8.Expr.Text ( quoteIdent )
15
14
16-- text
15-- text
17import Data.Text ( pack )
16import Data.Text ( pack )
@@ -19,4 +18,4 @@ import Data.Text ( pack )
19
18
20-- | See https://www.postgresql.org/docs/current/functions-sequence.html
19-- | See https://www.postgresql.org/docs/current/functions-sequence.html
21nextval :: String -> Expr Int64
20nextval :: String -> Expr Int64
22−nextval = function "nextval" . quoteIdent . litExpr . pack
21+nextval = function "nextval" . litExpr . pack
src/Rel8/Expr/Text.hs+2−23
@@ -17,9 +17,6 @@ module Rel8.Expr.Text
17 , pgClientEncoding, quoteIdent, quoteLiteral, quoteNullable, regexpReplace
17 , pgClientEncoding, quoteIdent, quoteLiteral, quoteNullable, regexpReplace
18 , regexpSplitToArray, repeat, replace, reverse, right, rpad, rtrim
18 , regexpSplitToArray, repeat, replace, reverse, right, rpad, rtrim
19 , splitPart, strpos, substr, translate
19 , splitPart, strpos, substr, translate
20−
21− -- * @LIKE@ and @ILIKE@
22− , like, ilike
23 )
20 )
24where
21where
25
22
@@ -27,7 +24,7 @@ where
27import Data.Bool ( Bool )
24import Data.Bool ( Bool )
28import Data.Int ( Int32 )
25import Data.Int ( Int32 )
29import Data.Maybe ( Maybe( Nothing, Just ) )
26import Data.Maybe ( Maybe( Nothing, Just ) )
30−import Prelude ( flip )
27+import Prelude ()
31
28
32-- bytestring
29-- bytestring
33import Data.ByteString ( ByteString )
30import Data.ByteString ( ByteString )
@@ -52,7 +49,7 @@ infixr 6 ++.
52
49
53
50
54-- | Matches regular expression, case sensitive
51-- | Matches regular expression, case sensitive
55−--
52+--
56-- Corresponds to the @~.@ operator.
53-- Corresponds to the @~.@ operator.
57(~.) :: Expr Text -> Expr Text -> Expr Bool
54(~.) :: Expr Text -> Expr Text -> Expr Bool
58(~.) = binaryOperator "~."
55(~.) = binaryOperator "~."
@@ -276,21 +273,3 @@ substr a b Nothing = function "substr" a b
276-- | Corresponds to the @translate@ function.
273-- | Corresponds to the @translate@ function.
277translate :: Expr Text -> Expr Text -> Expr Text -> Expr Text
274translate :: Expr Text -> Expr Text -> Expr Text -> Expr Text
278translate = function "translate"
275translate = function "translate"
279−
280−
281−-- | @like x y@ corresponds to the expression @y LIKE x@.
282−--
283−-- Note that the arguments to @like@ are swapped. This is to aid currying, so
284−-- you can write expressions like
285−-- @filter (like "Rel%" . packageName) =<< each haskellPackages@
286−like :: Expr Text -> Expr Text -> Expr Bool
287−like = flip (binaryOperator "LIKE")
288−
289−
290−-- | @ilike x y@ corresponds to the expression @y ILIKE x@.
291−--
292−-- Note that the arguments to @ilike@ are swapped. This is to aid currying, so
293−-- you can write expressions like
294−-- @filter (ilike "Rel%" . packageName) =<< each haskellPackages@
295−ilike :: Expr Text -> Expr Text -> Expr Bool
296−ilike = flip (binaryOperator "ILIKE")
src/Rel8/Expr/Window.hsdeleted−121
@@ -1,121 +0,0 @@
1−module Rel8.Expr.Window
2− ( cumulative
3− , rowNumber
4− , rank
5− , denseRank
6− , percentRank
7− , cumeDist
8− , ntile
9− , lag
10− , lead
11− , firstValue
12− , lastValue
13− , nthValue
14− )
15−where
16−
17−-- base
18−import Data.Int ( Int32, Int64 )
19−import Prelude
20−
21−-- opaleye
22−import qualified Opaleye.Internal.Aggregate as Opaleye
23−import qualified Opaleye.Internal.PackMap as Opaleye
24−import qualified Opaleye.Internal.Window as Opaleye
25−import qualified Opaleye.Window as Opaleye
26−
27−-- profunctors
28−import Data.Profunctor (dimap)
29−
30−-- rel8
31−import Rel8.Aggregate ( Aggregate( Aggregate ) )
32−import Rel8.Expr ( Expr )
33−import Rel8.Expr.Opaleye ( fromColumn, fromPrimExpr, toColumn, toPrimExpr )
34−import Rel8.Schema.Null ( Nullify )
35−import Rel8.Window ( Window( Window ) )
36−
37−
38−cumulative :: (a -> Aggregate b) -> Window a (Expr b)
39−cumulative f =
40− fromWindowFunction $ Opaleye.aggregatorWindowFunction (fromAggregate f) id
41−
42−
43−-- | [@row_number()@](https://www.postgresql.org/docs/current/functions-window.html)
44−rowNumber :: Window a (Expr Int64)
45−rowNumber = fromWindowFunction $ fromPrimExpr . fromColumn <$> Opaleye.rowNumber
46−
47−
48−-- | [@rank()@](https://www.postgresql.org/docs/current/functions-window.html)
49−rank :: Window a (Expr Int64)
50−rank = fromWindowFunction $ fromPrimExpr . fromColumn <$> Opaleye.rank
51−
52−
53−-- | [@dense_rank()@](https://www.postgresql.org/docs/current/functions-window.html)
54−denseRank :: Window a (Expr Int64)
55−denseRank = fromWindowFunction $ fromPrimExpr . fromColumn <$> Opaleye.denseRank
56−
57−
58−-- | [@percent_rank()@](https://www.postgresql.org/docs/current/functions-window.html)
59−percentRank :: Window a (Expr Double)
60−percentRank = fromWindowFunction $ fromPrimExpr . fromColumn <$> Opaleye.percentRank
61−
62−
63−-- | [@cume_dist()@](https://www.postgresql.org/docs/current/functions-window.html)
64−cumeDist :: Window a (Expr Double)
65−cumeDist = fromWindowFunction $ fromPrimExpr . fromColumn <$> Opaleye.cumeDist
66−
67−
68−-- | [@ntile(num_buckets)@](https://www.postgresql.org/docs/current/functions-window.html)
69−ntile :: Expr Int32 -> Window a (Expr Int32)
70−ntile buckets = fromWindowFunction $ fromPrimExpr . fromColumn <$>
71− Opaleye.ntile (toColumn (toPrimExpr buckets))
72−
73−
74−-- | [@lag(value, offset, default)@](https://www.postgresql.org/docs/current/functions-window.html)
75−lag :: Expr Int32 -> Expr a -> Window (Expr a) (Expr a)
76−lag offset def =
77− fromWindowFunction $
78− dimap (toColumn . toPrimExpr) (fromPrimExpr . fromColumn) $
79− Opaleye.lag (toColumn (toPrimExpr offset)) (toColumn (toPrimExpr def))
80−
81−
82−-- | [@lead(value, offset, default)@](https://www.postgresql.org/docs/current/functions-window.html)
83−lead :: Expr Int32 -> Expr a -> Window (Expr a) (Expr a)
84−lead offset def =
85− fromWindowFunction $
86− dimap (toColumn . toPrimExpr) (fromPrimExpr . fromColumn) $
87− Opaleye.lead (toColumn (toPrimExpr offset)) (toColumn (toPrimExpr def))
88−
89−
90−-- | [@first_value(value)@](https://www.postgresql.org/docs/current/functions-window.html)
91−firstValue :: Window (Expr a) (Expr a)
92−firstValue =
93− fromWindowFunction $
94− dimap (toColumn . toPrimExpr) (fromPrimExpr . fromColumn)
95− Opaleye.firstValue
96−
97−
98−-- | [@last_value(value)@](https://www.postgresql.org/docs/current/functions-window.html)
99−lastValue :: Window (Expr a) (Expr a)
100−lastValue =
101− fromWindowFunction $
102− dimap (toColumn . toPrimExpr) (fromPrimExpr . fromColumn)
103− Opaleye.lastValue
104−
105−
106−-- | [@nth_value(value, n)@](https://www.postgresql.org/docs/current/functions-window.html)
107−nthValue :: Expr Int32 -> Window (Expr a) (Expr (Nullify a))
108−nthValue n =
109− fromWindowFunction $
110− dimap (toColumn . toPrimExpr) (fromPrimExpr . fromColumn) $
111− Opaleye.nthValue (toColumn (toPrimExpr n))
112−
113−
114−fromAggregate :: (a -> Aggregate b) -> Opaleye.Aggregator a (Expr b)
115−fromAggregate f = Opaleye.Aggregator $ Opaleye.PackMap $ \w a -> case f a of
116− Aggregate (Opaleye.Aggregator (Opaleye.PackMap x)) -> x w ()
117−
118−
119−fromWindowFunction :: Opaleye.WindowFunction a b -> Window a b
120−fromWindowFunction (Opaleye.WindowFunction (Opaleye.PackMap w)) =
121− Window $ Opaleye.Windows $ Opaleye.PackMap $ \f -> w $ \o -> f (o, mempty)
src/Rel8/Generic/Construction.hs+50−50
@@ -29,8 +29,8 @@ import GHC.TypeLits ( Symbol )
29import Prelude
29import Prelude
30
30
31-- rel8
31-- rel8
32−import Rel8.Aggregate ( Aggregate( Aggregate ) )
32+import Rel8.Aggregate ( Col( A ), Aggregate( Aggregate ) )
33−import Rel8.Expr ( Expr )
33+import Rel8.Expr ( Col( E ), Expr )
34import Rel8.Expr.Aggregate ( groupByExpr )
34import Rel8.Expr.Aggregate ( groupByExpr )
35import Rel8.Expr.Eq ( (==.) )
35import Rel8.Expr.Eq ( (==.) )
36import Rel8.Expr.Null ( nullify, snull, unsafeUnnullify )
36import Rel8.Expr.Null ( nullify, snull, unsafeUnnullify )
@@ -57,11 +57,11 @@ import Rel8.Kind.Algebra
57import qualified Rel8.Kind.Algebra as K
57import qualified Rel8.Kind.Algebra as K
58import Rel8.Schema.Context.Nullify ( sguard, snullify )
58import Rel8.Schema.Context.Nullify ( sguard, snullify )
59import Rel8.Schema.HTable ( HTable )
59import Rel8.Schema.HTable ( HTable )
60−import Rel8.Schema.HTable.Identity ( HIdentity( HIdentity ) )
60+import Rel8.Schema.HTable.Identity ( HIdentity( HType ) )
61import qualified Rel8.Schema.Kind as K
61import qualified Rel8.Schema.Kind as K
62−import Rel8.Schema.Name ( Name( Name ) )
62+import Rel8.Schema.Name ( Col( N ), Name( Name ) )
63import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
63import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
64−import Rel8.Schema.Spec ( Spec( Spec, nullity, info ) )
64+import Rel8.Schema.Spec ( SSpec( SSpec, nullity, info ) )
65import Rel8.Table
65import Rel8.Table
66 ( TTable, TColumns
66 ( TTable, TColumns
67 , Table, fromColumns, toColumns
67 , Table, fromColumns, toColumns
@@ -86,11 +86,11 @@ type family GGBuildable' algebra name rep where
86 GGBuildable' 'K.Product name rep =
86 GGBuildable' 'K.Product name rep =
87 ( name ~ GConstructor (Eval (rep Expr))
87 ( name ~ GConstructor (Eval (rep Expr))
88 , Representable Id (Eval (rep Expr))
88 , Representable Id (Eval (rep Expr))
89− , GConstructable (TTable Expr) TColumns Id Expr (Eval (rep Expr))
89+ , GConstructable (TTable Expr) TColumns Id (Col Expr) (Eval (rep Expr))
90 )
90 )
91 GGBuildable' 'K.Sum name rep =
91 GGBuildable' 'K.Sum name rep =
92 ( Representable Id (GConstructorADT name (Eval (rep Expr)))
92 ( Representable Id (GConstructorADT name (Eval (rep Expr)))
93− , GMakeableADT (TTable Expr) TColumns Id Expr name (Eval (rep Expr))
93+ , GMakeableADT (TTable Expr) TColumns Id (Col Expr) name (Eval (rep Expr))
94 )
94 )
95
95
96
96
@@ -103,7 +103,7 @@ type family GGBuild algebra name rep r where
103
103
104
104
105ggbuild :: forall algebra name rep a. GGBuildable algebra name rep
105ggbuild :: forall algebra name rep a. GGBuildable algebra name rep
106− => (Eval (GGColumns algebra TColumns (Eval (rep Expr))) Expr -> a)
106+ => (Eval (GGColumns algebra TColumns (Eval (rep Expr))) (Col Expr) -> a)
107 -> GGBuild algebra name rep a
107 -> GGBuild algebra name rep a
108ggbuild gfromColumns = case algebraSing @algebra of
108ggbuild gfromColumns = case algebraSing @algebra of
109 SProduct ->
109 SProduct ->
@@ -113,7 +113,7 @@ ggbuild gfromColumns = case algebraSing @algebra of
113 @(TTable Expr)
113 @(TTable Expr)
114 @TColumns
114 @TColumns
115 @Id
115 @Id
116− @Expr
116+ @(Col Expr)
117 @(Eval (rep Expr))
117 @(Eval (rep Expr))
118 (const toColumns)
118 (const toColumns)
119 SSum ->
119 SSum ->
@@ -123,15 +123,15 @@ ggbuild gfromColumns = case algebraSing @algebra of
123 @(TTable Expr)
123 @(TTable Expr)
124 @TColumns
124 @TColumns
125 @Id
125 @Id
126− @Expr
126+ @(Col Expr)
127 @name
127 @name
128 @(Eval (rep Expr))
128 @(Eval (rep Expr))
129 (const toColumns)
129 (const toColumns)
130− (\Spec {info} -> snull info)
130+ (\SSpec {info} -> E (snull info))
131− (\Spec {nullity} -> case nullity of
131+ (\SSpec {nullity} -> case nullity of
132 Null -> id
132 Null -> id
133− NotNull -> nullify)
133+ NotNull -> \(E a) -> E (nullify a))
134− (HIdentity . litExpr)
134+ (HType . E . litExpr)
135
135
136
136
137type GGConstructable :: K.Algebra -> (K.Context -> Exp (Type -> Type)) -> Constraint
137type GGConstructable :: K.Algebra -> (K.Context -> Exp (Type -> Type)) -> Constraint
@@ -151,9 +151,9 @@ type family GGConstructable' algebra rep where
151 ( Representable Id (Eval (rep Aggregate))
151 ( Representable Id (Eval (rep Aggregate))
152 , Representable Id (Eval (rep Expr))
152 , Representable Id (Eval (rep Expr))
153 , Representable Id (Eval (rep Name))
153 , Representable Id (Eval (rep Name))
154− , GConstructable (TTable Aggregate) TColumns Id Aggregate (Eval (rep Aggregate))
154+ , GConstructable (TTable Aggregate) TColumns Id (Col Aggregate) (Eval (rep Aggregate))
155− , GConstructable (TTable Expr) TColumns Id Expr (Eval (rep Expr))
155+ , GConstructable (TTable Expr) TColumns Id (Col Expr) (Eval (rep Expr))
156− , GConstructable (TTable Name) TColumns Id Name (Eval (rep Name))
156+ , GConstructable (TTable Name) TColumns Id (Col Name) (Eval (rep Name))
157 )
157 )
158 GGConstructable' 'K.Sum rep =
158 GGConstructable' 'K.Sum rep =
159 ( RepresentableConstructors Id (Eval (rep Expr))
159 ( RepresentableConstructors Id (Eval (rep Expr))
@@ -161,9 +161,9 @@ type family GGConstructable' algebra rep where
161 , RepresentableFields Id (Eval (rep Expr))
161 , RepresentableFields Id (Eval (rep Expr))
162 , RepresentableFields Id (Eval (rep Name))
162 , RepresentableFields Id (Eval (rep Name))
163 , Functor (GConstructors Id (Eval (rep Expr)))
163 , Functor (GConstructors Id (Eval (rep Expr)))
164− , GConstructableADT (TTable Aggregate) TColumns Id Aggregate (Eval (rep Aggregate))
164+ , GConstructableADT (TTable Aggregate) TColumns Id (Col Aggregate) (Eval (rep Aggregate))
165− , GConstructableADT (TTable Expr) TColumns Id Expr (Eval (rep Expr))
165+ , GConstructableADT (TTable Expr) TColumns Id (Col Expr) (Eval (rep Expr))
166− , GConstructableADT (TTable Name) TColumns Id Name (Eval (rep Name))
166+ , GConstructableADT (TTable Name) TColumns Id (Col Name) (Eval (rep Name))
167 )
167 )
168
168
169
169
@@ -174,7 +174,7 @@ type family GGConstruct algebra rep r where
174
174
175
175
176ggconstruct :: forall algebra rep a. GGConstructable algebra rep
176ggconstruct :: forall algebra rep a. GGConstructable algebra rep
177− => (Eval (GGColumns algebra TColumns (Eval (rep Expr))) Expr -> a)
177+ => (Eval (GGColumns algebra TColumns (Eval (rep Expr))) (Col Expr) -> a)
178 -> GGConstruct algebra rep a -> a
178 -> GGConstruct algebra rep a -> a
179ggconstruct gfromColumns f = case algebraSing @algebra of
179ggconstruct gfromColumns f = case algebraSing @algebra of
180 SProduct ->
180 SProduct ->
@@ -185,7 +185,7 @@ ggconstruct gfromColumns f = case algebraSing @algebra of
185 @(TTable Expr)
185 @(TTable Expr)
186 @TColumns
186 @TColumns
187 @Id
187 @Id
188− @Expr
188+ @(Col Expr)
189 @(Eval (rep Expr))
189 @(Eval (rep Expr))
190 (const toColumns)
190 (const toColumns)
191 SSum ->
191 SSum ->
@@ -195,14 +195,14 @@ ggconstruct gfromColumns f = case algebraSing @algebra of
195 @(TTable Expr)
195 @(TTable Expr)
196 @TColumns
196 @TColumns
197 @Id
197 @Id
198− @Expr
198+ @(Col Expr)
199 @(Eval (rep Expr))
199 @(Eval (rep Expr))
200 (const toColumns)
200 (const toColumns)
201− (\Spec {info} -> snull info)
201+ (\SSpec {info} -> E (snull info))
202− (\Spec {nullity} -> case nullity of
202+ (\SSpec {nullity} -> case nullity of
203 Null -> id
203 Null -> id
204− NotNull -> nullify)
204+ NotNull -> \(E a) -> E (nullify a))
205− (HIdentity . litExpr)
205+ (HType . E . litExpr)
206
206
207
207
208type GGDeconstruct :: K.Algebra -> (K.Context -> Exp (Type -> Type)) -> Type -> Type -> Type
208type GGDeconstruct :: K.Algebra -> (K.Context -> Exp (Type -> Type)) -> Type -> Type -> Type
@@ -214,7 +214,7 @@ type family GGDeconstruct algebra rep a r where
214
214
215
215
216ggdeconstruct :: forall algebra rep a r. (GGConstructable algebra rep, Table Expr r)
216ggdeconstruct :: forall algebra rep a r. (GGConstructable algebra rep, Table Expr r)
217− => (a -> Eval (GGColumns algebra TColumns (Eval (rep Expr))) Expr)
217+ => (a -> Eval (GGColumns algebra TColumns (Eval (rep Expr))) (Col Expr))
218 -> GGDeconstruct algebra rep a r
218 -> GGDeconstruct algebra rep a r
219ggdeconstruct gtoColumns = case algebraSing @algebra of
219ggdeconstruct gtoColumns = case algebraSing @algebra of
220 SProduct -> \build ->
220 SProduct -> \build ->
@@ -223,24 +223,24 @@ ggdeconstruct gtoColumns = case algebraSing @algebra of
223 @(TTable Expr)
223 @(TTable Expr)
224 @TColumns
224 @TColumns
225 @Id
225 @Id
226− @Expr
226+ @(Col Expr)
227 @(Eval (rep Expr))
227 @(Eval (rep Expr))
228 (const fromColumns) .
228 (const fromColumns) .
229 gtoColumns
229 gtoColumns
230 SSum ->
230 SSum ->
231 gctabulate @Id @(Eval (rep Expr)) @r @(a -> r) $ \constructors as ->
231 gctabulate @Id @(Eval (rep Expr)) @r @(a -> r) $ \constructors as ->
232 let
232 let
233− (HIdentity tag, cases) =
233+ (HType (E tag), cases) =
234 gdeconstructADT
234 gdeconstructADT
235 @(TTable Expr)
235 @(TTable Expr)
236 @TColumns
236 @TColumns
237 @Id
237 @Id
238− @Expr
238+ @(Col Expr)
239 @(Eval (rep Expr))
239 @(Eval (rep Expr))
240 (const fromColumns)
240 (const fromColumns)
241− (\Spec {nullity} -> case nullity of
241+ (\SSpec {nullity} -> case nullity of
242 Null -> id
242 Null -> id
243− NotNull -> unsafeUnnullify)
243+ NotNull -> \(E a) -> E (unsafeUnnullify a))
244 constructors $
244 constructors $
245 gtoColumns as
245 gtoColumns as
246 in
246 in
@@ -256,7 +256,7 @@ type family GGName algebra rep a where
256
256
257
257
258ggname :: forall algebra rep a. GGConstructable algebra rep
258ggname :: forall algebra rep a. GGConstructable algebra rep
259− => (Eval (GGColumns algebra TColumns (Eval (rep Expr))) Name -> a)
259+ => (Eval (GGColumns algebra TColumns (Eval (rep Expr))) (Col Name) -> a)
260 -> GGName algebra rep a
260 -> GGName algebra rep a
261ggname gfromColumns = case algebraSing @algebra of
261ggname gfromColumns = case algebraSing @algebra of
262 SProduct ->
262 SProduct ->
@@ -266,7 +266,7 @@ ggname gfromColumns = case algebraSing @algebra of
266 @(TTable Name)
266 @(TTable Name)
267 @TColumns
267 @TColumns
268 @Id
268 @Id
269− @Name
269+ @(Col Name)
270 @(Eval (rep Name))
270 @(Eval (rep Name))
271 (const toColumns)
271 (const toColumns)
272 SSum -> \tag ->
272 SSum -> \tag ->
@@ -276,11 +276,11 @@ ggname gfromColumns = case algebraSing @algebra of
276 @(TTable Name)
276 @(TTable Name)
277 @TColumns
277 @TColumns
278 @Id
278 @Id
279− @Name
279+ @(Col Name)
280 @(Eval (rep Name))
280 @(Eval (rep Name))
281 (const toColumns)
281 (const toColumns)
282− (\_ _ (Name a) -> Name a)
282+ (\_ _ (N (Name a)) -> N (Name a))
283− (HIdentity tag)
283+ (HType (N tag))
284
284
285
285
286type GGAggregate :: K.Algebra -> (K.Context -> Exp (Type -> Type)) -> Type -> Type
286type GGAggregate :: K.Algebra -> (K.Context -> Exp (Type -> Type)) -> Type -> Type
@@ -294,8 +294,8 @@ type family GGAggregate algebra rep r where
294
294
295
295
296ggaggregate :: forall algebra rep exprs agg. GGConstructable algebra rep
296ggaggregate :: forall algebra rep exprs agg. GGConstructable algebra rep
297− => (Eval (GGColumns algebra TColumns (Eval (rep Expr))) Aggregate -> agg)
297+ => (Eval (GGColumns algebra TColumns (Eval (rep Expr))) (Col Aggregate) -> agg)
298− -> (exprs -> Eval (GGColumns algebra TColumns (Eval (rep Expr))) Expr)
298+ -> (exprs -> Eval (GGColumns algebra TColumns (Eval (rep Expr))) (Col Expr))
299 -> GGAggregate algebra rep agg -> exprs -> agg
299 -> GGAggregate algebra rep agg -> exprs -> agg
300ggaggregate gfromColumns gtoColumns agg es = case algebraSing @algebra of
300ggaggregate gfromColumns gtoColumns agg es = case algebraSing @algebra of
301 SProduct -> flip f exprs $
301 SProduct -> flip f exprs $
@@ -304,7 +304,7 @@ ggaggregate gfromColumns gtoColumns agg es = case algebraSing @algebra of
304 @(TTable Aggregate)
304 @(TTable Aggregate)
305 @TColumns
305 @TColumns
306 @Id
306 @Id
307− @Aggregate
307+ @(Col Aggregate)
308 @(Eval (rep Aggregate))
308 @(Eval (rep Aggregate))
309 (const toColumns)
309 (const toColumns)
310 where
310 where
@@ -317,7 +317,7 @@ ggaggregate gfromColumns gtoColumns agg es = case algebraSing @algebra of
317 @(TTable Expr)
317 @(TTable Expr)
318 @TColumns
318 @TColumns
319 @Id
319 @Id
320− @Expr
320+ @(Col Expr)
321 @(Eval (rep Expr))
321 @(Eval (rep Expr))
322 (const fromColumns) $
322 (const fromColumns) $
323 gtoColumns es
323 gtoColumns es
@@ -327,26 +327,26 @@ ggaggregate gfromColumns gtoColumns agg es = case algebraSing @algebra of
327 @(TTable Aggregate)
327 @(TTable Aggregate)
328 @TColumns
328 @TColumns
329 @Id
329 @Id
330− @Aggregate
330+ @(Col Aggregate)
331 @(Eval (rep Aggregate))
331 @(Eval (rep Aggregate))
332 (const toColumns)
332 (const toColumns)
333− (\tag' Spec {nullity} (Aggregate a) ->
333+ (\tag' SSpec {nullity} (A (Aggregate a)) ->
334− Aggregate $ sguard (tag ==. litExpr tag') . snullify nullity <$> a)
334+ A $ Aggregate $ sguard (tag ==. litExpr tag') . snullify nullity <$> a)
335− (HIdentity (groupByExpr tag))
335+ (HType (A (groupByExpr tag)))
336 where
336 where
337 f =
337 f =
338 gfindex @Id @(Eval (rep Expr)) @agg .
338 gfindex @Id @(Eval (rep Expr)) @agg .
339 agg .
339 agg .
340 gftabulate @Id @(Eval (rep Aggregate)) @agg
340 gftabulate @Id @(Eval (rep Aggregate)) @agg
341− (HIdentity tag, exprs) =
341+ (HType (E tag), exprs) =
342 gunbuildADT
342 gunbuildADT
343 @(TTable Expr)
343 @(TTable Expr)
344 @TColumns
344 @TColumns
345 @Id
345 @Id
346− @Expr
346+ @(Col Expr)
347 @(Eval (rep Expr))
347 @(Eval (rep Expr))
348 (const fromColumns)
348 (const fromColumns)
349− (\Spec {nullity} -> case nullity of
349+ (\SSpec {nullity} -> case nullity of
350 Null -> id
350 Null -> id
351− NotNull -> unsafeUnnullify) $
351+ NotNull -> \(E a) -> E (unsafeUnnullify a)) $
352 gtoColumns es
352 gtoColumns es
src/Rel8/Generic/Construction/ADT.hs+27−20
@@ -1,7 +1,6 @@
1{-# language AllowAmbiguousTypes #-}
1{-# language AllowAmbiguousTypes #-}
2{-# language BlockArguments #-}
2{-# language BlockArguments #-}
3{-# language DataKinds #-}
3{-# language DataKinds #-}
4−{-# language FlexibleContexts #-}
5{-# language FlexibleInstances #-}
4{-# language FlexibleInstances #-}
6{-# language MultiParamTypeClasses #-}
5{-# language MultiParamTypeClasses #-}
7{-# language RankNTypes #-}
6{-# language RankNTypes #-}
@@ -50,12 +49,12 @@ import Rel8.Generic.Construction.Record
50import Rel8.Generic.Table.ADT ( GColumnsADT, GColumnsADT' )
49import Rel8.Generic.Table.ADT ( GColumnsADT, GColumnsADT' )
51import Rel8.Generic.Table.Record ( GColumns )
50import Rel8.Generic.Table.Record ( GColumns )
52import Rel8.Schema.HTable ( HTable )
51import Rel8.Schema.HTable ( HTable )
53−import Rel8.Schema.HTable.Identity ( HIdentity )
52+import Rel8.Schema.HTable.Identity ( HType )
54import Rel8.Schema.HTable.Label ( HLabel, hlabel, hunlabel )
53import Rel8.Schema.HTable.Label ( HLabel, hlabel, hunlabel )
55import Rel8.Schema.HTable.Nullify ( HNullify, hnulls, hnullify, hunnullify )
54import Rel8.Schema.HTable.Nullify ( HNullify, hnulls, hnullify, hunnullify )
56import Rel8.Schema.HTable.Product ( HProduct( HProduct ) )
55import Rel8.Schema.HTable.Product ( HProduct( HProduct ) )
57import Rel8.Schema.Null ( Nullify )
56import Rel8.Schema.Null ( Nullify )
58−import Rel8.Schema.Spec ( Spec )
57+import Rel8.Schema.Spec ( Spec( Spec ), SSpec )
59import qualified Rel8.Schema.Kind as K
58import qualified Rel8.Schema.Kind as K
60import Rel8.Type.Tag ( Tag( Tag ) )
59import Rel8.Type.Tag ( Tag( Tag ) )
61
60
@@ -63,16 +62,24 @@ import Rel8.Type.Tag ( Tag( Tag ) )
63import Data.Text ( pack )
62import Data.Text ( pack )
64
63
65
64
66−type Null :: K.Context -> Type
65+type Null :: K.HContext -> Type
67−type Null context = forall a. Spec a -> context (Nullify a)
66+type Null context = forall a. ()
67+ => SSpec ('Spec a)
68+ -> context ('Spec (Nullify a))
68
69
69
70
70−type Nullifier :: K.Context -> Type
71+type Nullifier :: K.HContext -> Type
71−type Nullifier context = forall a. Spec a -> context a -> context (Nullify a)
72+type Nullifier context = forall a. ()
73+ => SSpec ('Spec a)
74+ -> context ('Spec a)
75+ -> context ('Spec (Nullify a))
72
76
73
77
74−type Unnullifier :: K.Context -> Type
78+type Unnullifier :: K.HContext -> Type
75−type Unnullifier context = forall a. Spec a -> context (Nullify a) -> context a
79+type Unnullifier context = forall a. ()
80+ => SSpec ('Spec a)
81+ -> context ('Spec (Nullify a))
82+ -> context ('Spec a)
76
83
77
84
78type NoConstructor :: Symbol -> Symbol -> ErrorMessage
85type NoConstructor :: Symbol -> Symbol -> ErrorMessage
@@ -181,12 +188,12 @@ type GConstructableADT
181 :: (Type -> Exp Constraint)
188 :: (Type -> Exp Constraint)
182 -> (Type -> Exp K.HTable)
189 -> (Type -> Exp K.HTable)
183 -> (Type -> Exp Type)
190 -> (Type -> Exp Type)
184− -> K.Context -> (Type -> Type) -> Constraint
191+ -> K.HContext -> (Type -> Type) -> Constraint
185class GConstructableADT _Table _Columns f context rep where
192class GConstructableADT _Table _Columns f context rep where
186 gbuildADT :: ()
193 gbuildADT :: ()
187 => ToColumns _Table _Columns f context
194 => ToColumns _Table _Columns f context
188 -> (Tag -> Nullifier context)
195 -> (Tag -> Nullifier context)
189− -> HIdentity Tag context
196+ -> HType Tag context
190 -> GFieldsADT f rep
197 -> GFieldsADT f rep
191 -> GColumnsADT _Columns rep context
198 -> GColumnsADT _Columns rep context
192
199
@@ -194,13 +201,13 @@ class GConstructableADT _Table _Columns f context rep where
194 => FromColumns _Table _Columns f context
201 => FromColumns _Table _Columns f context
195 -> Unnullifier context
202 -> Unnullifier context
196 -> GColumnsADT _Columns rep context
203 -> GColumnsADT _Columns rep context
197− -> (HIdentity Tag context, GFieldsADT f rep)
204+ -> (HType Tag context, GFieldsADT f rep)
198
205
199 gconstructADT :: ()
206 gconstructADT :: ()
200 => ToColumns _Table _Columns f context
207 => ToColumns _Table _Columns f context
201 -> Null context
208 -> Null context
202 -> Nullifier context
209 -> Nullifier context
203− -> (Tag -> HIdentity Tag context)
210+ -> (Tag -> HType Tag context)
204 -> GConstructors f rep (GColumnsADT _Columns rep context)
211 -> GConstructors f rep (GColumnsADT _Columns rep context)
205
212
206 gdeconstructADT :: ()
213 gdeconstructADT :: ()
@@ -208,11 +215,11 @@ class GConstructableADT _Table _Columns f context rep where
208 -> Unnullifier context
215 -> Unnullifier context
209 -> GConstructors f rep r
216 -> GConstructors f rep r
210 -> GColumnsADT _Columns rep context
217 -> GColumnsADT _Columns rep context
211− -> (HIdentity Tag context, NonEmpty (Tag, r))
218+ -> (HType Tag context, NonEmpty (Tag, r))
212
219
213
220
214instance
221instance
215− ( htable ~ HLabel "tag" (HIdentity Tag)
222+ ( htable ~ HLabel "tag" (HType Tag)
216 , GConstructableADT' _Table _Columns f context htable rep
223 , GConstructableADT' _Table _Columns f context htable rep
217 )
224 )
218 => GConstructableADT _Table _Columns f context (M1 D meta rep)
225 => GConstructableADT _Table _Columns f context (M1 D meta rep)
@@ -238,7 +245,7 @@ type GConstructableADT'
238 :: (Type -> Exp Constraint)
245 :: (Type -> Exp Constraint)
239 -> (Type -> Exp K.HTable)
246 -> (Type -> Exp K.HTable)
240 -> (Type -> Exp Type)
247 -> (Type -> Exp Type)
241− -> K.Context -> K.HTable -> (Type -> Type) -> Constraint
248+ -> K.HContext -> K.HTable -> (Type -> Type) -> Constraint
242class GConstructableADT' _Table _Columns f context htable rep where
249class GConstructableADT' _Table _Columns f context htable rep where
243 gbuildADT' :: ()
250 gbuildADT' :: ()
244 => ToColumns _Table _Columns f context
251 => ToColumns _Table _Columns f context
@@ -376,19 +383,19 @@ type GMakeableADT
376 :: (Type -> Exp Constraint)
383 :: (Type -> Exp Constraint)
377 -> (Type -> Exp K.HTable)
384 -> (Type -> Exp K.HTable)
378 -> (Type -> Exp Type)
385 -> (Type -> Exp Type)
379− -> K.Context -> Symbol -> (Type -> Type) -> Constraint
386+ -> K.HContext -> Symbol -> (Type -> Type) -> Constraint
380class GMakeableADT _Table _Columns f context name rep where
387class GMakeableADT _Table _Columns f context name rep where
381 gmakeADT :: ()
388 gmakeADT :: ()
382 => ToColumns _Table _Columns f context
389 => ToColumns _Table _Columns f context
383 -> Null context
390 -> Null context
384 -> Nullifier context
391 -> Nullifier context
385− -> (Tag -> HIdentity Tag context)
392+ -> (Tag -> HType Tag context)
386 -> GFields f (GConstructorADT name rep)
393 -> GFields f (GConstructorADT name rep)
387 -> GColumnsADT _Columns rep context
394 -> GColumnsADT _Columns rep context
388
395
389
396
390instance
397instance
391− ( htable ~ HLabel "tag" (HIdentity Tag)
398+ ( htable ~ HLabel "tag" (HType Tag)
392 , meta ~ 'MetaData datatype _module _package _newtype
399 , meta ~ 'MetaData datatype _module _package _newtype
393 , fallback ~ TypeError (NoConstructor datatype name)
400 , fallback ~ TypeError (NoConstructor datatype name)
394 , fields ~ GFields f (GConstructorADT' name rep fallback)
401 , fields ~ GFields f (GConstructorADT' name rep fallback)
@@ -410,7 +417,7 @@ type GMakeableADT'
410 :: (Type -> Exp Constraint)
417 :: (Type -> Exp Constraint)
411 -> (Type -> Exp K.HTable)
418 -> (Type -> Exp K.HTable)
412 -> (Type -> Exp Type)
419 -> (Type -> Exp Type)
413− -> K.Context -> K.HTable -> Symbol -> (Type -> Type) -> Type -> Constraint
420+ -> K.HContext -> K.HTable -> Symbol -> (Type -> Type) -> Type -> Constraint
414class GMakeableADT' _Table _Columns f context htable name rep fields where
421class GMakeableADT' _Table _Columns f context htable name rep fields where
415 gmakeADT' :: ()
422 gmakeADT' :: ()
416 => ToColumns _Table _Columns f context
423 => ToColumns _Table _Columns f context
src/Rel8/Generic/Construction/Record.hs+3−3
@@ -43,7 +43,7 @@ type FromColumns
43 :: (Type -> Exp Constraint)
43 :: (Type -> Exp Constraint)
44 -> (Type -> Exp K.HTable)
44 -> (Type -> Exp K.HTable)
45 -> (Type -> Exp Type)
45 -> (Type -> Exp Type)
46− -> K.Context
46+ -> K.HContext
47 -> Type
47 -> Type
48type FromColumns _Table _Columns f context = forall proxy x.
48type FromColumns _Table _Columns f context = forall proxy x.
49 Eval (_Table x) => proxy x -> Eval (_Columns x) context -> Eval (f x)
49 Eval (_Table x) => proxy x -> Eval (_Columns x) context -> Eval (f x)
@@ -53,7 +53,7 @@ type ToColumns
53 :: (Type -> Exp Constraint)
53 :: (Type -> Exp Constraint)
54 -> (Type -> Exp K.HTable)
54 -> (Type -> Exp K.HTable)
55 -> (Type -> Exp Type)
55 -> (Type -> Exp Type)
56− -> K.Context
56+ -> K.HContext
57 -> Type
57 -> Type
58type ToColumns _Table _Columns f context = forall proxy x.
58type ToColumns _Table _Columns f context = forall proxy x.
59 Eval (_Table x) => proxy x -> Eval (f x) -> Eval (_Columns x) context
59 Eval (_Table x) => proxy x -> Eval (f x) -> Eval (_Columns x) context
@@ -117,7 +117,7 @@ type GConstructable
117 :: (Type -> Exp Constraint)
117 :: (Type -> Exp Constraint)
118 -> (Type -> Exp K.HTable)
118 -> (Type -> Exp K.HTable)
119 -> (Type -> Exp Type)
119 -> (Type -> Exp Type)
120− -> K.Context -> (Type -> Type) -> Constraint
120+ -> K.HContext -> (Type -> Type) -> Constraint
121class GConstructable _Table _Columns f context rep where
121class GConstructable _Table _Columns f context rep where
122 gconstruct :: ()
122 gconstruct :: ()
123 => ToColumns _Table _Columns f context
123 => ToColumns _Table _Columns f context
src/Rel8/Generic/Map.hs−20
@@ -2,11 +2,9 @@
2{-# language StandaloneKindSignatures #-}
2{-# language StandaloneKindSignatures #-}
3{-# language TypeFamilies #-}
3{-# language TypeFamilies #-}
4{-# language TypeOperators #-}
4{-# language TypeOperators #-}
5−{-# language UndecidableInstances #-}
6
5
7module Rel8.Generic.Map
6module Rel8.Generic.Map
8 ( GMap
7 ( GMap
9− , Map
10 )
8 )
11where
9where
12
10
@@ -29,21 +27,3 @@ type family GMap f rep where
29 GMap _ U1 = U1
27 GMap _ U1 = U1
30 GMap f (rep1 :*: rep2) = GMap f rep1 :*: GMap f rep2
28 GMap f (rep1 :*: rep2) = GMap f rep1 :*: GMap f rep2
31 GMap f (K1 i a) = K1 i (Eval (f a))
29 GMap f (K1 i a) = K1 i (Eval (f a))
32−
33−
34−-- | Map a @Type -> Type@ function over the @Type@-kinded type variables in
35−-- of a type constructor.
36−type Map :: (Type -> Exp Type) -> Type -> Type
37−type family Map f a where
38− Map p (t a b c d e f g) =
39− t (Eval (p a)) (Eval (p b)) (Eval (p c)) (Eval (p d)) (Eval (p e))
40− (Eval (p f)) (Eval (p g))
41− Map p (t a b c d e f) =
42− t (Eval (p a)) (Eval (p b)) (Eval (p c)) (Eval (p d)) (Eval (p e))
43− (Eval (p f))
44− Map p (t a b c d e) =
45− t (Eval (p a)) (Eval (p b)) (Eval (p c)) (Eval (p d)) (Eval (p e))
46− Map p (t a b c d) = t (Eval (p a)) (Eval (p b)) (Eval (p c)) (Eval (p d))
47− Map p (t a b c) = t (Eval (p a)) (Eval (p b)) (Eval (p c))
48− Map p (t a b) = t (Eval (p a)) (Eval (p b))
49− Map p (t a) = t (Eval (p a))
src/Rel8/Generic/Record.hs−2
@@ -1,6 +1,5 @@
1{-# language AllowAmbiguousTypes #-}
1{-# language AllowAmbiguousTypes #-}
2{-# language DataKinds #-}
2{-# language DataKinds #-}
3−{-# language FlexibleContexts #-}
4{-# language FlexibleInstances #-}
3{-# language FlexibleInstances #-}
5{-# language MultiParamTypeClasses #-}
4{-# language MultiParamTypeClasses #-}
6{-# language PolyKinds #-}
5{-# language PolyKinds #-}
@@ -142,7 +141,6 @@ instance {-# OVERLAPPABLE #-} Snd (Count n rep) ~ rep => Countable n rep where
142 uncount = id
141 uncount = id
143
142
144
143
145−type Record :: Type -> Type
146newtype Record a = Record
144newtype Record a = Record
147 { unrecord :: a
145 { unrecord :: a
148 }
146 }
src/Rel8/Generic/Rel8able.hs+72−157
@@ -3,16 +3,11 @@
3{-# language DataKinds #-}
3{-# language DataKinds #-}
4{-# language DefaultSignatures #-}
4{-# language DefaultSignatures #-}
5{-# language FlexibleContexts #-}
5{-# language FlexibleContexts #-}
6−{-# language FlexibleInstances #-}
7{-# language LambdaCase #-}
6{-# language LambdaCase #-}
8−{-# language MultiParamTypeClasses #-}
9−{-# language PolyKinds #-}
10−{-# language QuantifiedConstraints #-}
11{-# language ScopedTypeVariables #-}
7{-# language ScopedTypeVariables #-}
12{-# language StandaloneKindSignatures #-}
8{-# language StandaloneKindSignatures #-}
13{-# language TypeApplications #-}
9{-# language TypeApplications #-}
14−{-# language TypeFamilyDependencies #-}
10+{-# language TypeFamilies #-}
15−{-# language TypeOperators #-}
16{-# language UndecidableInstances #-}
11{-# language UndecidableInstances #-}
17
12
18module Rel8.Generic.Rel8able
13module Rel8.Generic.Rel8able
@@ -21,38 +16,32 @@ module Rel8.Generic.Rel8able
21 , GRep
16 , GRep
22 , GColumns, gfromColumns, gtoColumns
17 , GColumns, gfromColumns, gtoColumns
23 , GFromExprs, gfromResult, gtoResult
18 , GFromExprs, gfromResult, gtoResult
24− , TSerialize, serialize, deserialize
25 )
19 )
26where
20where
27
21
28-- base
22-- base
29−import Data.Functor.Identity ( Identity )
30import Data.Kind ( Constraint, Type )
23import Data.Kind ( Constraint, Type )
31−import Data.Type.Bool ( type (&&) )
32import GHC.Generics ( Generic, Rep, from, to )
24import GHC.Generics ( Generic, Rep, from, to )
33import Prelude
25import Prelude
34
26
35-- rel8
27-- rel8
36import Rel8.Aggregate ( Aggregate )
28import Rel8.Aggregate ( Aggregate )
37import Rel8.Expr ( Expr )
29import Rel8.Expr ( Expr )
38−import Rel8.FCF ( Exp, Eval )
30+import Rel8.Generic.Map ( GMap )
39import Rel8.Generic.Record ( Record(..) )
31import Rel8.Generic.Record ( Record(..) )
40import Rel8.Generic.Table ( GAlgebra )
32import Rel8.Generic.Table ( GAlgebra )
41import qualified Rel8.Generic.Table.Record as G
33import qualified Rel8.Generic.Table.Record as G
42import qualified Rel8.Kind.Algebra as K ( Algebra(..) )
34import qualified Rel8.Kind.Algebra as K ( Algebra(..) )
43−import Rel8.Kind.Context ( SContext(..) )
35+import Rel8.Schema.Context ( Col )
44−import Rel8.Schema.Field ( Field )
36+import Rel8.Schema.Context.Virtual ( Abstract(..) )
45import Rel8.Schema.HTable ( HTable )
37import Rel8.Schema.HTable ( HTable )
46import qualified Rel8.Schema.Kind as K
38import qualified Rel8.Schema.Kind as K
47import Rel8.Schema.Name ( Name )
39import Rel8.Schema.Name ( Name )
48import Rel8.Schema.Result ( Result )
40import Rel8.Schema.Result ( Result )
49import Rel8.Table
41import Rel8.Table
50− ( Table, Columns, Context, fromColumns, toColumns
51− , FromExprs, fromResult, toResult
42+ ( fromColumns, toColumns, fromResult, toResult
52− , Transpose
53− , TTable, TColumns
43+ , TTable, TColumns, TFromExprs
54 )
44 )
55−import Rel8.Table.Transpose ( Transposes )
56
45
57
46
58-- | The kind of 'Rel8able' types
47-- | The kind of 'Rel8able' types
@@ -60,59 +49,6 @@ type KRel8able :: Type
60type KRel8able = K.Rel8able
49type KRel8able = K.Rel8able
61
50
62
51
63−-- This is almost 'Data.Type.Equality.==', but we add an extra case.
64−type (==) :: k -> k -> Bool
65−type family a == b where
66− -- This extra case is needed to solve the equation "a == a" (where a is a
67− -- KRel8able), which occurs when we have polymorphic Rel8ables
68− -- (e.g., newtype T t f = T { x :: t a })
69− (a :: KRel8able) == (a :: KRel8able) = 'True
70−
71− -- This extra case is needed to solve the equation "a == Identity a",
72− -- which occurs when we have polymorphic Rel8ables
73− -- (e.g., newtype T a f = T { x :: Column f a })
74− a == Identity a = 'False
75−
76− -- These cases are exactly the same as those in 'Data.Type.Equality.==.
77− f a == g b = f == g && a == b
78− a == a = 'True
79− _ == _ = 'False
80−
81−
82−type Serialize :: Bool -> Type -> Type -> Constraint
83−class transposition ~ (a == Transpose Result expr) =>
84− Serialize transposition expr a
85− where
86− serialize :: a -> Columns expr Result
87− deserialize :: Columns expr Result -> a
88−
89−
90−instance
91− ( (a == Transpose Result expr) ~ 'True
92− , Transposes Expr Result expr a
93− )
94− => Serialize 'True expr a
95− where
96− serialize = toColumns
97− deserialize = fromColumns
98−
99−
100−instance
101− ( (a == Transpose Result expr) ~ 'False
102− , Table (Context expr) expr
103− , FromExprs expr ~ a
104− )
105− => Serialize 'False expr a
106− where
107− serialize = toResult @_ @expr
108− deserialize = fromResult @_ @expr
109−
110−
111−data TSerialize :: Type -> Type -> Exp Constraint
112−type instance Eval (TSerialize expr a) =
113− Serialize (a == Transpose Result expr) expr a
114−
115−
116-- | This type class allows you to define custom 'Table's using higher-kinded
52-- | This type class allows you to define custom 'Table's using higher-kinded
117-- data types. Higher-kinded data types are data types of the pattern:
53-- data types. Higher-kinded data types are data types of the pattern:
118--
54--
@@ -146,7 +82,7 @@ type instance Eval (TSerialize expr a) =
146-- [Supplying @Rel8able@ instances]
82-- [Supplying @Rel8able@ instances]
147--
83--
148-- This type class should be derived generically for all table types in your
84-- This type class should be derived generically for all table types in your
149−-- project. To do this, enable the @DeriveAnyClass@ and @DeriveGeneric@ language
85+-- project. To do this, enable the @DeriveAnyType@ and @DeriveGeneric@ language
150-- extensions:
86-- extensions:
151--
87--
152-- @
88-- @
@@ -160,52 +96,72 @@ class HTable (GColumns t) => Rel8able t where
160 type GColumns t :: K.HTable
96 type GColumns t :: K.HTable
161 type GFromExprs t :: Type
97 type GFromExprs t :: Type
162
98
163− gfromColumns :: SContext context -> GColumns t context -> t context
99+ gfromColumns :: Abstract context -> GColumns t (Col context) -> t context
164− gtoColumns :: SContext context -> t context -> GColumns t context
100+ gtoColumns :: Abstract context -> t context -> GColumns t (Col context)
165
101
166− gfromResult :: GColumns t Result -> GFromExprs t
102+ gfromResult :: GColumns t (Col Result) -> GFromExprs t
167− gtoResult :: GFromExprs t -> GColumns t Result
103+ gtoResult :: GFromExprs t -> GColumns t (Col Result)
168
104
169 type GColumns t = G.GColumns TColumns (GRep t Expr)
105 type GColumns t = G.GColumns TColumns (GRep t Expr)
170 type GFromExprs t = t Result
106 type GFromExprs t = t Result
171
107
172 default gfromColumns :: forall context.
108 default gfromColumns :: forall context.
173− ( SRel8able t Aggregate
109+ ( VRel8able t Aggregate
174− , SRel8able t Expr
110+ , VRel8able t Expr
175− , forall table. SRel8able t (Field table)
111+ , VRel8able t Name
176− , SRel8able t Name
177− , SSerialize t
178 )
112 )
179− => SContext context -> GColumns t context -> t context
113+ => Abstract context -> GColumns t (Col context) -> t context
180 gfromColumns = \case
114 gfromColumns = \case
181− SAggregate -> sfromColumns
115+ VAggregate -> vfromColumns
182− SExpr -> sfromColumns
116+ VExpr -> vfromColumns
183− SField -> sfromColumns
117+ VName -> vfromColumns
184− SName -> sfromColumns
185− SResult -> sfromResult
186
118
187 default gtoColumns :: forall context.
119 default gtoColumns :: forall context.
188− ( SRel8able t Aggregate
120+ ( VRel8able t Aggregate
189− , SRel8able t Expr
121+ , VRel8able t Expr
190− , forall table. SRel8able t (Field table)
122+ , VRel8able t Name
191− , SRel8able t Name
192− , SSerialize t
193 )
123 )
194− => SContext context -> t context -> GColumns t context
124+ => Abstract context -> t context -> GColumns t (Col context)
195 gtoColumns = \case
125 gtoColumns = \case
196− SAggregate -> stoColumns
126+ VAggregate -> vtoColumns
197− SExpr -> stoColumns
127+ VExpr -> vtoColumns
198− SField -> stoColumns
128+ VName -> vtoColumns
199− SName -> stoColumns
129+
200− SResult -> stoResult
130+ default gfromResult ::
201−
131+ ( Generic (Record (t Result))
132+ , G.GTable (TTable Expr) TColumns TFromExprs (GRep t Expr)
133+ , G.GColumns TColumns (GRep t Expr) ~ GColumns t
134+ , Rep (Record (t Result)) ~ GMap TFromExprs (GRep t Expr)
202− default gfromResult :: (SSerialize t, GFromExprs t ~ t Result)
135+ , GFromExprs t ~ t Result
136+ )
203− => GColumns t Result -> GFromExprs t
137+ => GColumns t (Col Result) -> GFromExprs t
204− gfromResult = sfromResult
138+ gfromResult =
205−
139+ unrecord .
140+ to .
141+ G.gfromResult
142+ @(TTable Expr)
143+ @TColumns
144+ @TFromExprs
145+ @(GRep t Expr)
146+ (\(_ :: proxy x) -> fromResult @Expr @x)
147+
148+ default gtoResult ::
149+ ( Generic (Record (t Result))
150+ , G.GTable (TTable Expr) TColumns TFromExprs (GRep t Expr)
151+ , G.GColumns TColumns (GRep t Expr) ~ GColumns t
152+ , Rep (Record (t Result)) ~ GMap TFromExprs (GRep t Expr)
206− default gtoResult :: (SSerialize t, GFromExprs t ~ t Result)
153+ , GFromExprs t ~ t Result
154+ )
207− => GFromExprs t -> GColumns t Result
155+ => GFromExprs t -> GColumns t (Col Result)
208− gtoResult = stoResult
156+ gtoResult =
157+ G.gtoResult
158+ @(TTable Expr)
159+ @TColumns
160+ @TFromExprs
161+ @(GRep t Expr)
162+ (\(_ :: proxy x) -> toResult @Expr @x) .
163+ from .
164+ Record
209
165
210
166
211type Algebra :: K.Rel8able -> K.Algebra
167type Algebra :: K.Rel8able -> K.Algebra
@@ -216,66 +172,25 @@ type GRep :: K.Rel8able -> K.Context -> Type -> Type
216type GRep t context = Rep (Record (t context))
172type GRep t context = Rep (Record (t context))
217
173
218
174
219−type SRel8able :: K.Rel8able -> K.Context -> Constraint
175+type VRel8able :: K.Rel8able -> K.Context -> Constraint
220−class
176+type VRel8able t context =
221− ( Generic (Record (t context))
222− , G.GTable (TTable context) TColumns (GRep t context)
223− , G.GColumns TColumns (GRep t context) ~ GColumns t
224− )
225− => SRel8able t context
226−instance
227 ( Generic (Record (t context))
177 ( Generic (Record (t context))
228− , G.GTable (TTable context) TColumns (GRep t context)
178+ , G.GTable (TTable context) TColumns TFromExprs (GRep t context)
229 , G.GColumns TColumns (GRep t context) ~ GColumns t
179 , G.GColumns TColumns (GRep t context) ~ GColumns t
230 )
180 )
231− => SRel8able t context
232−
233−
234−type SSerialize :: K.Rel8able -> Constraint
235−type SSerialize t =
236− ( Generic (Record (t Result))
237− , G.GSerialize TSerialize TColumns (GRep t Expr) (GRep t Result)
238− , G.GColumns TColumns (GRep t Expr) ~ GColumns t
239− )
240−
241−
242−sfromColumns :: forall t context. SRel8able t context
243− => GColumns t context -> t context
244−sfromColumns =
245− unrecord .
246− to .
247− G.gfromColumns @(TTable context) @TColumns fromColumns
248−
249−
250−stoColumns :: forall t context. SRel8able t context
251− => t context -> GColumns t context
252−stoColumns =
253− G.gtoColumns @(TTable context) @TColumns toColumns .
254− from .
255− Record
256
181
257
182
258−sfromResult :: forall t. SSerialize t
183+vfromColumns :: forall t context. VRel8able t context
259− => GColumns t Result -> t Result
184+ => GColumns t (Col context) -> t context
260−sfromResult =
185+vfromColumns =
261 unrecord .
186 unrecord .
262 to .
187 to .
263− G.gfromResult
188+ G.gfromColumns @(TTable context) @TColumns @TFromExprs fromColumns
264− @TSerialize
265− @TColumns
266− @(GRep t Expr)
267− @(GRep t Result)
268− (\(_ :: proxy x) -> deserialize @_ @x)
269
189
270
190
271−stoResult :: forall t. SSerialize t
191+vtoColumns :: forall t context. VRel8able t context
272− => t Result -> GColumns t Result
192+ => t context -> GColumns t (Col context)
273−stoResult =
193+vtoColumns =
274− G.gtoResult
194+ G.gtoColumns @(TTable context) @TColumns @TFromExprs toColumns .
275− @TSerialize
276− @TColumns
277− @(GRep t Expr)
278− @(GRep t Result)
279− (\(_ :: proxy x) -> serialize @_ @x) .
280 from .
195 from .
281 Record
196 Record
src/Rel8/Generic/Table.hs+28−26
@@ -12,7 +12,7 @@
12{-# language UndecidableInstances #-}
12{-# language UndecidableInstances #-}
13
13
14module Rel8.Generic.Table
14module Rel8.Generic.Table
15− ( GGSerialize, GGColumns, ggfromResult, ggtoResult
15+ ( GGTable, GGColumns, ggfromResult, ggtoResult
16 , GAlgebra
16 , GAlgebra
17 )
17 )
18where
18where
@@ -24,34 +24,36 @@ import Prelude ()
24
24
25-- rel8
25-- rel8
26import Rel8.FCF ( Eval, Exp )
26import Rel8.FCF ( Eval, Exp )
27+import Rel8.Generic.Map ( GMap )
27import Rel8.Generic.Table.ADT
28import Rel8.Generic.Table.ADT
28− ( GSerializeADT, GColumnsADT, gtoResultADT, gfromResultADT
29+ ( GTableADT, GColumnsADT, gtoResultADT, gfromResultADT
29 )
30 )
30−import Rel8.Generic.Table.Record ( GSerialize, GColumns, gtoResult, gfromResult )
31+import Rel8.Generic.Table.Record ( GTable, GColumns, gtoResult, gfromResult )
31import Rel8.Kind.Algebra
32import Rel8.Kind.Algebra
32 ( Algebra( Product, Sum )
33 ( Algebra( Product, Sum )
33 , SAlgebra( SProduct, SSum )
34 , SAlgebra( SProduct, SSum )
34 , KnownAlgebra, algebraSing
35 , KnownAlgebra, algebraSing
35 )
36 )
37+import Rel8.Schema.Context ( Col )
36import qualified Rel8.Schema.Kind as K
38import qualified Rel8.Schema.Kind as K
37import Rel8.Schema.Result ( Result )
39import Rel8.Schema.Result ( Result )
38
40
39
41
40−data GGSerialize
42+data GGTable
41 :: Algebra
43 :: Algebra
42− -> (Type -> Type -> Exp Constraint)
44+ -> (Type -> Exp Constraint)
43 -> (Type -> Exp K.HTable)
45 -> (Type -> Exp K.HTable)
44− -> (Type -> Type)
46+ -> (Type -> Exp Type)
45 -> (Type -> Type)
47 -> (Type -> Type)
46 -> Exp Constraint
48 -> Exp Constraint
47
49
48
50
49−type instance Eval (GGSerialize 'Product _Serialize _Columns exprs rep) =
51+type instance Eval (GGTable 'Product _Table _Columns _FromExprs rep) =
50− GSerialize _Serialize _Columns exprs rep
52+ GTable _Table _Columns _FromExprs rep
51
53
52
54
53−type instance Eval (GGSerialize 'Sum _Serialize _Columns exprs rep) =
55+type instance Eval (GGTable 'Sum _Table _Columns _FromExprs rep) =
54− GSerializeADT _Serialize _Columns exprs rep
56+ GTableADT _Table _Columns _FromExprs rep
55
57
56
58
57data GGColumns
59data GGColumns
@@ -77,27 +79,27 @@ type family GAlgebra rep where
77 GAlgebra (K1 _ _) = 'Product
79 GAlgebra (K1 _ _) = 'Product
78
80
79
81
80−ggfromResult :: forall algebra _Serialize _Columns exprs rep x.
82+ggfromResult :: forall algebra _Table _Columns _FromExprs rep x.
81 ( KnownAlgebra algebra
83 ( KnownAlgebra algebra
82− , Eval (GGSerialize algebra _Serialize _Columns exprs rep)
84+ , Eval (GGTable algebra _Table _Columns _FromExprs rep)
83 )
85 )
84− => (forall expr a proxy. Eval (_Serialize expr a)
86+ => (forall a proxy. Eval (_Table a)
85− => proxy expr -> Eval (_Columns expr) Result -> a)
87+ => proxy a -> Eval (_Columns a) (Col Result) -> Eval (_FromExprs a))
86− -> Eval (GGColumns algebra _Columns exprs) Result
88+ -> Eval (GGColumns algebra _Columns rep) (Col Result)
87− -> rep x
89+ -> GMap _FromExprs rep x
88ggfromResult f x = case algebraSing @algebra of
90ggfromResult f x = case algebraSing @algebra of
89− SProduct -> gfromResult @_Serialize @_Columns @exprs @rep f x
91+ SProduct -> gfromResult @_Table @_Columns @_FromExprs @rep f x
90− SSum -> gfromResultADT @_Serialize @_Columns @exprs @rep f x
92+ SSum -> gfromResultADT @_Table @_Columns @_FromExprs @rep f x
91
93
92
94
93−ggtoResult :: forall algebra _Serialize _Columns exprs rep x.
95+ggtoResult :: forall algebra _Table _Columns _FromExprs rep x.
94 ( KnownAlgebra algebra
96 ( KnownAlgebra algebra
95− , Eval (GGSerialize algebra _Serialize _Columns exprs rep)
97+ , Eval (GGTable algebra _Table _Columns _FromExprs rep)
96 )
98 )
97− => (forall expr a proxy. Eval (_Serialize expr a)
99+ => (forall a proxy. Eval (_Table a)
98− => proxy expr -> a -> Eval (_Columns expr) Result)
100+ => proxy a -> Eval (_FromExprs a) -> Eval (_Columns a) (Col Result))
99− -> rep x
101+ -> GMap _FromExprs rep x
100− -> Eval (GGColumns algebra _Columns exprs) Result
102+ -> Eval (GGColumns algebra _Columns rep) (Col Result)
101ggtoResult f x = case algebraSing @algebra of
103ggtoResult f x = case algebraSing @algebra of
102− SProduct -> gtoResult @_Serialize @_Columns @exprs @rep f x
104+ SProduct -> gtoResult @_Table @_Columns @_FromExprs @rep f x
103− SSum -> gtoResultADT @_Serialize @_Columns @exprs @rep f x
105+ SSum -> gtoResultADT @_Table @_Columns @_FromExprs @rep f x
src/Rel8/Generic/Table/ADT.hs+76−70
@@ -1,6 +1,5 @@
1{-# language AllowAmbiguousTypes #-}
1{-# language AllowAmbiguousTypes #-}
2{-# language DataKinds #-}
2{-# language DataKinds #-}
3−{-# language FlexibleContexts #-}
4{-# language FlexibleInstances #-}
3{-# language FlexibleInstances #-}
5{-# language LambdaCase #-}
4{-# language LambdaCase #-}
6{-# language MultiParamTypeClasses #-}
5{-# language MultiParamTypeClasses #-}
@@ -13,13 +12,12 @@
13{-# language UndecidableInstances #-}
12{-# language UndecidableInstances #-}
14
13
15module Rel8.Generic.Table.ADT
14module Rel8.Generic.Table.ADT
16− ( GSerializeADT, GColumnsADT, gfromResultADT, gtoResultADT
15+ ( GTableADT, GColumnsADT, gfromResultADT, gtoResultADT
17− , GSerializeADT', GColumnsADT'
16+ , GTableADT', GColumnsADT'
18 )
17 )
19where
18where
20
19
21-- base
20-- base
22−import Data.Functor.Identity ( Identity( Identity ) )
23import Data.Kind ( Constraint, Type )
21import Data.Kind ( Constraint, Type )
24import Data.Proxy ( Proxy( Proxy ) )
22import Data.Proxy ( Proxy( Proxy ) )
25import GHC.Generics
23import GHC.Generics
@@ -32,14 +30,18 @@ import Prelude hiding ( null )
32
30
33-- rel8
31-- rel8
34import Rel8.FCF ( Eval, Exp )
32import Rel8.FCF ( Eval, Exp )
33+import Rel8.Generic.Map ( GMap )
35−import Rel8.Generic.Table.Record ( GSerialize, GColumns, gfromResult, gtoResult )
34+import Rel8.Generic.Table.Record ( GTable, GColumns, gfromResult, gtoResult )
36import Rel8.Schema.HTable ( HTable )
35import Rel8.Schema.HTable ( HTable )
37−import Rel8.Schema.HTable.Identity ( HIdentity( HIdentity ) )
36+import Rel8.Schema.HTable.Identity ( HIdentity( HType ), HType )
38import Rel8.Schema.HTable.Label ( HLabel, hlabel, hunlabel )
37import Rel8.Schema.HTable.Label ( HLabel, hlabel, hunlabel )
39import Rel8.Schema.HTable.Nullify ( HNullify, hnulls, hnullify, hunnullify )
38import Rel8.Schema.HTable.Nullify ( HNullify, hnulls, hnullify, hunnullify )
40import Rel8.Schema.HTable.Product ( HProduct( HProduct ) )
39import Rel8.Schema.HTable.Product ( HProduct( HProduct ) )
41import qualified Rel8.Schema.Kind as K
40import qualified Rel8.Schema.Kind as K
41+import Rel8.Schema.Result
42+ ( Col( R ), Result
42−import Rel8.Schema.Result ( Result, null, nullifier, unnullifier )
43+ , null, nullifier, unnullifier
44+ )
43import Rel8.Type.Tag ( Tag( Tag ) )
45import Rel8.Type.Tag ( Tag( Tag ) )
44
46
45-- text
47-- text
@@ -51,7 +53,7 @@ type GColumnsADT
51 -> (Type -> Type) -> K.HTable
53 -> (Type -> Type) -> K.HTable
52type family GColumnsADT _Columns rep where
54type family GColumnsADT _Columns rep where
53 GColumnsADT _Columns (M1 D _ rep) =
55 GColumnsADT _Columns (M1 D _ rep) =
54− GColumnsADT' _Columns (HLabel "tag" (HIdentity Tag)) rep
56+ GColumnsADT' _Columns (HLabel "tag" (HType Tag)) rep
55
57
56
58
57type GColumnsADT'
59type GColumnsADT'
@@ -65,118 +67,122 @@ type family GColumnsADT' _Columns htable rep where
65 HProduct htable (HLabel label (HNullify (GColumns _Columns rep)))
67 HProduct htable (HLabel label (HNullify (GColumns _Columns rep)))
66
68
67
69
68−type GSerializeADT
70+type GTableADT
69− :: (Type -> Type -> Exp Constraint)
71+ :: (Type -> Exp Constraint)
70 -> (Type -> Exp K.HTable)
72 -> (Type -> Exp K.HTable)
73+ -> (Type -> Exp Type)
71− -> (Type -> Type) -> (Type -> Type) -> Constraint
74+ -> (Type -> Type) -> Constraint
72−class GSerializeADT _Serialize _Columns exprs rep where
75+class GTableADT _Table _Columns _FromExprs rep where
73 gfromResultADT :: ()
76 gfromResultADT :: ()
74− => (forall expr a proxy. Eval (_Serialize expr a)
77+ => (forall a proxy. Eval (_Table a)
75− => proxy expr -> Eval (_Columns expr) Result -> a)
78+ => proxy a -> Eval (_Columns a) (Col Result) -> Eval (_FromExprs a))
76− -> GColumnsADT _Columns exprs Result
79+ -> GColumnsADT _Columns rep (Col Result)
77− -> rep x
80+ -> GMap _FromExprs rep x
78
81
79 gtoResultADT :: ()
82 gtoResultADT :: ()
80− => (forall expr a proxy. Eval (_Serialize expr a)
83+ => (forall a proxy. Eval (_Table a)
81− => proxy expr -> a -> Eval (_Columns expr) Result)
84+ => proxy a -> Eval (_FromExprs a) -> Eval (_Columns a) (Col Result))
82− -> rep x
85+ -> GMap _FromExprs rep x
83− -> GColumnsADT _Columns exprs Result
86+ -> GColumnsADT _Columns rep (Col Result)
84
87
85
88
86instance
89instance
87− ( htable ~ HLabel "tag" (HIdentity Tag)
90+ ( htable ~ HLabel "tag" (HType Tag)
88− , GSerializeADT' _Serialize _Columns htable exprs rep
91+ , Eval (_Table (htable context))
92+ , Eval (_Columns (htable context)) ~ htable
93+ , GTableADT' _Table _Columns _FromExprs htable rep
89 )
94 )
90− => GSerializeADT _Serialize _Columns (M1 D meta exprs) (M1 D meta rep)
95+ => GTableADT _Table _Columns _FromExprs (M1 D meta rep)
91 where
96 where
92 gfromResultADT fromResult columns =
97 gfromResultADT fromResult columns =
93− case gfromResultADT' @_Serialize @_Columns @htable @exprs @rep fromResult tag columns of
98+ case gfromResultADT' @_Table @_Columns @_FromExprs @htable @rep fromResult tag columns of
94 Just rep -> M1 rep
99 Just rep -> M1 rep
95 _ -> error "ADT.fromColumns: mismatch between tag and data"
100 _ -> error "ADT.fromColumns: mismatch between tag and data"
96 where
101 where
97− tag = (\(HIdentity (Identity a)) -> a) . hunlabel @"tag"
102+ tag = (\(HType (R a)) -> a) . hunlabel @"tag"
98
103
99 gtoResultADT toResult (M1 rep) =
104 gtoResultADT toResult (M1 rep) =
100− gtoResultADT' @_Serialize @_Columns @htable @exprs @rep toResult tag (Just rep)
105+ gtoResultADT' @_Table @_Columns @_FromExprs @htable @rep toResult tag (Just rep)
101 where
106 where
102− tag = hlabel @"tag" . HIdentity . Identity
107+ tag = hlabel @"tag" . HType . R
103
108
104
109
105−type GSerializeADT'
110+type GTableADT'
106− :: (Type -> Type -> Exp Constraint)
111+ :: (Type -> Exp Constraint)
107 -> (Type -> Exp K.HTable)
112 -> (Type -> Exp K.HTable)
113+ -> (Type -> Exp Type)
108− -> K.HTable -> (Type -> Type) -> (Type -> Type) -> Constraint
114+ -> K.HTable -> (Type -> Type) -> Constraint
109−class GSerializeADT' _Serialize _Columns htable exprs rep where
115+class GTableADT' _Table _Columns _FromExprs htable rep where
110− gfromResultADT' :: context ~ Result
116+ gfromResultADT' :: context ~ Col Result
111− => (forall expr a proxy. Eval (_Serialize expr a)
117+ => (forall a proxy. Eval (_Table a)
112− => proxy expr -> Eval (_Columns expr) context -> a)
118+ => proxy a -> Eval (_Columns a) context -> Eval (_FromExprs a))
113− -> (htable Result -> Tag)
119+ -> (htable (Col Result) -> Tag)
114− -> GColumnsADT' _Columns htable exprs context
120+ -> GColumnsADT' _Columns htable rep context
115− -> Maybe (rep x)
121+ -> Maybe (GMap _FromExprs rep x)
116−
122+
117− gtoResultADT' :: context ~ Result
123+ gtoResultADT' :: context ~ Col Result
118− => (forall expr a proxy. Eval (_Serialize expr a)
124+ => (forall a proxy. Eval (_Table a)
119− => proxy expr -> a -> Eval (_Columns expr) context)
125+ => proxy a -> Eval (_FromExprs a) -> Eval (_Columns a) context)
120− -> (Tag -> htable Result)
126+ -> (Tag -> htable (Col Result))
121− -> Maybe (rep x)
127+ -> Maybe (GMap _FromExprs rep x)
122− -> GColumnsADT' _Columns htable exprs context
128+ -> GColumnsADT' _Columns htable rep context
123−
129+
124− extract :: GColumnsADT' _Columns htable exprs context -> htable context
130+ extract :: GColumnsADT' _Columns htable rep context -> htable context
125
131
126
132
127instance
133instance
128− ( htable' ~ GColumnsADT' _Columns htable exprs1
134+ ( htable' ~ GColumnsADT' _Columns htable a
129− , GSerializeADT' _Serialize _Columns htable exprs1 a
135+ , GTableADT' _Table _Columns _FromExprs htable a
130− , GSerializeADT' _Serialize _Columns htable' exprs2 b
136+ , GTableADT' _Table _Columns _FromExprs htable' b
131 )
137 )
132− => GSerializeADT' _Serialize _Columns htable (exprs1 :+: exprs2) (a :+: b)
138+ => GTableADT' _Table _Columns _FromExprs htable (a :+: b)
133 where
139 where
134 gfromResultADT' fromResult f columns =
140 gfromResultADT' fromResult f columns =
135 case ma of
141 case ma of
136 Just a -> Just (L1 a)
142 Just a -> Just (L1 a)
137 Nothing -> R1 <$>
143 Nothing -> R1 <$>
138− gfromResultADT' @_Serialize @_Columns @_ @exprs2 @b
144+ gfromResultADT' @_Table @_Columns @_FromExprs @_ @b
139 fromResult
145 fromResult
140− (f . extract @_Serialize @_Columns @_ @exprs1 @a)
146+ (f . extract @_Table @_Columns @_FromExprs @_ @a)
141 columns
147 columns
142 where
148 where
143 ma =
149 ma =
144− gfromResultADT' @_Serialize @_Columns @_ @exprs1 @a
150+ gfromResultADT' @_Table @_Columns @_FromExprs @_ @a
145 fromResult
151 fromResult
146 f
152 f
147− (extract @_Serialize @_Columns @_ @exprs2 @b columns)
153+ (extract @_Table @_Columns @_FromExprs @_ @b columns)
148
154
149 gtoResultADT' toResult tag = \case
155 gtoResultADT' toResult tag = \case
150 Just (L1 a) ->
156 Just (L1 a) ->
151− gtoResultADT' @_Serialize @_Columns @_ @exprs2 @b
157+ gtoResultADT' @_Table @_Columns @_FromExprs @_ @b
152 toResult
158 toResult
153− (\_ -> gtoResultADT' @_Serialize @_Columns @_ @exprs1 @a
159+ (\_ -> gtoResultADT' @_Table @_Columns @_FromExprs @_ @a
154 toResult
160 toResult
155 tag
161 tag
156 (Just a))
162 (Just a))
157 Nothing
163 Nothing
158 Just (R1 b) ->
164 Just (R1 b) ->
159− gtoResultADT' @_Serialize @_Columns @_ @exprs2 @b
165+ gtoResultADT' @_Table @_Columns @_FromExprs @_ @b
160 toResult
166 toResult
161 (\tag' ->
167 (\tag' ->
162− gtoResultADT' @_Serialize @_Columns @_ @exprs1 @a
168+ gtoResultADT' @_Table @_Columns @_FromExprs @_ @a
163 toResult
169 toResult
164 (\_ -> tag tag')
170 (\_ -> tag tag')
165 Nothing)
171 Nothing)
166 (Just b)
172 (Just b)
167 Nothing ->
173 Nothing ->
168− gtoResultADT' @_Serialize @_Columns @_ @exprs2 @b
174+ gtoResultADT' @_Table @_Columns @_FromExprs @_ @b
169 toResult
175 toResult
170− (\_ -> gtoResultADT' @_Serialize @_Columns @_ @exprs1 @a toResult tag Nothing)
176+ (\_ -> gtoResultADT' @_Table @_Columns @_FromExprs @_ @a toResult tag Nothing)
171 Nothing
177 Nothing
172
178
173 extract =
179 extract =
174− extract @_Serialize @_Columns @_ @exprs1 @a .
180+ extract @_Table @_Columns @_FromExprs @_ @a .
175− extract @_Serialize @_Columns @_ @exprs2 @b
181+ extract @_Table @_Columns @_FromExprs @_ @b
176
182
177
183
178instance (meta ~ 'MetaCons label _fixity _isRecord, KnownSymbol label) =>
184instance (meta ~ 'MetaCons label _fixity _isRecord, KnownSymbol label) =>
179− GSerializeADT' _Serialize _Columns _htable (M1 C meta U1) (M1 C meta U1)
185+ GTableADT' _Table _Columns _FromExprs htable (M1 C meta U1)
180 where
186 where
181 gfromResultADT' _ tag columns
187 gfromResultADT' _ tag columns
182 | tag columns == tag' = Just (M1 U1)
188 | tag columns == tag' = Just (M1 U1)
@@ -192,18 +198,18 @@ instance (meta ~ 'MetaCons label _fixity _isRecord, KnownSymbol label) =>
192
198
193
199
194instance {-# OVERLAPPABLE #-}
200instance {-# OVERLAPPABLE #-}
195− ( HTable (GColumns _Columns exprs)
201+ ( HTable (GColumns _Columns rep)
196− , GSerialize _Serialize _Columns exprs rep
202+ , GTable _Table _Columns _FromExprs rep
197 , meta ~ 'MetaCons label _fixity _isRecord
203 , meta ~ 'MetaCons label _fixity _isRecord
198 , KnownSymbol label
204 , KnownSymbol label
199− , GColumnsADT' _Columns htable (M1 C ('MetaCons label _fixity _isRecord) exprs) ~
205+ , GColumnsADT' _Columns htable (M1 C ('MetaCons label _fixity _isRecord) rep) ~
200− HProduct htable (HLabel label (HNullify (GColumns _Columns exprs)))
206+ HProduct htable (HLabel label (HNullify (GColumns _Columns rep)))
201 )
207 )
202− => GSerializeADT' _Serialize _Columns htable (M1 C meta exprs) (M1 C meta rep)
208+ => GTableADT' _Table _Columns _FromExprs htable (M1 C meta rep)
203 where
209 where
204 gfromResultADT' fromResult tag (HProduct a b)
210 gfromResultADT' fromResult tag (HProduct a b)
205 | tag a == tag' =
211 | tag a == tag' =
206− M1 . gfromResult @_Serialize @_Columns @exprs @rep fromResult <$>
212+ M1 . gfromResult @_Table @_Columns @_FromExprs @rep fromResult <$>
207 hunnullify unnullifier (hunlabel b)
213 hunnullify unnullifier (hunlabel b)
208 | otherwise = Nothing
214 | otherwise = Nothing
209 where
215 where
@@ -214,7 +220,7 @@ instance {-# OVERLAPPABLE #-}
214 Just (M1 rep) -> HProduct (tag tag') $
220 Just (M1 rep) -> HProduct (tag tag') $
215 hlabel $
221 hlabel $
216 hnullify nullifier $
222 hnullify nullifier $
217− gtoResult @_Serialize @_Columns @exprs @rep toResult rep
223+ gtoResult @_Table @_Columns @_FromExprs @rep toResult rep
218 where
224 where
219 tag' = Tag $ pack $ symbolVal (Proxy @label)
225 tag' = Tag $ pack $ symbolVal (Proxy @label)
220
226
src/Rel8/Generic/Table/Record.hs+50−78
@@ -13,8 +13,8 @@
13{-# language UndecidableInstances #-}
13{-# language UndecidableInstances #-}
14
14
15module Rel8.Generic.Table.Record
15module Rel8.Generic.Table.Record
16− ( GTable, GColumns, GContext, gfromColumns, gtoColumns, gtable
16+ ( GTable, GColumns, GContext
17− , GSerialize, gfromResult, gtoResult
17+ , gfromColumns, gtoColumns, gfromResult, gtoResult, gtable
18 )
18 )
19where
19where
20
20
@@ -30,6 +30,7 @@ import Prelude hiding ( null )
30
30
31-- rel8
31-- rel8
32import Rel8.FCF ( Eval, Exp )
32import Rel8.FCF ( Eval, Exp )
33+import Rel8.Generic.Map ( GMap )
33import Rel8.Schema.HTable.Label ( HLabel, hlabel, hunlabel )
34import Rel8.Schema.HTable.Label ( HLabel, hlabel, hunlabel )
34import Rel8.Schema.HTable.Product ( HProduct(..) )
35import Rel8.Schema.HTable.Product ( HProduct(..) )
35import qualified Rel8.Schema.Kind as K
36import qualified Rel8.Schema.Kind as K
@@ -55,8 +56,9 @@ type family GContext _Context rep where
55type GTable
56type GTable
56 :: (Type -> Exp Constraint)
57 :: (Type -> Exp Constraint)
57 -> (Type -> Exp K.HTable)
58 -> (Type -> Exp K.HTable)
59+ -> (Type -> Exp Type)
58 -> (Type -> Type) -> Constraint
60 -> (Type -> Type) -> Constraint
59−class GTable _Table _Columns rep
61+class GTable _Table _Columns _FromExprs rep
60 where
62 where
61 gfromColumns :: ()
63 gfromColumns :: ()
62 => (forall a. Eval (_Table a) => Eval (_Columns a) context -> a)
64 => (forall a. Eval (_Table a) => Eval (_Columns a) context -> a)
@@ -68,93 +70,73 @@ class GTable _Table _Columns rep
68 -> rep x
70 -> rep x
69 -> GColumns _Columns rep context
71 -> GColumns _Columns rep context
70
72
71− gtable :: ()
72− => (forall a proxy. Eval (_Table a) => proxy a -> Eval (_Columns a) context)
73− -> GColumns _Columns rep context
74−
75−
76−type GSerialize
77− :: (Type -> Type -> Exp Constraint)
78− -> (Type -> Exp K.HTable)
79− -> (Type -> Type) -> (Type -> Type) -> Constraint
80−class GSerialize _Serialize _Columns exprs rep
81− where
82 gfromResult :: ()
73 gfromResult :: ()
83− => (forall expr a proxy. Eval (_Serialize expr a)
74+ => (forall a proxy. Eval (_Table a)
84− => proxy expr -> Eval (_Columns expr) context -> a)
75+ => proxy a -> Eval (_Columns a) context -> Eval (_FromExprs a))
85− -> GColumns _Columns exprs context
76+ -> GColumns _Columns rep context
86− -> rep x
77+ -> GMap _FromExprs rep x
87
78
88 gtoResult :: ()
79 gtoResult :: ()
89− => (forall expr a proxy. Eval (_Serialize expr a)
80+ => (forall a proxy. Eval (_Table a)
90− => proxy expr -> a -> Eval (_Columns expr) context)
81+ => proxy a -> Eval (_FromExprs a) -> Eval (_Columns a) context)
91− -> rep x
82+ -> GMap _FromExprs rep x
92− -> GColumns _Columns exprs context
83+ -> GColumns _Columns rep context
93
84
85+ gtable :: ()
86+ => (forall a proxy. Eval (_Table a) => proxy a -> Eval (_Columns a) context)
87+ -> GColumns _Columns rep context
94
88
89+
95−instance GTable _Table _Columns rep => GTable _Table _Columns (M1 D c rep)
90+instance GTable _Table _Columns _FromExprs rep =>
91+ GTable _Table _Columns _FromExprs (M1 D c rep)
96 where
92 where
97 gfromColumns fromColumns =
93 gfromColumns fromColumns =
98− M1 . gfromColumns @_Table @_Columns @rep fromColumns
94+ M1 . gfromColumns @_Table @_Columns @_FromExprs @rep fromColumns
99 gtoColumns toColumns (M1 a) =
95 gtoColumns toColumns (M1 a) =
100− gtoColumns @_Table @_Columns @rep toColumns a
96+ gtoColumns @_Table @_Columns @_FromExprs @rep toColumns a
101− gtable = gtable @_Table @_Columns @rep
102−
103−
104−instance GSerialize _Serialize _Columns exprs rep =>
105− GSerialize _Serialize _Columns (M1 D c exprs) (M1 D c rep)
106− where
107 gfromResult fromResult =
97 gfromResult fromResult =
108− M1 . gfromResult @_Serialize @_Columns @exprs @rep fromResult
98+ M1 . gfromResult @_Table @_Columns @_FromExprs @rep fromResult
109 gtoResult toResult (M1 a) =
99 gtoResult toResult (M1 a) =
110− gtoResult @_Serialize @_Columns @exprs @rep toResult a
100+ gtoResult @_Table @_Columns @_FromExprs @rep toResult a
101+ gtable = gtable @_Table @_Columns @_FromExprs @rep
111
102
112
103
113−instance GTable _Table _Columns rep => GTable _Table _Columns (M1 C c rep)
104+instance GTable _Table _Columns _FromExprs rep =>
105+ GTable _Table _Columns _FromExprs (M1 C c rep)
114 where
106 where
115 gfromColumns fromColumns =
107 gfromColumns fromColumns =
116− M1 . gfromColumns @_Table @_Columns @rep fromColumns
108+ M1 . gfromColumns @_Table @_Columns @_FromExprs @rep fromColumns
117 gtoColumns toColumns (M1 a) =
109 gtoColumns toColumns (M1 a) =
118− gtoColumns @_Table @_Columns @rep toColumns a
110+ gtoColumns @_Table @_Columns @_FromExprs @rep toColumns a
119− gtable = gtable @_Table @_Columns @rep
120−
121−
122−instance GSerialize _Serialize _Columns exprs rep =>
123− GSerialize _Serialize _Columns (M1 C c exprs) (M1 C c rep)
124− where
125 gfromResult fromResult =
111 gfromResult fromResult =
126− M1 . gfromResult @_Serialize @_Columns @exprs @rep fromResult
112+ M1 . gfromResult @_Table @_Columns @_FromExprs @rep fromResult
127 gtoResult toResult (M1 a) =
113 gtoResult toResult (M1 a) =
128− gtoResult @_Serialize @_Columns @exprs @rep toResult a
114+ gtoResult @_Table @_Columns @_FromExprs @rep toResult a
129−
130−
131−instance (GTable _Table _Columns rep1, GTable _Table _Columns rep2) =>
132− GTable _Table _Columns (rep1 :*: rep2)
133− where
134− gfromColumns fromColumns (HProduct a b) =
135− gfromColumns @_Table @_Columns @rep1 fromColumns a :*:
136− gfromColumns @_Table @_Columns @rep2 fromColumns b
137− gtoColumns toColumns (a :*: b) = HProduct
138− (gtoColumns @_Table @_Columns @rep1 toColumns a)
139− (gtoColumns @_Table @_Columns @rep2 toColumns b)
140− gtable table = HProduct
141− (gtable @_Table @_Columns @rep1 table)
115+ gtable = gtable @_Table @_Columns @_FromExprs @rep
142− (gtable @_Table @_Columns @rep2 table)
143
116
144
117
145instance
118instance
146− ( GSerialize _Serialize _Columns expr1 rep1
119+ ( GTable _Table _Columns _FromExprs rep1
147− , GSerialize _Serialize _Columns expr2 rep2
120+ , GTable _Table _Columns _FromExprs rep2
148 )
121 )
149− => GSerialize _Serialize _Columns (expr1 :*: expr2) (rep1 :*: rep2)
122+ => GTable _Table _Columns _FromExprs (rep1 :*: rep2)
150 where
123 where
124+ gfromColumns fromColumns (HProduct a b) =
125+ gfromColumns @_Table @_Columns @_FromExprs @rep1 fromColumns a :*:
126+ gfromColumns @_Table @_Columns @_FromExprs @rep2 fromColumns b
127+ gtoColumns toColumns (a :*: b) = HProduct
128+ (gtoColumns @_Table @_Columns @_FromExprs @rep1 toColumns a)
129+ (gtoColumns @_Table @_Columns @_FromExprs @rep2 toColumns b)
151 gfromResult fromResult (HProduct a b) =
130 gfromResult fromResult (HProduct a b) =
152− gfromResult @_Serialize @_Columns @expr1 @rep1 fromResult a :*:
131+ gfromResult @_Table @_Columns @_FromExprs @rep1 fromResult a :*:
153− gfromResult @_Serialize @_Columns @expr2 @rep2 fromResult b
132+ gfromResult @_Table @_Columns @_FromExprs @rep2 fromResult b
154 gtoResult toResult (a :*: b) =
133 gtoResult toResult (a :*: b) =
155 HProduct
134 HProduct
156− (gtoResult @_Serialize @_Columns @expr1 @rep1 toResult a)
135+ (gtoResult @_Table @_Columns @_FromExprs @rep1 toResult a)
157− (gtoResult @_Serialize @_Columns @expr2 @rep2 toResult b)
136+ (gtoResult @_Table @_Columns @_FromExprs @rep2 toResult b)
137+ gtable table = HProduct
138+ (gtable @_Table @_Columns @_FromExprs @rep1 table)
139+ (gtable @_Table @_Columns @_FromExprs @rep2 table)
158
140
159
141
160instance
142instance
@@ -162,20 +144,10 @@ instance
162 , meta ~ 'MetaSel ('Just label) _su _ss _ds
144 , meta ~ 'MetaSel ('Just label) _su _ss _ds
163 , k1 ~ K1 i a
145 , k1 ~ K1 i a
164 )
146 )
165− => GTable _Table _Columns (M1 S meta k1)
147+ => GTable _Table _Columns _FromExprs (M1 S meta k1)
166 where
148 where
167 gfromColumns fromColumns = M1 . K1 . fromColumns . hunlabel
149 gfromColumns fromColumns = M1 . K1 . fromColumns . hunlabel
168 gtoColumns toColumns (M1 (K1 a)) = hlabel (toColumns a)
150 gtoColumns toColumns (M1 (K1 a)) = hlabel (toColumns a)
151+ gfromResult fromResult = M1 . K1 . fromResult (Proxy @a) . hunlabel
152+ gtoResult toResult (M1 (K1 a)) = hlabel (toResult (Proxy @a) a)
169 gtable table = hlabel (table (Proxy @a))
153 gtable table = hlabel (table (Proxy @a))
170−
171−
172−instance
173− ( Eval (_Serialize expr a)
174− , meta ~ 'MetaSel ('Just label) _su _ss _ds
175− , k1 ~ K1 i expr
176− , k1' ~ K1 i a
177− )
178− => GSerialize _Serialize _Columns (M1 S meta k1) (M1 S meta k1')
179− where
180− gfromResult fromResult = M1 . K1 . fromResult (Proxy @expr) . hunlabel
181− gtoResult toResult (M1 (K1 a)) = hlabel (toResult (Proxy @expr) a)
src/Rel8/Kind/Context.hs−7
@@ -1,7 +1,6 @@
1{-# language DataKinds #-}
1{-# language DataKinds #-}
2{-# language GADTs #-}
2{-# language GADTs #-}
3{-# language StandaloneKindSignatures #-}
3{-# language StandaloneKindSignatures #-}
4−{-# language TypeSynonymInstances #-}
5
4
6module Rel8.Kind.Context
5module Rel8.Kind.Context
7 ( Reifiable( contextSing )
6 ( Reifiable( contextSing )
@@ -16,7 +15,6 @@ import Prelude ()
16-- rel8
15-- rel8
17import Rel8.Aggregate ( Aggregate )
16import Rel8.Aggregate ( Aggregate )
18import Rel8.Expr ( Expr )
17import Rel8.Expr ( Expr )
19−import Rel8.Schema.Field ( Field )
20import Rel8.Schema.Kind ( Context )
18import Rel8.Schema.Kind ( Context )
21import Rel8.Schema.Name ( Name )
19import Rel8.Schema.Name ( Name )
22import Rel8.Schema.Result ( Result )
20import Rel8.Schema.Result ( Result )
@@ -26,7 +24,6 @@ type SContext :: Context -> Type
26data SContext context where
24data SContext context where
27 SAggregate :: SContext Aggregate
25 SAggregate :: SContext Aggregate
28 SExpr :: SContext Expr
26 SExpr :: SContext Expr
29− SField :: SContext (Field table)
30 SName :: SContext Name
27 SName :: SContext Name
31 SResult :: SContext Result
28 SResult :: SContext Result
32
29
@@ -44,10 +41,6 @@ instance Reifiable Expr where
44 contextSing = SExpr
41 contextSing = SExpr
45
42
46
43
47−instance Reifiable (Field table) where
48− contextSing = SField
49−
50−
51instance Reifiable Result where
44instance Reifiable Result where
52 contextSing = SResult
45 contextSing = SResult
53
46
src/Rel8/Order.hs+8−1
@@ -4,6 +4,7 @@
4
4
5module Rel8.Order
5module Rel8.Order
6 ( Order(..)
6 ( Order(..)
7+ , toOrderExprs
7 )
8 )
8where
9where
9
10
@@ -16,7 +17,8 @@ import Prelude
16import Data.Functor.Contravariant.Divisible ( Decidable, Divisible )
17import Data.Functor.Contravariant.Divisible ( Decidable, Divisible )
17
18
18-- opaleye
19-- opaleye
19−import qualified Opaleye.Order as Opaleye
20+import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
21+import qualified Opaleye.Internal.Order as Opaleye
20
22
21
23
22-- | An ordering expression for @a@. Primitive orderings are defined with
24-- | An ordering expression for @a@. Primitive orderings are defined with
@@ -28,3 +30,8 @@ import qualified Opaleye.Order as Opaleye
28type Order :: Type -> Type
30type Order :: Type -> Type
29newtype Order a = Order (Opaleye.Order a)
31newtype Order a = Order (Opaleye.Order a)
30 deriving newtype (Contravariant, Divisible, Decidable, Semigroup, Monoid)
32 deriving newtype (Contravariant, Divisible, Decidable, Semigroup, Monoid)
33+
34+
35+toOrderExprs :: Order a -> a -> [Opaleye.OrderExpr]
36+toOrderExprs (Order (Opaleye.Order order)) a =
37+ uncurry Opaleye.OrderExpr <$> order a
src/Rel8/Query.hs+9−28
@@ -1,6 +1,4 @@
1−{-# language FlexibleContexts #-}
2{-# language StandaloneKindSignatures #-}
1{-# language StandaloneKindSignatures #-}
3−{-# language UndecidableInstances #-}
4
2
5module Rel8.Query
3module Rel8.Query
6 ( Query( Query )
4 ( Query( Query )
@@ -17,21 +15,18 @@ import Prelude
17-- opaleye
15-- opaleye
18import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
16import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
19import qualified Opaleye.Internal.PackMap as Opaleye
17import qualified Opaleye.Internal.PackMap as Opaleye
20−import qualified Opaleye.Internal.PrimQuery as Opaleye hiding (lateral)
18+import qualified Opaleye.Internal.PrimQuery as Opaleye
21import qualified Opaleye.Internal.QueryArr as Opaleye
19import qualified Opaleye.Internal.QueryArr as Opaleye
22import qualified Opaleye.Internal.Tag as Opaleye
20import qualified Opaleye.Internal.Tag as Opaleye
23
21
24-- rel8
22-- rel8
25−import Rel8.Expr ( Expr )
26import Rel8.Query.Set ( unionAll )
23import Rel8.Query.Set ( unionAll )
27import Rel8.Query.Opaleye ( fromOpaleye )
24import Rel8.Query.Opaleye ( fromOpaleye )
28import Rel8.Query.Values ( values )
25import Rel8.Query.Values ( values )
29−import Rel8.Table ( Table, fromColumns, toColumns )
30import Rel8.Table.Alternative
26import Rel8.Table.Alternative
31 ( AltTable, (<|>:)
27 ( AltTable, (<|>:)
32 , AlternativeTable, emptyTable
28 , AlternativeTable, emptyTable
33 )
29 )
34−import Rel8.Table.Projection ( Projectable, apply, project )
35
30
36-- semigroupoids
31-- semigroupoids
37import Data.Functor.Apply ( Apply, (<.>) )
32import Data.Functor.Apply ( Apply, (<.>) )
@@ -156,10 +151,6 @@ newtype Query a =
156 )
151 )
157
152
158
153
159−instance Projectable Query where
160− project f = fmap (fromColumns . apply f . toColumns)
161−
162−
163instance Functor Query where
154instance Functor Query where
164 fmap f (Query a) = Query (fmap (fmap (fmap f)) a)
155 fmap f (Query a) = Query (fmap (fmap (fmap f)) a)
165
156
@@ -178,14 +169,14 @@ instance Bind Query where
178
169
179
170
180instance Monad Query where
171instance Monad Query where
181− Query q >>= f = Query $ \dummies -> Opaleye.stateQueryArr $ \_ tag ->
172+ Query q >>= f = Query $ \dummies -> Opaleye.QueryArr $ \(_, tag) ->
182 let
173 let
183− qa = q dummies
174+ Opaleye.QueryArr qa = q dummies
184− ((m, a), query, tag') = Opaleye.runStateQueryArr qa () tag
175+ ((m, a), query, tag') = qa ((), tag)
185 Query q' = f a
176 Query q' = f a
186 (dummies', query', tag'') =
177 (dummies', query', tag'') =
187 ( dummy : dummies
178 ( dummy : dummies
188− , query <> Opaleye.aRebind bindings
179+ , \lateral -> Opaleye.Rebind True bindings . query lateral
189 , Opaleye.next tag'
180 , Opaleye.next tag'
190 )
181 )
191 where
182 where
@@ -193,11 +184,11 @@ instance Monad Query where
193 where
184 where
194 random = Opaleye.FunExpr "random" []
185 random = Opaleye.FunExpr "random" []
195 name = Opaleye.extractAttr "dummy" tag'
186 name = Opaleye.extractAttr "dummy" tag'
196− qa' = Opaleye.lateral $ \_ -> q' dummies'
187+ Opaleye.QueryArr qa' = Opaleye.lateral $ \_ -> q' dummies'
197− ((m'@(Any needsDummies), b), query'', tag''') = Opaleye.runStateQueryArr qa' () tag''
188+ ((m'@(Any needsDummies), b), query'', tag''') = qa' ((), tag'')
198 query'''
189 query'''
199− | needsDummies = query' <> query''
190+ | needsDummies = \lateral -> query'' lateral . query' lateral
200− | otherwise = query <> query''
191+ | otherwise = \lateral -> query'' lateral . query lateral
201 m'' = m <> m'
192 m'' = m <> m'
202 in
193 in
203 ((m'', b), query''', tag''')
194 ((m'', b), query''', tag''')
@@ -211,13 +202,3 @@ instance AltTable Query where
211-- | 'emptyTable' = 'values' @[]@.
202-- | 'emptyTable' = 'values' @[]@.
212instance AlternativeTable Query where
203instance AlternativeTable Query where
213 emptyTable = values []
204 emptyTable = values []
214−
215−
216−-- | '<>' = 'unionAll'.
217−instance Table Expr a => Semigroup (Query a) where
218− (<>) = (<|>:)
219−
220−
221−-- | 'mempty' = @'values' []@.
222−instance Table Expr a => Monoid (Query a) where
223− mempty = emptyTable
src/Rel8/Query/Aggregate.hs−19
@@ -1,17 +1,13 @@
1{-# language FlexibleContexts #-}
1{-# language FlexibleContexts #-}
2{-# language MonoLocalBinds #-}
2{-# language MonoLocalBinds #-}
3−{-# language ScopedTypeVariables #-}
4−{-# language TypeApplications #-}
5
3
6module Rel8.Query.Aggregate
4module Rel8.Query.Aggregate
7 ( aggregate
5 ( aggregate
8 , countRows
6 , countRows
9− , mode
10 )
7 )
11where
8where
12
9
13-- base
10-- base
14−import Data.Functor.Contravariant ( (>$<) )
15import Data.Int ( Int64 )
11import Data.Int ( Int64 )
16import Prelude
12import Prelude
17
13
@@ -22,16 +18,9 @@ import qualified Opaleye.Aggregate as Opaleye
22import Rel8.Aggregate ( Aggregates )
18import Rel8.Aggregate ( Aggregates )
23import Rel8.Expr ( Expr )
19import Rel8.Expr ( Expr )
24import Rel8.Expr.Aggregate ( countStar )
20import Rel8.Expr.Aggregate ( countStar )
25−import Rel8.Expr.Order ( desc )
26import Rel8.Query ( Query )
21import Rel8.Query ( Query )
27−import Rel8.Query.Limit ( limit )
28import Rel8.Query.Maybe ( optional )
22import Rel8.Query.Maybe ( optional )
29import Rel8.Query.Opaleye ( mapOpaleye )
23import Rel8.Query.Opaleye ( mapOpaleye )
30−import Rel8.Query.Order ( orderBy )
31−import Rel8.Table ( toColumns )
32−import Rel8.Table.Aggregate ( hgroupBy )
33−import Rel8.Table.Cols ( Cols( Cols ), fromCols )
34−import Rel8.Table.Eq ( EqTable, eqTable )
35import Rel8.Table.Opaleye ( aggregator )
24import Rel8.Table.Opaleye ( aggregator )
36import Rel8.Table.Maybe ( maybeTable )
25import Rel8.Table.Maybe ( maybeTable )
37
26
@@ -46,11 +35,3 @@ aggregate = mapOpaleye (Opaleye.aggregate aggregator)
46-- will return @0@.
35-- will return @0@.
47countRows :: Query a -> Query (Expr Int64)
36countRows :: Query a -> Query (Expr Int64)
48countRows = fmap (maybeTable 0 id) . optional . aggregate . fmap (const countStar)
37countRows = fmap (maybeTable 0 id) . optional . aggregate . fmap (const countStar)
49−
50−
51−-- | Return the most common row in a query.
52−mode :: forall a. EqTable a => Query a -> Query a
53−mode rows = limit 1 $ fmap (fromCols . snd) $ orderBy (fst >$< desc) $ do
54− aggregate $ do
55− row <- toColumns <$> rows
56− pure (countStar, Cols $ hgroupBy (eqTable @a) row)
src/Rel8/Query/Distinct.hs+9−4
@@ -1,3 +1,5 @@
1+{-# options_ghc -fno-warn-redundant-constraints #-}
2+
1module Rel8.Query.Distinct
3module Rel8.Query.Distinct
2 ( distinct
4 ( distinct
3 , distinctOn
5 , distinctOn
@@ -6,11 +8,12 @@ module Rel8.Query.Distinct
6where
8where
7
9
8-- base
10-- base
9−import Prelude ()
11+import Prelude
10
12
11-- opaleye
13-- opaleye
12import qualified Opaleye.Distinct as Opaleye
14import qualified Opaleye.Distinct as Opaleye
13−import qualified Opaleye.Order as Opaleye
15+import qualified Opaleye.Internal.Order as Opaleye
16+import qualified Opaleye.Internal.QueryArr as Opaleye
14
17
15-- rel8
18-- rel8
16import Rel8.Order ( Order( Order ) )
19import Rel8.Order ( Order( Order ) )
@@ -30,11 +33,13 @@ distinct = mapOpaleye (Opaleye.distinctExplicit distinctspec)
30-- to a projection. If multiple rows have the same projection, it is
33-- to a projection. If multiple rows have the same projection, it is
31-- unspecified which row will be returned. If this matters, use 'distinctOnBy'.
34-- unspecified which row will be returned. If this matters, use 'distinctOnBy'.
32distinctOn :: EqTable b => (a -> b) -> Query a -> Query a
35distinctOn :: EqTable b => (a -> b) -> Query a -> Query a
36+distinctOn proj =
33−distinctOn proj = mapOpaleye (Opaleye.distinctOnExplicit unpackspec proj)
37+ mapOpaleye (\q -> Opaleye.productQueryArr (Opaleye.distinctOn unpackspec proj . Opaleye.runSimpleQueryArr q))
34
38
35
39
36-- | Select all distinct rows from a query, where rows are equivalent according
40-- | Select all distinct rows from a query, where rows are equivalent according
37-- to a projection. If there are multiple rows with the same projection, the
41-- to a projection. If there are multiple rows with the same projection, the
38-- first row according to the specified 'Order' will be returned.
42-- first row according to the specified 'Order' will be returned.
39distinctOnBy :: EqTable b => (a -> b) -> Order a -> Query a -> Query a
43distinctOnBy :: EqTable b => (a -> b) -> Order a -> Query a -> Query a
40−distinctOnBy proj (Order order) = mapOpaleye (Opaleye.distinctOnByExplicit unpackspec proj order)
44+distinctOnBy proj (Order order) =
45+ mapOpaleye (\q -> Opaleye.productQueryArr (Opaleye.distinctOnBy unpackspec proj order . Opaleye.runSimpleQueryArr q))
src/Rel8/Query/Each.hs+3−3
@@ -17,7 +17,7 @@ import Rel8.Query ( Query )
17import Rel8.Query.Opaleye ( fromOpaleye )
17import Rel8.Query.Opaleye ( fromOpaleye )
18import Rel8.Schema.Name ( Selects )
18import Rel8.Schema.Name ( Selects )
19import Rel8.Schema.Table ( TableSchema )
19import Rel8.Schema.Table ( TableSchema )
20−import Rel8.Table.Cols ( fromCols, toCols )
20+import Rel8.Table ( fromColumns, toColumns )
21import Rel8.Table.Opaleye ( table, unpackspec )
21import Rel8.Table.Opaleye ( table, unpackspec )
22
22
23
23
@@ -25,8 +25,8 @@ import Rel8.Table.Opaleye ( table, unpackspec )
25-- table@.
25-- table@.
26each :: Selects names exprs => TableSchema names -> Query exprs
26each :: Selects names exprs => TableSchema names -> Query exprs
27each =
27each =
28− fmap fromCols .
28+ fmap fromColumns .
29 fromOpaleye .
29 fromOpaleye .
30 Opaleye.selectTableExplicit unpackspec .
30 Opaleye.selectTableExplicit unpackspec .
31 table .
31 table .
32− fmap toCols
32+ fmap toColumns
src/Rel8/Query/Evaluate.hs+22−3
@@ -3,6 +3,7 @@
3
3
4module Rel8.Query.Evaluate
4module Rel8.Query.Evaluate
5 ( evaluate
5 ( evaluate
6+ , rebind
6 )
7 )
7where
8where
8
9
@@ -15,23 +16,28 @@ import Prelude hiding ( undefined )
15
16
16-- opaleye
17-- opaleye
17import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
18import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
19+import qualified Opaleye.Internal.PackMap as Opaleye
20+import qualified Opaleye.Internal.PrimQuery as Opaleye
21+import qualified Opaleye.Internal.QueryArr as Opaleye
22+import qualified Opaleye.Internal.Tag as Opaleye
23+import qualified Opaleye.Internal.Unpackspec as Opaleye
18
24
19-- rel8
25-- rel8
20import Rel8.Expr ( Expr )
26import Rel8.Expr ( Expr )
21import Rel8.Expr.Bool ( (&&.) )
27import Rel8.Expr.Bool ( (&&.) )
22import Rel8.Expr.Opaleye ( fromPrimExpr )
28import Rel8.Expr.Opaleye ( fromPrimExpr )
23import Rel8.Query ( Query( Query ) )
29import Rel8.Query ( Query( Query ) )
24−import Rel8.Query.Rebind ( rebind )
25import Rel8.Table ( Table )
30import Rel8.Table ( Table )
26import Rel8.Table.Bool ( case_ )
31import Rel8.Table.Bool ( case_ )
27−import Rel8.Table.Undefined ( undefined )
32+import Rel8.Table.Opaleye ( unpackspec )
33+import Rel8.Table.Undefined
28
34
29
35
30-- | 'evaluate' takes expressions that could potentially have side effects and
36-- | 'evaluate' takes expressions that could potentially have side effects and
31-- \"runs\" them in the 'Query' monad. The returned expressions have no side
37-- \"runs\" them in the 'Query' monad. The returned expressions have no side
32-- effects and can safely be reused.
38-- effects and can safely be reused.
33evaluate :: Table Expr a => a -> Query a
39evaluate :: Table Expr a => a -> Query a
34−evaluate = laterally >=> rebind "eval"
40+evaluate = laterally >=> rebind
35
41
36
42
37laterally :: Table Expr a => a -> Query a
43laterally :: Table Expr a => a -> Query a
@@ -45,5 +51,18 @@ laterally a = Query $ \bindings -> pure $ (Any True,) $
45 go = fromPrimExpr . Opaleye.UnExpr Opaleye.OpIsNotNull
51 go = fromPrimExpr . Opaleye.UnExpr Opaleye.OpIsNotNull
46
52
47
53
54+-- | 'rebind' takes some expressions, and binds each of them to a new
55+-- variable in the SQL. The @a@ returned consists only of these
56+-- variables. It's essentially a @let@ binding for Postgres expressions.
57+rebind :: Table Expr a => a -> Query a
58+rebind a = Query $ \_ -> Opaleye.QueryArr $ \(_, tag) ->
59+ let
60+ tag' = Opaleye.next tag
61+ (a', bindings) = Opaleye.run $
62+ Opaleye.runUnpackspec unpackspec (Opaleye.extractAttr "eval" tag') a
63+ in
64+ ((mempty, a'), \_ -> Opaleye.Rebind True bindings, tag')
65+
66+
48foldl1' :: (a -> a -> a) -> NonEmpty a -> a
67foldl1' :: (a -> a -> a) -> NonEmpty a -> a
49foldl1' f (a :| as) = foldl' f a as
68foldl1' f (a :| as) = foldl' f a as
src/Rel8/Query/Exists.hs+1−1
@@ -12,7 +12,7 @@ import Prelude hiding ( filter )
12
12
13-- opaleye
13-- opaleye
14import qualified Opaleye.Exists as Opaleye
14import qualified Opaleye.Exists as Opaleye
15−import qualified Opaleye.Operators as Opaleye
15+import qualified Opaleye.Operators as Opaleye hiding ( exists )
16
16
17-- rel8
17-- rel8
18import Rel8.Expr ( Expr )
18import Rel8.Expr ( Expr )
src/Rel8/Query/Indexed.hsdeleted−21
@@ -1,21 +0,0 @@
1−module Rel8.Query.Indexed
2− ( indexed
3− )
4−where
5−
6−-- base
7−import Control.Applicative ( liftA2 )
8−import Data.Int ( Int64 )
9−import Prelude
10−
11−-- rel8
12−import Rel8.Expr ( Expr )
13−import Rel8.Expr.Window ( rowNumber )
14−import Rel8.Query ( Query )
15−import Rel8.Query.Window ( window )
16−import Rel8.Table.Window ( currentRow )
17−
18−
19−-- | Pair each row of a query with its index within the query.
20−indexed :: Query a -> Query (Expr Int64, a)
21−indexed = window (liftA2 (,) (subtract 1 <$> rowNumber) currentRow)
src/Rel8/Query/List.hs+12−15
@@ -19,18 +19,17 @@ import Prelude
19import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
19import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
20
20
21-- rel8
21-- rel8
22−import Rel8.Expr ( Expr )
22+import Rel8.Expr ( Col( E, unE ), Expr )
23import Rel8.Expr.Aggregate ( listAggExpr, nonEmptyAggExpr )
23import Rel8.Expr.Aggregate ( listAggExpr, nonEmptyAggExpr )
24import Rel8.Expr.Opaleye ( mapPrimExpr )
24import Rel8.Expr.Opaleye ( mapPrimExpr )
25import Rel8.Query ( Query )
25import Rel8.Query ( Query )
26import Rel8.Query.Aggregate ( aggregate )
26import Rel8.Query.Aggregate ( aggregate )
27+import Rel8.Query.Evaluate ( rebind )
27import Rel8.Query.Maybe ( optional )
28import Rel8.Query.Maybe ( optional )
28−import Rel8.Query.Rebind ( rebind )
29import Rel8.Schema.HTable.Vectorize ( hunvectorize )
29import Rel8.Schema.HTable.Vectorize ( hunvectorize )
30import Rel8.Schema.Null ( Sql, Unnullify )
30import Rel8.Schema.Null ( Sql, Unnullify )
31−import Rel8.Schema.Spec ( Spec( Spec, info ) )
31+import Rel8.Schema.Spec ( SSpec( SSpec, info ) )
32−import Rel8.Table ( Table, fromColumns )
32+import Rel8.Table ( Table, fromColumns, toColumns )
33−import Rel8.Table.Cols ( toCols )
34import Rel8.Table.Aggregate ( listAgg, nonEmptyAgg )
33import Rel8.Table.Aggregate ( listAgg, nonEmptyAgg )
35import Rel8.Table.List ( ListTable( ListTable ) )
34import Rel8.Table.List ( ListTable( ListTable ) )
36import Rel8.Table.Maybe ( maybeTable )
35import Rel8.Table.Maybe ( maybeTable )
@@ -52,7 +51,7 @@ many =
52 fmap (maybeTable mempty (\(ListTable a) -> ListTable a)) .
51 fmap (maybeTable mempty (\(ListTable a) -> ListTable a)) .
53 optional .
52 optional .
54 aggregate .
53 aggregate .
55− fmap (listAgg . toCols)
54+ fmap (listAgg . toColumns)
56
55
57
56
58-- | Aggregate a 'Query' into a 'NonEmptyTable'. If the supplied query returns
57-- | Aggregate a 'Query' into a 'NonEmptyTable'. If the supplied query returns
@@ -67,7 +66,7 @@ some :: Table Expr a => Query a -> Query (NonEmptyTable Expr a)
67some =
66some =
68 fmap (\(NonEmptyTable a) -> NonEmptyTable a) .
67 fmap (\(NonEmptyTable a) -> NonEmptyTable a) .
69 aggregate .
68 aggregate .
70− fmap (nonEmptyAgg . toCols)
69+ fmap (nonEmptyAgg . toColumns)
71
70
72
71
73-- | A version of 'many' specialised to single expressions.
72-- | A version of 'many' specialised to single expressions.
@@ -85,9 +84,8 @@ someExpr = aggregate . fmap nonEmptyAggExpr
85--
84--
86-- @catListTable@ is an inverse to 'many'.
85-- @catListTable@ is an inverse to 'many'.
87catListTable :: Table Expr a => ListTable Expr a -> Query a
86catListTable :: Table Expr a => ListTable Expr a -> Query a
88−catListTable (ListTable as) =
89− rebind "unnest" $ fromColumns $ runIdentity $
87+catListTable (ListTable as) = rebind $ fromColumns $ runIdentity $
90− hunvectorize (\Spec {info} -> pure . sunnest info) as
88+ hunvectorize (\SSpec {info} -> pure . E . sunnest info . unE) as
91
89
92
90
93-- | Expand a 'NonEmptyTable' into a 'Query', where each row in the query is an
91-- | Expand a 'NonEmptyTable' into a 'Query', where each row in the query is an
@@ -95,9 +93,8 @@ catListTable (ListTable as) =
95--
93--
96-- @catNonEmptyTable@ is an inverse to 'some'.
94-- @catNonEmptyTable@ is an inverse to 'some'.
97catNonEmptyTable :: Table Expr a => NonEmptyTable Expr a -> Query a
95catNonEmptyTable :: Table Expr a => NonEmptyTable Expr a -> Query a
98−catNonEmptyTable (NonEmptyTable as) =
96+catNonEmptyTable (NonEmptyTable as) = rebind $ fromColumns $ runIdentity $
99− rebind "unnest" $ fromColumns $ runIdentity $
100− hunvectorize (\Spec {info} -> pure . sunnest info) as
97+ hunvectorize (\SSpec {info} -> pure . E . sunnest info . unE) as
101
98
102
99
103-- | Expand an expression that contains a list into a 'Query', where each row
100-- | Expand an expression that contains a list into a 'Query', where each row
@@ -105,7 +102,7 @@ catNonEmptyTable (NonEmptyTable as) =
105--
102--
106-- @catList@ is an inverse to 'manyExpr'.
103-- @catList@ is an inverse to 'manyExpr'.
107catList :: Sql DBType a => Expr [a] -> Query (Expr a)
104catList :: Sql DBType a => Expr [a] -> Query (Expr a)
108−catList = rebind "unnest" . sunnest typeInformation
105+catList = rebind . sunnest typeInformation
109
106
110
107
111-- | Expand an expression that contains a non-empty list into a 'Query', where
108-- | Expand an expression that contains a non-empty list into a 'Query', where
@@ -113,7 +110,7 @@ catList = rebind "unnest" . sunnest typeInformation
113--
110--
114-- @catNonEmpty@ is an inverse to 'someExpr'.
111-- @catNonEmpty@ is an inverse to 'someExpr'.
115catNonEmpty :: Sql DBType a => Expr (NonEmpty a) -> Query (Expr a)
112catNonEmpty :: Sql DBType a => Expr (NonEmpty a) -> Query (Expr a)
116−catNonEmpty = rebind "unnest" . sunnest typeInformation
113+catNonEmpty = rebind . sunnest typeInformation
117
114
118
115
119sunnest :: TypeInformation (Unnullify a) -> Expr (list a) -> Expr a
116sunnest :: TypeInformation (Unnullify a) -> Expr (list a) -> Expr a
src/Rel8/Query/Maybe.hs+7−9
@@ -1,5 +1,4 @@
1{-# language GADTs #-}
1{-# language GADTs #-}
2−{-# language LambdaCase #-}
3{-# language NamedFieldPuns #-}
2{-# language NamedFieldPuns #-}
4
3
5module Rel8.Query.Maybe
4module Rel8.Query.Maybe
@@ -19,7 +18,7 @@ import Control.Comonad ( extract )
19import qualified Opaleye.Internal.MaybeFields as Opaleye
18import qualified Opaleye.Internal.MaybeFields as Opaleye
20
19
21-- rel8
20-- rel8
22−import Rel8.Expr ( Expr )
21+import Rel8.Expr ( Col( E ), Expr )
23import Rel8.Expr.Eq ( (==.) )
22import Rel8.Expr.Eq ( (==.) )
24import Rel8.Expr.Opaleye ( fromColumn, fromPrimExpr )
23import Rel8.Expr.Opaleye ( fromColumn, fromPrimExpr )
25import Rel8.Query ( Query )
24import Rel8.Query ( Query )
@@ -35,7 +34,7 @@ import Rel8.Table.Maybe ( MaybeTable(..), isJustTable )
35-- JOIN@s.
34-- JOIN@s.
36optional :: Query a -> Query (MaybeTable Expr a)
35optional :: Query a -> Query (MaybeTable Expr a)
37optional = mapOpaleye $ Opaleye.optionalInternal $ \tag a -> MaybeTable
36optional = mapOpaleye $ Opaleye.optionalInternal $ \tag a -> MaybeTable
38− { tag = fromPrimExpr $ fromColumn tag
37+ { tag = E $ fromPrimExpr $ fromColumn tag
39 , just = pure a
38 , just = pure a
40 }
39 }
41
40
@@ -55,14 +54,13 @@ catMaybeTable ma@(MaybeTable _ a) = do
55-- to step through multiple @LEFT JOINs@.
54-- to step through multiple @LEFT JOINs@.
56--
55--
57-- Note that @traverseMaybeTable@ takes a @a -> Query b@ function, which means
56-- Note that @traverseMaybeTable@ takes a @a -> Query b@ function, which means
58−-- you also have the ability to "expand" one row into multiple rows. If the
57+-- you also have the ability to "expand" one row into multiple rows. If the
59-- @a -> Query b@ function returns no rows, then the resulting query will also
58-- @a -> Query b@ function returns no rows, then the resulting query will also
60-- have no rows. However, regardless of the given @a -> Query b@ function, if
59-- have no rows. However, regardless of the given @a -> Query b@ function, if
61-- the input is @nothingTable@, you will always get exactly one @nothingTable@
60-- the input is @nothingTable@, you will always get exactly one @nothingTable@
62-- back.
61-- back.
63traverseMaybeTable :: (a -> Query b) -> MaybeTable Expr a -> Query (MaybeTable Expr b)
62traverseMaybeTable :: (a -> Query b) -> MaybeTable Expr a -> Query (MaybeTable Expr b)
64−traverseMaybeTable query ma@(MaybeTable input _) = do
63+traverseMaybeTable query ma@(MaybeTable (E input) _) = do
65− optional (query =<< catMaybeTable ma) >>= \case
64+ MaybeTable (E output) b <- optional (query =<< catMaybeTable ma)
66− MaybeTable output b -> do
67− where_ $ output ==. input
65+ where_ $ output ==. input
68− pure $ MaybeTable input b
66+ pure $ MaybeTable (E input) b
src/Rel8/Query/Null.hs−15
@@ -1,8 +1,5 @@
1−{-# language FlexibleContexts #-}
2−
3module Rel8.Query.Null
1module Rel8.Query.Null
4 ( catNull
2 ( catNull
5− , catNullTable
6 )
3 )
7where
4where
8
5
@@ -12,8 +9,6 @@ import Prelude
12-- rel8
9-- rel8
13import Rel8.Expr ( Expr )
10import Rel8.Expr ( Expr )
14import Rel8.Expr.Null ( isNonNull, unsafeUnnullify )
11import Rel8.Expr.Null ( isNonNull, unsafeUnnullify )
15−import Rel8.Table ( Table )
16−import Rel8.Table.Null ( NullTable, isNonNullTable, unsafeUnnullifyTable )
17import Rel8.Query ( Query )
12import Rel8.Query ( Query )
18import Rel8.Query.Filter ( where_ )
13import Rel8.Query.Filter ( where_ )
19
14
@@ -26,13 +21,3 @@ catNull :: Expr (Maybe a) -> Query (Expr a)
26catNull a = do
21catNull a = do
27 where_ $ isNonNull a
22 where_ $ isNonNull a
28 pure $ unsafeUnnullify a
23 pure $ unsafeUnnullify a
29−
30−
31−-- | Filter a 'Query' that might return @nullTable@ to a 'Query' without any
32−-- @nullTable@s.
33−--
34−-- Corresponds to 'Data.Maybe.catMaybes'.
35−catNullTable :: Table Expr a => NullTable Expr a -> Query a
36−catNullTable a = do
37− where_ $ isNonNullTable a
38− pure $ unsafeUnnullifyTable a
src/Rel8/Query/Opaleye.hs+10−18
@@ -5,7 +5,6 @@ module Rel8.Query.Opaleye
5 , toOpaleye
5 , toOpaleye
6 , mapOpaleye
6 , mapOpaleye
7 , zipOpaleyeWith
7 , zipOpaleyeWith
8− , unsafePeekQuery
9 )
8 )
10where
9where
11
10
@@ -15,7 +14,6 @@ import Prelude
15
14
16-- opaleye
15-- opaleye
17import qualified Opaleye.Internal.QueryArr as Opaleye
16import qualified Opaleye.Internal.QueryArr as Opaleye
18−import qualified Opaleye.Internal.Tag as Opaleye
19
17
20-- rel8
18-- rel8
21import {-# SOURCE #-} Rel8.Query ( Query( Query ) )
19import {-# SOURCE #-} Rel8.Query ( Query( Query ) )
@@ -39,32 +37,26 @@ zipOpaleyeWith :: ()
39zipOpaleyeWith f (Query a) (Query b) = Query $ liftA2 (zipping f) a b
37zipOpaleyeWith f (Query a) (Query b) = Query $ liftA2 (zipping f) a b
40
38
41
39
42−unsafePeekQuery :: Query a -> a
43−unsafePeekQuery (Query q) = case q mempty of
44− f -> case Opaleye.runStateQueryArr f () Opaleye.start of
45− ((_, a), _, _) -> a
46−
47−
48mapping :: ()
40mapping :: ()
49 => (Opaleye.Select a -> Opaleye.Select b)
41 => (Opaleye.Select a -> Opaleye.Select b)
50 -> Opaleye.Select (m, a) -> Opaleye.Select (m, b)
42 -> Opaleye.Select (m, a) -> Opaleye.Select (m, b)
51−mapping f q = Opaleye.stateQueryArr $ \_ tag ->
43+mapping f q@(Opaleye.QueryArr qa) = Opaleye.QueryArr $ \(_, tag) ->
52 let
44 let
53− ((m, _), _, _) = Opaleye.runStateQueryArr q () tag
45+ ((m, _), _, _) = qa ((), tag)
54− q' = (m,) <$> f (snd <$> q)
46+ Opaleye.QueryArr qa' = (m,) <$> f (snd <$> q)
55 in
47 in
56− Opaleye.runStateQueryArr q' () tag
48+ qa' ((), tag)
57
49
58
50
59zipping :: Semigroup m
51zipping :: Semigroup m
60 => (Opaleye.Select a -> Opaleye.Select b -> Opaleye.Select c)
52 => (Opaleye.Select a -> Opaleye.Select b -> Opaleye.Select c)
61 -> Opaleye.Select (m, a) -> Opaleye.Select (m, b) -> Opaleye.Select (m, c)
53 -> Opaleye.Select (m, a) -> Opaleye.Select (m, b) -> Opaleye.Select (m, c)
62−zipping f q q' =
54+zipping f q@(Opaleye.QueryArr qa) q'@(Opaleye.QueryArr qa') =
63− Opaleye.stateQueryArr $ \_ tag ->
55+ Opaleye.QueryArr $ \(_, tag) ->
64 let
56 let
65− ((m, _), _, _) = Opaleye.runStateQueryArr q () tag
57+ ((m, _), _, _) = qa ((), tag)
66− ((m', _), _, _) = Opaleye.runStateQueryArr q' () tag
58+ ((m', _), _, _) = qa' ((), tag)
67 m'' = m <> m'
59 m'' = m <> m'
68− q'' = (m'',) <$> f (snd <$> q) (snd <$> q')
60+ Opaleye.QueryArr qa'' = (m'',) <$> f (snd <$> q) (snd <$> q')
69 in
61 in
70− Opaleye.runStateQueryArr q'' () tag
62+ qa'' ((), tag)
src/Rel8/Query/Rebind.hsdeleted−27
@@ -1,27 +0,0 @@
1−{-# language FlexibleContexts #-}
2−
3−module Rel8.Query.Rebind
4− ( rebind
5− )
6−where
7−
8−-- base
9−import Prelude
10−import Control.Arrow ((<<<))
11−
12−-- opaleye
13−import qualified Opaleye.Internal.Rebind as Opaleye
14−
15−-- rel8
16−import Rel8.Expr ( Expr )
17−import Rel8.Query ( Query )
18−import Rel8.Table ( Table )
19−import Rel8.Table.Opaleye ( unpackspec )
20−import Rel8.Query.Opaleye (fromOpaleye)
21−
22−
23−-- | 'rebind' takes a variable name, some expressions, and binds each of them
24−-- to a new variable in the SQL. The @a@ returned consists only of these
25−-- variables. It's essentially a @let@ binding for Postgres expressions.
26−rebind :: Table Expr a => String -> a -> Query a
27−rebind prefix a = fromOpaleye (Opaleye.rebindExplicitPrefix prefix unpackspec <<< pure a)
src/Rel8/Query/SQL.hs+59−6
@@ -1,21 +1,74 @@
1{-# language FlexibleContexts #-}
1{-# language FlexibleContexts #-}
2−{-# language MonoLocalBinds #-}
2+{-# language TypeFamilies #-}
3+{-# language ViewPatterns #-}
3
4
4module Rel8.Query.SQL
5module Rel8.Query.SQL
5 ( showQuery
6 ( showQuery
7+ , sqlForQuery, sqlForQueryWithNames
6 )
8 )
7where
9where
8
10
9-- base
11-- base
12+import Data.Foldable ( fold )
13+import Data.Functor.Const ( Const( Const ), getConst )
14+import Data.Void ( Void )
10import Prelude
15import Prelude
11
16
17+-- opaleye
18+import qualified Opaleye.Internal.HaskellDB.Sql as Opaleye
19+import qualified Opaleye.Internal.PrimQuery as Opaleye
20+import qualified Opaleye.Internal.Print as Opaleye
21+import qualified Opaleye.Internal.Optimize as Opaleye
22+import qualified Opaleye.Internal.QueryArr as Opaleye hiding ( Select )
23+import qualified Opaleye.Internal.Sql as Opaleye
24+
12-- rel8
25-- rel8
13−import Rel8.Expr ( Expr )
26+import Rel8.Expr ( Expr, Col( E ) )
27+import Rel8.Expr.Opaleye ( toPrimExpr )
14import Rel8.Query ( Query )
28import Rel8.Query ( Query )
15−import Rel8.Statement.Select ( ppSelect )
29+import Rel8.Query.Opaleye ( toOpaleye )
30+import Rel8.Schema.Name ( Name( Name ), Selects, Col( N ) )
31+import Rel8.Schema.HTable ( htabulateA, hfield )
32+import Rel8.Table ( Table, toColumns )
16−import Rel8.Table ( Table )
33+import Rel8.Table.Name ( namesFromLabels )
34+import Rel8.Table.Opaleye ( castTable )
17
35
18
36
19−-- | Convert a 'Query' to a 'String' containing a @SELECT@ statement.
37+-- | Convert a query to a 'String' containing the query as a @SELECT@
38+-- statement.
20showQuery :: Table Expr a => Query a -> String
39showQuery :: Table Expr a => Query a -> String
21−showQuery = show . ppSelect
40+showQuery = fold . sqlForQuery
41+
42+
43+sqlForQuery :: Table Expr a
44+ => Query a -> Maybe String
45+sqlForQuery = sqlForQueryWithNames namesFromLabels . fmap toColumns
46+
47+
48+sqlForQueryWithNames :: Selects names exprs
49+ => names -> Query exprs -> Maybe String
50+sqlForQueryWithNames names query =
51+ show . Opaleye.ppSql . selectFrom names exprs <$> optimize primQuery
52+ where
53+ (exprs, primQuery, _) =
54+ Opaleye.runSimpleQueryArrStart (toOpaleye query) ()
55+
56+
57+optimize :: Opaleye.PrimQuery' a -> Maybe (Opaleye.PrimQuery' Void)
58+optimize = Opaleye.removeEmpty . Opaleye.optimize
59+
60+
61+selectFrom :: Selects names exprs
62+ => names -> exprs -> Opaleye.PrimQuery' Void -> Opaleye.Select
63+selectFrom (toColumns -> names) (toColumns . castTable -> exprs) query =
64+ Opaleye.SelectFrom $ Opaleye.newSelect
65+ { Opaleye.attrs = Opaleye.SelectAttrs attributes
66+ , Opaleye.tables = Opaleye.oneTable select
67+ }
68+ where
69+ select = Opaleye.foldPrimQuery Opaleye.sqlQueryGenerator query
70+ attributes = getConst $ htabulateA $ \field -> case hfield names field of
71+ N (Name name) -> case hfield exprs field of
72+ E (toPrimExpr -> expr) -> Const (pure (makeAttr name expr))
73+ makeAttr label expr =
74+ (Opaleye.sqlExpr expr, Just (Opaleye.SqlColumn label))
src/Rel8/Query/Set.hs+6−6
@@ -23,36 +23,36 @@ import Rel8.Table.Opaleye ( binaryspec )
23
23
24
24
25-- | Combine the results of two queries of the same type, collapsing
25-- | Combine the results of two queries of the same type, collapsing
26−-- duplicates. @union a b@ is the same as the SQL statement @a UNION b@.
26+-- duplicates. @union a b@ is the same as the SQL statement @x UNION b@.
27union :: EqTable a => Query a -> Query a -> Query a
27union :: EqTable a => Query a -> Query a -> Query a
28union = zipOpaleyeWith (Opaleye.unionExplicit binaryspec)
28union = zipOpaleyeWith (Opaleye.unionExplicit binaryspec)
29
29
30
30
31-- | Combine the results of two queries of the same type, retaining duplicates.
31-- | Combine the results of two queries of the same type, retaining duplicates.
32−-- @unionAll a b@ is the same as the SQL statement @a UNION ALL b@.
32+-- @unionAll a b@ is the same as the SQL statement @x UNION ALL b@.
33unionAll :: Table Expr a => Query a -> Query a -> Query a
33unionAll :: Table Expr a => Query a -> Query a -> Query a
34unionAll = zipOpaleyeWith (Opaleye.unionAllExplicit binaryspec)
34unionAll = zipOpaleyeWith (Opaleye.unionAllExplicit binaryspec)
35
35
36
36
37-- | Find the intersection of two queries, collapsing duplicates. @intersect a
37-- | Find the intersection of two queries, collapsing duplicates. @intersect a
38−-- b@ is the same as the SQL statement @a INTERSECT b@.
38+-- b@ is the same as the SQL statement @x INTERSECT b@.
39intersect :: EqTable a => Query a -> Query a -> Query a
39intersect :: EqTable a => Query a -> Query a -> Query a
40intersect = zipOpaleyeWith (Opaleye.intersectExplicit binaryspec)
40intersect = zipOpaleyeWith (Opaleye.intersectExplicit binaryspec)
41
41
42
42
43-- | Find the intersection of two queries, retaining duplicates. @intersectAll
43-- | Find the intersection of two queries, retaining duplicates. @intersectAll
44−-- a b@ is the same as the SQL statement @a INTERSECT ALL b@.
44+-- a b@ is the same as the SQL statement @x INTERSECT ALL b@.
45intersectAll :: EqTable a => Query a -> Query a -> Query a
45intersectAll :: EqTable a => Query a -> Query a -> Query a
46intersectAll = zipOpaleyeWith (Opaleye.intersectAllExplicit binaryspec)
46intersectAll = zipOpaleyeWith (Opaleye.intersectAllExplicit binaryspec)
47
47
48
48
49-- | Find the difference of two queries, collapsing duplicates @except a b@ is
49-- | Find the difference of two queries, collapsing duplicates @except a b@ is
50−-- the same as the SQL statement @a EXCEPT b@.
50+-- the same as the SQL statement @x INTERSECT b@.
51except :: EqTable a => Query a -> Query a -> Query a
51except :: EqTable a => Query a -> Query a -> Query a
52except = zipOpaleyeWith (Opaleye.exceptExplicit binaryspec)
52except = zipOpaleyeWith (Opaleye.exceptExplicit binaryspec)
53
53
54
54
55-- | Find the difference of two queries, retaining duplicates. @exceptAll a b@
55-- | Find the difference of two queries, retaining duplicates. @exceptAll a b@
56−-- is the same as the SQL statement @a EXCEPT ALL b@.
56+-- is the same as the SQL statement @x EXCEPT ALL b@.
57exceptAll :: EqTable a => Query a -> Query a -> Query a
57exceptAll :: EqTable a => Query a -> Query a -> Query a
58exceptAll = zipOpaleyeWith (Opaleye.exceptAllExplicit binaryspec)
58exceptAll = zipOpaleyeWith (Opaleye.exceptAllExplicit binaryspec)
src/Rel8/Query/These.hs+14−14
@@ -25,7 +25,7 @@ import qualified Opaleye.Internal.QueryArr as Opaleye
25import qualified Opaleye.Internal.Tag as Opaleye
25import qualified Opaleye.Internal.Tag as Opaleye
26
26
27-- rel8
27-- rel8
28−import Rel8.Expr ( Expr )
28+import Rel8.Expr ( Col( E ), Expr )
29import Rel8.Expr.Bool ( boolExpr, not_ )
29import Rel8.Expr.Bool ( boolExpr, not_ )
30import Rel8.Expr.Eq ( (==.) )
30import Rel8.Expr.Eq ( (==.) )
31import Rel8.Expr.Opaleye ( toPrimExpr, traversePrimExpr )
31import Rel8.Expr.Opaleye ( toPrimExpr, traversePrimExpr )
@@ -48,27 +48,27 @@ import Rel8.Type.Tag ( EitherTag( IsLeft, IsRight ) )
48alignBy :: ()
48alignBy :: ()
49 => (a -> b -> Expr Bool)
49 => (a -> b -> Expr Bool)
50 -> Query a -> Query b -> Query (TheseTable Expr a b)
50 -> Query a -> Query b -> Query (TheseTable Expr a b)
51−alignBy condition = zipOpaleyeWith $ \left right -> Opaleye.stateQueryArr $ \_ t -> case t of
51+alignBy condition = zipOpaleyeWith $ \left right -> Opaleye.QueryArr $ \i -> case i of
52− tag -> (tab, join', tag''')
52+ (_, tag) -> (tab, join', tag''')
53 where
53 where
54− (ma, left', tag') = Opaleye.runStateQueryArr (pure <$> left) () tag
54+ (ma, left', tag') = Opaleye.runSimpleQueryArr (pure <$> left) ((), tag)
55− (mb, right', tag'') = Opaleye.runStateQueryArr (pure <$> right) () tag'
55+ (mb, right', tag'') = Opaleye.runSimpleQueryArr (pure <$> right) ((), tag')
56− MaybeTable hasHere a = ma
56+ MaybeTable (E hasHere) a = ma
57− MaybeTable hasThere b = mb
57+ MaybeTable (E hasThere) b = mb
58 (hasHere', lbindings) = Opaleye.run $ do
58 (hasHere', lbindings) = Opaleye.run $ do
59 traversePrimExpr (Opaleye.extractAttr "hasHere" tag'') hasHere
59 traversePrimExpr (Opaleye.extractAttr "hasHere" tag'') hasHere
60 (hasThere', rbindings) = Opaleye.run $ do
60 (hasThere', rbindings) = Opaleye.run $ do
61 traversePrimExpr (Opaleye.extractAttr "hasThere" tag'') hasThere
61 traversePrimExpr (Opaleye.extractAttr "hasThere" tag'') hasThere
62 tag''' = Opaleye.next tag''
62 tag''' = Opaleye.next tag''
63− join = Opaleye.Join Opaleye.FullJoin on left'' right''
63+ join lateral = Opaleye.Join Opaleye.FullJoin on left'' right''
64 where
64 where
65 on = toPrimExpr $ condition (extract a) (extract b)
65 on = toPrimExpr $ condition (extract a) (extract b)
66− left'' = (Opaleye.NonLateral, Opaleye.toPrimQuery (left' <> Opaleye.aRebind lbindings))
66+ left'' = (lateral, Opaleye.Rebind True lbindings left')
67− right'' = (Opaleye.NonLateral, Opaleye.toPrimQuery (right' <> Opaleye.aRebind rbindings))
67+ right'' = (lateral, Opaleye.Rebind True rbindings right')
68− ma' = MaybeTable hasHere' a
68+ ma' = MaybeTable (E hasHere') a
69− mb' = MaybeTable hasThere' b
69+ mb' = MaybeTable (E hasThere') b
70 tab = TheseTable {here = ma', there = mb'}
70 tab = TheseTable {here = ma', there = mb'}
71− join' = Opaleye.aProduct join
71+ join' lateral input = Opaleye.times lateral input (join lateral)
72
72
73
73
74keepHereTable :: TheseTable Expr a b -> Query (a, MaybeTable Expr b)
74keepHereTable :: TheseTable Expr a b -> Query (a, MaybeTable Expr b)
@@ -120,7 +120,7 @@ keepThoseTable t@(TheseTable (MaybeTable _ a) (MaybeTable _ b)) = do
120loseThoseTable :: TheseTable Expr a b -> Query (EitherTable Expr a b)
120loseThoseTable :: TheseTable Expr a b -> Query (EitherTable Expr a b)
121loseThoseTable t@(TheseTable (MaybeTable _ a) (MaybeTable _ b)) = do
121loseThoseTable t@(TheseTable (MaybeTable _ a) (MaybeTable _ b)) = do
122 where_ $ not_ $ isThoseTable t
122 where_ $ not_ $ isThoseTable t
123− pure $ EitherTable tag a b
123+ pure $ EitherTable (E tag) a b
124 where
124 where
125 tag = boolExpr (litExpr IsLeft) (litExpr IsRight) (isThatTable t)
125 tag = boolExpr (litExpr IsLeft) (litExpr IsRight) (isThatTable t)
126
126
src/Rel8/Query/Window.hsdeleted−26
@@ -1,26 +0,0 @@
1−module Rel8.Query.Window
2− ( window
3− )
4−where
5−
6−-- base
7−import Prelude ()
8−
9−-- opaleye
10−import qualified Opaleye.Window as Opaleye
11−
12−-- rel8
13−import Rel8.Query ( Query )
14−import Rel8.Query.Opaleye ( mapOpaleye )
15−import Rel8.Window ( Window( Window ) )
16−
17−
18−-- | 'window' runs a query composed of expressions containing
19−-- [window functions](https://www.postgresql.org/docs/current/tutorial-window.html).
20−-- 'window' is similar to 'Rel8.aggregate', with the main difference being
21−-- that in a window query, each input row corresponds to one output row,
22−-- whereas aggregation queries fold the entire input query down into a single
23−-- row. To put this into a Haskell context, 'Rel8.aggregate' is to 'foldl' as
24−-- 'window' is to 'scanl'.
25−window :: Window a b -> Query a -> Query b
26−window (Window a) = mapOpaleye (Opaleye.runWindows a)
src/Rel8/Schema/Context.hsnew file+26
@@ -0,0 +1,26 @@
1+{-# language DataKinds #-}
2+{-# language StandaloneKindSignatures #-}
3+{-# language TypeFamilies #-}
4+
5+module Rel8.Schema.Context
6+ ( Interpretation( Col )
7+ , UnCol
8+ )
9+where
10+
11+-- base
12+import Data.Kind ( Constraint )
13+import Prelude ()
14+
15+-- rel8
16+import Rel8.Schema.Kind ( Context, HContext )
17+
18+
19+type Interpretation :: Context -> Constraint
20+class Interpretation context where
21+ data Col context :: HContext
22+
23+
24+type UnCol :: HContext -> Context
25+type family UnCol context where
26+ UnCol (Col context) = context
src/Rel8/Schema/Context/Nullify.hs+44−38
@@ -16,26 +16,28 @@ where
16
16
17-- base
17-- base
18import Data.Bool ( bool )
18import Data.Bool ( bool )
19−import Data.Functor.Identity ( Identity( Identity ) )
20import Data.Kind ( Constraint, Type )
19import Data.Kind ( Constraint, Type )
20+import Data.Monoid ( getFirst )
21import Prelude hiding ( null )
21import Prelude hiding ( null )
22
22
23-- opaleye
23-- opaleye
24import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
24import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
25
25
26-- rel8
26-- rel8
27−import Rel8.Aggregate ( Aggregate(..), zipOutputs )
27+import Rel8.Aggregate
28+ ( Col( A ), Aggregate( Aggregate )
29+ , foldInputs, mapInputs
30+ )
28−import Rel8.Expr ( Expr )
31+import Rel8.Expr ( Col( E ), Expr )
29import Rel8.Expr.Bool ( boolExpr )
32import Rel8.Expr.Bool ( boolExpr )
30import Rel8.Expr.Null ( nullify, unsafeUnnullify )
33import Rel8.Expr.Null ( nullify, unsafeUnnullify )
31−import Rel8.Expr.Opaleye ( fromPrimExpr )
34+import Rel8.Expr.Opaleye ( fromPrimExpr, toPrimExpr )
32import Rel8.Kind.Context ( SContext(..) )
35import Rel8.Kind.Context ( SContext(..) )
33−import Rel8.Schema.Field ( Field )
34import qualified Rel8.Schema.Kind as K
36import qualified Rel8.Schema.Kind as K
35−import Rel8.Schema.Name ( Name( Name ) )
37+import Rel8.Schema.Name ( Col( N ), Name( Name ) )
36import Rel8.Schema.Null ( Nullify, Nullity( Null, NotNull ) )
38import Rel8.Schema.Null ( Nullify, Nullity( Null, NotNull ) )
37−import Rel8.Schema.Result ( Result )
39+import Rel8.Schema.Result ( Col( R ), Result )
38−import Rel8.Schema.Spec ( Spec(..) )
40+import Rel8.Schema.Spec ( Spec( Spec ), SSpec(..) )
39
41
40
42
41type Nullifiability :: K.Context -> Type
43type Nullifiability :: K.Context -> Type
@@ -64,8 +66,7 @@ instance Nullifiable Name where
64
66
65type NonNullifiability :: K.Context -> Type
67type NonNullifiability :: K.Context -> Type
66data NonNullifiability context where
68data NonNullifiability context where
67− NField :: NonNullifiability (Field table)
68− NResult :: NonNullifiability Result
69+ NNResult :: NonNullifiability Result
69
70
70
71
71nullifiableOrNot :: ()
72nullifiableOrNot :: ()
@@ -74,9 +75,8 @@ nullifiableOrNot :: ()
74nullifiableOrNot = \case
75nullifiableOrNot = \case
75 SAggregate -> Right NAggregate
76 SAggregate -> Right NAggregate
76 SExpr -> Right NExpr
77 SExpr -> Right NExpr
77− SField -> Left NField
78 SName -> Right NName
78 SName -> Right NName
79− SResult -> Left NResult
79+ SResult -> Left NNResult
80
80
81
81
82absurd :: Nullifiability context -> NonNullifiability context -> a
82absurd :: Nullifiability context -> NonNullifiability context -> a
@@ -88,42 +88,48 @@ absurd = \case
88
88
89guarder :: ()
89guarder :: ()
90 => SContext context
90 => SContext context
91− -> context tag
91+ -> Col context ('Spec tag)
92 -> (tag -> Bool)
92 -> (tag -> Bool)
93 -> (Expr tag -> Expr Bool)
93 -> (Expr tag -> Expr Bool)
94− -> context (Maybe a)
94+ -> Col context ('Spec (Maybe a))
95− -> context (Maybe a)
95+ -> Col context ('Spec (Maybe a))
96−guarder = \case
97− SAggregate -> \tag _ isNonNull -> zipOutputs (sguard . isNonNull) tag
96+guarder SAggregate (A tag) _ isNonNull (A (Aggregate a)) =
97+ A $
98+ mapInputs (toPrimExpr . run . fromPrimExpr) $
99+ Aggregate $
100+ run <$> a
101+ where
102+ mtag = foldInputs (\_ -> pure . fromPrimExpr) tag
103+ run = maybe id (sguard . isNonNull) (getFirst mtag)
98− SExpr -> \tag _ isNonNull -> sguard (isNonNull tag)
104+guarder SExpr (E tag) _ isNonNull (E a) = E $ sguard condition a
99− SField -> \_ _ _ -> id
105+ where
106+ condition = isNonNull tag
100− SName -> \_ _ _ -> id
107+guarder SName _ _ _ name = name
101− SResult -> \(Identity tag) isNonNull _ (Identity a) ->
108+guarder SResult (R tag) isNonNull _ (R a) = R (bool Nothing a condition)
109+ where
102− Identity (bool Nothing a (isNonNull tag))
110+ condition = isNonNull tag
103
111
104
112
105nullifier :: ()
113nullifier :: ()
106 => Nullifiability context
114 => Nullifiability context
107− -> Spec a
115+ -> SSpec ('Spec a)
108− -> context a
116+ -> Col context ('Spec a)
109− -> context (Nullify a)
117+ -> Col context ('Spec (Nullify a))
110−nullifier = \case
111− NAggregate -> \Spec {nullity} (Aggregate a) ->
118+nullifier NAggregate SSpec {nullity} (A (Aggregate a)) =
112− Aggregate $ snullify nullity <$> a
119+ A $ Aggregate $ snullify nullity <$> a
113− NExpr -> \Spec {nullity} a -> snullify nullity a
120+nullifier NExpr SSpec {nullity} (E a) = E $ snullify nullity a
114− NName -> \_ (Name a) -> Name a
121+nullifier NName _ (N (Name a)) = N $ Name a
115
122
116
123
117unnullifier :: ()
124unnullifier :: ()
118 => Nullifiability context
125 => Nullifiability context
119− -> Spec a
126+ -> SSpec ('Spec a)
120− -> context (Nullify a)
127+ -> Col context ('Spec (Nullify a))
121− -> context a
128+ -> Col context ('Spec a)
122−unnullifier = \case
123− NAggregate -> \Spec {nullity} (Aggregate a) ->
129+unnullifier NAggregate SSpec {nullity} (A (Aggregate a)) =
124− Aggregate $ sunnullify nullity <$> a
130+ A $ Aggregate $ sunnullify nullity <$> a
125− NExpr -> \Spec {nullity} a -> sunnullify nullity a
131+unnullifier NExpr SSpec {nullity} (E a) = E $ sunnullify nullity a
126− NName -> \_ (Name a) -> Name a
132+unnullifier NName _ (N (Name a)) = N $ Name a
127
133
128
134
129sguard :: Expr Bool -> Expr (Maybe a) -> Expr (Maybe a)
135sguard :: Expr Bool -> Expr (Maybe a) -> Expr (Maybe a)
src/Rel8/Schema/Context/Virtual.hsnew file+70
@@ -0,0 +1,70 @@
1+{-# language EmptyCase #-}
2+{-# language DataKinds #-}
3+{-# language GADTs #-}
4+{-# language LambdaCase #-}
5+{-# language StandaloneKindSignatures #-}
6+{-# language TypeFamilies #-}
7+
8+module Rel8.Schema.Context.Virtual
9+ ( Virtual, virtual
10+ , Abstract(..), Concrete(..), abstractOrConcrete, absurd
11+ )
12+where
13+
14+-- base
15+import Data.Kind ( Constraint, Type )
16+import Prelude
17+
18+-- rel8
19+import Rel8.Aggregate ( Aggregate )
20+import Rel8.Expr ( Expr )
21+import Rel8.Kind.Context ( SContext(..) )
22+import qualified Rel8.Schema.Kind as K
23+import Rel8.Schema.Name ( Name )
24+import Rel8.Schema.Result ( Result )
25+
26+
27+type Virtual :: K.Context -> Constraint
28+class Virtual context where
29+ virtual :: Abstract context
30+
31+
32+instance Virtual Aggregate where
33+ virtual = VAggregate
34+
35+
36+instance Virtual Expr where
37+ virtual = VExpr
38+
39+
40+instance Virtual Name where
41+ virtual = VName
42+
43+
44+type Abstract :: K.Context -> Type
45+data Abstract context where
46+ VAggregate :: Abstract Aggregate
47+ VExpr :: Abstract Expr
48+ VName :: Abstract Name
49+
50+
51+type Concrete :: K.Context -> Type
52+data Concrete context where
53+ VResult :: Concrete Result
54+
55+
56+abstractOrConcrete :: ()
57+ => SContext context
58+ -> Either (Concrete context) (Abstract context)
59+abstractOrConcrete = \case
60+ SAggregate -> Right VAggregate
61+ SExpr -> Right VExpr
62+ SName -> Right VName
63+ SResult -> Left VResult
64+
65+
66+absurd :: Abstract context -> Concrete context -> a
67+absurd = \case
68+ VAggregate -> \case
69+ VExpr -> \case
70+ VName -> \case
src/Rel8/Schema/Field.hsdeleted−50
@@ -1,50 +0,0 @@
1−{-# language DataKinds #-}
2−{-# language FlexibleContexts #-}
3−{-# language MultiParamTypeClasses #-}
4−{-# language StandaloneKindSignatures #-}
5−{-# language TypeFamilies #-}
6−
7−module Rel8.Schema.Field
8− ( Field(..)
9− , fields
10− )
11−where
12−
13−-- base
14−import Data.Functor.Identity ( Identity( Identity ) )
15−import Data.Kind ( Type )
16−import Prelude
17−
18−-- rel8
19−import Rel8.Schema.HTable ( HField, htabulate )
20−import Rel8.Schema.HTable.Identity ( HIdentity( HIdentity ) )
21−import Rel8.Schema.Kind as K
22−import Rel8.Schema.Null ( Sql )
23−import Rel8.Table
24− ( Table, Columns, Context, fromColumns, toColumns
25− , FromExprs, fromResult, toResult
26− , Transpose
27− )
28−import Rel8.Table.Transpose ( Transposes )
29−import Rel8.Type ( DBType )
30−
31−
32−-- | A special context used in the construction of 'Rel8.Projection's.
33−type Field :: Type -> K.Context
34−newtype Field table a = Field (HField (Columns table) a)
35−
36−
37−instance Sql DBType a => Table (Field table) (Field table a) where
38− type Columns (Field table a) = HIdentity a
39− type Context (Field table a) = Field table
40− type FromExprs (Field table a) = a
41− type Transpose to (Field table a) = to a
42−
43− toColumns = HIdentity
44− fromColumns (HIdentity a) = a
45− toResult a = HIdentity (Identity a)
46− fromResult (HIdentity (Identity a)) = a
47−
48−
49−fields :: Transposes context (Field table) table fields => fields
50−fields = fromColumns $ htabulate Field
src/Rel8/Schema/HTable.hs+24−51
@@ -16,12 +16,11 @@
16module Rel8.Schema.HTable
16module Rel8.Schema.HTable
17 ( HTable (HField, HConstrainTable)
17 ( HTable (HField, HConstrainTable)
18 , hfield, htabulate, htraverse, hdicts, hspecs
18 , hfield, htabulate, htraverse, hdicts, hspecs
19− , hfoldMap, hmap, htabulateA, htraverseP, htraversePWithField
19+ , hmap, htabulateA
20 )
20 )
21where
21where
22
22
23-- base
23-- base
24−import Data.Functor.Const ( Const( Const ), getConst )
25import Data.Kind ( Constraint, Type )
24import Data.Kind ( Constraint, Type )
26import Data.Functor.Compose ( Compose( Compose ), getCompose )
25import Data.Functor.Compose ( Compose( Compose ), getCompose )
27import Data.Proxy ( Proxy )
26import Data.Proxy ( Proxy )
@@ -33,21 +32,16 @@ import GHC.Generics
33 )
32 )
34import Prelude
33import Prelude
35
34
36−-- profunctors
37−import Data.Profunctor ( rmap, Profunctor (lmap) )
38−
39−-- product-profunctors
40−import Data.Profunctor.Product ( ProductProfunctor ((****)) )
41−
42-- rel8
35-- rel8
43import Rel8.Schema.Dict ( Dict )
36import Rel8.Schema.Dict ( Dict )
44−import Rel8.Schema.Spec ( Spec )
37+import Rel8.Schema.Spec ( Spec, SSpec )
45import Rel8.Schema.HTable.Product ( HProduct( HProduct ) )
38import Rel8.Schema.HTable.Product ( HProduct( HProduct ) )
46import qualified Rel8.Schema.Kind as K
39import qualified Rel8.Schema.Kind as K
47
40
48-- semigroupoids
41-- semigroupoids
49import Data.Functor.Apply ( Apply, (<.>) )
42import Data.Functor.Apply ( Apply, (<.>) )
50
43
44+
51-- | A @HTable@ is a functor-indexed/higher-kinded data type that is
45-- | A @HTable@ is a functor-indexed/higher-kinded data type that is
52-- representable ('htabulate'/'hfield'), constrainable ('hdicts'), and
46-- representable ('htabulate'/'hfield'), constrainable ('hdicts'), and
53-- specified ('hspecs').
47-- specified ('hspecs').
@@ -56,14 +50,14 @@ import Data.Functor.Apply ( Apply, (<.>) )
56-- instances yourself or specify this constraint.
50-- instances yourself or specify this constraint.
57type HTable :: K.HTable -> Constraint
51type HTable :: K.HTable -> Constraint
58class HTable t where
52class HTable t where
59− type HField t = (field :: Type -> Type) | field -> t
53+ type HField t = (field :: Spec -> Type) | field -> t
60− type HConstrainTable t (c :: Type -> Constraint) :: Constraint
54+ type HConstrainTable t (c :: Spec -> Constraint) :: Constraint
61
55
62− hfield :: t context -> HField t a -> context a
56+ hfield :: t context -> HField t spec -> context spec
63− htabulate :: (forall a. HField t a -> context a) -> t context
57+ htabulate :: (forall spec. HField t spec -> context spec) -> t context
64− htraverse :: Apply m => (forall a. f a -> m (g a)) -> t f -> m (t g)
58+ htraverse :: Apply m => (forall spec. f spec -> m (g spec)) -> t f -> m (t g)
65 hdicts :: HConstrainTable t c => t (Dict c)
59 hdicts :: HConstrainTable t c => t (Dict c)
66− hspecs :: t Spec
60+ hspecs :: t SSpec
67
61
68 type HField t = GHField t
62 type HField t = GHField t
69 type HConstrainTable t c = HConstrainTable (GHColumns (Rep (t Proxy))) c
63 type HConstrainTable t c = HConstrainTable (GHColumns (Rep (t Proxy))) c
@@ -74,7 +68,7 @@ class HTable t where
74 , HField (GHColumns (Rep (t Proxy))) ~ HField (GHColumns (Rep (t context)))
68 , HField (GHColumns (Rep (t Proxy))) ~ HField (GHColumns (Rep (t context)))
75 , GHTable context (Rep (t context))
69 , GHTable context (Rep (t context))
76 )
70 )
77− => t context -> HField t a -> context a
71+ => t context -> HField t spec -> context spec
78 hfield table (GHField field) = hfield (toGHColumns (from table)) field
72 hfield table (GHField field) = hfield (toGHColumns (from table)) field
79
73
80 default htabulate ::
74 default htabulate ::
@@ -83,7 +77,7 @@ class HTable t where
83 , HField (GHColumns (Rep (t Proxy))) ~ HField (GHColumns (Rep (t context)))
77 , HField (GHColumns (Rep (t Proxy))) ~ HField (GHColumns (Rep (t context)))
84 , GHTable context (Rep (t context))
78 , GHTable context (Rep (t context))
85 )
79 )
86− => (forall a. HField t a -> context a) -> t context
80+ => (forall spec. HField t spec -> context spec) -> t context
87 htabulate f = to $ fromGHColumns $ htabulate (f . GHField)
81 htabulate f = to $ fromGHColumns $ htabulate (f . GHField)
88
82
89 default htraverse
83 default htraverse
@@ -93,7 +87,7 @@ class HTable t where
93 , Generic (t g), GHTable g (Rep (t g))
87 , Generic (t g), GHTable g (Rep (t g))
94 , GHColumns (Rep (t f)) ~ GHColumns (Rep (t g))
88 , GHColumns (Rep (t f)) ~ GHColumns (Rep (t g))
95 )
89 )
96− => (forall a. f a -> m (g a)) -> t f -> m (t g)
90+ => (forall spec. f spec -> m (g spec)) -> t f -> m (t g)
97 htraverse f = fmap (to . fromGHColumns) . htraverse f . toGHColumns . from
91 htraverse f = fmap (to . fromGHColumns) . htraverse f . toGHColumns . from
98
92
99 default hdicts
93 default hdicts
@@ -107,10 +101,10 @@ class HTable t where
107 hdicts = to $ fromGHColumns (hdicts @(GHColumns (Rep (t Proxy))) @c)
101 hdicts = to $ fromGHColumns (hdicts @(GHColumns (Rep (t Proxy))) @c)
108
102
109 default hspecs ::
103 default hspecs ::
110− ( Generic (t Spec)
104+ ( Generic (t SSpec)
111− , GHTable Spec (Rep (t Spec))
105+ , GHTable SSpec (Rep (t SSpec))
112 )
106 )
113− => t Spec
107+ => t SSpec
114 hspecs = to $ fromGHColumns hspecs
108 hspecs = to $ fromGHColumns hspecs
115
109
116 {-# INLINABLE hfield #-}
110 {-# INLINABLE hfield #-}
@@ -120,43 +114,22 @@ class HTable t where
120 {-# INLINABLE hspecs #-}
114 {-# INLINABLE hspecs #-}
121
115
122
116
123−hfoldMap :: (HTable t, Semigroup s)
124− => (forall a. context a -> s) -> t context -> s
125−hfoldMap f a = getConst $ htraverse (Const . f) a
126−
127−
128hmap :: HTable t
117hmap :: HTable t
129− => (forall a. context a -> context' a) -> t context -> t context'
118+ => (forall spec. context spec -> context' spec) -> t context -> t context'
130hmap f a = htabulate $ \field -> f (hfield a field)
119hmap f a = htabulate $ \field -> f (hfield a field)
131
120
132
121
133htabulateA :: (HTable t, Apply m)
122htabulateA :: (HTable t, Apply m)
134− => (forall a. HField t a -> m (context a)) -> m (t context)
123+ => (forall spec. HField t spec -> m (context spec)) -> m (t context)
135htabulateA f = htraverse getCompose $ htabulate $ Compose . f
124htabulateA f = htraverse getCompose $ htabulate $ Compose . f
136{-# INLINABLE htabulateA #-}
125{-# INLINABLE htabulateA #-}
137
126
138−newtype ApplyP p a b = ApplyP { unApplyP :: p a b }
139−
140−instance Profunctor p => Functor (ApplyP p a) where
141− fmap f = ApplyP . rmap f . unApplyP
142−
143−instance ProductProfunctor p => Apply (ApplyP p a) where
144− ApplyP f <.> ApplyP x = ApplyP (rmap id f **** x)
145−
146−htraverseP :: (HTable t, ProductProfunctor p)
147− => (forall a. p (f a) (g a)) -> p (t f) (t g)
148−htraverseP f = htraversePWithField (const f)
149−
150−htraversePWithField :: (HTable t, ProductProfunctor p)
151− => (forall a. HField t a -> p (f a) (g a)) -> p (t f) (t g)
152−htraversePWithField f = unApplyP $ htabulateA $ \field -> ApplyP $
153− lmap (flip hfield field) (f field)
154
127
155−type GHField :: K.HTable -> Type -> Type
128+type GHField :: K.HTable -> Spec -> Type
156−newtype GHField t a = GHField (HField (GHColumns (Rep (t Proxy))) a)
129+newtype GHField t spec = GHField (HField (GHColumns (Rep (t Proxy))) spec)
157
130
158
131
159−type GHTable :: K.Context -> (Type -> Type) -> Constraint
132+type GHTable :: K.HContext -> (Type -> Type) -> Constraint
160class HTable (GHColumns rep) => GHTable context rep | rep -> context where
133class HTable (GHColumns rep) => GHTable context rep | rep -> context where
161 type GHColumns rep :: K.HTable
134 type GHColumns rep :: K.HTable
162 toGHColumns :: rep x -> GHColumns rep context
135 toGHColumns :: rep x -> GHColumns rep context
@@ -182,10 +155,10 @@ instance (GHTable context a, GHTable context b) => GHTable context (a :*: b) whe
182
155
183
156
184-- | A HField type for indexing into HProduct.
157-- | A HField type for indexing into HProduct.
185−type HProductField :: K.HTable -> K.HTable -> Type -> Type
158+type HProductField :: K.HTable -> K.HTable -> Spec -> Type
186−data HProductField x y a
159+data HProductField x y spec
187− = HFst (HField x a)
160+ = HFst (HField x spec)
188− | HSnd (HField y a)
161+ | HSnd (HField y spec)
189
162
190
163
191instance (HTable x, HTable y) => HTable (HProduct x y) where
164instance (HTable x, HTable y) => HTable (HProduct x y) where
src/Rel8/Schema/HTable/Either.hs+2−2
@@ -15,7 +15,7 @@ import Prelude ()
15
15
16-- rel8
16-- rel8
17import Rel8.Schema.HTable ( HTable )
17import Rel8.Schema.HTable ( HTable )
18−import Rel8.Schema.HTable.Identity ( HIdentity )
18+import Rel8.Schema.HTable.Identity ( HType )
19import Rel8.Schema.HTable.Label ( HLabel )
19import Rel8.Schema.HTable.Label ( HLabel )
20import Rel8.Schema.HTable.Nullify ( HNullify )
20import Rel8.Schema.HTable.Nullify ( HNullify )
21import qualified Rel8.Schema.Kind as K
21import qualified Rel8.Schema.Kind as K
@@ -24,7 +24,7 @@ import Rel8.Type.Tag ( EitherTag )
24
24
25type HEitherTable :: K.HTable -> K.HTable -> K.HTable
25type HEitherTable :: K.HTable -> K.HTable -> K.HTable
26data HEitherTable left right context = HEitherTable
26data HEitherTable left right context = HEitherTable
27− { htag :: HLabel "isRight" (HIdentity EitherTag) context
27+ { htag :: HLabel "isRight" (HType EitherTag) context
28 , hleft :: HLabel "Left" (HNullify left) context
28 , hleft :: HLabel "Left" (HNullify left) context
29 , hright :: HLabel "Right" (HNullify right) context
29 , hright :: HLabel "Right" (HNullify right) context
30 }
30 }
src/Rel8/Schema/HTable/Identity.hs+28−16
@@ -1,17 +1,17 @@
1{-# language DataKinds #-}
1{-# language DataKinds #-}
2−{-# language FlexibleContexts #-}
2+{-# language GADTs #-}
3+{-# language PatternSynonyms #-}
3{-# language StandaloneKindSignatures #-}
4{-# language StandaloneKindSignatures #-}
4{-# language TypeFamilies #-}
5{-# language TypeFamilies #-}
5−{-# language UndecidableInstances #-}
6
6
7module Rel8.Schema.HTable.Identity
7module Rel8.Schema.HTable.Identity
8− ( HIdentity( HIdentity, unHIdentity )
8+ ( HIdentity( HIdentity, HType, unHIdentity )
9+ , HType
9 )
10 )
10where
11where
11
12
12-- base
13-- base
13import Data.Kind ( Type )
14import Data.Kind ( Type )
14−import Data.Type.Equality ( (:~:)( Refl ) )
15import Prelude
15import Prelude
16
16
17-- rel8
17-- rel8
@@ -21,23 +21,35 @@ import Rel8.Schema.HTable
21 , hfield, htabulate, htraverse, hdicts, hspecs
21 , hfield, htabulate, htraverse, hdicts, hspecs
22 )
22 )
23import qualified Rel8.Schema.Kind as K
23import qualified Rel8.Schema.Kind as K
24−import Rel8.Schema.Null ( Sql )
24+import Rel8.Schema.Spec ( Spec( Spec ), KnownSpec, specSing )
25−import Rel8.Schema.Spec ( specification )
26−import Rel8.Type ( DBType )
27
25
28
26
29−type HIdentity :: Type -> K.HTable
27+type HType :: Type -> K.HTable
28+type HType a = HIdentity ('Spec a)
29+
30+
31+pattern HType :: context ('Spec a) -> HType a context
32+pattern HType a = HIdentity a
33+{-# COMPLETE HType #-}
34+
35+
36+type HIdentity :: Spec -> K.HTable
30−newtype HIdentity a context = HIdentity
37+newtype HIdentity spec context = HIdentity
31− { unHIdentity :: context a
38+ { unHIdentity :: context spec
32 }
39 }
33
40
34
41
42+type HIdentityField :: Spec -> Spec -> Type
43+data HIdentityField _spec spec where
44+ HIdentityField :: HIdentityField spec spec
45+
46+
35−instance Sql DBType a => HTable (HIdentity a) where
47+instance KnownSpec spec => HTable (HIdentity spec) where
36− type HConstrainTable (HIdentity a) constraint = constraint a
48+ type HConstrainTable (HIdentity spec) c = c spec
37− type HField (HIdentity a) = (:~:) a
49+ type HField (HIdentity spec) = HIdentityField spec
38
50
39− hfield (HIdentity a) Refl = a
51+ hfield (HIdentity a) HIdentityField = a
40− htabulate f = HIdentity $ f Refl
52+ htabulate f = HIdentity $ f HIdentityField
41 htraverse f (HIdentity a) = HIdentity <$> f a
53 htraverse f (HIdentity a) = HIdentity <$> f a
42 hdicts = HIdentity Dict
54 hdicts = HIdentity Dict
43− hspecs = HIdentity specification
55+ hspecs = HIdentity specSing
src/Rel8/Schema/HTable/Label.hs+4−15
@@ -1,5 +1,4 @@
1{-# language DataKinds #-}
1{-# language DataKinds #-}
2−{-# language RankNTypes #-}
3{-# language RecordWildCards #-}
2{-# language RecordWildCards #-}
4{-# language ScopedTypeVariables #-}
3{-# language ScopedTypeVariables #-}
5{-# language StandaloneKindSignatures #-}
4{-# language StandaloneKindSignatures #-}
@@ -8,7 +7,6 @@
8
7
9module Rel8.Schema.HTable.Label
8module Rel8.Schema.HTable.Label
10 ( HLabel, hlabel, hrelabel, hunlabel
9 ( HLabel, hlabel, hrelabel, hunlabel
11− , hproject
12 )
10 )
13where
11where
14
12
@@ -20,19 +18,16 @@ import Prelude
20
18
21-- rel8
19-- rel8
22import Rel8.Schema.HTable
20import Rel8.Schema.HTable
23− ( HTable, HConstrainTable, HField
24− , htabulate, hfield, htraverse, hdicts, hspecs
25− )
26import qualified Rel8.Schema.Kind as K
21import qualified Rel8.Schema.Kind as K
27−import Rel8.Schema.Spec ( Spec(..) )
22+import Rel8.Schema.Spec ( Spec, SSpec(..) )
28
23
29
24
30type HLabel :: Symbol -> K.HTable -> K.HTable
25type HLabel :: Symbol -> K.HTable -> K.HTable
31newtype HLabel label table context = HLabel (table context)
26newtype HLabel label table context = HLabel (table context)
32
27
33
28
34−type HLabelField :: Symbol -> K.HTable -> Type -> Type
29+type HLabelField :: Symbol -> K.HTable -> Spec -> Type
35−newtype HLabelField label table a = HLabelField (HField table a)
30+newtype HLabelField label table spec = HLabelField (HField table spec)
36
31
37
32
38instance (HTable table, KnownSymbol label) => HTable (HLabel label table) where
33instance (HTable table, KnownSymbol label) => HTable (HLabel label table) where
@@ -45,7 +40,7 @@ instance (HTable table, KnownSymbol label) => HTable (HLabel label table) where
45 htraverse f (HLabel a) = HLabel <$> htraverse f a
40 htraverse f (HLabel a) = HLabel <$> htraverse f a
46 hdicts = HLabel (hdicts @table)
41 hdicts = HLabel (hdicts @table)
47 hspecs = HLabel $ htabulate $ \field -> case hfield (hspecs @table) field of
42 hspecs = HLabel $ htabulate $ \field -> case hfield (hspecs @table) field of
48− Spec {..} -> Spec {labels = symbolVal (Proxy @label) : labels, ..}
43+ SSpec {..} -> SSpec {labels = symbolVal (Proxy @label) : labels, ..}
49 {-# INLINABLE hspecs #-}
44 {-# INLINABLE hspecs #-}
50
45
51
46
@@ -62,9 +57,3 @@ hrelabel = hlabel . hunlabel
62hunlabel :: forall label t context. HLabel label t context -> t context
57hunlabel :: forall label t context. HLabel label t context -> t context
63hunlabel (HLabel a) = a
58hunlabel (HLabel a) = a
64{-# INLINABLE hunlabel #-}
59{-# INLINABLE hunlabel #-}
65−
66−
67−hproject :: ()
68− => (forall ctx. t ctx -> t' ctx)
69− -> HLabel label t context -> HLabel label t' context
70−hproject f (HLabel a) = HLabel (f a)
src/Rel8/Schema/HTable/MapTable.hs+12−22
@@ -6,7 +6,7 @@
6{-# language GADTs #-}
6{-# language GADTs #-}
7{-# language InstanceSigs #-}
7{-# language InstanceSigs #-}
8{-# language MultiParamTypeClasses #-}
8{-# language MultiParamTypeClasses #-}
9−{-# language RankNTypes #-}
9+{-# language PolyKinds #-}
10{-# language ScopedTypeVariables #-}
10{-# language ScopedTypeVariables #-}
11{-# language StandaloneKindSignatures #-}
11{-# language StandaloneKindSignatures #-}
12{-# language TypeApplications #-}
12{-# language TypeApplications #-}
@@ -19,38 +19,34 @@ module Rel8.Schema.HTable.MapTable
19 , MapSpec(..)
19 , MapSpec(..)
20 , Precompose(..)
20 , Precompose(..)
21 , HMapTableField(..)
21 , HMapTableField(..)
22− , hproject
23 )
22 )
24where
23where
25
24
26-- base
25-- base
27import Data.Kind ( Constraint, Type )
26import Data.Kind ( Constraint, Type )
28−import Prelude
27+import Prelude ( ($), (.), (<$>), fmap )
29
28
30-- rel8
29-- rel8
31−import Rel8.FCF ( Exp, Eval )
30+import Rel8.FCF
32import Rel8.Schema.HTable
31import Rel8.Schema.HTable
33− ( HTable, HConstrainTable, HField
34− , hfield, htabulate, htraverse, hdicts, hspecs
35− )
36−import Rel8.Schema.Spec ( Spec )
32+import Rel8.Schema.Spec ( Spec, SSpec )
37import qualified Rel8.Schema.Kind as K
33import qualified Rel8.Schema.Kind as K
38import Rel8.Schema.Dict ( Dict( Dict ) )
34import Rel8.Schema.Dict ( Dict( Dict ) )
39
35
40
36
41−type HMapTable :: (Type -> Exp Type) -> K.HTable -> K.HTable
37+type HMapTable :: (a -> Exp b) -> ((a -> Type) -> Type) -> (b -> Type) -> Type
42−newtype HMapTable f t context = HMapTable
38+newtype HMapTable f t g = HMapTable
43− { unHMapTable :: t (Precompose f context)
39+ { unHMapTable :: t (Precompose f g)
44 }
40 }
45
41
46
42
47−type Precompose :: (Type -> Exp Type) -> K.Context -> K.Context
43+type Precompose :: (a -> Exp b) -> (b -> Type) -> a -> Type
48newtype Precompose f g x = Precompose
44newtype Precompose f g x = Precompose
49 { precomposed :: g (Eval (f x))
45 { precomposed :: g (Eval (f x))
50 }
46 }
51
47
52
48
53−type HMapTableField :: (Type -> Exp Type) -> K.HTable -> K.Context
49+type HMapTableField :: (Spec -> Exp a) -> K.HTable -> a -> Type
54data HMapTableField f t x where
50data HMapTableField f t x where
55 HMapTableField :: HField t a -> HMapTableField f t (Eval (f a))
51 HMapTableField :: HField t a -> HMapTableField f t (Eval (f a))
56
52
@@ -83,17 +79,11 @@ instance (HTable t, MapSpec f) => HTable (HMapTable f t) where
83 {-# INLINABLE hspecs #-}
79 {-# INLINABLE hspecs #-}
84
80
85
81
86−type MapSpec :: (Type -> Exp Type) -> Constraint
82+type MapSpec :: (Spec -> Exp Spec) -> Constraint
87class MapSpec f where
83class MapSpec f where
88− mapInfo :: Spec x -> Spec (Eval (f x))
84+ mapInfo :: SSpec x -> SSpec (Eval (f x))
89
85
90
86
91−type ComposeConstraint :: (Type -> Exp Type) -> (Type -> Constraint) -> Type -> Constraint
87+type ComposeConstraint :: (a -> Exp b) -> (b -> Constraint) -> a -> Constraint
92class c (Eval (f a)) => ComposeConstraint f c a
88class c (Eval (f a)) => ComposeConstraint f c a
93instance c (Eval (f a)) => ComposeConstraint f c a
89instance c (Eval (f a)) => ComposeConstraint f c a
94−
95−
96−hproject :: ()
97− => (forall ctx. t ctx -> t' ctx)
98− -> HMapTable f t context -> HMapTable f t' context
99−hproject f (HMapTable a) = HMapTable (f a)
src/Rel8/Schema/HTable/Maybe.hs+2−2
@@ -15,7 +15,7 @@ import Prelude
15
15
16-- rel8
16-- rel8
17import Rel8.Schema.HTable ( HTable )
17import Rel8.Schema.HTable ( HTable )
18−import Rel8.Schema.HTable.Identity ( HIdentity )
18+import Rel8.Schema.HTable.Identity ( HType )
19import Rel8.Schema.HTable.Label ( HLabel )
19import Rel8.Schema.HTable.Label ( HLabel )
20import Rel8.Schema.HTable.Nullify ( HNullify )
20import Rel8.Schema.HTable.Nullify ( HNullify )
21import qualified Rel8.Schema.Kind as K
21import qualified Rel8.Schema.Kind as K
@@ -24,7 +24,7 @@ import Rel8.Type.Tag ( MaybeTag )
24
24
25type HMaybeTable :: K.HTable -> K.HTable
25type HMaybeTable :: K.HTable -> K.HTable
26data HMaybeTable table context = HMaybeTable
26data HMaybeTable table context = HMaybeTable
27− { htag :: HLabel "isJust" (HIdentity (Maybe MaybeTag)) context
27+ { htag :: HLabel "isJust" (HType (Maybe MaybeTag)) context
28 , hjust :: HLabel "Just" (HNullify table) context
28 , hjust :: HLabel "Just" (HNullify table) context
29 }
29 }
30 deriving stock Generic
30 deriving stock Generic
src/Rel8/Schema/HTable/Nullify.hs+24−22
@@ -23,12 +23,10 @@ module Rel8.Schema.HTable.Nullify
23 , hnulls
23 , hnulls
24 , hnullify
24 , hnullify
25 , hunnullify
25 , hunnullify
26− , hproject
27 )
26 )
28where
27where
29
28
30-- base
29-- base
31−import Data.Kind ( Type )
32import GHC.Generics ( Generic )
30import GHC.Generics ( Generic )
33import Prelude hiding ( null )
31import Prelude hiding ( null )
34
32
@@ -39,11 +37,10 @@ import Rel8.Schema.HTable.MapTable
39 ( HMapTable, HMapTableField( HMapTableField )
37 ( HMapTable, HMapTableField( HMapTableField )
40 , MapSpec, mapInfo
38 , MapSpec, mapInfo
41 )
39 )
42−import qualified Rel8.Schema.HTable.MapTable as HMapTable ( hproject )
43import qualified Rel8.Schema.Kind as K
40import qualified Rel8.Schema.Kind as K
44import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
41import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
45import qualified Rel8.Schema.Null as Type ( Nullify )
42import qualified Rel8.Schema.Null as Type ( Nullify )
46−import Rel8.Schema.Spec ( Spec(..) )
43+import Rel8.Schema.Spec ( Spec( Spec ), SSpec(..) )
47
44
48-- semigroupoids
45-- semigroupoids
49import Data.Functor.Apply ( Apply )
46import Data.Functor.Apply ( Apply )
@@ -55,14 +52,17 @@ newtype HNullify table context = HNullify (HMapTable Nullify table context)
55 deriving anyclass HTable
52 deriving anyclass HTable
56
53
57
54
58−-- | Transform a 'Type' by allowing it to be @null@.
55+-- | Transform a 'Spec' by allowing it to be @null@.
59−data Nullify :: Type -> Exp Type
56+data Nullify :: Spec -> Exp Spec
57+
58+
60−type instance Eval (Nullify a) = Type.Nullify a
59+type instance Eval (Nullify ('Spec a)) =
60+ 'Spec (Type.Nullify a)
61
61
62
62
63instance MapSpec Nullify where
63instance MapSpec Nullify where
64 mapInfo = \case
64 mapInfo = \case
65− Spec {nullity, ..} -> Spec
65+ SSpec {nullity, ..} -> SSpec
66 { nullity = case nullity of
66 { nullity = case nullity of
67 Null -> Null
67 Null -> Null
68 NotNull -> Null
68 NotNull -> Null
@@ -71,47 +71,49 @@ instance MapSpec Nullify where
71
71
72
72
73hguard :: HTable t
73hguard :: HTable t
74− => (forall a. context (Maybe a) -> context (Maybe a))
74+ => (forall a. context ('Spec (Maybe a)) -> context ('Spec (Maybe a)))
75 -> HNullify t context -> HNullify t context
75 -> HNullify t context -> HNullify t context
76hguard guarder (HNullify as) = HNullify $ htabulate $ \(HMapTableField field) ->
76hguard guarder (HNullify as) = HNullify $ htabulate $ \(HMapTableField field) ->
77 case hfield hspecs field of
77 case hfield hspecs field of
78− Spec {nullity} -> case hfield as (HMapTableField field) of
78+ SSpec {nullity} -> case hfield as (HMapTableField field) of
79 a -> case nullity of
79 a -> case nullity of
80 Null -> guarder a
80 Null -> guarder a
81 NotNull -> guarder a
81 NotNull -> guarder a
82
82
83
83
84hnulls :: HTable t
84hnulls :: HTable t
85+ => (forall a. ()
86+ => SSpec ('Spec a)
85− => (forall a. Spec a -> context (Type.Nullify a))
87+ -> context ('Spec (Type.Nullify a)))
86 -> HNullify t context
88 -> HNullify t context
87hnulls null = HNullify $ htabulate $ \(HMapTableField field) ->
89hnulls null = HNullify $ htabulate $ \(HMapTableField field) ->
88 case hfield hspecs field of
90 case hfield hspecs field of
89− spec@Spec {} -> null spec
91+ spec@SSpec {} -> null spec
90{-# INLINABLE hnulls #-}
92{-# INLINABLE hnulls #-}
91
93
92
94
93hnullify :: HTable t
95hnullify :: HTable t
96+ => (forall a. ()
97+ => SSpec ('Spec a)
98+ -> context ('Spec a)
94− => (forall a. Spec a -> context a -> context (Type.Nullify a))
99+ -> context ('Spec (Type.Nullify a)))
95 -> t context
100 -> t context
96 -> HNullify t context
101 -> HNullify t context
97hnullify nullifier a = HNullify $ htabulate $ \(HMapTableField field) ->
102hnullify nullifier a = HNullify $ htabulate $ \(HMapTableField field) ->
98 case hfield hspecs field of
103 case hfield hspecs field of
99− spec@Spec {} -> nullifier spec (hfield a field)
104+ spec@SSpec {} -> nullifier spec (hfield a field)
100{-# INLINABLE hnullify #-}
105{-# INLINABLE hnullify #-}
101
106
102
107
103hunnullify :: (HTable t, Apply m)
108hunnullify :: (HTable t, Apply m)
109+ => (forall a. ()
110+ => SSpec ('Spec a)
104− => (forall a. Spec a -> context (Type.Nullify a) -> m (context a))
111+ -> context ('Spec (Type.Nullify a))
112+ -> m (context ('Spec a)))
105 -> HNullify t context
113 -> HNullify t context
106 -> m (t context)
114 -> m (t context)
107hunnullify unnullifier (HNullify as) =
115hunnullify unnullifier (HNullify as) =
108 htabulateA $ \field -> case hfield hspecs field of
116 htabulateA $ \field -> case hfield hspecs field of
109− spec@Spec {} -> case hfield as (HMapTableField field) of
117+ spec@SSpec {} -> case hfield as (HMapTableField field) of
110 a -> unnullifier spec a
118 a -> unnullifier spec a
111{-# INLINABLE hunnullify #-}
119{-# INLINABLE hunnullify #-}
112−
113−
114−hproject :: ()
115− => (forall ctx. t ctx -> t' ctx)
116− -> HNullify t context -> HNullify t' context
117−hproject f (HNullify a) = HNullify (HMapTable.hproject f a)
src/Rel8/Schema/HTable/These.hs+3−3
@@ -15,7 +15,7 @@ import Prelude
15
15
16-- rel8
16-- rel8
17import Rel8.Schema.HTable ( HTable )
17import Rel8.Schema.HTable ( HTable )
18−import Rel8.Schema.HTable.Identity ( HIdentity )
18+import Rel8.Schema.HTable.Identity ( HType )
19import Rel8.Schema.HTable.Label ( HLabel )
19import Rel8.Schema.HTable.Label ( HLabel )
20import Rel8.Schema.HTable.Nullify ( HNullify )
20import Rel8.Schema.HTable.Nullify ( HNullify )
21import qualified Rel8.Schema.Kind as K
21import qualified Rel8.Schema.Kind as K
@@ -24,9 +24,9 @@ import Rel8.Type.Tag ( MaybeTag )
24
24
25type HTheseTable :: K.HTable -> K.HTable -> K.HTable
25type HTheseTable :: K.HTable -> K.HTable -> K.HTable
26data HTheseTable here there context = HTheseTable
26data HTheseTable here there context = HTheseTable
27− { hhereTag :: HLabel "hereTag" (HIdentity (Maybe MaybeTag)) context
27+ { hhereTag :: HLabel "hereTag" (HType (Maybe MaybeTag)) context
28 , hhere :: HLabel "Here" (HNullify here) context
28 , hhere :: HLabel "Here" (HNullify here) context
29− , hthereTag :: HLabel "thereTag" (HIdentity (Maybe MaybeTag)) context
29+ , hthereTag :: HLabel "thereTag" (HType (Maybe MaybeTag)) context
30 , hthere :: HLabel "There" (HNullify there) context
30 , hthere :: HLabel "There" (HNullify there) context
31 }
31 }
32 deriving stock Generic
32 deriving stock Generic
src/Rel8/Schema/HTable/Vectorize.hs+40−39
@@ -9,6 +9,7 @@
9{-# language GADTs #-}
9{-# language GADTs #-}
10{-# language LambdaCase #-}
10{-# language LambdaCase #-}
11{-# language MultiParamTypeClasses #-}
11{-# language MultiParamTypeClasses #-}
12+{-# language NamedFieldPuns #-}
12{-# language RankNTypes #-}
13{-# language RankNTypes #-}
13{-# language RecordWildCards #-}
14{-# language RecordWildCards #-}
14{-# language ScopedTypeVariables #-}
15{-# language ScopedTypeVariables #-}
@@ -21,39 +22,33 @@ module Rel8.Schema.HTable.Vectorize
21 ( HVectorize
22 ( HVectorize
22 , hvectorize, hunvectorize
23 , hvectorize, hunvectorize
23 , happend, hempty
24 , happend, hempty
24− , hproject
25− , hcolumn
26 )
25 )
27where
26where
28
27
29-- base
28-- base
30−import Data.Kind ( Constraint, Type )
29+import Data.Kind ( Type )
31import Data.List.NonEmpty ( NonEmpty )
30import Data.List.NonEmpty ( NonEmpty )
32−import GHC.Generics (Generic)
33import Prelude
31import Prelude
34
32
35-- rel8
33-- rel8
36−import Rel8.FCF ( Eval, Exp )
37import Rel8.Schema.Dict ( Dict( Dict ) )
34import Rel8.Schema.Dict ( Dict( Dict ) )
38import qualified Rel8.Schema.Kind as K
35import qualified Rel8.Schema.Kind as K
36+import Rel8.Schema.HTable
37+ ( HTable
39−import Rel8.Schema.HTable ( HTable, hfield, htabulate, htabulateA, hspecs )
38+ , hfield, htabulate, htabulateA, hspecs
40−import Rel8.Schema.HTable.Identity ( HIdentity( HIdentity ) )
41−import Rel8.Schema.HTable.MapTable
42− ( HMapTable( HMapTable ), HMapTableField( HMapTableField )
43− , MapSpec, mapInfo
44− , Precompose( Precompose )
45 )
39 )
46−import qualified Rel8.Schema.HTable.MapTable as HMapTable ( hproject )
47import Rel8.Schema.Null ( Unnullify, NotNull, Nullity( NotNull ) )
40import Rel8.Schema.Null ( Unnullify, NotNull, Nullity( NotNull ) )
48−import Rel8.Schema.Spec ( Spec(..) )
41+import Rel8.Schema.Spec ( Spec( Spec ), SSpec(..) )
49import Rel8.Type.Array ( listTypeInformation, nonEmptyTypeInformation )
42import Rel8.Type.Array ( listTypeInformation, nonEmptyTypeInformation )
50import Rel8.Type.Information ( TypeInformation )
43import Rel8.Type.Information ( TypeInformation )
51
44
52-- semialign
45-- semialign
53import Data.Zip ( Unzip, Zip, Zippy(..) )
46import Data.Zip ( Unzip, Zip, Zippy(..) )
47+import Rel8.FCF
48+import Rel8.Schema.HTable.MapTable
49+import GHC.Generics (Generic)
54
50
55
51
56−type Vector :: (Type -> Type) -> Constraint
57class Vector list where
52class Vector list where
58 listNotNull :: proxy a -> Dict NotNull (list a)
53 listNotNull :: proxy a -> Dict NotNull (list a)
59 vectorTypeInformation :: ()
54 vectorTypeInformation :: ()
@@ -78,16 +73,16 @@ newtype HVectorize list table context = HVectorize (HMapTable (Vectorize list) t
78 deriving anyclass HTable
73 deriving anyclass HTable
79
74
80
75
81−data Vectorize :: (Type -> Type) -> Type -> Exp Type
76+data Vectorize :: (Type -> Type) -> Spec -> Exp Spec
82
77
83
78
84−type instance Eval (Vectorize list a) = list a
79+type instance Eval (Vectorize list ('Spec a)) = 'Spec (list a)
85
80
86
81
87instance Vector list => MapSpec (Vectorize list) where
82instance Vector list => MapSpec (Vectorize list) where
88 mapInfo = \case
83 mapInfo = \case
89− Spec {..} -> case listNotNull @list nullity of
84+ SSpec {..} -> case listNotNull @list nullity of
90− Dict -> Spec
85+ Dict -> SSpec
91 { nullity = NotNull
86 { nullity = NotNull
92 , info = vectorTypeInformation nullity info
87 , info = vectorTypeInformation nullity info
93 , ..
88 , ..
@@ -95,49 +90,55 @@ instance Vector list => MapSpec (Vectorize list) where
95
90
96
91
97hvectorize :: (HTable t, Unzip f, Vector list)
92hvectorize :: (HTable t, Unzip f, Vector list)
93+ => (forall a. ()
94+ => SSpec ('Spec a)
95+ -> f (context ('Spec a))
98− => (forall a. Spec a -> f (context a) -> context' (list a))
96+ -> context' ('Spec (list a)))
99 -> f (t context)
97 -> f (t context)
100 -> HVectorize list t context'
98 -> HVectorize list t context'
101hvectorize vectorizer as = HVectorize $ htabulate $ \(HMapTableField field) ->
99hvectorize vectorizer as = HVectorize $ htabulate $ \(HMapTableField field) ->
102 case hfield hspecs field of
100 case hfield hspecs field of
103− spec -> vectorizer spec (fmap (`hfield` field) as)
101+ spec@SSpec {} -> vectorizer spec (fmap (`hfield` field) as)
104{-# INLINABLE hvectorize #-}
102{-# INLINABLE hvectorize #-}
105
103
106
104
107hunvectorize :: (HTable t, Zip f, Vector list)
105hunvectorize :: (HTable t, Zip f, Vector list)
106+ => (forall a. ()
107+ => SSpec ('Spec a)
108− => (forall a. Spec a -> context (list a) -> f (context' a))
108+ -> context ('Spec (list a))
109+ -> f (context' ('Spec a)))
109 -> HVectorize list t context
110 -> HVectorize list t context
110 -> f (t context')
111 -> f (t context')
111hunvectorize unvectorizer (HVectorize table) =
112hunvectorize unvectorizer (HVectorize table) =
112 getZippy $ htabulateA $ \field -> case hfield hspecs field of
113 getZippy $ htabulateA $ \field -> case hfield hspecs field of
113− spec -> case hfield table (HMapTableField field) of
114+ spec@SSpec{} -> case hfield table (HMapTableField field) of
114 a -> Zippy (unvectorizer spec a)
115 a -> Zippy (unvectorizer spec a)
115{-# INLINABLE hunvectorize #-}
116{-# INLINABLE hunvectorize #-}
116
117
117
118
118−happend :: (HTable t, Vector list)
119+happend :: (HTable t, Vector list) =>
119− => (forall a. Spec a -> context (list a) -> context (list a) -> context (list a))
120+ ( forall a. ()
121+ => Nullity a
122+ -> TypeInformation (Unnullify a)
123+ -> context ('Spec (list a))
124+ -> context ('Spec (list a))
125+ -> context ('Spec (list a))
126+ )
120 -> HVectorize list t context
127 -> HVectorize list t context
121 -> HVectorize list t context
128 -> HVectorize list t context
122 -> HVectorize list t context
129 -> HVectorize list t context
123happend append (HVectorize as) (HVectorize bs) = HVectorize $
130happend append (HVectorize as) (HVectorize bs) = HVectorize $
124 htabulate $ \field@(HMapTableField j) -> case (hfield as field, hfield bs field) of
131 htabulate $ \field@(HMapTableField j) -> case (hfield as field, hfield bs field) of
125 (a, b) -> case hfield hspecs j of
132 (a, b) -> case hfield hspecs j of
126− spec -> append spec a b
133+ SSpec {nullity, info} -> append nullity info a b
127
134
128
135
129−hempty :: HTable t
136+hempty :: HTable t =>
130− => (forall a. Spec a -> context [a])
137+ ( forall a. ()
138+ => Nullity a
139+ -> TypeInformation (Unnullify a)
140+ -> context ('Spec [a])
141+ )
131 -> HVectorize [] t context
142 -> HVectorize [] t context
132−hempty empty = HVectorize $ htabulate $ \(HMapTableField field) ->
143+hempty empty = HVectorize $ htabulate $ \(HMapTableField field) -> case hfield hspecs field of
133− empty (hfield hspecs field)
144+ SSpec {nullity, info} -> empty nullity info
134−
135−
136−hproject :: ()
137− => (forall ctx. t ctx -> t' ctx)
138− -> HVectorize list t context -> HVectorize list t' context
139−hproject f (HVectorize a) = HVectorize (HMapTable.hproject f a)
140−
141−
142−hcolumn :: HVectorize list (HIdentity a) context -> context (list a)
143−hcolumn (HVectorize (HMapTable (HIdentity (Precompose a)))) = a
src/Rel8/Schema/Kind.hs+15−6
@@ -1,9 +1,8 @@
1{-# language StandaloneKindSignatures #-}
1{-# language StandaloneKindSignatures #-}
2
2
3module Rel8.Schema.Kind
3module Rel8.Schema.Kind
4− ( Rel8able
4+ ( Context, Rel8able
5− , Context
6− , HTable
5+ , HContext, HTable
7 )
6 )
8where
7where
9
8
@@ -11,13 +10,23 @@ where
11import Data.Kind ( Type )
10import Data.Kind ( Type )
12import Prelude ()
11import Prelude ()
13
12
13+-- rel8
14+import Rel8.Schema.Spec ( Spec )
14
15
16+
15−type Context :: Type
17+type HContext :: Type
16−type Context = Type -> Type
18+type HContext = Spec -> Type
17
19
18
20
19type HTable :: Type
21type HTable :: Type
22+type HTable = HContext -> Type
23+
24+
25+data X
26+
27+
28+type Context :: Type
20−type HTable = Context -> Type
29+type Context = X -> Type
21
30
22
31
23type Rel8able :: Type
32type Rel8able :: Type
src/Rel8/Schema/Name.hs+41−31
@@ -3,44 +3,39 @@
3{-# language FlexibleContexts #-}
3{-# language FlexibleContexts #-}
4{-# language FlexibleInstances #-}
4{-# language FlexibleInstances #-}
5{-# language GADTs #-}
5{-# language GADTs #-}
6−{-# language GeneralizedNewtypeDeriving #-}
7{-# language MultiParamTypeClasses #-}
6{-# language MultiParamTypeClasses #-}
7+{-# language PolyKinds #-}
8{-# language RankNTypes #-}
8{-# language RankNTypes #-}
9+{-# language StandaloneDeriving #-}
9{-# language StandaloneKindSignatures #-}
10{-# language StandaloneKindSignatures #-}
10{-# language TypeFamilies #-}
11{-# language TypeFamilies #-}
11{-# language UndecidableInstances #-}
12{-# language UndecidableInstances #-}
13+{-# language UndecidableSuperClasses #-}
12
14
13module Rel8.Schema.Name
15module Rel8.Schema.Name
14 ( Name(..)
16 ( Name(..)
17+ , Col( N, unN )
15 , Selects
18 , Selects
16− , ppColumn
17 )
19 )
18where
20where
19
21
20-- base
22-- base
21−import Data.Functor.Identity ( Identity( Identity ) )
22import Data.Kind ( Constraint, Type )
23import Data.Kind ( Constraint, Type )
23−import Data.String ( IsString )
24+import Data.String ( IsString, fromString )
24import Prelude
25import Prelude
25
26
26−-- opaleye
27−import qualified Opaleye.Internal.HaskellDB.Sql as Opaleye
28−import qualified Opaleye.Internal.HaskellDB.Sql.Print as Opaleye
29−
30−-- pretty
31−import Text.PrettyPrint ( Doc )
32−
33-- rel8
27-- rel8
34import Rel8.Expr ( Expr )
28import Rel8.Expr ( Expr )
35−import qualified Rel8.Schema.Kind as K
29+import Rel8.Schema.Context ( Interpretation, Col )
36−import Rel8.Schema.HTable.Identity ( HIdentity( HIdentity ) )
30+import Rel8.Schema.HTable.Identity ( HIdentity( HType ), HType )
37import Rel8.Schema.Null ( Sql )
31import Rel8.Schema.Null ( Sql )
32+import Rel8.Schema.Result ( Col( R ) )
33+import Rel8.Schema.Spec ( Spec( Spec ) )
38import Rel8.Table
34import Rel8.Table
39 ( Table, Columns, Context, fromColumns, toColumns
35 ( Table, Columns, Context, fromColumns, toColumns
40 , FromExprs, fromResult, toResult
36 , FromExprs, fromResult, toResult
41− , Transpose
42 )
37 )
43−import Rel8.Table.Transpose ( Transposes )
38+import Rel8.Table.Recontextualize ( Recontextualize )
44import Rel8.Type ( DBType )
39import Rel8.Type ( DBType )
45
40
46
41
@@ -48,30 +43,45 @@ import Rel8.Type ( DBType )
48-- schema definition. You can construct names by using the @OverloadedStrings@
43-- schema definition. You can construct names by using the @OverloadedStrings@
49-- extension and writing string literals. This is typically done when providing
44-- extension and writing string literals. This is typically done when providing
50-- a 'TableSchema' value.
45-- a 'TableSchema' value.
51−type Name :: K.Context
46+type Name :: k -> Type
52−newtype Name a = Name String
47+data Name a where
48+ Name :: k ~ Type => !String -> Name (a :: k)
49+
50+
53− deriving stock Show
51+deriving stock instance Show (Name a)
54− deriving newtype IsString
52+
53+
54+instance k ~ Type => IsString (Name (a :: k)) where
55+ fromString = Name
55
56
56
57
57instance Sql DBType a => Table Name (Name a) where
58instance Sql DBType a => Table Name (Name a) where
58− type Columns (Name a) = HIdentity a
59+ type Columns (Name a) = HType a
59 type Context (Name a) = Name
60 type Context (Name a) = Name
60 type FromExprs (Name a) = a
61 type FromExprs (Name a) = a
61− type Transpose to (Name a) = to a
62
62
63− toColumns a = HIdentity a
63+ toColumns a = HType (N a)
64− fromColumns (HIdentity a) = a
64+ fromColumns (HType (N a)) = a
65− toResult a = HIdentity (Identity a)
65+ toResult a = HType (R a)
66− fromResult (HIdentity (Identity a)) = a
66+ fromResult (HType (R a)) = a
67+
68+
69+instance Sql DBType a => Recontextualize Expr Name (Expr a) (Name a)
70+
71+
72+instance Sql DBType a => Recontextualize Name Expr (Name a) (Expr a)
73+
74+
75+instance Sql DBType a => Recontextualize Name Name (Name a) (Name a)
76+
77+
78+instance Interpretation Name where
79+ data Col Name _spec where
80+ N :: {unN :: !(Name a)} -> Col Name ('Spec a)
67
81
68
82
69-- | @Selects a b@ means that @a@ is a schema (i.e., a 'Table' of 'Name's) for
83-- | @Selects a b@ means that @a@ is a schema (i.e., a 'Table' of 'Name's) for
70-- the 'Expr' columns in @b@.
84-- the 'Expr' columns in @b@.
71type Selects :: Type -> Type -> Constraint
85type Selects :: Type -> Type -> Constraint
72−class Transposes Name Expr names exprs => Selects names exprs
86+class Recontextualize Name Expr names exprs => Selects names exprs
73−instance Transposes Name Expr names exprs => Selects names exprs
87+instance Recontextualize Name Expr names exprs => Selects names exprs
74−
75−
76−ppColumn :: String -> Doc
77−ppColumn = Opaleye.ppSqlExpr . Opaleye.ColumnSqlExpr . Opaleye.SqlColumn
src/Rel8/Schema/Result.hs+33−16
@@ -5,20 +5,20 @@
5{-# language TypeFamilies #-}
5{-# language TypeFamilies #-}
6
6
7module Rel8.Schema.Result
7module Rel8.Schema.Result
8− ( Result
8+ ( Col( R, unR ), Result
9 , null, nullifier, unnullifier
9 , null, nullifier, unnullifier
10 , vectorizer, unvectorizer
10 , vectorizer, unvectorizer
11 )
11 )
12where
12where
13
13
14-- base
14-- base
15−import Data.Functor.Identity ( Identity( Identity), runIdentity )
16import Prelude hiding ( null )
15import Prelude hiding ( null )
17
16
18-- rel8
17-- rel8
18+import Rel8.Schema.Context ( Interpretation( Col ) )
19import Rel8.Schema.Kind ( Context )
19import Rel8.Schema.Kind ( Context )
20import Rel8.Schema.Null ( Nullify, Nullity( Null, NotNull ) )
20import Rel8.Schema.Null ( Nullify, Nullity( Null, NotNull ) )
21−import Rel8.Schema.Spec ( Spec(..) )
21+import Rel8.Schema.Spec ( Spec( Spec ), SSpec(..) )
22
22
23
23
24-- | The @Result@ context is the context used for decoded query results.
24-- | The @Result@ context is the context used for decoded query results.
@@ -26,29 +26,46 @@ import Rel8.Schema.Spec ( Spec(..) )
26-- When a query is executed against a PostgreSQL database, Rel8 parses the
26-- When a query is executed against a PostgreSQL database, Rel8 parses the
27-- returned rows, decoding each row into the @Result@ context.
27-- returned rows, decoding each row into the @Result@ context.
28type Result :: Context
28type Result :: Context
29−type Result = Identity
29+data Result a
30
30
31
31
32+instance Interpretation Result where
33+ data Col Result _spec where
32−null :: Result (Maybe a)
34+ R :: {unR :: !a} -> Col Result ('Spec a)
33−null = Identity Nothing
34
35
35
36
37+null :: Col Result ('Spec (Maybe a))
38+null = R Nothing
39+
40+
41+nullifier :: ()
42+ => SSpec ('Spec a)
43+ -> Col Result ('Spec a)
36−nullifier :: Spec a -> Result a -> Result (Nullify a)
44+ -> Col Result ('Spec (Nullify a))
37−nullifier Spec {nullity} (Identity a) = Identity $ case nullity of
45+nullifier SSpec {nullity} (R a) = R $ case nullity of
38 Null -> a
46 Null -> a
39 NotNull -> Just a
47 NotNull -> Just a
40
48
41
49
50+unnullifier :: ()
51+ => SSpec ('Spec a)
42−unnullifier :: Spec a -> Result (Nullify a) -> Maybe (Result a)
52+ -> Col Result ('Spec (Nullify a))
53+ -> Maybe (Col Result ('Spec a))
43−unnullifier Spec {nullity} (Identity a) =
54+unnullifier SSpec {nullity} (R a) =
44 case nullity of
55 case nullity of
45− Null -> pure $ Identity a
56+ Null -> pure $ R a
46− NotNull -> Identity <$> a
57+ NotNull -> R <$> a
47
58
48
59
49−vectorizer :: Functor f => Spec a -> f (Result a) -> Result (f a)
60+vectorizer :: Functor f
61+ => SSpec ('Spec a)
62+ -> f (Col Result ('Spec a))
63+ -> Col Result ('Spec (f a))
50−vectorizer _ = Identity . fmap runIdentity
64+vectorizer _ = R . fmap unR
51
65
52
66
53−unvectorizer :: Functor f => Spec a -> Result (f a) -> f (Result a)
67+unvectorizer :: Functor f
68+ => SSpec ('Spec a)
69+ -> Col Result ('Spec (f a))
70+ -> f (Col Result ('Spec a))
54−unvectorizer _ (Identity results) = Identity <$> results
71+unvectorizer _ (R results) = R <$> results
src/Rel8/Schema/Spec.hs+30−16
@@ -1,15 +1,18 @@
1+{-# language DataKinds #-}
1{-# language FlexibleContexts #-}
2{-# language FlexibleContexts #-}
2−{-# language MonoLocalBinds #-}
3+{-# language GADTs #-}
3{-# language StandaloneKindSignatures #-}
4{-# language StandaloneKindSignatures #-}
5+{-# language UndecidableInstances #-}
4
6
5module Rel8.Schema.Spec
7module Rel8.Schema.Spec
8+ ( Spec( Spec )
6− ( Spec( Spec, labels, info, nullity )
9+ , SSpec( SSpec, labels, info, nullity )
7− , specification
10+ , KnownSpec( specSing )
8 )
11 )
9where
12where
10
13
11-- base
14-- base
12−import Data.Kind ( Type )
15+import Data.Kind ( Constraint, Type )
13import Prelude
16import Prelude
14
17
15-- rel8
18-- rel8
@@ -18,17 +21,28 @@ import Rel8.Type ( DBType, typeInformation )
18import Rel8.Type.Information ( TypeInformation )
21import Rel8.Type.Information ( TypeInformation )
19
22
20
23
21−type Spec :: Type -> Type
24+type Spec :: Type
22−data Spec a = Spec
25+newtype Spec = Spec Type
23− { labels :: [String]
24− , info :: TypeInformation (Unnullify a)
25− , nullity :: Nullity a
26− }
27
26
28
27
28+type SSpec :: Spec -> Type
29+data SSpec spec where
30+ SSpec ::
31+ { labels :: [String]
32+ , info :: TypeInformation (Unnullify a)
33+ , nullity :: Nullity a
34+ }
35+ -> SSpec ('Spec a)
36+
37+
38+type KnownSpec :: Spec -> Constraint
39+class KnownSpec spec where
40+ specSing :: SSpec spec
41+
42+
29−specification :: Sql DBType a => Spec a
43+instance Sql DBType a => KnownSpec ('Spec a) where
30−specification = Spec
44+ specSing = SSpec
31− { labels = []
45+ { labels = []
32− , info = typeInformation
46+ , info = typeInformation
33− , nullity = nullable
47+ , nullity = nullable
34− }
48+ }
src/Rel8/Schema/Spec/Constrain.hsnew file+32
@@ -0,0 +1,32 @@
1+{-# language ConstraintKinds #-}
2+{-# language DataKinds #-}
3+{-# language FlexibleInstances #-}
4+{-# language MultiParamTypeClasses #-}
5+{-# language StandaloneKindSignatures #-}
6+{-# language TypeFamilies #-}
7+{-# language UndecidableInstances #-}
8+{-# language UndecidableSuperClasses #-}
9+
10+module Rel8.Schema.Spec.Constrain
11+ ( ConstrainSpec
12+ )
13+where
14+
15+-- base
16+import Data.Kind ( Constraint, Type )
17+import Prelude ()
18+
19+-- rel8
20+import Rel8.Schema.Spec ( Spec( Spec ) )
21+
22+
23+type Unspec :: Spec -> Type
24+type family Unspec spec where
25+ Unspec ('Spec a) = a
26+
27+
28+type ConstrainSpec :: (Type -> Constraint) -> Spec -> Constraint
29+class (spec ~ 'Spec (Unspec spec), constraint (Unspec spec)) =>
30+ ConstrainSpec constraint spec
31+instance (spec ~ 'Spec (Unspec spec), constraint (Unspec spec)) =>
32+ ConstrainSpec constraint spec
src/Rel8/Schema/Table.hs−20
@@ -1,26 +1,14 @@
1{-# language DeriveFunctor #-}
1{-# language DeriveFunctor #-}
2{-# language DerivingStrategies #-}
2{-# language DerivingStrategies #-}
3−{-# language DisambiguateRecordFields #-}
4−{-# language NamedFieldPuns #-}
5−{-# language StandaloneKindSignatures #-}
6
3
7module Rel8.Schema.Table
4module Rel8.Schema.Table
8 ( TableSchema(..)
5 ( TableSchema(..)
9− , ppTable
10 )
6 )
11where
7where
12
8
13-- base
9-- base
14−import Data.Kind ( Type )
15import Prelude
10import Prelude
16
11
17−-- opaleye
18−import qualified Opaleye.Internal.HaskellDB.Sql as Opaleye
19−import qualified Opaleye.Internal.HaskellDB.Sql.Print as Opaleye
20−
21−-- pretty
22−import Text.PrettyPrint ( Doc )
23−
24
12
25-- | The schema for a table. This is used to specify the name and schema that a
13-- | The schema for a table. This is used to specify the name and schema that a
26-- table belongs to (the @FROM@ part of a SQL query), along with the schema of
14-- table belongs to (the @FROM@ part of a SQL query), along with the schema of
@@ -28,7 +16,6 @@ import Text.PrettyPrint ( Doc )
28--
16--
29-- For each selectable table in your database, you should provide a
17-- For each selectable table in your database, you should provide a
30-- @TableSchema@ in order to interact with the table via Rel8.
18-- @TableSchema@ in order to interact with the table via Rel8.
31−type TableSchema :: Type -> Type
32data TableSchema names = TableSchema
19data TableSchema names = TableSchema
33 { name :: String
20 { name :: String
34 -- ^ The name of the table.
21 -- ^ The name of the table.
@@ -40,10 +27,3 @@ data TableSchema names = TableSchema
40 -- data type here, parameterized by the 'Rel8.ColumnSchema.ColumnSchema' functor.
27 -- data type here, parameterized by the 'Rel8.ColumnSchema.ColumnSchema' functor.
41 }
28 }
42 deriving stock Functor
29 deriving stock Functor
43−
44−
45−ppTable :: TableSchema a -> Doc
46−ppTable TableSchema {name, schema} = Opaleye.ppTable Opaleye.SqlTable
47− { sqlTableSchemaName = schema
48− , sqlTableName = name
49− }
src/Rel8/Statement/Delete.hs+48−35
@@ -1,37 +1,40 @@
1{-# language DuplicateRecordFields #-}
1{-# language DuplicateRecordFields #-}
2{-# language GADTs #-}
2{-# language GADTs #-}
3{-# language NamedFieldPuns #-}
3{-# language NamedFieldPuns #-}
4−{-# language RankNTypes #-}
4+{-# language ScopedTypeVariables #-}
5−{-# language RecordWildCards #-}
6{-# language StandaloneKindSignatures #-}
5{-# language StandaloneKindSignatures #-}
7−{-# language StrictData #-}
6+{-# language TypeApplications #-}
8
7
9module Rel8.Statement.Delete
8module Rel8.Statement.Delete
10 ( Delete(..)
9 ( Delete(..)
11 , delete
10 , delete
12− , ppDelete
13 )
11 )
14where
12where
15
13
16-- base
14-- base
15+import Control.Exception ( throwIO )
17import Data.Kind ( Type )
16import Data.Kind ( Type )
18import Prelude
17import Prelude
19
18
20-- hasql
19-- hasql
20+import Hasql.Connection ( Connection )
21+import qualified Hasql.Decoders as Hasql
21import qualified Hasql.Encoders as Hasql
22import qualified Hasql.Encoders as Hasql
23+import qualified Hasql.Session as Hasql
22import qualified Hasql.Statement as Hasql
24import qualified Hasql.Statement as Hasql
23
25
24−-- pretty
26+-- opaleye
25−import Text.PrettyPrint ( Doc, (<+>), ($$), text )
27+import qualified Opaleye.Internal.Manipulation as Opaleye
26
28
27-- rel8
29-- rel8
28import Rel8.Expr ( Expr )
30import Rel8.Expr ( Expr )
29−import Rel8.Query ( Query )
31+import Rel8.Expr.Opaleye ( toColumn, toPrimExpr )
30import Rel8.Schema.Name ( Selects )
32import Rel8.Schema.Name ( Selects )
31−import Rel8.Schema.Table ( TableSchema, ppTable )
33+import Rel8.Schema.Table ( TableSchema )
32−import Rel8.Statement.Returning ( Returning, decodeReturning, ppReturning )
34+import Rel8.Statement.Returning ( Returning( NumberOfRowsAffected, Projection ) )
33−import Rel8.Statement.Using ( ppUsing )
35+import Rel8.Table ( fromColumns, toColumns )
34−import Rel8.Statement.Where ( ppWhere )
36+import Rel8.Table.Opaleye ( castTable, table, unpackspec )
37+import Rel8.Table.Serialize ( Serializable, parse )
35
38
36-- text
39-- text
37import qualified Data.Text as Text
40import qualified Data.Text as Text
@@ -44,10 +47,7 @@ data Delete a where
44 Delete :: Selects names exprs =>
47 Delete :: Selects names exprs =>
45 { from :: TableSchema names
48 { from :: TableSchema names
46 -- ^ Which table to delete from.
49 -- ^ Which table to delete from.
47− , using :: Query using
48− -- ^ @USING@ clause — this can be used to join against other tables,
49− -- and its results can be referenced in the @WHERE@ clause
50− , deleteWhere :: using -> exprs -> Expr Bool
50+ , deleteWhere :: exprs -> Expr Bool
51 -- ^ Which rows should be selected for deletion.
51 -- ^ Which rows should be selected for deletion.
52 , returning :: Returning names a
52 , returning :: Returning names a
53 -- ^ What to return from the @DELETE@ statement.
53 -- ^ What to return from the @DELETE@ statement.
@@ -55,25 +55,38 @@ data Delete a where
55 -> Delete a
55 -> Delete a
56
56
57
57
58−ppDelete :: Delete a -> Doc
58+-- | Run a @DELETE@ statement.
59−ppDelete Delete {..} = case ppUsing using of
59+delete :: Connection -> Delete a -> IO a
60− Nothing ->
60+delete c Delete {from, deleteWhere, returning} =
61− text "DELETE FROM" <+> ppTable from $$
61+ case returning of
62− text "WHERE false"
62+ NumberOfRowsAffected -> Hasql.run session c >>= either throwIO pure
63− Just (usingDoc, i) ->
63+ where
64− text "DELETE FROM" <+> ppTable from $$
64+ session = Hasql.statement () statement
65− usingDoc $$
65+ statement = Hasql.Statement bytes params decode prepare
66− ppWhere from (deleteWhere i) $$
66+ bytes = encodeUtf8 $ Text.pack sql
67− ppReturning from returning
67+ params = Hasql.noParams
68+ decode = Hasql.rowsAffected
69+ prepare = False
70+ sql = Opaleye.arrangeDeleteSql from' where'
71+ where
72+ from' = table $ toColumns <$> from
73+ where' = toColumn . toPrimExpr . deleteWhere . fromColumns
68
74
69−
75+ Projection project -> Hasql.run session c >>= either throwIO pure
70−-- | Run a 'Delete' statement.
76+ where
71−delete :: Delete a -> Hasql.Statement () a
77+ session = Hasql.statement () statement
72−delete d@Delete {returning} = Hasql.Statement bytes params decode prepare
78+ statement = Hasql.Statement bytes params decode prepare
79+ bytes = encodeUtf8 $ Text.pack sql
80+ params = Hasql.noParams
81+ decode = decoder project
82+ prepare = False
83+ sql =
84+ Opaleye.arrangeDeleteReturningSql unpackspec from' where' project'
85+ where
86+ from' = table $ toColumns <$> from
87+ where' = toColumn . toPrimExpr . deleteWhere . fromColumns
88+ project' = castTable . toColumns . project . fromColumns
73 where
89 where
74− bytes = encodeUtf8 $ Text.pack sql
90+ decoder :: forall exprs projection a. Serializable projection a
75− params = Hasql.noParams
91+ => (exprs -> projection) -> Hasql.Result [a]
76− decode = decodeReturning returning
92+ decoder _ = Hasql.rowList (parse @projection @a)
77− prepare = False
78− sql = show doc
79− doc = ppDelete d
src/Rel8/Statement/Insert.hs+72−43
@@ -1,59 +1,64 @@
1{-# language DuplicateRecordFields #-}
1{-# language DuplicateRecordFields #-}
2−{-# language FlexibleContexts #-}
3{-# language GADTs #-}
2{-# language GADTs #-}
4{-# language NamedFieldPuns #-}
3{-# language NamedFieldPuns #-}
5−{-# language RecordWildCards #-}
4+{-# language ScopedTypeVariables #-}
6{-# language StandaloneKindSignatures #-}
5{-# language StandaloneKindSignatures #-}
7−{-# language StrictData #-}
6+{-# language TypeApplications #-}
8
7
9module Rel8.Statement.Insert
8module Rel8.Statement.Insert
10 ( Insert(..)
9 ( Insert(..)
10+ , OnConflict(..)
11 , insert
11 , insert
12− , ppInsert
13− , ppInto
14 )
12 )
15where
13where
16
14
17-- base
15-- base
18−import Data.Foldable ( toList )
16+import Control.Exception ( throwIO )
17+import Data.List.NonEmpty ( NonEmpty( (:|) ) )
19import Data.Kind ( Type )
18import Data.Kind ( Type )
20import Prelude
19import Prelude
21
20
22-- hasql
21-- hasql
22+import Hasql.Connection ( Connection )
23+import qualified Hasql.Decoders as Hasql
23import qualified Hasql.Encoders as Hasql
24import qualified Hasql.Encoders as Hasql
25+import qualified Hasql.Session as Hasql
24import qualified Hasql.Statement as Hasql
26import qualified Hasql.Statement as Hasql
25
27
26-- opaleye
28-- opaleye
27−import qualified Opaleye.Internal.HaskellDB.Sql.Print as Opaleye
29+import qualified Opaleye.Internal.Manipulation as Opaleye
28−
30+import qualified Opaleye.Manipulation as Opaleye
29−-- pretty
30−import Text.PrettyPrint ( Doc, (<+>), ($$), parens, text )
31
31
32-- rel8
32-- rel8
33−import Rel8.Query ( Query )
34−import Rel8.Schema.Name ( Name, Selects, ppColumn )
33+import Rel8.Schema.Name ( Selects )
35−import Rel8.Schema.Table ( TableSchema(..), ppTable )
34+import Rel8.Schema.Table ( TableSchema )
36−import Rel8.Statement.OnConflict ( OnConflict, ppOnConflict )
35+import Rel8.Statement.Returning ( Returning( Projection, NumberOfRowsAffected ) )
37−import Rel8.Statement.Returning ( Returning, decodeReturning, ppReturning )
36+import Rel8.Table ( fromColumns, toColumns )
38−import Rel8.Statement.Select ( ppRows )
37+import Rel8.Table.Opaleye ( castTable, table, unpackspec )
39−import Rel8.Table ( Table )
40−import Rel8.Table.Name ( showNames )
38+import Rel8.Table.Serialize ( Serializable, parse )
41
39
42-- text
40-- text
43import qualified Data.Text as Text ( pack )
41import qualified Data.Text as Text ( pack )
44import Data.Text.Encoding ( encodeUtf8 )
42import Data.Text.Encoding ( encodeUtf8 )
45
43
46
44
45+-- | @OnConflict@ allows you to add an @ON CONFLICT@ clause to an @INSERT@
46+-- statement.
47+type OnConflict :: Type
48+data OnConflict
49+ = Abort -- ^ @ON CONFLICT ABORT@
50+ | DoNothing -- ^ @ON CONFLICT DO NOTHING@
51+
52+
47-- | The constituent parts of a SQL @INSERT@ statement.
53-- | The constituent parts of a SQL @INSERT@ statement.
48type Insert :: Type -> Type
54type Insert :: Type -> Type
49data Insert a where
55data Insert a where
50 Insert :: Selects names exprs =>
56 Insert :: Selects names exprs =>
51 { into :: TableSchema names
57 { into :: TableSchema names
52 -- ^ Which table to insert into.
58 -- ^ Which table to insert into.
53− , rows :: Query exprs
59+ , rows :: [exprs]
54− -- ^ The rows to insert. This can be an arbitrary query — use
60+ -- ^ The rows to insert.
55− -- 'Rel8.values' insert a static list of rows.
56− , onConflict :: OnConflict names
61+ , onConflict :: OnConflict
57 -- ^ What to do if the inserted rows conflict with data already in the
62 -- ^ What to do if the inserted rows conflict with data already in the
58 -- table.
63 -- table.
59 , returning :: Returning names a
64 , returning :: Returning names a
@@ -62,28 +67,52 @@ data Insert a where
62 -> Insert a
67 -> Insert a
63
68
64
69
65−ppInsert :: Insert a -> Doc
70+-- | Run an @INSERT@ statement
66−ppInsert Insert {..} =
71+insert :: Connection -> Insert a -> IO a
67− text "INSERT INTO" <+>
72+insert c Insert {into, rows, onConflict, returning} =
68− ppInto into $$
73+ case (rows, returning) of
69− ppRows rows $$
74+ ([], NumberOfRowsAffected) -> pure 0
70− ppOnConflict into onConflict $$
75+ ([], Projection _) -> pure []
71− ppReturning into returning
72
76
77+ (x:xs, NumberOfRowsAffected) -> Hasql.run session c >>= either throwIO pure
78+ where
79+ session = Hasql.statement () statement
80+ statement = Hasql.Statement bytes params decode prepare
81+ bytes = encodeUtf8 $ Text.pack sql
82+ params = Hasql.noParams
83+ decode = Hasql.rowsAffected
84+ prepare = False
85+ sql = Opaleye.arrangeInsertManySql into' rows' onConflict'
86+ where
87+ into' = table $ toColumns <$> into
88+ rows' = toColumns <$> x :| xs
73
89
74−ppInto :: Table Name a => TableSchema a -> Doc
90+ (x:xs, Projection project) -> Hasql.run session c >>= either throwIO pure
75−ppInto table@TableSchema {columns} =
91+ where
76− ppTable table <+>
92+ session = Hasql.statement () statement
77− parens (Opaleye.commaV ppColumn (toList (showNames columns)))
93+ statement = Hasql.Statement bytes params decode prepare
94+ bytes = encodeUtf8 $ Text.pack sql
95+ params = Hasql.noParams
96+ decode = decoder project
97+ prepare = False
98+ sql =
99+ Opaleye.arrangeInsertManyReturningSql
100+ unpackspec
101+ into'
102+ rows'
103+ project'
104+ onConflict'
105+ where
106+ into' = table $ toColumns <$> into
107+ rows' = toColumns <$> x :| xs
108+ project' = castTable . toColumns . project . fromColumns
78
109
79−
80−-- | Run an 'Insert' statement.
81−insert :: Insert a -> Hasql.Statement () a
82−insert i@Insert {returning} = Hasql.Statement bytes params decode prepare
83 where
110 where
84− bytes = encodeUtf8 $ Text.pack sql
111+ onConflict' =
85− params = Hasql.noParams
112+ case onConflict of
86− decode = decodeReturning returning
113+ DoNothing -> Just Opaleye.DoNothing
87− prepare = False
114+ Abort -> Nothing
88− sql = show doc
115+
89− doc = ppInsert i
116+ decoder :: forall exprs projection a. Serializable projection a
117+ => (exprs -> projection) -> Hasql.Result [a]
118+ decoder _ = Hasql.rowList (parse @projection @a)
src/Rel8/Statement/OnConflict.hsdeleted−106
@@ -1,106 +0,0 @@
1−{-# language DuplicateRecordFields #-}
2−{-# language FlexibleContexts #-}
3−{-# language GADTs #-}
4−{-# language LambdaCase #-}
5−{-# language NamedFieldPuns #-}
6−{-# language RecordWildCards #-}
7−{-# language StandaloneKindSignatures #-}
8−{-# language StrictData #-}
9−
10−module Rel8.Statement.OnConflict
11− ( OnConflict(..)
12− , Upsert(..)
13− , ppOnConflict
14− )
15−where
16−
17−-- base
18−import Data.Foldable ( toList )
19−import Data.Kind ( Type )
20−import Prelude
21−
22−-- opaleye
23−import qualified Opaleye.Internal.HaskellDB.Sql.Print as Opaleye
24−
25−-- pretty
26−import Text.PrettyPrint ( Doc, (<+>), ($$), parens, text )
27−
28−-- rel8
29−import Rel8.Expr ( Expr )
30−import Rel8.Schema.Name ( Name, Selects, ppColumn )
31−import Rel8.Schema.Table ( TableSchema(..) )
32−import Rel8.Statement.Set ( ppSet )
33−import Rel8.Statement.Where ( ppWhere )
34−import Rel8.Table ( Table, toColumns )
35−import Rel8.Table.Cols ( Cols( Cols ) )
36−import Rel8.Table.Name ( showNames )
37−import Rel8.Table.Opaleye ( attributes )
38−import Rel8.Table.Projection ( Projecting, Projection, apply )
39−
40−
41−-- | 'OnConflict' represents the @ON CONFLICT@ clause of an @INSERT@
42−-- statement. This specifies what ought to happen when one or more of the
43−-- rows proposed for insertion conflict with an existing row in the table.
44−type OnConflict :: Type -> Type
45−data OnConflict names
46− = Abort
47− -- ^ Abort the transaction if there are conflicting rows (Postgres' default)
48− | DoNothing
49− -- ^ @ON CONFLICT DO NOTHING@
50− | DoUpdate (Upsert names)
51− -- ^ @ON CONFLICT DO UPDATE@
52−
53−
54−-- | The @ON CONFLICT (...) DO UPDATE@ clause of an @INSERT@ statement, also
55−-- known as \"upsert\".
56−--
57−-- When an existing row conflicts with a row proposed for insertion,
58−-- @ON CONFLICT DO UPDATE@ allows you to instead update this existing row. The
59−-- conflicting row proposed for insertion is then \"excluded\", but its values
60−-- can still be referenced from the @SET@ and @WHERE@ clauses of the @UPDATE@
61−-- statement.
62−--
63−-- Upsert in Postgres requires an explicit set of \"conflict targets\" — the
64−-- set of columns comprising the @UNIQUE@ index from conflicts with which we
65−-- would like to recover.
66−type Upsert :: Type -> Type
67−data Upsert names where
68− Upsert :: (Selects names exprs, Projecting names index, excluded ~ exprs) =>
69− { index :: Projection names index
70− -- ^ The set of conflict targets, projected from the set of columns for
71− -- the whole table
72− , set :: excluded -> exprs -> exprs
73− -- ^ How to update each selected row.
74− , updateWhere :: excluded -> exprs -> Expr Bool
75− -- ^ Which rows to select for update.
76− }
77− -> Upsert names
78−
79−
80−ppOnConflict :: TableSchema names -> OnConflict names -> Doc
81−ppOnConflict schema = \case
82− Abort -> mempty
83− DoNothing -> text "ON CONFLICT DO NOTHING"
84− DoUpdate upsert -> ppUpsert schema upsert
85−
86−
87−ppUpsert :: TableSchema names -> Upsert names -> Doc
88−ppUpsert schema@TableSchema {columns} Upsert {..} =
89− text "ON CONFLICT" <+>
90− ppIndex schema index <+>
91− text "DO UPDATE" $$
92− ppSet schema (set excluded) $$
93− ppWhere schema (updateWhere excluded)
94− where
95− excluded = attributes TableSchema
96− { schema = Nothing
97− , name = "excluded"
98− , columns
99− }
100−
101−
102−ppIndex :: (Table Name names, Projecting names index)
103− => TableSchema names -> Projection names index -> Doc
104−ppIndex TableSchema {columns} index =
105− parens $ Opaleye.commaV ppColumn $ toList $
106− showNames $ Cols $ apply index $ toColumns columns
src/Rel8/Statement/Returning.hs+10−114
@@ -1,133 +1,29 @@
1{-# language GADTs #-}
1{-# language GADTs #-}
2−{-# language LambdaCase #-}
3−{-# language NamedFieldPuns #-}
4−{-# language RankNTypes #-}
5−{-# language ScopedTypeVariables #-}
6{-# language StandaloneKindSignatures #-}
2{-# language StandaloneKindSignatures #-}
7−{-# language StrictData #-}
8−{-# language TypeApplications #-}
9
3
10module Rel8.Statement.Returning
4module Rel8.Statement.Returning
11− ( Returning( NumberOfRowsAffected, Projection )
5+ ( Returning(..)
12− , decodeReturning
13− , ppReturning
14 )
6 )
15where
7where
16
8
17-- base
9-- base
18−import Control.Applicative ( liftA2 )
19−import Data.Foldable ( toList )
20import Data.Int ( Int64 )
10import Data.Int ( Int64 )
21import Data.Kind ( Type )
11import Data.Kind ( Type )
22−import Data.List.NonEmpty ( NonEmpty )
23−import Prelude
12+import Prelude ()
24−
25−-- hasql
26−import qualified Hasql.Decoders as Hasql
27−
28−-- opaleye
29−import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
30−import qualified Opaleye.Internal.HaskellDB.Sql.Print as Opaleye
31−import qualified Opaleye.Internal.Sql as Opaleye
32−
33−-- pretty
34−import Text.PrettyPrint ( Doc, (<+>), text )
35
13
36-- rel8
14-- rel8
37import Rel8.Schema.Name ( Selects )
15import Rel8.Schema.Name ( Selects )
38−import Rel8.Schema.Table ( TableSchema(..) )
39−import Rel8.Table.Opaleye ( castTable, exprs, view )
40−import Rel8.Table.Serialize ( Serializable, parse )
16+import Rel8.Table.Serialize ( Serializable )
41
17
42−-- semigropuoids
43−import Data.Functor.Apply ( Apply, (<.>) )
44
18
45−
46−-- | 'Rel8.Insert', 'Rel8.Update' and 'Rel8.Delete' all support returning either
19+-- | @INSERT@, @UPDATE@ and @DELETE@ all support returning either the number of
47−-- the number of rows affected, or the actual rows modified.
20+-- rows affected, or the actual rows modified. 'Projection' allows you to
21+-- project out of these returned rows, which can be useful if you want to log
22+-- exactly which rows were deleted, or to view a generated id (for example, if
23+-- using a column with an autoincrementing counter as a default value).
48type Returning :: Type -> Type -> Type
24type Returning :: Type -> Type -> Type
49data Returning names a where
25data Returning names a where
50− Pure :: a -> Returning names a
51− Ap :: Returning names (a -> b) -> Returning names a -> Returning names b
52−
53− -- | Return the number of rows affected.
54 NumberOfRowsAffected :: Returning names Int64
26 NumberOfRowsAffected :: Returning names Int64
55−
56− -- | 'Projection' allows you to project out of the affected rows, which can
57− -- be useful if you want to log exactly which rows were deleted, or to view
58− -- a generated id (for example, if using a column with an autoincrementing
59− -- counter via 'Rel8.nextval').
60− Projection :: (Selects names exprs, Serializable returning a)
27+ Projection :: (Selects names exprs, Serializable projection a)
61− => (exprs -> returning)
28+ => (exprs -> projection)
62 -> Returning names [a]
29 -> Returning names [a]
63−
64−
65−instance Functor (Returning names) where
66− fmap f = \case
67− Pure a -> Pure (f a)
68− Ap g a -> Ap (fmap (f .) g) a
69− m -> Ap (Pure f) m
70−
71−
72−instance Apply (Returning names) where
73− (<.>) = Ap
74−
75−
76−instance Applicative (Returning names) where
77− pure = Pure
78− (<*>) = Ap
79−
80−
81−projections :: ()
82− => TableSchema names -> Returning names a -> Maybe (NonEmpty Opaleye.PrimExpr)
83−projections schema@TableSchema {columns} = \case
84− Pure _ -> Nothing
85− Ap f a -> projections schema f <> projections schema a
86− NumberOfRowsAffected -> Nothing
87− Projection f -> Just (exprs (castTable (f (view columns))))
88−
89−
90−runReturning :: ()
91− => ((Int64 -> a) -> r)
92− -> (forall x. Hasql.Row x -> ([x] -> a) -> r)
93− -> Returning names a
94− -> r
95−runReturning rowCount rowList = \case
96− Pure a -> rowCount (const a)
97− Ap fs as ->
98− runReturning
99− (\withCount ->
100− runReturning
101− (\withCount' -> rowCount (withCount <*> withCount'))
102− (\decoder -> rowList decoder . liftA2 withCount length64)
103− as)
104− (\decoder withRows ->
105− runReturning
106− (\withCount -> rowList decoder $ withRows <*> withCount . length64)
107− (\decoder' withRows' ->
108− rowList (liftA2 (,) decoder decoder') $
109− withRows <$> fmap fst <*> withRows' . fmap snd)
110− as)
111− fs
112− NumberOfRowsAffected -> rowCount id
113− Projection (_ :: exprs -> returning) -> rowList decoder' id
114− where
115− decoder' = parse @returning
116− where
117− length64 :: Foldable f => f x -> Int64
118− length64 = fromIntegral . length
119−
120−
121−decodeReturning :: Returning names a -> Hasql.Result a
122−decodeReturning = runReturning
123− (<$> Hasql.rowsAffected)
124− (\decoder withRows -> withRows <$> Hasql.rowList decoder)
125−
126−
127−ppReturning :: TableSchema names -> Returning names a -> Doc
128−ppReturning schema returning = case projections schema returning of
129− Nothing -> mempty
130− Just columns ->
131− text "RETURNING" <+> Opaleye.commaV Opaleye.ppSqlExpr (toList sqlExprs)
132− where
133− sqlExprs = Opaleye.sqlExpr <$> columns
src/Rel8/Statement/SQL.hsdeleted−29
@@ -1,29 +0,0 @@
1−module Rel8.Statement.SQL
2− ( showDelete
3− , showInsert
4− , showUpdate
5− )
6−where
7−
8−-- base
9−import Prelude
10−
11−-- rel8
12−import Rel8.Statement.Delete ( Delete, ppDelete )
13−import Rel8.Statement.Insert ( Insert, ppInsert )
14−import Rel8.Statement.Update ( Update, ppUpdate )
15−
16−
17−-- | Convert a 'Delete' to a 'String' containing a @DELETE@ statement.
18−showDelete :: Delete a -> String
19−showDelete = show . ppDelete
20−
21−
22−-- | Convert an 'Insert' to a 'String' containing an @INSERT@ statement.
23−showInsert :: Insert a -> String
24−showInsert = show . ppInsert
25−
26−
27−-- | Convert an 'Update' to a 'String' containing an @UPDATE@ statement.
28−showUpdate :: Update a -> String
29−showUpdate = show . ppUpdate
src/Rel8/Statement/Select.hs+35−120
@@ -1,147 +1,62 @@
1−{-# language DeriveTraversable #-}
2−{-# language DerivingStrategies #-}
3−{-# language FlexibleContexts #-}
4{-# language MonoLocalBinds #-}
1{-# language MonoLocalBinds #-}
5{-# language ScopedTypeVariables #-}
2{-# language ScopedTypeVariables #-}
6−{-# language StandaloneKindSignatures #-}
7{-# language TypeApplications #-}
3{-# language TypeApplications #-}
8
4
9module Rel8.Statement.Select
5module Rel8.Statement.Select
10 ( select
6 ( select
11− , ppSelect
7+ , selectWithNames
12−
13− , Optimized(..)
14− , ppPrimSelect
15− , ppRows
16 )
8 )
17where
9where
18
10
19-- base
11-- base
20−import Data.Foldable ( toList )
12+import Control.Exception ( throwIO )
21−import Data.Kind ( Type )
22−import Data.Void ( Void )
23−import Prelude hiding ( undefined )
13+import Prelude
24
14
25-- hasql
15-- hasql
16+import Hasql.Connection ( Connection )
26import qualified Hasql.Decoders as Hasql
17import qualified Hasql.Decoders as Hasql
27import qualified Hasql.Encoders as Hasql
18import qualified Hasql.Encoders as Hasql
19+import qualified Hasql.Session as Hasql
28import qualified Hasql.Statement as Hasql
20import qualified Hasql.Statement as Hasql
29
21
30−-- opaleye
31−import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
32−import qualified Opaleye.Internal.HaskellDB.Sql as Opaleye
33−import qualified Opaleye.Internal.HaskellDB.Sql.Print as Opaleye
34−import qualified Opaleye.Internal.PrimQuery as Opaleye
35−import qualified Opaleye.Internal.Print as Opaleye
36−import qualified Opaleye.Internal.Optimize as Opaleye
37−import qualified Opaleye.Internal.QueryArr as Opaleye hiding ( Select )
38−import qualified Opaleye.Internal.Sql as Opaleye hiding ( Values )
39−import qualified Opaleye.Internal.Tag as Opaleye
40−
41−-- pretty
42−import Text.PrettyPrint ( Doc )
43−
44-- rel8
22-- rel8
45−import Rel8.Expr ( Expr )
46−import Rel8.Expr.Bool ( false )
47−import Rel8.Expr.Opaleye ( toPrimExpr )
48import Rel8.Query ( Query )
23import Rel8.Query ( Query )
49−import Rel8.Query.Opaleye ( toOpaleye )
24+import Rel8.Query.SQL ( sqlForQuery, sqlForQueryWithNames )
50import Rel8.Schema.Name ( Selects )
25import Rel8.Schema.Name ( Selects )
51−import Rel8.Table ( Table )
52−import Rel8.Table.Cols ( toCols )
53−import Rel8.Table.Name ( namesFromLabels )
54−import Rel8.Table.Opaleye ( castTable, exprsWithNames )
55−import qualified Rel8.Table.Opaleye as T
56import Rel8.Table.Serialize ( Serializable, parse )
26import Rel8.Table.Serialize ( Serializable, parse )
57−import Rel8.Table.Undefined ( undefined )
58
27
59-- text
28-- text
60import qualified Data.Text as Text
29import qualified Data.Text as Text
61import Data.Text.Encoding ( encodeUtf8 )
30import Data.Text.Encoding ( encodeUtf8 )
62
31
63
32
64−-- | Run a @SELECT@ statement, returning all rows.
33+-- | Run a @SELECT@ query, returning all rows.
65select :: forall exprs a. Serializable exprs a
34select :: forall exprs a. Serializable exprs a
66− => Query exprs -> Hasql.Statement () [a]
35+ => Connection -> Query exprs -> IO [a]
67−select query = Hasql.Statement bytes params decode prepare
36+select c query = case sqlForQuery query of
68− where
37+ Nothing -> pure []
69− bytes = encodeUtf8 (Text.pack sql)
38+ Just sql -> Hasql.run session c >>= either throwIO pure
70− params = Hasql.noParams
39+ where
71− decode = Hasql.rowList (parse @exprs @a)
40+ session = Hasql.statement () statement
72− prepare = False
41+ statement = Hasql.Statement bytes params decode prepare
73− sql = show doc
42+ bytes = encodeUtf8 (Text.pack sql)
74− doc = ppSelect query
43+ params = Hasql.noParams
75−
44+ decode = Hasql.rowList (parse @exprs @a)
76−
45+ prepare = False
77−ppSelect :: Table Expr a => Query a -> Doc
46+
78−ppSelect query =
47+
79− Opaleye.ppSql $ primSelectWith names (toCols exprs') primQuery'
48+selectWithNames :: forall exprs a names.
80− where
81− names = namesFromLabels
82− (exprs, primQuery, _) =
83− Opaleye.runSimpleQueryArrStart (toOpaleye query) ()
84− (exprs', primQuery') = case optimize primQuery of
85− Empty -> (undefined, Opaleye.Product (pure (pure Opaleye.Unit)) never)
86− Unit -> (exprs, Opaleye.Unit)
87− Optimized pq -> (exprs, pq)
88− never = pure (toPrimExpr false)
89−
90−
91−ppRows :: Table Expr a => Query a -> Doc
92−ppRows query = case optimize primQuery of
93− -- Special case VALUES because we can't use DEFAULT inside a SELECT
94− Optimized (Opaleye.Values symbols rows)
95− | eqSymbols symbols (toList (T.exprs a)) ->
96− Opaleye.ppValues_ (map Opaleye.sqlExpr <$> toList rows)
97− _ -> ppSelect query
98− where
99− (a, primQuery, _) = Opaleye.runSimpleQueryArrStart (toOpaleye query) ()
100−
101− eqSymbols (symbol : symbols) (Opaleye.AttrExpr symbol' : exprs)
102− | eqSymbol symbol symbol' = eqSymbols symbols exprs
103− | otherwise = False
104− eqSymbols [] [] = True
105− eqSymbols _ _ = False
106−
107− eqSymbol
108− (Opaleye.Symbol name (Opaleye.UnsafeTag tag))
109− (Opaleye.Symbol name' (Opaleye.UnsafeTag tag'))
110− = name == name' && tag == tag'
111−
112−
113−ppPrimSelect :: Query a -> (Optimized Doc, a)
114−ppPrimSelect query =
115− (Opaleye.ppSql . primSelect <$> optimize primQuery, a)
116− where
117− (a, primQuery, _) = Opaleye.runSimpleQueryArrStart (toOpaleye query) ()
118−
119−
120−type Optimized :: Type -> Type
121−data Optimized a = Empty | Unit | Optimized a
122− deriving stock (Functor, Foldable, Traversable, Show)
123−
124−
125−optimize :: Opaleye.PrimQuery' a -> Optimized (Opaleye.PrimQuery' Void)
126−optimize query = case Opaleye.removeEmpty (Opaleye.optimize query) of
127− Nothing -> Empty
128− Just Opaleye.Unit -> Unit
129− Just query' -> Optimized query'
130−
131−
132−primSelect :: Opaleye.PrimQuery' Void -> Opaleye.Select
133−primSelect = Opaleye.foldPrimQuery Opaleye.sqlQueryGenerator
134−
135−
136−primSelectWith :: Selects names exprs
49+ ( Selects names exprs
137− => names -> exprs -> Opaleye.PrimQuery' Void -> Opaleye.Select
50+ , Serializable exprs a
138−primSelectWith names exprs query =
51+ )
139− Opaleye.SelectFrom $ Opaleye.newSelect
52+ => Connection -> names -> Query exprs -> IO [a]
140− { Opaleye.attrs = Opaleye.SelectAttrs attrs
53+selectWithNames c names query = case sqlForQueryWithNames names query of
141− , Opaleye.tables = Opaleye.oneTable (primSelect query)
54+ Nothing -> pure []
142− }
55+ Just sql -> Hasql.run session c >>= either throwIO pure
143− where
56+ where
144− attrs = makeAttr <$> exprsWithNames names (castTable exprs)
57+ session = Hasql.statement () statement
145− where
58+ statement = Hasql.Statement bytes params decode prepare
146− makeAttr (label, expr) =
59+ bytes = encodeUtf8 (Text.pack sql)
147− (Opaleye.sqlExpr expr, Just (Opaleye.SqlColumn label))
60+ params = Hasql.noParams
61+ decode = Hasql.rowList (parse @exprs @a)
62+ prepare = False
src/Rel8/Statement/Set.hsdeleted−33
@@ -1,33 +0,0 @@
1−{-# language MonoLocalBinds #-}
2−{-# language NamedFieldPuns #-}
3−
4−module Rel8.Statement.Set
5− ( ppSet
6− )
7−where
8−
9−-- base
10−import Data.Foldable ( toList )
11−import Prelude ()
12−
13−-- opaleye
14−import qualified Opaleye.Internal.HaskellDB.Sql.Print as Opaleye
15−import qualified Opaleye.Internal.Sql as Opaleye
16−
17−-- pretty
18−import Text.PrettyPrint ( Doc, (<+>), equals, text )
19−
20−-- rel8
21−import Rel8.Schema.Name ( Selects, ppColumn )
22−import Rel8.Schema.Table ( TableSchema(..) )
23−import Rel8.Table.Opaleye ( attributes, exprsWithNames )
24−
25−
26−ppSet :: Selects names exprs
27− => TableSchema names -> (exprs -> exprs) -> Doc
28−ppSet schema@TableSchema {columns} f =
29− text "SET" <+> Opaleye.commaV ppAssign (toList assigns)
30− where
31− assigns = exprsWithNames columns (f (attributes schema))
32− ppAssign (column, expr) =
33− ppColumn column <+> equals <+> Opaleye.ppSqlExpr (Opaleye.sqlExpr expr)
src/Rel8/Statement/Update.hs+56−38
@@ -1,37 +1,39 @@
1−{-# language DuplicateRecordFields #-}
2{-# language GADTs #-}
1{-# language GADTs #-}
3{-# language NamedFieldPuns #-}
2{-# language NamedFieldPuns #-}
4−{-# language RecordWildCards #-}
3+{-# language ScopedTypeVariables #-}
5{-# language StandaloneKindSignatures #-}
4{-# language StandaloneKindSignatures #-}
6−{-# language StrictData #-}
5+{-# language TypeApplications #-}
7
6
8module Rel8.Statement.Update
7module Rel8.Statement.Update
9 ( Update(..)
8 ( Update(..)
10 , update
9 , update
11− , ppUpdate
12 )
10 )
13where
11where
14
12
15-- base
13-- base
14+import Control.Exception ( throwIO )
16import Data.Kind ( Type )
15import Data.Kind ( Type )
17import Prelude
16import Prelude
18
17
19-- hasql
18-- hasql
19+import Hasql.Connection ( Connection )
20+import qualified Hasql.Decoders as Hasql
20import qualified Hasql.Encoders as Hasql
21import qualified Hasql.Encoders as Hasql
22+import qualified Hasql.Session as Hasql
21import qualified Hasql.Statement as Hasql
23import qualified Hasql.Statement as Hasql
22
24
23−-- pretty
25+-- opaleye
24−import Text.PrettyPrint ( Doc, (<+>), ($$), text )
26+import qualified Opaleye.Internal.Manipulation as Opaleye
25
27
26-- rel8
28-- rel8
27import Rel8.Expr ( Expr )
29import Rel8.Expr ( Expr )
28−import Rel8.Query ( Query )
30+import Rel8.Expr.Opaleye ( toColumn, toPrimExpr )
29import Rel8.Schema.Name ( Selects )
31import Rel8.Schema.Name ( Selects )
30−import Rel8.Schema.Table ( TableSchema(..), ppTable )
32+import Rel8.Schema.Table ( TableSchema )
31−import Rel8.Statement.Returning ( Returning, decodeReturning, ppReturning )
33+import Rel8.Statement.Returning ( Returning( Projection, NumberOfRowsAffected ) )
32−import Rel8.Statement.Set ( ppSet )
34+import Rel8.Table ( fromColumns, toColumns )
33−import Rel8.Statement.Using ( ppFrom )
35+import Rel8.Table.Opaleye ( castTable, table, unpackspec )
34−import Rel8.Statement.Where ( ppWhere )
36+import Rel8.Table.Serialize ( Serializable, parse )
35
37
36-- text
38-- text
37import qualified Data.Text as Text
39import qualified Data.Text as Text
@@ -44,12 +46,9 @@ data Update a where
44 Update :: Selects names exprs =>
46 Update :: Selects names exprs =>
45 { target :: TableSchema names
47 { target :: TableSchema names
46 -- ^ Which table to update.
48 -- ^ Which table to update.
47− , from :: Query from
48− -- ^ @FROM@ clause — this can be used to join against other tables,
49− -- and its results can be referenced in the @SET@ and @WHERE@ clauses.
50− , set :: from -> exprs -> exprs
49+ , set :: exprs -> exprs
51 -- ^ How to update each selected row.
50 -- ^ How to update each selected row.
52− , updateWhere :: from -> exprs -> Expr Bool
51+ , updateWhere :: exprs -> Expr Bool
53 -- ^ Which rows to select for update.
52 -- ^ Which rows to select for update.
54 , returning :: Returning names a
53 , returning :: Returning names a
55 -- ^ What to return from the @UPDATE@ statement.
54 -- ^ What to return from the @UPDATE@ statement.
@@ -57,27 +56,46 @@ data Update a where
57 -> Update a
56 -> Update a
58
57
59
58
60−ppUpdate :: Update a -> Doc
59+-- | Run an @UPDATE@ statement.
61−ppUpdate Update {..} = case ppFrom from of
60+update :: Connection -> Update a -> IO a
62− Nothing ->
61+update c Update {target, set, updateWhere, returning} =
63− text "UPDATE" <+> ppTable target $$
62+ case returning of
64− ppSet target id $$
63+ NumberOfRowsAffected -> Hasql.run session c >>= either throwIO pure
65− text "WHERE false"
64+ where
66− Just (fromDoc, i) ->
65+ session = Hasql.statement () statement
67− text "UPDATE" <+> ppTable target $$
66+ statement = Hasql.Statement bytes params decode prepare
68− ppSet target (set i) $$
67+ bytes = encodeUtf8 $ Text.pack sql
69− fromDoc $$
68+ params = Hasql.noParams
70− ppWhere target (updateWhere i) $$
69+ decode = Hasql.rowsAffected
71− ppReturning target returning
70+ prepare = False
71+ sql = Opaleye.arrangeUpdateSql target' set' where'
72+ where
73+ target' = table $ toColumns <$> target
74+ set' = toColumns . set . fromColumns
75+ where' = toColumn . toPrimExpr . updateWhere . fromColumns
72
76
77+ Projection project -> Hasql.run session c >>= either throwIO pure
78+ where
79+ session = Hasql.statement () statement
80+ statement = Hasql.Statement bytes params decode prepare
81+ bytes = encodeUtf8 $ Text.pack sql
82+ params = Hasql.noParams
83+ decode = decoder project
84+ prepare = False
85+ sql =
86+ Opaleye.arrangeUpdateReturningSql
87+ unpackspec
88+ target'
89+ set'
90+ where'
91+ project'
92+ where
93+ target' = table $ toColumns <$> target
94+ set' = toColumns . set . fromColumns
95+ where' = toColumn . toPrimExpr . updateWhere . fromColumns
96+ project' = castTable . toColumns . project . fromColumns
73
97
74−-- | Run an @UPDATE@ statement.
75−update :: Update a -> Hasql.Statement () a
76−update u@Update {returning} = Hasql.Statement bytes params decode prepare
77 where
98 where
78− bytes = encodeUtf8 $ Text.pack sql
99+ decoder :: forall exprs projection a. Serializable projection a
79− params = Hasql.noParams
100+ => (exprs -> projection) -> Hasql.Result [a]
80− decode = decodeReturning returning
101+ decoder _ = Hasql.rowList (parse @projection @a)
81− prepare = False
82− sql = show doc
83− doc = ppUpdate u
src/Rel8/Statement/Using.hsdeleted−36
@@ -1,36 +0,0 @@
1−module Rel8.Statement.Using
2− ( ppFrom
3− , ppUsing
4− )
5−where
6−
7−-- base
8−import Prelude
9−
10−-- pretty
11−import Text.PrettyPrint ( Doc, (<+>), parens, text )
12−
13−-- rel8
14−import Rel8.Query ( Query )
15−import Rel8.Schema.Table ( TableSchema(..), ppTable )
16−import Rel8.Statement.Select ( Optimized(..), ppPrimSelect )
17−
18−
19−ppFrom :: Query a -> Maybe (Doc, a)
20−ppFrom = ppJoin "FROM"
21−
22−
23−ppUsing :: Query a -> Maybe (Doc, a)
24−ppUsing = ppJoin "USING"
25−
26−
27−ppJoin :: String -> Query a -> Maybe (Doc, a)
28−ppJoin clause join = do
29− doc <- case ofrom of
30− Empty -> Nothing
31− Unit -> Just mempty
32− Optimized doc -> Just $ text clause <+> parens doc <+> ppTable alias
33− pure (doc, a)
34− where
35− alias = TableSchema {name = "T1", schema = Nothing, columns = ()}
36− (ofrom, a) = ppPrimSelect join
src/Rel8/Statement/View.hs+28−43
@@ -3,76 +3,61 @@
3
3
4module Rel8.Statement.View
4module Rel8.Statement.View
5 ( createView
5 ( createView
6− , createOrReplaceView
7 )
6 )
8where
7where
9
8
10-- base
9-- base
10+import Control.Exception ( throwIO )
11+import Control.Monad ( (>=>) )
12+import Data.Foldable ( fold )
13+import Data.Maybe ( fromMaybe )
11import Prelude
14import Prelude
12
15
13-- hasql
16-- hasql
17+import Hasql.Connection ( Connection )
14import qualified Hasql.Decoders as Hasql
18import qualified Hasql.Decoders as Hasql
15import qualified Hasql.Encoders as Hasql
19import qualified Hasql.Encoders as Hasql
20+import qualified Hasql.Session as Hasql
16import qualified Hasql.Statement as Hasql
21import qualified Hasql.Statement as Hasql
17
22
18-- rel8
23-- rel8
19import Rel8.Query ( Query )
24import Rel8.Query ( Query )
25+import Rel8.Query.SQL ( sqlForQueryWithNames )
20import Rel8.Schema.Name ( Selects )
26import Rel8.Schema.Name ( Selects )
21−import Rel8.Schema.Table ( TableSchema )
27+import Rel8.Schema.Table ( TableSchema( TableSchema ) )
22−import Rel8.Statement.Insert ( ppInto )
28+import Rel8.Table.Alternative ( emptyTable )
23−import Rel8.Statement.Select ( ppSelect )
24−
25−-- pretty
26−import Text.PrettyPrint ( Doc, (<+>), ($$), text )
27
29
28-- text
30-- text
29import qualified Data.Text as Text
31import qualified Data.Text as Text
30import Data.Text.Encoding ( encodeUtf8 )
32import Data.Text.Encoding ( encodeUtf8 )
31
33
32
34
33−data CreateView = Create | CreateOrReplace
34−
35−
36-- | Given a 'TableSchema' and 'Query', @createView@ runs a @CREATE VIEW@
35-- | Given a 'TableSchema' and 'Query', @createView@ runs a @CREATE VIEW@
37-- statement that will save the given query as a view. This can be useful if
36-- statement that will save the given query as a view. This can be useful if
38-- you want to share Rel8 queries with other applications.
37-- you want to share Rel8 queries with other applications.
39createView :: Selects names exprs
38createView :: Selects names exprs
40− => TableSchema names -> Query exprs -> Hasql.Statement () ()
39+ => TableSchema names -> Query exprs -> Connection -> IO ()
41−createView =
40+createView (TableSchema name mschema names) query =
42− createViewGeneric Create
41+ Hasql.run session >=> either throwIO pure
43−
44−
45−-- | Given a 'TableSchema' and 'Query', @createOrReplaceView@ runs a
46−-- @CREATE OR REPLACE VIEW@ statement that will save the given query
47−-- as a view, replacing the current view definition if it exists and
48−-- adheres to the restrictions in place for replacing a view in
49−-- PostgreSQL.
50−createOrReplaceView :: Selects names exprs
51− => TableSchema names -> Query exprs -> Hasql.Statement () ()
52−createOrReplaceView =
53− createViewGeneric CreateOrReplace
54−
55−
56−createViewGeneric :: Selects names exprs
57− => CreateView -> TableSchema names -> Query exprs -> Hasql.Statement () ()
58−createViewGeneric replace schema query =
59− Hasql.Statement bytes params decode prepare
60 where
42 where
43+ session = Hasql.statement () statement
44+ statement = Hasql.Statement bytes params decode prepare
61 bytes = encodeUtf8 (Text.pack sql)
45 bytes = encodeUtf8 (Text.pack sql)
62 params = Hasql.noParams
46 params = Hasql.noParams
63 decode = Hasql.noResult
47 decode = Hasql.noResult
64 prepare = False
48 prepare = False
65− sql = show doc
49+ sql = "CREATE VIEW " <> title <> " AS " <> select
66− doc = ppCreateView schema query replace
50+ where
67−
51+ title = case mschema of
68−
52+ Nothing -> quote name
69−ppCreateView :: Selects names exprs
53+ Just schema -> quote schema <> "." <> quote name
70− => TableSchema names -> Query exprs -> CreateView -> Doc
54+ select = fromMaybe fallback $ sqlForQueryWithNames names query
71−ppCreateView schema query replace =
55+ where
72− createOrReplace replace <+>
56+ fallback = fold $ sqlForQueryWithNames names emptyTable
73− ppInto schema $$
57+
74− text "AS" <+>
58+
75− ppSelect query
59+quote :: String -> String
60+quote string = "\"" <> concatMap go string <> "\""
76 where
61 where
77− createOrReplace Create = text "CREATE VIEW"
62+ go '"' = "\"\""
78− createOrReplace CreateOrReplace = text "CREATE OR REPLACE VIEW"
63+ go c = [c]
src/Rel8/Statement/Where.hsdeleted−31
@@ -1,31 +0,0 @@
1−{-# language MonoLocalBinds #-}
2−
3−module Rel8.Statement.Where
4− ( ppWhere
5− )
6−where
7−
8−-- base
9−import Prelude
10−
11−-- opaleye
12−import qualified Opaleye.Internal.HaskellDB.Sql.Print as Opaleye
13−import qualified Opaleye.Internal.Sql as Opaleye
14−
15−-- pretty
16−import Text.PrettyPrint ( Doc, (<+>), text )
17−
18−-- rel8
19−import Rel8.Expr ( Expr )
20−import Rel8.Expr.Opaleye ( toPrimExpr )
21−import Rel8.Schema.Name ( Selects )
22−import Rel8.Schema.Table ( TableSchema )
23−import Rel8.Table.Opaleye ( attributes )
24−
25−
26−ppWhere :: Selects names exprs
27− => TableSchema names -> (exprs -> Expr Bool) -> Doc
28−ppWhere schema where_ = text "WHERE" <+> ppExpr condition
29− where
30− ppExpr = Opaleye.ppSqlExpr . Opaleye.sqlExpr . toPrimExpr
31− condition = where_ (attributes schema)
src/Rel8/Table.hs+74−57
@@ -14,34 +14,31 @@ module Rel8.Table
14 ( Table
14 ( Table
15 ( Columns, Context, fromColumns, toColumns
15 ( Columns, Context, fromColumns, toColumns
16 , FromExprs, fromResult, toResult
16 , FromExprs, fromResult, toResult
17− , Transpose
18 )
17 )
19 , Congruent
18 , Congruent
20− , TTable, TColumns, TContext, TFromExprs, TTranspose
19+ , TTable, TColumns, TContext, TFromExprs
21− , TSerialize
22 )
20 )
23where
21where
24
22
25-- base
23-- base
26−import Data.Functor.Identity ( Identity( Identity ) )
27import Data.Kind ( Constraint, Type )
24import Data.Kind ( Constraint, Type )
28import GHC.Generics ( Generic, Rep, from, to )
25import GHC.Generics ( Generic, Rep, from, to )
29import Prelude hiding ( null )
26import Prelude hiding ( null )
30
27
31-- rel8
28-- rel8
32import Rel8.FCF ( Eval, Exp )
29import Rel8.FCF ( Eval, Exp )
33−import Rel8.Generic.Map ( Map )
30+import Rel8.Generic.Map ( GMap )
34import Rel8.Generic.Table.Record
31import Rel8.Generic.Table.Record
35− ( GTable, GColumns, GContext, gfromColumns, gtoColumns
32+ ( GTable, GColumns, GContext
36− , GSerialize, gfromResult, gtoResult
33+ , gfromColumns, gtoColumns, gfromResult, gtoResult
37 )
34 )
38import Rel8.Generic.Record ( Record(..) )
35import Rel8.Generic.Record ( Record(..) )
36+import Rel8.Schema.Context ( Col, UnCol )
39import Rel8.Schema.HTable ( HTable )
37import Rel8.Schema.HTable ( HTable )
40−import Rel8.Schema.HTable.Identity ( HIdentity( HIdentity ) )
38+import Rel8.Schema.HTable.Identity ( HIdentity(..) )
41import qualified Rel8.Schema.Kind as K
39import qualified Rel8.Schema.Kind as K
42−import Rel8.Schema.Null ( Sql )
43import Rel8.Schema.Result ( Result )
40import Rel8.Schema.Result ( Result )
44−import Rel8.Type ( DBType )
41+import Rel8.Schema.Spec ( KnownSpec )
45
42
46
43
47-- | @Table@s are one of the foundational elements of Rel8, and describe data
44-- | @Table@s are one of the foundational elements of Rel8, and describe data
@@ -56,13 +53,7 @@ import Rel8.Type ( DBType )
56-- yourself, as anything that's an instance of 'Rel8.Rel8able' is always a
53-- yourself, as anything that's an instance of 'Rel8.Rel8able' is always a
57-- 'Table'.
54-- 'Table'.
58type Table :: K.Context -> Type -> Constraint
55type Table :: K.Context -> Type -> Constraint
59−class
60− ( HTable (Columns a)
61− , context ~ Context a
62− , a ~ Transpose context a
63− )
64− => Table context a | a -> context
56+class (HTable (Columns a), context ~ Context a) => Table context a | a -> context where
65− where
66 -- | The 'HTable' functor that describes the schema of this table.
57 -- | The 'HTable' functor that describes the schema of this table.
67 type Columns a :: K.HTable
58 type Columns a :: K.HTable
68
59
@@ -73,85 +64,96 @@ class
73 -- corresponding Haskell type.
64 -- corresponding Haskell type.
74 type FromExprs a :: Type
65 type FromExprs a :: Type
75
66
76− type Transpose (context' :: K.Context) a :: Type
77−
78−
79− toColumns :: a -> Columns a context
67+ toColumns :: a -> Columns a (Col context)
80− fromColumns :: Columns a context -> a
68+ fromColumns :: Columns a (Col context) -> a
81
69
82− fromResult :: Columns a Result -> FromExprs a
70+ fromResult :: Columns a (Col Result) -> FromExprs a
83− toResult :: FromExprs a -> Columns a Result
71+ toResult :: FromExprs a -> Columns a (Col Result)
84
72
85 type Columns a = GColumns TColumns (Rep (Record a))
73 type Columns a = GColumns TColumns (Rep (Record a))
86 type Context a = GContext TContext (Rep (Record a))
74 type Context a = GContext TContext (Rep (Record a))
87− type FromExprs a = Map TFromExprs a
75+ type FromExprs a = DefaultFromExprs a
88− type Transpose context a = Map (TTranspose context) a
89
76
90 default toColumns ::
77 default toColumns ::
91 ( Generic (Record a)
78 ( Generic (Record a)
92− , GTable (TTable context) TColumns (Rep (Record a))
79+ , GTable (TTable context) TColumns TFromExprs (Rep (Record a))
93 , Columns a ~ GColumns TColumns (Rep (Record a))
80 , Columns a ~ GColumns TColumns (Rep (Record a))
94 )
81 )
95− => a -> Columns a context
82+ => a -> Columns a (Col context)
96 toColumns =
83 toColumns =
84+ gtoColumns
97− gtoColumns @(TTable context) @TColumns toColumns .
85+ @(TTable context)
86+ @TColumns
87+ @TFromExprs
88+ toColumns .
98 from .
89 from .
99 Record
90 Record
100
91
101 default fromColumns ::
92 default fromColumns ::
102 ( Generic (Record a)
93 ( Generic (Record a)
103− , GTable (TTable context) TColumns (Rep (Record a))
94+ , GTable (TTable context) TColumns TFromExprs (Rep (Record a))
104 , Columns a ~ GColumns TColumns (Rep (Record a))
95 , Columns a ~ GColumns TColumns (Rep (Record a))
105 )
96 )
106− => Columns a context -> a
97+ => Columns a (Col context) -> a
107 fromColumns =
98 fromColumns =
108 unrecord .
99 unrecord .
109 to .
100 to .
101+ gfromColumns
110− gfromColumns @(TTable context) @TColumns fromColumns
102+ @(TTable context)
103+ @TColumns
104+ @TFromExprs
105+ fromColumns
111
106
112 default toResult ::
107 default toResult ::
113 ( Generic (Record (FromExprs a))
108 ( Generic (Record (FromExprs a))
114− , GSerialize TSerialize TColumns (Rep (Record a)) (Rep (Record (FromExprs a)))
109+ , GTable (TTable context) TColumns TFromExprs (Rep (Record a))
115 , Columns a ~ GColumns TColumns (Rep (Record a))
110 , Columns a ~ GColumns TColumns (Rep (Record a))
111+ , Rep (Record (FromExprs a)) ~ GMap TFromExprs (Rep (Record a))
116 )
112 )
117− => FromExprs a -> Columns a Result
113+ => FromExprs a -> Columns a (Col Result)
118 toResult =
114 toResult =
119 gtoResult
115 gtoResult
120− @TSerialize
116+ @(TTable context)
121 @TColumns
117 @TColumns
118+ @TFromExprs
122 @(Rep (Record a))
119 @(Rep (Record a))
123− @(Rep (Record (FromExprs a)))
124 (\(_ :: proxy x) -> toResult @(Context x) @x) .
120 (\(_ :: proxy x) -> toResult @(Context x) @x) .
125 from .
121 from .
126 Record
122 Record
127
123
128 default fromResult ::
124 default fromResult ::
129 ( Generic (Record (FromExprs a))
125 ( Generic (Record (FromExprs a))
130− , GSerialize TSerialize TColumns (Rep (Record a)) (Rep (Record (FromExprs a)))
126+ , GTable (TTable context) TColumns TFromExprs (Rep (Record a))
131 , Columns a ~ GColumns TColumns (Rep (Record a))
127 , Columns a ~ GColumns TColumns (Rep (Record a))
128+ , Rep (Record (FromExprs a)) ~ GMap TFromExprs (Rep (Record a))
132 )
129 )
133− => Columns a Result -> FromExprs a
130+ => Columns a (Col Result) -> FromExprs a
134 fromResult =
131 fromResult =
135 unrecord .
132 unrecord .
136 to .
133 to .
137 gfromResult
134 gfromResult
138− @TSerialize
135+ @(TTable context)
139 @TColumns
136 @TColumns
137+ @TFromExprs
140 @(Rep (Record a))
138 @(Rep (Record a))
141− @(Rep (Record (FromExprs a)))
142 (\(_ :: proxy x) -> fromResult @(Context x) @x)
139 (\(_ :: proxy x) -> fromResult @(Context x) @x)
143
140
144
141
145−instance Sql DBType a => Table Result (Identity a) where
142+type DefaultFromExprs :: Type -> Type
146− type Columns (Identity a) = HIdentity a
143+type family DefaultFromExprs a where
147− type Context (Identity a) = Result
144+ DefaultFromExprs (t a b c d e f g) =
145+ t (FromExprs a) (FromExprs b) (FromExprs c) (FromExprs d) (FromExprs e)
148− type FromExprs (Identity a) = a
146+ (FromExprs f) (FromExprs g)
149− type Transpose to (Identity a) = to a
147+ DefaultFromExprs (t a b c d e f) =
150−
148+ t (FromExprs a) (FromExprs b) (FromExprs c) (FromExprs d) (FromExprs e)
151− toColumns = HIdentity
149+ (FromExprs f)
152− fromColumns (HIdentity a) = a
150+ DefaultFromExprs (t a b c d e) =
153− toResult a = HIdentity (Identity a)
151+ t (FromExprs a) (FromExprs b) (FromExprs c) (FromExprs d) (FromExprs e)
154− fromResult (HIdentity (Identity a)) = a
152+ DefaultFromExprs (t a b c d) =
153+ t (FromExprs a) (FromExprs b) (FromExprs c) (FromExprs d)
154+ DefaultFromExprs (t a b c) = t (FromExprs a) (FromExprs b) (FromExprs c)
155+ DefaultFromExprs (t a b) = t (FromExprs a) (FromExprs b)
156+ DefaultFromExprs (t a) = t (FromExprs a)
155
157
156
158
157data TTable :: K.Context -> Type -> Exp Constraint
159data TTable :: K.Context -> Type -> Exp Constraint
@@ -170,15 +172,30 @@ data TFromExprs :: Type -> Exp Type
170type instance Eval (TFromExprs a) = FromExprs a
172type instance Eval (TFromExprs a) = FromExprs a
171
173
172
174
173−data TTranspose :: K.Context -> Type -> Exp Type
175+-- | Any 'HTable' is also a 'Table'.
174−type instance Eval (TTranspose context a) = Transpose context a
176+instance (context ~ UnCol hcontext, hcontext ~ Col context, HTable t) =>
177+ Table context (t hcontext)
178+ where
179+ type Columns (t hcontext) = t
180+ type Context (t hcontext) = UnCol hcontext
181+ type FromExprs (t hcontext) = t (Col Result)
175
182
183+ toColumns = id
184+ fromColumns = id
185+ toResult = id
186+ fromResult = id
176
187
177−data TSerialize :: Type -> Type -> Exp Constraint
188+
178−type instance Eval (TSerialize expr a) =
189+-- | Any context is trivially a table.
179− ( Table (Context expr) expr
190+instance KnownSpec spec => Table context (Col context spec) where
180− , a ~ FromExprs expr
191+ type Columns (Col context spec) = HIdentity spec
181− )
192+ type Context (Col context spec) = context
193+ type FromExprs (Col context spec) = Col Result spec
194+
195+ toColumns = HIdentity
196+ fromColumns = unHIdentity
197+ toResult = HIdentity
198+ fromResult = unHIdentity
182
199
183
200
184instance (Table context a, Table context b) => Table context (a, b)
201instance (Table context a, Table context b) => Table context (a, b)
src/Rel8/Table/ADT.hs+19−13
@@ -7,7 +7,7 @@
7{-# language ScopedTypeVariables #-}
7{-# language ScopedTypeVariables #-}
8{-# language StandaloneKindSignatures #-}
8{-# language StandaloneKindSignatures #-}
9{-# language TypeApplications #-}
9{-# language TypeApplications #-}
10−{-# language TypeFamilyDependencies #-}
10+{-# language TypeFamilies #-}
11{-# language UndecidableInstances #-}
11{-# language UndecidableInstances #-}
12{-# language UndecidableSuperClasses #-}
12{-# language UndecidableSuperClasses #-}
13
13
@@ -27,7 +27,7 @@ where
27
27
28-- base
28-- base
29import Data.Kind ( Constraint, Type )
29import Data.Kind ( Constraint, Type )
30−import GHC.Generics ( Generic, from, to )
30+import GHC.Generics ( Generic, Rep, from, to )
31import GHC.TypeLits ( Symbol )
31import GHC.TypeLits ( Symbol )
32import Prelude
32import Prelude
33
33
@@ -44,24 +44,28 @@ import Rel8.Generic.Construction
44 , GGName, ggname
44 , GGName, ggname
45 , GGAggregate, ggaggregate
45 , GGAggregate, ggaggregate
46 )
46 )
47+import Rel8.Generic.Map ( GMap )
47import Rel8.Generic.Record ( Record( Record ), unrecord )
48import Rel8.Generic.Record ( Record( Record ), unrecord )
48import Rel8.Generic.Rel8able
49import Rel8.Generic.Rel8able
49 ( Rel8able
50 ( Rel8able
50 , GRep, GColumns, gfromColumns, gtoColumns
51 , GRep, GColumns, gfromColumns, gtoColumns
51 , GFromExprs, gfromResult, gtoResult
52 , GFromExprs, gfromResult, gtoResult
52− , TSerialize, deserialize, serialize
53 )
53 )
54import qualified Rel8.Generic.Table.ADT as G
54import qualified Rel8.Generic.Table.ADT as G
55import qualified Rel8.Kind.Algebra as K
55import qualified Rel8.Kind.Algebra as K
56+import Rel8.Schema.Context ( Col )
56import Rel8.Schema.HTable ( HTable )
57import Rel8.Schema.HTable ( HTable )
57import qualified Rel8.Schema.Kind as K
58import qualified Rel8.Schema.Kind as K
58import Rel8.Schema.Name ( Name )
59import Rel8.Schema.Name ( Name )
59import Rel8.Schema.Result ( Result )
60import Rel8.Schema.Result ( Result )
60−import Rel8.Table ( Table, TColumns )
61+import Rel8.Table
62+ ( Table, fromResult, toResult
63+ , TTable, TColumns, TFromExprs
64+ )
61
65
62
66
63type ADT :: K.Rel8able -> K.Rel8able
67type ADT :: K.Rel8able -> K.Rel8able
64−newtype ADT t context = ADT (GColumnsADT t context)
68+newtype ADT t context = ADT (GColumnsADT t (Col context))
65
69
66
70
67instance ADTable t => Rel8able (ADT t) where
71instance ADTable t => Rel8able (ADT t) where
@@ -75,19 +79,19 @@ instance ADTable t => Rel8able (ADT t) where
75 unrecord .
79 unrecord .
76 to .
80 to .
77 G.gfromResultADT
81 G.gfromResultADT
78− @TSerialize
82+ @(TTable Expr)
79 @TColumns
83 @TColumns
84+ @TFromExprs
80 @(Eval (ADTRep t Expr))
85 @(Eval (ADTRep t Expr))
81− @(Eval (ADTRep t Result))
82− (\(_ :: proxy x) -> deserialize @_ @x)
86+ (\(_ :: proxy x) -> fromResult @_ @x)
83
87
84 gtoResult =
88 gtoResult =
85 G.gtoResultADT
89 G.gtoResultADT
86− @TSerialize
90+ @(TTable Expr)
87 @TColumns
91 @TColumns
92+ @TFromExprs
88 @(Eval (ADTRep t Expr))
93 @(Eval (ADTRep t Expr))
89− @(Eval (ADTRep t Result))
90− (\(_ :: proxy x) -> serialize @_ @x) .
94+ (\(_ :: proxy x) -> toResult @_ @x) .
91 from .
95 from .
92 Record
96 Record
93
97
@@ -96,13 +100,15 @@ type ADTable :: K.Rel8able -> Constraint
96class
100class
97 ( Generic (Record (t Result))
101 ( Generic (Record (t Result))
98 , HTable (GColumnsADT t)
102 , HTable (GColumnsADT t)
99− , G.GSerializeADT TSerialize TColumns (Eval (ADTRep t Expr)) (Eval (ADTRep t Result))
103+ , G.GTableADT (TTable Expr) TColumns TFromExprs (Eval (ADTRep t Expr))
104+ , GMap TFromExprs (Rep (Record (t Expr))) ~ Rep (Record (t Result))
100 )
105 )
101 => ADTable t
106 => ADTable t
102instance
107instance
103 ( Generic (Record (t Result))
108 ( Generic (Record (t Result))
104 , HTable (GColumnsADT t)
109 , HTable (GColumnsADT t)
105− , G.GSerializeADT TSerialize TColumns (Eval (ADTRep t Expr)) (Eval (ADTRep t Result))
110+ , G.GTableADT (TTable Expr) TColumns TFromExprs (Eval (ADTRep t Expr))
111+ , GMap TFromExprs (Rep (Record (t Expr))) ~ Rep (Record (t Result))
106 )
112 )
107 => ADTable t
113 => ADTable t
108
114
src/Rel8/Table/Aggregate.hs+10−20
@@ -16,8 +16,8 @@ import Data.Functor.Identity ( Identity( Identity ) )
16import Prelude
16import Prelude
17
17
18-- rel8
18-- rel8
19−import Rel8.Aggregate ( Aggregate, Aggregates )
19+import Rel8.Aggregate ( Aggregate, Aggregates, Col( A ) )
20−import Rel8.Expr ( Expr )
20+import Rel8.Expr ( Expr, Col( E ) )
21import Rel8.Expr.Aggregate
21import Rel8.Expr.Aggregate
22 ( groupByExpr
22 ( groupByExpr
23 , slistAggExpr
23 , slistAggExpr
@@ -27,7 +27,8 @@ import Rel8.Schema.Dict ( Dict( Dict ) )
27import Rel8.Schema.HTable ( HTable, hfield, htabulate )
27import Rel8.Schema.HTable ( HTable, hfield, htabulate )
28import Rel8.Schema.HTable.Vectorize ( hvectorize )
28import Rel8.Schema.HTable.Vectorize ( hvectorize )
29import Rel8.Schema.Null ( Sql )
29import Rel8.Schema.Null ( Sql )
30−import Rel8.Schema.Spec ( Spec( Spec, info ) )
30+import Rel8.Schema.Spec ( SSpec( SSpec, info ) )
31+import Rel8.Schema.Spec.Constrain ( ConstrainSpec )
31import Rel8.Table ( toColumns, fromColumns )
32import Rel8.Table ( toColumns, fromColumns )
32import Rel8.Table.Eq ( EqTable, eqTable )
33import Rel8.Table.Eq ( EqTable, eqTable )
33import Rel8.Table.List ( ListTable )
34import Rel8.Table.List ( ListTable )
@@ -37,28 +38,17 @@ import Rel8.Type.Eq ( DBEq )
37
38
38-- | Group equal tables together. This works by aggregating each column in the
39-- | Group equal tables together. This works by aggregating each column in the
39-- given table with 'groupByExpr'.
40-- given table with 'groupByExpr'.
40−--
41−-- For example, if we have a table of items, we could group the items by the
42−-- order they belong to:
43−--
44−-- @
45−-- itemsByOrder :: Query (OrderId Expr, ListTable Expr (Item Expr))
46−-- itemsByOrder = aggregate $ do
47−-- item <- each itemSchema
48−-- let orderId = groupBy (itemOrderId item)
49−-- let orderItems = listAgg item
50−-- pure (orderId, orderItems)
51−-- @
52groupBy :: forall exprs aggregates. (EqTable exprs, Aggregates aggregates exprs)
41groupBy :: forall exprs aggregates. (EqTable exprs, Aggregates aggregates exprs)
53 => exprs -> aggregates
42 => exprs -> aggregates
54groupBy = fromColumns . hgroupBy (eqTable @exprs) . toColumns
43groupBy = fromColumns . hgroupBy (eqTable @exprs) . toColumns
55
44
56
45
46+hgroupBy :: HTable t
57−hgroupBy :: HTable t => t (Dict (Sql DBEq)) -> t Expr -> t Aggregate
47+ => t (Dict (ConstrainSpec (Sql DBEq))) -> t (Col Expr) -> t (Col Aggregate)
58−hgroupBy eqs exprs = htabulate $ \field ->
48+hgroupBy eqs exprs = fromColumns $ htabulate $ \field ->
59 case hfield eqs field of
49 case hfield eqs field of
60 Dict -> case hfield exprs field of
50 Dict -> case hfield exprs field of
61− expr -> groupByExpr expr
51+ E expr -> A $ groupByExpr expr
62
52
63
53
64-- | Aggregate rows into a single row containing an array of all aggregated
54-- | Aggregate rows into a single row containing an array of all aggregated
@@ -80,7 +70,7 @@ hgroupBy eqs exprs = htabulate $ \field ->
80listAgg :: Aggregates aggregates exprs => exprs -> ListTable Aggregate aggregates
70listAgg :: Aggregates aggregates exprs => exprs -> ListTable Aggregate aggregates
81listAgg (toColumns -> exprs) = fromColumns $
71listAgg (toColumns -> exprs) = fromColumns $
82 hvectorize
72 hvectorize
83− (\Spec {info} (Identity a) -> slistAggExpr info a)
73+ (\SSpec {info} (Identity (E a)) -> A $ slistAggExpr info a)
84 (pure exprs)
74 (pure exprs)
85
75
86
76
@@ -88,5 +78,5 @@ listAgg (toColumns -> exprs) = fromColumns $
88nonEmptyAgg :: Aggregates aggregates exprs => exprs -> NonEmptyTable Aggregate aggregates
78nonEmptyAgg :: Aggregates aggregates exprs => exprs -> NonEmptyTable Aggregate aggregates
89nonEmptyAgg (toColumns -> exprs) = fromColumns $
79nonEmptyAgg (toColumns -> exprs) = fromColumns $
90 hvectorize
80 hvectorize
91− (\Spec {info} (Identity a) -> snonEmptyAggExpr info a)
81+ (\SSpec {info} (Identity (E a)) -> A $ snonEmptyAggExpr info a)
92 (pure exprs)
82 (pure exprs)
src/Rel8/Table/Bool.hs+6−5
@@ -13,7 +13,7 @@ where
13import Prelude
13import Prelude
14
14
15-- rel8
15-- rel8
16−import Rel8.Expr ( Expr )
16+import Rel8.Expr ( Expr, Col( E, unE ) )
17import Rel8.Expr.Bool ( boolExpr, caseExpr )
17import Rel8.Expr.Bool ( boolExpr, caseExpr )
18import Rel8.Expr.Null ( isNull, unsafeUnnullify )
18import Rel8.Expr.Null ( isNull, unsafeUnnullify )
19import Rel8.Schema.HTable ( htabulate, hfield )
19import Rel8.Schema.HTable ( htabulate, hfield )
@@ -28,7 +28,8 @@ bool :: Table Expr a => a -> a -> Expr Bool -> a
28bool (toColumns -> false) (toColumns -> true) condition =
28bool (toColumns -> false) (toColumns -> true) condition =
29 fromColumns $ htabulate $ \field ->
29 fromColumns $ htabulate $ \field ->
30 case (hfield false field, hfield true field) of
30 case (hfield false field, hfield true field) of
31+ (E falseExpr, E trueExpr) ->
31− (falseExpr, trueExpr) -> boolExpr falseExpr trueExpr condition
32+ E (boolExpr falseExpr trueExpr condition)
32{-# INLINABLE bool #-}
33{-# INLINABLE bool #-}
33
34
34
35
@@ -38,9 +39,9 @@ bool (toColumns -> false) (toColumns -> true) condition =
38case_ :: Table Expr a => [(Expr Bool, a)] -> a -> a
39case_ :: Table Expr a => [(Expr Bool, a)] -> a -> a
39case_ (map (fmap toColumns) -> branches) (toColumns -> fallback) =
40case_ (map (fmap toColumns) -> branches) (toColumns -> fallback) =
40 fromColumns $ htabulate $ \field -> case hfield fallback field of
41 fromColumns $ htabulate $ \field -> case hfield fallback field of
41− fallbackExpr ->
42+ E fallbackExpr ->
42− case map (fmap (`hfield` field)) branches of
43+ case map (fmap (unE . (`hfield` field))) branches of
43− branchExprs -> caseExpr branchExprs fallbackExpr
44+ branchExprs -> E (caseExpr branchExprs fallbackExpr)
44
45
45
46
46-- | Like 'maybe', but to eliminate @null@.
47-- | Like 'maybe', but to eliminate @null@.
src/Rel8/Table/Cols.hsdeleted−50
@@ -1,50 +0,0 @@
1−{-# language DataKinds #-}
2−{-# language FlexibleInstances #-}
3−{-# language MultiParamTypeClasses #-}
4−{-# language StandaloneKindSignatures #-}
5−{-# language TypeFamilies #-}
6−{-# language UndecidableInstances #-}
7−
8−module Rel8.Table.Cols
9− ( Cols( Cols )
10− , fromCols
11− , toCols
12− )
13−where
14−
15−-- base
16−import Data.Kind ( Type )
17−import Prelude
18−
19−-- rel8
20−import qualified Rel8.Schema.Kind as K
21−import Rel8.Schema.HTable ( HTable )
22−import Rel8.Schema.Result ( Result )
23−import Rel8.Table ( Table(..) )
24−
25−
26−type Cols :: K.Context -> K.HTable -> Type
27−newtype Cols context columns = Cols (columns context)
28−
29−
30−instance (HTable columns, context ~ context') =>
31− Table context' (Cols context columns)
32− where
33− type Columns (Cols context columns) = columns
34− type Context (Cols context columns) = context
35− type FromExprs (Cols context columns) = Cols Result columns
36− type Transpose to (Cols context columns) = Cols to columns
37−
38− toColumns (Cols a) = a
39− fromColumns = Cols
40−
41− toResult (Cols a) = a
42− fromResult = Cols
43−
44−
45−fromCols :: Table context a => Cols context (Columns a) -> a
46−fromCols (Cols a) = fromColumns a
47−
48−
49−toCols :: Table context a => a -> Cols context (Columns a)
50−toCols = Cols . toColumns
src/Rel8/Table/Either.hs+35−37
@@ -25,7 +25,6 @@ where
25
25
26-- base
26-- base
27import Data.Bifunctor ( Bifunctor, bimap )
27import Data.Bifunctor ( Bifunctor, bimap )
28−import Data.Functor.Identity ( Identity( Identity ) )
29import Data.Kind ( Type )
28import Data.Kind ( Type )
30import Prelude hiding ( undefined )
29import Prelude hiding ( undefined )
31
30
@@ -33,8 +32,8 @@ import Prelude hiding ( undefined )
33import Control.Comonad ( extract )
32import Control.Comonad ( extract )
34
33
35-- rel8
34-- rel8
36−import Rel8.Aggregate ( Aggregate )
35+import Rel8.Aggregate ( Col( A ), Aggregate )
37−import Rel8.Expr ( Expr )
36+import Rel8.Expr ( Col( E ), Expr )
38import Rel8.Expr.Aggregate ( groupByExpr )
37import Rel8.Expr.Aggregate ( groupByExpr )
39import Rel8.Expr.Serialize ( litExpr )
38import Rel8.Expr.Serialize ( litExpr )
40import Rel8.Kind.Context ( Reifiable )
39import Rel8.Kind.Context ( Reifiable )
@@ -44,17 +43,18 @@ import Rel8.Schema.HTable.Either ( HEitherTable(..) )
44import Rel8.Schema.HTable.Identity ( HIdentity(..) )
43import Rel8.Schema.HTable.Identity ( HIdentity(..) )
45import Rel8.Schema.HTable.Label ( hlabel, hunlabel )
44import Rel8.Schema.HTable.Label ( hlabel, hunlabel )
46import qualified Rel8.Schema.Kind as K
45import qualified Rel8.Schema.Kind as K
47−import Rel8.Schema.Name ( Name )
46+import Rel8.Schema.Name ( Col( N ), Name )
47+import Rel8.Schema.Result ( Col( R ) )
48+import Rel8.Schema.Spec ( Spec( Spec ) )
48import Rel8.Table
49import Rel8.Table
49 ( Table, Columns, Context, fromColumns, toColumns
50 ( Table, Columns, Context, fromColumns, toColumns
50 , FromExprs, fromResult, toResult
51 , FromExprs, fromResult, toResult
51− , Transpose
52 )
52 )
53import Rel8.Table.Bool ( bool )
53import Rel8.Table.Bool ( bool )
54import Rel8.Table.Eq ( EqTable, eqTable )
54import Rel8.Table.Eq ( EqTable, eqTable )
55import Rel8.Table.Nullify ( Nullify, aggregateNullify, guard )
55import Rel8.Table.Nullify ( Nullify, aggregateNullify, guard )
56import Rel8.Table.Ord ( OrdTable, ordTable )
56import Rel8.Table.Ord ( OrdTable, ordTable )
57−import Rel8.Table.Projection ( Biprojectable, Projectable, biproject, project )
57+import Rel8.Table.Recontextualize ( Recontextualize )
58import Rel8.Table.Serialize ( ToExprs )
58import Rel8.Table.Serialize ( ToExprs )
59import Rel8.Table.Undefined ( undefined )
59import Rel8.Table.Undefined ( undefined )
60import Rel8.Type.Tag ( EitherTag( IsLeft, IsRight ), isLeft, isRight )
60import Rel8.Type.Tag ( EitherTag( IsLeft, IsRight ), isLeft, isRight )
@@ -72,29 +72,20 @@ import Data.Functor.Bind ( Bind, (>>-) )
72-- adapted to work with Rel8.
72-- adapted to work with Rel8.
73type EitherTable :: K.Context -> Type -> Type -> Type
73type EitherTable :: K.Context -> Type -> Type -> Type
74data EitherTable context a b = EitherTable
74data EitherTable context a b = EitherTable
75− { tag :: context EitherTag
75+ { tag :: Col context ('Spec EitherTag)
76 , left :: Nullify context a
76 , left :: Nullify context a
77 , right :: Nullify context b
77 , right :: Nullify context b
78 }
78 }
79 deriving stock Functor
79 deriving stock Functor
80
80
81
81
82−instance Biprojectable (EitherTable context) where
83− biproject f g (EitherTable tag a b) =
84− EitherTable tag (project f a) (project g b)
85−
86−
87instance Nullifiable context => Bifunctor (EitherTable context) where
82instance Nullifiable context => Bifunctor (EitherTable context) where
88 bimap f g (EitherTable tag a b) = EitherTable tag (fmap f a) (fmap g b)
83 bimap f g (EitherTable tag a b) = EitherTable tag (fmap f a) (fmap g b)
89
84
90
85
91−instance Projectable (EitherTable context a) where
92− project f (EitherTable tag a b) = EitherTable tag a (project f b)
93−
94−
95instance (context ~ Expr, Table Expr a) => Apply (EitherTable context a) where
86instance (context ~ Expr, Table Expr a) => Apply (EitherTable context a) where
96− EitherTable tag l1 f <.> EitherTable tag' l2 a =
87+ EitherTable (E tag) l1 f <.> EitherTable (E tag') l2 a =
97− EitherTable (tag <> tag') (bool l1 l2 (isLeft tag)) (f <.> a)
88+ EitherTable (E (tag <> tag')) (bool l1 l2 (isLeft tag)) (f <.> a)
98
89
99
90
100instance (context ~ Expr, Table Expr a) => Applicative (EitherTable context a) where
91instance (context ~ Expr, Table Expr a) => Applicative (EitherTable context a) where
@@ -103,9 +94,9 @@ instance (context ~ Expr, Table Expr a) => Applicative (EitherTable context a) w
103
94
104
95
105instance (context ~ Expr, Table Expr a) => Bind (EitherTable context a) where
96instance (context ~ Expr, Table Expr a) => Bind (EitherTable context a) where
106− EitherTable tag l1 a >>- f = case f (extract a) of
97+ EitherTable (E tag) l1 a >>- f = case f (extract a) of
107− EitherTable tag' l2 b ->
98+ EitherTable (E tag') l2 b ->
108− EitherTable (tag <> tag') (bool l1 l2 (isRight tag)) b
99+ EitherTable (E (tag <> tag')) (bool l1 l2 (isRight tag)) b
109
100
110
101
111instance (context ~ Expr, Table Expr a) => Monad (EitherTable context a) where
102instance (context ~ Expr, Table Expr a) => Monad (EitherTable context a) where
@@ -127,11 +118,9 @@ instance
127 type Columns (EitherTable context a b) = HEitherTable (Columns a) (Columns b)
118 type Columns (EitherTable context a b) = HEitherTable (Columns a) (Columns b)
128 type Context (EitherTable context a b) = Context a
119 type Context (EitherTable context a b) = Context a
129 type FromExprs (EitherTable context a b) = Either (FromExprs a) (FromExprs b)
120 type FromExprs (EitherTable context a b) = Either (FromExprs a) (FromExprs b)
130− type Transpose to (EitherTable context a b) =
131− EitherTable to (Transpose to a) (Transpose to b)
132
121
133 toColumns EitherTable {tag, left, right} = HEitherTable
122 toColumns EitherTable {tag, left, right} = HEitherTable
134− { htag = hlabel $ HIdentity tag
123+ { htag = hlabel $ HType tag
135 , hleft = hlabel $ guard tag (== IsLeft) isLeft $ toColumns left
124 , hleft = hlabel $ guard tag (== IsLeft) isLeft $ toColumns left
136 , hright = hlabel $ guard tag (== IsRight) isRight $ toColumns right
125 , hright = hlabel $ guard tag (== IsRight) isRight $ toColumns right
137 }
126 }
@@ -144,29 +133,38 @@ instance
144
133
145 toResult = \case
134 toResult = \case
146 Left table -> HEitherTable
135 Left table -> HEitherTable
147− { htag = hlabel (HIdentity (Identity IsLeft))
136+ { htag = hlabel (HType (R IsLeft))
148 , hleft = hlabel (toResult @_ @(Nullify context a) (Just table))
137 , hleft = hlabel (toResult @_ @(Nullify context a) (Just table))
149 , hright = hlabel (toResult @_ @(Nullify context b) Nothing)
138 , hright = hlabel (toResult @_ @(Nullify context b) Nothing)
150 }
139 }
151 Right table -> HEitherTable
140 Right table -> HEitherTable
152− { htag = hlabel (HIdentity (Identity IsRight))
141+ { htag = hlabel (HType (R IsRight))
153 , hleft = hlabel (toResult @_ @(Nullify context a) Nothing)
142 , hleft = hlabel (toResult @_ @(Nullify context a) Nothing)
154 , hright = hlabel (toResult @_ @(Nullify context b) (Just table))
143 , hright = hlabel (toResult @_ @(Nullify context b) (Just table))
155 }
144 }
156
145
157 fromResult HEitherTable {htag, hleft, hright} = case hunlabel htag of
146 fromResult HEitherTable {htag, hleft, hright} = case hunlabel htag of
158− HIdentity (Identity tag) -> case tag of
147+ HType (R tag) -> case tag of
159 IsLeft -> maybe err Left $ fromResult @_ @(Nullify context a) (hunlabel hleft)
148 IsLeft -> maybe err Left $ fromResult @_ @(Nullify context a) (hunlabel hleft)
160 IsRight -> maybe err Right $ fromResult @_ @(Nullify context b) (hunlabel hright)
149 IsRight -> maybe err Right $ fromResult @_ @(Nullify context b) (hunlabel hright)
161 where
150 where
162 err = error "Either.fromColumns: mismatch between tag and data"
151 err = error "Either.fromColumns: mismatch between tag and data"
163
152
164
153
154+instance
155+ ( Reifiable from, from ~ from'
156+ , Reifiable to, to ~ to'
157+ , Recontextualize from to a1 b1
158+ , Recontextualize from to a2 b2
159+ )
160+ => Recontextualize from to (EitherTable from' a1 a2) (EitherTable to' b1 b2)
161+
162+
165instance (EqTable a, EqTable b, context ~ Expr) =>
163instance (EqTable a, EqTable b, context ~ Expr) =>
166 EqTable (EitherTable context a b)
164 EqTable (EitherTable context a b)
167 where
165 where
168 eqTable = HEitherTable
166 eqTable = HEitherTable
169− { htag = hlabel (HIdentity Dict)
167+ { htag = hlabel (HType Dict)
170 , hleft = hlabel (eqTable @(Nullify context a))
168 , hleft = hlabel (eqTable @(Nullify context a))
171 , hright = hlabel (eqTable @(Nullify context b))
169 , hright = hlabel (eqTable @(Nullify context b))
172 }
170 }
@@ -176,7 +174,7 @@ instance (OrdTable a, OrdTable b, context ~ Expr) =>
176 OrdTable (EitherTable context a b)
174 OrdTable (EitherTable context a b)
177 where
175 where
178 ordTable = HEitherTable
176 ordTable = HEitherTable
179− { htag = hlabel (HIdentity Dict)
177+ { htag = hlabel (HType Dict)
180 , hleft = hlabel (ordTable @(Nullify context a))
178 , hleft = hlabel (ordTable @(Nullify context a))
181 , hright = hlabel (ordTable @(Nullify context b))
179 , hright = hlabel (ordTable @(Nullify context b))
182 }
180 }
@@ -188,30 +186,30 @@ instance (ToExprs exprs1 a, ToExprs exprs2 b, x ~ EitherTable Expr exprs1 exprs2
188
186
189-- | Test if an 'EitherTable' is a 'leftTable'.
187-- | Test if an 'EitherTable' is a 'leftTable'.
190isLeftTable :: EitherTable Expr a b -> Expr Bool
188isLeftTable :: EitherTable Expr a b -> Expr Bool
191−isLeftTable EitherTable {tag} = isLeft tag
189+isLeftTable EitherTable {tag = E tag} = isLeft tag
192
190
193
191
194-- | Test if an 'EitherTable' is a 'rightTable'.
192-- | Test if an 'EitherTable' is a 'rightTable'.
195isRightTable :: EitherTable Expr a b -> Expr Bool
193isRightTable :: EitherTable Expr a b -> Expr Bool
196−isRightTable EitherTable {tag} = isRight tag
194+isRightTable EitherTable {tag = E tag} = isRight tag
197
195
198
196
199-- | Pattern match/eliminate an 'EitherTable', by providing mappings from a
197-- | Pattern match/eliminate an 'EitherTable', by providing mappings from a
200-- 'leftTable' and 'rightTable'.
198-- 'leftTable' and 'rightTable'.
201eitherTable :: Table Expr c
199eitherTable :: Table Expr c
202 => (a -> c) -> (b -> c) -> EitherTable Expr a b -> c
200 => (a -> c) -> (b -> c) -> EitherTable Expr a b -> c
203−eitherTable f g EitherTable {tag, left, right} =
201+eitherTable f g EitherTable {tag = E tag, left, right} =
204 bool (f (extract left)) (g (extract right)) (isRight tag)
202 bool (f (extract left)) (g (extract right)) (isRight tag)
205
203
206
204
207-- | Construct a left 'EitherTable'. Like 'Left'.
205-- | Construct a left 'EitherTable'. Like 'Left'.
208leftTable :: Table Expr b => a -> EitherTable Expr a b
206leftTable :: Table Expr b => a -> EitherTable Expr a b
209−leftTable a = EitherTable (litExpr IsLeft) (pure a) undefined
207+leftTable a = EitherTable (E (litExpr IsLeft)) (pure a) undefined
210
208
211
209
212-- | Construct a right 'EitherTable'. Like 'Right'.
210-- | Construct a right 'EitherTable'. Like 'Right'.
213rightTable :: Table Expr a => b -> EitherTable Expr a b
211rightTable :: Table Expr a => b -> EitherTable Expr a b
214−rightTable = EitherTable (litExpr IsRight) undefined . pure
212+rightTable = EitherTable (E (litExpr IsRight)) undefined . pure
215
213
216
214
217-- | Lift a pair of aggregating functions to operate on an 'EitherTable'.
215-- | Lift a pair of aggregating functions to operate on an 'EitherTable'.
@@ -221,8 +219,8 @@ aggregateEitherTable :: ()
221 -> (exprs' -> aggregates')
219 -> (exprs' -> aggregates')
222 -> EitherTable Expr exprs exprs'
220 -> EitherTable Expr exprs exprs'
223 -> EitherTable Aggregate aggregates aggregates'
221 -> EitherTable Aggregate aggregates aggregates'
224−aggregateEitherTable f g (EitherTable tag a b) = EitherTable
222+aggregateEitherTable f g (EitherTable (E tag) a b) = EitherTable
225− { tag = groupByExpr tag
223+ { tag = A (groupByExpr tag)
226 , left = aggregateNullify f a
224 , left = aggregateNullify f a
227 , right = aggregateNullify g b
225 , right = aggregateNullify g b
228 }
226 }
@@ -240,4 +238,4 @@ nameEitherTable
240 -> b
238 -> b
241 -- ^ Names of the columns in the @b@ table.
239 -- ^ Names of the columns in the @b@ table.
242 -> EitherTable Name a b
240 -> EitherTable Name a b
243−nameEitherTable tag left right = EitherTable tag (pure left) (pure right)
241+nameEitherTable tag left right = EitherTable (N tag) (pure left) (pure right)
src/Rel8/Table/Eq.hs+32−11
@@ -11,6 +11,7 @@
11{-# language TypeFamilies #-}
11{-# language TypeFamilies #-}
12{-# language TypeOperators #-}
12{-# language TypeOperators #-}
13{-# language UndecidableInstances #-}
13{-# language UndecidableInstances #-}
14+{-# language UndecidableSuperClasses #-}
14{-# language ViewPatterns #-}
15{-# language ViewPatterns #-}
15
16
16module Rel8.Table.Eq
17module Rel8.Table.Eq
@@ -27,17 +28,21 @@ import GHC.Generics ( Rep )
27import Prelude
28import Prelude
28
29
29-- rel8
30-- rel8
30−import Rel8.Expr ( Expr )
31+import Rel8.Expr ( Expr, Col( E ) )
31import Rel8.Expr.Bool ( (||.), (&&.) )
32import Rel8.Expr.Bool ( (||.), (&&.) )
32import Rel8.Expr.Eq ( (==.), (/=.) )
33import Rel8.Expr.Eq ( (==.), (/=.) )
33import Rel8.FCF ( Eval, Exp )
34import Rel8.FCF ( Eval, Exp )
34import Rel8.Generic.Record ( Record )
35import Rel8.Generic.Record ( Record )
35import Rel8.Generic.Table.Record ( GTable, GColumns, gtable )
36import Rel8.Generic.Table.Record ( GTable, GColumns, gtable )
36import Rel8.Schema.Dict ( Dict( Dict ) )
37import Rel8.Schema.Dict ( Dict( Dict ) )
37−import Rel8.Schema.HTable ( htabulateA, hfield )
38+import Rel8.Schema.HTable
39+ ( HTable, HConstrainTable
40+ , htabulateA, hfield, hdicts
41+ )
38−import Rel8.Schema.HTable.Identity ( HIdentity( HIdentity ) )
42+import Rel8.Schema.HTable.Identity ( HIdentity( HType ) )
39import Rel8.Schema.Null ( Sql )
43import Rel8.Schema.Null ( Sql )
44+import Rel8.Schema.Spec.Constrain ( ConstrainSpec )
40−import Rel8.Table ( Table, Columns, toColumns, TColumns )
45+import Rel8.Table ( Table, Columns, toColumns, TColumns, TFromExprs )
41import Rel8.Type.Eq ( DBEq )
46import Rel8.Type.Eq ( DBEq )
42
47
43
48
@@ -46,14 +51,20 @@ import Rel8.Type.Eq ( DBEq )
46-- means "all columns in a 'Table' have an instance of 'DBEq'".
51-- means "all columns in a 'Table' have an instance of 'DBEq'".
47type EqTable :: Type -> Constraint
52type EqTable :: Type -> Constraint
48class Table Expr a => EqTable a where
53class Table Expr a => EqTable a where
49− eqTable :: Columns a (Dict (Sql DBEq))
54+ eqTable :: Columns a (Dict (ConstrainSpec (Sql DBEq)))
50
55
51 default eqTable ::
56 default eqTable ::
52− ( GTable TEqTable TColumns (Rep (Record a))
57+ ( GTable TEqTable TColumns TFromExprs (Rep (Record a))
53 , Columns a ~ GColumns TColumns (Rep (Record a))
58 , Columns a ~ GColumns TColumns (Rep (Record a))
54 )
59 )
55− => Columns a (Dict (Sql DBEq))
60+ => Columns a (Dict (ConstrainSpec (Sql DBEq)))
56− eqTable = gtable @TEqTable @TColumns @(Rep (Record a)) table
61+ eqTable =
62+ gtable
63+ @TEqTable
64+ @TColumns
65+ @TFromExprs
66+ @(Rep (Record a))
67+ table
57 where
68 where
58 table (_ :: proxy x) = eqTable @x
69 table (_ :: proxy x) = eqTable @x
59
70
@@ -62,8 +73,18 @@ data TEqTable :: Type -> Exp Constraint
62type instance Eval (TEqTable a) = EqTable a
73type instance Eval (TEqTable a) = EqTable a
63
74
64
75
76+instance
77+ ( HTable t
78+ , f ~ Col Expr
79+ , HConstrainTable t (ConstrainSpec (Sql DBEq))
80+ )
81+ => EqTable (t f)
82+ where
83+ eqTable = hdicts @(Columns (t f)) @(ConstrainSpec (Sql DBEq))
84+
85+
65instance Sql DBEq a => EqTable (Expr a) where
86instance Sql DBEq a => EqTable (Expr a) where
66− eqTable = HIdentity Dict
87+ eqTable = HType Dict
67
88
68
89
69instance (EqTable a, EqTable b) => EqTable (a, b)
90instance (EqTable a, EqTable b) => EqTable (a, b)
@@ -97,7 +118,7 @@ instance
97(toColumns -> as) ==: (toColumns -> bs) =
118(toColumns -> as) ==: (toColumns -> bs) =
98 foldl1' (&&.) $ getConst $ htabulateA $ \field ->
119 foldl1' (&&.) $ getConst $ htabulateA $ \field ->
99 case (hfield as field, hfield bs field) of
120 case (hfield as field, hfield bs field) of
100− (a, b) -> case hfield (eqTable @a) field of
121+ (E a, E b) -> case hfield (eqTable @a) field of
101 Dict -> Const (pure (a ==. b))
122 Dict -> Const (pure (a ==. b))
102infix 4 ==:
123infix 4 ==:
103
124
@@ -109,7 +130,7 @@ infix 4 ==:
109(toColumns -> as) /=: (toColumns -> bs) =
130(toColumns -> as) /=: (toColumns -> bs) =
110 foldl1' (||.) $ getConst $ htabulateA $ \field ->
131 foldl1' (||.) $ getConst $ htabulateA $ \field ->
111 case (hfield as field, hfield bs field) of
132 case (hfield as field, hfield bs field) of
112− (a, b) -> case hfield (eqTable @a) field of
133+ (E a, E b) -> case hfield (eqTable @a) field of
113 Dict -> Const (pure (a /=. b))
134 Dict -> Const (pure (a /=. b))
114infix 4 /=:
135infix 4 /=:
115
136
src/Rel8/Table/HKD.hs+15−15
@@ -57,18 +57,17 @@ import Rel8.Generic.Rel8able
57 , GFromExprs, gfromResult, gtoResult
57 , GFromExprs, gfromResult, gtoResult
58 )
58 )
59import Rel8.Generic.Table
59import Rel8.Generic.Table
60− ( GGSerialize, GGColumns, GAlgebra, ggfromResult, ggtoResult
60+ ( GGTable, GGColumns, GAlgebra, ggfromResult, ggtoResult
61 )
61 )
62import Rel8.Generic.Table.Record ( GTable, GContext )
62import Rel8.Generic.Table.Record ( GTable, GContext )
63import qualified Rel8.Generic.Table.Record as G
63import qualified Rel8.Generic.Table.Record as G
64+import Rel8.Schema.Context ( Col )
64import qualified Rel8.Schema.Kind as K
65import qualified Rel8.Schema.Kind as K
65import Rel8.Schema.HTable ( HTable )
66import Rel8.Schema.HTable ( HTable )
66import Rel8.Schema.Name ( Name )
67import Rel8.Schema.Name ( Name )
67−import Rel8.Schema.Result ( Result )
68import Rel8.Table
68import Rel8.Table
69 ( Table, fromColumns, toColumns, fromResult, toResult
69 ( Table, fromColumns, toColumns, fromResult, toResult
70− , TTable, TColumns, TContext
70+ , TTable, TColumns, TContext, TFromExprs
71− , TSerialize
72 )
71 )
73
72
74
73
@@ -78,7 +77,7 @@ type GColumnsHKD a =
78
77
79
78
80type HKD :: Type -> K.Rel8able
79type HKD :: Type -> K.Rel8able
81−newtype HKD a f = HKD (GColumnsHKD a f)
80+newtype HKD a f = HKD (GColumnsHKD a (Col f))
82
81
83
82
84instance HKDable a => Rel8able (HKD a) where
83instance HKDable a => Rel8able (HKD a) where
@@ -93,26 +92,26 @@ instance HKDable a => Rel8able (HKD a) where
93 to .
92 to .
94 ggfromResult
93 ggfromResult
95 @(GAlgebra (Rep a))
94 @(GAlgebra (Rep a))
96− @TSerialize
95+ @(TTable Expr)
97 @TColumns
96 @TColumns
97+ @TFromExprs
98 @(Eval (HKDRep a Expr))
98 @(Eval (HKDRep a Expr))
99− @(Eval (HKDRep a Result))
100 (\(_ :: proxy x) -> fromResult @_ @x)
99 (\(_ :: proxy x) -> fromResult @_ @x)
101
100
102 gtoResult =
101 gtoResult =
103 ggtoResult
102 ggtoResult
104 @(GAlgebra (Rep a))
103 @(GAlgebra (Rep a))
105− @TSerialize
104+ @(TTable Expr)
106 @TColumns
105 @TColumns
106+ @TFromExprs
107 @(Eval (HKDRep a Expr))
107 @(Eval (HKDRep a Expr))
108− @(Eval (HKDRep a Result))
109 (\(_ :: proxy x) -> toResult @_ @x) .
108 (\(_ :: proxy x) -> toResult @_ @x) .
110 from .
109 from .
111 Record
110 Record
112
111
113
112
114instance
113instance
115− ( GTable (TTable f) TColumns (GRecord (GMap (TColumn f) (Rep a)))
114+ ( GTable (TTable f) TColumns TFromExprs (GRecord (GMap (TColumn f) (Rep a)))
116 , G.GColumns TColumns (GRecord (GMap (TColumn f) (Rep a))) ~ GColumnsHKD a
115 , G.GColumns TColumns (GRecord (GMap (TColumn f) (Rep a))) ~ GColumnsHKD a
117 , GContext TContext (GRecord (GMap (TColumn f) (Rep a))) ~ f
116 , GContext TContext (GRecord (GMap (TColumn f) (Rep a))) ~ f
118 , GRecordable (GMap (TColumn f) (Rep a))
117 , GRecordable (GMap (TColumn f) (Rep a))
@@ -126,6 +125,7 @@ instance
126 G.gfromColumns
125 G.gfromColumns
127 @(TTable f)
126 @(TTable f)
128 @TColumns
127 @TColumns
128+ @TFromExprs
129 fromColumns .
129 fromColumns .
130 (\(HKD a) -> a)
130 (\(HKD a) -> a)
131
131
@@ -134,6 +134,7 @@ instance
134 G.gtoColumns
134 G.gtoColumns
135 @(TTable f)
135 @(TTable f)
136 @TColumns
136 @TColumns
137+ @TFromExprs
137 toColumns .
138 toColumns .
138 grecord @(GMap (TColumn f) (Rep a))
139 grecord @(GMap (TColumn f) (Rep a))
139
140
@@ -143,21 +144,20 @@ class
143 ( Generic (Record a)
144 ( Generic (Record a)
144 , HTable (GColumns (HKD a))
145 , HTable (GColumns (HKD a))
145 , KnownAlgebra (GAlgebra (Rep a))
146 , KnownAlgebra (GAlgebra (Rep a))
146− , Eval (GGSerialize (GAlgebra (Rep a)) TSerialize TColumns (Eval (HKDRep a Expr)) (Eval (HKDRep a Result)))
147+ , Eval (GGTable (GAlgebra (Rep a)) (TTable Expr) TColumns TFromExprs (Eval (HKDRep a Expr)))
147− , GRecord (GMap (TColumn Result) (Rep a)) ~ Rep (Record a)
148+ , GMap TFromExprs (GRecord (GMap (TColumn Expr) (Rep a))) ~ Rep (Record a)
148 )
149 )
149 => HKDable a
150 => HKDable a
150instance
151instance
151 ( Generic (Record a)
152 ( Generic (Record a)
152 , HTable (GColumns (HKD a))
153 , HTable (GColumns (HKD a))
153 , KnownAlgebra (GAlgebra (Rep a))
154 , KnownAlgebra (GAlgebra (Rep a))
154− , Eval (GGSerialize (GAlgebra (Rep a)) TSerialize TColumns (Eval (HKDRep a Expr)) (Eval (HKDRep a Result)))
155+ , Eval (GGTable (GAlgebra (Rep a)) (TTable Expr) TColumns TFromExprs (Eval (HKDRep a Expr)))
155− , GRecord (GMap (TColumn Result) (Rep a)) ~ Rep (Record a)
156+ , GMap TFromExprs (GRecord (GMap (TColumn Expr) (Rep a))) ~ Rep (Record a)
156 )
157 )
157 => HKDable a
158 => HKDable a
158
159
159
160
160−type Top_ :: Constraint
161class Top_
161class Top_
162instance Top_
162instance Top_
163
163
src/Rel8/Table/List.hs+20−35
@@ -11,9 +11,7 @@
11
11
12module Rel8.Table.List
12module Rel8.Table.List
13 ( ListTable(..)
13 ( ListTable(..)
14− , ($*)
15− , listTable
16− , nameListTable
14+ , listTable, nameListTable
17 )
15 )
18where
16where
19
17
@@ -23,24 +21,19 @@ import Data.Kind ( Type )
23import Prelude
21import Prelude
24
22
25-- rel8
23-- rel8
26−import Rel8.Expr ( Expr )
24+import Rel8.Expr ( Expr, Col( E, unE ) )
27import Rel8.Expr.Array ( sappend, sempty, slistOf )
25import Rel8.Expr.Array ( sappend, sempty, slistOf )
28import Rel8.Schema.Dict ( Dict( Dict ) )
26import Rel8.Schema.Dict ( Dict( Dict ) )
29import Rel8.Schema.HTable.List ( HListTable )
27import Rel8.Schema.HTable.List ( HListTable )
30−import Rel8.Schema.HTable.Vectorize
28+import Rel8.Schema.HTable.Vectorize ( happend, hempty, hvectorize, hunvectorize )
31− ( hvectorize, hunvectorize
32− , happend, hempty
33− , hproject, hcolumn
34− )
35import qualified Rel8.Schema.Kind as K
29import qualified Rel8.Schema.Kind as K
36−import Rel8.Schema.Name ( Name( Name ) )
30+import Rel8.Schema.Name ( Col( N ), Name( Name ) )
37import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
31import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
38import Rel8.Schema.Result ( vectorizer, unvectorizer )
32import Rel8.Schema.Result ( vectorizer, unvectorizer )
39−import Rel8.Schema.Spec ( Spec(..) )
33+import Rel8.Schema.Spec ( SSpec(..) )
40import Rel8.Table
34import Rel8.Table
41 ( Table, Context, Columns, fromColumns, toColumns
35 ( Table, Context, Columns, fromColumns, toColumns
42 , FromExprs, fromResult, toResult
36 , FromExprs, fromResult, toResult
43− , Transpose
44 )
37 )
45import Rel8.Table.Alternative
38import Rel8.Table.Alternative
46 ( AltTable, (<|>:)
39 ( AltTable, (<|>:)
@@ -48,9 +41,7 @@ import Rel8.Table.Alternative
48 )
41 )
49import Rel8.Table.Eq ( EqTable, eqTable )
42import Rel8.Table.Eq ( EqTable, eqTable )
50import Rel8.Table.Ord ( OrdTable, ordTable )
43import Rel8.Table.Ord ( OrdTable, ordTable )
51−import Rel8.Table.Projection
44+import Rel8.Table.Recontextualize ( Recontextualize )
52− ( Projectable, Projecting, Projection, project, apply
53− )
54import Rel8.Table.Serialize ( ToExprs )
45import Rel8.Table.Serialize ( ToExprs )
55
46
56
47
@@ -58,11 +49,7 @@ import Rel8.Table.Serialize ( ToExprs )
58-- @ListTable@s with 'Rel8.many' or 'Rel8.listAgg'.
49-- @ListTable@s with 'Rel8.many' or 'Rel8.listAgg'.
59type ListTable :: K.Context -> Type -> Type
50type ListTable :: K.Context -> Type -> Type
60newtype ListTable context a =
51newtype ListTable context a =
61− ListTable (HListTable (Columns a) (Context a))
52+ ListTable (HListTable (Columns a) (Col (Context a)))
62−
63−
64−instance Projectable (ListTable context) where
65− project f (ListTable a) = ListTable (hproject (apply f) a)
66
53
67
54
68instance (Table context a, context ~ context') =>
55instance (Table context a, context ~ context') =>
@@ -71,7 +58,6 @@ instance (Table context a, context ~ context') =>
71 type Columns (ListTable context a) = HListTable (Columns a)
58 type Columns (ListTable context a) = HListTable (Columns a)
72 type Context (ListTable context a) = Context a
59 type Context (ListTable context a) = Context a
73 type FromExprs (ListTable context a) = [FromExprs a]
60 type FromExprs (ListTable context a) = [FromExprs a]
74− type Transpose to (ListTable context a) = ListTable to (Transpose to a)
75
61
76 fromColumns = ListTable
62 fromColumns = ListTable
77 toColumns (ListTable a) = a
63 toColumns (ListTable a) = a
@@ -79,10 +65,14 @@ instance (Table context a, context ~ context') =>
79 toResult = hvectorize vectorizer . fmap (toResult @_ @a)
65 toResult = hvectorize vectorizer . fmap (toResult @_ @a)
80
66
81
67
68+instance (Recontextualize from to a b, from ~ from', to ~ to') =>
69+ Recontextualize from to (ListTable from' a) (ListTable to' b)
70+
71+
82instance (EqTable a, context ~ Expr) => EqTable (ListTable context a) where
72instance (EqTable a, context ~ Expr) => EqTable (ListTable context a) where
83 eqTable =
73 eqTable =
84 hvectorize
74 hvectorize
85− (\Spec {nullity} (Identity Dict) -> case nullity of
75+ (\SSpec {nullity} (Identity Dict) -> case nullity of
86 Null -> Dict
76 Null -> Dict
87 NotNull -> Dict)
77 NotNull -> Dict)
88 (Identity (eqTable @a))
78 (Identity (eqTable @a))
@@ -91,7 +81,7 @@ instance (EqTable a, context ~ Expr) => EqTable (ListTable context a) where
91instance (OrdTable a, context ~ Expr) => OrdTable (ListTable context a) where
81instance (OrdTable a, context ~ Expr) => OrdTable (ListTable context a) where
92 ordTable =
82 ordTable =
93 hvectorize
83 hvectorize
94− (\Spec {nullity} (Identity Dict) -> case nullity of
84+ (\SSpec {nullity} (Identity Dict) -> case nullity of
95 Null -> Dict
85 Null -> Dict
96 NotNull -> Dict)
86 NotNull -> Dict)
97 (Identity (ordTable @a))
87 (Identity (ordTable @a))
@@ -109,29 +99,24 @@ instance context ~ Expr => AlternativeTable (ListTable context) where
109 emptyTable = mempty
99 emptyTable = mempty
110
100
111
101
112−instance (context ~ Expr, Table Expr a) => Semigroup (ListTable context a)
102+instance (context ~ Expr, Table Expr a) =>
103+ Semigroup (ListTable context a)
113 where
104 where
114− ListTable as <> ListTable bs = ListTable $ happend (const sappend) as bs
105+ ListTable as <> ListTable bs = ListTable $
106+ happend (\_ _ (E a) (E b) -> E (sappend a b)) as bs
115
107
116
108
117instance (context ~ Expr, Table Expr a) =>
109instance (context ~ Expr, Table Expr a) =>
118 Monoid (ListTable context a)
110 Monoid (ListTable context a)
119 where
111 where
120− mempty = ListTable $ hempty $ \Spec {info} -> sempty info
112+ mempty = ListTable $ hempty $ \_ -> E . sempty
121−
122−
123−-- | Project a single expression out of a 'ListTable'.
124−($*) :: Projecting a (Expr b)
125− => Projection a (Expr b) -> ListTable Expr a -> Expr [b]
126−f $* ListTable a = hcolumn $ hproject (apply f) a
127−infixl 4 $*
128
113
129
114
130-- | Construct a @ListTable@ from a list of expressions.
115-- | Construct a @ListTable@ from a list of expressions.
131listTable :: Table Expr a => [a] -> ListTable Expr a
116listTable :: Table Expr a => [a] -> ListTable Expr a
132listTable =
117listTable =
133 ListTable .
118 ListTable .
134− hvectorize (\Spec {info} -> slistOf info) .
119+ hvectorize (\SSpec {info} -> E . slistOf info . fmap unE) .
135 fmap toColumns
120 fmap toColumns
136
121
137
122
@@ -144,6 +129,6 @@ nameListTable
144 -> ListTable Name a
129 -> ListTable Name a
145nameListTable =
130nameListTable =
146 ListTable .
131 ListTable .
147− hvectorize (\_ (Identity (Name a)) -> Name a) .
132+ hvectorize (\_ (Identity (N (Name a))) -> N (Name a)) .
148 pure .
133 pure .
149 toColumns
134 toColumns
src/Rel8/Table/Maybe.hs+30−32
@@ -15,7 +15,6 @@ module Rel8.Table.Maybe
15 ( MaybeTable(..)
15 ( MaybeTable(..)
16 , maybeTable, nothingTable, justTable
16 , maybeTable, nothingTable, justTable
17 , isNothingTable, isJustTable
17 , isNothingTable, isJustTable
18− , fromMaybeTable
19 , ($?)
18 , ($?)
20 , aggregateMaybeTable
19 , aggregateMaybeTable
21 , nameMaybeTable
20 , nameMaybeTable
@@ -24,7 +23,6 @@ where
24
23
25-- base
24-- base
26import Data.Functor ( ($>) )
25import Data.Functor ( ($>) )
27−import Data.Functor.Identity ( Identity( Identity ) )
28import Data.Kind ( Type )
26import Data.Kind ( Type )
29import Data.Maybe ( fromMaybe, isJust )
27import Data.Maybe ( fromMaybe, isJust )
30import Prelude hiding ( null, undefined )
28import Prelude hiding ( null, undefined )
@@ -33,8 +31,8 @@ import Prelude hiding ( null, undefined )
33import Control.Comonad ( extract )
31import Control.Comonad ( extract )
34
32
35-- rel8
33-- rel8
36−import Rel8.Aggregate ( Aggregate )
34+import Rel8.Aggregate ( Col( A ), Aggregate )
37−import Rel8.Expr ( Expr )
35+import Rel8.Expr ( Col( E ), Expr )
38import Rel8.Expr.Aggregate ( groupByExpr )
36import Rel8.Expr.Aggregate ( groupByExpr )
39import Rel8.Expr.Bool ( boolExpr )
37import Rel8.Expr.Bool ( boolExpr )
40import Rel8.Expr.Null ( isNull, isNonNull, null, nullify )
38import Rel8.Expr.Null ( isNull, isNonNull, null, nullify )
@@ -44,13 +42,14 @@ import qualified Rel8.Schema.Kind as K
44import Rel8.Schema.HTable.Identity ( HIdentity(..) )
42import Rel8.Schema.HTable.Identity ( HIdentity(..) )
45import Rel8.Schema.HTable.Label ( hlabel, hunlabel )
43import Rel8.Schema.HTable.Label ( hlabel, hunlabel )
46import Rel8.Schema.HTable.Maybe ( HMaybeTable(..) )
44import Rel8.Schema.HTable.Maybe ( HMaybeTable(..) )
47−import Rel8.Schema.Name ( Name )
45+import Rel8.Schema.Name ( Col( N ), Name )
48import Rel8.Schema.Null ( Nullity( Null, NotNull ), Sql, nullable )
46import Rel8.Schema.Null ( Nullity( Null, NotNull ), Sql, nullable )
49import qualified Rel8.Schema.Null as N
47import qualified Rel8.Schema.Null as N
48+import Rel8.Schema.Result ( Col( R ) )
49+import Rel8.Schema.Spec ( Spec( Spec ) )
50import Rel8.Table
50import Rel8.Table
51 ( Table, Columns, Context, fromColumns, toColumns
51 ( Table, Columns, Context, fromColumns, toColumns
52 , FromExprs, fromResult, toResult
52 , FromExprs, fromResult, toResult
53− , Transpose
54 )
53 )
55import Rel8.Table.Alternative
54import Rel8.Table.Alternative
56 ( AltTable, (<|>:)
55 ( AltTable, (<|>:)
@@ -59,8 +58,8 @@ import Rel8.Table.Alternative
59import Rel8.Table.Bool ( bool )
58import Rel8.Table.Bool ( bool )
60import Rel8.Table.Eq ( EqTable, eqTable )
59import Rel8.Table.Eq ( EqTable, eqTable )
61import Rel8.Table.Ord ( OrdTable, ordTable )
60import Rel8.Table.Ord ( OrdTable, ordTable )
62−import Rel8.Table.Projection ( Projectable, project )
63import Rel8.Table.Nullify ( Nullify, aggregateNullify, guard )
61import Rel8.Table.Nullify ( Nullify, aggregateNullify, guard )
62+import Rel8.Table.Recontextualize ( Recontextualize )
64import Rel8.Table.Serialize ( ToExprs )
63import Rel8.Table.Serialize ( ToExprs )
65import Rel8.Table.Undefined ( undefined )
64import Rel8.Table.Undefined ( undefined )
66import Rel8.Type ( DBType )
65import Rel8.Type ( DBType )
@@ -81,18 +80,15 @@ import Data.Functor.Bind ( Bind, (>>-) )
81-- a "nullTag" - to track whether or not the outer join produced any rows.
80-- a "nullTag" - to track whether or not the outer join produced any rows.
82type MaybeTable :: K.Context -> Type -> Type
81type MaybeTable :: K.Context -> Type -> Type
83data MaybeTable context a = MaybeTable
82data MaybeTable context a = MaybeTable
84− { tag :: context (Maybe MaybeTag)
83+ { tag :: Col context ('Spec (Maybe MaybeTag))
85 , just :: Nullify context a
84 , just :: Nullify context a
86 }
85 }
87 deriving stock Functor
86 deriving stock Functor
88
87
89
88
90−instance Projectable (MaybeTable context) where
91− project f (MaybeTable tag a) = MaybeTable tag (project f a)
92−
93−
94instance context ~ Expr => Apply (MaybeTable context) where
89instance context ~ Expr => Apply (MaybeTable context) where
95− MaybeTable tag f <.> MaybeTable tag' a = MaybeTable (tag <> tag') (f <.> a)
90+ MaybeTable (E tag) f <.> MaybeTable (E tag') a =
91+ MaybeTable (E (tag <> tag')) (f <.> a)
96
92
97
93
98-- | Has the same behavior as the @Applicative@ instance for @Maybe@. See also:
94-- | Has the same behavior as the @Applicative@ instance for @Maybe@. See also:
@@ -103,8 +99,8 @@ instance context ~ Expr => Applicative (MaybeTable context) where
103
99
104
100
105instance context ~ Expr => Bind (MaybeTable context) where
101instance context ~ Expr => Bind (MaybeTable context) where
106− MaybeTable tag a >>- f = case f (extract a) of
102+ MaybeTable (E tag) a >>- f = case f (extract a) of
107− MaybeTable tag' b -> MaybeTable (tag <> tag') b
103+ MaybeTable (E tag') b -> MaybeTable (E (tag <> tag')) b
108
104
109
105
110-- | Has the same behavior as the @Monad@ instance for @Maybe@.
106-- | Has the same behavior as the @Monad@ instance for @Maybe@.
@@ -138,7 +134,6 @@ instance (Table context a, Reifiable context, context ~ context') =>
138 type Columns (MaybeTable context a) = HMaybeTable (Columns a)
134 type Columns (MaybeTable context a) = HMaybeTable (Columns a)
139 type Context (MaybeTable context a) = Context a
135 type Context (MaybeTable context a) = Context a
140 type FromExprs (MaybeTable context a) = Maybe (FromExprs a)
136 type FromExprs (MaybeTable context a) = Maybe (FromExprs a)
141− type Transpose to (MaybeTable context a) = MaybeTable to (Transpose to a)
142
137
143 toColumns MaybeTable {tag, just} = HMaybeTable
138 toColumns MaybeTable {tag, just} = HMaybeTable
144 { htag = hlabel $ HIdentity tag
139 { htag = hlabel $ HIdentity tag
@@ -151,27 +146,35 @@ instance (Table context a, Reifiable context, context ~ context') =>
151 }
146 }
152
147
153 toResult ma = HMaybeTable
148 toResult ma = HMaybeTable
154− { htag = hlabel (HIdentity (Identity (IsJust <$ ma)))
149+ { htag = hlabel (HIdentity (R (IsJust <$ ma)))
155 , hjust = hlabel (toResult @_ @(Nullify context a) ma)
150 , hjust = hlabel (toResult @_ @(Nullify context a) ma)
156 }
151 }
157
152
158 fromResult HMaybeTable {htag, hjust} = case hunlabel htag of
153 fromResult HMaybeTable {htag, hjust} = case hunlabel htag of
159− HIdentity (Identity tag) -> tag $>
154+ HType (R tag) -> tag $>
160 fromMaybe err (fromResult @_ @(Nullify context a) (hunlabel hjust))
155 fromMaybe err (fromResult @_ @(Nullify context a) (hunlabel hjust))
161 where
156 where
162 err = error "Maybe.fromColumns: mismatch between tag and data"
157 err = error "Maybe.fromColumns: mismatch between tag and data"
163
158
164
159
160+instance
161+ ( Recontextualize from to a b
162+ , Reifiable from, from ~ from'
163+ , Reifiable to, to ~ to'
164+ )
165+ => Recontextualize from to (MaybeTable from' a) (MaybeTable to' b)
166+
167+
165instance (EqTable a, context ~ Expr) => EqTable (MaybeTable context a) where
168instance (EqTable a, context ~ Expr) => EqTable (MaybeTable context a) where
166 eqTable = HMaybeTable
169 eqTable = HMaybeTable
167− { htag = hlabel (HIdentity Dict)
170+ { htag = hlabel (HType Dict)
168 , hjust = hlabel (eqTable @(Nullify context a))
171 , hjust = hlabel (eqTable @(Nullify context a))
169 }
172 }
170
173
171
174
172instance (OrdTable a, context ~ Expr) => OrdTable (MaybeTable context a) where
175instance (OrdTable a, context ~ Expr) => OrdTable (MaybeTable context a) where
173 ordTable = HMaybeTable
176 ordTable = HMaybeTable
174− { htag = hlabel (HIdentity Dict)
177+ { htag = hlabel (HType Dict)
175 , hjust = hlabel (ordTable @(Nullify context a))
178 , hjust = hlabel (ordTable @(Nullify context a))
176 }
179 }
177
180
@@ -182,12 +185,12 @@ instance (ToExprs exprs a, context ~ Expr) =>
182
185
183-- | Check if a @MaybeTable@ is absent of any row. Like 'Data.Maybe.isNothing'.
186-- | Check if a @MaybeTable@ is absent of any row. Like 'Data.Maybe.isNothing'.
184isNothingTable :: MaybeTable Expr a -> Expr Bool
187isNothingTable :: MaybeTable Expr a -> Expr Bool
185−isNothingTable (MaybeTable tag _) = isNull tag
188+isNothingTable (MaybeTable (E tag) _) = isNull tag
186
189
187
190
188-- | Check if a @MaybeTable@ contains a row. Like 'Data.Maybe.isJust'.
191-- | Check if a @MaybeTable@ contains a row. Like 'Data.Maybe.isJust'.
189isJustTable :: MaybeTable Expr a -> Expr Bool
192isJustTable :: MaybeTable Expr a -> Expr Bool
190−isJustTable (MaybeTable tag _) = isNonNull tag
193+isJustTable (MaybeTable (E tag) _) = isNonNull tag
191
194
192
195
193-- | Perform case analysis on a 'MaybeTable'. Like 'maybe'.
196-- | Perform case analysis on a 'MaybeTable'. Like 'maybe'.
@@ -198,18 +201,13 @@ maybeTable b f ma@(MaybeTable _ a) = bool (f (extract a)) b (isNothingTable ma)
198
201
199-- | The null table. Like 'Nothing'.
202-- | The null table. Like 'Nothing'.
200nothingTable :: Table Expr a => MaybeTable Expr a
203nothingTable :: Table Expr a => MaybeTable Expr a
201−nothingTable = MaybeTable null (pure undefined)
204+nothingTable = MaybeTable (E null) (pure undefined)
202
205
203
206
204-- | Lift any table into 'MaybeTable'. Like 'Just'. Note you can also use
207-- | Lift any table into 'MaybeTable'. Like 'Just'. Note you can also use
205-- 'pure'.
208-- 'pure'.
206justTable :: a -> MaybeTable Expr a
209justTable :: a -> MaybeTable Expr a
207−justTable = MaybeTable mempty . pure
210+justTable = MaybeTable (E mempty) . pure
208−
209−
210−-- | 'Data.Maybe.fromMaybe' for 'MaybeTable's.
211−fromMaybeTable :: Table Expr a => a -> MaybeTable Expr a -> a
212−fromMaybeTable fallback = maybeTable fallback id
213
211
214
212
215-- | Project a single expression out of a 'MaybeTable'. You can think of this
213-- | Project a single expression out of a 'MaybeTable'. You can think of this
@@ -229,8 +227,8 @@ aggregateMaybeTable :: ()
229 => (exprs -> aggregates)
227 => (exprs -> aggregates)
230 -> MaybeTable Expr exprs
228 -> MaybeTable Expr exprs
231 -> MaybeTable Aggregate aggregates
229 -> MaybeTable Aggregate aggregates
232−aggregateMaybeTable f (MaybeTable tag a) =
230+aggregateMaybeTable f (MaybeTable (E tag) a) =
233− MaybeTable (groupByExpr tag) (aggregateNullify f a)
231+ MaybeTable (A (groupByExpr tag)) (aggregateNullify f a)
234
232
235
233
236-- | Construct a 'MaybeTable' in the 'Name' context. This can be useful if you
234-- | Construct a 'MaybeTable' in the 'Name' context. This can be useful if you
@@ -243,4 +241,4 @@ nameMaybeTable
243 -> a
241 -> a
244 -- ^ Names of the columns in @a@.
242 -- ^ Names of the columns in @a@.
245 -> MaybeTable Name a
243 -> MaybeTable Name a
246−nameMaybeTable tag = MaybeTable tag . pure
244+nameMaybeTable tag = MaybeTable (N tag) . pure
src/Rel8/Table/Name.hs+20−11
@@ -1,17 +1,14 @@
1−{-# language DataKinds #-}
2{-# language FlexibleContexts #-}
1{-# language FlexibleContexts #-}
3−{-# language FlexibleInstances #-}
4−{-# language MultiParamTypeClasses #-}
5{-# language NamedFieldPuns #-}
2{-# language NamedFieldPuns #-}
6{-# language ScopedTypeVariables #-}
3{-# language ScopedTypeVariables #-}
7{-# language TypeApplications #-}
4{-# language TypeApplications #-}
8{-# language TypeFamilies #-}
5{-# language TypeFamilies #-}
9−{-# language UndecidableInstances #-}
10{-# language ViewPatterns #-}
6{-# language ViewPatterns #-}
11
7
12module Rel8.Table.Name
8module Rel8.Table.Name
13 ( namesFromLabels
9 ( namesFromLabels
14 , namesFromLabelsWith
10 , namesFromLabelsWith
11+ , showExprs
15 , showLabels
12 , showLabels
16 , showNames
13 , showNames
17 )
14 )
@@ -24,11 +21,16 @@ import Data.List.NonEmpty ( NonEmpty, intersperse, nonEmpty )
24import Data.Maybe ( fromMaybe )
21import Data.Maybe ( fromMaybe )
25import Prelude
22import Prelude
26
23
24+-- opaleye
25+import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
26+
27-- rel8
27-- rel8
28+import Rel8.Expr ( Expr, Col( E ) )
29+import Rel8.Expr.Opaleye ( toPrimExpr )
28import Rel8.Schema.HTable ( htabulate, htabulateA, hfield, hspecs )
30import Rel8.Schema.HTable ( htabulate, htabulateA, hfield, hspecs )
29−import Rel8.Schema.Name ( Name( Name ) )
31+import Rel8.Schema.Name ( Name( Name ), Col( N ) )
30−import Rel8.Schema.Spec ( Spec(..) )
32+import Rel8.Schema.Spec ( SSpec(..) )
31−import Rel8.Table ( Table(..) )
33+import Rel8.Table ( Table, Columns, Context, fromColumns, toColumns )
32
34
33
35
34-- | Construct a table in the 'Name' context containing the names of all
36-- | Construct a table in the 'Name' context containing the names of all
@@ -60,19 +62,26 @@ namesFromLabelsWith :: Table Name a
60 => (NonEmpty String -> String) -> a
62 => (NonEmpty String -> String) -> a
61namesFromLabelsWith f = fromColumns $ htabulate $ \field ->
63namesFromLabelsWith f = fromColumns $ htabulate $ \field ->
62 case hfield hspecs field of
64 case hfield hspecs field of
63− Spec {labels} -> Name (f (renderLabels labels))
65+ SSpec {labels} -> N (Name (f (renderLabels labels)))
66+
67+
68+showExprs :: Table Expr a => a -> [(String, Opaleye.PrimExpr)]
69+showExprs as = case (namesFromLabels, toColumns as) of
70+ (names, exprs) -> getConst $ htabulateA $ \field ->
71+ case (hfield names field, hfield exprs field) of
72+ (N (Name name), E expr) -> Const [(name, toPrimExpr expr)]
64
73
65
74
66showLabels :: forall a. Table (Context a) a => a -> [NonEmpty String]
75showLabels :: forall a. Table (Context a) a => a -> [NonEmpty String]
67showLabels _ = getConst $
76showLabels _ = getConst $
68 htabulateA @(Columns a) $ \field -> case hfield hspecs field of
77 htabulateA @(Columns a) $ \field -> case hfield hspecs field of
69− Spec {labels} -> Const (pure (renderLabels labels))
78+ SSpec {labels} -> Const [renderLabels labels]
70
79
71
80
72−showNames :: forall a. Table Name a => a -> NonEmpty String
81+showNames :: forall a. Table Name a => a -> [String]
73showNames (toColumns -> names) = getConst $
82showNames (toColumns -> names) = getConst $
74 htabulateA @(Columns a) $ \field -> case hfield names field of
83 htabulateA @(Columns a) $ \field -> case hfield names field of
75− Name name -> Const (pure name)
84+ N (Name name) -> Const [name]
76
85
77
86
78renderLabels :: [String] -> NonEmpty String
87renderLabels :: [String] -> NonEmpty String
src/Rel8/Table/NonEmpty.hs+18−35
@@ -11,9 +11,7 @@
11
11
12module Rel8.Table.NonEmpty
12module Rel8.Table.NonEmpty
13 ( NonEmptyTable(..)
13 ( NonEmptyTable(..)
14− , ($+)
15− , nonEmptyTable
16− , nameNonEmptyTable
14+ , nonEmptyTable, nameNonEmptyTable
17 )
15 )
18where
16where
19
17
@@ -24,31 +22,24 @@ import Data.List.NonEmpty ( NonEmpty )
24import Prelude hiding ( id )
22import Prelude hiding ( id )
25
23
26-- rel8
24-- rel8
27−import Rel8.Expr ( Expr )
25+import Rel8.Expr ( Expr, Col( E, unE ) )
28import Rel8.Expr.Array ( sappend1, snonEmptyOf )
26import Rel8.Expr.Array ( sappend1, snonEmptyOf )
29import Rel8.Schema.Dict ( Dict( Dict ) )
27import Rel8.Schema.Dict ( Dict( Dict ) )
30import Rel8.Schema.HTable.NonEmpty ( HNonEmptyTable )
28import Rel8.Schema.HTable.NonEmpty ( HNonEmptyTable )
31−import Rel8.Schema.HTable.Vectorize
29+import Rel8.Schema.HTable.Vectorize ( happend, hvectorize, hunvectorize )
32− ( hvectorize, hunvectorize
33− , happend
34− , hproject, hcolumn
35− )
36import qualified Rel8.Schema.Kind as K
30import qualified Rel8.Schema.Kind as K
37−import Rel8.Schema.Name ( Name( Name ) )
31+import Rel8.Schema.Name ( Col( N ), Name( Name ) )
38import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
32import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
39import Rel8.Schema.Result ( vectorizer, unvectorizer )
33import Rel8.Schema.Result ( vectorizer, unvectorizer )
40−import Rel8.Schema.Spec ( Spec(..) )
34+import Rel8.Schema.Spec ( SSpec(..) )
41import Rel8.Table
35import Rel8.Table
42 ( Table, Context, Columns, fromColumns, toColumns
36 ( Table, Context, Columns, fromColumns, toColumns
43 , FromExprs, fromResult, toResult
37 , FromExprs, fromResult, toResult
44− , Transpose
45 )
38 )
46import Rel8.Table.Alternative ( AltTable, (<|>:) )
39import Rel8.Table.Alternative ( AltTable, (<|>:) )
47import Rel8.Table.Eq ( EqTable, eqTable )
40import Rel8.Table.Eq ( EqTable, eqTable )
48import Rel8.Table.Ord ( OrdTable, ordTable )
41import Rel8.Table.Ord ( OrdTable, ordTable )
49−import Rel8.Table.Projection
42+import Rel8.Table.Recontextualize ( Recontextualize )
50− ( Projectable, Projecting, Projection, project, apply
51− )
52import Rel8.Table.Serialize ( ToExprs )
43import Rel8.Table.Serialize ( ToExprs )
53
44
54
45
@@ -56,11 +47,7 @@ import Rel8.Table.Serialize ( ToExprs )
56-- construct @NonEmptyTable@s with 'Rel8.some' or 'nonEmptyAgg'.
47-- construct @NonEmptyTable@s with 'Rel8.some' or 'nonEmptyAgg'.
57type NonEmptyTable :: K.Context -> Type -> Type
48type NonEmptyTable :: K.Context -> Type -> Type
58newtype NonEmptyTable context a =
49newtype NonEmptyTable context a =
59− NonEmptyTable (HNonEmptyTable (Columns a) (Context a))
50+ NonEmptyTable (HNonEmptyTable (Columns a) (Col (Context a)))
60−
61−
62−instance Projectable (NonEmptyTable context) where
63− project f (NonEmptyTable a) = NonEmptyTable (hproject (apply f) a)
64
51
65
52
66instance (Table context a, context ~ context') =>
53instance (Table context a, context ~ context') =>
@@ -69,8 +56,6 @@ instance (Table context a, context ~ context') =>
69 type Columns (NonEmptyTable context a) = HNonEmptyTable (Columns a)
56 type Columns (NonEmptyTable context a) = HNonEmptyTable (Columns a)
70 type Context (NonEmptyTable context a) = Context a
57 type Context (NonEmptyTable context a) = Context a
71 type FromExprs (NonEmptyTable context a) = NonEmpty (FromExprs a)
58 type FromExprs (NonEmptyTable context a) = NonEmpty (FromExprs a)
72− type Transpose to (NonEmptyTable context a) =
73− NonEmptyTable to (Transpose to a)
74
59
75 fromColumns = NonEmptyTable
60 fromColumns = NonEmptyTable
76 toColumns (NonEmptyTable a) = a
61 toColumns (NonEmptyTable a) = a
@@ -78,12 +63,16 @@ instance (Table context a, context ~ context') =>
78 toResult = hvectorize vectorizer . fmap (toResult @_ @a)
63 toResult = hvectorize vectorizer . fmap (toResult @_ @a)
79
64
80
65
66+instance (Recontextualize from to a b, from ~ from', to ~ to') =>
67+ Recontextualize from to (NonEmptyTable from' a) (NonEmptyTable to' b)
68+
69+
81instance (EqTable a, context ~ Expr) =>
70instance (EqTable a, context ~ Expr) =>
82 EqTable (NonEmptyTable context a)
71 EqTable (NonEmptyTable context a)
83 where
72 where
84 eqTable =
73 eqTable =
85 hvectorize
74 hvectorize
86− (\Spec {nullity} (Identity Dict) -> case nullity of
75+ (\SSpec {nullity} (Identity Dict) -> case nullity of
87 Null -> Dict
76 Null -> Dict
88 NotNull -> Dict)
77 NotNull -> Dict)
89 (Identity (eqTable @a))
78 (Identity (eqTable @a))
@@ -94,7 +83,7 @@ instance (OrdTable a, context ~ Expr) =>
94 where
83 where
95 ordTable =
84 ordTable =
96 hvectorize
85 hvectorize
97− (\Spec {nullity} (Identity Dict) -> case nullity of
86+ (\SSpec {nullity} (Identity Dict) -> case nullity of
98 Null -> Dict
87 Null -> Dict
99 NotNull -> Dict)
88 NotNull -> Dict)
100 (Identity (ordTable @a))
89 (Identity (ordTable @a))
@@ -108,24 +97,18 @@ instance context ~ Expr => AltTable (NonEmptyTable context) where
108 (<|>:) = (<>)
97 (<|>:) = (<>)
109
98
110
99
100+instance (Table Expr a, context ~ Expr) =>
111−instance (Table Expr a, context ~ Expr) => Semigroup (NonEmptyTable context a)
101+ Semigroup (NonEmptyTable context a)
112 where
102 where
113 NonEmptyTable as <> NonEmptyTable bs = NonEmptyTable $
103 NonEmptyTable as <> NonEmptyTable bs = NonEmptyTable $
114− happend (const sappend1) as bs
104+ happend (\_ _ (E a) (E b) -> E (sappend1 a b)) as bs
115−
116−
117−-- | Project a single expression out of a 'NonEmptyTable'.
118−($+) :: Projecting a (Expr b)
119− => Projection a (Expr b) -> NonEmptyTable Expr a -> Expr (NonEmpty b)
120−f $+ NonEmptyTable a = hcolumn $ hproject (apply f) a
121−infixl 4 $+
122
105
123
106
124-- | Construct a @NonEmptyTable@ from a non-empty list of expressions.
107-- | Construct a @NonEmptyTable@ from a non-empty list of expressions.
125nonEmptyTable :: Table Expr a => NonEmpty a -> NonEmptyTable Expr a
108nonEmptyTable :: Table Expr a => NonEmpty a -> NonEmptyTable Expr a
126nonEmptyTable =
109nonEmptyTable =
127 NonEmptyTable .
110 NonEmptyTable .
128− hvectorize (\Spec {info} -> snonEmptyOf info) .
111+ hvectorize (\SSpec {info} -> E . snonEmptyOf info . fmap unE) .
129 fmap toColumns
112 fmap toColumns
130
113
131
114
@@ -138,6 +121,6 @@ nameNonEmptyTable
138 -> NonEmptyTable Name a
121 -> NonEmptyTable Name a
139nameNonEmptyTable =
122nameNonEmptyTable =
140 NonEmptyTable .
123 NonEmptyTable .
141− hvectorize (\_ (Identity (Name a)) -> Name a) .
124+ hvectorize (\_ (Identity (N (Name a))) -> N (Name a)) .
142 pure .
125 pure .
143 toColumns
126 toColumns
src/Rel8/Table/Null.hsdeleted−147
@@ -1,147 +0,0 @@
1−{-# language DataKinds #-}
2−{-# language FlexibleContexts #-}
3−{-# language FlexibleInstances #-}
4−{-# language MultiParamTypeClasses #-}
5−{-# language ScopedTypeVariables #-}
6−{-# language StandaloneKindSignatures #-}
7−{-# language TypeApplications #-}
8−{-# language TypeFamilies #-}
9−{-# language UndecidableInstances #-}
10−
11−module Rel8.Table.Null
12− ( NullTable(..)
13− , nullableTable, nullTable, nullifyTable, unsafeUnnullifyTable
14− , isNullTable, isNonNullTable
15− , nameNullTable
16− , toMaybeTable, toNullTable
17− )
18−where
19−
20−-- base
21−import Data.Kind ( Type )
22−import Prelude hiding ( null, undefined )
23−
24−-- comonad
25−import Control.Comonad ( extract )
26−
27−-- rel8
28−import Rel8.Expr ( Expr )
29−import Rel8.Expr.Bool ( not_ )
30−import Rel8.Kind.Context ( Reifiable )
31−import qualified Rel8.Schema.Kind as K
32−import Rel8.Schema.Name ( Name )
33−import Rel8.Table
34− ( Table, Columns, Context, fromColumns, toColumns
35− , FromExprs, fromResult, toResult
36− , Transpose
37− )
38−import Rel8.Table.Alternative
39− ( AltTable, (<|>:)
40− , AlternativeTable, emptyTable
41− )
42−import Rel8.Table.Bool ( bool )
43−import Rel8.Table.Eq ( EqTable, eqTable )
44−import Rel8.Table.Maybe ( MaybeTable, justTable, maybeTable, nothingTable )
45−import Rel8.Table.Nullify ( Nullify, isNull )
46−import Rel8.Table.Ord ( OrdTable, ordTable )
47−import Rel8.Table.Projection ( Projectable, project )
48−import Rel8.Table.Serialize ( ToExprs )
49−import Rel8.Table.Undefined ( undefined )
50−
51−
52−-- | @NullTable t@ is the table @t@, but where all the columns in @t@ have the
53−-- possibility of being 'Rel8.null'. This is very similar to
54−-- 'Rel8.MaybeTable', except that it does not use an extra tag field, so it
55−-- cannot distinguish between @Nothing@ and @Just Nothing@ if nested. In other
56−-- words, if all of the columns of the @t@ passed to @NullTable@ are already
57−-- nullable, then @NullTable@ has no effect.
58−type NullTable :: K.Context -> Type -> Type
59−newtype NullTable context a = NullTable (Nullify context a)
60−
61−
62−instance Projectable (NullTable context) where
63− project f (NullTable a) = NullTable (project f a)
64−
65−
66−instance context ~ Expr => AltTable (NullTable context) where
67− ma <|>: mb = bool ma mb (isNullTable ma)
68−
69−
70−instance context ~ Expr => AlternativeTable (NullTable context) where
71− emptyTable = nullTable
72−
73−
74−instance (Table context a, Reifiable context, context ~ context') =>
75− Table context' (NullTable context a)
76− where
77− type Columns (NullTable context a) = Columns (Nullify context a)
78− type Context (NullTable context a) = Context (Nullify context a)
79− type FromExprs (NullTable context a) = FromExprs (Nullify context a)
80− type Transpose to (NullTable context a) = NullTable to (Transpose to a)
81−
82− toColumns (NullTable a) = toColumns a
83− fromColumns = NullTable . fromColumns
84−
85− toResult = toResult @_ @(Nullify context a)
86− fromResult = fromResult @_ @(Nullify context a)
87−
88−
89−instance (EqTable a, context ~ Expr) => EqTable (NullTable context a) where
90− eqTable = eqTable @(Nullify context a)
91−
92−
93−instance (OrdTable a, context ~ Expr) => OrdTable (NullTable context a) where
94− ordTable = ordTable @(Nullify context a)
95−
96−
97−instance (ToExprs exprs a, context ~ Expr) =>
98− ToExprs (NullTable context exprs) (Maybe a)
99−
100−
101−-- | Check if any of the non-nullable fields of @a@ are 'Rel8.null' under the
102−-- 'NullTable'. Returns 'Rel8.false' if @a@ has no non-nullable fields.
103−isNullTable :: Table Expr a => NullTable Expr a -> Expr Bool
104−isNullTable (NullTable a) = isNull a
105−
106−
107−-- | The inverse of 'isNullTable'.
108−isNonNullTable :: Table Expr a => NullTable Expr a -> Expr Bool
109−isNonNullTable = not_ . isNullTable
110−
111−
112−-- | Like 'Rel8.nullable'.
113−nullableTable :: (Table Expr a, Table Expr b)
114− => b -> (a -> b) -> NullTable Expr a -> b
115−nullableTable b f ma@(NullTable a) = bool (f (extract a)) b (isNullTable ma)
116−
117−
118−-- | The null table. Like 'Rel8.null'.
119−nullTable :: Table Expr a => NullTable Expr a
120−nullTable = NullTable (pure undefined)
121−
122−
123−-- | Lift any table into 'NullTable'. Like 'Rel8.nullify'.
124−nullifyTable :: a -> NullTable Expr a
125−nullifyTable = NullTable . pure
126−
127−
128−unsafeUnnullifyTable :: NullTable Expr a -> a
129−unsafeUnnullifyTable (NullTable a) = extract a
130−
131−
132−-- | Construct a 'NullTable' in the 'Name' context. This can be useful if you
133−-- have a 'NullTable' that you are storing in a table and need to construct a
134−-- 'TableSchema'.
135−nameNullTable :: a -> NullTable Name a
136−nameNullTable = NullTable . pure
137−
138−
139−-- | Convert a 'NullTable' to a 'MaybeTable'.
140−toMaybeTable :: Table Expr a => NullTable Expr a -> MaybeTable Expr a
141−toMaybeTable = nullableTable nothingTable justTable
142−
143−
144−-- | Convert a 'MaybeTable' to a 'NullTable'. Note that if the underlying @a@
145−-- has no non-nullable fields, this is a lossy conversion.
146−toNullTable :: Table Expr a => MaybeTable Expr a -> NullTable Expr a
147−toNullTable = maybeTable nullTable nullifyTable
src/Rel8/Table/Nullify.hs+16−45
@@ -1,9 +1,7 @@
1{-# language DataKinds #-}
1{-# language DataKinds #-}
2−{-# language FlexibleContexts #-}
3{-# language FlexibleInstances #-}
2{-# language FlexibleInstances #-}
4{-# language LambdaCase #-}
3{-# language LambdaCase #-}
5{-# language MultiParamTypeClasses #-}
4{-# language MultiParamTypeClasses #-}
6−{-# language NamedFieldPuns #-}
7{-# language ScopedTypeVariables #-}
5{-# language ScopedTypeVariables #-}
8{-# language StandaloneKindSignatures #-}
6{-# language StandaloneKindSignatures #-}
9{-# language TypeApplications #-}
7{-# language TypeApplications #-}
@@ -14,13 +12,11 @@ module Rel8.Table.Nullify
14 ( Nullify
12 ( Nullify
15 , aggregateNullify
13 , aggregateNullify
16 , guard
14 , guard
17− , isNull
18 )
15 )
19where
16where
20
17
21-- base
18-- base
22import Control.Applicative ( liftA2 )
19import Control.Applicative ( liftA2 )
23−import Data.Functor.Const ( Const( Const ), getConst )
24import Data.Functor.Identity ( runIdentity )
20import Data.Functor.Identity ( runIdentity )
25import Data.Kind ( Type )
21import Data.Kind ( Type )
26import Prelude
22import Prelude
@@ -31,9 +27,8 @@ import Control.Comonad ( Comonad, duplicate, extract, ComonadApply, (<@>) )
31-- rel8
27-- rel8
32import Rel8.Aggregate ( Aggregate )
28import Rel8.Aggregate ( Aggregate )
33import Rel8.Expr ( Expr )
29import Rel8.Expr ( Expr )
34−import Rel8.Expr.Bool ( (||.), false )
35−import qualified Rel8.Expr.Null as Expr
36import Rel8.Kind.Context ( Reifiable, contextSing )
30import Rel8.Kind.Context ( Reifiable, contextSing )
31+import Rel8.Schema.Context ( Col )
37import Rel8.Schema.Context.Nullify
32import Rel8.Schema.Context.Nullify
38 ( Nullifiability( NAggregate, NExpr )
33 ( Nullifiability( NAggregate, NExpr )
39 , NonNullifiability
34 , NonNullifiability
@@ -45,23 +40,17 @@ import Rel8.Schema.Context.Nullify
45 )
40 )
46import Rel8.Schema.Dict ( Dict( Dict ) )
41import Rel8.Schema.Dict ( Dict( Dict ) )
47import Rel8.Schema.HTable ( HTable )
42import Rel8.Schema.HTable ( HTable )
48−import Rel8.Schema.HTable.Nullify
49− ( HNullify, hnulls, hnullify, hunnullify
43+import Rel8.Schema.HTable.Nullify ( HNullify, hnulls, hnullify, hunnullify, hguard )
50− , hguard
51− , hproject
52− )
53import qualified Rel8.Schema.Kind as K
44import qualified Rel8.Schema.Kind as K
54−import Rel8.Schema.Null ( Nullity( NotNull, Null ) )
55import qualified Rel8.Schema.Result as R
45import qualified Rel8.Schema.Result as R
46+import Rel8.Schema.Spec ( Spec( Spec ) )
56import Rel8.Table
47import Rel8.Table
57 ( Table, Columns, Context, toColumns, fromColumns
48 ( Table, Columns, Context, toColumns, fromColumns
58 , FromExprs, fromResult, toResult
49 , FromExprs, fromResult, toResult
59− , Transpose
60 )
50 )
61−import Rel8.Schema.Spec ( Spec( Spec, nullity ) )
62import Rel8.Table.Eq ( EqTable, eqTable )
51import Rel8.Table.Eq ( EqTable, eqTable )
63import Rel8.Table.Ord ( OrdTable, ordTable )
52import Rel8.Table.Ord ( OrdTable, ordTable )
64−import Rel8.Table.Projection ( Projectable, apply, project )
53+import Rel8.Table.Recontextualize ( Recontextualize )
65
54
66-- semigroupoids
55-- semigroupoids
67import Data.Functor.Apply ( Apply, (<.>), liftF2 )
56import Data.Functor.Apply ( Apply, (<.>), liftF2 )
@@ -72,13 +61,7 @@ import Data.Functor.Extend ( Extend, duplicated )
72type Nullify :: K.Context -> Type -> Type
61type Nullify :: K.Context -> Type -> Type
73data Nullify context a
62data Nullify context a
74 = Table (Nullifiability context) a
63 = Table (Nullifiability context) a
75− | Fields (NonNullifiability context) (HNullify (Columns a) (Context a))
64+ | Fields (NonNullifiability context) (HNullify (Columns a) (Col (Context a)))
76−
77−
78−instance Projectable (Nullify context) where
79− project f = \case
80− Table nullifiable a -> Table nullifiable (fromColumns (apply f (toColumns a)))
81− Fields nonNullifiable a -> Fields nonNullifiable (hproject (apply f) a)
82
65
83
66
84instance Nullifiable context => Functor (Nullify context) where
67instance Nullifiable context => Functor (Nullify context) where
@@ -144,7 +127,6 @@ instance (Table context a, Reifiable context, context ~ context') =>
144 type Columns (Nullify context a) = HNullify (Columns a)
127 type Columns (Nullify context a) = HNullify (Columns a)
145 type Context (Nullify context a) = Context a
128 type Context (Nullify context a) = Context a
146 type FromExprs (Nullify context a) = Maybe (FromExprs a)
129 type FromExprs (Nullify context a) = Maybe (FromExprs a)
147− type Transpose to (Nullify context a) = Nullify to (Transpose to a)
148
130
149 fromColumns = case nullifiableOrNot contextSing of
131 fromColumns = case nullifiableOrNot contextSing of
150 Left notNullifiable -> Fields notNullifiable
132 Left notNullifiable -> Fields notNullifiable
@@ -165,6 +147,14 @@ instance (Table context a, Reifiable context, context ~ context') =>
165 fmap (toResult @_ @a)
147 fmap (toResult @_ @a)
166
148
167
149
150+instance
151+ ( Recontextualize from to a b
152+ , Reifiable from, from ~ from'
153+ , Reifiable to, to ~ to'
154+ )
155+ => Recontextualize from' to' (Nullify from a) (Nullify to b)
156+
157+
168instance (EqTable a, context ~ Expr) => EqTable (Nullify context a) where
158instance (EqTable a, context ~ Expr) => EqTable (Nullify context a) where
169 eqTable = hnullify (\_ Dict -> Dict) (eqTable @a)
159 eqTable = hnullify (\_ Dict -> Dict) (eqTable @a)
170
160
@@ -183,29 +173,10 @@ aggregateNullify f = \case
183
173
184
174
185guard :: (Reifiable context, HTable t)
175guard :: (Reifiable context, HTable t)
186− => context tag
176+ => Col context ('Spec tag)
187 -> (tag -> Bool)
177 -> (tag -> Bool)
188 -> (Expr tag -> Expr Bool)
178 -> (Expr tag -> Expr Bool)
189− -> HNullify t context
179+ -> HNullify t (Col context)
190− -> HNullify t context
180+ -> HNullify t (Col context)
191guard tag isNonNull isNonNullExpr =
181guard tag isNonNull isNonNullExpr =
192 hguard (guarder contextSing tag isNonNull isNonNullExpr)
182 hguard (guarder contextSing tag isNonNull isNonNullExpr)
193−
194−
195−isNull :: forall a. Table Expr a => Nullify Expr a -> Expr Bool
196−isNull =
197− maybe false getAny .
198− getConst .
199− hunnullify (\Spec {nullity} a -> Const $ case nullity of
200− NotNull -> Just $ Any $ Expr.isNull a
201− Null -> Nothing) .
202− toColumns
203−
204−
205−newtype Any = Any
206− { getAny :: Expr Bool
207− }
208−
209−
210−instance Semigroup Any where
211− Any a <> Any b = Any (a ||. b)
src/Rel8/Table/Opaleye.hs+64−78
@@ -1,150 +1,136 @@
1{-# language BlockArguments #-}
1{-# language BlockArguments #-}
2−{-# language DataKinds #-}
3{-# language DisambiguateRecordFields #-}
2{-# language DisambiguateRecordFields #-}
4{-# language FlexibleContexts #-}
3{-# language FlexibleContexts #-}
4+{-# language LambdaCase #-}
5{-# language NamedFieldPuns #-}
5{-# language NamedFieldPuns #-}
6−{-# language RankNTypes #-}
7{-# language TypeFamilies #-}
6{-# language TypeFamilies #-}
8{-# language ViewPatterns #-}
7{-# language ViewPatterns #-}
9
8
10−{-# options_ghc -Wno-deprecations #-}
11−
12module Rel8.Table.Opaleye
9module Rel8.Table.Opaleye
13 ( aggregator
10 ( aggregator
14− , attributes
15 , binaryspec
11 , binaryspec
16 , distinctspec
12 , distinctspec
17− , exprs
18− , exprsWithNames
19 , table
13 , table
20 , tableFields
14 , tableFields
21 , unpackspec
15 , unpackspec
22 , valuesspec
16 , valuesspec
23− , view
24 , castTable
17 , castTable
25 )
18 )
26where
19where
27
20
28-- base
21-- base
29−import Data.Functor.Const ( Const( Const ), getConst )
22+import Prelude hiding ( undefined )
30−import Data.List.NonEmpty ( NonEmpty )
31−import Prelude
32
23
33-- opaleye
24-- opaleye
34−import qualified Opaleye.Adaptors as Opaleye
35−import qualified Opaleye.Field as Opaleye ( Field_ )
36import qualified Opaleye.Internal.Aggregate as Opaleye
25import qualified Opaleye.Internal.Aggregate as Opaleye
26+import qualified Opaleye.Internal.Binary as Opaleye
27+import qualified Opaleye.Internal.Distinct as Opaleye
37import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
28import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
29+import qualified Opaleye.Internal.PackMap as Opaleye
30+import qualified Opaleye.Internal.Unpackspec as Opaleye
38import qualified Opaleye.Internal.Values as Opaleye
31import qualified Opaleye.Internal.Values as Opaleye
39−import qualified Opaleye.Table as Opaleye
32+import qualified Opaleye.Internal.Table as Opaleye
40
33
41-- profunctors
34-- profunctors
42import Data.Profunctor ( dimap, lmap )
35import Data.Profunctor ( dimap, lmap )
43
36
44-- rel8
37-- rel8
45−import Rel8.Aggregate ( Aggregate( Aggregate ), Aggregates )
38+import Rel8.Aggregate ( Col( A ), Aggregate( Aggregate ), Aggregates )
46−import Rel8.Expr ( Expr )
39+import Rel8.Expr ( Expr, Col(..) )
47import Rel8.Expr.Opaleye
40import Rel8.Expr.Opaleye
48 ( fromPrimExpr, toPrimExpr
41 ( fromPrimExpr, toPrimExpr
42+ , traversePrimExpr
43+ , fromColumn, toColumn
49− , scastExpr, traverseFieldP
44+ , scastExpr
50 )
45 )
51−import Rel8.Schema.HTable ( htabulateA, hfield, hspecs, htabulate,
46+import Rel8.Schema.HTable ( htabulateA, hfield, htraverse, hspecs, htabulate )
52− htraverseP, htraversePWithField )
53−import Rel8.Schema.Name ( Name( Name ), Selects, ppColumn )
47+import Rel8.Schema.Name ( Col( N ), Name( Name ), Selects )
54−import Rel8.Schema.Spec ( Spec(..) )
48+import Rel8.Schema.Spec ( SSpec(..) )
55−import Rel8.Schema.Table ( TableSchema(..), ppTable )
49+import Rel8.Schema.Table ( TableSchema(..) )
56import Rel8.Table ( Table, fromColumns, toColumns )
50import Rel8.Table ( Table, fromColumns, toColumns )
57−import Rel8.Type.Information ( typeName )
51+import Rel8.Table.Undefined ( undefined )
58
52
59-- semigroupoids
53-- semigroupoids
60import Data.Functor.Apply ( WrappedApplicative(..) )
54import Data.Functor.Apply ( WrappedApplicative(..) )
61−import Data.Profunctor.Product ( ProductProfunctor )
62
55
63
56
64aggregator :: Aggregates aggregates exprs => Opaleye.Aggregator aggregates exprs
57aggregator :: Aggregates aggregates exprs => Opaleye.Aggregator aggregates exprs
65−aggregator = dimap toColumns fromColumns $
58+aggregator = Opaleye.Aggregator $ Opaleye.PackMap $ \f aggregates ->
66− htraverseP $
59+ fmap fromColumns $ unwrapApplicative $ htabulateA $ \field ->
67− lmap (\(Aggregate a) -> (a, ())) Opaleye.aggregatorApply
68−
69−
70−attributes :: Selects names exprs => TableSchema names -> exprs
71−attributes schema@TableSchema {columns} = fromColumns $ htabulate $ \field ->
72− case hfield (toColumns columns) field of
60+ WrapApplicative $ case hfield (toColumns aggregates) field of
73− Name column -> fromPrimExpr $ Opaleye.ConstExpr $
61+ A (Aggregate (Opaleye.Aggregator (Opaleye.PackMap inner))) ->
74− Opaleye.OtherLit $
62+ E <$> inner f ()
75− show (ppTable schema) <> "." <> show (ppColumn column)
76−
77−
78−fromOpaleyespec :: (ProductProfunctor p, Table Expr a)
79− => p (Opaleye.Field_ n x) (Opaleye.Field_ n x)
80− -> p a a
81−fromOpaleyespec x =
82− dimap toColumns fromColumns (htraverseP (traverseFieldP x))
83
63
84
64
85binaryspec :: Table Expr a => Opaleye.Binaryspec a a
65binaryspec :: Table Expr a => Opaleye.Binaryspec a a
86−binaryspec = fromOpaleyespec Opaleye.binaryspecField
66+binaryspec = Opaleye.Binaryspec $ Opaleye.PackMap $ \f (as, bs) ->
67+ fmap fromColumns $ unwrapApplicative $ htabulateA $ \field ->
68+ WrapApplicative $
69+ case (hfield (toColumns as) field, hfield (toColumns bs) field) of
70+ (E a, E b) -> E . fromPrimExpr <$> f (toPrimExpr a, toPrimExpr b)
87
71
88
72
89distinctspec :: Table Expr a => Opaleye.Distinctspec a a
73distinctspec :: Table Expr a => Opaleye.Distinctspec a a
90−distinctspec = fromOpaleyespec Opaleye.distinctspecField
74+distinctspec =
91−
75+ Opaleye.Distinctspec $ Opaleye.Aggregator $ Opaleye.PackMap $ \f ->
92−
76+ fmap fromColumns .
93−exprs :: Table Expr a => a -> NonEmpty Opaleye.PrimExpr
77+ unwrapApplicative .
94−exprs (toColumns -> as) = getConst $ htabulateA $ \field ->
78+ htraverse
95− case hfield as field of
79+ (\(E a) ->
96− expr -> Const (pure (toPrimExpr expr))
80+ WrapApplicative $ E . fromPrimExpr <$> f (Nothing, toPrimExpr a)) .
97−
81+ toColumns
98−
99−exprsWithNames :: Selects names exprs
100− => names -> exprs -> NonEmpty (String, Opaleye.PrimExpr)
101−exprsWithNames names as = getConst $ htabulateA $ \field ->
102− case (hfield (toColumns names) field, hfield (toColumns as) field) of
103− (Name name, expr) -> Const (pure (name, toPrimExpr expr))
104
82
105
83
106−table :: Selects names exprs => TableSchema names -> Opaleye.Table exprs exprs
84+table ::Selects names exprs => TableSchema names -> Opaleye.Table exprs exprs
107table (TableSchema name schema columns) =
85table (TableSchema name schema columns) =
108 case schema of
86 case schema of
109− Nothing -> Opaleye.table name (tableFields columns)
87+ Nothing -> Opaleye.Table name (tableFields columns)
110− Just schemaName -> Opaleye.tableWithSchema schemaName name (tableFields columns)
88+ Just schemaName -> Opaleye.TableWithSchema schemaName name (tableFields columns)
111
89
112
90
113−tableFields :: Selects names exprs
91+tableFields ::Selects names exprs
114 => names -> Opaleye.TableFields exprs exprs
92 => names -> Opaleye.TableFields exprs exprs
115tableFields (toColumns -> names) = dimap toColumns fromColumns $
93tableFields (toColumns -> names) = dimap toColumns fromColumns $
116 unwrapApplicative $ htabulateA $ \field -> WrapApplicative $
94 unwrapApplicative $ htabulateA $ \field -> WrapApplicative $
117 case hfield names field of
95 case hfield names field of
118 name -> lmap (`hfield` field) (go name)
96 name -> lmap (`hfield` field) (go name)
119 where
97 where
120− go :: Name a -> Opaleye.TableFields (Expr a) (Expr a)
98+ go :: Col Name spec -> Opaleye.TableFields (Col Expr spec) (Col Expr spec)
121− go (Name name) =
99+ go (N (Name name)) =
122− traverseFieldP $
100+ lmap (\(E a) -> toColumn $ toPrimExpr a) $
101+ E . fromPrimExpr . fromColumn <$>
123− Opaleye.requiredTableField name
102+ Opaleye.requiredTableField name
124
103
125
104
126unpackspec :: Table Expr a => Opaleye.Unpackspec a a
105unpackspec :: Table Expr a => Opaleye.Unpackspec a a
127−unpackspec = fromOpaleyespec Opaleye.unpackspecField
106+unpackspec = Opaleye.Unpackspec $ Opaleye.PackMap $ \f ->
107+ fmap fromColumns .
108+ unwrapApplicative .
109+ htraverse (\(E a) -> WrapApplicative $ E <$> traversePrimExpr f a) .
110+ toColumns
128{-# INLINABLE unpackspec #-}
111{-# INLINABLE unpackspec #-}
129
112
130
113
131−valuesspec :: Table Expr a => Opaleye.Valuesspec a a
114+valuesspec :: Table Expr a => Opaleye.ValuesspecSafe a a
132−valuesspec = dimap toColumns fromColumns $
115+valuesspec = Opaleye.ValuesspecSafe (toPackMap undefined) unpackspec
133− htraversePWithField (traverseFieldP . Opaleye.valuesspecFieldType . typeName)
134− where typeName = Rel8.Type.Information.typeName . info . hfield hspecs
135
116
136
117
137−view :: Selects names exprs => names -> exprs
118+toPackMap :: Table Expr a
119+ => a -> Opaleye.PackMap Opaleye.PrimExpr Opaleye.PrimExpr () a
120+toPackMap as = Opaleye.PackMap $ \f () ->
138−view columns = fromColumns $ htabulate $ \field ->
121+ fmap fromColumns $
122+ unwrapApplicative .
123+ htraverse (\(E a) -> WrapApplicative $ E <$> traversePrimExpr f a) $
139− case hfield (toColumns columns) field of
124+ toColumns as
140− Name column -> fromPrimExpr $ Opaleye.BaseTableAttrExpr column
141
125
142
126
143-- | Transform a table by adding 'CAST' to all columns. This is most useful for
127-- | Transform a table by adding 'CAST' to all columns. This is most useful for
144-- finalising a SELECT or RETURNING statement, guaranteed that the output
128-- finalising a SELECT or RETURNING statement, guaranteed that the output
145-- matches what is encoded in each columns TypeInformation.
129-- matches what is encoded in each columns TypeInformation.
146castTable :: Table Expr a => a -> a
130castTable :: Table Expr a => a -> a
147−castTable (toColumns -> as) = fromColumns $ htabulate \field ->
131+castTable (toColumns -> as) = fromColumns $ htabulate \i ->
148− case hfield hspecs field of
132+ case hfield hspecs i of
133+ SSpec{info} ->
149− Spec {info} -> case hfield as field of
134+ case hfield as i of
135+ E expr ->
150− expr -> scastExpr info expr
136+ E (scastExpr info expr)
src/Rel8/Table/Ord.hs+38−15
@@ -10,6 +10,7 @@
10{-# language TypeFamilies #-}
10{-# language TypeFamilies #-}
11{-# language TypeOperators #-}
11{-# language TypeOperators #-}
12{-# language UndecidableInstances #-}
12{-# language UndecidableInstances #-}
13+{-# language UndecidableSuperClasses #-}
13{-# language ViewPatterns #-}
14{-# language ViewPatterns #-}
14
15
15module Rel8.Table.Ord
16module Rel8.Table.Ord
@@ -24,7 +25,7 @@ import GHC.Generics ( Rep )
24import Prelude hiding ( seq )
25import Prelude hiding ( seq )
25
26
26-- rel8
27-- rel8
27−import Rel8.Expr ( Expr )
28+import Rel8.Expr ( Expr, Col( E ) )
28import Rel8.Expr.Bool ( (||.), (&&.), false, true )
29import Rel8.Expr.Bool ( (||.), (&&.), false, true )
29import Rel8.Expr.Eq ( (==.) )
30import Rel8.Expr.Eq ( (==.) )
30import Rel8.Expr.Ord ( (<.), (>.) )
31import Rel8.Expr.Ord ( (<.), (>.) )
@@ -32,12 +33,17 @@ import Rel8.FCF ( Eval, Exp )
32import Rel8.Generic.Record ( Record )
33import Rel8.Generic.Record ( Record )
33import Rel8.Generic.Table.Record ( GTable, GColumns, gtable )
34import Rel8.Generic.Table.Record ( GTable, GColumns, gtable )
34import Rel8.Schema.Dict ( Dict( Dict ) )
35import Rel8.Schema.Dict ( Dict( Dict ) )
35−import Rel8.Schema.HTable ( htabulateA, hfield )
36+import Rel8.Schema.HTable
37+ ( HTable, HConstrainTable
38+ , htabulateA, hfield, hdicts
39+ )
36−import Rel8.Schema.HTable.Identity ( HIdentity( HIdentity ) )
40+import Rel8.Schema.HTable.Identity ( HIdentity( HType ) )
37import Rel8.Schema.Null (Sql)
41import Rel8.Schema.Null (Sql)
42+import Rel8.Schema.Spec.Constrain ( ConstrainSpec )
38−import Rel8.Table ( Columns, toColumns, TColumns )
43+import Rel8.Table ( Columns, toColumns, TColumns, TFromExprs )
39import Rel8.Table.Bool ( bool )
44import Rel8.Table.Bool ( bool )
40import Rel8.Table.Eq ( EqTable )
45import Rel8.Table.Eq ( EqTable )
46+import Rel8.Type.Eq ( DBEq )
41import Rel8.Type.Ord ( DBOrd )
47import Rel8.Type.Ord ( DBOrd )
42
48
43
49
@@ -46,14 +52,20 @@ import Rel8.Type.Ord ( DBOrd )
46-- columns in a 'Table' have an instance of 'DBOrd'".
52-- columns in a 'Table' have an instance of 'DBOrd'".
47type OrdTable :: Type -> Constraint
53type OrdTable :: Type -> Constraint
48class EqTable a => OrdTable a where
54class EqTable a => OrdTable a where
49− ordTable :: Columns a (Dict (Sql DBOrd))
55+ ordTable :: Columns a (Dict (ConstrainSpec (Sql DBOrd)))
50
56
51 default ordTable ::
57 default ordTable ::
52− ( GTable TOrdTable TColumns (Rep (Record a))
58+ ( GTable TOrdTable TColumns TFromExprs (Rep (Record a))
53 , Columns a ~ GColumns TColumns (Rep (Record a))
59 , Columns a ~ GColumns TColumns (Rep (Record a))
54 )
60 )
55− => Columns a (Dict (Sql DBOrd))
61+ => Columns a (Dict (ConstrainSpec (Sql DBOrd)))
56− ordTable = gtable @TOrdTable @TColumns @(Rep (Record a)) table
62+ ordTable =
63+ gtable
64+ @TOrdTable
65+ @TColumns
66+ @TFromExprs
67+ @(Rep (Record a))
68+ table
57 where
69 where
58 table (_ :: proxy x) = ordTable @x
70 table (_ :: proxy x) = ordTable @x
59
71
@@ -62,8 +74,19 @@ data TOrdTable :: Type -> Exp Constraint
62type instance Eval (TOrdTable a) = OrdTable a
74type instance Eval (TOrdTable a) = OrdTable a
63
75
64
76
77+instance
78+ ( HTable t
79+ , f ~ Col Expr
80+ , HConstrainTable t (ConstrainSpec (Sql DBEq))
81+ , HConstrainTable t (ConstrainSpec (Sql DBOrd))
82+ )
83+ => OrdTable (t f)
84+ where
85+ ordTable = hdicts @(Columns (t f)) @(ConstrainSpec (Sql DBOrd))
86+
87+
65instance Sql DBOrd a => OrdTable (Expr a) where
88instance Sql DBOrd a => OrdTable (Expr a) where
66− ordTable = HIdentity Dict
89+ ordTable = HType Dict
67
90
68
91
69instance (OrdTable a, OrdTable b) => OrdTable (a, b)
92instance (OrdTable a, OrdTable b) => OrdTable (a, b)
@@ -98,7 +121,7 @@ instance
98(toColumns -> as) <: (toColumns -> bs) =
121(toColumns -> as) <: (toColumns -> bs) =
99 foldr @[] go false $ getConst $ htabulateA $ \field ->
122 foldr @[] go false $ getConst $ htabulateA $ \field ->
100 case (hfield as field, hfield bs field) of
123 case (hfield as field, hfield bs field) of
101− (a, b) -> case hfield (ordTable @a) field of
124+ (E a, E b) -> case hfield (ordTable @a) field of
102 Dict -> Const [(a <. b, a ==. b)]
125 Dict -> Const [(a <. b, a ==. b)]
103 where
126 where
104 go (lt, eq) a = lt ||. (eq &&. a)
127 go (lt, eq) a = lt ||. (eq &&. a)
@@ -111,7 +134,7 @@ infix 4 <:
111(toColumns -> as) <=: (toColumns -> bs) =
134(toColumns -> as) <=: (toColumns -> bs) =
112 foldr @[] go true $ getConst $ htabulateA $ \field ->
135 foldr @[] go true $ getConst $ htabulateA $ \field ->
113 case (hfield as field, hfield bs field) of
136 case (hfield as field, hfield bs field) of
114− (a, b) -> case hfield (ordTable @a) field of
137+ (E a, E b) -> case hfield (ordTable @a) field of
115 Dict -> Const [(a <. b, a ==. b)]
138 Dict -> Const [(a <. b, a ==. b)]
116 where
139 where
117 go (lt, eq) a = lt ||. (eq &&. a)
140 go (lt, eq) a = lt ||. (eq &&. a)
@@ -124,7 +147,7 @@ infix 4 <=:
124(toColumns -> as) >: (toColumns -> bs) =
147(toColumns -> as) >: (toColumns -> bs) =
125 foldr @[] go false $ getConst $ htabulateA $ \field ->
148 foldr @[] go false $ getConst $ htabulateA $ \field ->
126 case (hfield as field, hfield bs field) of
149 case (hfield as field, hfield bs field) of
127− (a, b) -> case hfield (ordTable @a) field of
150+ (E a, E b) -> case hfield (ordTable @a) field of
128 Dict -> Const [(a >. b, a ==. b)]
151 Dict -> Const [(a >. b, a ==. b)]
129 where
152 where
130 go (gt, eq) a = gt ||. (eq &&. a)
153 go (gt, eq) a = gt ||. (eq &&. a)
@@ -137,7 +160,7 @@ infix 4 >:
137(toColumns -> as) >=: (toColumns -> bs) =
160(toColumns -> as) >=: (toColumns -> bs) =
138 foldr @[] go true $ getConst $ htabulateA $ \field ->
161 foldr @[] go true $ getConst $ htabulateA $ \field ->
139 case (hfield as field, hfield bs field) of
162 case (hfield as field, hfield bs field) of
140− (a, b) -> case hfield (ordTable @a) field of
163+ (E a, E b) -> case hfield (ordTable @a) field of
141 Dict -> Const [(a >. b, a ==. b)]
164 Dict -> Const [(a >. b, a ==. b)]
142 where
165 where
143 go (gt, eq) a = gt ||. (eq &&. a)
166 go (gt, eq) a = gt ||. (eq &&. a)
@@ -146,9 +169,9 @@ infix 4 >=:
146
169
147-- | Given two 'Table's, return the table that sorts before the other.
170-- | Given two 'Table's, return the table that sorts before the other.
148least :: OrdTable a => a -> a -> a
171least :: OrdTable a => a -> a -> a
149−least a b = bool b a (a <: b)
172+least a b = bool a b (a <: b)
150
173
151
174
152-- | Given two 'Table's, return the table that sorts after the other.
175-- | Given two 'Table's, return the table that sorts after the other.
153greatest :: OrdTable a => a -> a -> a
176greatest :: OrdTable a => a -> a -> a
154−greatest a b = bool b a (a >: b)
177+greatest a b = bool a b (a >: b)
src/Rel8/Table/Order.hs+6−5
@@ -16,12 +16,13 @@ import Data.Functor.Contravariant ( (>$<), contramap )
16import Prelude
16import Prelude
17
17
18-- rel8
18-- rel8
19+import Rel8.Expr ( unE )
19import Rel8.Expr.Order ( asc, desc, nullsFirst, nullsLast )
20import Rel8.Expr.Order ( asc, desc, nullsFirst, nullsLast )
20import Rel8.Order ( Order )
21import Rel8.Order ( Order )
21import Rel8.Schema.Dict ( Dict( Dict ) )
22import Rel8.Schema.Dict ( Dict( Dict ) )
22import Rel8.Schema.HTable (htabulateA, hfield, hspecs)
23import Rel8.Schema.HTable (htabulateA, hfield, hspecs)
23import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
24import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
24−import Rel8.Schema.Spec ( Spec( Spec, nullity ) )
25+import Rel8.Schema.Spec ( SSpec( SSpec, nullity ) )
25import Rel8.Table ( Columns, toColumns )
26import Rel8.Table ( Columns, toColumns )
26import Rel8.Table.Ord ( OrdTable, ordTable )
27import Rel8.Table.Ord ( OrdTable, ordTable )
27
28
@@ -31,8 +32,8 @@ import Rel8.Table.Ord ( OrdTable, ordTable )
31ascTable :: forall a. OrdTable a => Order a
32ascTable :: forall a. OrdTable a => Order a
32ascTable = contramap toColumns $ getConst $
33ascTable = contramap toColumns $ getConst $
33 htabulateA @(Columns a) $ \field -> case hfield hspecs field of
34 htabulateA @(Columns a) $ \field -> case hfield hspecs field of
34− Spec {nullity} -> case hfield (ordTable @a) field of
35+ SSpec {nullity} -> case hfield (ordTable @a) field of
35− Dict -> Const $ (`hfield` field) >$<
36+ Dict -> Const $ unE . (`hfield` field) >$<
36 case nullity of
37 case nullity of
37 Null -> nullsFirst asc
38 Null -> nullsFirst asc
38 NotNull -> asc
39 NotNull -> asc
@@ -43,8 +44,8 @@ ascTable = contramap toColumns $ getConst $
43descTable :: forall a. OrdTable a => Order a
44descTable :: forall a. OrdTable a => Order a
44descTable = contramap toColumns $ getConst $
45descTable = contramap toColumns $ getConst $
45 htabulateA @(Columns a) $ \field -> case hfield hspecs field of
46 htabulateA @(Columns a) $ \field -> case hfield hspecs field of
46− Spec {nullity} -> case hfield (ordTable @a) field of
47+ SSpec {nullity} -> case hfield (ordTable @a) field of
47− Dict -> Const $ (`hfield` field) >$<
48+ Dict -> Const $ unE . (`hfield` field) >$<
48 case nullity of
49 case nullity of
49 Null -> nullsLast desc
50 Null -> nullsLast desc
50 NotNull -> desc
51 NotNull -> desc
src/Rel8/Table/Projection.hsdeleted−73
@@ -1,73 +0,0 @@
1−{-# language FlexibleContexts #-}
2−{-# language FlexibleInstances #-}
3−{-# language MonoLocalBinds #-}
4−{-# language MultiParamTypeClasses #-}
5−{-# language StandaloneKindSignatures #-}
6−{-# language UndecidableInstances #-}
7−
8−module Rel8.Table.Projection
9− ( Projection
10− , Projectable( project )
11− , Biprojectable( biproject )
12− , Projecting
13− , apply
14− )
15−where
16−
17−-- base
18−import Data.Kind ( Constraint, Type )
19−import Prelude
20−
21−-- rel8
22−import Rel8.Schema.Field ( Field( Field ), fields )
23−import Rel8.Schema.HTable ( hfield, htabulate )
24−import Rel8.Table ( Columns, Context, Transpose, toColumns )
25−import Rel8.Table.Transpose ( Transposes )
26−
27−
28−-- | The constraint @'Projecting' a b@ ensures that @'Projection' a b@ is a
29−-- usable 'Projection'.
30−type Projecting :: Type -> Type -> Constraint
31−class
32− ( Transposes (Context a) (Field a) a (Transpose (Field a) a)
33− , Transposes (Context a) (Field a) b (Transpose (Field a) b)
34− )
35− => Projecting a b
36−instance
37− ( Transposes (Context a) (Field a) a (Transpose (Field a) a)
38− , Transposes (Context a) (Field a) b (Transpose (Field a) b)
39− )
40− => Projecting a b
41−
42−
43−-- | A @'Projection' a b@s is a special type of function @a -> b@ whereby the
44−-- resulting @b@ is guaranteed to be composed only from columns contained in
45−-- @a@.
46−type Projection :: Type -> Type -> Type
47−type Projection a b = Transpose (Field a) a -> Transpose (Field a) b
48−
49−
50−-- | @'Projectable' f@ means that @f@ is a kind of functor on 'Rel8.Table's
51−-- that allows the mapping of a 'Projection' over its underlying columns.
52−type Projectable :: (Type -> Type) -> Constraint
53−class Projectable f where
54− -- | Map a 'Projection' over @f@.
55− project :: Projecting a b
56− => Projection a b -> f a -> f b
57−
58−
59−-- | @'Biprojectable' p@ means that @p@ is a kind of bifunctor on
60−-- 'Rel8.Table's that allows the mapping of a pair of 'Projection's over its
61−-- underlying columns.
62−type Biprojectable :: (Type -> Type -> Type) -> Constraint
63−class Biprojectable p where
64− -- | Map a pair of 'Projection's over @p@.
65− biproject :: (Projecting a b, Projecting c d)
66− => Projection a b -> Projection c d -> p a c -> p b d
67−
68−
69−apply :: Projecting a b
70− => Projection a b -> Columns a context -> Columns b context
71−apply f a = case toColumns (f fields) of
72− bs -> htabulate $ \field -> case hfield bs field of
73− Field field' -> hfield a field'
src/Rel8/Table/Recontextualize.hsnew file+104
@@ -0,0 +1,104 @@
1+{-# language DataKinds #-}
2+{-# language FlexibleInstances #-}
3+{-# language FunctionalDependencies #-}
4+{-# language StandaloneKindSignatures #-}
5+{-# language TypeFamilies #-}
6+{-# language UndecidableInstances #-}
7+{-# language UndecidableSuperClasses #-}
8+
9+module Rel8.Table.Recontextualize
10+ ( Recontextualize
11+ )
12+where
13+
14+-- base
15+import Data.Kind ( Constraint, Type )
16+import Prelude ()
17+
18+-- rel8
19+import Rel8.Schema.Context ( Col )
20+import Rel8.Schema.HTable ( HTable )
21+import qualified Rel8.Schema.Kind as K
22+import Rel8.Schema.Spec ( KnownSpec )
23+import Rel8.Table ( Table, Congruent )
24+
25+
26+-- | @Recontextualize from to a b@ is evidence that the types @a@ and @b@ are
27+-- related, and that @b@ is the same type as @a@, but after changing the
28+-- context from the initial context @from@, to the new context @to@.
29+type Recontextualize :: K.Context -> K.Context -> Type -> Type -> Constraint
30+class
31+ ( Table from a
32+ , Table to b
33+ , Congruent a b
34+ , Recontextualize from from a a
35+ , Recontextualize to to b b
36+ , Recontextualize to from b a
37+ ) => Recontextualize from to a b
38+ | a -> from
39+ , b -> to
40+ , a to -> b
41+ , b from -> a
42+
43+
44+instance KnownSpec spec => Recontextualize from to (Col from spec) (Col to spec)
45+
46+
47+instance HTable t => Recontextualize from to (t (Col from)) (t (Col to))
48+
49+
50+instance
51+ ( Recontextualize from to a1 b1
52+ , Recontextualize from to a2 b2
53+ )
54+ => Recontextualize from to (a1, a2) (b1, b2)
55+
56+
57+instance
58+ ( Recontextualize from to a1 b1
59+ , Recontextualize from to a2 b2
60+ , Recontextualize from to a3 b3
61+ )
62+ => Recontextualize from to (a1, a2, a3) (b1, b2, b3)
63+
64+
65+instance
66+ ( Recontextualize from to a1 b1
67+ , Recontextualize from to a2 b2
68+ , Recontextualize from to a3 b3
69+ , Recontextualize from to a4 b4
70+ )
71+ => Recontextualize from to (a1, a2, a3, a4) (b1, b2, b3, b4)
72+
73+
74+instance
75+ ( Recontextualize from to a1 b1
76+ , Recontextualize from to a2 b2
77+ , Recontextualize from to a3 b3
78+ , Recontextualize from to a4 b4
79+ , Recontextualize from to a5 b5
80+ )
81+ => Recontextualize from to (a1, a2, a3, a4, a5) (b1, b2, b3, b4, b5)
82+
83+
84+instance
85+ ( Recontextualize from to a1 b1
86+ , Recontextualize from to a2 b2
87+ , Recontextualize from to a3 b3
88+ , Recontextualize from to a4 b4
89+ , Recontextualize from to a5 b5
90+ , Recontextualize from to a6 b6
91+ )
92+ => Recontextualize from to (a1, a2, a3, a4, a5, a6) (b1, b2, b3, b4, b5, b6)
93+
94+
95+instance
96+ ( Recontextualize from to a1 b1
97+ , Recontextualize from to a2 b2
98+ , Recontextualize from to a3 b3
99+ , Recontextualize from to a4 b4
100+ , Recontextualize from to a5 b5
101+ , Recontextualize from to a6 b6
102+ , Recontextualize from to a7 b7
103+ )
104+ => Recontextualize from to (a1, a2, a3, a4, a5, a6, a7) (b1, b2, b3, b4, b5, b6, b7)
src/Rel8/Table/Rel8able.hs+21−14
@@ -20,62 +20,69 @@ import Prelude ()
20-- rel8
20-- rel8
21import Rel8.Expr ( Expr )
21import Rel8.Expr ( Expr )
22import qualified Rel8.Kind.Algebra as K
22import qualified Rel8.Kind.Algebra as K
23−import Rel8.Kind.Context ( Reifiable, contextSing )
24import Rel8.Generic.Rel8able
23import Rel8.Generic.Rel8able
25 ( Rel8able, Algebra
24 ( Rel8able, Algebra
26 , GColumns, gfromColumns, gtoColumns
25 , GColumns, gfromColumns, gtoColumns
27 , GFromExprs, gfromResult, gtoResult
26 , GFromExprs, gfromResult, gtoResult
28 )
27 )
28+import Rel8.Schema.Context.Virtual ( Virtual, virtual )
29import qualified Rel8.Schema.Kind as K
29import qualified Rel8.Schema.Kind as K
30import Rel8.Schema.HTable ( HConstrainTable, hdicts )
30import Rel8.Schema.HTable ( HConstrainTable, hdicts )
31import Rel8.Schema.Null ( Sql )
31import Rel8.Schema.Null ( Sql )
32import Rel8.Schema.Result ( Result )
32import Rel8.Schema.Result ( Result )
33import Rel8.Table
33import Rel8.Table
34− ( Table, Columns, Context, fromColumns, toColumns
34+ ( Table, Columns, Context, Congruent, fromColumns, toColumns
35 , FromExprs, fromResult, toResult
35 , FromExprs, fromResult, toResult
36− , Transpose
37 )
36 )
37+import Rel8.Schema.Spec.Constrain ( ConstrainSpec )
38import Rel8.Table.ADT ( ADT )
38import Rel8.Table.ADT ( ADT )
39import Rel8.Table.Eq ( EqTable, eqTable )
39import Rel8.Table.Eq ( EqTable, eqTable )
40import Rel8.Table.Ord ( OrdTable, ordTable )
40import Rel8.Table.Ord ( OrdTable, ordTable )
41+import Rel8.Table.Recontextualize ( Recontextualize )
41import Rel8.Table.Serialize ( ToExprs )
42import Rel8.Table.Serialize ( ToExprs )
42import Rel8.Type.Eq ( DBEq )
43import Rel8.Type.Eq ( DBEq )
43import Rel8.Type.Ord ( DBOrd )
44import Rel8.Type.Ord ( DBOrd )
44
45
45
46
46−instance (Rel8able t, Reifiable context, context ~ context') =>
47− Table context' (t context)
47+instance (Rel8able t, Virtual context) => Table context (t context) where
48− where
49 type Columns (t context) = GColumns t
48 type Columns (t context) = GColumns t
50 type Context (t context) = context
49 type Context (t context) = context
51 type FromExprs (t context) = GFromExprs t
50 type FromExprs (t context) = GFromExprs t
52− type Transpose to (t context) = t to
53
51
54− fromColumns = gfromColumns contextSing
52+ fromColumns = gfromColumns virtual
55− toColumns = gtoColumns contextSing
53+ toColumns = gtoColumns virtual
56 fromResult = gfromResult @t
54 fromResult = gfromResult @t
57 toResult = gtoResult @t
55 toResult = gtoResult @t
58
56
59
57
58+instance
59+ ( Rel8able t
60+ , Virtual from
61+ , Virtual to
62+ , Congruent (t from) (t to)
63+ )
64+ => Recontextualize from to (t from) (t to)
65+
66+
60instance
67instance
61 ( context ~ Expr
68 ( context ~ Expr
62 , Rel8able t
69 , Rel8able t
63− , HConstrainTable (Columns (t context)) (Sql DBEq)
70+ , HConstrainTable (Columns (t context)) (ConstrainSpec (Sql DBEq))
64 )
71 )
65 => EqTable (t context)
72 => EqTable (t context)
66 where
73 where
67− eqTable = hdicts @(Columns (t context)) @(Sql DBEq)
74+ eqTable = hdicts @(Columns (t context)) @(ConstrainSpec (Sql DBEq))
68
75
69
76
70instance
77instance
71 ( context ~ Expr
78 ( context ~ Expr
72 , Rel8able t
79 , Rel8able t
73− , HConstrainTable (Columns (t context)) (Sql DBEq)
80+ , HConstrainTable (Columns (t context)) (ConstrainSpec (Sql DBEq))
74− , HConstrainTable (Columns (t context)) (Sql DBOrd)
81+ , HConstrainTable (Columns (t context)) (ConstrainSpec (Sql DBOrd))
75 )
82 )
76 => OrdTable (t context)
83 => OrdTable (t context)
77 where
84 where
78− ordTable = hdicts @(Columns (t context)) @(Sql DBOrd)
85+ ordTable = hdicts @(Columns (t context)) @(ConstrainSpec (Sql DBOrd))
79
86
80
87
81instance
88instance
src/Rel8/Table/Serialize.hs+17−10
@@ -10,13 +10,12 @@
10{-# language UndecidableInstances #-}
10{-# language UndecidableInstances #-}
11
11
12module Rel8.Table.Serialize
12module Rel8.Table.Serialize
13− ( Serializable, lit, litHTable, parse
13+ ( Serializable, lit, parse
14 , ToExprs
14 , ToExprs
15 )
15 )
16where
16where
17
17
18-- base
18-- base
19−import Data.Functor.Identity ( Identity( Identity ) )
20import Data.Kind ( Constraint, Type )
19import Data.Kind ( Constraint, Type )
21import Data.List.NonEmpty ( NonEmpty )
20import Data.List.NonEmpty ( NonEmpty )
22import Prelude
21import Prelude
@@ -25,12 +24,12 @@ import Prelude
25import qualified Hasql.Decoders as Hasql
24import qualified Hasql.Decoders as Hasql
26
25
27-- rel8
26-- rel8
28−import Rel8.Expr ( Expr )
27+import Rel8.Expr ( Expr, Col( E ) )
29import Rel8.Expr.Serialize ( slitExpr, sparseValue )
28import Rel8.Expr.Serialize ( slitExpr, sparseValue )
30import Rel8.Schema.HTable ( HTable, htabulate, htabulateA, hfield, hspecs )
29import Rel8.Schema.HTable ( HTable, htabulate, htabulateA, hfield, hspecs )
31import Rel8.Schema.Null ( NotNull, Sql )
30import Rel8.Schema.Null ( NotNull, Sql )
32−import Rel8.Schema.Result ( Result )
31+import Rel8.Schema.Result ( Col( R ), Result )
33−import Rel8.Schema.Spec ( Spec(..) )
32+import Rel8.Schema.Spec ( SSpec(..), KnownSpec )
34import Rel8.Table ( Table, fromColumns, FromExprs, fromResult, toResult )
33import Rel8.Table ( Table, fromColumns, FromExprs, fromResult, toResult )
35import Rel8.Type ( DBType )
34import Rel8.Type ( DBType )
36
35
@@ -116,6 +115,14 @@ instance
116 => ToExprs x (a, b, c, d, e, f, g)
115 => ToExprs x (a, b, c, d, e, f, g)
117
116
118
117
118+instance (HTable t, result ~ Col Result, x ~ t (Col Expr)) =>
119+ ToExprs x (t result)
120+
121+
122+instance (KnownSpec spec, x ~ Col Expr spec) =>
123+ ToExprs x (Col Result spec)
124+
125+
119-- | @Serializable@ witnesses the one-to-one correspondence between the type
126-- | @Serializable@ witnesses the one-to-one correspondence between the type
120-- @sql@, which contains SQL expressions, and the type @haskell@, which
127-- @sql@, which contains SQL expressions, and the type @haskell@, which
121-- contains the Haskell decoding of rows containing @sql@ SQL expressions.
128-- contains the Haskell decoding of rows containing @sql@ SQL expressions.
@@ -135,14 +142,14 @@ parse :: forall exprs a. Serializable exprs a => Hasql.Row a
135parse = fromResult @_ @exprs <$> parseHTable
142parse = fromResult @_ @exprs <$> parseHTable
136
143
137
144
138−litHTable :: HTable t => t Result -> t Expr
145+litHTable :: HTable t => t (Col Result) -> t (Col Expr)
139litHTable as = htabulate $ \field ->
146litHTable as = htabulate $ \field ->
140 case hfield hspecs field of
147 case hfield hspecs field of
141− Spec {nullity, info} -> case hfield as field of
148+ SSpec {nullity, info} -> case hfield as field of
142− Identity value -> slitExpr nullity info value
149+ R value -> E (slitExpr nullity info value)
143
150
144
151
145−parseHTable :: HTable t => Hasql.Row (t Result)
152+parseHTable :: HTable t => Hasql.Row (t (Col Result))
146parseHTable = unwrapApplicative $ htabulateA $ \field ->
153parseHTable = unwrapApplicative $ htabulateA $ \field ->
147 WrapApplicative $ case hfield hspecs field of
154 WrapApplicative $ case hfield hspecs field of
148− Spec {nullity, info} -> Identity <$> sparseValue nullity info
155+ SSpec {nullity, info} -> R <$> sparseValue nullity info
src/Rel8/Table/These.hs+17−30
@@ -20,7 +20,6 @@ module Rel8.Table.These
20 , isThisTable, isThatTable, isThoseTable
20 , isThisTable, isThatTable, isThoseTable
21 , hasHereTable, hasThereTable
21 , hasHereTable, hasThereTable
22 , justHereTable, justThereTable
22 , justHereTable, justThereTable
23− , alignMaybeTable
24 , aggregateTheseTable
23 , aggregateTheseTable
25 , nameTheseTable
24 , nameTheseTable
26 )
25 )
@@ -30,13 +29,13 @@ where
30import Data.Bifunctor ( Bifunctor, bimap )
29import Data.Bifunctor ( Bifunctor, bimap )
31import Data.Kind ( Type )
30import Data.Kind ( Type )
32import Data.Maybe ( isJust )
31import Data.Maybe ( isJust )
33−import Prelude hiding ( null, undefined )
32+import Prelude hiding ( undefined )
34
33
35-- rel8
34-- rel8
36import Rel8.Aggregate ( Aggregate )
35import Rel8.Aggregate ( Aggregate )
37import Rel8.Expr ( Expr )
36import Rel8.Expr ( Expr )
38−import Rel8.Expr.Bool ( (&&.), (||.), boolExpr, not_ )
37+import Rel8.Expr.Bool ( (&&.), not_ )
39−import Rel8.Expr.Null ( null, isNonNull )
38+import Rel8.Expr.Null ( isNonNull )
40import Rel8.Kind.Context ( Reifiable )
39import Rel8.Kind.Context ( Reifiable )
41import Rel8.Schema.Context.Nullify ( Nullifiable )
40import Rel8.Schema.Context.Nullify ( Nullifiable )
42import Rel8.Schema.Dict ( Dict( Dict ) )
41import Rel8.Schema.Dict ( Dict( Dict ) )
@@ -49,7 +48,6 @@ import Rel8.Schema.Name ( Name )
49import Rel8.Table
48import Rel8.Table
50 ( Table, Columns, Context, fromColumns, toColumns
49 ( Table, Columns, Context, fromColumns, toColumns
51 , FromExprs, fromResult, toResult
50 , FromExprs, fromResult, toResult
52− , Transpose
53 )
51 )
54import Rel8.Table.Eq ( EqTable, eqTable )
52import Rel8.Table.Eq ( EqTable, eqTable )
55import Rel8.Table.Maybe
53import Rel8.Table.Maybe
@@ -61,7 +59,7 @@ import Rel8.Table.Maybe
61 )
59 )
62import Rel8.Table.Nullify ( Nullify, guard )
60import Rel8.Table.Nullify ( Nullify, guard )
63import Rel8.Table.Ord ( OrdTable, ordTable )
61import Rel8.Table.Ord ( OrdTable, ordTable )
64−import Rel8.Table.Projection ( Biprojectable, Projectable, biproject, project )
62+import Rel8.Table.Recontextualize ( Recontextualize )
65import Rel8.Table.Serialize ( ToExprs )
63import Rel8.Table.Serialize ( ToExprs )
66import Rel8.Table.Undefined ( undefined )
64import Rel8.Table.Undefined ( undefined )
67import Rel8.Type.Tag ( MaybeTag )
65import Rel8.Type.Tag ( MaybeTag )
@@ -90,18 +88,10 @@ data TheseTable context a b = TheseTable
90 deriving stock Functor
88 deriving stock Functor
91
89
92
90
93−instance Biprojectable (TheseTable context) where
94− biproject f g (TheseTable a b) = TheseTable (project f a) (project g b)
95−
96−
97instance Nullifiable context => Bifunctor (TheseTable context) where
91instance Nullifiable context => Bifunctor (TheseTable context) where
98 bimap f g (TheseTable a b) = TheseTable (fmap f a) (fmap g b)
92 bimap f g (TheseTable a b) = TheseTable (fmap f a) (fmap g b)
99
93
100
94
101−instance Projectable (TheseTable context a) where
102− project f (TheseTable a b) = TheseTable a (project f b)
103−
104−
105instance (context ~ Expr, Table Expr a, Semigroup a) =>
95instance (context ~ Expr, Table Expr a, Semigroup a) =>
106 Apply (TheseTable context a)
96 Apply (TheseTable context a)
107 where
97 where
@@ -156,8 +146,6 @@ instance
156 type Context (TheseTable context a b) = Context a
146 type Context (TheseTable context a b) = Context a
157 type FromExprs (TheseTable context a b) =
147 type FromExprs (TheseTable context a b) =
158 These (FromExprs a) (FromExprs b)
148 These (FromExprs a) (FromExprs b)
159− type Transpose to (TheseTable context a b) =
160− TheseTable to (Transpose to a) (Transpose to b)
161
149
162 toColumns TheseTable {here, there} = HTheseTable
150 toColumns TheseTable {here, there} = HTheseTable
163 { hhereTag = hlabel $ HIdentity $ tag here
151 { hhereTag = hlabel $ HIdentity $ tag here
@@ -214,13 +202,22 @@ instance
214 }
202 }
215
203
216
204
205+instance
206+ ( Recontextualize from to a1 b1
207+ , Recontextualize from to a2 b2
208+ , Reifiable from, from ~ from'
209+ , Reifiable to, to ~ to'
210+ )
211+ => Recontextualize from to (TheseTable from' a1 a2) (TheseTable to' b1 b2)
212+
213+
217instance (EqTable a, EqTable b, context ~ Expr) =>
214instance (EqTable a, EqTable b, context ~ Expr) =>
218 EqTable (TheseTable context a b)
215 EqTable (TheseTable context a b)
219 where
216 where
220 eqTable = HTheseTable
217 eqTable = HTheseTable
221− { hhereTag = hlabel (HIdentity Dict)
218+ { hhereTag = hlabel (HType Dict)
222 , hhere = hlabel (eqTable @(Nullify context a))
219 , hhere = hlabel (eqTable @(Nullify context a))
223− , hthereTag = hlabel (HIdentity Dict)
220+ , hthereTag = hlabel (HType Dict)
224 , hthere = hlabel (eqTable @(Nullify context b))
221 , hthere = hlabel (eqTable @(Nullify context b))
225 }
222 }
226
223
@@ -229,9 +226,9 @@ instance (OrdTable a, OrdTable b, context ~ Expr) =>
229 OrdTable (TheseTable context a b)
226 OrdTable (TheseTable context a b)
230 where
227 where
231 ordTable = HTheseTable
228 ordTable = HTheseTable
232− { hhereTag = hlabel (HIdentity Dict)
229+ { hhereTag = hlabel (HType Dict)
233 , hhere = hlabel (ordTable @(Nullify context a))
230 , hhere = hlabel (ordTable @(Nullify context a))
234− , hthereTag = hlabel (HIdentity Dict)
231+ , hthereTag = hlabel (HType Dict)
235 , hthere = hlabel (ordTable @(Nullify context b))
232 , hthere = hlabel (ordTable @(Nullify context b))
236 }
233 }
237
234
@@ -289,16 +286,6 @@ justThereTable :: TheseTable context a b -> MaybeTable context b
289justThereTable = there
286justThereTable = there
290
287
291
288
292−-- | Construct a @TheseTable@ from two 'MaybeTable's.
293−alignMaybeTable :: ()
294− => MaybeTable Expr a
295− -> MaybeTable Expr b
296− -> MaybeTable Expr (TheseTable Expr a b)
297−alignMaybeTable a b = MaybeTable tag (pure (TheseTable a b))
298− where
299− tag = boolExpr null mempty (isJustTable a ||. isJustTable b)
300−
301−
302-- | Construct a @TheseTable@. Corresponds to 'This'.
289-- | Construct a @TheseTable@. Corresponds to 'This'.
303thisTable :: Table Expr b => a -> TheseTable Expr a b
290thisTable :: Table Expr b => a -> TheseTable Expr a b
304thisTable a = TheseTable (justTable a) nothingTable
291thisTable a = TheseTable (justTable a) nothingTable
src/Rel8/Table/Transpose.hsdeleted−46
@@ -1,46 +0,0 @@
1−{-# language DataKinds #-}
2−{-# language FlexibleInstances #-}
3−{-# language FunctionalDependencies #-}
4−{-# language StandaloneKindSignatures #-}
5−{-# language TypeFamilies #-}
6−{-# language UndecidableInstances #-}
7−
8−module Rel8.Table.Transpose
9− ( Transposes
10− )
11−where
12−
13−-- base
14−import Data.Kind ( Constraint, Type )
15−import Prelude ()
16−
17−-- rel8
18−import qualified Rel8.Schema.Kind as K
19−import Rel8.Table ( Table, Transpose, Congruent )
20−
21−
22−-- | @'Transposes' from to a b@ means that @a@ and @b@ are 'Table's, in the
23−-- @from@ and @to@ contexts respectively, which share the same underlying
24−-- structure. In other words, @b@ is a version of @a@ transposed from the
25−-- @from@ context to the @to@ context (and vice versa).
26−type Transposes :: K.Context -> K.Context -> Type -> Type -> Constraint
27−class
28− ( Table from a
29− , Table to b
30− , Congruent a b
31− , b ~ Transpose to a
32− , a ~ Transpose from b
33− )
34− => Transposes from to a b
35− | a -> from
36− , b -> to
37− , a to -> b
38− , b from -> a
39−instance
40− ( Table from a
41− , Table to b
42− , Congruent a b
43− , b ~ Transpose to a
44− , a ~ Transpose from b
45− )
46− => Transposes from to a b
src/Rel8/Table/Undefined.hs+5−5
@@ -11,16 +11,16 @@ where
11import Prelude hiding ( undefined )
11import Prelude hiding ( undefined )
12
12
13-- rel8
13-- rel8
14−import Rel8.Expr ( Expr )
14+import Rel8.Expr ( Expr, Col( E ) )
15import Rel8.Expr.Null ( snull, unsafeUnnullify )
15import Rel8.Expr.Null ( snull, unsafeUnnullify )
16import Rel8.Schema.HTable ( htabulate, hfield, hspecs )
16import Rel8.Schema.HTable ( htabulate, hfield, hspecs )
17import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
17import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
18−import Rel8.Schema.Spec ( Spec(..) )
18+import Rel8.Schema.Spec ( SSpec(..) )
19import Rel8.Table ( Table, fromColumns )
19import Rel8.Table ( Table, fromColumns )
20
20
21
21
22undefined :: Table Expr a => a
22undefined :: Table Expr a => a
23undefined = fromColumns $ htabulate $ \field -> case hfield hspecs field of
23undefined = fromColumns $ htabulate $ \field -> case hfield hspecs field of
24− Spec {nullity, info} -> case nullity of
24+ SSpec {nullity, info} -> case nullity of
25− Null -> snull info
25+ Null -> E (snull info)
26− NotNull -> unsafeUnnullify (snull info)
26+ NotNull -> E (unsafeUnnullify (snull info))
src/Rel8/Table/Window.hsdeleted−43
@@ -1,43 +0,0 @@
1−{-# language MonoLocalBinds #-}
2−
3−module Rel8.Table.Window
4− ( cumulative
5− , cumulative_
6− , currentRow
7− )
8−where
9−
10−-- base
11−import Prelude
12−
13−-- opaleye
14−import qualified Opaleye.Window as Opaleye
15−
16−-- rel8
17−import Rel8.Aggregate ( Aggregates )
18−import qualified Rel8.Expr.Window as Expr
19−import Rel8.Schema.HTable ( hfield, htabulateA )
20−import Rel8.Table ( fromColumns, toColumns )
21−import Rel8.Window ( Window( Window ) )
22−
23−
24−-- | 'cumulative' allows the use of aggregation functions in 'Window'
25−-- expressions. In particular, @'cumulative' 'Rel8.sum'@
26−-- (when combined with 'Rel8.Window.orderPartitionBy') gives a running total,
27−-- also known as a \"cumulative sum\", hence the name @cumulative@.
28−cumulative :: Aggregates aggregates exprs => (a -> aggregates) -> Window a exprs
29−cumulative f =
30− fmap fromColumns $
31− htabulateA $ \field ->
32− Expr.cumulative ((`hfield` field) . toColumns . f)
33−
34−
35−-- | A version of 'cumulative' for use with nullary aggregators like
36−-- 'Rel8.Expr.Aggregate.countStar'.
37−cumulative_ :: Aggregates aggregates exprs => aggregates -> Window a exprs
38−cumulative_ = cumulative . const
39−
40−
41−-- | Return every column of the current row of a window query.
42−currentRow :: Window a a
43−currentRow = Window $ Opaleye.over (Opaleye.noWindowFunction id) mempty mempty
src/Rel8/Tabulate.hsdeleted−640
@@ -1,640 +0,0 @@
1−{-# language FlexibleContexts #-}
2−{-# language MonoLocalBinds #-}
3−{-# language ScopedTypeVariables #-}
4−{-# language StandaloneKindSignatures #-}
5−{-# language TypeApplications #-}
6−{-# language TupleSections #-}
7−{-# language UndecidableInstances #-}
8−
9−-- | "Rel8.Tabulate" provides an alternative API ('Tabulation') for writing
10−-- queries that complements the main "Rel8" API ('Query').
11−
12−module Rel8.Tabulate
13− (
14− Tabulation
15−
16− -- * Interfacing with 'Query's
17− , fromQuery
18− , toQuery
19− , liftQuery
20− , through
21− , lookup
22−
23− -- * Aggregation and Ordering
24− , aggregate
25− , distinct
26− , order
27−
28− -- ** Magic 'Tabulation's
29− -- $magic
30− , count
31− , optional
32− , many
33− , some
34− , exists
35− , present
36− , absent
37−
38− -- * Natural joins
39− , align
40− , alignWith
41− , leftAlign
42− , leftAlignWith
43− , rightAlign
44− , rightAlignWith
45− , zip
46− , zipWith
47− , similarity
48− , difference
49− )
50−where
51−
52−-- base
53−import Control.Applicative ( (<|>), empty, liftA2 )
54−import Control.Monad ( liftM2 )
55−import Data.Bifunctor ( Bifunctor, bimap, first, second )
56−import Data.Foldable ( traverse_ )
57−import Data.Function ( on )
58−import Data.Functor.Contravariant ( Contravariant, (>$<), contramap )
59−import Data.Int ( Int64 )
60−import Data.Kind ( Type )
61−import Data.Maybe ( fromJust, fromMaybe )
62−import Prelude hiding ( lookup, zip, zipWith )
63−
64−-- bifunctors
65−import Data.Bifunctor.Clown ( Clown( Clown ), runClown )
66−
67−-- comonad
68−import Control.Comonad ( extract )
69−
70−-- opaleye
71−import qualified Opaleye.Aggregate as Opaleye
72−import qualified Opaleye.Order as Opaleye ( orderBy, distinctOnExplicit )
73−
74−-- profunctors
75−import Data.Profunctor ( dimap, lmap )
76−
77−-- product-profunctors
78−import Data.Profunctor.Product
79− ( ProductProfunctor, (***!)
80− , SumProfunctor, (+++!)
81− )
82−import qualified Data.Profunctor.Product as PP
83−
84−-- rel8
85−import Rel8.Aggregate ( Aggregates )
86−import Rel8.Expr ( Expr )
87−import Rel8.Expr.Aggregate ( countStar )
88−import Rel8.Expr.Bool ( true )
89−import Rel8.Order ( Order( Order ) )
90−import Rel8.Query ( Query )
91−import qualified Rel8.Query.Exists as Q ( exists, present, absent )
92−import Rel8.Query.Filter ( where_ )
93−import Rel8.Query.List ( catNonEmptyTable )
94−import qualified Rel8.Query.Maybe as Q ( optional )
95−import Rel8.Query.Opaleye ( mapOpaleye, unsafePeekQuery )
96−import Rel8.Query.Rebind ( rebind )
97−import Rel8.Query.These ( alignBy )
98−import Rel8.Table ( Table, fromColumns, toColumns )
99−import Rel8.Table.Aggregate ( hgroupBy, listAgg, nonEmptyAgg )
100−import Rel8.Table.Alternative
101− ( AltTable, (<|>:)
102− , AlternativeTable, emptyTable
103− )
104−import Rel8.Table.Cols ( fromCols, toCols )
105−import Rel8.Table.Eq ( EqTable, (==:), eqTable )
106−import Rel8.Table.List ( ListTable( ListTable ) )
107−import Rel8.Table.Maybe ( MaybeTable( MaybeTable ), maybeTable )
108−import Rel8.Table.NonEmpty ( NonEmptyTable( NonEmptyTable ) )
109−import Rel8.Table.Opaleye ( aggregator, unpackspec )
110−import Rel8.Table.Ord ( OrdTable )
111−import Rel8.Table.Order ( ascTable )
112−import Rel8.Table.Projection
113− ( Biprojectable, biproject
114− , Projectable, project
115− , apply
116− )
117−import Rel8.Table.These ( TheseTable( TheseTable ), theseTable )
118−
119−-- semigroupoids
120−import Data.Functor.Apply ( Apply, liftF2 )
121−import Data.Functor.Bind ( Bind, (>>-) )
122−
123−
124−type Key :: Type -> Type
125−type Key = Maybe
126−
127−
128−cat :: Table Expr k => Key k -> Query k
129−cat = maybe emptyTable pure
130−
131−
132−key :: (ProductProfunctor p, SumProfunctor p)
133− => p a b -> p (Key a) (Key b)
134−key a = dimap from to (PP.empty +++! a)
135− where
136− from = maybe (Left ()) Right
137− to = either (const Nothing) Just
138−
139−
140−keyed :: (ProductProfunctor p, SumProfunctor p)
141− => p k l -> p a b -> p (Key k, a) (Key l, b)
142−keyed k a = key k ***! a
143−
144−
145−type Predicate :: Type -> Type
146−newtype Predicate a = Predicate (Maybe (a -> Expr Bool))
147−
148−
149−instance Contravariant Predicate where
150− contramap f (Predicate a) = Predicate (lmap f <$> a)
151−
152−
153−instance Semigroup (Predicate k) where
154− Predicate ma <> Predicate mb = Predicate $ ma <|> mb
155−
156−
157−instance Monoid (Predicate k) where
158− mempty = Predicate Nothing
159−
160−
161−match :: EqTable k => Key k -> Predicate k
162−match = Predicate . fmap (==:)
163−
164−
165−ensure :: Predicate k -> Key k -> Query ()
166−ensure (Predicate mp) = traverse_ (\k -> traverse_ (\p -> where_ (p k)) mp)
167−
168−
169−-- | A @'Tabulation' k a@ is like a @'Query' a@, except that each row also
170−-- has a key @k@ in addition to the value @a@. 'Tabulation's can be composed
171−-- monadically just like 'Query's, but the resulting join is more like a
172−-- @NATURAL JOIN@ (based on the common key column(s) @k@) than the
173−-- @CROSS JOIN@ given by 'Query'.
174−--
175−-- Another way to think of @'Tabulation' k a@ is as analogous to @Map k a@ in
176−-- the same way @'Query' a@ is analogous to @[a]@. However, there's nothing
177−-- stopping a 'Tabulation' from containing multiple rows with the same key, so
178−-- technically @Map k (NonEmpty a)@ is more accurate.
179−--
180−-- 'Tabulation's can be created from 'Query's with 'fromQuery' and 'liftQuery'
181−-- and converted back to 'Query's with 'lookup' and 'toQuery' (though note the
182−-- caveats that come with the latter).
183−type Tabulation :: Type -> Type -> Type
184−newtype Tabulation k a = Tabulation (Predicate k -> Query (Key k, a))
185−
186−
187−instance Biprojectable Tabulation where
188− biproject f g =
189− bimap
190− (fromColumns . apply f . toColumns)
191− (fromColumns . apply g . toColumns)
192−
193−
194−instance Bifunctor Tabulation where
195− bimap f g (Tabulation a) = Tabulation $ \p ->
196− bimap (fmap f) g <$> a (f >$< p)
197−
198−
199−instance Functor (Tabulation k) where
200− fmap = second
201−
202−
203−instance Projectable (Tabulation k) where
204− project f = fmap (fromColumns . apply f . toColumns)
205−
206−
207−-- | If @'Tabulation' k a@ is @Map k (NonEmpty a)@, then @(<.>)@ is
208−-- @intersectionWith (liftA2 (<*>))@
209−instance EqTable k => Apply (Tabulation k) where
210− liftF2 = liftA2
211−
212−
213−-- | @pure = 'liftQuery' . pure@
214−instance EqTable k => Applicative (Tabulation k) where
215− pure = liftQuery . pure
216− liftA2 = liftM2
217−
218−
219−instance EqTable k => Bind (Tabulation k) where
220− Tabulation as >>- f = Tabulation $ \p -> do
221− (k, a) <- as p
222− case f a of
223− Tabulation bs -> do
224− let p' = match k
225− (k', b) <- bs (p' <> p)
226− ensure p' k'
227− pure (k' <|> k, b)
228−
229−
230−instance EqTable k => Monad (Tabulation k) where
231− (>>=) = (>>-)
232−
233−
234−-- | If @'Tabulation' k a@ is @Map k (NonEmpty a)@, then @(<|>:)@ is
235−-- @unionWith (<>)@.
236−instance EqTable k => AltTable (Tabulation k) where
237− tas <|>: tbs = do
238− eas <- peek tas
239− ebs <- peek tbs
240− case (eas, ebs) of
241− (Left as, Left bs) -> liftQuery $ as <|>: bs
242− (Right as, Right bs) -> fromQuery $ as <|>: bs
243− _ -> catNonEmptyTable `through` ((<>) `on` some) tas tbs
244−
245−
246−instance EqTable k => AlternativeTable (Tabulation k) where
247− emptyTable = Tabulation $ const $ fmap (empty,) emptyTable
248−
249−
250−-- | If @'Tabulation' k a@ is @Map k (NonEmpty a)@, then @(<>)@ is
251−-- @unionWith (liftA2 (<>))@.
252−instance (EqTable k, Table Expr a, Semigroup a) => Semigroup (Tabulation k a)
253− where
254− (<>) = alignWith (theseTable id id (<>))
255−
256−
257−instance (EqTable k, Table Expr a, Semigroup a) => Monoid (Tabulation k a)
258− where
259− mempty = emptyTable
260−
261−
262−-- | Any 'Query' of key-value pairs @(k, a)@ can be a @'Tabulation' k a@.
263−fromQuery :: Query (k, a) -> Tabulation k a
264−fromQuery = Tabulation . const . fmap (first pure)
265−
266−
267−-- | Convert a @'Tabulation' k a@ back into a 'Query' of key-value pairs.
268−--
269−-- Note that the result of a 'toQuery' is undefined (will always return zero
270−-- rows) on 'Tabulation's constructed with 'liftQuery' or 'pure'. So while
271−-- @toQuery . fromQuery@ is always @id@, @fromQuery . toQuery@ is not.
272−--
273−-- A safer, more predictable alternative to 'toQuery' is to use 'lookup' with
274−-- an explicit set of keys:
275−--
276−-- @
277−-- do
278−-- k <- keys
279−-- a <- lookup k tabulation
280−-- pure (k, a)
281−-- @
282−--
283−-- Having said that, in practice, most legitimate uses of 'Tabulation' will
284−-- have a well-defined 'toQuery'. It would be possible in theory to encode
285−-- the necessary invariants at the type level using an indexed monad, but we
286−-- would lose the ability to use @do@-notation, which is the main benefit
287−-- of having 'Tabulation' as a monad in the first place.
288−--
289−-- In particular, @'toQuery' t@ is well-defined for any 'Tabulation' @t@
290−-- defined as @t = fromQuery _@. @'toQuery' t@ is also well-defined for any
291−-- 'Tabulation' @t@ defined as @t = t' >>= _@ or @t = t' *> _@ where
292−-- @'toQuery' t'@ is well-defined. There are other valid permutations too.
293−-- Generally, anything that uses 'fromQuery' at some point, unless wrapped in
294−-- a top-level 'present' or 'absent', will have a well-defined 'toQuery'.
295−toQuery :: Table Expr k => Tabulation k a -> Query (k, a)
296−toQuery (Tabulation f) = do
297− (mk, a) <- f mempty
298− k <- cat mk
299− pure (k, a)
300−
301−
302−-- | A @'Query' a@ can be treated as a @'Tabulation' k a@ where the given @a@
303−-- values exist at every possible key @k@.
304−liftQuery :: Query a -> Tabulation k a
305−liftQuery = Tabulation . const . fmap (empty,)
306−
307−
308−-- | Run a Kleisli arrow in the the 'Query' monad \"through\" a 'Tabulation'.
309−-- Useful for 'Rel8.filter'ing a 'Tabulation'.
310−--
311−-- @
312−-- 'Rel8.filter' ((>=. 30) . userAge) `'through'` usersById
313−-- @
314−through :: (a -> Query b) -> Tabulation k a -> Tabulation k b
315−through f (Tabulation as) = Tabulation $ \p -> do
316− (k, a) <- as p
317− b <- f a
318− pure (k, b)
319−infixr 1 `through`
320−
321−
322−-- | @'lookup' k t@ returns the value(s) at the key @k@ in the tabulation @t@.
323−lookup :: EqTable k => k -> Tabulation k a -> Query a
324−lookup k (Tabulation f) = do
325− (k', a) <- f p
326− ensure p k'
327− pure a
328− where
329− p = match (pure k)
330−
331−
332−-- | 'aggregate' aggregates the values within each key of a
333−-- 'Tabulation'. There is an implicit @GROUP BY@ on all the key columns.
334−aggregate :: forall k aggregates exprs.
335− ( EqTable k
336− , Aggregates aggregates exprs
337− )
338− => Tabulation k aggregates -> Tabulation k exprs
339−aggregate (Tabulation f) = Tabulation $
340− mapOpaleye (Opaleye.aggregate (keyed haggregator aggregator)) .
341− fmap (first (fmap (hgroupBy (eqTable @k) . toColumns))) .
342− f
343− where
344− haggregator = dimap fromColumns fromCols aggregator
345−
346−
347−-- | 'distinct' ensures a 'Tabulation' has at most one value for
348−-- each key, i.e., it drops duplicates. In general it keeps only the
349−-- \"first\" value it encounters for each key, but note that \"first\" is
350−-- undefined unless you first call 'order'.
351−distinct :: EqTable k => Tabulation k a -> Tabulation k a
352−distinct (Tabulation f) = Tabulation $
353− mapOpaleye (Opaleye.distinctOnExplicit (key unpackspec) fst) . f
354−
355−
356−-- | 'order' orders the /values/ of a 'Tabulation' within their
357−-- respective keys. This specifies a defined order for 'distinct'.
358−-- It also defines the order of the lists produced by 'many' and
359−-- 'some'.
360−order :: OrdTable k => Order a -> Tabulation k a -> Tabulation k a
361−order ordering (Tabulation f) =
362− Tabulation $ mapOpaleye (Opaleye.orderBy ordering') . f
363− where
364− Order ordering' = runClown (keyed (Clown ascTable) (Clown ordering))
365−
366−
367−-- $magic
368−--
369−-- Some of the following combinators produce \"magic\" 'Tabulation's. Let's
370−-- use 'count' as an example to demonstrate this concept. Consider
371−-- the following:
372−--
373−-- @
374−-- count $ fromQuery $ values
375−-- [ (lit 'a', lit True)
376−-- , (lit 'a', lit False)
377−-- , (lit 'b', lit True)
378−-- ]
379−-- @
380−--
381−-- You might expect this to be equivalent to the following 'Tabulation':
382−--
383−-- @
384−-- fromQuery $ values
385−-- [ (lit 'a', 2)
386−-- , (lit 'b', 1)
387−-- ]
388−-- @
389−--
390−-- However, it isn't quite. While the resulting 'Tabulation' does effectively
391−-- contain the above entries, it also behaves as though it contained the value
392−-- @0@ at every other possible key.
393−--
394−-- This means you can do:
395−--
396−-- @
397−-- do
398−-- user <- usersById
399−-- orderCount <- count ordersByUserId
400−-- @
401−--
402−-- To see how many orders a user has (getting @0@ if they have no orders).
403−
404−
405−-- | 'count' returns a count of how many entries are in the given
406−-- 'Tabulation' at each key.
407−--
408−-- The resulting 'Tabulation' is \"magic\" in that the value @0@ exists at
409−-- every possible key that wasn't in the given 'Tabulation'.
410−count :: EqTable k => Tabulation k a -> Tabulation k (Expr Int64)
411−count =
412− fmap (maybeTable 0 id) .
413− optional .
414− aggregate .
415− fmap (const countStar)
416−
417−
418−-- | 'optional' produces a \"magic\" 'Tabulation' whereby each
419−-- entry in the given 'Tabulation' is wrapped in 'Rel8.justTable', and every
420−-- other possible key contains a single 'Rel8.nothingTable'.
421−--
422−-- This is used to implement 'leftAlignWith'.
423−optional :: Tabulation k a -> Tabulation k (MaybeTable Expr a)
424−optional (Tabulation f) = Tabulation $ \p -> case p of
425− Predicate Nothing -> fmap pure <$> f p
426− _ -> fmap (\m -> (empty, snd <$> m)) $ Q.optional $ do
427− (k, a) <- f p
428− ensure p k
429− pure (k, a)
430−
431−
432−-- | 'many' aggregates each entry with a particular key into a
433−-- single entry with all of the values contained in a 'ListTable'.
434−--
435−-- 'order' can be used to give this 'ListTable' a defined order.
436−--
437−-- The resulting 'Tabulation' is \"magic\" in that the value
438−-- @'Rel8.listTable []'@ exists at every possible key that wasn't in the given
439−-- 'Tabulation'.
440−many :: (EqTable k, Table Expr a)
441− => Tabulation k a -> Tabulation k (ListTable Expr a)
442−many =
443− fmap (maybeTable mempty (\(ListTable a) -> ListTable a)) .
444− optional .
445− aggregate .
446− fmap (listAgg . toCols)
447−
448−
449−-- | 'some' aggregates each entry with a particular key into a
450−-- single entry with all of the values contained in a 'NonEmptyTable'.
451−--
452−-- 'order' can be used to give this 'NonEmptyTable' a defined order.
453−some :: (EqTable k, Table Expr a)
454− => Tabulation k a -> Tabulation k (NonEmptyTable Expr a)
455−some =
456− fmap (\(NonEmptyTable a) -> NonEmptyTable a) .
457− aggregate .
458− fmap (nonEmptyAgg . toCols)
459−
460−
461−-- | 'exists' produces a \"magic\" 'Tabulation' which contains the
462−-- value 'Rel8.true' at each key in the given 'Tabulation', and the value
463−-- 'Rel8.false' at every other possible key.
464−exists :: Tabulation k a -> Tabulation k (Expr Bool)
465−exists (Tabulation f) = Tabulation $ \p -> case p of
466− Predicate Nothing -> (true <$) <$> f p
467− _ -> fmap (empty,) $ Q.exists $ do
468− (k, _) <- f p
469− ensure p k
470−
471−
472−-- | 'present' produces a 'Tabulation' where a single @()@ row
473−-- exists for every key that was present in the given 'Tabulation'.
474−--
475−-- This is used to implement 'similarity'.
476−present :: Tabulation k a -> Tabulation k ()
477−present (Tabulation f) = Tabulation $ \p -> do
478− Q.present $ do
479− (k, _) <- f p
480− ensure p k
481− pure (empty, ())
482−
483−
484−-- | 'absent' produces a 'Tabulation' where a single @()@ row exists
485−-- at every possible key that absent from the given 'Tabulation'.
486−--
487−-- This is used to implement 'difference'.
488−absent :: Tabulation k a -> Tabulation k ()
489−absent (Tabulation f) = Tabulation $ \p -> do
490− Q.absent $ do
491− (k, _) <- f p
492− ensure p k
493− pure (empty, ())
494−
495−
496−-- | Performs a @NATURAL FULL OUTER JOIN@ based on the common key columns.
497−--
498−-- Analogous to 'Data.Semialign.align'.
499−align :: EqTable k
500− => Tabulation k a -> Tabulation k b -> Tabulation k (TheseTable Expr a b)
501−align = alignWith id
502−
503−
504−-- | Performs a @NATURAL FULL OUTER JOIN@ based on the common key columns.
505−--
506−-- Analogous to 'Data.Semialign.alignWith'.
507−alignWith :: EqTable k
508− => (TheseTable Expr a b -> c)
509− -> Tabulation k a -> Tabulation k b -> Tabulation k c
510−alignWith f (Tabulation as) (Tabulation bs) = Tabulation $ \p -> do
511− tkab <- liftF2 (alignBy condition) as bs p
512− k <- traverse (rebind "key") $ recover $ bimap fst fst tkab
513− let
514− tab = bimap snd snd tkab
515− pure (k, f tab)
516− where
517− condition (k, _) (k', _) = fromMaybe true (liftA2 (==:) k k')
518− recover (TheseTable mma@(MaybeTable _ ma) mmb@(MaybeTable _ mb)) =
519− case extract ma of
520− Nothing -> extract mb
521− Just a -> case extract mb of
522− Nothing -> extract ma
523− Just b -> case a <$ mma <|>: b <$ mmb of
524− MaybeTable _ c -> pure (extract c)
525−
526−
527−-- | Performs a @NATURAL LEFT OUTER JOIN@ based on the common key columns.
528−--
529−-- Analogous to 'Data.Semialign.rpadZip'.
530−--
531−-- Note that you can achieve the same effect with 'optional' and the
532−-- 'Applicative' instance for 'Tabulation', i.e., this is just
533−-- @\left right -> liftA2 (,) left (optional right). You can also
534−-- use @do@-notation.
535−leftAlign :: EqTable k
536− => Tabulation k a -> Tabulation k b -> Tabulation k (a, MaybeTable Expr b)
537−leftAlign = leftAlignWith (,)
538−
539−
540−-- | Performs a @NATURAL LEFT OUTER JOIN@ based on the common key columns.
541−--
542−-- Analogous to 'Data.Semialign.rpadZipWith'.
543−--
544−-- Note that you can achieve the same effect with 'optional' and the
545−-- 'Applicative' instance for 'Tabulation', i.e., this is just
546−-- @\f left right -> liftA2 f left (optional right). You can also
547−-- use @do@-notation.
548−leftAlignWith :: EqTable k
549− => (a -> MaybeTable Expr b -> c)
550− -> Tabulation k a -> Tabulation k b -> Tabulation k c
551−leftAlignWith f left right = liftA2 f left (optional right)
552−
553−
554−-- | Performs a @NATURAL RIGHT OUTER JOIN@ based on the common key columns.
555−--
556−-- Analogous to 'Data.Semialign.lpadZip'.
557−--
558−-- Note that you can achieve the same effect with 'optional' and the
559−-- 'Applicative' instance for 'Tabulation', i.e., this is just
560−-- @\left right -> liftA2 (flip (,)) right (optional left). You can
561−-- also use @do@-notation.
562−rightAlign :: EqTable k
563− => Tabulation k a -> Tabulation k b -> Tabulation k (MaybeTable Expr a, b)
564−rightAlign = rightAlignWith (,)
565−
566−
567−-- | Performs a @NATURAL RIGHT OUTER JOIN@ based on the common key columns.
568−--
569−-- Analogous to 'Data.Semialign.lpadZipWith'.
570−--
571−-- Note that you can achieve the same effect with 'optional' and the
572−-- 'Applicative' instance for 'Tabulation', i.e., this is just
573−-- @\f left right -> liftA2 (flip f) right (optional left). You can
574−-- also use @do@-notation.
575−rightAlignWith :: EqTable k
576− => (MaybeTable Expr a -> b -> c)
577− -> Tabulation k a -> Tabulation k b -> Tabulation k c
578−rightAlignWith f left right = liftA2 (flip f) right (optional left)
579−
580−
581−-- | Performs a @NATURAL INNER JOIN@ based on the common key columns.
582−--
583−-- Analagous to 'Data.Semialign.zip'.
584−--
585−-- Note that you can achieve the same effect with the 'Applicative' instance
586−-- of 'Tabulation', i.e., this is just @'liftA2 (,)'@. You can also use
587−-- @do@-notation.
588−zip :: EqTable k
589− => Tabulation k a -> Tabulation k b -> Tabulation k (a, b)
590−zip = zipWith (,)
591−
592−
593−-- | Performs a @NATURAL INNER JOIN@ based on the common key columns.
594−--
595−-- Analagous to 'Data.Semialign.zipWith'.
596−--
597−-- Note that you can achieve the same effect with the 'Applicative' instance
598−-- of 'Tabulation', i.e., this is just @'liftA2'@. You can also use
599−-- @do@-notation.
600−zipWith :: EqTable k
601− => (a -> b -> c) -> Tabulation k a -> Tabulation k b -> Tabulation k c
602−zipWith = liftA2
603−
604−
605−-- | Performs a [@NATURAL SEMI JOIN@](https://en.wikipedia.org/wiki/Relational_algebra#Semijoin_%28%E2%8B%89%29%28%E2%8B%8A%29)
606−-- based on the common key columns.
607−--
608−-- The result is a subset of the left tabulation where only entries which have
609−-- a corresponding entry in the right tabulation are kept.
610−--
611−-- Note that you can achieve a similar effect with 'present' and the
612−-- 'Applicative' instance of 'Tabulation', i.e., this is just
613−-- @\left right -> left <* present right@. You can also use
614−-- @do@-notation.
615−similarity :: EqTable k => Tabulation k a -> Tabulation k b -> Tabulation k a
616−similarity a b = a <* present b
617−
618−
619−-- | Performs a [@NATURAL ANTI JOIN@](https://en.wikipedia.org/wiki/Relational_algebra#Antijoin_%28%E2%96%B7%29)
620−-- based on the common key columns.
621−--
622−-- The result is a subset of the left tabulation where only entries which do
623−-- not have a corresponding entry in the right tabulation are kept.
624−--
625−-- Note that you can achieve a similar effect with 'absent' and the
626−-- 'Applicative' instance of 'Tabulation', i.e., this is just
627−-- @\left right -> left <* absent right@. You can also use
628−-- @do@-notation.
629−difference :: EqTable k => Tabulation k a -> Tabulation k b -> Tabulation k a
630−difference a b = a <* absent b
631−
632−
633−-- | 'Tabulation's can be produced with either 'fromQuery' or 'liftQuery', and
634−-- in some cases we might want to treat these differently. 'peek' uses
635−-- 'unsafePeekQuery' to determine which type of 'Tabulation' we have.
636−peek :: Tabulation k a -> Tabulation k (Either (Query a) (Query (k, a)))
637−peek (Tabulation f) = Tabulation $ \p ->
638− pure $ (empty,) $ case unsafePeekQuery (f p) of
639− (Nothing, _) -> Left $ fmap snd (f p)
640− (Just _, _) -> Right $ fmap (first fromJust) (f p)
src/Rel8/Type.hs+8−9
@@ -1,4 +1,3 @@
1−{-# language FlexibleContexts #-}
2{-# language FlexibleInstances #-}
1{-# language FlexibleInstances #-}
3{-# language MonoLocalBinds #-}
2{-# language MonoLocalBinds #-}
4{-# language MultiWayIf #-}
3{-# language MultiWayIf #-}
@@ -128,10 +127,10 @@ instance DBType Int64 where
128instance DBType Float where
127instance DBType Float where
129 typeInformation = TypeInformation
128 typeInformation = TypeInformation
130 { encode = \x -> Opaleye.ConstExpr
129 { encode = \x -> Opaleye.ConstExpr
131− if | x == (1 / 0) -> Opaleye.OtherLit "'Infinity'"
130+ if | x == (1 /0) -> Opaleye.OtherLit "'Infinity'"
132− | isNaN x -> Opaleye.OtherLit "'NaN'"
131+ | isNaN x -> Opaleye.OtherLit "'NaN'"
133− | x == (-1 / 0) -> Opaleye.OtherLit "'-Infinity'"
132+ | x == (-1/0) -> Opaleye.OtherLit "'-Infinity'"
134− | otherwise -> Opaleye.NumericLit $ realToFrac x
133+ | otherwise -> Opaleye.NumericLit $ realToFrac x
135 , decode = Hasql.float4
134 , decode = Hasql.float4
136 , typeName = "float4"
135 , typeName = "float4"
137 }
136 }
@@ -141,10 +140,10 @@ instance DBType Float where
141instance DBType Double where
140instance DBType Double where
142 typeInformation = TypeInformation
141 typeInformation = TypeInformation
143 { encode = \x -> Opaleye.ConstExpr
142 { encode = \x -> Opaleye.ConstExpr
144− if | x == (1 / 0) -> Opaleye.OtherLit "'Infinity'"
143+ if | x == (1 /0) -> Opaleye.OtherLit "'Infinity'"
145− | isNaN x -> Opaleye.OtherLit "'NaN'"
144+ | isNaN x -> Opaleye.OtherLit "'NaN'"
146− | x == (-1 / 0) -> Opaleye.OtherLit "'-Infinity'"
145+ | x == (-1/0) -> Opaleye.OtherLit "'-Infinity'"
147− | otherwise -> Opaleye.NumericLit $ realToFrac x
146+ | otherwise -> Opaleye.NumericLit $ realToFrac x
148 , decode = Hasql.float8
147 , decode = Hasql.float8
149 , typeName = "float8"
148 , typeName = "float8"
150 }
149 }
src/Rel8/Type/Composite.hs+12−13
@@ -20,7 +20,6 @@ where
20
20
21-- base
21-- base
22import Data.Functor.Const ( Const( Const ), getConst )
22import Data.Functor.Const ( Const( Const ), getConst )
23−import Data.Functor.Identity ( Identity( Identity ) )
24import Data.Kind ( Constraint, Type )
23import Data.Kind ( Constraint, Type )
25import Prelude
24import Prelude
26
25
@@ -31,19 +30,19 @@ import qualified Hasql.Decoders as Hasql
31import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
30import qualified Opaleye.Internal.HaskellDB.PrimQuery as Opaleye
32
31
33-- rel8
32-- rel8
34−import Rel8.Expr ( Expr )
33+import Rel8.Expr ( Col( E ), Expr )
35import Rel8.Expr.Opaleye ( castExpr, fromPrimExpr, toPrimExpr )
34import Rel8.Expr.Opaleye ( castExpr, fromPrimExpr, toPrimExpr )
36import Rel8.Schema.HTable ( HTable, hfield, hspecs, htabulate, htabulateA )
35import Rel8.Schema.HTable ( HTable, hfield, hspecs, htabulate, htabulateA )
37−import Rel8.Schema.Name ( Name( Name ) )
36+import Rel8.Schema.Name ( Col( N ), Name( Name ) )
38import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
37import Rel8.Schema.Null ( Nullity( Null, NotNull ) )
39−import Rel8.Schema.Result ( Result )
38+import Rel8.Schema.Result ( Col( R ), Result )
40−import Rel8.Schema.Spec ( Spec( Spec, nullity, info ) )
39+import Rel8.Schema.Spec ( SSpec( SSpec, nullity, info ) )
41import Rel8.Table ( fromColumns, toColumns, fromResult, toResult )
40import Rel8.Table ( fromColumns, toColumns, fromResult, toResult )
42import Rel8.Table.Eq ( EqTable )
41import Rel8.Table.Eq ( EqTable )
43import Rel8.Table.HKD ( HKD, HKDable )
42import Rel8.Table.HKD ( HKD, HKDable )
44import Rel8.Table.Ord ( OrdTable )
43import Rel8.Table.Ord ( OrdTable )
45import Rel8.Table.Rel8able ()
44import Rel8.Table.Rel8able ()
46−import Rel8.Table.Serialize ( litHTable )
45+import Rel8.Table.Serialize ( lit )
47import Rel8.Type ( DBType, typeInformation )
46import Rel8.Type ( DBType, typeInformation )
48import Rel8.Type.Eq ( DBEq )
47import Rel8.Type.Eq ( DBEq )
49import Rel8.Type.Information ( TypeInformation(..) )
48import Rel8.Type.Information ( TypeInformation(..) )
@@ -69,7 +68,7 @@ newtype Composite a = Composite
69instance DBComposite a => DBType (Composite a) where
68instance DBComposite a => DBType (Composite a) where
70 typeInformation = TypeInformation
69 typeInformation = TypeInformation
71 { decode = Hasql.composite (Composite . fromResult @_ @(HKD a Expr) <$> decoder)
70 { decode = Hasql.composite (Composite . fromResult @_ @(HKD a Expr) <$> decoder)
72− , encode = encoder . litHTable . toResult @_ @(HKD a Expr) . unComposite
71+ , encode = encoder . lit . toResult @_ @(HKD a Expr) . unComposite
73 , typeName = compositeTypeName @a
72 , typeName = compositeTypeName @a
74 }
73 }
75
74
@@ -113,23 +112,23 @@ compose = castExpr . fromPrimExpr . encoder . toColumns
113decompose :: forall a. DBComposite a => Expr a -> HKD a Expr
112decompose :: forall a. DBComposite a => Expr a -> HKD a Expr
114decompose (toPrimExpr -> a) = fromColumns $ htabulate \field ->
113decompose (toPrimExpr -> a) = fromColumns $ htabulate \field ->
115 case hfield names field of
114 case hfield names field of
116− Name name -> case hfield hspecs field of
115+ N (Name name) -> case hfield hspecs field of
117− Spec {} -> fromPrimExpr $ Opaleye.CompositeExpr a name
116+ SSpec {} -> E $ fromPrimExpr $ Opaleye.CompositeExpr a name
118 where
117 where
119 names = toColumns (compositeFields @a)
118 names = toColumns (compositeFields @a)
120
119
121
120
122−decoder :: HTable t => Hasql.Composite (t Result)
121+decoder :: HTable t => Hasql.Composite (t (Col Result))
123decoder = unwrapApplicative $ htabulateA \field ->
122decoder = unwrapApplicative $ htabulateA \field ->
124 case hfield hspecs field of
123 case hfield hspecs field of
125− Spec {nullity, info} -> WrapApplicative $ Identity <$>
124+ SSpec {nullity, info} -> WrapApplicative $ R <$>
126 case nullity of
125 case nullity of
127 Null -> Hasql.field $ Hasql.nullable $ decode info
126 Null -> Hasql.field $ Hasql.nullable $ decode info
128 NotNull -> Hasql.field $ Hasql.nonNullable $ decode info
127 NotNull -> Hasql.field $ Hasql.nonNullable $ decode info
129
128
130
129
131−encoder :: HTable t => t Expr -> Opaleye.PrimExpr
130+encoder :: HTable t => t (Col Expr) -> Opaleye.PrimExpr
132encoder a = Opaleye.FunExpr "ROW" exprs
131encoder a = Opaleye.FunExpr "ROW" exprs
133 where
132 where
134 exprs = getConst $ htabulateA \field -> case hfield a field of
133 exprs = getConst $ htabulateA \field -> case hfield a field of
135− expr -> Const [toPrimExpr expr]
134+ E (toPrimExpr -> expr) -> Const [expr]
src/Rel8/Type/Enum.hs−1
@@ -106,7 +106,6 @@ class (DBType a, Enumable a) => DBEnum a where
106
106
107-- | Types that are sum types, where each constructor is unary (that is, has no
107-- | Types that are sum types, where each constructor is unary (that is, has no
108-- fields).
108-- fields).
109−type Enumable :: Type -> Constraint
110class (Generic a, GEnumable (Rep a)) => Enumable a
109class (Generic a, GEnumable (Rep a)) => Enumable a
111instance (Generic a, GEnumable (Rep a)) => Enumable a
110instance (Generic a, GEnumable (Rep a)) => Enumable a
112
111
src/Rel8/Type/JSONBEncoded.hs−4
@@ -1,5 +1,3 @@
1−{-# language StandaloneKindSignatures #-}
2−
3module Rel8.Type.JSONBEncoded ( JSONBEncoded(..) ) where
1module Rel8.Type.JSONBEncoded ( JSONBEncoded(..) ) where
4
2
5-- aeson
3-- aeson
@@ -8,7 +6,6 @@ import Data.Aeson.Types ( parseEither )
8
6
9-- base
7-- base
10import Data.Bifunctor ( first )
8import Data.Bifunctor ( first )
11−import Data.Kind ( Type )
12import Prelude
9import Prelude
13
10
14-- hasql
11-- hasql
@@ -23,7 +20,6 @@ import Data.Text ( pack )
23
20
24
21
25-- | Like 'Rel8.JSONEncoded', but works for @jsonb@ columns.
22-- | Like 'Rel8.JSONEncoded', but works for @jsonb@ columns.
26−type JSONBEncoded :: Type -> Type
27newtype JSONBEncoded a = JSONBEncoded { fromJSONBEncoded :: a }
23newtype JSONBEncoded a = JSONBEncoded { fromJSONBEncoded :: a }
28
24
29
25
src/Rel8/Type/JSONEncoded.hs−4
@@ -1,5 +1,3 @@
1−{-# language StandaloneKindSignatures #-}
2−
3module Rel8.Type.JSONEncoded ( JSONEncoded(..) ) where
1module Rel8.Type.JSONEncoded ( JSONEncoded(..) ) where
4
2
5-- aeson
3-- aeson
@@ -7,7 +5,6 @@ import Data.Aeson ( FromJSON, ToJSON, parseJSON, toJSON )
7import Data.Aeson.Types ( parseEither )
5import Data.Aeson.Types ( parseEither )
8
6
9-- base
7-- base
10−import Data.Kind ( Type )
11import Prelude
8import Prelude
12
9
13-- rel8
10-- rel8
@@ -18,7 +15,6 @@ import Rel8.Type.Information ( parseTypeInformation )
18-- | A deriving-via helper type for column types that store a Haskell value
15-- | A deriving-via helper type for column types that store a Haskell value
19-- using a JSON encoding described by @aeson@'s 'ToJSON' and 'FromJSON' type
16-- using a JSON encoding described by @aeson@'s 'ToJSON' and 'FromJSON' type
20-- classes.
17-- classes.
21−type JSONEncoded :: Type -> Type
22newtype JSONEncoded a = JSONEncoded { fromJSONEncoded :: a }
18newtype JSONEncoded a = JSONEncoded { fromJSONEncoded :: a }
23
19
24
20
src/Rel8/Type/Num.hs+1−4
@@ -18,7 +18,6 @@ import Prelude
18
18
19-- rel8
19-- rel8
20import Rel8.Type ( DBType )
20import Rel8.Type ( DBType )
21−import Rel8.Type.Ord ( DBOrd )
22
21
23-- scientific
22-- scientific
24import Data.Scientific ( Scientific )
23import Data.Scientific ( Scientific )
@@ -40,14 +39,13 @@ instance DBNum Scientific
40-- expressions. This is a Rel8 concept, and allows us to provide
39-- expressions. This is a Rel8 concept, and allows us to provide
41-- 'fromIntegral'.
40-- 'fromIntegral'.
42type DBIntegral :: Type -> Constraint
41type DBIntegral :: Type -> Constraint
43−class (DBNum a, DBOrd a) => DBIntegral a
42+class DBNum a => DBIntegral a
44instance DBIntegral Int16
43instance DBIntegral Int16
45instance DBIntegral Int32
44instance DBIntegral Int32
46instance DBIntegral Int64
45instance DBIntegral Int64
47
46
48
47
49-- | The class of database types that support the @/@ operator.
48-- | The class of database types that support the @/@ operator.
50−type DBFractional :: Type -> Constraint
51class DBNum a => DBFractional a
49class DBNum a => DBFractional a
52instance DBFractional Float
50instance DBFractional Float
53instance DBFractional Double
51instance DBFractional Double
@@ -55,7 +53,6 @@ instance DBFractional Scientific
55
53
56
54
57-- | The class of database types that support the @/@ operator.
55-- | The class of database types that support the @/@ operator.
58−type DBFloating :: Type -> Constraint
59class DBFractional a => DBFloating a
56class DBFractional a => DBFloating a
60instance DBFloating Float
57instance DBFloating Float
61instance DBFloating Double
58instance DBFloating Double
src/Rel8/Type/Ord.hs+2
@@ -75,6 +75,7 @@ instance Sql DBOrd a => DBOrd (NonEmpty a)
75-- | The class of database types that support the @max@ aggregation function.
75-- | The class of database types that support the @max@ aggregation function.
76type DBMax :: Type -> Constraint
76type DBMax :: Type -> Constraint
77class DBOrd a => DBMax a
77class DBOrd a => DBMax a
78+instance DBMax Bool
78instance DBMax Char
79instance DBMax Char
79instance DBMax Int16
80instance DBMax Int16
80instance DBMax Int32
81instance DBMax Int32
@@ -100,6 +101,7 @@ instance Sql DBMax a => DBMax (NonEmpty a)
100-- | The class of database types that support the @min@ aggregation function.
101-- | The class of database types that support the @min@ aggregation function.
101type DBMin :: Type -> Constraint
102type DBMin :: Type -> Constraint
102class DBOrd a => DBMin a
103class DBOrd a => DBMin a
104+instance DBMin Bool
103instance DBMin Char
105instance DBMin Char
104instance DBMin Int16
106instance DBMin Int16
105instance DBMin Int32
107instance DBMin Int32
src/Rel8/Type/ReadShow.hs−3
@@ -1,12 +1,10 @@
1{-# language ScopedTypeVariables #-}
1{-# language ScopedTypeVariables #-}
2−{-# language StandaloneKindSignatures #-}
3{-# language TypeApplications #-}
2{-# language TypeApplications #-}
4{-# language ViewPatterns #-}
3{-# language ViewPatterns #-}
5
4
6module Rel8.Type.ReadShow ( ReadShow(..) ) where
5module Rel8.Type.ReadShow ( ReadShow(..) ) where
7
6
8-- base
7-- base
9−import Data.Kind ( Type )
10import Data.Proxy ( Proxy( Proxy ) )
8import Data.Proxy ( Proxy( Proxy ) )
11import Data.Typeable ( Typeable, typeRep )
9import Data.Typeable ( Typeable, typeRep )
12import Prelude
10import Prelude
@@ -22,7 +20,6 @@ import qualified Data.Text as Text
22
20
23-- | A deriving-via helper type for column types that store a Haskell value
21-- | A deriving-via helper type for column types that store a Haskell value
24-- using a Haskell's 'Read' and 'Show' type classes.
22-- using a Haskell's 'Read' and 'Show' type classes.
25−type ReadShow :: Type -> Type
26newtype ReadShow a = ReadShow { fromReadShow :: a }
23newtype ReadShow a = ReadShow { fromReadShow :: a }
27
24
28
25
src/Rel8/Type/Tag.hs−1
@@ -90,7 +90,6 @@ instance DBMonoid MaybeTag where
90 memptyExpr = litExpr mempty
90 memptyExpr = litExpr mempty
91
91
92
92
93−type Tag :: Type
94newtype Tag = Tag Text
93newtype Tag = Tag Text
95 deriving newtype
94 deriving newtype
96 ( Eq, Ord, Read, Show
95 ( Eq, Ord, Read, Show
src/Rel8/Window.hsdeleted−97
@@ -1,97 +0,0 @@
1−{-# language DerivingVia #-}
2−{-# language FlexibleContexts #-}
3−{-# language GeneralizedNewtypeDeriving #-}
4−{-# language ScopedTypeVariables #-}
5−{-# language StandaloneKindSignatures #-}
6−{-# language TypeApplications #-}
7−
8−module Rel8.Window
9− ( Window(..)
10− , Partition
11− , over
12− , partitionBy
13− , orderPartitionBy
14− )
15−where
16−
17−-- base
18−import Data.Functor.Const ( Const( Const ), getConst )
19−import Data.Functor.Contravariant ( Contravariant, contramap )
20−import Data.Kind ( Type )
21−import Prelude
22−
23−-- opaleye
24−import qualified Opaleye.Internal.Window as Opaleye
25−import qualified Opaleye.Internal.PackMap as Opaleye
26−
27−-- profunctors
28−import Data.Profunctor ( Profunctor )
29−
30−-- product-profunctors
31−import Data.Profunctor.Product ( ProductProfunctor, (****), purePP )
32−
33−-- rel8
34−import Rel8.Expr.Opaleye ( toColumn, toPrimExpr )
35−import Rel8.Order( Order( Order ) )
36−import Rel8.Schema.HTable ( hfield, htabulateA )
37−import Rel8.Table ( Columns, toColumns )
38−import Rel8.Table.Eq ( EqTable )
39−
40−-- semigroupoids
41−import Data.Functor.Apply ( Apply, WrappedApplicative(..) )
42−
43−
44−-- | 'Window' is an applicative functor that represents expressions that
45−-- contain
46−-- [window functions](https://www.postgresql.org/docs/current/tutorial-window.html).
47−-- 'Rel8.Query.Window.window' can be used to
48−-- evaluate these expressions over a particular query.
49−type Window :: Type -> Type -> Type
50−newtype Window a b = Window (Opaleye.Windows a b)
51− deriving newtype (Profunctor)
52− deriving newtype (Functor, Applicative)
53− deriving (Apply) via (WrappedApplicative (Window a))
54−
55−
56−instance ProductProfunctor Window where
57− purePP = pure
58− (****) = (<*>)
59−
60−
61−-- | In PostgreSQL, window functions must specify the \"window\" or
62−-- \"partition\" over which they operate. The syntax for this looks like:
63−-- @SUM(salary) OVER (PARTITION BY department)@. The Rel8 type 'Partition'
64−-- represents everything that comes after @OVER@.
65−--
66−-- 'Partition' is a 'Monoid', so 'Window's created with 'partitionBy' and
67−-- 'orderWindowBy' can be combined using '<>'.
68−type Partition :: Type -> Type
69−newtype Partition a = Partition (Opaleye.Window a)
70− deriving newtype (Contravariant, Semigroup, Monoid)
71−
72−
73−-- | 'over' adds a 'Partition' to a 'Window' expression.
74−--
75−-- @@@
76−-- 'Rel8.Table.Window.cumulative' ('Rel8.Expr.Aggregate.sum' . salary) `over` 'partitionBy' department <> 'orderPartitionBy' (salary >$< 'Rel8.desc')
77−-- @@@
78−over :: Window a b -> Partition a -> Window a b
79−over (Window (Opaleye.Windows (Opaleye.PackMap w))) (Partition p) =
80− Window $ Opaleye.Windows $ Opaleye.PackMap $ \f ->
81− w (\(o, p') -> f (o, p' <> p))
82−infixl 1 `over`
83−
84−
85−-- | Restricts a window function to operate only the group of rows that share
86−-- the same value(s) for the given expression(s).
87−partitionBy :: forall b a. EqTable b => (a -> b) -> Partition a
88−partitionBy f =
89− Partition $ contramap (toColumns . f) $ getConst $
90− htabulateA @(Columns b) $ \field ->
91− Const $ Opaleye.partitionBy (toColumn . toPrimExpr . (`hfield` field))
92−
93−
94−-- | Controls the order in which rows are processed by window functions. This
95−-- does not need to match the ordering of the overall query.
96−orderPartitionBy :: Order a -> Partition a
97−orderPartitionBy (Order ordering) = Partition $ Opaleye.orderPartitionBy ordering
tests/Main.hs+178−288
@@ -1,11 +1,12 @@
1−{-# language BangPatterns #-}
2{-# language BlockArguments #-}
1{-# language BlockArguments #-}
2+{-# language DataKinds #-}
3{-# language DeriveAnyClass #-}
3{-# language DeriveAnyClass #-}
4{-# language DeriveGeneric #-}
4{-# language DeriveGeneric #-}
5{-# language DerivingStrategies #-}
5{-# language DerivingStrategies #-}
6+{-# language DisambiguateRecordFields #-}
6{-# language FlexibleContexts #-}
7{-# language FlexibleContexts #-}
7{-# language FlexibleInstances #-}
8{-# language FlexibleInstances #-}
8−{-# language MonoLocalBinds #-}
9+{-# language GADTs #-}
9{-# language NamedFieldPuns #-}
10{-# language NamedFieldPuns #-}
10{-# language OverloadedStrings #-}
11{-# language OverloadedStrings #-}
11{-# language RecordWildCards #-}
12{-# language RecordWildCards #-}
@@ -13,15 +14,17 @@
13{-# language StandaloneDeriving #-}
14{-# language StandaloneDeriving #-}
14{-# language TypeApplications #-}
15{-# language TypeApplications #-}
15
16
17+{-# options_ghc -fno-warn-redundant-constraints #-}
18+
16module Main
19module Main
17 ( main
20 ( main
18 )
21 )
19where
22where
20
23
21-- base
24-- base
22−import Control.Applicative ( empty, liftA2, liftA3 )
25+import Control.Applicative ( liftA2, liftA3 )
23−import Control.Exception ( bracket, throwIO )
26+import Control.Monad (void)
24−import Control.Monad ( (>=>), void )
27+import Control.Monad.IO.Class ( MonadIO, liftIO )
25import Data.Bifunctor ( bimap )
28import Data.Bifunctor ( bimap )
26import Data.Foldable ( for_ )
29import Data.Foldable ( for_ )
27import Data.Int ( Int32, Int64 )
30import Data.Int ( Int32, Int64 )
@@ -35,27 +38,25 @@ import GHC.Generics ( Generic )
35import qualified Data.ByteString.Lazy
38import qualified Data.ByteString.Lazy
36
39
37-- case-insensitive
40-- case-insensitive
38−import Data.CaseInsensitive ( mk )
41+import Data.CaseInsensitive (mk)
39
42
40-- containers
43-- containers
41−import Data.Containers.ListUtils ( nubOrdOn )
42import qualified Data.Map.Strict as Map
44import qualified Data.Map.Strict as Map
43
45
44-- hasql
46-- hasql
45−import Hasql.Connection ( Connection, acquire, release )
47+import Hasql.Connection ( Connection, acquire, release )
46import Hasql.Session ( sql, run )
48import Hasql.Session ( sql, run )
47
49
48−-- hasql-transaction
49−import Hasql.Transaction ( Transaction, condemn, statement )
50−import qualified Hasql.Transaction.Sessions as Hasql
51−
52-- hedgehog
50-- hedgehog
53import Hedgehog ( property, (===), forAll, cover, diff, evalM, PropertyT, TestT, test, Gen )
51import Hedgehog ( property, (===), forAll, cover, diff, evalM, PropertyT, TestT, test, Gen )
54import qualified Hedgehog.Gen as Gen
52import qualified Hedgehog.Gen as Gen
55import qualified Hedgehog.Range as Range
53import qualified Hedgehog.Range as Range
56
54
57−-- mmorph
55+-- lifted-base
56+import Control.Exception.Lifted ( bracket, throwIO, bracket_ )
57+
58+-- monad-control
58−import Control.Monad.Morph ( hoist )
59+import Control.Monad.Trans.Control ( MonadBaseControl )
59
60
60-- rel8
61-- rel8
61import Rel8 ( Result )
62import Rel8 ( Result )
@@ -71,16 +72,12 @@ import Test.Tasty
71import Test.Tasty.Hedgehog ( testProperty )
72import Test.Tasty.Hedgehog ( testProperty )
72
73
73-- text
74-- text
74−import Data.Text ( Text, pack, unpack )
75+import Data.Text (Text, pack)
75import qualified Data.Text.Lazy
76import qualified Data.Text.Lazy
76−import Data.Text.Encoding ( decodeUtf8 )
77
77
78-- time
78-- time
79import Data.Time
79import Data.Time
80
80
81−-- transformers
82−import Control.Monad.Trans.Class ( lift )
83−
84-- tmp-postgres
81-- tmp-postgres
85import qualified Database.Postgres.Temp as TmpPostgres
82import qualified Database.Postgres.Temp as TmpPostgres
86
83
@@ -116,13 +113,11 @@ tests =
116 , testCatMaybeTable getTestDatabase
113 , testCatMaybeTable getTestDatabase
117 , testCatMaybe getTestDatabase
114 , testCatMaybe getTestDatabase
118 , testMaybeTable getTestDatabase
115 , testMaybeTable getTestDatabase
119− , testAggregateMaybeTable getTestDatabase
120 , testNestedTables getTestDatabase
116 , testNestedTables getTestDatabase
121 , testMaybeTableApplicative getTestDatabase
117 , testMaybeTableApplicative getTestDatabase
122 , testLogicalFixities getTestDatabase
118 , testLogicalFixities getTestDatabase
123 , testUpdate getTestDatabase
119 , testUpdate getTestDatabase
124 , testDelete getTestDatabase
120 , testDelete getTestDatabase
125− , testUpsert getTestDatabase
126 , testSelectNestedPairs getTestDatabase
121 , testSelectNestedPairs getTestDatabase
127 , testSelectArray getTestDatabase
122 , testSelectArray getTestDatabase
128 , testNestedMaybeTable getTestDatabase
123 , testNestedMaybeTable getTestDatabase
@@ -138,7 +133,6 @@ tests =
138 flip run conn do
133 flip run conn do
139 sql "CREATE EXTENSION citext"
134 sql "CREATE EXTENSION citext"
140 sql "CREATE TABLE test_table ( column1 text not null, column2 bool not null )"
135 sql "CREATE TABLE test_table ( column1 text not null, column2 bool not null )"
141− sql "CREATE TABLE unique_table ( \"key\" text not null unique, \"value\" text not null )"
142 sql "CREATE SEQUENCE test_seq"
136 sql "CREATE SEQUENCE test_seq"
143
137
144 return db
138 return db
@@ -146,21 +140,19 @@ tests =
146 stopTestDatabase = TmpPostgres.stop
140 stopTestDatabase = TmpPostgres.stop
147
141
148
142
149−connect :: TmpPostgres.DB -> IO Connection
150−connect = acquire . TmpPostgres.toConnectionString >=> either (maybe empty (fail . unpack . decodeUtf8)) pure
151−
152−
153databasePropertyTest
143databasePropertyTest
154 :: TestName
144 :: TestName
155− -> ((TestT Transaction () -> PropertyT IO ()) -> PropertyT IO ())
145+ -> (((Connection -> TestT IO ()) -> PropertyT IO ()) -> PropertyT IO ())
156 -> IO TmpPostgres.DB -> TestTree
146 -> IO TmpPostgres.DB -> TestTree
157databasePropertyTest testName f getTestDatabase =
147databasePropertyTest testName f getTestDatabase =
158− withResource (connect =<< getTestDatabase) release $ \c ->
148+ withResource connect release $ \c ->
159 testProperty testName $ property do
149 testProperty testName $ property do
160− connection <- lift c
150+ connection <- liftIO c
161− f $ test . hoist \m -> do
151+ f \g -> test $ rollingBack connection $ g connection
162− e <- run (Hasql.transaction Hasql.Serializable Hasql.Write (m <* condemn)) connection
152+
163− either throwIO pure e
153+ where
154+
155+ connect = either (error . show) return =<< acquire . TmpPostgres.toConnectionString =<< getTestDatabase
164
156
165
157
166data TestTable f = TestTable
158data TestTable f = TestTable
@@ -192,17 +184,18 @@ testSelectTestTable :: IO TmpPostgres.DB -> TestTree
192testSelectTestTable = databasePropertyTest "Can SELECT TestTable" \transaction -> do
184testSelectTestTable = databasePropertyTest "Can SELECT TestTable" \transaction -> do
193 rows <- forAll $ Gen.list (Range.linear 0 10) genTestTable
185 rows <- forAll $ Gen.list (Range.linear 0 10) genTestTable
194
186
195− transaction do
187+ transaction \connection -> do
196− selected <- lift do
188+ void do
189+ liftIO $ Rel8.insert connection
197− statement () $ Rel8.insert Rel8.Insert
190+ Rel8.Insert
198− { into = testTableSchema
191+ { into = testTableSchema
199− , rows = Rel8.values $ map Rel8.lit rows
192+ , rows = map Rel8.lit rows
200− , onConflict = Rel8.DoNothing
193+ , onConflict = Rel8.DoNothing
201− , returning = pure ()
194+ , returning = Rel8.NumberOfRowsAffected
202− }
195+ }
203
196
204− statement () $ Rel8.select do
197+ selected <- liftIO $ Rel8.select connection do
205− Rel8.each testTableSchema
198+ Rel8.each testTableSchema
206
199
207 sort selected === sort rows
200 sort selected === sort rows
208
201
@@ -219,12 +212,11 @@ testWhere_ = databasePropertyTest "WHERE (Rel8.where_)" \transaction -> do
219
212
220 let expected = filter (\t -> testTableColumn2 t == magicBool) rows
213 let expected = filter (\t -> testTableColumn2 t == magicBool) rows
221
214
222− transaction do
215+ transaction \connection -> do
223− selected <- lift do
224− statement () $ Rel8.select do
216+ selected <- liftIO $ Rel8.select connection do
225− t <- Rel8.values $ Rel8.lit <$> rows
217+ t <- Rel8.values $ Rel8.lit <$> rows
226− Rel8.where_ $ testTableColumn2 t Rel8.==. Rel8.lit magicBool
218+ Rel8.where_ $ testTableColumn2 t Rel8.==. Rel8.lit magicBool
227− return t
219+ return t
228
220
229 sort selected === sort expected
221 sort selected === sort expected
230
222
@@ -237,12 +229,11 @@ testFilter :: IO TmpPostgres.DB -> TestTree
237testFilter = databasePropertyTest "filter" \transaction -> do
229testFilter = databasePropertyTest "filter" \transaction -> do
238 rows <- forAll $ Gen.list (Range.linear 1 10) genTestTable
230 rows <- forAll $ Gen.list (Range.linear 1 10) genTestTable
239
231
240− transaction do
232+ transaction \connection -> do
241 let expected = filter testTableColumn2 rows
233 let expected = filter testTableColumn2 rows
242
234
243− selected <- lift do
235+ selected <- liftIO $ Rel8.select connection
244− statement () $ Rel8.select do
245− Rel8.filter testTableColumn2 =<< Rel8.values (Rel8.lit <$> rows)
236+ $ Rel8.filter testTableColumn2 =<< Rel8.values (Rel8.lit <$> rows)
246
237
247 sort selected === sort expected
238 sort selected === sort expected
248
239
@@ -257,10 +248,9 @@ testLimit = databasePropertyTest "LIMIT (Rel8.limit)" \transaction -> do
257
248
258 n <- forAll $ Gen.integral (Range.linear 0 10)
249 n <- forAll $ Gen.integral (Range.linear 0 10)
259
250
260− transaction do
251+ transaction \connection -> do
261− selected <- lift do
252+ selected <- liftIO $ Rel8.select connection do
262− statement () $ Rel8.select do
263− Rel8.limit n $ Rel8.values (Rel8.lit <$> rows)
253+ Rel8.limit n $ Rel8.values (Rel8.lit <$> rows)
264
254
265 diff (length selected) (<=) (fromIntegral n)
255 diff (length selected) (<=) (fromIntegral n)
266
256
@@ -278,10 +268,9 @@ testUnion = databasePropertyTest "UNION (Rel8.union)" \transaction -> evalM do
278 left <- forAll $ Gen.list (Range.linear 0 10) genTestTable
268 left <- forAll $ Gen.list (Range.linear 0 10) genTestTable
279 right <- forAll $ Gen.list (Range.linear 0 10) genTestTable
269 right <- forAll $ Gen.list (Range.linear 0 10) genTestTable
280
270
281− transaction do
271+ transaction \connection -> do
282− selected <- lift do
272+ selected <- liftIO $ Rel8.select connection do
283− statement () $ Rel8.select do
284− Rel8.values (Rel8.lit <$> nub left) `Rel8.union` Rel8.values (Rel8.lit <$> nub right)
273+ Rel8.values (Rel8.lit <$> nub left) `Rel8.union` Rel8.values (Rel8.lit <$> nub right)
285
274
286 sort selected === sort (nub (left ++ right))
275 sort selected === sort (nub (left ++ right))
287
276
@@ -290,11 +279,9 @@ testDistinct :: IO TmpPostgres.DB -> TestTree
290testDistinct = databasePropertyTest "DISTINCT (Rel8.distinct)" \transaction -> do
279testDistinct = databasePropertyTest "DISTINCT (Rel8.distinct)" \transaction -> do
291 rows <- forAll $ Gen.list (Range.linear 0 10) genTestTable
280 rows <- forAll $ Gen.list (Range.linear 0 10) genTestTable
292
281
293− transaction do
282+ transaction \connection -> do
294− selected <- lift do
295− statement () $ Rel8.select do
296− Rel8.distinct do
283+ selected <- liftIO $ Rel8.select connection $ Rel8.distinct do
297− Rel8.values (Rel8.lit <$> rows)
284+ Rel8.values (Rel8.lit <$> rows)
298
285
299 sort selected === nub (sort rows)
286 sort selected === nub (sort rows)
300
287
@@ -307,10 +294,8 @@ testExists :: IO TmpPostgres.DB -> TestTree
307testExists = databasePropertyTest "EXISTS (Rel8.exists)" \transaction -> do
294testExists = databasePropertyTest "EXISTS (Rel8.exists)" \transaction -> do
308 rows <- forAll $ Gen.list (Range.linear 0 10) genTestTable
295 rows <- forAll $ Gen.list (Range.linear 0 10) genTestTable
309
296
310− transaction do
297+ transaction \connection -> do
311− exists <- lift do
312− statement () $ Rel8.select do
313− Rel8.exists $ Rel8.values $ Rel8.lit <$> rows
298+ exists <- liftIO $ Rel8.select connection $ Rel8.exists $ Rel8.values $ Rel8.lit <$> rows
314
299
315 case rows of
300 case rows of
316 [] -> exists === [False]
301 [] -> exists === [False]
@@ -321,10 +306,9 @@ testOptional :: IO TmpPostgres.DB -> TestTree
321testOptional = databasePropertyTest "Rel8.optional" \transaction -> do
306testOptional = databasePropertyTest "Rel8.optional" \transaction -> do
322 rows <- forAll $ Gen.list (Range.linear 0 10) genTestTable
307 rows <- forAll $ Gen.list (Range.linear 0 10) genTestTable
323
308
324− transaction do
309+ transaction \connection -> do
325− selected <- lift do
310+ selected <- liftIO $ Rel8.select connection do
326− statement () $ Rel8.select do
327− Rel8.optional $ Rel8.values (Rel8.lit <$> rows)
311+ Rel8.optional $ Rel8.values (Rel8.lit <$> rows)
328
312
329 case rows of
313 case rows of
330 [] -> selected === [Nothing]
314 [] -> selected === [Nothing]
@@ -335,10 +319,9 @@ testAnd :: IO TmpPostgres.DB -> TestTree
335testAnd = databasePropertyTest "AND (&&.)" \transaction -> do
319testAnd = databasePropertyTest "AND (&&.)" \transaction -> do
336 (x, y) <- forAll $ liftA2 (,) Gen.bool Gen.bool
320 (x, y) <- forAll $ liftA2 (,) Gen.bool Gen.bool
337
321
338− transaction do
322+ transaction \connection -> do
339− [result] <- lift do
323+ [result] <- liftIO $ Rel8.select connection $ pure $
340− statement () $ Rel8.select do
341− pure $ Rel8.lit x Rel8.&&. Rel8.lit y
324+ Rel8.lit x Rel8.&&. Rel8.lit y
342
325
343 result === (x && y)
326 result === (x && y)
344
327
@@ -347,10 +330,9 @@ testOr :: IO TmpPostgres.DB -> TestTree
347testOr = databasePropertyTest "OR (||.)" \transaction -> do
330testOr = databasePropertyTest "OR (||.)" \transaction -> do
348 (x, y) <- forAll $ liftA2 (,) Gen.bool Gen.bool
331 (x, y) <- forAll $ liftA2 (,) Gen.bool Gen.bool
349
332
350− transaction do
333+ transaction \connection -> do
351− [result] <- lift do
352− statement () $ Rel8.select $ pure $
334+ [result] <- liftIO $ Rel8.select connection $ pure $
353− Rel8.lit x Rel8.||. Rel8.lit y
335+ Rel8.lit x Rel8.||. Rel8.lit y
354
336
355 result === (x || y)
337 result === (x || y)
356
338
@@ -359,10 +341,9 @@ testLogicalFixities :: IO TmpPostgres.DB -> TestTree
359testLogicalFixities = databasePropertyTest "Logical operator fixities" \transaction -> do
341testLogicalFixities = databasePropertyTest "Logical operator fixities" \transaction -> do
360 (u, v, w, x) <- forAll $ (,,,) <$> Gen.bool <*> Gen.bool <*> Gen.bool <*> Gen.bool
342 (u, v, w, x) <- forAll $ (,,,) <$> Gen.bool <*> Gen.bool <*> Gen.bool <*> Gen.bool
361
343
362− transaction do
344+ transaction \connection -> do
363− [result] <- lift do
345+ [result] <- liftIO $ Rel8.select connection $ pure $
364− statement () $ Rel8.select do
365− pure $ Rel8.lit u Rel8.||. Rel8.lit v Rel8.&&. Rel8.lit w Rel8.==. Rel8.lit x
346+ Rel8.lit u Rel8.||. Rel8.lit v Rel8.&&. Rel8.lit w Rel8.==. Rel8.lit x
366
347
367 result === (u || v && w == x)
348 result === (u || v && w == x)
368
349
@@ -371,10 +352,9 @@ testNot :: IO TmpPostgres.DB -> TestTree
371testNot = databasePropertyTest "NOT (not_)" \transaction -> do
352testNot = databasePropertyTest "NOT (not_)" \transaction -> do
372 x <- forAll Gen.bool
353 x <- forAll Gen.bool
373
354
374− transaction do
355+ transaction \connection -> do
375− [result] <- lift do
356+ [result] <- liftIO $ Rel8.select connection $ pure $
376− statement () $ Rel8.select do
377− pure $ Rel8.not_ $ Rel8.lit x
357+ Rel8.not_ $ Rel8.lit x
378
358
379 result === not x
359 result === not x
380
360
@@ -383,10 +363,9 @@ testBool :: IO TmpPostgres.DB -> TestTree
383testBool = databasePropertyTest "ifThenElse_" \transaction -> do
363testBool = databasePropertyTest "ifThenElse_" \transaction -> do
384 (x, y, z) <- forAll $ liftA3 (,,) Gen.bool Gen.bool Gen.bool
364 (x, y, z) <- forAll $ liftA3 (,,) Gen.bool Gen.bool Gen.bool
385
365
386− transaction do
366+ transaction \connection -> do
387− [result] <- lift do
367+ [result] <- liftIO $ Rel8.select connection $ pure $
388− statement () $ Rel8.select do
389− pure $ Rel8.bool (Rel8.lit z) (Rel8.lit y) (Rel8.lit x)
368+ Rel8.bool (Rel8.lit z) (Rel8.lit y) (Rel8.lit x)
390
369
391 result === if x then y else z
370 result === if x then y else z
392
371
@@ -398,10 +377,9 @@ testAp = databasePropertyTest "Cartesian product (<*>)" \transaction -> do
398 (Gen.list (Range.linear 1 10) genTestTable)
377 (Gen.list (Range.linear 1 10) genTestTable)
399 (Gen.list (Range.linear 1 10) genTestTable)
378 (Gen.list (Range.linear 1 10) genTestTable)
400
379
401− transaction do
380+ transaction \connection -> do
402− result <- lift do
381+ result <- liftIO $ Rel8.select connection $ do
403− statement () $ Rel8.select do
404− liftA2 (,) (Rel8.values (Rel8.lit <$> rows1)) (Rel8.values (Rel8.lit <$> rows2))
382+ liftA2 (,) (Rel8.values (Rel8.lit <$> rows1)) (Rel8.values (Rel8.lit <$> rows2))
405
383
406 sort result === sort (liftA2 (,) rows1 rows2)
384 sort result === sort (liftA2 (,) rows1 rows2)
407
385
@@ -430,22 +408,21 @@ testDBType getTestDatabase = testGroup "DBType instances"
430 where
408 where
431 dbTypeTest :: (Eq a, Show a, Rel8.DBType a) => TestName -> Gen a -> TestTree
409 dbTypeTest :: (Eq a, Show a, Rel8.DBType a) => TestName -> Gen a -> TestTree
432 dbTypeTest name generator = testGroup name
410 dbTypeTest name generator = testGroup name
433− [ databasePropertyTest name (t generator) getTestDatabase
411+ [ databasePropertyTest name (t (==) generator) getTestDatabase
434− , databasePropertyTest ("Maybe " <> name) (t (Gen.maybe generator)) getTestDatabase
412+ , databasePropertyTest ("Maybe " <> name) (t (==) (Gen.maybe generator)) getTestDatabase
435 ]
413 ]
436
414
437− t :: forall a b. (Eq a, Show a, Rel8.Sql Rel8.DBType a)
415+ t :: forall a b. (Show a, Rel8.Sql Rel8.DBType a)
416+ => (a -> a -> Bool)
438− => Gen a
417+ -> Gen a
439− -> (TestT Transaction () -> PropertyT IO b)
418+ -> ((Connection -> TestT IO ()) -> PropertyT IO b)
440 -> PropertyT IO b
419 -> PropertyT IO b
441− t generator transaction = do
420+ t eq generator transaction = do
442 x <- forAll generator
421 x <- forAll generator
443
422
444− transaction do
423+ transaction \connection -> do
445− [res] <- lift do
446− statement () $ Rel8.select do
447− pure (Rel8.litExpr x)
424+ [res] <- liftIO $ Rel8.select connection $ pure (Rel8.litExpr x)
448− diff res (==) x
425+ diff res eq x
449
426
450 genDay :: Gen Day
427 genDay :: Gen Day
451 genDay = do
428 genDay = do
@@ -487,15 +464,13 @@ testDBEq getTestDatabase = testGroup "DBEq instances"
487
464
488 t :: forall a. (Eq a, Show a, Rel8.Sql Rel8.DBEq a)
465 t :: forall a. (Eq a, Show a, Rel8.Sql Rel8.DBEq a)
489 => Gen a
466 => Gen a
490− -> (TestT Transaction () -> PropertyT IO ())
467+ -> ((Connection -> TestT IO ()) -> PropertyT IO ())
491 -> PropertyT IO ()
468 -> PropertyT IO ()
492 t generator transaction = do
469 t generator transaction = do
493 (x, y) <- forAll (liftA2 (,) generator generator)
470 (x, y) <- forAll (liftA2 (,) generator generator)
494
471
495− transaction do
472+ transaction \connection -> do
496− [res] <- lift do
497− statement () $ Rel8.select do
498− pure $ Rel8.litExpr x Rel8.==. Rel8.litExpr y
473+ [res] <- liftIO $ Rel8.select connection $ pure $ Rel8.litExpr x Rel8.==. Rel8.litExpr y
499 res === (x == y)
474 res === (x == y)
500
475
501
476
@@ -503,10 +478,9 @@ testTableEquality :: IO TmpPostgres.DB -> TestTree
503testTableEquality = databasePropertyTest "TestTable equality" \transaction -> do
478testTableEquality = databasePropertyTest "TestTable equality" \transaction -> do
504 (x, y) <- forAll $ liftA2 (,) genTestTable genTestTable
479 (x, y) <- forAll $ liftA2 (,) genTestTable genTestTable
505
480
506− transaction do
481+ transaction \connection -> do
507− [eq] <- lift do
482+ [eq] <- liftIO $ Rel8.select connection do
508− statement () $ Rel8.select do
509− pure $ Rel8.lit x Rel8.==: Rel8.lit y
483+ pure $ Rel8.lit x Rel8.==: Rel8.lit y
510
484
511 eq === (x == y)
485 eq === (x == y)
512
486
@@ -515,10 +489,8 @@ testFromString :: IO TmpPostgres.DB -> TestTree
515testFromString = databasePropertyTest "FromString" \transaction -> do
489testFromString = databasePropertyTest "FromString" \transaction -> do
516 str <- forAll $ Gen.list (Range.linear 0 10) Gen.unicode
490 str <- forAll $ Gen.list (Range.linear 0 10) Gen.unicode
517
491
518− transaction do
492+ transaction \connection -> do
519− [result] <- lift do
520− statement () $ Rel8.select do
521− pure $ fromString str
493+ [result] <- liftIO $ Rel8.select connection $ pure $ fromString str
522 result === pack str
494 result === pack str
523
495
524
496
@@ -526,11 +498,10 @@ testCatMaybeTable :: IO TmpPostgres.DB -> TestTree
526testCatMaybeTable = databasePropertyTest "catMaybeTable" \transaction -> do
498testCatMaybeTable = databasePropertyTest "catMaybeTable" \transaction -> do
527 rows <- forAll $ Gen.list (Range.linear 0 10) genTestTable
499 rows <- forAll $ Gen.list (Range.linear 0 10) genTestTable
528
500
529− transaction do
501+ transaction \connection -> do
530− selected <- lift do
531− statement () $ Rel8.select do
502+ selected <- liftIO $ Rel8.select connection do
532− testTable <- Rel8.values $ Rel8.lit <$> rows
503+ testTable <- Rel8.values $ Rel8.lit <$> rows
533− Rel8.catMaybeTable $ Rel8.bool Rel8.nothingTable (pure testTable) (testTableColumn2 testTable)
504+ Rel8.catMaybeTable $ Rel8.bool Rel8.nothingTable (pure testTable) (testTableColumn2 testTable)
534
505
535 sort selected === sort (filter testTableColumn2 rows)
506 sort selected === sort (filter testTableColumn2 rows)
536
507
@@ -539,10 +510,9 @@ testCatMaybe :: IO TmpPostgres.DB -> TestTree
539testCatMaybe = databasePropertyTest "catMaybe" \transaction -> evalM do
510testCatMaybe = databasePropertyTest "catMaybe" \transaction -> evalM do
540 rows <- forAll $ Gen.list (Range.linear 0 10) $ Gen.maybe Gen.bool
511 rows <- forAll $ Gen.list (Range.linear 0 10) $ Gen.maybe Gen.bool
541
512
542− transaction do
513+ transaction \connection -> do
543− selected <- lift do
514+ selected <- evalM $ liftIO $ Rel8.select connection do
544− statement () $ Rel8.select do
545− Rel8.catNull =<< Rel8.values (map Rel8.lit rows)
515+ Rel8.catNull =<< Rel8.values (map Rel8.lit rows)
546
516
547 sort selected === sort (catMaybes rows)
517 sort selected === sort (catMaybes rows)
548
518
@@ -551,38 +521,15 @@ testMaybeTable :: IO TmpPostgres.DB -> TestTree
551testMaybeTable = databasePropertyTest "maybeTable" \transaction -> evalM do
521testMaybeTable = databasePropertyTest "maybeTable" \transaction -> evalM do
552 (rows, def) <- forAll $ liftA2 (,) (Gen.list (Range.linear 0 10) genTestTable) genTestTable
522 (rows, def) <- forAll $ liftA2 (,) (Gen.list (Range.linear 0 10) genTestTable) genTestTable
553
523
554− transaction do
524+ transaction \connection -> do
555− selected <- lift do
525+ selected <- liftIO $ Rel8.select connection $
556− statement () $ Rel8.select do
557− Rel8.maybeTable (Rel8.lit def) id <$> Rel8.optional (Rel8.values (Rel8.lit <$> rows))
526+ Rel8.maybeTable (Rel8.lit def) id <$> Rel8.optional (Rel8.values (Rel8.lit <$> rows))
558
527
559 case rows of
528 case rows of
560 [] -> selected === [def]
529 [] -> selected === [def]
561 _ -> sort selected === sort rows
530 _ -> sort selected === sort rows
562
531
563
532
564−testAggregateMaybeTable :: IO TmpPostgres.DB -> TestTree
565−testAggregateMaybeTable = databasePropertyTest "aggregateMaybeTable" \transaction -> evalM do
566− rows <- forAll $ Gen.list (Range.linear 0 10) (Gen.maybe (Gen.int64 (Range.linear 0 10)))
567−
568− let
569− aggregate = go 0 False False
570− where
571− go !n nothing _ (Just a : as) = go (n + a) nothing True as
572− go n _ just (Nothing : as) = go n True just as
573− go _ False False [] = []
574− go _ True False [] = [Nothing]
575− go n False True [] = [Just n]
576− go n True True [] = [Nothing, Just n]
577−
578− transaction do
579− selected <- lift do
580− statement () $ Rel8.select do
581− Rel8.aggregate $ Rel8.aggregateMaybeTable Rel8.sum <$> Rel8.values (Rel8.lit <$> rows)
582−
583− sort selected === aggregate rows
584−
585−
586data TwoTestTables f =
533data TwoTestTables f =
587 TwoTestTables
534 TwoTestTables
588 { testTable1 :: TestTable f
535 { testTable1 :: TestTable f
@@ -603,10 +550,9 @@ testNestedTables = databasePropertyTest "Nested TestTables" \transaction -> eval
603 Gen.list (Range.linear 0 10) $
550 Gen.list (Range.linear 0 10) $
604 liftA2 TwoTestTables genTestTable genTestTable
551 liftA2 TwoTestTables genTestTable genTestTable
605
552
606− transaction do
553+ transaction \connection -> do
607− selected <- lift do
554+ selected <- liftIO $ Rel8.select connection do
608− statement () $ Rel8.select do
609− Rel8.values (Rel8.lit <$> rows)
555+ Rel8.values (Rel8.lit <$> rows)
610
556
611 sort selected === sort rows
557 sort selected === sort rows
612
558
@@ -616,12 +562,11 @@ testMaybeTableApplicative = databasePropertyTest "MaybeTable (<*>)" \transaction
616 rows1 <- genRows
562 rows1 <- genRows
617 rows2 <- genRows
563 rows2 <- genRows
618
564
619− transaction do
565+ transaction \connection -> do
620− selected <- lift do
621− statement () $ Rel8.select do
566+ selected <- liftIO $ Rel8.select connection do
622− as <- Rel8.optional (Rel8.values (Rel8.lit <$> rows1))
567+ as <- Rel8.optional (Rel8.values (Rel8.lit <$> rows1))
623− bs <- Rel8.optional (Rel8.values (Rel8.lit <$> rows2))
568+ bs <- Rel8.optional (Rel8.values (Rel8.lit <$> rows2))
624− pure $ liftA2 (,) as bs
569+ pure $ liftA2 (,) as bs
625
570
626 case (rows1, rows2) of
571 case (rows1, rows2) of
627 ([], []) -> selected === [Nothing]
572 ([], []) -> selected === [Nothing]
@@ -633,6 +578,14 @@ testMaybeTableApplicative = databasePropertyTest "MaybeTable (<*>)" \transaction
633 genRows = forAll do
578 genRows = forAll do
634 Gen.list (Range.linear 0 10) $ liftA2 TestTable (Gen.text (Range.linear 0 10) Gen.unicode) (pure True)
579 Gen.list (Range.linear 0 10) $ liftA2 TestTable (Gen.text (Range.linear 0 10) Gen.unicode) (pure True)
635
580
581+rollingBack
582+ :: (MonadBaseControl IO m, MonadIO m)
583+ => Connection -> m a -> m a
584+rollingBack connection =
585+ bracket_
586+ (liftIO (run (sql "BEGIN") connection))
587+ (liftIO (run (sql "ROLLBACK") connection))
588+
636
589
637genTestTable :: Gen (TestTable Result)
590genTestTable :: Gen (TestTable Result)
638genTestTable = do
591genTestTable = do
@@ -645,19 +598,19 @@ testUpdate :: IO TmpPostgres.DB -> TestTree
645testUpdate = databasePropertyTest "Can UPDATE TestTable" \transaction -> do
598testUpdate = databasePropertyTest "Can UPDATE TestTable" \transaction -> do
646 rows <- forAll $ Gen.map (Range.linear 0 5) $ liftA2 (,) genTestTable genTestTable
599 rows <- forAll $ Gen.map (Range.linear 0 5) $ liftA2 (,) genTestTable genTestTable
647
600
648− transaction do
601+ transaction \connection -> do
649− selected <- lift do
602+ void $ liftIO $ Rel8.insert connection
650− statement () $ Rel8.insert Rel8.Insert
603+ Rel8.Insert
651 { into = testTableSchema
604 { into = testTableSchema
652− , rows = Rel8.values $ map Rel8.lit $ Map.keys rows
605+ , rows = map Rel8.lit $ Map.keys rows
653 , onConflict = Rel8.DoNothing
606 , onConflict = Rel8.DoNothing
654− , returning = pure ()
607+ , returning = Rel8.NumberOfRowsAffected
655 }
608 }
656
609
610+ void $ liftIO $ Rel8.update connection
657− statement () $ Rel8.update Rel8.Update
611+ Rel8.Update
658 { target = testTableSchema
612 { target = testTableSchema
659− , from = pure ()
660− , set = \_ r ->
613+ , set = \r ->
661 let updates = map (bimap Rel8.lit Rel8.lit) $ Map.toList rows
614 let updates = map (bimap Rel8.lit Rel8.lit) $ Map.toList rows
662 in
615 in
663 foldl
616 foldl
@@ -671,12 +624,12 @@ testUpdate = databasePropertyTest "Can UPDATE TestTable" \transaction -> do
671 )
624 )
672 r
625 r
673 updates
626 updates
674− , updateWhere = \_ _ -> Rel8.lit True
627+ , updateWhere = \_ -> Rel8.lit True
675− , returning = pure ()
628+ , returning = Rel8.NumberOfRowsAffected
676 }
629 }
677
630
678− statement () $ Rel8.select do
631+ selected <- liftIO $ Rel8.select connection do
679− Rel8.each testTableSchema
632+ Rel8.each testTableSchema
680
633
681 sort selected === sort (Map.elems rows)
634 sort selected === sort (Map.elems rows)
682
635
@@ -689,96 +642,29 @@ testDelete :: IO TmpPostgres.DB -> TestTree
689testDelete = databasePropertyTest "Can DELETE TestTable" \transaction -> do
642testDelete = databasePropertyTest "Can DELETE TestTable" \transaction -> do
690 rows <- forAll $ Gen.list (Range.linear 0 5) genTestTable
643 rows <- forAll $ Gen.list (Range.linear 0 5) genTestTable
691
644
692− transaction do
645+ transaction \connection -> do
693− (deleted, selected) <- lift do
646+ void $ liftIO $ Rel8.insert connection
694− statement () $ Rel8.insert Rel8.Insert
647+ Rel8.Insert
695 { into = testTableSchema
648 { into = testTableSchema
696− , rows = Rel8.values $ map Rel8.lit rows
649+ , rows = map Rel8.lit rows
697 , onConflict = Rel8.DoNothing
650 , onConflict = Rel8.DoNothing
698− , returning = pure ()
651+ , returning = Rel8.NumberOfRowsAffected
699 }
652 }
700
653
654+ deleted <-
655+ liftIO $ Rel8.delete connection
701− deleted <- statement () $ Rel8.delete Rel8.Delete
656+ Rel8.Delete
702 { from = testTableSchema
657 { from = testTableSchema
703− , using = pure ()
704− , deleteWhere = const testTableColumn2
658+ , deleteWhere = testTableColumn2
705 , returning = Rel8.Projection id
659 , returning = Rel8.Projection id
706 }
660 }
707
661
708− selected <- statement () $ Rel8.select do
662+ selected <- liftIO $ Rel8.select connection do
709− Rel8.each testTableSchema
663+ Rel8.each testTableSchema
710−
711− pure (deleted, selected)
712
664
713 sort (deleted <> selected) === sort rows
665 sort (deleted <> selected) === sort rows
714
666
715
667
716−data UniqueTable f = UniqueTable
717− { uniqueTableKey :: Rel8.Column f Text
718− , uniqueTableValue :: Rel8.Column f Text
719− }
720− deriving stock Generic
721− deriving anyclass Rel8.Rel8able
722−
723−
724−deriving stock instance Eq (UniqueTable Result)
725−deriving stock instance Ord (UniqueTable Result)
726−deriving stock instance Show (UniqueTable Result)
727−
728−
729−uniqueTableSchema :: Rel8.TableSchema (UniqueTable Rel8.Name)
730−uniqueTableSchema =
731− Rel8.TableSchema
732− { name = "unique_table"
733− , schema = Nothing
734− , columns = UniqueTable
735− { uniqueTableKey = "key"
736− , uniqueTableValue = "value"
737− }
738− }
739−
740−
741−genUniqueTable :: Gen (UniqueTable Result)
742−genUniqueTable = do
743− uniqueTableKey <- Gen.text (Range.linear 0 5) Gen.alphaNum
744− uniqueTableValue <- Gen.text (Range.linear 0 5) Gen.alphaNum
745− pure UniqueTable {..}
746−
747−
748−testUpsert :: IO TmpPostgres.DB -> TestTree
749−testUpsert = databasePropertyTest "Can UPSERT UniqueTable" \transaction -> do
750− as <- unique $ forAll $ Gen.list (Range.linear 0 20) genUniqueTable
751− bs <- unique $ forAll $ Gen.list (Range.linear 0 20) genUniqueTable
752−
753− transaction do
754− selected <- lift do
755− statement () $ Rel8.insert Rel8.Insert
756− { into = uniqueTableSchema
757− , rows = Rel8.values $ Rel8.lit <$> as
758− , onConflict = Rel8.DoNothing
759− , returning = pure ()
760− }
761−
762− statement () $ Rel8.insert Rel8.Insert
763− { into = uniqueTableSchema
764− , rows = Rel8.values $ Rel8.lit <$> bs
765− , onConflict = Rel8.DoUpdate Rel8.Upsert
766− { index = uniqueTableKey
767− , set = \UniqueTable {uniqueTableValue} old -> old {uniqueTableValue}
768− , updateWhere = \_ _ -> Rel8.true
769− }
770− , returning = pure ()
771− }
772−
773− statement () $ Rel8.select do
774− Rel8.each uniqueTableSchema
775−
776− fromUniqueTables selected === fromUniqueTables bs <> fromUniqueTables as
777− where
778− unique = fmap (nubOrdOn uniqueTableKey)
779− fromUniqueTables = Map.fromList . map \(UniqueTable key value) -> (key, value)
780−
781−
782newtype HKNestedPair f = HKNestedPair { pairOne :: (TestTable f, TestTable f) }
668newtype HKNestedPair f = HKNestedPair { pairOne :: (TestTable f, TestTable f) }
783 deriving stock Generic
669 deriving stock Generic
784 deriving anyclass Rel8.Rel8able
670 deriving anyclass Rel8.Rel8able
@@ -792,10 +678,9 @@ testSelectNestedPairs :: IO TmpPostgres.DB -> TestTree
792testSelectNestedPairs = databasePropertyTest "Can SELECT nested pairs" \transaction -> do
678testSelectNestedPairs = databasePropertyTest "Can SELECT nested pairs" \transaction -> do
793 rows <- forAll $ Gen.list (Range.linear 0 10) $ HKNestedPair <$> liftA2 (,) genTestTable genTestTable
679 rows <- forAll $ Gen.list (Range.linear 0 10) $ HKNestedPair <$> liftA2 (,) genTestTable genTestTable
794
680
795− transaction do
681+ transaction \connection -> do
796− selected <- lift do
682+ selected <- liftIO $ Rel8.select connection do
797− statement () $ Rel8.select do
798− Rel8.values $ map Rel8.lit rows
683+ Rel8.values $ map Rel8.lit rows
799
684
800 sort selected === sort rows
685 sort selected === sort rows
801
686
@@ -804,20 +689,18 @@ testSelectArray :: IO TmpPostgres.DB -> TestTree
804testSelectArray = databasePropertyTest "Can SELECT Arrays (with aggregation)" \transaction -> do
689testSelectArray = databasePropertyTest "Can SELECT Arrays (with aggregation)" \transaction -> do
805 rows <- forAll $ Gen.list (Range.linear 1 10) Gen.bool
690 rows <- forAll $ Gen.list (Range.linear 1 10) Gen.bool
806
691
807− transaction do
692+ transaction \connection -> do
808− selected <- lift do
693+ selected <- liftIO $ Rel8.select connection do
809− statement () $ Rel8.select do
810− Rel8.many $ Rel8.values (map Rel8.lit rows)
694+ Rel8.many $ Rel8.values (map Rel8.lit rows)
811
695
812 selected === [foldMap pure rows]
696 selected === [foldMap pure rows]
813
697
814− selected' <- lift do
815− statement () $ Rel8.select do
698+ selected' <- liftIO $ Rel8.select connection $ do
816− a <- Rel8.catListTable =<< do
699+ a <- Rel8.catListTable =<< do
817− Rel8.many $ Rel8.values (map Rel8.lit rows)
700+ Rel8.many $ Rel8.values (map Rel8.lit rows)
818− b <- Rel8.catListTable =<< do
701+ b <- Rel8.catListTable =<< do
819− Rel8.many $ Rel8.values (map Rel8.lit rows)
702+ Rel8.many $ Rel8.values (map Rel8.lit rows)
820− pure (a, b)
703+ pure (a, b)
821
704
822 selected' === liftA2 (,) rows rows
705 selected' === liftA2 (,) rows rows
823
706
@@ -839,11 +722,10 @@ testNestedMaybeTable :: IO TmpPostgres.DB -> TestTree
839testNestedMaybeTable = databasePropertyTest "Can nest MaybeTable within other tables" \transaction -> do
722testNestedMaybeTable = databasePropertyTest "Can nest MaybeTable within other tables" \transaction -> do
840 let example = NestedMaybeTable { nmt1 = True, nmt2 = Just (TestTable "Hi" True) }
723 let example = NestedMaybeTable { nmt1 = True, nmt2 = Just (TestTable "Hi" True) }
841
724
842− transaction do
725+ transaction \connection -> do
843− selected <- lift do
844− statement () $ Rel8.select do
726+ selected <- liftIO $ Rel8.select connection do
845− x <- Rel8.values [Rel8.lit example]
727+ x <- Rel8.values [Rel8.lit example]
846− pure $ Rel8.maybeTable (Rel8.lit False) (\_ -> Rel8.lit True) (nmt2 x)
728+ pure $ Rel8.maybeTable (Rel8.lit False) (\_ -> Rel8.lit True) (nmt2 x)
847
729
848 selected === [True]
730 selected === [True]
849
731
@@ -851,12 +733,11 @@ testNestedMaybeTable = databasePropertyTest "Can nest MaybeTable within other ta
851testEvaluate :: IO TmpPostgres.DB -> TestTree
733testEvaluate :: IO TmpPostgres.DB -> TestTree
852testEvaluate = databasePropertyTest "evaluate has the evaluation order we expect" \transaction -> do
734testEvaluate = databasePropertyTest "evaluate has the evaluation order we expect" \transaction -> do
853
735
854− transaction do
736+ transaction \connection -> do
855− selected <- lift do
856− statement () $ Rel8.select do
737+ selected <- liftIO $ Rel8.select connection do
857− x <- Rel8.values (Rel8.lit <$> ['a', 'b', 'c'])
738+ x <- Rel8.values (Rel8.lit <$> ['a', 'b', 'c'])
858− y <- Rel8.evaluate (Rel8.nextval "test_seq")
739+ y <- Rel8.evaluate (Rel8.nextval "test_seq")
859− pure (x, (y, y))
740+ pure (x, (y, y))
860
741
861 normalize selected ===
742 normalize selected ===
862 [ ('a', (0, 0))
743 [ ('a', (0, 0))
@@ -864,12 +745,11 @@ testEvaluate = databasePropertyTest "evaluate has the evaluation order we expect
864 , ('c', (2, 2))
745 , ('c', (2, 2))
865 ]
746 ]
866
747
867− selected' <- lift do
868− statement () $ Rel8.select do
748+ selected' <- liftIO $ Rel8.select connection do
869− x <- Rel8.values (Rel8.lit <$> ['a', 'b', 'c'])
749+ x <- Rel8.values (Rel8.lit <$> ['a', 'b', 'c'])
870− y <- Rel8.values (Rel8.lit <$> ['d', 'e', 'f'])
750+ y <- Rel8.values (Rel8.lit <$> ['d', 'e', 'f'])
871− z <- Rel8.evaluate (Rel8.nextval "test_seq")
751+ z <- Rel8.evaluate (Rel8.nextval "test_seq")
872− pure ((x, y), (z, z))
752+ pure ((x, y), (z, z))
873
753
874 normalize selected' ===
754 normalize selected' ===
875 [ (('a', 'd'), (0, 0))
755 [ (('a', 'd'), (0, 0))
@@ -887,3 +767,13 @@ testEvaluate = databasePropertyTest "evaluate has the evaluation order we expect
887 normalize :: [(x, (Int64, Int64))] -> [(x, (Int64, Int64))]
767 normalize :: [(x, (Int64, Int64))] -> [(x, (Int64, Int64))]
888 normalize [] = []
768 normalize [] = []
889 normalize xs@((_, (i, _)) : _) = map (fmap (\(a, b) -> (a - i, b - i))) xs
769 normalize xs@((_, (i, _)) : _) = map (fmap (\(a, b) -> (a - i, b - i))) xs
770+
771+{-
772+ selected <- liftIO $ Rel8.select connection do
773+ x <- Rel8.values (Rel8.lit <$> ['a', 'b', 'c'])
774+ x <- Rel8.values (Rel8.lit <$> ['d', 'e', 'f'])
775+ y <- Rel8.evaluate (Rel8.nextval "test_seq")
776+ pure (x, y, y)
777+
778+ selected === [('a', 1, 1), ('b', 2, 2), ('c', 3, 3)]
779+-}
tests/Rel8/Generic/Rel8able/Test.hs+1−44
@@ -5,9 +5,7 @@
5{-# language DuplicateRecordFields #-}
5{-# language DuplicateRecordFields #-}
6{-# language FlexibleInstances #-}
6{-# language FlexibleInstances #-}
7{-# language MultiParamTypeClasses #-}
7{-# language MultiParamTypeClasses #-}
8−{-# language StandaloneKindSignatures #-}
9{-# language TypeFamilies #-}
8{-# language TypeFamilies #-}
10−{-# language UndecidableInstances #-}
11
9
12{-# options_ghc -O0 #-}
10{-# options_ghc -O0 #-}
13
11
@@ -138,51 +136,10 @@ data TableSum f
138 deriving stock Generic
136 deriving stock Generic
139
137
140
138
141−data BarbieSum f
142− = BarbieSumA (f Bool) (f Text)
143− | BarbieSumB
144− | BarbieSumC (f Text)
145− deriving stock Generic
146−
147−
148data TableProduct f = TableProduct
139data TableProduct f = TableProduct
149− { sum :: HADT f BarbieSum
140+ { sum :: HADT f TableSum
150 , list :: TableList f
141 , list :: TableList f
151 , foos :: HList f (HADT f TableSum, Lift f HKDSum, HKDTest f)
142 , foos :: HList f (HADT f TableSum, Lift f HKDSum, HKDTest f)
152 }
143 }
153 deriving stock Generic
144 deriving stock Generic
154 deriving anyclass Rel8able
145 deriving anyclass Rel8able
155−
156−
157−data TableTestB f = TableTestB
158− { foo :: f Bool
159− , bar :: f (Maybe Bool)
160− }
161− deriving stock Generic
162− deriving anyclass Rel8able
163−
164−
165−data NestedTableTestB f = NestedTableTestB
166− { foo :: f Bool
167− , bar :: f (Maybe Bool)
168− , baz :: Column f Char
169− , nest :: TableTestB f
170− }
171− deriving stock Generic
172− deriving anyclass Rel8able
173−
174−
175−newtype IdRecord a f = IdRecord { recordId :: Column f a }
176− deriving stock Generic
177−
178−
179−instance DBType a => Rel8able (IdRecord a)
180−
181−
182−type Nest :: KRel8able -> KRel8able -> KRel8able
183−data Nest t u f = Nest
184− { foo :: t f
185− , bar :: u f
186− }
187− deriving stock Generic
188− deriving anyclass Rel8able