on 07a0807 help sign in
.appveyor.ymldeleted−39
since splitsnapshots
unifiedsplit
@@ -1,39 +0,0 @@
1−build: off
2−
3−version: 1.0.{build}-{branch}
4−
5−image: Visual Studio 2017
6−
7−before_test:
8−# http://help.appveyor.com/discussions/problems/6312-curl-command-not-found
9−- set PATH=C:\Program Files\Git\mingw64\bin;%PATH%
10−
11−- curl -sS -ostack.zip -L --insecure http://www.stackage.org/stack/windows-x86_64
12−- 7z x stack.zip stack.exe
13−
14−clone_folder: "c:\\project-m36"
15−clone_depth: 2
16−environment:
17− global:
18− STACK_ROOT: "c:\\sr"
19− matrix:
20− - YAML: "stack.ghc8.6.yaml"
21−
22−platform:
23− - x64
24−
25−cache:
26− - "c:\\sr"
27− - "%LocalAppData%\\Programs\\stack"
28−# - ".stack-work" # send us over the 1 GB limit
29−
30−test_script:
31− - stack setup > nul
32−# The ugly echo "" hack is to avoid complaints about 0 being an invalid file
33−# descriptor
34− - echo "" | stack --stack-yaml %YAML% --no-terminal test
35−# - 7z.exe a -t7z -m0=lzma -mx=9 -mfb=64 -md=32m -ms=on project-m36.7z .stack-work\install\*\bin\project-m36-server.exe .stack-work\install\*\bin\project-m36-websocket-server.exe .stack-work\install\*\bin\tutd.exe .stack-work\install\*\bin\project-m36-server.exe
36−
37−#artifacts:
38−# - path: project-m36.7z
39−# name: project-m36.7z
.github/workflows/ci.yamldeleted−69
@@ -1,69 +0,0 @@
1−name: "CI"
2−on:
3− pull_request:
4− push:
5−jobs:
6− dockerimage:
7− runs-on: ubuntu-latest
8− steps:
9− - uses: actions/checkout@v2.3.1
10− - uses: cachix/install-nix-action@v12
11− with:
12− nix_path: nixpkgs=channel:nixos-unstable
13− - uses: cachix/cachix-action@v8
14− with:
15− name: project-m36
16− signingKey: "${{ secrets.CACHIX_SIGNING_KEY }}"
17− - run: cachix use iohk
18− - name: docker load
19− run: docker load < $(nix-build docker.nix)
20− - name: docker login
21− if: ${{ github.ref == 'refs/heads/master' }}
22− run: echo ${{secrets.DOCKERHUB_PASSWORD}} | docker login --username ${{secrets.DOCKERHUB_USER}} --password-stdin
23− - name: docker tag with version
24− run: docker tag project-m36:latest projectm36/project-m36:$(awk '/^Version:/ {print $2}' project-m36.cabal)
25− if: ${{ github.ref == 'refs/heads/master' }}
26− - name: docker tag latest
27− run: docker tag project-m36:latest projectm36/project-m36:latest
28− if: ${{ github.ref == 'refs/heads/master' }}
29− - run: docker push projectm36/project-m36
30− if: ${{ github.ref == 'refs/heads/master' }}
31−
32− stack-build:
33− runs-on: ${{ matrix.os }}
34− strategy:
35− matrix:
36− os: [ubuntu-latest]
37− ghc:
38− - ghc8.10
39− - ghc8.8
40− - ghc8.6
41− include:
42− - os: macos-latest
43− ghc: ghc8.10
44− env:
45− STACK_YAML: stack.${{ matrix.ghc }}.yaml
46− steps:
47− - uses: actions/checkout@v2
48− - name: Cache
49− uses: actions/cache@v1
50− with:
51− path: ~/.stack
52− key: ${{ runner.os }}-build-stack-${{ matrix.ghc }}-${{ hashFiles(env.STACK_YAML) }}-${{ hashFiles('**/*.cabal') }}
53− restore-keys: |
54− ${{ runner.os }}-build-stack-${{ matrix.ghc }}-${{ hashFiles(env.STACK_YAML) }}
55− ${{ runner.os }}-build-stack-${{ matrix.ghc }}
56− - name: Fix macOS cache bug
57− run: rm -rf ~/.stack/setup-exe-cache
58− - name: Build
59− run: stack build --ghc-options -O2 --local-bin-path out --copy-bins
60− - name: Test
61− run: stack test --stack-yaml=${{ env.STACK_YAML }}
62− - name: HLint
63− run: curl -sSL https://raw.github.com/ndmitchell/hlint/master/misc/run.sh | sh -s .
64− - name: Haddock
65− run: stack --no-install-ghc --system-ghc --no-haddock-deps haddock
66− - uses: actions/upload-artifact@v2
67− with:
68− name: project-m36-${{ matrix.os }}-${{ matrix.ghc }}
69− path: out/
.gitignore+1−3
@@ -18,6 +18,4 @@ persistence-notes
18jupyter/itutd.egg-info
18jupyter/itutd.egg-info
19jupyter/build
19jupyter/build
20juyter/dist
20juyter/dist
21−.ipynb_checkpoints
21+.ipynb_checkpoints
22−project-m36.nix
23−stack.yaml
.travis.ymlnew file+58
@@ -0,0 +1,58 @@
1+# For more information, see https://github.com/hvr/multi-ghc-travis
2+language: c
3+sudo: false
4+
5+git:
6+ submodules: false # whether to recursively clone submodules
7+
8+cache:
9+ directories:
10+ - $HOME/.cabal/packages
11+ - $HOME/.cabal/store
12+
13+before_cache:
14+ - rm -fv $HOME/.cabal/packages/hackage.haskell.org/build-reports.log
15+ # remove files that are regenerated by 'cabal update'
16+ - rm -fv $HOME/.cabal/packages/hackage.haskell.org/00-index.*
17+ - rm -fv $HOME/.cabal/packages/hackage.haskell.org/*.json
18+ - rm -fv $HOME/.cabal/packages/hackage.haskell.org/01-index.cache
19+ - rm -fv $HOME/.cabal/packages/hackage.haskell.org/01-index.tar
20+ - rm -fv $HOME/.cabal/packages/hackage.haskell.org/01-index.tar.idx
21+
22+matrix:
23+ include:
24+ #- compiler: "ghc-7.8.4"
25+ # env: TEST=--disable-tests BENCH=--disable-benchmarks
26+ # addons: {apt: {packages: [ghc-ppa-tools,cabal-install-head,ghc-7.8.4], sources: [hvr-ghc]}}
27+ - compiler: "ghc-7.10.3"
28+ # env: TEST=--disable-tests BENCH=--disable-benchmarks
29+ addons: {apt: {packages: [ghc-ppa-tools,cabal-install-head,ghc-7.10.3], sources: [hvr-ghc]}}
30+ - compiler: "ghc-8.0.2"
31+ # env: TEST=--disable-tests BENCH=--disable-benchmarks
32+ addons: {apt: {packages: [ghc-ppa-tools,cabal-install-head,ghc-8.0.2], sources: [hvr-ghc]}}
33+ #- compiler: "ghc-8.2.1"
34+ # env: TEST=--disable-tests BENCH=--disable-benchmarks
35+ # addons: {apt: {packages: [ghc-ppa-tools,cabal-install-head,ghc-8.2.1], sources: [hvr-ghc]}}
36+
37+before_install:
38+ - HC=${CC}
39+ - unset CC
40+ - PATH=/opt/ghc/bin:/opt/ghc-ppa-tools/bin:$PATH
41+
42+install:
43+ - cabal --version
44+ - echo "$(${HC} --version) [$(${HC} --print-project-git-commit-id 2> /dev/null || echo '?')]"
45+ - travis_retry cabal update -v
46+ - sed -i 's/^jobs:/-- jobs:/' ${HOME}/.cabal/config
47+
48+ - cabal new-build -w ${HC} --enable-tests --dep -j2 all
49+
50+# Here starts the actual work to be performed for the package under test;
51+# any command which exits with a non-zero exit code causes the build to fail.
52+script:
53+ - cabal sdist
54+ - cabal new-build -w ${HC} -j1
55+ - cabal new-test -w ${HC}
56+ - curl -sL https://raw.github.com/ndmitchell/hlint/master/misc/travis.sh | sh -s lint src test examples --cpp-define VERSION_project_m36=HLINT
57+ - cabal new-haddock
58+# EOF
Changelog.markdown−65
@@ -1,68 +1,3 @@
1−# 2021-04-01 (v0.9.3)
2−
3−* add new ":importtutd <URI> <SHA256 hash>" feature to import TutorialD from a local file or a HTTP/HTTPS URI
4−
5−# 2020-12-27 (v0.9.0)
6−
7−* replace unmaintained distributed-process-client-server RPC package with new curryer RPC package
8−* drop support for GHC 8.2 and GHC 8.4 due to dependency on DerivingVia extension
9−
10−# 2020-11-21 (v0.8.2)
11−
12−* support multiple extend expressions in TutorialD
13−* fix parsing of Bool atoms in TutorialD
14−* fix database context expressions which include self-references such as `s:=s union s`
15−* show constraints as TutorialD when using tutd console
16−* add `RelationalExprAtom` data type useful for storing `RelationalExpr` within the database
17−
18−# 2020-10-05 (v0.8.1)
19−
20−* support GHC 8.10
21−
22−# 2020-05-25 (v0.8)
23−
24−* refactor backend to maximize laziness: [An Architecture for Data Independence](docs/data_independence.markdown)
25−
26−# 2019-09-07 (v0.7)
27−
28−* fix case sensitivity issue with relation variables in tutd
29−* fix multibyte escaping in data frames
30−* fix broken instances of `Atomable [a]`
31−* fix `TypeConstructor` validation of argument count
32−* add help option to executables
33−
34−# 2019-01-08 (v0.6)
35−
36−* fix atom type parsing to support more complex data types
37−* add [data frames](docs/dataframes.markdown) to support server-side sort ordering, limits, and offsets
38−
39−# 2018-10-03 (v0.5.1)
40−
41−* fix atom function type validation
42−* add support for GHC 8.4 (now we support GHC 8.0, 8.2, and 8.4)
43−
44−# 2018-08-10 (v0.5)
45−
46−* fix critical type bug which allowed unresolved types to be used
47−* add full support for GHC 8.2 with stack or cabal (delayed for a long time by dependency version boundaries)
48−* drop support for GHC 7.10
49−* add support for `with (relexpr as name,...)` syntax for use as tutd macros
50−* add `NonEmptyList` list data type
51−
52−# 2018-06-04 (v0.4)
53−
54−* add contributed feature to allow users to [create arbitrary relations](https://github.com/agentm/project-m36/blob/master/docs/tutd_tutorial.markdown#arbitrary-relation-variables)
55−* fix type validation bug allowing concrete type with type variables in relations
56−* improve usability of `Interval a` data type
57−* allow `Integer` to be parsed as negative in `tutd` console
58−* support precompiled (Haskell) [`AtomFunction`s](https://github.com/agentm/project-m36/blob/master/docs/atomfunctions.markdown#pre-compiled-atom-functions) and [`DatabaseContextFunction`s](https://github.com/agentm/project-m36/blob/master/docs/database_context_functions.markdown#loading-precompiled-modules)
59−* make TutorialD scripts read from the filesystem unconditionally read as UTF-8
60−* improve support for display of multibyte characters in `tutd` console, especially Chinese
61−* fix file descriptor leak in file sychronization
62−* improve reliability by allowing fast-forward commits when using `autoMergeToHead`
63−* add [`semijoin` and `anitjoin`](https://github.com/agentm/project-m36/blob/master/docs/tutd_tutorial.markdown#join) support to `tutd`
64−* added various new static optimizations
65−
66# 2017-11-14
1# 2017-11-14
67
2
68* alter websocket server API to allow for multiple representations (JSON, text, or HTML) to be selected and returned simultaneously
3* alter websocket server API to allow for multiple representations (JSON, text, or HTML) to be selected and returned simultaneously
README.markdown+8−18
@@ -4,9 +4,7 @@
4[![Public Domain](https://img.shields.io/badge/license-Public%20Domain-brightgreen.svg)](http://unlicense.org)
4[![Public Domain](https://img.shields.io/badge/license-Public%20Domain-brightgreen.svg)](http://unlicense.org)
5[![Hackage](https://img.shields.io/hackage/v/project-m36.svg)](http://hackage.haskell.org/package/project-m36)
5[![Hackage](https://img.shields.io/hackage/v/project-m36.svg)](http://hackage.haskell.org/package/project-m36)
6[![Hackage dependency status](https://img.shields.io/hackage-deps/v/project-m36.svg)](http://packdeps.haskellers.com/feed?needle=project-m36)
6[![Hackage dependency status](https://img.shields.io/hackage-deps/v/project-m36.svg)](http://packdeps.haskellers.com/feed?needle=project-m36)
7−[![Windows Build status](https://ci.appveyor.com/api/projects/status/q7jyddd6dy1ibqdo/branch/master?svg=true)](https://ci.appveyor.com/project/agentm/project-m36)
7+[![Build status](https://travis-ci.org/agentm/project-m36.svg?branch=master)](https://travis-ci.org/agentm/project-m36)
8−[![Github Workflow status](https://github.com/agentm/project-m36/workflows/CI/badge.svg)](https://github.com/agentm/project-m36/actions?query=workflow%3ACI)
9−
10
8
11*Software can always be made faster, but rarely can it be made more correct.*
9*Software can always be made faster, but rarely can it be made more correct.*
12
10
@@ -14,12 +12,6 @@
14
12
15Project:M36 implements a relational algebra engine as inspired by the writings of Chris Date.
13Project:M36 implements a relational algebra engine as inspired by the writings of Chris Date.
16
14
17−## Quick Install
18−
19−Project:M36 can be downloaded and run via docker, which supports Windows 10, macOS, and Linux.
20−
21−Run `docker run -it projectm36/project-m36 tutd` to start the TutorialD command line interface.
22−
23## Description
15## Description
24
16
25Unlike most database management systems (DBMS), Project:M36 is opinionated software which adheres strictly to the mathematics of the relational algebra. The purpose of this adherence is to prove that software which implements mathematically-sound design principles reaps benefits in the form of code clarity, consistency, performance, and future-proofing.
17Unlike most database management systems (DBMS), Project:M36 is opinionated software which adheres strictly to the mathematics of the relational algebra. The purpose of this adherence is to prove that software which implements mathematically-sound design principles reaps benefits in the form of code clarity, consistency, performance, and future-proofing.
@@ -32,6 +24,10 @@ Project:M36 is written entirely in the [Haskell programming language](https://ww
32
24
33[![asciicast](https://asciinema.org/a/3syu35c8cydm403292a74l1n5.png)](https://asciinema.org/a/3syu35c8cydm403292a74l1n5)
25[![asciicast](https://asciinema.org/a/3syu35c8cydm403292a74l1n5.png)](https://asciinema.org/a/3syu35c8cydm403292a74l1n5)
34
26
27+## Try It!
28+
29+You can experiment instantly with Project:M36 straight from your browser at [try.project-m36.io](https://try.project-m36.io)!
30+
35## Use-Cases
31## Use-Cases
36
32
37Project:M36 supports multiple frontends which target different audiences.
33Project:M36 supports multiple frontends which target different audiences.
@@ -44,7 +40,7 @@ Project:M36 supports multiple frontends which target different audiences.
44
40
45* [Developer's Blog](https://agentm.github.io/project-m36/)
41* [Developer's Blog](https://agentm.github.io/project-m36/)
46* [Mailing List/Discussion Group](https://groups.google.com/d/forum/project-m36)
42* [Mailing List/Discussion Group](https://groups.google.com/d/forum/project-m36)
47−* IRC Channel: irc.libera.chat #project-m36 -- [Chat via Web Client](http://kiwiirc.com/nextclient/irc.libera.chat:+6697/#project-m36)
43+* IRC Channel: chat.freenode.net #project-m36
48* [Hackage](https://hackage.haskell.org/package/project-m36)
44* [Hackage](https://hackage.haskell.org/package/project-m36)
49* [Diogo Biazus' Project:M36 Video Tutorial](https://www.youtube.com/watch?v=_GC_lxlVEnE)
45* [Diogo Biazus' Project:M36 Video Tutorial](https://www.youtube.com/watch?v=_GC_lxlVEnE)
50
46
@@ -54,26 +50,22 @@ Project:M36 supports multiple frontends which target different audiences.
54
50
551. [Installation and Introduction to Project:M36](docs/introduction_to_projectm36.markdown)
511. [Installation and Introduction to Project:M36](docs/introduction_to_projectm36.markdown)
561. [Introduction to the Relational Algebra](docs/introduction_to_the_relational_algebra.markdown)
521. [Introduction to the Relational Algebra](docs/introduction_to_the_relational_algebra.markdown)
57−1. [TutorialD Cheatsheet](docs/tutd_cheatsheet.markdown)
581. [TutorialD via Jupyter Notebook Walkthrough](jupyter/TutorialD%20Notebook%20Walkthrough.ipynb)
531. [TutorialD via Jupyter Notebook Walkthrough](jupyter/TutorialD%20Notebook%20Walkthrough.ipynb)
591. [TutorialD Tutorial](docs/tutd_tutorial.markdown)
541. [TutorialD Tutorial](docs/tutd_tutorial.markdown)
601. [15 Minute Tutorial](docs/15_minute_tutorial.markdown)
551. [15 Minute Tutorial](docs/15_minute_tutorial.markdown)
611. [Developer's Change Log](Changelog.markdown)
561. [Developer's Change Log](Changelog.markdown)
621. [Simple Client API](docs/simple_api.markdown)
571. [Simple Client API](docs/simple_api.markdown)
63−1. [CSV Import/Export](docs/import_export_csv.markdown)
64
58
65### Database Comparisons
59### Database Comparisons
66
60
671. [ACID Database Properties](docs/acid_assessment.markdown)
611. [ACID Database Properties](docs/acid_assessment.markdown)
681. [On NULL (in SQL)](docs/on_null.markdown)
621. [On NULL (in SQL)](docs/on_null.markdown)
691. [Reaching "Out of the Tarpit" with Project:M36](docs/reaching_out_of_the_tarpit.markdown)
631. [Reaching "Out of the Tarpit" with Project:M36](docs/reaching_out_of_the_tarpit.markdown)
70−1. [An Architecture for Data Independence](docs/data_independence.markdown)
71
64
72### Advanced Features
65### Advanced Features
73
66
741. [Transaction Graph Operators](docs/transaction_graph_operators.markdown)
671. [Transaction Graph Operators](docs/transaction_graph_operators.markdown)
751. [ProjectM36.Client Library](docs/projectm36_client_library.markdown)
681. [ProjectM36.Client Library](docs/projectm36_client_library.markdown)
76−1. [Data Frames for Sorting](docs/dataframes.markdown)
771. [Adding New Data Types](docs/new_datatypes.markdown)
691. [Adding New Data Types](docs/new_datatypes.markdown)
781. [Database-Manipulating Functions](docs/database_context_functions.markdown)
701. [Database-Manipulating Functions](docs/database_context_functions.markdown)
791. [Serving Remote ProjectM36 Databases](docs/server_mode.markdown)
711. [Serving Remote ProjectM36 Databases](docs/server_mode.markdown)
@@ -84,17 +76,15 @@ Project:M36 supports multiple frontends which target different audiences.
841. [Isomorphic Schemas](docs/isomorphic_schemas.markdown)
761. [Isomorphic Schemas](docs/isomorphic_schemas.markdown)
851. [Replication](docs/replication.markdown)
771. [Replication](docs/replication.markdown)
861. [Basic Operator Benchmarks](https://rawgit.com/agentm/project-m36/master/docs/basic_benchmarks.html)
781. [Basic Operator Benchmarks](https://rawgit.com/agentm/project-m36/master/docs/basic_benchmarks.html)
87−1. [Merkle Transaction Hashes](docs/merkle_transaction_graph.markdown)
88
79
89### Integrations
80### Integrations
90
81
911. [WebSocket Server](docs/websocket_server.markdown)
821. [WebSocket Server](docs/websocket_server.markdown)
92−1. [Jupyter Notebook Kernel](docs/jupyter_kernel.markdown)
83+1. [Jupyter Notebook Kernel](docs/jupypter_kernel.markdown)
93−1. [Persistent Driver](https://github.com/YuMingLiao/persistent-project-m36)
94
84
95## Development
85## Development
96
86
97−Project:M36 is developed in Haskell and compiled with GHC 8.6 or later.
87+Project:M36 is developed in Haskell and compiled with GHC 7.10 or GHC 8.0.2 or later.
98
88
99## Related Projects
89## Related Projects
100
90
cabal.project+2−9
@@ -1,10 +1,3 @@
1+-- this is needed for GHC8 until distributed-process-extras is updated on Hackage with increased upper bounds
1packages: project-m36.cabal
2packages: project-m36.cabal
2−
3+allow-newer: distributed-process-extras:time,distributed-process-extras:binary,distributed-process-client-server:binary,distributed-process-client-server:time,distributed-process-async:time,distributed-process-async:binary
3−package *
4− split-sections: True
5−
6−--high-performance streaming library
7−source-repository-package
8− type: git
9− location: https://github.com/composewell/streamly.git
10− tag: ac3af8749194f1788704dda8667d0b3807075cc2
cbits/DirectoryFsync.c−3
@@ -24,13 +24,11 @@ int cDirectoryFsync(char *path)
24 ret = fstat(fd,&fdstat);
24 ret = fstat(fd,&fdstat);
25 if(ret < 0)
25 if(ret < 0)
26 {
26 {
27− close(fd);
28 return errno;
27 return errno;
29 }
28 }
30
29
31 if(!S_ISDIR(fdstat.st_mode))
30 if(!S_ISDIR(fdstat.st_mode))
32 {
31 {
33− close(fd);
34 return ENOTDIR;
32 return ENOTDIR;
35 }
33 }
36
34
@@ -41,7 +39,6 @@ int cDirectoryFsync(char *path)
41#else
39#else
42 ret = fsync(fd);
40 ret = fsync(fd);
43#endif
41#endif
44− close(fd);
45 if(ret < 0)
42 if(ret < 0)
46 {
43 {
47 return errno;
44 return errno;
default.nixdeleted−1
@@ -1 +0,0 @@
1−(import ./release.nix { }).project
docker.nixdeleted−18
@@ -1,18 +0,0 @@
1−{ compiler ? "ghc8104"
2−, sources ? import ./nix/sources.nix
3−, pkgs ? import sources.nixpkgs { }
4−}:
5−let
6− release = import ./release.nix { inherit pkgs compiler sources; };
7− static-project-m36 = pkgs.haskell.lib.dontCheck (pkgs.haskell.lib.justStaticExecutables release.project);
8−in
9−pkgs.dockerTools.buildImage {
10− name = "project-m36";
11− tag = "latest";
12− contents = [ static-project-m36 ];
13− # expose default project-m36 and websocket server ports
14− config = {
15− Env = [ "LC_ALL=en_US.UTF-8" ];
16− ExposedPorts = { "6543/tcp" = { }; "8000/tcp" = { }; };
17− };
18−}
docs/15_minute_tutorial.markdown+68−65
@@ -4,34 +4,40 @@ Thank you for evaluating Project:M36, a new relational algebra engine written in
4
4
5## Prerequisites
5## Prerequisites
6
6
7−* any Linux, MacOS, or Windows computer with Docker installed
7+* any Linux
8+* GHC 7.10 or later version (Haskell compiler)
9+* cabal (package downloader) installed
8
10
9## Download and Install
11## Download and Install
10
12
11−Run a pre-built docker image:
12−
13−```docker run -it projectm36/project-m36 tutd```
14−
15−or build it yourself with GHC >= 8.6:
16−
17```bash
13```bash
18git clone https://github.com/agentm/project-m36.git
14git clone https://github.com/agentm/project-m36.git
15+cabal sandbox init
16+cabal install --dependencies-only
19−cabal new-run tutd
17+cabal run tutd
20```
18```
21
19
22## Some Basic TutorialD
20## Some Basic TutorialD
23
21
24−When you run the ```tutd``` interpreter, you are interacting with an in-memory database using a dialect of the TutorialD language which is described in numerous books by Chris J. Date. It is a language specifically designed for human interaction with the relational algebra.
22+When you run the ```tutd``` interpreter, you are interacting with an in-memory database using a dialect of the TutorialD language which is described in numerous book by Chris J. Date. It is a language specifically designed for human interaction with the relational algebra.
25
23
26Note that TutorialD is strongly-typed- no type coercions take place automatically. For example, an integer will never be interpreted as a string or vice versa.
24Note that TutorialD is strongly-typed- no type coercions take place automatically. For example, an integer will never be interpreted as a string or vice versa.
27
25
28### Load the Canonical Chris Date Example
26### Load the Canonical Chris Date Example
29
27
30```
28```
31−TutorialD (master/main): :importexample cjdate
29+TutorialD (master/main): :importexample date
30+```
31+
32+or
33+
34+```
35+TutorialD (master/main): :importtud "scripts/DateExamples.tutd"
32```
36```
33
37
34−```:importexample``` (do not skip typing the preceding colon), loads a built-in example schema and executes it to change the state of the database. In this case, the relations "s" (supplier), "p" (product), and "sp" (suppliers-products) are now loaded.
38+```:importtutd``` (do not skip typing the preceding colon), loads a file which contains a script written in the TutorialD dialect used by Project:M36 and executes it to change the state of the database. In this case, the relations "s" (supplier), "p" (product), and "sp" (suppliers-products) are now loaded.
39+
40+```:importexample date``` loads the date example directly without any file I/O, so it is safe to use with the websocket server.
35
41
36### Execute Relational Expressions
42### Execute Relational Expressions
37
43
@@ -158,7 +164,7 @@ Database context expressions change the state of the database, much like "CREATE
158#### Create a Relation Variable
164#### Create a Relation Variable
159
165
160```
166```
161−TutorialD (master/main): x:=relation{name Text, age Integer}{tuple{name "Steve", age 40},tuple{name "Mike", age 31}}
167+TutorialD (master/main): x:=relation{name Text, age Int}{tuple{name "Steve", age 40},tuple{name "Mike", age 31}}
162TutorialD (master/main): :showexpr x
168TutorialD (master/main): :showexpr x
163┌────────┬──────────┐
169┌────────┬──────────┐
164│age::Int│name::Text│
170│age::Int│name::Text│
@@ -173,25 +179,23 @@ This is similar to SQL's "CREATE TABLE" operator.
173#### Insert Additional Tuples
179#### Insert Additional Tuples
174
180
175```
181```
176−TutorialD (master/main): x:=relation{name Text, age Integer}{tuple{name "Steve", age 40},tuple{name "Mike", age 31}}
182+TutorialD (master/main): x:=relation{name Text, age Int}{tuple{name "Steve", age 40},tuple{name "Mike", age 31}}
177TutorialD (master/main): :showexpr x
183TutorialD (master/main): :showexpr x
178−┌────────────┬──────────┐
184+┌────────┬──────────┐
179−│age::Integer│name::Text│
185+│age::Int│name::Text│
180−├────────────┼──────────┤
186+├────────┼──────────┤
187+│40 │"Steve" │
181−│31 │"Mike" │
188+│31 │"Mike" │
182−│40 │"Steve" │
183−└────────────┴──────────┘
189+└────────┴──────────┘
184−
185TutorialD (master/main): insert x relation{tuple{name "Bob", age 24}}
190TutorialD (master/main): insert x relation{tuple{name "Bob", age 24}}
186TutorialD (master/main): :showexpr x
191TutorialD (master/main): :showexpr x
187−┌────────────┬──────────┐
192+┌────────┬──────────┐
188−│age::Integer│name::Text│
193+│age::Int│name::Text│
189−├────────────┼──────────┤
194+├────────┼──────────┤
190−│31 │"Mike" │
191−│40 │"Steve" │
195+│40 │"Steve" │
192−│24 │"Bob" │
196+│24 │"Bob" │
197+│31 │"Mike" │
193−└────────────┴──────────┘
198+└────────┴──────────┘
194−
195```
199```
196
200
197Note that the relational insertion is identical to "x:=x union relation{...}".
201Note that the relational insertion is identical to "x:=x union relation{...}".
@@ -200,51 +204,50 @@ Note that the relational insertion is identical to "x:=x union relation{...}".
200
204
201```
205```
202TutorialD (master/main): :showexpr s
206TutorialD (master/main): :showexpr s
203−┌──────────┬────────┬───────────┬───────────────┐
207+┌──────────┬────────┬───────────┬───────────┐
204−│city::Text│s#::Text│sname::Text│status::Integer│
208+│city::Text│s#::Text│sname::Text│status::Int│
205−├──────────┼────────┼───────────┼───────────────┤
209+├──────────┼────────┼───────────┼───────────┤
210+│"Paris" │"S2" │"Jones" │10 │
211+│"Paris" │"S3" │"Blake" │30 │
206−│"London" │"S1" │"Smith" │20 │
212+│"London" │"S1" │"Smith" │20 │
213+│"London" │"S4" │"Clark" │20 │
207−│"Athens" │"S5" │"Adams" │30 │
214+│"Athens" │"S5" │"Adams" │30 │
208−│"Paris" │"S3" │"Blake" │30 │
209−│"London" │"S4" │"Clark" │20 │
210−│"Paris" │"S2" │"Jones" │10 │
211−└──────────┴────────┴───────────┴───────────────┘
215+└──────────┴────────┴───────────┴───────────┘
212TutorialD (master/main): update s where city="London" (status:=35)
216TutorialD (master/main): update s where city="London" (status:=35)
213TutorialD (master/main): :showexpr s
217TutorialD (master/main): :showexpr s
214−┌──────────┬────────┬───────────┬───────────────┐
218+┌──────────┬────────┬───────────┬───────────┐
215−│city::Text│s#::Text│sname::Text│status::Integer│
219+│city::Text│s#::Text│sname::Text│status::Int│
216−├──────────┼────────┼───────────┼───────────────┤
220+├──────────┼────────┼───────────┼───────────┤
217−│"Athens" │"S5" │"Adams" │30 │
221+│"London" │"S4" │"Clark" │35 │
218−│"London" │"S1" │"Smith" │35 │
222+│"London" │"S1" │"Smith" │35 │
219−│"London" │"S4" │"Clark" │35 │
220−│"Paris" │"S3" │"Blake" │30 │
221−│"Paris" │"S2" │"Jones" │10 │
223+│"Paris" │"S2" │"Jones" │10 │
224+│"Paris" │"S3" │"Blake" │30 │
225+│"Athens" │"S5" │"Adams" │30 │
222−└──────────┴────────┴───────────┴───────────────┘
226+└──────────┴────────┴───────────┴───────────┘
223−
224```
227```
225#### Deleting Tuples from a Relation Variable
228#### Deleting Tuples from a Relation Variable
226
229
227```
230```
228TutorialD (master/main): :showexpr s
231TutorialD (master/main): :showexpr s
229−┌──────────┬────────┬───────────┬───────────────┐
232+┌──────────┬────────┬───────────┬───────────┐
230−│city::Text│s#::Text│sname::Text│status::Integer│
233+│city::Text│s#::Text│sname::Text│status::Int│
231−├──────────┼────────┼───────────┼───────────────┤
234+├──────────┼────────┼───────────┼───────────┤
232−│"Paris" │"S2" │"Jones" │10 │
235+│"Paris" │"S2" │"Jones" │10 │
233−│"Paris" │"S3" │"Blake" │30 │
236+│"Paris" │"S3" │"Blake" │30 │
234−│"London" │"S1" │"Smith" │20 │
237+│"London" │"S1" │"Smith" │20 │
238+│"London" │"S4" │"Clark" │20 │
235−│"Athens" │"S5" │"Adams" │30 │
239+│"Athens" │"S5" │"Adams" │30 │
236−│"London" │"S4" │"Clark" │20 │
237−└──────────┴────────┴───────────┴───────────────┘
240+└──────────┴────────┴───────────┴───────────┘
238TutorialD (master/main): delete s where sname="Adams"
241TutorialD (master/main): delete s where sname="Adams"
239TutorialD (master/main): :showexpr s
242TutorialD (master/main): :showexpr s
240−┌──────────┬────────┬───────────┬───────────────┐
243+┌──────────┬────────┬───────────┬───────────┐
241−│city::Text│s#::Text│sname::Text│status::Integer│
244+│city::Text│s#::Text│sname::Text│status::Int│
242−├──────────┼────────┼───────────┼───────────────┤
245+├──────────┼────────┼───────────┼───────────┤
243−│"Paris" │"S2" │"Jones" │10 │
246+│"Paris" │"S2" │"Jones" │10 │
244−│"London" │"S4" │"Clark" │20 │
245−│"Paris" │"S3" │"Blake" │30 │
247+│"Paris" │"S3" │"Blake" │30 │
246−│"London" │"S1" │"Smith" │20 │
248+│"London" │"S1" │"Smith" │20 │
249+│"London" │"S4" │"Clark" │20 │
247−└──────────┴────────┴───────────┴───────────────┘
250+└──────────┴────────┴───────────┴───────────┘
248```
251```
249
252
250### Execute Transaction Graph Expressions
253### Execute Transaction Graph Expressions
@@ -267,7 +270,7 @@ TutorialD (master/main): :rollback
267
270
268```
271```
269TutorialD (master/main): :branch experimental
272TutorialD (master/main): :branch experimental
270−TutorialD (experimental): employee:=relation{name Text, salary Integer}
273+TutorialD (experimental): employee:=relation{name Text, salary Int}
271TutorialD (experimental): :commit
274TutorialD (experimental): :commit
272```
275```
273
276
docs/atomfunctions.markdown+2−31
@@ -6,7 +6,7 @@ While Project:M36 includes a set of basic function which operate on relational v
6
6
7Other DBMSes also include this feature by way of stored functions such as with PL/pgsql, T-SQL, or PL/SQL.
7Other DBMSes also include this feature by way of stored functions such as with PL/pgsql, T-SQL, or PL/SQL.
8
8
9−Project:M36 allows users to implement strongly-typed and pure atom functions in the Haskell language at runtime. This facility makes use of GHC, the Haskell compiler, as a runtime service. Alternatively, Haskell-based atom functions can be pre-compiled and loaded at runtime.
9+Project:M36 allows users to implement strongly-typed and pure atom functions in the Haskell language at runtime. This facility makes use of GHC, the Haskell compiler, as a runtime service.
10
10
11## Atom Function Example
11## Atom Function Example
12
12
@@ -15,7 +15,7 @@ In this example, we install an atom function to convert between Fahrenheit and C
15We write the function giving it the name "celsiusToFahrenheit" with type ```Int -> Int``` which indicates to the compiler that the function take one ```Int``` argument value and returns one ```Int``` value. Finally, the body of the function is implemented in quotes or triple-quotes. Note that the function makes use of the "[ProjectM36.Base](/src/lib/ProjectM36/Base.hs)" module to handle the Atom type. The function must take a list of Atoms as arguments and return an Atom. The standard GHC Prelude is available in this AtomFunctionBody context.
15We write the function giving it the name "celsiusToFahrenheit" with type ```Int -> Int``` which indicates to the compiler that the function take one ```Int``` argument value and returns one ```Int``` value. Finally, the body of the function is implemented in quotes or triple-quotes. Note that the function makes use of the "[ProjectM36.Base](/src/lib/ProjectM36/Base.hs)" module to handle the Atom type. The function must take a list of Atoms as arguments and return an Atom. The standard GHC Prelude is available in this AtomFunctionBody context.
16
16
17```
17```
18−TutorialD (master/main): addatomfunction "celsiusToFahrenheit" Int -> Either AtomFunctionError Int """(\((IntAtom c):_) -> pure $ IntAtom ( (c * 9 `div` 5) + 32)) :: [Atom] -> Either AtomFunctionError Atom"""
18+TutorialD (master/main): addatomfunction "celsiusToFahrenheit" Int -> Either AtomFunctionError Int """(\\((IntAtom c):_) -> pure $ IntAtom ( (c * 9 `div` 5) + 32)) :: [Atom] -> Either AtomFunctionError Atom"""
19```
19```
20
20
21Using triple-quotes allows quotes to be used inside the string without backslash escaping, which can become tedious. The sum type using ```Either``` allows the function to return an error, if necessary.
21Using triple-quotes allows quotes to be used inside the string without backslash escaping, which can become tedious. The sum type using ```Either``` allows the function to return an error, if necessary.
@@ -41,35 +41,6 @@ Project:M36 also supports polymorphic types when used with atom functions. Here
41addatomfunction "idTest" a -> Either AtomFunctionError a "(\(x:_) -> pure x) :: [Atom] -> Either AtomFunctionError Atom"
41addatomfunction "idTest" a -> Either AtomFunctionError a "(\(x:_) -> pure x) :: [Atom] -> Either AtomFunctionError Atom"
42```
42```
43
43
44−## Pre-compiled Atom Functions
45−
46−Compiling atom functions at runtime can incur a performance cost. To mitigate this, atom functions can be compiled by GHC to object files and then loaded into the Project:M36 server. Let's look at an [example](https://github.com/agentm/project-m36/):
47−
48−```haskell
49−module DynamicAtomFunctions where
50−import ProjectM36.Base
51−
52−someAtomFunctions :: [AtomFunction]
53−someAtomFunctions = [AtomFunction{
54− atomFuncName = "constTrue",
55− atomFuncType = [TypeVariableType "a", BoolAtomType],
56− atomFuncBody = AtomFunctionBody Nothing (\(x:_) -> pure (BoolAtom True))}]
57−```
58−
59−Any function inside any module which returns a list of `AtomFunction`s can be used to load more atom functions. First, create the Haskell object file:
60−
61−`cabal exec ghc -- examples/DynamicAtomFunctions.hs -package project-m36`
62−
63−Use cabal or stack to invoke ghc so that the project-m36 installed package will be found.
64−
65−Finally, connect to your Project:M36 database using the `tutd` client and run:
66−
67−`TutorialD (master/main): loadatomfunctions "DynamicAtomFunctions" "someFunctions" "examples/DynamicAtomFunctions.o"`
68−
69−If you see an error such as "unknown symbol", the version of the "project-m36" library installed in your sandbox is different from that with which you linked the object file. Make sure that the same versions are used in linking the server and object file.
70−
71−The atom function is now loaded and ready-to-use. Note, however, that the function must be added every time the project-m36-server starts. This will probably be improved in a future release.
72−
73## Differences when compared to other DBMSes
44## Differences when compared to other DBMSes
74
45
75Project:M36 enforces strongly-typed atom functions. Specifically, atom functions must be pure (free of any side effects) and cannot operate on any variables other than the atoms passed in. This certainly sets stricter limits on what can be accomplished in an atom function when compared to stored functions in other DBMS products. For example, an atom function in Project:M36 would never be able to retrieve stock information from an external website because such a function cannot be pure and thus would be rejected by the atom function compiler. This restriction maintains the mathematical cohesiveness of the database and allows the DBMS to make performance-enhancing inferences it would not otherwise be able to make.
46Project:M36 enforces strongly-typed atom functions. Specifically, atom functions must be pure (free of any side effects) and cannot operate on any variables other than the atoms passed in. This certainly sets stricter limits on what can be accomplished in an atom function when compared to stored functions in other DBMS products. For example, an atom function in Project:M36 would never be able to retrieve stock information from an external website because such a function cannot be pure and thus would be rejected by the atom function compiler. This restriction maintains the mathematical cohesiveness of the database and allows the DBMS to make performance-enhancing inferences it would not otherwise be able to make.
docs/commits_in_constant_time.markdowndeleted−134
@@ -1,134 +0,0 @@
1−# Transactional Database Commits in O(1)
2−
3−A.M.
4−
5−[Project:M36](https://github.com/agentm/project-m36)
6−
7−## Synopsis
8−
9−Common relational database management systems operate in an imperative manner by executing statements immediately. This naive strategy quickly becomes an IO-bound bottleneck. By applying Haskell's laziness-in-evaluation to database updates, new doors for optimizations based on what is queried make themselves apparent. Furthermore, by serializing thunks representing idempotent database updates, the database can commit transactions in constant time with regards to the tuple count since the tuples themselves need not be serialized. This optimization, combined with *fsync*-coalescing, can allow databases to commit to disk faster than tuples updates can be processed.
10−
11−Using this deferred execution technique, database updates can be processed in the background or, in the case when the tuples are never requested, never.
12−
13−These database update thunks and other interesting optimizations are implemented in [Project:M36](https://github.com/agentm/project-m36): an experimental, clean-room, purely Haskell implementation of an RDBMS engine based on the mathematical principles of the relational algebra.
14−
15−## Rationale
16−
17−A typical SQL RDBMS such as PostgreSQL executes a list of commands serially against a serializable representation of the database state without concern to whether or not the commands are effectively necessary to service subsequent requests. A database update which affects *n* tuples will necessitate disk writes of *O(n)* plus *O(n\*log(n))* writes for each affected index.
18−
19−By validating and serializing thunks of validated commands, Project:M36 commits can be independent of the tuple write cost. The thunks, which are flushed to non-volatile storage to complete the transaction commit, allow the DBMS to defer execution in preference to commit time.
20−
21−The deferral is, however, not required, and could be left as a option to the user or application.
22−
23−The final cost of committing in Project:M36 relates to the size of the update expression. If the update expression is, for example, a insertion of a large number of rows, then the commit cost will be *O(t)* where *t* is the number of tuples expressed in the update, but still independent of the cost of the existing tuples in the database.
24−
25−## Example and Comparison to PostgreSQL
26−
27−Let us walk through a specific example using SQL. While Project:M36 does not support SQL (and for [good reasons](https://github.com/agentm/project-m36/blob/master/docs/on_null.markdown)), comparing both databases with a common language is useful for illustrative purposes.
28−
29−Let us consider an existing database with a table/relation named "BigTable" which has 10 billion rows/tuples (an arbitrarily large number) of which one column is named "x" and represents a randomly-assigned integer. Next, assume that the user of the database will execute an update which will update every row/tuple, commit the changes, then query a subset of the resultant updated rows/tuples.
30−
31−
32−### The Update Expression
33−
34−Consider the following database update:
35−
36−```
37−UPDATE "BigTable" SET x = x + 1;
38−```
39−In PostgreSQL, the cost of executing this expression is incurred immediately upon execution. New tuples are laid down to disk (if the dataset is larger than *shared_buffers*), duplicating the entirety of the existing table/relation in storage (due to MVCC) for a cost of *O(n)* where *n* is the number of existing rows/tuples in "BigTable". If *x* is indexed, then the index writes incur an additional cost of *O(n\*log(n))* writes. Furthermore, PostgreSQL will write all changes to its write-ahead log, so the cost is multiplied by some factor.
40−
41−In Project:M36, the same expression can first be statically validated to adhere to the database constraints. The only constraint affected here is for the column/attribute *x* which requires an integer. Since adding one to any integer retains the integer type, the constraint can be determined to be unviolated without evaluating the expression, thus at a cost of *O(1)*. Project:M36 uses a novel WORM (write-once, read-many) strategy over journaled filesystems to avoid the need for a separate journal.
42−
43−*For the purpose of this example, assume that integer overflow is not a concern.*
44−
45−### The Commit
46−
47−```
48−COMMIT;
49−```
50−
51−In PostgreSQL, the write-ahead log mentioned above containing all tuples changes must now be flushed to non-volatile storage, creating a bottleneck to the slowest form of storage. A necessary checkpoint (which is configurable) could incur further writes as the tuples are flushed to disk as well.
52−
53−In Project:M36, the update expression must also be flushed to disk, but the expression is a mere few bytes appended to the transaction graph.
54−
55−### The Subsequent Query
56−
57−Finally, the user queries a subset of the updated table/relation.
58−
59−```
60−SELECT a, b, c, x FROM "BigTable" WHERE x > 10000;
61−```
62−
63−In PostgreSQL, considering that the column/attribute has an index, *O(log(n))* reads are needed to identify on which pages in the table's on-disk storage the proper values can be found. Considering that the value *x* was previously described as random, despite the restriction, in the worst case, every page of the on-disk table may need to be read because each page could contain one value matching the restriction. This would necessitate reading *O(n)* tuples previously written to disk. After reading the tuples, the tuples must be filtered by the restriction to service the query.
64−
65−In Project:M36, the state of the database is determined to be the difference of the previous state *S* (before the *x+1* update above) and *S'* (after the update). The serialized update expression can be deserialized and merged into the rewritten query:
66−
67−```
68−SELECT orig.a, orig.b, orig.c, x_orig + 1 AS x FROM (SELECT a, b, c, x AS x_orig FROM "BigTable"@S) AS orig WHERE x > 10000;
69−```
70−
71−where the *@* symbol references the state of "BigTable" at transaction state *S* in the past. The rewrite process can occur in constant time regarding the tuple count, but the execution does require reading the previous state *S* of "BigTable", filtering it as expected. The tuple read cost is equivalent to that of the same statement at *S'*: *O(log(n))* utilizing a b-tree index.
72−
73−### Summary
74−
75−| | PostgreSQL | Project:M36 |
76−|-|------------|-------------|
77−| UPDATE x+1 | *O(nlog(n))* | *O(1)* |
78−| COMMIT | flush *n* tuples to disk | flush expression to disk |
79−| SELECT x>10000 | *Ω(log(n))*, *O(n)* worst case | *O(log(n))* |
80−
81−Even if the user were to query all the tuples back, the actual IO cost in Project:M36 would be lower since the updates are only "executed" on the fly and not necessarily written to disk. However, a clever cacheing strategy could note that state *S* is queried often enough to warrant a cached version. The table's data on disk, however, is not required to answer the query.
82−
83−## Constraint Oracles
84−
85−To be able to perform an update and commit in constant or less than *O(n)* time does have some preconditions:
86−
87− * constraints must be able to be statically validated in linear or logarithmic time
88−
89−However, even if constraints lack a proper oracle such as an index or a static means of validation and, thus, cannot be validated in constant time, the user may still benefit from serialization of the database update expression since writing the validated tuples to disk can be deferred beyond commit time and could go directly into an on-disk cache.
90−
91−## Worst Case Behavior
92−
93−Every database constraint can be represented as an inclusion dependency whereby the evaluation of a relational expression `sub` must be a subset of the evaluation of relational expression `super` (`sub ⊆ super`) for the constraint to validate. Therefore, the worst case time to validate any constraint, assuming that the constraint has an ideal oracle, is O(n) in the tuple count. However, as mentioned above, there are many constraints that can be validated in constant or less-than-linear time. Furthermore, the validated tuples need not be written to disk once the constraint is found to hold.
94−
95−Since there is great variation in constraint validation cost, the RDBMS could pre-analyze and report on associated constraints costs or make use of data independence to guide storage to optimize queries needed to service the constraint checker.
96−
97−## Caveats
98−
99−Certain types of updates still take a similar amount of time to commit in Project:M36 in comparison to PostgreSQL. Specifically, any update which relies on data outside the database's purview will necessitate flushing the tuple data since the update expression contains new tuple data not based on existing tuples. For example, the equivalent of:
100−
101−```
102−INSERT INTO "BigTable"(a, b, c, x) VALUES (1,5,10,10),(20,20,21,30),.... #many tuples
103−```
104−will still necessitate a *O(n)* tuple writes to disk in both databases. Though the asymptotic costs are equivalent, the number of writes are cut in half in Project:M36 since it does not require a write-ahead log.
105−
106−While PostgreSQL makes use of MVCC (multi-version concurrency control) which marks which tuples belong to a linear progression of transaction states, Project:M36 stores a full history of database state using a transaction graph (a directed acyclic graph similar to the commit-based graph of `git`). The graph allows named branches to be created and merged which also reduce contention around a singular graph head.
107−
108−## Applying Laziness to SQL RDBMSes
109−
110−Would it be possible to apply transaction-based laziness to an SQL-based RDBMS? Certainly, with sufficient shoe-horning, it could work, but SQL includes a few malfeatures which would make it difficult, if not impossible:
111−
112− * Non-idempotent server-side functions prevent laziness because of side effects. PostgreSQL can mark functions as idempotent, but does not validate or enforce the idempotence, Project:M36, via Safe Haskell, can validate pure functions.
113− * The lack of "time travel", the ability to query database state in the past prevents reliance on previous states, prevents direct referencing of previous database states on which the state differences can be built.
114− * Tightly-coupled table-to-storage management prevents alternative data models. Indexing and constraint checking need to be statically verifiable and deferrable.
115−
116−These hurdles are not insurmountable, just perhaps not a good fit for SQL databases with a lot of historical and implementation baggage.
117−
118−## Benchmarks
119−
120−Forthcoming.
121−
122−## Conclusion
123−
124−Transactional time-to-commit is critical in ensuring that business decisions can make it to non-volatile storage as quickly as possible. By introducing Haskell-like, lazy evaluation to update expressions and serializing the resultant thunk, commits can be serialized in constant time, disregarding the number of tuples modified in the expression.
125−
126−This serialization strategy turns modern RDBMS architecture on its head since the table/relation-to-file mapping is broken, resulting in true data independence. Any on-disk representation of a relation at a specific transaction state therefore merely becomes a cached and purgeable entity, drastically shrinking on-disk cacheing requirements while expanding the scope in which said strategies can operate. Hopefully, a truly data independent architecture will result in new optimization discoveries.
127−
128−Project:M36 implements a transaction graph which can represent the entirety of database state, leaving room for any number of alternative representations, even for a single relation or relation across transaction states. A simple example could include storing two different orderings of tuples of the same relation in order to optimally serve different join queries. Common RDBMSes offer only two on-disk representations: the set of fully-evaluated tuples and indexes to those tuples, preventing data independence. Data independence paves the way towards the elimination of implementation-specific, gatekeeper roles such as database administrators.
129−
130−The promise of the relational algebra has always been the liberation of data from its data structure representation in order to be able to answer arbitrary queries. Modern DBMSes which typically map tables directly to one or more files on disk fail to live up to this promise. Project:M36 sets out to rectify this failure.
131−
132−In a greater context, applying laziness to an architecture to make use of more interesting optimizations is hardly new. The OpenGL API views its "immediate" mode as effectively deprecated. Filesystems take advantage of laziness using copy-on-write semantics. High-level programming languages can make greater, more interesting inferences about how a computation must be execute. A computer can always consider many more possible solution paths than a human can.
133−
134−The adherence to mathematical priniciples in Project:M36 results in features and optimization opportunities which have not yet been discovered. In contrast to RDBMSes designed around specific optimizations (such as indexes, specific disk layouts, or key-value lookups), Project:M36 sets out to demonstrate practically that future optimizations can only be discovered when operating within a mathematically-coherent architecture.
docs/data_independence.markdowndeleted−109
@@ -1,109 +0,0 @@
1−# Project:M36: Towards an Architecture for Data Independence
2−
3−## Introduction
4−
5−The Project:M36 relational algebra architecture sets itself apart from typical DBMSes by ensuring strict transactional isolation, a branchable/mergeable (rather than linear) transaction graph, and storage of relational expressions (rather than storage of tuples). Let's look at how these architectural features work together to make Project:M36 the first relational algebra engine to implement true data independence.
6−
7−## What is Data Independence?
8−
9−C.J. Date writes:
10−
11−`Certainly most SQL products have failed to live up to the [relational] model's full potential...in those products, what the user sees and what is physically stored are essentially the same thing... In particular, it accounts for the argument, so often heard, to the effect that we have to "denormalize for performance."`
12−
13−`In principle, logical design has absolutely nothing to do with performance at all.`
14−
15−(Date, C.J. "Database In Depth: Relational Theory for Practitioners". O'Reilly Media. 2005. pages 156-157.)
16−
17−Data independence is therefore defined as the separation of the database user's experience from the database's means of in-memory or on-disk representation. As Date points out, virtually all database products implement a one-to-one mapping of relations to files in storage.
18−
19−One advantage of high-level abstractions in programming languages is to leverage advanced algorithms which can choose optimization paths on behalf of the user which a human may never be able to discover. While the promise of ever higher-level abstractions is realized by progamming languages such as Haskell, DBMS implementors have been resistant to data independence. This is due to several legacy factors such as companies pushing one-trick-pony database technologies and middlemen such as DBAs required to play gatekeeper against "bad" schema changes. The result is customers forced to run multiple disparate databases such as one for realtime transaction processing and another for analytics and another for audit logging. This recalcitrance has also led to the rise of databases such as "document" JSON databases with weak mathematical underpinnings in the name of performance as users become frustrated when hitting performance walls and dealing with arbitrary database limitations.
20−
21−Implementations which closely tie the user interface to backend representation close the door on interesting alternative representations and optimizations. For example, SQL databases typically store a single relation as a list of tuples on disk with supplementary indexes stored in separate files. There is no reason that the same relation couldn't be on disk or in memory in any number of formats. Such a table might be useful in various formats ideal for servicing different types of queries. Data independence grants the DBMS the permission to create any number of representations- including none at all- as long as the correct answer is provided to the user. "Column-store" databases may try to slice the tuples in a different axis, but those databases simply shift the performance problems elsewhere. Only implementation details prevent a database from offering both column-oriented *and* tuple-oriented representation while allowing the database to choose.
22−
23−That is why it is critical for the user's interface to the database *not* to include features such as "query hints" which would force a specific implementation in the backend. The user's interface must be declarative (describing the state change or query rather than *how* to execute it) and sufficiently high level. Any implementation detail leakage to the user's interface is a lost potential algorithmic optimization. While the topic of providing high-level interfaces is not specific to database design, we will continue to explore the ramifications of data independence in databases.
24−
25−
26−## Transactional Isolation
27−
28−While other databases offer various transaction isolation levels with differing levels of implementation-specific surprises, Project:M36 solely suppports the maximum transaction isolation level. Instead of relying on details of [MVCC](https://www.postgresql.org/docs/current/mvcc-intro.html) which marks each tuple in a relation with a monotonically-increasing number identifying from which transaction the tuple was added or deleted, Project:M36 includes no singular backing store for tuples, instead storing a stream of state change requests. Because the transaction graph supports branching and merging (similar to version control such as git), transactions can be committed without contention at a singular head of the graph. Committing to disk can be implemented as writing a file to represent the transaction's state and
29−
30−## The Transaction Graph
31−
32−These state changes are, in fact, the idempotent relational update expressions that the user has submitted. For example, given a transaction which includes a single relation `s`:
33−
34−```
35−┌──────────┬────────┬───────────┬───────────┐
36−│city::Text│s#::Text│sname::Text│status::Int│
37−├──────────┼────────┼───────────┼───────────┤
38−│"Paris" │"S2" │"Jones" │10 │
39−└──────────┴────────┴───────────┴───────────┘
40−```
41−
42−if the user commits a transaction with an insert such as:
43−
44−```
45−insert x relation{tuple{city "Boston", s# "S3", sname "Smith", status 400}}
46−```
47−
48−then a typical database will find the file representing the relation, find some free space in it and save the new tuple along with the MVCC transaction identifier. Subsequent transactions will find the tuple and compare it to their own transaction id in order to determine its "visibility". Project:M36, on the other hand, after validating that all relational constraints (such as primary and foreign keys) still hold, will simply serialize and append the expression to the transaction graph log. By default, there is no file representing the relation.
49−
50−For those familiar with Haskell, note how serializing the update expression is similar to being able to serialize a thunk or deferred execution.
51−
52−The transaction graph also allows users to travel back to previously-committed transactions. This may be useful for audit logging or alternative schemas.
53−
54−## Storage Representations
55−
56−Given the ever-growing transaction graph based on state changes, let's examine how Project:M36 services subsequent queries.
57−
58−## Benefits
59−
60−The primary goal of a database should be to ensure data integrity. Project:M36 takes no shortcuts in achieving this goal, but choosing a backend architecture which minimizes the time which it takes to get the transaction to non-volatile storage (disk) by storing update expressions rather than attempting to shuffle tuples on disk. This architecture open the door to many optimization techniques, many of which are new to databases.
61−
62−### Multiple On-Disk Representations
63−
64−The promise of data independence allows database backends to store relations as they see fit. That can include any number of on-disk representations including none at all. For example, for a table accessed by multiple projections, the database may choose to materialize the relation in those projections. The representations are therefore created in service to the queries submitted or anticipated instead of being based on past update expressions. Because on-disk storage is obviously limited, the database must decide what is valuable to keep around for future queries. This could open a new area of research into the appropriate machine learning algorithms, but, fundamentally, this set of materialized query responses is effectively a cache which can always be refreshed.
65−
66−The alternative representations need not be a direct answer to queries- for example, a materialized relation from a transaction could be used to service a query from a later transaction if the updates since that transaction are applied.
67−
68−The database could also anticipate, for example, scheduled queries and actually materialize relations before the query is executed. On-disk cache could represent "denormalized" tuple sets while the user-facing interface shows a properly normalized schema, thereby supporting data independence.
69−
70−More research in determining just what should be in the cache is needed.
71−
72−### Transactional Commits in O(1) Time
73−
74−Because the Project:M36 backend need not save tuples into a specific file representing a relation, the backend can drastically reduce the amount of time needed to commit a transaction to disk. Specifically, following constraint validation (which can often be done in constant or logarithmic time relative to the tuple count), the fastest means of committing the transaction is to save the update expression itself. Since the previous state has already been presumably committed, any idempotent operation can be saved for deferred execution. This means that transactions can be committed to disk relative to the size of the update expression rather than the number of the tuples affected- committing can occur at a rate relative to that of update expression size (typically a few kilobytes) rather than relative to the number of tuples that the update expression happened to alter.
75−
76−This technique gets transactions to disk faster, thus drastically increasing the rate transactions can be committed overall. Note that the execution of the update expression may be deferred by this process, so the cost to evaluate it may occur later, but this processing may be performed in the background after the transaction is committed. When the data is never requested, for example, for a defunct transaction graph branch, the actual execution could be deferred indefinitely, incurring zero cost to calculate the consquence of the update.
77−
78−### Less Disk Usage
79−
80−Because Project:M36 stores a stream of update expressions rather than tuples themselves, the minimum storage requirements for a given database may be reduced. For example, if a relation with an attribute `x` of type `Integer` has 1,000,000 tuples, a subsequent update to increment all 1,000,000 values by one may be cheaper to evaluate on-demand rather than immediately generating 1,000,000 new tuples and saving them to disk. If the new tuples are requested, the database can determine that the tuples are not materialized, calculate them, and return them, all without ever having the tuples on disk. Furthermore, if only a subset of the tuples are ever requested, for example, due to a query restriction, then some of the tuples may never need to be calculated or materialized.
81−
82−### Audit Logging
83−
84−Typical databases implement various strategies for audit logging, including:
85−
86−* exposing MVCC-like values such as tuple "created at" and "created by" to the user and forcing all tables to be insert-only
87−* shuttling audit logs to a secondary database
88−
89−Project:M36, through its inherent ability to travel the append-only transaction graph, enables audit-logging by allowing users to checkout previous transaction states. Committed transaction states are immutable, so no relation pollution or secondary database is necessary.
90−
91−### Selective Caching
92−
93−Typical databases materialize entire tuple sets representing each named relation (relation variable), but there is nothing special about relations that happen to be named. Data independence allows us to cache answers to common or even anticipated queries- this allows the schema to be normalized and unmaterialized while the *denormalized* query results are materialized cached. This flexibility saves disk space and allows the cache to be much more dynamic than in a typical DBMS.
94−
95−### Never-Materialized Tuples Replace Partitions
96−
97−Queries on very large relations often very often restricted (filtered by tuple) to generate subsets which are often partitioned, for example, by an event's date. Instead of requiring DBMS users to manually partition and slice their data in one, fixed, particular way, Project:M36's cacheing system will only cache those tuples that serve the interests of the queries. With something like an LRU cache, a data independent architecture will naturally cache "partitions" of the full relation without manual intervention.
98−
99−### Elimination of DBA role
100−
101−Databases essential to a business function are often guarded by a human database administrator (DBA) whose role it is to monitor database performance and to play gatekeeper to database schema changes as the database grows. This role is necessary because database tuning can be an arcane skill, rife with pitfalls for those who don't know the database software inside-and-out. This is a direct cause of data dependence, forcing DBAs to manually enforce data partitioning and shuffling data to different servers, configuring database replicas, and making Faustian bargains to "denormalize" tables for analytical workloads.
102−
103−A data independent architecture eliminates this role by allowing the database to make the optimal choices itself. This means that the database can respond to schema changes immediately, without manual repartitioning or denormalization steps.
104−
105−## Conclusion
106−
107−Project:M36's backend architecture enables new optimizations and features that are sorely lacking in existing DBMSes. By leveraging its novel transaction graph and deferred evaluation, Project:M36 handles more DBMS use-cases.
108−
109−Project:M36's novel architecture opens the door for further database and algorithmic research.
docs/database_context_functions.markdown+1−51
@@ -6,7 +6,7 @@ While "atom functions" operate on individual values and return new values (atoms
6
6
7Other DBMS software may include a similar feature called "stored procedures". However, "stored procedures" are stored outside the transaction stream and are not versioned by the database as in Project:M36.
7Other DBMS software may include a similar feature called "stored procedures". However, "stored procedures" are stored outside the transaction stream and are not versioned by the database as in Project:M36.
8
8
9−In order to use compile functions at runtime in Project:M36, be sure to build your own Project:M36 library so that the optional scripting is enabled. Alternatively, precompiled database context functions can be loaded from object files.
9+In order to use this feature in Project:M36, be sure to build your own Project:M36 library so that the optional scripting is enabled.
10
10
11## Database Context Function Types
11## Database Context Function Types
12
12
@@ -112,56 +112,6 @@ executeDatabaseContextExpr sessionId dbconn (ExecuteDatabaseContextFunction func
112```
112```
113from the same module.
113from the same module.
114
114
115−## Loading Precompiled Modules
116−
117−Database context functions compiled with GHC to object files can be loaded at runtime. Let's walk through an example:
118−
119−```haskell
120−module DynamicDatabaseContextFunctions where
121−import ProjectM36.Base
122−import ProjectM36.Relation
123−import ProjectM36.DatabaseContextFunctionError
124−import qualified ProjectM36.Attribute as A
125−
126−import qualified Data.Map as M
127−
128−
129−someDBCFunctions :: [DatabaseContextFunction]
130−someDBCFunctions = [DatabaseContextFunction {
131− dbcFuncName = "addtestrel",
132− dbcFuncType = [],
133− dbcFuncBody = DatabaseContextFunctionBody Nothing addTestRel
134− }]
135− where
136− addTestRel _ ctx = do
137− let attrs = A.attributesFromList [Attribute "word" TextAtomType]
138− eRel = mkRelationFromList attrs [[TextAtom "nice"]]
139− case eRel of
140− Left err -> Left (DatabaseContextFunctionUserError (show err))
141− Right testRel ->
142− pure $ ctx { relationVariables = M.insert "testRel" testRel (relationVariables ctx) }
143−```
144−
145−The function returns a list of `DatabaseContextFunction`s (just one in this case). The function adds a relation variable to the current database context.
146−
147−Compile it with GHC:
148−
149−```
150−cabal exec ghc -- examples/DynamicDatabaseContextFunctions.hs -package project-m36
151−```
152−
153−or invoked GHC via stack.
154−
155−Finally, connect to your database with `tutd` and load the module:
156−
157−```
158−TutorialD (master/main): loaddatabasecontextfunctions "DynamicDatabaseContextFunctions" "someDBCFunctions" "examples/DynamicDatabaseContextFunctions.o"
159−```
160−
161−If the load reports an "unknown symbol" error, double check that the installed "project-m36" package is identical to one used to link the Haskell module.
162−
163−Note that such functions do not survive a server restart; this will likely be improved in a future release.
164−
165## Future Improvements
115## Future Improvements
166
116
167There are likely a variety of convenience functions which would make sense in the context of the scripted function. If you have ideas for such functions, please open a GitHub issue.
117There are likely a variety of convenience functions which would make sense in the context of the scripted function. If you have ideas for such functions, please open a GitHub issue.
docs/dataframes.markdowndeleted−53
@@ -1,53 +0,0 @@
1−# Project:M36 DataFrames
2−
3−Users of typical relational algebra engines have come to expect sorting and limiting of query results despite the fact that relations do not support ordering. To that end, Project:M36 supports converting relations to "data frames" to support sorting on attributes and limiting the maximum tuple count in the result set.
4−
5−The equivalent feature in SQL is invoked by the `ORDER BY`, `LIMIT`, and `OFFSET` clauses.
6−
7−## Usage
8−
9−From within the `tutd` console, converting a relation to be sorted as a data frame is invoked using the `:showdataframe` command.
10−
11−```
12−:showdataframe <relational expression> orderby {<attribute {ascending,descending}>} {offset <num>} {limit <num>}
13−```
14−
15−The default sort order is `ascending`.
16−
17−## Examples
18−
19−```
20−TutorialD (master/main): :showdataframe s orderby {status}
21−┌──┬───────────┬─────────┬────────────┬────────────────┐
22−│DF│city::Text↕│s#::Text↕│sname::Text↕│status::Integer⬆│
23−├──┼───────────┼─────────┼────────────┼────────────────┤
24−│1 │"Paris" │"S2" │"Jones" │10 │
25−│2 │"London" │"S1" │"Smith" │20 │
26−│3 │"London" │"S4" │"Clark" │20 │
27−│4 │"Athens" │"S5" │"Adams" │30 │
28−│5 │"Paris" │"S3" │"Blake" │30 │
29−└──┴───────────┴─────────┴────────────┴────────────────┘
30−TutorialD (master/main): :showdataframe s{status} orderby {status}
31−┌──┬────────────────┐
32−│DF│status::Integer⬆│
33−├──┼────────────────┤
34−│1 │10 │
35−│2 │20 │
36−│3 │30 │
37−└──┴────────────────┘
38−TutorialD (master/main): :showdataframe s{status} orderby {status descending} limit 1
39−┌──┬────────────────┐
40−│DF│status::Integer⬇│
41−├──┼────────────────┤
42−│1 │30 │
43−└──┴────────────────┘
44−TutorialD (master/main): :showdataframe s{status} orderby {status descending} offset 1 limit 3
45−┌──┬────────────────┐
46−│DF│status::Integer⬇│
47−├──┼────────────────┤
48−│1 │20 │
49−│2 │10 │
50−└──┴────────────────┘
51−
52−```
53−The arrow in the attributes indicates the sort order while the DF column indicates the row number based on the sort order. Column ordering can also be arbitrary.
docs/filesystem-persistence.markdown+1−1
@@ -1,4 +1,4 @@
1−# Project-M36 Filesystem Persistence (Change Proposal)
1+# Project-M36 Filesystem Persistence
2
2
3## Introduction
3## Introduction
4
4
docs/import_export_csv.markdowndeleted−65
@@ -1,65 +0,0 @@
1−# Project:M36 CSV Import/Export
2−
3−Project:M36's `tutd` console supports the import and export of CSV files as a lowest-common denominator format for moving data. Because the CSV file format does not support all the features of Project:M36- most notably, nested relations- not all relation variables can be marshalled to-and-from CSV files.
4−
5−## CSV Export
6−
7−If a relation variable cannot be exported due to data types which are not supported by the CSV format- such as with a nested relation- then Project:M36 throws an error rather than export a partial file.
8−
9−### Example Export
10−
11−```
12−TutorialD (master/main): :importexample cjdate
13−TutorialD (master/main): :exportcsv s "/tmp/csv"
14−```
15−```
16−$ cat /tmp/csv
17−s#,sname,status,city
18−S2,Jones,10,Paris
19−S1,Smith,20,London
20−S4,Clark,20,London
21−S5,Adams,30,Athens
22−S3,Blake,30,Paris
23−```
24−
25−## CSV Import
26−
27−An import is equivalent to an insert and does not replace the target relation variable.
28−
29−Because relations do not have a natural ordering for their attributes, the CSV file to import must contain a header row which matches the names of attributes.
30−
31−If a value in the CSV file cannot be converted to the expected type (determined by the existing relation attributes), then the entire import is aborted rather than perform a partial import.
32−
33−### Example Import
34−```
35−$ cat /tmp/csv
36−s#,sname,status,city
37−S6,Samson,100,New York
38−```
39−```
40−TutorialD (master/main): :importexample cjdate
41−TutorialD (master/main): :showexpr s
42−┌──────────┬────────┬───────────┬───────────────┐
43−│city::Text│s#::Text│sname::Text│status::Integer│
44−├──────────┼────────┼───────────┼───────────────┤
45−│"Paris" │"S2" │"Jones" │10 │
46−│"Paris" │"S3" │"Blake" │30 │
47−│"London" │"S4" │"Clark" │20 │
48−│"London" │"S1" │"Smith" │20 │
49−│"Athens" │"S5" │"Adams" │30 │
50−└──────────┴────────┴───────────┴───────────────┘
51−TutorialD (master/main): :importcsv "/tmp/csv" s
52−TutorialD (master/main): :showexpr s
53−┌──────────┬────────┬───────────┬───────────────┐
54−│city::Text│s#::Text│sname::Text│status::Integer│
55−├──────────┼────────┼───────────┼───────────────┤
56−│"Paris" │"S3" │"Blake" │30 │
57−│"London" │"S4" │"Clark" │20 │
58−│"New York"│"S6" │"Samson" │100 │
59−│"Athens" │"S5" │"Adams" │30 │
60−│"London" │"S1" │"Smith" │20 │
61−│"Paris" │"S2" │"Jones" │10 │
62−└──────────┴────────┴───────────┴───────────────┘
63−```
64−
65−Note that relations do not have ordering, thus, no ordering from the CSV file is preserved.
docs/introduction_to_projectm36.markdown+14−35
@@ -1,7 +1,7 @@
1# Introduction to Project:M36
1# Introduction to Project:M36
2
2
3## What is Project:M36?
3## What is Project:M36?
4−Project:M36 is a relational-algebra-based database management system. It can be used as a production-level database backend or for learning more about the relational algebra.
4+Project:M36 is a relational-algebra-based database management system. It can be used a production-level database backend or for learning more about the relational algebra.
5
5
6The principled mathematical approach to Project:M36's design sets it apart from competing DBMSs. Specifically, Project:M36 adheres strongly to the mathematics of the relational algebra and makes no compromises nor apologies in doing so. To that end, Project:M36 is implemented in the programming language "Haskell" which is itself based on the lambda calculus.
6The principled mathematical approach to Project:M36's design sets it apart from competing DBMSs. Specifically, Project:M36 adheres strongly to the mathematics of the relational algebra and makes no compromises nor apologies in doing so. To that end, Project:M36 is implemented in the programming language "Haskell" which is itself based on the lambda calculus.
7
7
@@ -15,59 +15,38 @@ The relational algebra is the mathematical model underpinning Project:M36. When
15
15
16## Binary Releases
16## Binary Releases
17
17
18−The quickest and preferred method of installation is via docker, which works on Linux, macOS, and Windows. Docker downloads and runs preconfigured software in secure, sandboxed containers, preventing third-party software from altering the host system without your permission.
18+### Windows
19+Project:M36 now provides binary installations for Windows. Check the (releases page)[https://github.com/agentm/project-m36/releases] for downloads.
19
20
20−### Install Docker:
21+### MacOS X
21
22
22−* [Windows 10 Docker Installation](https://docs.docker.com/docker-for-windows/wsl/)
23+Binary releases are not yet available for MacOS X, but compiling from source is easy.
23−* [MacOS Docker Installation](https://docs.docker.com/docker-for-mac/install/)
24−* [Linux Docker Installation](https://docs.docker.com/engine/install/#server)
25
24
26−### Run TutorialD from Docker Image
25+### Linux
27
26
28−This downloads the docker image tagged "latest" and runs `tutd`, the TutorialD command line interface. Try the [15-Minute TutorialD Tutorial](15_minute_tutorial.markdown) and try some expressions.
27+The currently-preferred method of installation is from source. A future enhancement would be installation from deb or rpm.
29−
30−```bash
31−docker run -it projectm36/project-m36 tutd
32−```
33−
34−### Run Project:M36 Server
35−
36−The default port for the project-m36 server is 6543.
37−
38−```bash
39−docker run --network host projectm36/project-m36 project-m36-server -n <database_name>
40−```
41−
42−### Connect to Project:M36 Server
43−
44−```bash
45−docker run --network host projectm36/project-m36
46−```
47
28
48## Source Installation
29## Source Installation
49
30
50Requirements:
31Requirements:
51
32
52−To build with stack:
53−
54−* [GHC 8.6.5 or greater](https://www.haskell.org/downloads)
33+* [GHC 7.10 or greater](https://www.haskell.org/downloads)
55* [Haskell stack](https://docs.haskellstack.org/en/stable/README/)
34* [Haskell stack](https://docs.haskellstack.org/en/stable/README/)
56−* Linux, macOS, or Microsoft Windows
35+* Linux, MacOS X, or Windows OS
57
36
58Compilation steps:
37Compilation steps:
59
38
60* ```git clone https://github.com/agentm/project-m36```
39* ```git clone https://github.com/agentm/project-m36```
61* ```cd project-m36```
40* ```cd project-m36```
62−* ```stack --stack-yaml stack.ghc8.6.yaml build```
41+* ```stack build```
63
42
64At this point, the TutorialD interactive interpreter can be run using ```stack exec tutd```.
43At this point, the TutorialD interactive interpreter can be run using ```stack exec tutd```.
65
44
66−Alternative building with GHC 8.6.5 or greater:
45+Alternative building with GHC 8.0.x:
67
46
68* ```cabal new-build```
47* ```cabal new-build```
69
48
70−The resultant binaries can be found in ```./dist-newstyle/build/project-m36-<version>/build```.
49+The resultant binaries can be found in ```./dist-newstyle/build/project-m36-0.1/build```.
71
50
72## Accessing Project:M36 Databases
51## Accessing Project:M36 Databases
73
52
@@ -86,7 +65,7 @@ In addition to being a relational algebra engine, Project:M36 supports features
86
65
87Most DBMSs provide a way to allow the user to specify atomic database state changes. These changes are often wrapped up as "transactions" which, when applied to the database state, offer the illusion of sequential and grouped, atomic changes applied to the databases. Often the only state which can be queried is the snapshot at the time the transaction is opened.
66Most DBMSs provide a way to allow the user to specify atomic database state changes. These changes are often wrapped up as "transactions" which, when applied to the database state, offer the illusion of sequential and grouped, atomic changes applied to the databases. Often the only state which can be queried is the snapshot at the time the transaction is opened.
88
67
89−Project:M36 extends this transaction model with the "transaction graph". This feature can be adequately described as version control for transactions. In the legacy DBMS model, the transactions are added to a linear transaction stream where each client is contending over the "head" of the stream- the latest transactions. In the transaction graph model, clients can add named branches and add transactions to the branches, then merge changes back, if necessary.
68+Project:M36 extends this transaction model with the "transaction graph". This feture can be adequately described as version control for transactions. In the legacy DBMS model, the transactions are added to a linear transaction stream where each client is contending over the "head" of the stream- the latest transactions. In the transaction graph model, clients can add named branches and add transactions to the branches, then merge changes back, if necessary.
90
69
91This feature is useful, for example:
70This feature is useful, for example:
92* during testing- create a testing branch which production will never see. This obviates the need for a separate production data set.
71* during testing- create a testing branch which production will never see. This obviates the need for a separate production data set.
@@ -108,7 +87,7 @@ Decreasing a transaction's durability can reduce IO contention at the cost of re
108
87
109### Native Haskell Compatibility
88### Native Haskell Compatibility
110
89
111−Any Haskell data type which implements the ```Atomable``` typeclass can be manipulated as a value in the database.
90+Any Haskell data type which implements the ```Atom``` typeclass can be manipulated as a value in the database.
112
91
113Haskell functions which operate on those values can also be added to the database.
92Haskell functions which operate on those values can also be added to the database.
114
93
docs/introduction_to_the_relational_algebra.markdown+2−2
@@ -202,7 +202,7 @@ Join (Instructor relation)
202
202
203(Course Relation)
203(Course Relation)
204
204
205−|(Course Name, Course Name Type)|(Instructor Name, Instructor Name Type)|(Course Room Number, Room Number Type)|
205+|(Course Name, Course Name Type)|(Instructor, Instructor Name Type)|(Course Room Number, Room Number Type)|
206|-------------------------------|----------------------------------|--------------------------------------|
206|-------------------------------|----------------------------------|--------------------------------------|
207|English 1|Steve|Room 104|
207|English 1|Steve|Room 104|
208|French 2|Bob|Room 103|
208|French 2|Bob|Room 103|
@@ -378,7 +378,7 @@ Since a value can store any (immutable) type, it can certainly hold a relation.
378
378
379For example, in SQL, if one wants to collect some aggregate data over some tuples while still returning the individual tuples, in the best case, the aggregate information must be repeated for every individual tuple. In the worst case, two separate queries are required since nested tables are not supported.
379For example, in SQL, if one wants to collect some aggregate data over some tuples while still returning the individual tuples, in the best case, the aggregate information must be repeated for every individual tuple. In the worst case, two separate queries are required since nested tables are not supported.
380
380
381−In the relational algebra, The aggregate value can be placed alongside the relation value from which the aggregate was derived.
381+In the relational algebra, The aggregate value can be placed alongside the relation value from whic the aggregate was derived.
382
382
383Example:
383Example:
384
384
docs/merkle_transaction_graph.markdowndeleted−33
@@ -1,33 +0,0 @@
1−# Project:M36: Merkle Hashing for Transaction Graph
2−
3−## Introduction
4−
5−Project:M36 supports an append-only transaction graph model (similar to git) whereby new transactions can be added to the graph but not removed. As with any graph, each node can contain a Merkle hash which ensures not only that it's state since being added to the graph has not changed but also that none of its parent nodes all the way to the root node (initial state) have not been modified. This validation has a number of use cases.
6−
7−## Usage
8−
9−Project:M36 automatically adds Merkle hashes to every transaction. All data which represents the database state at that transaction is included in the hash including (but not limited to) relation variable definitions, atom and database context functions, constraints, and types.
10−
11−Project:M36 validates all merkle hashes at database startup. For users who need validation after the database is started, the user can issue `:validatemerklehashes` at the `tutd` command line.
12−
13−### Audit Logging
14−
15−Project:M36 supports audit logging by allowing users to travel to transactions in the past and recreate the database state at that past point-in-time. To ensure that those past states cannot be modified either by malicious on-disk or in-memory changes, each transaction is protected by its own Merkle hash. If the calculated hash does not match the stored hash, Project:M36 can immediately report which transaction triggered the tamper-proof log.
16−
17−### Reproducibility
18−
19−Since a Merkle tree is effectively immutable except to add more nodes, it can be used to save and restore a whole database with very high confidence in the results. This feature could also be used to restore a database partially; for example, to duplicate just the latest database state on a second machine for OLAP analysis.
20−
21−### High-Availability
22−
23−Merkle tree hashes can be used to assert database integrity across high-availibility or database replication. Since the hash covers all database state, it can be used to validate log-shipping-based replication. Corrupted cache tuple data can be easily detected and flushed.
24−
25−## Merkle Hashes in Other DBMSes
26−
27−While Merkle hashes have become prevalent in blockchain-style databases, they have not made many appearances in typical SQL databases. This is likely due to the fact that such databases consider any additional operations against the large tuple stores as prohibitively expensive. Project:M36 is able to skirt this cost by only hashing database update expressions rather than the result of these executed expressions. This also means that the Merkle hash can be computed against transactions which have been created but never executed.
28−
29−## Conclusion
30−
31−Merkle hashes are an obvious improvement to any graph-based transaction log and are a low-cost method of ensuring data integrity.
32−
33−A further improvement could allow users to specify an initial key provided by an admin user to salt the hash used to create the database. Additionally, a multi-user system could allow individual users to sign their committed transactions. The signature would then be included in the Merkle hash.
docs/new_datatypes.markdown+1−1
@@ -106,6 +106,6 @@ The essential ```Atomable``` typeclass functions are:
106| ```toAtomType :: Proxy a -> AtomType``` | generate a database AtomType for a Haskell datatype |
106| ```toAtomType :: Proxy a -> AtomType``` | generate a database AtomType for a Haskell datatype |
107| ```toAddTypeExpr :: Proxy a -> DatabaseContextExpr``` | generate a ```DatabaseContextExpr``` which can be executed against a database context in order to add the new type |
107| ```toAddTypeExpr :: Proxy a -> DatabaseContextExpr``` | generate a ```DatabaseContextExpr``` which can be executed against a database context in order to add the new type |
108
108
109−In addition, basic Haskell data types like ```Int```, ```Double```, ```Text```, ```Day```, ```Bool```, ```UTCTime```, and ```ByteString``` already have `Atomable` instances ready-to-go. In addition, an ```Atomable``` instance is available for lists: ```Atomable a => [a]```, though one should be very careful not to use this in a common anti-pattern. Typically, it makes more sense to store one-to-many relationships as discrete relation variables; when storing them as lists, one gives up the various query capabilities and optimizations of the relational algebra.
109+In addition, basic Haskell data types like ```Int```, ```Double```, ```Text```, ```Day```, ```Bool```, ```UTCTime```, and l```ByteString``` already have `Atomable` instances ready-to-go. In addition, an ```Atomable``` instance is available for lists: ```Atomable a => [a]```, though one should be very careful not to use this in a common anti-pattern. Typically, it makes more sense to store one-to-many relationships as discrete relation variables; when storing them as lists, one gives up the various query capabilities and optimizations of the relational algebra.
110
110
111To be clear, these data types are not black boxes once stored in the database. These new types can be scanned and manipulated by Haskell scripts which can be created at runtime. For more information, read about [```AtomFunction```s](/docs/atomfunctions.markdown).
111To be clear, these data types are not black boxes once stored in the database. These new types can be scanned and manipulated by Haskell scripts which can be created at runtime. For more information, read about [```AtomFunction```s](/docs/atomfunctions.markdown).
docs/reaching_out_of_the_tarpit.markdown+1−1
@@ -57,7 +57,7 @@ Project:M36 implements multiple interfaces:
57To understand how Project:M36 stacks up against the fictional programming language shown in the paper, we have implemented the [example from the paper](/examples/out_of_the_tarpit.tutd). The language used in the script is a dialect of Chris Date's TutorialD language. It can be loaded into an interactive ```tutd``` session like so:
57To understand how Project:M36 stacks up against the fictional programming language shown in the paper, we have implemented the [example from the paper](/examples/out_of_the_tarpit.tutd). The language used in the script is a dialect of Chris Date's TutorialD language. It can be loaded into an interactive ```tutd``` session like so:
58
58
59```
59```
60−TutorialD (master/main): :importexample cjdate
60+TutorialD (master/main): :importexample date
61TutorialD (master/main): :showexpr p
61TutorialD (master/main): :showexpr p
62┌───────────────────┬────────────┬───────────────────┬────────────┬────────────┐
62┌───────────────────┬────────────┬───────────────────┬────────────┬────────────┐
63│address::Address │agent::Agent│dateRegistered::Day│photo::Text │price::Price│
63│address::Address │agent::Agent│dateRegistered::Day│photo::Text │price::Price│
docs/server_mode.markdown+1−1
@@ -8,7 +8,7 @@ While Project:M36 is easy-to-use as an interactive, in-process database manageme
8
8
9To start the Project:M36 server to serve the local host with a database named "mydbname", run ```cabal run project-m36-server -- --database mydbname --hostname 127.0.0.1``` in the project-m36 source directory. The double-dash indicates that the arguments should be passed to ```project-m36-server``` instead of ```cabal```. Under normal conditions, this command will print nothing and block indefinitely to serve incoming requests on the default port 6543.
9To start the Project:M36 server to serve the local host with a database named "mydbname", run ```cabal run project-m36-server -- --database mydbname --hostname 127.0.0.1``` in the project-m36 source directory. The double-dash indicates that the arguments should be passed to ```project-m36-server``` instead of ```cabal```. Under normal conditions, this command will print nothing and block indefinitely to serve incoming requests on the default port 6543.
10
10
11−Note that the above invocation will serve an in-memory, transient "mydbname" database. The database is deleted when the server exits. To serve a database with filesystem persistence, invoke ```cabal run project-m36-server -- --database mydbname --hostname 127.0.0.1 --database-directory /path/to/dbdirectory --fsync```.
11+Note that the above invocation will serve and in-memory, transient "mydbname" database. The database is deleted when the server exits. To serve a database with filesystem persistence, invoke ```cabal run project-m36-server -- --database mydbname --hostname 127.0.0.1 --database-directory /path/to/dbdirectory --fsync```.
12
12
13## Connecting an Interactive Client
13## Connecting an Interactive Client
14
14
docs/transaction_graph_operators.markdown+18−8
@@ -10,11 +10,23 @@ When a new database is created, a new transaction graph is created for it with o
10
10
11As the user interactively alters the database context such as by adding a new relation variable, the database context is no longer equal to that of the first transactions. This is called "database context divergence" because many of the same components exist in both the updated context and the context of the first transaction.
11As the user interactively alters the database context such as by adding a new relation variable, the database context is no longer equal to that of the first transactions. This is called "database context divergence" because many of the same components exist in both the updated context and the context of the first transaction.
12
12
13−![Initial database starting state](http://g.gravizo.com/g?%20digraph%20G%20{%20base[label=%22base%20transaction%22,shape=rectangle];%20new[label=%22mutable%20database%20context%22];%20new%20-%3E%20base;%20})
13+![Initial database starting state](http://g.gravizo.com/g?
14+digraph G {
15+ base[label="base transaction",shape=rectangle];
16+ new[label="mutable database context"];
17+ new -> base;
18+})
14
19
15Once the user decides that the changes in the updated database context are worth adding to the transaction graph, the user issues a "commit" request. The commit operation converts the current database context into a new transaction which is then added to the graph with the parent transaction set to the same parent transaction as the database context. The user's mutable database context is shifted to be a copy of the context of the newly-committed transaction.
20Once the user decides that the changes in the updated database context are worth adding to the transaction graph, the user issues a "commit" request. The commit operation converts the current database context into a new transaction which is then added to the graph with the parent transaction set to the same parent transaction as the database context. The user's mutable database context is shifted to be a copy of the context of the newly-committed transaction.
16
21
17−![Freshly committed transaction](http://g.gravizo.com/g?%20digraph%20G%20{%20base[label=%22base%20transaction%22,shape=rectangle];%20discon[label=%22mutable%20database%20context%22];%20fresh[label=%22newly%20committed%20transaction%22,shape=rectangle];%20fresh%20-%3E%20base;%20discon%20-%3E%20fresh;%20})
22+![Freshly committed transaction](http://g.gravizo.com/g?
23+digraph G {
24+ base[label="base transaction",shape=rectangle];
25+ discon[label="mutable database context"];
26+ fresh[label="newly committed transaction",shape=rectangle];
27+ fresh -> base;
28+ discon -> fresh;
29+})
18
30
19It can be handy to attempt to modify the database without altering the data that others may wish to continue to use and modify. If a set of transactions may diverge from another use-case for the data, the user may choose to "branch" the transaction graph. Branching allows the user to assign an arbitrary name to a series of transactions and then potentially merge the set of transactions back to the originating branch. Project:M36 creates a "master" branch when the transaction graph is first created.
31It can be handy to attempt to modify the database without altering the data that others may wish to continue to use and modify. If a set of transactions may diverge from another use-case for the data, the user may choose to "branch" the transaction graph. Branching allows the user to assign an arbitrary name to a series of transactions and then potentially merge the set of transactions back to the originating branch. Project:M36 creates a "master" branch when the transaction graph is first created.
20
32
@@ -43,17 +55,15 @@ TutorialD (master/main): :rollback
43In order to navigate the transaction graph, one must specify transaction UUIDs. Viewing the entirety of the transaction graph as a relation is a single command.
55In order to navigate the transaction graph, one must specify transaction UUIDs. Viewing the entirety of the transaction graph as a relation is a single command.
44
56
45```
57```
58+TutorialD (master/main): :showgraph
46−┌─────────────┬────────────────────────────────────────────┬──────────┬──────────────────────────────────────┬────────────────────────────────────────┬─────────────────────────────────┐
59+┌─────────────┬──────────┬──────────────────────────────────────┬────────────────────────────┬──────────────────────────────┐
47−│current::Bool│hash::ByteString │head::Text│id::Text │parents::relation {id::Text} │stamp::DateTime │
60+│current::Bool│head::Text│id::Text │parents::relation {id::Text}│stamp::DateTime │
48−├─────────────┼────────────────────────────────────────────┼──────────┼──────────────────────────────────────┼────────────────────────────────────────┼─────────────────────────────────┤
61+├─────────────┼──────────┼──────────────────────────────────────┼────────────────────────────┼──────────────────────────────┤
49−
50
62
51<big result elided>
63<big result elided>
52```
64```
53The "current" attribute is a boolean value. If true, the transaction is the parent of the current database context. Commits will be children of this transaction.
65The "current" attribute is a boolean value. If true, the transaction is the parent of the current database context. Commits will be children of this transaction.
54
66
55−The "hash" attribute contains the merkle tree hash for the given transaction. This can be used to ensure that the transaction graph has been used in an append-only fashion, ensuring historical state and audit log integrity.
56−
57The "head" attribute is a boolean value indicating whether or not the transaction is a "head" node of its graph. Head nodes are nodes which have no children.
67The "head" attribute is a boolean value indicating whether or not the transaction is a "head" node of its graph. Head nodes are nodes which have no children.
58
68
59The "id" attribute is the UUID needed in order to navigate the graph.
69The "id" attribute is the UUID needed in order to navigate the graph.
docs/tupleable.markdown−23
@@ -23,35 +23,12 @@ instance Tupleable Person
23
23
24Now, ```Person``` values can be marshaled between the database and the client. The attribute names appearing in the Haskell data type will appear identically in the server with the same types.
24Now, ```Person``` values can be marshaled between the database and the client. The attribute names appearing in the Haskell data type will appear identically in the server with the same types.
25
25
26−### Changing Options
27−
28−If our field names don't exactly match attribute names, but follow a common pattern, we can derive Tupleable with custom options. Let's say each field on person has a prefix "person", but we still want to use the attribute names without the prefix. We can make use of the ProjectM36.Tupleable module to accomplish our goal like so:
29−
30−```haskell
31−import ProjectM36.Tupleable.Deriving
32−
33−data Person = Person {
34− personName :: Text,
35− personEmployeeNumber :: Int,
36− personLikesHorses :: Bool
37− }
38− deriving stock Generic
39− deriving Tupleable
40− via Codec (Field (DropPrefix "person" >>> CamelCase)) Person
41−```
42−
43−The extensions DerivingGeneric, DerivingVia, TypeOperators, and DataKinds must be enabled for this code to compile. See the documentation on Hackage for all available options.
44−
45## Usage
26## Usage
46
27
47The ```Tupleable``` module includes the following functions:
28The ```Tupleable``` module includes the following functions:
48
29
49 * ```toInsertExpr :: forall a t. (Tupleable a, Traversable t) => t a -> RelVarName -> Either RelationalError DatabaseContextExpr```
30 * ```toInsertExpr :: forall a t. (Tupleable a, Traversable t) => t a -> RelVarName -> Either RelationalError DatabaseContextExpr```
50 * creates an ```Insert``` expression which can be used to insert a set of ```Tupleable``` values into the relation variable named by the ```RelVarName```
31 * creates an ```Insert``` expression which can be used to insert a set of ```Tupleable``` values into the relation variable named by the ```RelVarName```
51− * ```toUpdateExpr :: forall a. Tupleable a => RelVarName -> [AttributeName] -> a -> Either RelationalError DatabaseContextExpr```
52− * create an `Update` expression which updates the tuples with the attribute values of the argument `Tupleable` using the list of attribute names as the key to the underlying relation variable
53− * ```toDeleteExpr :: forall a. Tupleable a => RelVarName -> [AttributeName] -> a -> Either RelationalError DatabaseContextExpr```
54− * create a `Delete` expression which will remove the tuples from the relation variable matching the values of the argument `Tupleable` using the attribute name list as the matching key
55 * ```toAttributes :: proxy a -> Attributes```
32 * ```toAttributes :: proxy a -> Attributes```
56 * generates ```Attributes``` from a ```Tupleable``` value- can be used with ```undefined```, so an actual value is not necessary
33 * generates ```Attributes``` from a ```Tupleable``` value- can be used with ```undefined```, so an actual value is not necessary
57 * ```toTuple :: a -> RelationTuple```
34 * ```toTuple :: a -> RelationTuple```
docs/tutd_cheatsheet.markdowndeleted−99
@@ -1,99 +0,0 @@
1−# Tutorial D Cheatsheet
2−
3−The following tables list examples of expressions for `tutd`, Project:M36's "Tutorial D" implementation.
4−
5−## Relational Expressions
6−
7−Relational expressions query database state without being able to change it.
8−
9−|Relational Expression |Description |
10−|------------------------------------------------------|---------------------------------------|
11−|`:showexpr p`|Display the relation variable `p`|
12−|`:showexpr s rename {city as town}`|Display the result after renaming a relational attribute|
13−|`:showexpr p{color,city}`|Display the result of the projection on the `color` and `city` attributes|
14−|`:showexpr p{all but city}`|Display the result of the projection of all attribute of `p` except `city`|
15−|`:showexpr p join sp`|Display the result of the relational expression `p` joined against `sp` (equivalent to `NATURAL JOIN` in SQL)|
16−|`:showexpr (s join sp){all from s}`|Display the result of a join but only include attributes from `s`|
17−|`:showexpr s semijoin sp`|Equivalent to `(s join sp){all from s}`|
18−|`:showexpr s antijoin sp`|Display the result of all tuples in `s` which do not match appear in the result of `s semijoin sp`|
19−|`:showexpr s union s`| Display the result of `s` unioned with itself (which is equivalent to `s`)|
20−|`:showexpr s:{status2:=add(10,@status)}`| Display the result of extending the `s` relation variable with a new attribute which adds 10 to each `status` attribute|
21−|`:showexpr s group ({sname,status,s#} as subrel)`| Display the result of grouping the `sname`, `status`, and `s#` into a subrel for each tuple in the `s` relation where the `city` attribute (not mentioned) is the grouping criteria|
22−|`:showexpr (s group ({sname,status,s#} as subrel)) ungroup subrel`| Display the result of unwrapping a subrelation to create one new tuple for each subrelation tuple in the result|
23−|`:showexpr s minus s`|Display the result after removing all tuples that match the second argument. `x minus x` is equivalent to `x where false`|
24−|`:showexpr relation{tuple{name "Mike",age 6},tuple{name "Sam",age 10}}`|Display an unnamed relation using manually constructed tuples|
25−|`:showexpr relation{a Integer, b Text}`|Display an empty-tupled relation of a specified type|
26−|`:showexpr relation{a Integer, b Text}{tuple{a 4, b "four"}}`|Display a relation bound by the specified types and containing one or more tuples|
27−|`:showexpr s group ({s#,sname,status} as subrel):{citycount:=count(@subrel)}`|Display a result which groups `s` by `city` and extends the relation by a count for each city.|
28−|`:showrelvars`|Display a list of relation variables in the current context along with their types (attributes)|
29−
30−## Built-In Types
31−
32−|Example Value Expression |Type |Explanation|
33−|------------------------------------------------------|---------------------------------------|-----------|
34−|`"abc"`|Text|UTF-8 string|
35−|`123`|Integer|an integer of limitless size (using gmp)|
36−|`int(456)`|Int|machine-word-based integer|
37−|`12.56`|Double|64-bit IEEE 754 floating point number|
38−|`dateTimeFromEpochSeconds(1502304846)`|DateTime||
39−|`fromGregorian(2017,05,30)`|Date||
40−|`t`|Bool|`t` or `f`|
41−|`bytestring("dGVzdGRhdGE=")`|Bytestring|base-64-encoded string of bytes|
42−|`interval(3,5,f,f)`|Interval(Integer)|the constructor function includes two bounds and two boolean flags for inclusiveness|
43−
44−## Database Context Expressions
45−
46−Database context expressions take the current database context as input and alter it to create a new
47−
48−|Database Context Expression |Description |
49−|------------------------------------------------------|---------------------------------------|
50−|`:importexample cjdate`|Imports a precooked schema from Chris Date's books resulting in relvars `s`, `sp`, and `p`|
51−|`:importtutd "file:///home/agentm/project-m36/scripts/emp.tutd"`|Imports TutorialD from file URI|
52−|`:importtutd "https://raw.githubusercontent.com/agentm/project-m36/master/scripts/emp.tutd" "effe32b247586dc3ac0079fc241b9618d41d189afcaeb7907edbe5a8b45992a4"`| Imports TutorialD from HTTP or HTTPS URI|
53−|`newrelvar:=relation{tuple{age 3}}`|Assign a new relation variable named `newrelvar`|
54−|`undefine s`|Remove a relation variable|
55−|`insert s relation{tuple{city "Boston",s# "S10",sname "Gonzalez",status 10}}`| Append to an existing relation variable with another relational expression|
56−|`update s where status=20 (sname:="Mr. Twenty")`|Replace one or more values in matching tuples with a new value|
57−|`delete sp where s#="S4"`|Remove tuples matching the criteria|
58−|`key s_key_constraint {s#} s`|Add a constraint named `s_key_constraint` on relation variable `s` ensuring that `s#` is unique|
59−|`foreign key s#_in_sp sp{s#} in s{s#}`|Add a foreign key constraint that ensures that `sp`'s `s#` attribute always references a `s#` value in `s`|
60−|`constraint s_status_less_than_50 (s where ^lt(50,@status)){} in false`|Add a constraint that stipulates that the `status` values in `s` are less than 50|
61−|`createarbitraryrelation employee {name Text, empid Int, hired DateTime} 3-100`|Create a relation variable with random values with between 3-100 tuples- useful for testing|
62−|`notify steve_change person where name="Steve" true (person where name="Steve"){address}`|Notify the current connection with an asynchronous event if any committed tuples matching `person where name="Steve"` with `true` for the pre-change state and `person where name="Steve"){address}` for the post-change state- these states will be sent along with the notification|
63−|`data Hair = Bald | Brown | Blond | OtherColor Text`|Create a new algebraic data type for use with values inside tuples|
64−|`undata Hair`|Delete the `Hair` custom type|
65−
66−
67−## Transaction Graph Expressions
68−
69−Transaction graph expressions alter the state of the transaction graph by append new states.
70−
71−|Transaction Graph Expression |Description |
72−|------------------------------------------------------|---------------------------------------|
73−|`:commit`|Save the current database context to a new transaction and add it to the transaction graph|
74−|`:rollback`|Return the database context to the state before any alterations were made|
75−|`:branch experimental`|Create a new branch from the existing branch and switch the current context to be able to commit to the new branch|
76−|`:jumphead master`|Discard any changes in the current context and jump to the head of a different branch|
77−|`:jump 11b601c9-f46b-42b0-a2ce-cf18ced31b7f`|Jump to the specific transaction by UUID- useful for introspecting past states|
78−|`:showgraph`|Display a representation of the transaction graph|
79−|`:walkbacktotime "2017-08-10 16:44:00"`|Walk back in time from the current branch until a transaction less than or equal to the time is found and switch the current context to that past transaction- useful for auditing|
80−
81−## Data Frame Expressions
82−
83−In contrast to relational expressions, data frame expressions generate ordered tuples.
84−
85−|Data Frame Expression |Description |
86−|------------------------------------------------------|---------------------------------------|
87−|`:showdataframe s orderby {status}`|Display a data frame result for the relational expression `s` and sort the tuples by `status`|
88−|`:showdataframe s{status} orderby {status descending} offset 1 limit 3`|Display a data frame result for `s{status}` but ordered by `status` values descending, skip the first tuple, and return no more than 3 tuples|
89−
90−## Trans-Graph Relational Expressions
91−
92−Trans-graph relational expressions allow queries spanning multiple transactions.
93−
94−|Trans-Graph Relational Expressions |Description |
95−|------------------------------------------------------|---------------------------------------|
96−|`:showtransgraphexpr s@master join sp@master`|Display a result for joining `s` and `sp` on the branch `master`|
97−|`:showtransgraphexpr s@master~ join sp@master`|Display a result for joining `s` on the parent transaction of `master`'s current head and `sp` on master|
98−|`:showtransgraphexpr s@master~^2`|Display a result for `s` two parents previous to the parent of the current `master`'s head|
99−
docs/tutd_tutorial.markdown+186−268
@@ -14,55 +14,20 @@ TutorialD (master/main):
14
14
15"master" refers to the name of the branch to which the current transaction will be potentially committing.
15"master" refers to the name of the branch to which the current transaction will be potentially committing.
16
16
17−### Date's Sample Relations
18−
19−The examples in this tutorial can be executed after loading Chris Date's sample relations using:
20−
21−```
22−:importexample cjdate
23−```
24−
25−Each section assumes a fresh instance of the Date examples. The relation variables created in the script are:
26−
27−|Relation Variable Name|Description|
28−|----------------------|-----------|
29−|s|suppliers|
30−|p|parts|
31−|sp|contains mapping of which suppliers supply which parts|
32−
33−### Importing TutorialD from Other Sources
34−
35−The `tutd` console can also run TutorialD from a local file or from a web server.
36−
37−To import TutorialD from a file:
38−
39−```
40−:importtutd "file:///home/agentm/project-m36/scripts/emp.tutd"
41−```
42−
43−or from a web server:
44−
45−```
46−:importtutd "https://raw.githubusercontent.com/agentm/project-m36/master/scripts/DateExamples.tutd" "db9f3d9fe06d0a29b8355e045b89ec94d6428e3a3de93def7ca77bf0298b7010"
47−```
48−
49−The second argument is an optional SHA256 hash in hexadecimal form. This can be used to validate that the script has not changed since the last import. Importing TutorialD from the web is in general safe because it is effectively sandboxed with "Safe Haskell" for functions, so the script is contained security-wise, however, nothing prevents the script from running forever. Downloading a schema from the web is a great way to share schemas and to kick start your project without starting from scratch.
50−
51### Types
17### Types
52
18
53TutorialD is strongly-typed. The basic built-in types are:
19TutorialD is strongly-typed. The basic built-in types are:
54
20
55|Type Name|Explanation|Example|
21|Type Name|Explanation|Example|
56|---------|-----------|-------|
22|---------|-----------|-------|
57−|Text|arbitrary text|"The Old Man and the Sea"|
23+|text|arbitrary text|"The Old Man and the Sea"|
58−|Integer|arbitarily-sized integer|-4|
24+|int|any integer|-4|
59−|Int|machine word integer|int(10)|
60−|DateTime|timestamp UTC|dateTimeFromEpochSeconds(1502304846)|
25+|datetime|timestamp UTC|dateTimeFromEpochSeconds(1502304846)|
61−|Date|calendar date|fromGregorian(2017,05,30)|
26+|date|calendar date|fromGregorian(2017,05,30)|
62−|Double|floating point number|3.1459|
27+|double|floating point number|3.1459|
63−|Bool|boolean value|t|
28+|bool|boolean value|t|
64−|Bytestring|arbitrary-length string of bytes- input is base64-encoded|bytestring("dGVzdGRhdGE=")|
29+|bytestring|arbitrary-length string of bytes- input is base64-encoded|bytestring("dGVzdGRhdGE=")|
65−|Interval x|interval/range type for ints, doubles, datetimes, and dates|interval(3,5,f,f)|
30+|interval x|interval/range type for ints, doubles, datetimes, and dates|interval(3,5,f,f)|
66
31
67With regards to boolean values, be sure not to conflate ```t``` or ```f``` as a boolean value with ```true``` and ```false``` which are relation variables.
32With regards to boolean values, be sure not to conflate ```t``` or ```f``` as a boolean value with ```true``` and ```false``` which are relation variables.
68
33
@@ -71,7 +36,7 @@ The ```interval``` function last two arguments are boolean values indicating whe
71Project:M36 will complain loudly if the expected types do not match. Automatic type coercion does not exist.
36Project:M36 will complain loudly if the expected types do not match. Automatic type coercion does not exist.
72
37
73```
38```
74−TutorialD (master/main): :showexpr s:{more:=add(10,@sname)}
39+TutorialD (master/main): :showexpr S:{more:=add(10,@sname)}
75ERR: AtomFunctionTypeError "add" 2 IntAtomType StringAtomType
40ERR: AtomFunctionTypeError "add" 2 IntAtomType StringAtomType
76```
41```
77
42
@@ -83,7 +48,7 @@ Relation Variables are named cells which reference relations within a transactio
83
48
84Definition of a relation variable:
49Definition of a relation variable:
85```
50```
86−products :: {name Text, age Integer}
51+products :: {name char, age int}
87```
52```
88This expression creates a new relation variable in the current context which can refer to any relation with the header of "name" of type "char" and "age" of type int.
53This expression creates a new relation variable in the current context which can refer to any relation with the header of "name" of type "char" and "age" of type int.
89
54
@@ -102,6 +67,22 @@ Chris Date refers to these relations as "TABLE_DUM" and "TABLE_DEE" but such arb
102products{}
67products{}
103```
68```
104
69
70+### Date's Sample Relations
71+
72+The examples in this tutorial can be executed after loading Chris Date's sample relations using:
73+
74+```
75+:importexample date
76+```
77+
78+Each section assumes a fresh instance of the Date examples. The relation variables created in the script are:
79+
80+|Relation Variable Name|Description|
81+|----------------------|-----------|
82+|s|suppliers|
83+|p|parts|
84+|sp|contains mapping of which suppliers supply which parts|
85+
105### Relational Expressions
86### Relational Expressions
106
87
107A relational expression combines relational operators to create a new relation. ```tutd``` can display the result of executing a relational expression with ":showexpr".
88A relational expression combines relational operators to create a new relation. ```tutd``` can display the result of executing a relational expression with ":showexpr".
@@ -170,15 +151,15 @@ The unary rename operator outputs a new relation with chosen attributes renamed.
170
151
171```
152```
172TutorialD (master/main): :showexpr s rename {city as town}
153TutorialD (master/main): :showexpr s rename {city as town}
173−┌────────┬───────────┬───────────────┬──────────┐
154+┌──┬─────┬──────┬──────┐
174−│s#::Text│sname::Text│status::Integer│town::Text│
155+│s#│sname│status│town │
175−├────────┼───────────┼───────────────┼──────────┤
156+├──┼─────┼──────┼──────┤
176−│"S3" │"Blake" │30 │"Paris" │
157+│S3│Blake│30 │Paris │
177−│"S4" │"Clark" │20 │"London" │
158+│S4│Clark│20 │London│
178−│"S5" │"Adams" │30 │"Athens" │
159+│S5│Adams│30 │Athens│
179−│"S1" │"Smith" │20 │"London" │
160+│S1│Smith│20 │London│
180−│"S2" │"Jones" │10 │"Paris" │
161+│S2│Jones│10 │Paris │
181−└────────┴───────────┴───────────────┴──────────┘
162+└──┴─────┴──────┴──────┘
182```
163```
183
164
184#### Projection
165#### Projection
@@ -189,15 +170,14 @@ For example:
189
170
190```
171```
191TutorialD (master/main): :showexpr p{color,city}
172TutorialD (master/main): :showexpr p{color,city}
192−┌──────────┬───────────┐
173+┌──────┬─────┐
193−│city::Text│color::Text│
174+│city │color│
194−├──────────┼───────────┤
175+├──────┼─────┤
195−│"London" │"Red" │
176+│London│Red │
177+│Paris │Blue │
178+│Oslo │Blue │
196−│"Paris" │"Green" │
179+│Paris │Green│
197−│"Oslo" │"Blue" │
198−│"Paris" │"Blue" │
199−└──────────┴───────────┘
180+└──────┴─────┘
200−
201```
181```
202
182
203Projection attributes can also be inverted using `all but`:
183Projection attributes can also be inverted using `all but`:
@@ -215,7 +195,7 @@ TutorialD (master/main): :showexpr s{all but city}
215└────────┴───────────┴───────────────┘
195└────────┴───────────┴───────────────┘
216```
196```
217
197
218−Projection attributes can be derived from a relational expression using `all from`:
198+Projection attributes can also be derived from a relational expression using `all from`:
219
199
220```
200```
221TutorialD (master/main): :showexpr (s join sp){all from s}
201TutorialD (master/main): :showexpr (s join sp){all from s}
@@ -231,64 +211,28 @@ TutorialD (master/main): :showexpr (s join sp){all from s}
231
211
232Above, we join `s` and `sp` but project the result back onto the attributes of `s`.
212Above, we join `s` and `sp` but project the result back onto the attributes of `s`.
233
213
234−Projection attributes can be unioned from multiple sources using `union of`:
235−
236−```
237−TutorialD (master/main): :showexpr (s join sp){union of {all from s} {all but p#}}
238−┌──────────┬────────────┬────────┬───────────┬───────────────┐
239−│city::Text│qty::Integer│s#::Text│sname::Text│status::Integer│
240−├──────────┼────────────┼────────┼───────────┼───────────────┤
241−│"Paris" │400 │"S2" │"Jones" │10 │
242−│"London" │400 │"S1" │"Smith" │20 │
243−│"Paris" │200 │"S3" │"Blake" │30 │
244−│"London" │200 │"S4" │"Clark" │20 │
245−│"London" │200 │"S1" │"Smith" │20 │
246−│"Paris" │300 │"S2" │"Jones" │10 │
247−│"London" │100 │"S1" │"Smith" │20 │
248−│"London" │300 │"S4" │"Clark" │20 │
249−│"London" │300 │"S1" │"Smith" │20 │
250−│"London" │400 │"S4" │"Clark" │20 │
251−└──────────┴────────────┴────────┴───────────┴───────────────┘
252−```
253−
254−Here, after joining `s` and `p`, the union of all attributes from `s` and all attributes from `p` except for `p#` are returned.all
255−
256−Finally, projection attributes can be intersected using `intersection of`:
257−
258−```
259−TutorialD (master/main): :showexpr (s join sp){intersection of {all from s} {all from p}}
260−┌──────────┐
261−│city::Text│
262−├──────────┤
263−│"London" │
264−│"Paris" │
265−└──────────┘
266−```
267−
268−Here, after joining `s` and `p`, we project on the intersection of attributes from `s` and `p` which happens to be `city`.
269−
270#### Restriction
214#### Restriction
271
215
272Restriction is applied using a "where" clause, much like in SQL.
216Restriction is applied using a "where" clause, much like in SQL.
273
217
274```
218```
275TutorialD (master/main): :showexpr p where color="Blue" and city="Paris"
219TutorialD (master/main): :showexpr p where color="Blue" and city="Paris"
276−┌──────────┬───────────┬────────┬───────────┬───────────────┐
220+┌─────┬─────┬──┬─────┬──────┐
277−│city::Text│color::Text│p#::Text│pname::Text│weight::Integer│
221+│city │color│p#│pname│weight│
278−├──────────┼───────────┼────────┼───────────┼───────────────┤
222+├─────┼─────┼──┼─────┼──────┤
279−│"Paris" │"Blue" │"P5" │"Cam" │12 │
223+│Paris│Blue │P5│Cam │12 │
280−└──────────┴───────────┴────────┴───────────┴───────────────┘
224+└─────┴─────┴──┴─────┴──────┘
281```
225```
282
226
283The restriction predicate can be built from "and", "not", and "or". Boolean atom functions can also appear in a restriction as long as they are preceded by "^". For example:
227The restriction predicate can be built from "and", "not", and "or". Boolean atom functions can also appear in a restriction as long as they are preceded by "^". For example:
284
228
285```
229```
286TutorialD (master/main): :showexpr s where ^lt(@status,20)
230TutorialD (master/main): :showexpr s where ^lt(@status,20)
287−┌──────────┬────────┬───────────┬───────────────┐
231+┌─────┬──┬─────┬──────┐
288−│city::Text│s#::Text│sname::Text│status::Integer│
232+│city │s#│sname│status│
289−├──────────┼────────┼───────────┼───────────────┤
233+├─────┼──┼─────┼──────┤
290−│"Paris" │"S2" │"Jones" │10 │
234+│Paris│S2│Jones│10 │
291−└──────────┴────────┴───────────┴───────────────┘
235+└─────┴──┴─────┴──────┘
292```
236```
293
237
294#### Join
238#### Join
@@ -297,22 +241,21 @@ Joins are binary operators and are applied with the "join" keyword. The equivale
297
241
298```
242```
299TutorialD (master/main): :showexpr s join sp
243TutorialD (master/main): :showexpr s join sp
300−┌──────────┬────────┬────────────┬────────┬───────────┬───────────────┐
244+┌──────┬──┬───┬──┬─────┬──────┐
301−│city::Text│p#::Text│qty::Integer│s#::Text│sname::Text│status::Integer│
245+│city │p#│QTY│s#│sname│status│
302−├──────────┼────────┼────────────┼────────┼───────────┼───────────────┤
246+├──────┼──┼───┼──┼─────┼──────┤
303−│"London" │"P2" │200 │"S1" │"Smith" │20 │
304−│"London" │"P6" │100 │"S1" │"Smith" │20 │
247+│London│P6│100│S1│Smith│20 │
305−│"London" │"P3" │400 │"S1" │"Smith" │20 │
248+│London│P3│400│S1│Smith│20 │
306−│"Paris" │"P2" │400 │"S2" │"Jones" │10 │
307−│"London" │"P5" │400 │"S4" │"Clark" │20 │
249+│London│P5│400│S4│Clark│20 │
308−│"Paris" │"P1" │300 │"S2" │"Jones" │10 │
309−│"London" │"P1" │300 │"S1" │"Smith" │20 │
250+│London│P1│300│S1│Smith│20 │
310−│"Paris" │"P2" │200 │"S3" │"Blake" │30 │
251+│Paris │P2│200│S3│Blake│30 │
252+│Paris │P1│300│S2│Jones│10 │
253+│London│P5│100│S1│Smith│20 │
311−│"London" │"P4" │300 │"S4" │"Clark" │20 │
254+│London│P4│300│S4│Clark│20 │
312−│"London" │"P2" │200 │"S4" │"Clark" │20 │
255+│Paris │P2│400│S2│Jones│10 │
313−│"London" │"P4" │200 │"S1" │"Smith" │20 │
256+│London│P2│200│S1│Smith│20 │
314−│"London" │"P5" │100 │"S1" │"Smith" │20 │
257+│London│P4│200│S1│Smith│20 │
315−└──────────┴────────┴────────────┴────────┴───────────┴───────────────┘
258+└──────┴──┴───┴──┴─────┴──────┘
316```
259```
317
260
318As a convenience, `tutd` also supports semijoin (`matching`) and antijoin (`not matching`) syntax.
261As a convenience, `tutd` also supports semijoin (`matching`) and antijoin (`not matching`) syntax.
@@ -326,16 +269,16 @@ As a convenience, `tutd` also supports semijoin (`matching`) and antijoin (`not
326The binary union operator merges tuples from both relations if-and-only-if the attributes of both relations are identical. The SQL equivalent is the "UNION" operator. Unlike SQL, however, duplicate tuples are not tolerated, so there is no "UNION ALL" equivalent in the relational algebra.
269The binary union operator merges tuples from both relations if-and-only-if the attributes of both relations are identical. The SQL equivalent is the "UNION" operator. Unlike SQL, however, duplicate tuples are not tolerated, so there is no "UNION ALL" equivalent in the relational algebra.
327
270
328```
271```
329−TutorialD (master/main): :showexpr s union s
272+TutorialD (master/main): :showexpr S union S
330−┌──────────┬────────┬───────────┬───────────────┐
273+┌──────┬──┬─────┬──────┐
331−│city::Text│s#::Text│sname::Text│status::Integer│
274+│city │s#│sname│status│
332−├──────────┼────────┼───────────┼───────────────┤
275+├──────┼──┼─────┼──────┤
333−│"Paris" │"S3" │"Blake" │30 │
276+│Paris │S3│Blake│30 │
277+│London│S4│Clark│20 │
334−│"Athens" │"S5" │"Adams" │30 │
278+│Athens│S5│Adams│30 │
335−│"London" │"S1" │"Smith" │20 │
279+│London│S1│Smith│20 │
336−│"Paris" │"S2" │"Jones" │10 │
280+│Paris │S2│Jones│10 │
337−│"London" │"S4" │"Clark" │20 │
338−└──────────┴────────┴───────────┴───────────────┘
281+└──────┴──┴─────┴──────┘
339```
282```
340
283
341The union of any relation with itself is itself.
284The union of any relation with itself is itself.
@@ -346,15 +289,15 @@ The extend unary operator adds an attribute to a relation's header and body and
346
289
347```
290```
348TutorialD (master/main): :showexpr s:{status2:=add(10,@status)}
291TutorialD (master/main): :showexpr s:{status2:=add(10,@status)}
349−┌──────────┬────────┬───────────┬───────────────┬────────────────┐
292+┌──────┬──┬─────┬──────┬───────┐
350−│city::Text│s#::Text│sname::Text│status::Integer│status2::Integer│
293+│city │s#│sname│status│status2│
351−├──────────┼────────┼───────────┼───────────────┼────────────────┤
294+├──────┼──┼─────┼──────┼───────┤
352−│"Paris" │"S2" │"Jones" │10 │20 │
295+│Paris │S2│Jones│10 │20 │
353−│"Athens" │"S5" │"Adams" │30 │40 │
296+│Athens│S5│Adams│30 │40 │
354−│"London" │"S4" │"Clark" │20 │30 │
355−│"Paris" │"S3" │"Blake" │30 │40 │
297+│Paris │S3│Blake│30 │40 │
356−│"London" │"S1" │"Smith" │20 │30 │
298+│London│S1│Smith│20 │30 │
299+│London│S4│Clark│20 │30 │
357−└──────────┴────────┴───────────┴───────────────┴────────────────┘
300+└──────┴──┴─────┴──────┴───────┘
358```
301```
359
302
360The "@" is required in the above query in order to distinguish the attribute's name from a relation's name.
303The "@" is required in the above query in order to distinguish the attribute's name from a relation's name.
@@ -380,27 +323,27 @@ The group operator can also be used to emulate functionality similar to SQL's OU
380
323
381```
324```
382TutorialD (master/main): :showexpr s group ({sname,status,s#} as subrel)
325TutorialD (master/main): :showexpr s group ({sname,status,s#} as subrel)
383−┌──────────┬───────────────────────────────────────────────────────┐
326+┌──────┬─────────────────┐
384−│city::Text│subrel::relation {s#::Text,sname::Text,status::Integer}│
327+│city │subrel │
385−├──────────┼───────────────────────────────────────────────────────┤
328+├──────┼─────────────────┤
386−│"Athens" │┌────────┬───────────┬───────────────┐ │
329+│Athens│┌──┬─────┬──────┐│
387−│ ││s#::Text│sname::Text│status::Integer│ │
330+│ ││s#│sname│status││
388−│ │├────────┼───────────┼───────────────┤ │
331+│ │├──┼─────┼──────┤│
389−│ ││"S5" │"Adams" │30 │ │
332+│ ││S5│Adams│30 ││
390−│ │└────────┴───────────┴───────────────┘ │
333+│ │└──┴─────┴──────┘│
334+│London│┌──┬─────┬──────┐│
335+│ ││s#│sname│status││
336+│ │├──┼─────┼──────┤│
337+│ ││S1│Smith│20 ││
338+│ ││S4│Clark│20 ││
339+│ │└──┴─────┴──────┘│
391−│"Paris" │┌────────┬───────────┬───────────────┐ │
340+│Paris │┌──┬─────┬──────┐│
392−│ ││s#::Text│sname::Text│status::Integer│ │
341+│ ││s#│sname│status││
393−│ │├────────┼───────────┼───────────────┤ │
342+│ │├──┼─────┼──────┤│
343+│ ││S3│Blake│30 ││
394−│ ││"S2" │"Jones" │10 │ │
344+│ ││S2│Jones│10 ││
395−│ ││"S3" │"Blake" │30 │ │
396−│ │└────────┴───────────┴───────────────┘ │
397−│"London" │┌────────┬───────────┬───────────────┐ │
398−│ ││s#::Text│sname::Text│status::Integer│ │
399−│ │├────────┼───────────┼───────────────┤ │
400−│ ││"S4" │"Clark" │20 │ │
401−│ ││"S1" │"Smith" │20 │ │
402−│ │└────────┴───────────┴───────────────┘ │
345+│ │└──┴─────┴──────┘│
403−└──────────┴───────────────────────────────────────────────────────┘
346+└──────┴─────────────────┘
404```
347```
405
348
406#### Ungroup
349#### Ungroup
@@ -409,15 +352,15 @@ The unary ungroup operator "unwraps" subrelations in a relation-valued attribute
409
352
410```
353```
411TutorialD (master/main): :showexpr (s group ({sname,status,s#} as subrel)) ungroup subrel
354TutorialD (master/main): :showexpr (s group ({sname,status,s#} as subrel)) ungroup subrel
412−┌──────────┬────────┬───────────┬───────────────┐
355+┌──────┬──┬─────┬──────┐
413−│city::Text│s#::Text│sname::Text│status::Integer│
356+│city │s#│sname│status│
414−├──────────┼────────┼───────────┼───────────────┤
357+├──────┼──┼─────┼──────┤
415−│"Paris" │"S2" │"Jones" │10 │
416−│"Paris" │"S3" │"Blake" │30 │
358+│Paris │S3│Blake│30 │
417−│"London" │"S4" │"Clark" │20 │
359+│London│S4│Clark│20 │
418−│"London" │"S1" │"Smith" │20 │
419−│"Athens" │"S5" │"Adams" │30 │
360+│Athens│S5│Adams│30 │
361+│London│S1│Smith│20 │
362+│Paris │S2│Jones│10 │
420−└──────────┴────────┴───────────┴───────────────┘
363+└──────┴──┴─────┴──────┘
421```
364```
422
365
423#### Minus
366#### Minus
@@ -450,11 +393,11 @@ The relation variable assignment mentioned above certainly changes the state of
450```
393```
451TutorialD (master/main): newrelvar:=relation{tuple{age 3}}
394TutorialD (master/main): newrelvar:=relation{tuple{age 3}}
452TutorialD (master/main): :showexpr newrelvar
395TutorialD (master/main): :showexpr newrelvar
453−┌────────────┐
396+┌───┐
454−│age::Integer│
397+│age│
455−├────────────┤
398+├───┤
456−│3 │
399+│3 │
457−└────────────┘
400+└───┘
458```
401```
459
402
460All further operators are convenience operators and could be implemented with simple assignment. SQL has no equivalent to relational assignment; instead, one must issue "CREATE TABLE" commands and insert rows into the resultant tables.
403All further operators are convenience operators and could be implemented with simple assignment. SQL has no equivalent to relational assignment; instead, one must issue "CREATE TABLE" commands and insert rows into the resultant tables.
@@ -476,16 +419,16 @@ The insert operators accepts a relation variable and a relation of the same type
476```
419```
477TutorialD (master/main): insert s relation{tuple{city "Boston",s# "S10",sname "Gonzalez",status 10}}
420TutorialD (master/main): insert s relation{tuple{city "Boston",s# "S10",sname "Gonzalez",status 10}}
478TutorialD (master/main): :showexpr s
421TutorialD (master/main): :showexpr s
479−┌──────────┬────────┬───────────┬───────────────┐
422+┌──────┬───┬────────┬──────┐
480−│city::Text│s#::Text│sname::Text│status::Integer│
423+│city │s# │sname │status│
481−├──────────┼────────┼───────────┼───────────────┤
424+├──────┼───┼────────┼──────┤
425+│Paris │S3 │Blake │30 │
426+│London│S4 │Clark │20 │
482−│"Athens" │"S5" │"Adams" │30 │
427+│Athens│S5 │Adams │30 │
428+│London│S1 │Smith │20 │
483−│"Paris" │"S2" │"Jones" │10 │
429+│Paris │S2 │Jones │10 │
484−│"Boston" │"S10" │"Gonzalez" │10 │
430+│Boston│S10│Gonzalez│10 │
485−│"London" │"S4" │"Clark" │20 │
486−│"London" │"S1" │"Smith" │20 │
487−│"Paris" │"S3" │"Blake" │30 │
488−└──────────┴────────┴───────────┴───────────────┘
431+└──────┴───┴────────┴──────┘
489```
432```
490
433
491This insertion operation is equivalent to:
434This insertion operation is equivalent to:
@@ -500,15 +443,15 @@ The update operator accepts a relation argument and a predicate, optionally filt
500```
443```
501TutorialD (master/main): update s where status=20 (sname:="Mr. Twenty")
444TutorialD (master/main): update s where status=20 (sname:="Mr. Twenty")
502TutorialD (master/main): :showexpr s
445TutorialD (master/main): :showexpr s
503−┌──────────┬────────┬────────────┬───────────────┐
446+┌──────┬──┬──────────┬──────┐
504−│city::Text│s#::Text│sname::Text │status::Integer│
447+│city │s#│sname │status│
505−├──────────┼────────┼────────────┼───────────────┤
448+├──────┼──┼──────────┼──────┤
506−│"Paris" │"S2" │"Jones" │10 │
507−│"London" │"S1" │"Mr. Twenty"│20 │
508−│"Paris" │"S3" │"Blake" │30 │
449+│Paris │S3│Blake │30 │
509−│"London" │"S4" │"Mr. Twenty"│20 │
450+│London│S1│Mr. Twenty│20 │
510−│"Athens" │"S5" │"Adams" │30 │
451+│Athens│S5│Adams │30 │
452+│Paris │S2│Jones │10 │
453+│London│S4│Mr. Twenty│20 │
511−└──────────┴────────┴────────────┴───────────────┘
454+└──────┴──┴──────────┴──────┘
512```
455```
513
456
514This is logically equivalent to:
457This is logically equivalent to:
@@ -516,15 +459,15 @@ This is logically equivalent to:
516```
459```
517TutorialD (master/main): s:=(((s where status=20){city,s#,status}):{sname:="Mr. Twenty"}) union (s where not status=20)
460TutorialD (master/main): s:=(((s where status=20){city,s#,status}):{sname:="Mr. Twenty"}) union (s where not status=20)
518TutorialD (master/main): :showexpr s
461TutorialD (master/main): :showexpr s
519−┌──────────┬────────┬────────────┬───────────────┐
462+┌──────┬──┬──────────┬──────┐
520−│city::Text│s#::Text│sname::Text │status::Integer│
463+│city │s#│sname │status│
521−├──────────┼────────┼────────────┼───────────────┤
464+├──────┼──┼──────────┼──────┤
522−│"Paris" │"S2" │"Jones" │10 │
523−│"London" │"S1" │"Mr. Twenty"│20 │
524−│"Paris" │"S3" │"Blake" │30 │
465+│Paris │S3│Blake │30 │
525−│"London" │"S4" │"Mr. Twenty"│20 │
466+│London│S1│Mr. Twenty│20 │
526−│"Athens" │"S5" │"Adams" │30 │
467+│Athens│S5│Adams │30 │
468+│Paris │S2│Jones │10 │
469+│London│S4│Mr. Twenty│20 │
527−└──────────┴────────┴────────────┴───────────────┘
470+└──────┴──┴──────────┴──────┘
528```
471```
529
472
530This query means: "Drop the sname attribute from S filtered where status equals 20, extend the resultant relation by sname with value 'Mr. Twenty', then union the resultant relation with S filtered by status not equaling 20, and assign that to S."
473This query means: "Drop the sname attribute from S filtered where status equals 20, extend the resultant relation by sname with value 'Mr. Twenty', then union the resultant relation with S filtered by status not equaling 20, and assign that to S."
@@ -536,19 +479,19 @@ The delete operator accepts a relation argument and a filtering predicate, creat
536```
479```
537TutorialD (master/main): delete sp where s#="S4"
480TutorialD (master/main): delete sp where s#="S4"
538TutorialD (master/main): :showexpr sp
481TutorialD (master/main): :showexpr sp
539−┌────────┬────────────┬────────┐
482+┌──┬───┬──┐
540−│p#::Text│qty::Integer│s#::Text│
483+│p#│QTY│s#│
541−├────────┼────────────┼────────┤
484+├──┼───┼──┤
542−│"P2" │200 │"S3" │
543−│"P2" │400 │"S2" │
485+│P3│400│S1│
544−│"P1" │300 │"S1" │
545−│"P5" │100 │"S1" │
546−│"P4" │200 │"S1" │
486+│P4│200│S1│
547−│"P1" │300 │"S2" │
487+│P2│400│S2│
548−│"P3" │400 │"S1" │
549−│"P2" │200 │"S1" │
488+│P2│200│S1│
550−│"P6" │100 │"S1" │
489+│P6│100│S1│
490+│P1│300│S1│
491+│P2│200│S3│
492+│P1│300│S2│
493+│P5│100│S1│
551−└────────┴────────────┴────────┘
494+└──┴───┴──┘
552```
495```
553
496
554This is logically equivalent to:
497This is logically equivalent to:
@@ -583,7 +526,7 @@ Foreign keys are constraints which require that certain values appearing in one
583TutorialD (master/main): foreign key s#_in_sp sp{s#} in s{s#}
526TutorialD (master/main): foreign key s#_in_sp sp{s#} in s{s#}
584```
527```
585
528
586−This expression ensure that any sp{s#} must also appear as a value in s{s#}. Note that the sub-expression (on the left of "in") and the super-expression (on the right) must be of the same relation type- the generated relation values' attribute names and types must be equal. Use `rename` to make attribute names identical.
529+This expression ensure that any sp{s#} must also appear as a value in s{s#}.
587
530
588#### Functional dependencies
531#### Functional dependencies
589
532
@@ -617,27 +560,27 @@ SQL supports aggregate queries using aggregate functions (SUM(), COUNT(), AVERAG
617
560
618```
561```
619TutorialD (master/main): :showexpr s group ({s#,sname,status} as subrel):{citycount:=count(@subrel)}
562TutorialD (master/main): :showexpr s group ({s#,sname,status} as subrel):{citycount:=count(@subrel)}
620−┌──────────┬──────────────────┬───────────────────────────────────────────────────────┐
563+┌──────┬─────────┬─────────────────┐
621−│city::Text│citycount::Integer│subrel::relation {s#::Text,sname::Text,status::Integer}│
564+│city │citycount│subrel │
622−├──────────┼──────────────────┼───────────────────────────────────────────────────────┤
565+├──────┼─────────┼─────────────────┤
623−│"Athens" │1 │┌────────┬───────────┬───────────────┐ │
566+│Paris │2 │┌──┬─────┬──────┐│
624−│ │ ││s#::Text│sname::Text│status::Integer│ │
567+│ │ ││s#│sname│status││
625−│ │ │├────────┼───────────┼───────────────┤ │
568+│ │ │├──┼─────┼──────┤│
626−│ │ ││"S5" │"Adams" │30 │ │
569+│ │ ││S3│Blake│30 ││
627−│ │ │└────────┴───────────┴───────────────┘ │
628−│"Paris" │2 │┌────────┬───────────┬───────────────┐ │
629−│ │ ││s#::Text│sname::Text│status::Integer│ │
630−│ │ │├────────┼───────────┼───────────────┤ │
631−│ │ ││"S2" │"Jones" │10 │ │
570+│ │ ││S2│Jones│10 ││
632−│ │ ││"S3" │"Blake" │30 │ │
633−│ │ │└────────┴───────────┴───────────────┘ │
571+│ │ │└──┴─────┴──────┘│
634−│"London" │2 │┌────────┬───────────┬───────────────┐ │
572+│London│2 │┌──┬─────┬──────┐│
635−│ │ ││s#::Text│sname::Text│status::Integer│ │
573+│ │ ││s#│sname│status││
636−│ │ │├────────┼───────────┼───────────────┤ │
574+│ │ │├──┼─────┼──────┤│
575+│ │ ││S1│Smith│20 ││
637−│ │ ││"S4" │"Clark" │20 │ │
576+│ │ ││S4│Clark│20 ││
638−│ │ ││"S1" │"Smith" │20 │ │
639−│ │ │└────────┴───────────┴───────────────┘ │
577+│ │ │└──┴─────┴──────┘│
578+│Athens│1 │┌──┬─────┬──────┐│
579+│ │ ││s#│sname│status││
580+│ │ │├──┼─────┼──────┤│
581+│ │ ││S5│Adams│30 ││
582+│ │ │└──┴─────┴──────┘│
640−└──────────┴──────────────────┴───────────────────────────────────────────────────────┘
583+└──────┴─────────┴─────────────────┘
641```
584```
642
585
643In this query result, we can simultaneously answer how many suppliers are located in each city and which suppliers they are. The expression is constructed by first grouping to isolate the city, then extending the query to add a attribute containing the tuple count for each subrelation.
586In this query result, we can simultaneously answer how many suppliers are located in each city and which suppliers they are. The expression is constructed by first grouping to isolate the city, then extending the query to add a attribute containing the tuple count for each subrelation.
@@ -648,28 +591,3 @@ In this query result, we can simultaneously answer how many suppliers are locate
648|sum(relation{int})|return the int sum of the relation's values|
591|sum(relation{int})|return the int sum of the relation's values|
649|max(relation{int})|return the maximum int from all the relation's values|
592|max(relation{int})|return the maximum int from all the relation's values|
650|min(relation{int})|return the minimum int from all the relation's values|
593|min(relation{int})|return the minimum int from all the relation's values|
651−
652−#### Arbitrary Relation Variables
653−
654−For testing purposes, it can be useful to populate a database with randomly generated data. Project:M36 can automatically create such data based solely on the type of the relation.
655−
656−```
657−TutorialD (master/main): createarbitraryrelation employee {name Text, empid Int, hired DateTime} 3-100
658−TutorialD (master/main): :showexpr employee
659−┌──────────┬───────────────────────┬──────────┐
660−│empid::Int│hired::DateTime │name::Text│
661−├──────────┼───────────────────────┼──────────┤
662−│23 │1858-11-04 10:50:14 UTC│"LLL" │
663−│22 │1858-12-10 14:53:37 UTC│"LLL" │
664−│25 │1858-11-07 01:14:15 UTC│"SSS" │
665−│-12 │1858-11-06 06:20:57 UTC│"VVV" │
666−│-6 │1858-11-01 16:26:38 UTC│"SSS" │
667−│-1 │1858-10-31 14:41:26 UTC│"DDD" │
668−│-15 │1858-11-26 04:14:03 UTC│"VVV" │
669−│-18 │1858-12-17 00:01:09 UTC│"AAA" │
670−│-9 │1858-10-31 08:36:53 UTC│"XXX" │
671−│4 │1858-11-23 01:48:04 UTC│"VVV" │
672−└──────────┴───────────────────────┴──────────┘
673−```
674−
675−The `createarbitraryrelation` syntax specifies the name of the relation variable, the type for the relation, and then an acceptable range for the tuple count.
docs/websocket_server.markdown+3−3
@@ -6,7 +6,7 @@ The Project:M36 WebSocket server makes it easy to connect non-Haskell programs t
6
6
7## Setup
7## Setup
8
8
9−The websocket server is started with the same arguments as the normal [Project:M36 server](server_mode.markdown):
9+The websocket server is started with the same arguments as the normal [Project:M36 server](docs/server_mode.markdown):
10
10
11```
11```
12cabal run project-m36-websocket-server -- --database mydbname --hostname 127.0.0.1
12cabal run project-m36-websocket-server -- --database mydbname --hostname 127.0.0.1
@@ -16,8 +16,8 @@ except that the websocket server is now listening for websocket connections on p
16
16
17## Client Connection
17## Client Connection
18
18
19−A [simple JavaScript library](/src/bin/ProjectM36/Server/WebSocket/project-m36.js) to manage the WebSocket connection is available.
19+A [simple JavaScript library](/ProjectM36/Server/WebSocket/project-m36.js) to manage the WebSocket connection is available.
20
20
21## Sample Application
21## Sample Application
22
22
23−The [WebSocket example application](/src/bin/ProjectM36/Server/WebSocket/websocket-client.html) can be used to learn TutorialD and for remote database access from the web browser.
23+The [WebSocket example application](/ProjectM36/Server/WebSocket/websocket-client.html) can be used to learn TutorialD and for remote database access from the web browser.
examples/CustomTupleable.hsdeleted−67
@@ -1,67 +0,0 @@
1−{-# LANGUAGE DeriveGeneric, OverloadedStrings #-}
2−--this example shows how to implement a non-generics-defined Tupleable instance which is required in scenarios where Haskell-side types are not supported server-side or where one wishes to represent a nested relation
3−import ProjectM36.Client
4−import ProjectM36.Tuple
5−import ProjectM36.Tupleable
6−import ProjectM36.Relation
7−import ProjectM36.Atom
8−import ProjectM36.Attribute as A
9−import qualified Data.Set as S
10−import qualified Data.Map as M
11−import Data.Text (Text)
12−import GHC.Generics
13−import Data.Proxy
14−
15−--in this contrived example, we wish to represent one relation with a nested relation of comments
16−data Blog = Blog {
17− title :: Text,
18− comments :: S.Set Comment
19− } deriving (Show)
20−
21−data Comment = Comment {
22− authorName :: Text,
23− comment :: Text
24− } deriving (Eq, Show, Generic, Ord)
25−
26−instance Tupleable Comment
27−
28−instance Tupleable Blog where
29− toTuple blogentry =
30− mkRelationTupleFromMap (M.fromList [("title", TextAtom (title blogentry)),
31− ("comments", RelationAtom relFromComments)])
32− where
33− commentTuples = map toTuple (S.toList (comments blogentry))
34− relFromComments = case mkRelationFromTuples (toAttributes (Proxy :: Proxy Comment)) commentTuples of
35− Left err -> error (show err)
36− Right rel -> rel
37−
38− fromTuple tupIn = do
39− titleAtom <- atomForAttributeName "title" tupIn
40− commentsAtom <- atomForAttributeName "comments" tupIn
41− commentsRel <- relationForAtom commentsAtom
42− comments' <- mapM fromTuple (tuplesList commentsRel)
43− pure Blog {
44− title = atomToText titleAtom,
45− comments = S.fromList comments'}
46−
47− toAttributes _ = A.attributesFromList [Attribute "title" TextAtomType,
48− Attribute "comments" $ RelationAtomType (toAttributes (Proxy :: Proxy Comment))]
49−
50−main :: IO ()
51−main = do
52− let exampleBlog = Blog { title = "Cat Pics",
53− comments = S.fromList [Comment {authorName = "Steve",
54− comment = "great"},
55− Comment {authorName = "Bob",
56− comment = "enough"}
57− ]}
58− print (toTuple exampleBlog)
59− print (fromTuple (toTuple exampleBlog) :: Either RelationalError Blog)
60−
61−
62−
63−
64−
65−
66−
67−
examples/DerivingCustomTupleable.hsdeleted−54
@@ -1,54 +0,0 @@
1−{-# LANGUAGE DeriveGeneric, DerivingVia, GeneralizedNewtypeDeriving, TypeOperators, DataKinds, OverloadedStrings #-}
2−
3−import ProjectM36.Tupleable.Deriving
4−import ProjectM36.Atomable (Atomable)
5−import Control.DeepSeq (NFData)
6−import Data.Text (Text)
7−import GHC.Generics (Generic)
8−import Codec.Winery
9−
10−newtype BlogId = BlogId { getBlogId :: Int }
11− deriving stock (Eq, Ord, Show, Generic)
12− deriving newtype (Num)
13− deriving Serialise via WineryRecord BlogId
14−
15−instance NFData BlogId
16−instance Atomable BlogId
17−
18−data Blog = Blog
19− { blogId :: BlogId
20− , blogTitle :: Text
21− , blogAuthorName :: Text
22− }
23− deriving stock (Show, Generic)
24− deriving (Tupleable)
25− via Codec (Field (DropPrefix "blog" >>> CamelCase)) Blog
26− deriving Serialise via WineryRecord Blog
27−
28−data Comment = Comment
29− { commentAuthorName :: Text
30− , commentComment :: Text
31− , commentFor :: BlogId
32− }
33− deriving stock (Show, Generic)
34− deriving (Tupleable)
35− via Codec (Field (DropPrefix "comment" >>> CamelCase)) Comment
36− deriving Serialise via WineryRecord Comment
37−
38−main :: IO ()
39−main = do
40− let exampleBlog = Blog
41− { blogId = 0
42− , blogTitle = "Cat Pics"
43− , blogAuthorName = "Alice"
44− }
45− exampleComment = Comment
46− { commentAuthorName = "Bob"
47− , commentComment = "great"
48− , commentFor = 0
49− }
50− print exampleBlog
51− print (toTuple exampleBlog)
52− putStrLn ""
53− print exampleComment
54− print (toTuple exampleComment)
examples/DynamicAtomFunctions.hsdeleted−12
@@ -1,12 +0,0 @@
1−{-# LANGUAGE OverloadedStrings #-}
2−--compile with `cabal exec ghc -- examples/DynamicAtomFunctions.hs -package project-m36`
3−--load with `loadatomfunctions "DynamicAtomFunctions" "someAtomFunctions" "examples/DynamicAtomFunctions.o"`
4−
5−module DynamicAtomFunctions where
6−import ProjectM36.Base
7−
8−someAtomFunctions :: [AtomFunction]
9−someAtomFunctions = [AtomFunction{
10− atomFuncName = "constTrue",
11− atomFuncType = [TypeVariableType "a", BoolAtomType],
12− atomFuncBody = AtomFunctionBody Nothing (\(x:_) -> pure (BoolAtom True))}]
examples/DynamicDatabaseContextFunctions.hsdeleted−26
@@ -1,26 +0,0 @@
1−{-# LANGUAGE OverloadedStrings #-}
2−--compile with `cabal exec ghc -- examples/DynamicDatabaseContextFunctions.hs -package project-m36`
3−--load with `loaddatabasecontextfunctions "DynamicDatabaseContextFunctions" "someDBCFunctions" "examples/DynamicDatabaseContextFunctions.o"`
4−module DynamicDatabaseContextFunctions where
5−import ProjectM36.Base
6−import ProjectM36.Relation
7−import ProjectM36.DatabaseContextFunctionError
8−import qualified ProjectM36.Attribute as A
9−
10−import qualified Data.Map as M
11−
12−
13−someDBCFunctions :: [DatabaseContextFunction]
14−someDBCFunctions = [DatabaseContextFunction {
15− dbcFuncName = "addtestrel",
16− dbcFuncType = [],
17− dbcFuncBody = DatabaseContextFunctionBody Nothing addTestRel
18− }]
19− where
20− addTestRel _ ctx = do
21− let attrs = A.attributesFromList [Attribute "word" TextAtomType]
22− eRel = mkRelationFromList attrs [[TextAtom "nice"]]
23− case eRel of
24− Left err -> Left (DatabaseContextFunctionUserError (show err))
25− Right testRel ->
26− pure $ ctx { relationVariables = M.insert "testRel" testRel (relationVariables ctx) }
examples/Plantfarm.hsdeleted−446
@@ -1,446 +0,0 @@
1−{-# LANGUAGE DeriveGeneric #-}
2−
3−{-# LANGUAGE OverloadedStrings #-}
4−
5−{-# LANGUAGE DeriveAnyClass #-}
6−
7−{-# LANGUAGE DerivingVia #-}
8−
9−
10−import Codec.Winery (Serialise, WineryVariant(WineryVariant))
11−import Control.DeepSeq (NFData)
12−import Data.Aeson (FromJSON, ToJSON(toEncoding, toJSON))
13−import Data.Data (Proxy(Proxy))
14−import Data.Either (lefts, rights)
15−import Data.Functor (($>))
16−import Data.Text as T (Text)
17−import qualified Data.Text.Lazy as TL (pack)
18−import GHC.Generics (Generic)
19−import qualified ProjectM36.Base as Base
20−import ProjectM36.Client
21− ( AtomExprBase(NakedAtomExpr)
22− , Atomable(toAddTypeExpr, toAtom)
23− , AttributeName
24− , Connection
25− , ConnectionInfo(InProcessConnectionInfo)
26− , DatabaseContextExpr
27− , DatabaseContextExprBase(Delete)
28− , PersistenceStrategy(NoPersistence)
29− , RelationalError
30− , RelationalExprBase(RelationVariable, Restrict)
31− , RestrictionPredicateExprBase(AttributeEqualityPredicate)
32− , SessionId
33− , close
34− , commit
35− , connectProjectM36
36− , createSessionAtHead
37− , databaseContextExprForUniqueKey
38− , defaultHeadName
39− , emptyNotificationCallback
40− , executeDatabaseContextExpr
41− , executeRelationalExpr
42− , withTransaction
43− )
44−import qualified ProjectM36.Relation as Relation
45−import ProjectM36.Tupleable
46− ( Tupleable(fromTuple)
47− , toDefineExpr
48− , toDeleteExpr
49− , toInsertExpr
50− , toUpdateExpr
51− )
52−import qualified System.Random as R
53−
54−
55−import Control.Monad.IO.Class (MonadIO(liftIO))
56−import qualified Web.Scotty as S
57−
58−-- | This is an example showcasing the updating of data
59−-- with the help of plants. \\
60−-- This is a very simple example and of course not how
61−-- plants grow in nature. \\
62−-- The main goal of this example is to showcase the updating
63−-- of data and the different options of persistence.
64−-- You can just pipe the output from curl into jq:
65−--
66−-- curl -X POST -H 'Accept: application/json' http://localhost:8001/plant/water/angu | jq -r '.stage'
67−
68−
69−data Stage = Seed | Sprout | Seedling | Adult | Dead
70− deriving (Show, Eq, Ord, Generic, NFData, Atomable)
71− deriving Serialise via WineryVariant Stage
72−
73−
74−instance ToJSON Stage where -- The where can be removed and the implementation commented out
75− -- if the ascii values are not wanted
76− toJSON s = toJSON $ show s <> "\nascii only provided for visualisation:\n" <> stagetoAscii s
77−
78− toEncoding s = toEncoding $ show s <> "\nascii only provided for visualisation:\n" <> stagetoAscii s
79−
80−instance FromJSON Stage
81−
82−instance S.Parsable Stage where
83− parseParam t
84− | t == "seed" || t == "Seed" = Right Seed
85− | t == "sprout" || t == "Sprout" = Right Sprout
86− | t == "seedling" || t == "Seedling" = Right Seedling
87− | t == "adult" || t == "Adult" = Right Adult
88− | t == "dead" || t == "Dead" = Right Dead
89− | otherwise = Left t
90−
91−
92−-- Just for ToJSON for ilustration of stage
93−type ASCIIStage = String
94−
95−seedStr :: ASCIIStage
96−seedStr = "<>\n\
97− \'''\n"
98−sproutStr :: ASCIIStage
99−sproutStr = " ..\n\
100− \<|>\n\
101− \''''\n"
102−seedlingStr :: ASCIIStage
103−seedlingStr = " `\\⁄o \n\
104− \ v|/\n\
105− \'´;'''\n"
106−adultStr :: ASCIIStage
107−adultStr = "*~(#)~\n\
108− \ \\,Y,e\n\
109− \ \\|/\n\
110− \''+'\\''\n"
111−deadStr :: ASCIIStage
112−deadStr = " ,__:<\n\
113− \'/'''''\n"
114−
115−-- Just used for ToJSON illustration of stages
116−stagetoAscii :: Stage -> ASCIIStage
117−stagetoAscii Seed = seedStr
118−stagetoAscii Sprout = sproutStr
119−stagetoAscii Seedling = seedlingStr
120−stagetoAscii Adult = adultStr
121−stagetoAscii Dead = deadStr
122−
123−-- used for update stage
124−next :: Stage -> Stage
125−next Seed = Sprout
126−next Sprout = Seedling
127−next Seedling = Adult
128−next s = s
129−
130−data Plant = Plant { name :: Text, species :: Text, stage :: Stage, waterings:: Integer } deriving (Show, Generic)
131−instance Tupleable Plant
132−instance ToJSON Plant
133−instance FromJSON Plant
134−
135−
136−main :: IO ()
137−main = do
138− putStrLn "Connecting to plant farm"
139− c <- dbConnection
140− _ <- createSchema c
141− putStrLn "Planting some plants"
142− _ <- insertSampleData c
143− let port = 8001
144− putStrLn $ "Started Plant farm at " <> show port
145− S.scotty port $ do
146−
147− -- retrieve a plant by name
148− S.get "/plant/:name" $ do
149− n <- S.param "name"
150− e <- liftIO $ getPlant c n
151− p <- handleWebError e
152− S.json p
153−
154−
155− -- save a plant providing it as json data
156− S.post "/plant" $ do
157− pl <- S.jsonData :: S.ActionM Plant
158− e <- liftIO $ savePlant c [pl]
159− p <- handleWebError e
160− S.json p
161−
162− -- updating a plant providing it as json data
163− S.put "/plant" $ do
164− pl <- S.jsonData :: S.ActionM Plant
165− e <- liftIO $ updatePlantFst c pl
166− p <- handleWebError e
167− S.json p
168−
169− -- watering the plant having the provided name.
170− -- This will water the plant and might let it progress to the next stage. It might also die.
171− S.post "/plant/water/:name" $ do
172− n <- S.param "name"
173− e <- liftIO $ waterPlant c n
174− p <- handleWebError e
175− S.json p
176−
177− -- retriving all the plants as json data
178− S.get "/plants" $ do
179− e <- liftIO $ getAllPlants c
180− ps <- handleWebErrors e
181− S.json ps
182−
183− -- saving many plants at the same time
184− S.post "/plants" $ do
185− pl <- S.jsonData :: S.ActionM [Plant]
186− e <- liftIO $ savePlant c pl
187− p <- handleWebError e
188− S.json p
189−
190− -- deleting all plants at a specific stage
191− S.delete "/plants?stage=:stage" $ do
192− s <- S.param "stage"
193− e <- liftIO $ deletePlantsByStage c s
194− p <- handleWebError e
195− S.json p
196−
197− -- deleting all plants at a specific stage
198− S.delete "/plants" $ do
199− s <- S.param "name"
200− e <- liftIO $ deletePlantByName c s
201− p <- handleWebError e
202− S.json p
203−
204− -- deleting all dead plants
205− S.delete "/plants/clear" $ do
206− e <- liftIO $ clearDeadPlants c
207− ps <- handleWebErrors e
208− S.json ps
209−
210−handleWebError :: Either Err b -> S.ActionM b
211−handleWebError (Left e) = S.raise (TL.pack $ "An error occurred:\n" <> show e)
212−handleWebError (Right v) = pure v
213−
214−handleWebErrors :: [Either Err b] -> S.ActionM [b]
215−handleWebErrors e = do
216− case lefts e of
217− [] -> pure (rights e)
218− l -> S.raise (TL.pack $ "Errors occurred:\n" <> concatMap ((<>"\n") . show) l)
219−
220−
221−-- | watering a plant and thereby possibly updating its stage
222−waterPlant :: DBConnection -> Text -> IO (Either Err Plant)
223−waterPlant db n = do
224− p <- getPlant db n
225− case p of
226− Left e -> pure $ Left e
227− Right v -> updateStage db $ v { waterings = waterings v + 1 }
228−
229−-- | used by 'waterPlant' updates the stage depending on random numbers
230−updateStage :: DBConnection -> Plant -> IO (Either Err Plant)
231−updateStage db p@(Plant _ _ Dead _ ) = do
232− tmp <- updatePlantFst db p
233− case tmp of
234− Left e -> pure $ Left e
235− Right _ -> pure $ Right p
236−updateStage db p = do
237− res <- calculateStage p
238− tmp <- updatePlantFst db res
239− case tmp of
240− Left e -> pure $ Left e
241− Right _ -> pure $ Right res
242− where calculateStage p' = do
243− r1 <- R.randomRIO (1, 10) :: IO Integer
244− let np = if r1 < waterings p' then p' { stage = next $ stage p', waterings = 0 } else p'
245− r2 <- R.randomRIO (1, 20)
246− pure $ if r2 < waterings np then np { stage = Dead, waterings = 0 } else np
247−
248−-- | deletes all plants with Stage = Dead
249−clearDeadPlants :: DBConnection -> IO [Either Err Plant]
250−clearDeadPlants db = do
251− _ <- deletePlantsByStage db Dead
252− getAllPlants db
253−
254−
255−-- ****************************
256−-- | *Database functions* :
257−-- ****************************
258−
259−
260−-- | Error type for passing. It is not very specific.
261−-- Just minimal and non optimal for this example.
262−data Err = NotSpecified | NotFound deriving (Show ,Generic)
263−
264−instance ToJSON Err
265−
266−-- | Just for convinience for passing around the SessionId
267−-- and the Connection
268−data DBConnection = DB SessionId Connection
269−
270−
271−-- | Getting plants by their name.\
272−-- Because plant has name as primary key \
273−-- we can assume will get at most one result. \
274−-- Alternatively we could return a list.
275−getPlant :: DBConnection -> Text -> IO (Either Err Plant)
276−getPlant db n = defaultHead (Left NotFound) <$> (
277− get db
278− ( Restrict -- Restrict can be thought of as similar to "WITH" in SQL
279− (AttributeEqualityPredicate "name" (NakedAtomExpr (toAtom n))) -- This is the Predicate we are "restricting" our RelationalExprBase with
280− (RelationVariable "plants" ())
281− )
282− :: IO [Either Err Plant] -- this is needed because our 'get' function is
283− )
284−
285−defaultHead :: a -> [a] -> a
286−defaultHead d [] = d
287−defaultHead _ (x:_) = x
288−
289−-- | Getting all the plants
290−getAllPlants :: DBConnection -> IO [Either Err Plant]
291−getAllPlants db = get db (RelationVariable "plants" ())
292−
293−-- | Getting all the plants that satisfy the restrictions
294−getAllPlantsWith :: DBConnection -> Base.RestrictionPredicateExpr -> IO [Either Err Plant]
295−getAllPlantsWith db ex = get db (Restrict ex (RelationVariable "plants" ()))
296−
297−
298−-- | Saving a plant
299−savePlant :: (Traversable t) => DBConnection -> t Plant -> IO (Either Err ())
300−savePlant db sps = insert db sps "plants"
301−
302−-- | An alternative to update alone because due to updates
303−-- not being cached yet \
304−-- they have to be calculated every update. \
305−-- This seems like an alternative until caching is implemented.
306−updatePlantFst :: DBConnection -> Plant -> IO (Either Err ())
307−updatePlantFst db pln = do
308− _ <- delete db pln ["name"] "plants"
309− savePlant db [pln]
310−
311−-- | Updating a plant. Due to the way project 36 works, \
312−-- updates have to be executed every time.\
313−-- This is slow but won't be an issue soon because they will
314−-- be cached.\
315−-- But because of this project 36 can provide O(1) commits.
316−updatePlant :: DBConnection -> Plant -> IO (Either Err ())
317−updatePlant db sps = update
318− db -- db connection
319− sps -- plant value
320− ["name"] -- the attributes to be updated by (in case of unique key)
321− "plants" -- the relation we want to update on
322−
323−
324−-- | deleting all plants that have given name.
325−deletePlantByName :: DBConnection -> Text -> IO (Either Err ())
326−deletePlantByName db s = executeWithTransaction db $ Right $ Delete "plants" $ AttributeEqualityPredicate "name" (NakedAtomExpr (toAtom s))
327−
328−-- | deleting all plants that have given stage.
329−deletePlantsByStage :: DBConnection -> Stage -> IO (Either Err ())
330−deletePlantsByStage db s = executeWithTransaction db $ Right $ Delete "plants" $ AttributeEqualityPredicate "stage" (NakedAtomExpr (toAtom s))
331−
332−
333−-- | Inserting the schema into the DB
334−createSchema :: DBConnection -> IO ()
335−createSchema (DB sessionId conn) = do
336− _ <- handleIOErrorsAndQuit $ mapM (executeDatabaseContextExpr sessionId conn) [
337− toAddTypeExpr (Proxy :: Proxy Stage) -- Adds the Type Stage as data to the DB
338− , toDefineExpr (Proxy :: Proxy Plant) "plants" -- Creates the plants relation
339− , databaseContextExprForUniqueKey "plants" ["name"] -- Makes name of the plants relation a uniqe Key,
340− -- Foreign Key restrictions are available too
341− ]
342− pure ()
343−
344−
345−-- | inserting some sample data
346−insertSampleData :: DBConnection -> IO (Either Err ())
347−insertSampleData (DB sid conn) = do
348− insert (DB sid conn) [
349− Plant "angu" "Caladenia angustata" Seed 0
350− , Plant "thely" "Thelymitra alcockiae" Seed 0
351− , Plant "monstera" "Araceae" Seed 0
352− ] "plants"
353−
354−dbConnection :: IO DBConnection
355−dbConnection = do
356− -- connect to the database
357− let connInfo = InProcessConnectionInfo NoPersistence emptyNotificationCallback []
358− -- The code below persists the data in a DB with the name "base". \\
359−-- let connInfo = InProcessConnectionInfo (CrashSafePersistence "base") emptyNotificationCallback [] \\
360− -- In addition minimal persistance is available. \\
361−-- let connInfo = InProcessConnectionInfo (MinimalPersistence "base") emptyNotificationCallback []
362− conn <- handleIOErrorAndQuit $ connectProjectM36 connInfo
363− --create a database session at the default branch of the database
364− sessionId <- handleIOErrorAndQuit $ createSessionAtHead conn defaultHeadName
365− pure (DB sessionId conn)
366−
367−
368−-- | A polymorphic function to insert data (a traversable of data) into the DB
369−insert :: (Tupleable a, Traversable t) => DBConnection -> t a -> Base.RelVarName -> IO (Either Err ())
370−insert db rlv rlvName = executeWithTransaction db $ toInsertExpr rlv rlvName
371−
372−-- | A polymorphic function to update data in the DB.
373−-- An update in one funtion would take:
374−--
375−-- - SessionId
376−-- - Connection
377−-- - Tuplable a -- the Tuplable you want to update
378−-- - [AttributeName] -- the Attributes of the Tuplable you want to update those are of StringType
379−-- - RelVarName -- the name of the relation
380−--
381−-- With that you can via 'toUpdateExpr' create a 'DatabaseContextExpr' to be executed. \\
382−-- For inserting its very similarly done with 'toInsertExpr'.
383−update :: (Tupleable a) => DBConnection -> a -> [AttributeName]-> Base.RelVarName -> IO (Either Err ())
384−update db rlv attr rlvName = executeWithTransaction db $ toUpdateExpr rlvName attr rlv
385−
386−-- | A polymorphic function to delete data in the DB
387−delete :: (Tupleable a) => DBConnection -> a -> [AttributeName]-> Base.RelVarName -> IO (Either Err ())
388−delete db rlv attr rlvName = executeWithTransaction db $ toDeleteExpr rlvName attr rlv
389−
390−-- | A convenience function to make executing DBContextExpr with commiting simpler. \\
391−-- In particular for expr that just insert, delete and update.
392−-- Therefor ultimately return Either _ ()
393−executeWithTransaction :: DBConnection -> Either RelationalError DatabaseContextExpr -> IO (Either Err ())
394−executeWithTransaction (DB sid conn) expr = do
395− iEx <- handleError expr
396− case iEx of
397− Left e -> pure $ Left e
398− Right v -> handleIOError $ withTransaction sid conn (executeDatabaseContextExpr sid conn v) (commit sid conn)
399−
400−-- | A polymorphic function to get data (a list of data and possibly errors) from the DB
401−get :: Tupleable b => DBConnection -> Base.RelationalExpr -> IO [Either Err b]
402−get (DB sessionId conn) q = do
403− eRel <- executeRelationalExpr sessionId conn q
404− e <- handleError eRel
405− case e of
406− Left err -> pure [Left err]
407− Right pRel -> do
408− ws <- Relation.toList pRel
409− mapM (handleError . fromTuple) ws
410−
411−-- | for closing the DB connection.
412−-- Not really needed when using in-memory DB
413−closeConn :: DBConnection -> IO ()
414−closeConn (DB _ conn) = close conn
415−
416−
417−-- | Error handling is heavily inspired by 'blog.hs' the blog example \\
418−-- by (agentm)[https://github.com/agentm] (https://github.com/agentm/project-m36, commit: f8432522adaafeae7c32bc2b8b6cb09c00396fc6). \\
419−-- As stated there, your application should have proper error handling.
420−handleIOErrorAndQuit :: Show e => IO (Either e a) -> IO a
421−handleIOErrorAndQuit m = do
422− v <- m
423− handleErrorAndQuit v
424−
425−handleError :: Show e => Either e a -> IO (Either Err a)
426−handleError eErr = case eErr of
427− Left err -> print err $> Left NotSpecified
428− Right v -> pure $ Right v
429−
430−handleIOError :: Show e => IO (Either e a) -> IO (Either Err a)
431−handleIOError m = do
432− v <- m
433− handleError v
434−
435−handleErrorAndQuit :: Show e => Either e a -> IO a
436−handleErrorAndQuit eErr = case eErr of
437− Left err -> print err >> error "Quit."
438− Right v -> pure v
439−
440−handleIOErrorsAndQuit :: Show e => IO [Either e a] -> IO [a]
441−handleIOErrorsAndQuit m = do
442− eErrs <- m
443− case lefts eErrs of
444− [] -> pure (rights eErrs)
445− err:_ -> handleErrorAndQuit (Left err)
446−
examples/SimpleClient.hs+2−3
@@ -1,12 +1,11 @@
1import ProjectM36.Client
1import ProjectM36.Client
2import ProjectM36.TupleSet
2import ProjectM36.TupleSet
3import ProjectM36.Relation.Show.Term
3import ProjectM36.Relation.Show.Term
4−import Data.Text.IO as TIO
5
4
6main :: IO ()
5main :: IO ()
7main = do
6main = do
8 -- 1. create a ConnectionInfo
7 -- 1. create a ConnectionInfo
9− let connInfo = RemoteConnectionInfo "mytestdb" "127.0.0.1" (show defaultServerPort) emptyNotificationCallback
8+ let connInfo = RemoteProcessConnectionInfo "mytestdb" (createNodeId "127.0.0.1" defaultServerPort) emptyNotificationCallback
10 -- 2. conncted to the remote database
9 -- 2. conncted to the remote database
11 eConn <- connectProjectM36 connInfo
10 eConn <- connectProjectM36 connInfo
12 case eConn of
11 case eConn of
@@ -33,7 +32,7 @@ main = do
33 eRel <- executeRelationalExpr sessionId conn (Restrict restrictionPredicate (RelationVariable "person" ()))
32 eRel <- executeRelationalExpr sessionId conn (Restrict restrictionPredicate (RelationVariable "person" ()))
34 case eRel of
33 case eRel of
35 Left err -> print err
34 Left err -> print err
36− Right rel -> TIO.putStrLn (showRelation rel)
35+ Right rel -> print (showRelation rel)
37
36
38 --7. close the connection
37 --7. close the connection
39 close conn
38 close conn
examples/blog.hs+8−11
@@ -1,5 +1,5 @@
1-- a simple example of a blog schema
1-- a simple example of a blog schema
2−{-# LANGUAGE DeriveAnyClass, DeriveGeneric, OverloadedStrings, CPP, DerivingVia #-}
2+{-# LANGUAGE DeriveAnyClass, DeriveGeneric, OverloadedStrings #-}
3
3
4import ProjectM36.Client
4import ProjectM36.Client
5import ProjectM36.Base
5import ProjectM36.Base
@@ -10,18 +10,16 @@ import ProjectM36.Tuple (atomForAttributeName)
10
10
11import Data.Either
11import Data.Either
12import GHC.Generics
12import GHC.Generics
13+import Data.Binary
13import qualified Data.Text as T
14import qualified Data.Text as T
14import qualified Data.Text.Lazy as TL
15import qualified Data.Text.Lazy as TL
15import Data.Time.Clock
16import Data.Time.Clock
16import Data.Time.Calendar
17import Data.Time.Calendar
17import Control.DeepSeq
18import Control.DeepSeq
18import Data.Proxy
19import Data.Proxy
19−#if __GLASGOW_HASKELL__ < 804
20import Data.Monoid
20import Data.Monoid
21−#endif
22import Data.List
21import Data.List
23import Control.Monad (when, forM_)
22import Control.Monad (when, forM_)
24−import Codec.Winery
25
23
26import Web.Scotty as S
24import Web.Scotty as S
27import Text.Blaze.Html5 (h1, h2, h3, p, form, input, (!), toHtml, Html, a, toValue, hr, textarea)
25import Text.Blaze.Html5 (h1, h2, h3, p, form, input, (!), toHtml, Html, a, toValue, hr, textarea)
@@ -35,7 +33,7 @@ import Data.Time.Format
35data Blog = Blog {
33data Blog = Blog {
36 title :: T.Text,
34 title :: T.Text,
37 entry :: T.Text,
35 entry :: T.Text,
38− tstamp :: UTCTime,
36+ stamp :: UTCTime,
39 category :: Category --note that this type is an algebraic data type
37 category :: Category --note that this type is an algebraic data type
40 }
38 }
41 deriving (Generic, Show) --derive Generic so that Tupleable can use default instances
39 deriving (Generic, Show) --derive Generic so that Tupleable can use default instances
@@ -52,8 +50,7 @@ data Comment = Comment {
52instance Tupleable Comment
50instance Tupleable Comment
53
51
54data Category = Food | Cats | Photos | Other T.Text -- note that this data type could not be represented by an "enumeration" as found in SQL databases
52data Category = Food | Cats | Photos | Other T.Text -- note that this data type could not be represented by an "enumeration" as found in SQL databases
55− deriving (Atomable, Eq, Show, NFData, Generic) -- derive Atomable so that values of this type can be stored as a database value
53+ deriving (Atomable, Eq, Show, NFData, Binary, Generic) -- derive Atomable so that values of this type can be stored as a database value
56− deriving Serialise via WineryVariant Category -- derive Serialisable to be able to transmit this data remotely
57
54
58-- add some short-hand error handling- your application should have proper handling
55-- add some short-hand error handling- your application should have proper handling
59handleIOError :: Show e => IO (Either e a) -> IO a
56handleIOError :: Show e => IO (Either e a) -> IO a
@@ -106,11 +103,11 @@ insertSampleData :: SessionId -> Connection -> IO ()
106insertSampleData sessionId conn = do
103insertSampleData sessionId conn = do
107 let blogs = [Blog { title = "Haskell Lenses",
104 let blogs = [Blog { title = "Haskell Lenses",
108 entry = "I wear Haskell rose-colored lenses.",
105 entry = "I wear Haskell rose-colored lenses.",
109− tstamp = UTCTime (fromGregorian 2017 5 8) (secondsToDiffTime 1000),
106+ stamp = UTCTime (fromGregorian 2017 5 8) (secondsToDiffTime 1000),
110 category = Food },
107 category = Food },
111 Blog { title = "Haskell Monad Analogy",
108 Blog { title = "Haskell Monad Analogy",
112 entry = "Monads are like burritos going through intestines.",
109 entry = "Monads are like burritos going through intestines.",
113− tstamp = UTCTime (fromGregorian 2017 6 10) (secondsToDiffTime 2000),
110+ stamp = UTCTime (fromGregorian 2017 6 10) (secondsToDiffTime 2000),
114 category = Cats }
111 category = Cats }
115 ]
112 ]
116 comments = [Comment { blogTitle = "Haskell Lenses",
113 comments = [Comment { blogTitle = "Haskell Lenses",
@@ -139,7 +136,7 @@ listBlogs sessionId conn = do
139 Left err -> render500 (toHtml (show err))
136 Left err -> render500 (toHtml (show err))
140 Right blogRel -> do
137 Right blogRel -> do
141 blogs <- liftIO (toList blogRel) >>= mapM (handleWebError . fromTuple) :: ActionM [Blog]
138 blogs <- liftIO (toList blogRel) >>= mapM (handleWebError . fromTuple) :: ActionM [Blog]
142− let sortedBlogs = sortBy (\b1 b2 -> tstamp b1 `compare` tstamp b2) blogs
139+ let sortedBlogs = sortBy (\b1 b2 -> stamp b1 `compare` stamp b2) blogs
143 html . renderHtml $ do
140 html . renderHtml $ do
144 h1 "Blog Posts"
141 h1 "Blog Posts"
145 forM_ sortedBlogs $ \blog -> a ! href (toValue $ "/blog/" <> title blog) $ h2 (toHtml (title blog))
142 forM_ sortedBlogs $ \blog -> a ! href (toValue $ "/blog/" <> title blog) $ h2 (toHtml (title blog))
@@ -185,7 +182,7 @@ showBlogEntry sessionId conn = do
185 render $ do
182 render $ do
186 --show blog details
183 --show blog details
187 h1 (toHtml (title blog))
184 h1 (toHtml (title blog))
188− p (toHtml ("Posted at " <> formatStamp (tstamp blog) <> " under " <> show (category blog)))
185+ p (toHtml ("Posted at " <> formatStamp (stamp blog) <> " under " <> show (category blog)))
189 p (toHtml (entry blog))
186 p (toHtml (entry blog))
190 hr
187 hr
191 h3 "Comments"
188 h3 "Comments"
examples/hair.hs+6−9
@@ -1,17 +1,16 @@
1−{-# LANGUAGE DeriveGeneric, DeriveAnyClass, OverloadedStrings, DerivingVia #-}
1+{-# LANGUAGE DeriveGeneric, DeriveAnyClass, OverloadedStrings #-}
2import ProjectM36.Client
2import ProjectM36.Client
3import ProjectM36.Relation.Show.Term
3import ProjectM36.Relation.Show.Term
4import GHC.Generics
4import GHC.Generics
5import Data.Text
5import Data.Text
6+import Data.Binary
6import Control.DeepSeq
7import Control.DeepSeq
7import qualified Data.Map as M
8import qualified Data.Map as M
8import qualified Data.Text.IO as TIO
9import qualified Data.Text.IO as TIO
9import Data.Proxy
10import Data.Proxy
10−import Codec.Winery
11
11
12data Hair = Bald | Brown | Blond | OtherColor Text
12data Hair = Bald | Brown | Blond | OtherColor Text
13− deriving (Generic, Show, Eq, NFData, Atomable)
13+ deriving (Generic, Show, Eq, Binary, NFData, Atomable)
14− deriving Serialise via WineryVariant Hair
15
14
16main :: IO ()
15main :: IO ()
17main = do
16main = do
@@ -32,13 +31,11 @@ main = do
32
31
33 --create a relation with the new Hair AtomType
32 --create a relation with the new Hair AtomType
34 let blond = NakedAtomExpr (toAtom Blond)
33 let blond = NakedAtomExpr (toAtom Blond)
35− eCheck $ executeDatabaseContextExpr sessionId conn
34+ eCheck $ executeDatabaseContextExpr sessionId conn (Assign "people" (MakeRelationFromExprs Nothing [
36− (Assign "people"
37− (MakeRelationFromExprs Nothing $ TupleExprs () [
38− TupleExpr (M.fromList [("hair", blond), ("name", NakedAtomExpr (TextAtom "Colin"))])]))
35+ TupleExpr (M.fromList [("hair", blond), ("name", NakedAtomExpr (TextAtom "Colin"))])]))
39
36
40 let restrictionPredicate = AttributeEqualityPredicate "hair" blond
37 let restrictionPredicate = AttributeEqualityPredicate "hair" blond
41 peopleRel <- eCheck $ executeRelationalExpr sessionId conn (Restrict restrictionPredicate (RelationVariable "people" ()))
38 peopleRel <- eCheck $ executeRelationalExpr sessionId conn (Restrict restrictionPredicate (RelationVariable "people" ()))
42
39
43 TIO.putStrLn (showRelation peopleRel)
40 TIO.putStrLn (showRelation peopleRel)
44−
41+
examples/out_of_the_tarpit.hs+7−11
@@ -1,5 +1,5 @@
1-- the Out-of-the-Tarpit example in Haskell and Project:M36
1-- the Out-of-the-Tarpit example in Haskell and Project:M36
2−{-# LANGUAGE DeriveAnyClass, DeriveGeneric, OverloadedStrings, DerivingVia #-}
2+{-# LANGUAGE DeriveAnyClass, DeriveGeneric, OverloadedStrings #-}
3import ProjectM36.Client
3import ProjectM36.Client
4import ProjectM36.DataTypes.Primitive
4import ProjectM36.DataTypes.Primitive
5import ProjectM36.Tupleable
5import ProjectM36.Tupleable
@@ -7,11 +7,11 @@ import ProjectM36.Relation
7import ProjectM36.Error
7import ProjectM36.Error
8import Data.Either
8import Data.Either
9import GHC.Generics
9import GHC.Generics
10+import Data.Binary
10import Control.DeepSeq
11import Control.DeepSeq
11import qualified Data.Text as T
12import qualified Data.Text as T
12import Data.Time.Calendar
13import Data.Time.Calendar
13import Data.Proxy
14import Data.Proxy
14−import Codec.Winery
15
15
16--create various database value (atom) types
16--create various database value (atom) types
17type Price = Double
17type Price = Double
@@ -21,20 +21,16 @@ type Name = T.Text
21type Address = T.Text
21type Address = T.Text
22
22
23data RoomType = Kitchen | Bathroom | LivingRoom
23data RoomType = Kitchen | Bathroom | LivingRoom
24− deriving (Generic, Atomable, Eq, Show, NFData)
24+ deriving (Generic, Atomable, Eq, Show, Binary, NFData)
25− deriving Serialise via WineryVariant RoomType
26
25
27data PriceBand = Low | Medium | High | Premium
26data PriceBand = Low | Medium | High | Premium
28− deriving (Generic, Atomable, Eq, Show, NFData)
27+ deriving (Generic, Atomable, Eq, Show, Binary, NFData)
29− deriving Serialise via WineryVariant PriceBand
30
28
31data AreaCode = City | Suburban | Rural
29data AreaCode = City | Suburban | Rural
32− deriving (Generic, Atomable, Eq, Show, NFData)
30+ deriving (Generic, Atomable, Eq, Show, Binary, NFData)
33− deriving Serialise via WineryVariant AreaCode
34
31
35data SpeedBand = VeryFastBand | FastBand | MediumBand | SlowBand
32data SpeedBand = VeryFastBand | FastBand | MediumBand | SlowBand
36− deriving (Generic, Atomable, Eq, Show, NFData)
33+ deriving (Generic, Atomable, Eq, Show, Binary, NFData)
37− deriving Serialise via WineryVariant SpeedBand
38
34
39main :: IO ()
35main :: IO ()
40main = do
36main = do
@@ -261,4 +257,4 @@ handleIOErrors m = do
261 [] -> pure (rights eErrs)
257 [] -> pure (rights eErrs)
262 errs -> handleError (Left (someErrors errs))
258 errs -> handleError (Left (someErrors errs))
263
259
264−
260+
examples/out_of_the_tarpit.tutd+4−4
@@ -3,9 +3,9 @@
3data Address = Address Text
3data Address = Address Text
4data Agent = Agent Text
4data Agent = Agent Text
5data Name = Name Text
5data Name = Name Text
6−data Price = Price Integer --dollars
6+data Price = Price Double
7data RoomType = Kitchen | Bathroom | LivingRoom
7data RoomType = Kitchen | Bathroom | LivingRoom
8−data PriceBand = Low | Med | High | Premium
8+data PriceBand = Low | Medium | High | Premium
9data AreaCode = City | Suburban | Rural
9data AreaCode = City | Suburban | Rural
10data SpeedBand = VeryFast | Fast | Medium | Slow
10data SpeedBand = VeryFast | Fast | Medium | Slow
11
11
@@ -57,9 +57,9 @@ constraint noOffersAfterSale (offer join decision where ^dayEarlierThan(@offerDa
57--1. identify offerPrices > 2000 (arbitrarily-chosen high price band which is not specified in the paper)
57--1. identify offerPrices > 2000 (arbitrarily-chosen high price band which is not specified in the paper)
58--2. remove the properties which have been sold
58--2. remove the properties which have been sold
59--3. group and count sub-relation and restrict by greater than 50
59--3. group and count sub-relation and restrict by greater than 50
60−constraint noMoreThan50PremiumProperties ((((property where ^gt(@price,Price 2000)) minus ((property join decision){address,agent,dateRegistered,photo,price})) group ({} as x) : {z:=gt(count(@x),50)}) {z}){} equals false
60+constraint noMoreThan50PremiumProperties ((((property where ^gt(offerPrice,2000.0)) minus ((property join decision){address,agent,dateRegistered,photo,price})) group ({} as x) : {z:=gt(count(@x),50)}) {z}){} equals false
61
61
62−constraint noBidderCanMakeMoreThan10BidsOnAProperty (((offer group ({all but bidderAddress} as bidder)) : {bidCount:=gt(count(@bidder),10)}) where ^gt(@bidCount,10)) {} equals false
62+constraint noBidderCanMakeMoreThan10BidsOnAProperty (((offer group ({all but bidderAddress} as bidder)) : {bidCount:=gt(count(@bidder),10)}) where ^gt(bidCount,10)) {} equals false
63
63
64-- sample data
64-- sample data
65
65
jupyter/TutorialD Notebook Walkthrough.ipynb+1−1
@@ -38,7 +38,7 @@
38 }
38 }
39 ],
39 ],
40 "source": [
40 "source": [
41− ":importexample cjdate"
41+ ":importexample date"
42 ]
42 ]
43 },
43 },
44 {
44 {
nix/sources.jsondeleted−50
@@ -1,50 +0,0 @@
1−{
2− "curryer": {
3− "branch": "master",
4− "description": "Fast Haskell RPC",
5− "homepage": null,
6− "owner": "agentm",
7− "repo": "curryer",
8− "rev": "74ecaac619ad1165a4517d5c0f4e530493bda130",
9− "sha256": "1izdvzj00k0y76ixm7dfgvq2fzphb8h4nzqgwkl3p0bg0806rsn1",
10− "type": "tarball",
11− "url": "https://github.com/agentm/curryer/archive/74ecaac619ad1165a4517d5c0f4e530493bda130.tar.gz",
12− "url_template": "https://github.com/<owner>/<repo>/archive/<rev>.tar.gz"
13− },
14− "niv": {
15− "branch": "master",
16− "description": "Easy dependency management for Nix projects",
17− "homepage": "https://github.com/nmattia/niv",
18− "owner": "nmattia",
19− "repo": "niv",
20− "rev": "1819632b5823e0527da28ad82fecd6be5136c1e9",
21− "sha256": "08jz17756qchq0zrqmapcm33nr4ms9f630mycc06i6zkfwl5yh5i",
22− "type": "tarball",
23− "url": "https://github.com/nmattia/niv/archive/1819632b5823e0527da28ad82fecd6be5136c1e9.tar.gz",
24− "url_template": "https://github.com/<owner>/<repo>/archive/<rev>.tar.gz"
25− },
26− "nixpkgs": {
27− "branch": "master",
28− "description": "Nix Packages collection",
29− "homepage": "",
30− "owner": "NixOS",
31− "repo": "nixpkgs",
32− "rev": "429c23aad0fce9ef38b0e60d55d7459c19d53ddc",
33− "sha256": "1nj8sh1fnxp07jdlvjkijwfd1pnsi2zj0ivy7a0dhx02g63byhg3",
34− "type": "tarball",
35− "url": "https://github.com/NixOS/nixpkgs/archive/429c23aad0fce9ef38b0e60d55d7459c19d53ddc.tar.gz",
36− "url_template": "https://github.com/<owner>/<repo>/archive/<rev>.tar.gz"
37− },
38− "streamly": {
39− "branch": "ac3af8749194f1788704dda8667d0b3807075cc2",
40− "description": "Beautiful Streaming, Concurrent and Reactive Composition (Haskell)",
41− "homepage": "https://hackage.haskell.org/package/streamly",
42− "owner": "composewell",
43− "repo": "streamly",
44− "rev": "ac3af8749194f1788704dda8667d0b3807075cc2",
45− "sha256": "04d8fk654vawdfs0dfidmq2awwgwi8x44iv8r7vqz70zkcsd5fij",
46− "type": "tarball",
47− "url": "https://github.com/composewell/streamly/archive/ac3af8749194f1788704dda8667d0b3807075cc2.tar.gz",
48− "url_template": "https://github.com/<owner>/<repo>/archive/<rev>.tar.gz"
49− }
50−}
nix/sources.nixdeleted−171
@@ -1,171 +0,0 @@
1−# This file has been generated by Niv.
2−
3−let
4−
5− #
6− # The fetchers. fetch_<type> fetches specs of type <type>.
7− #
8−
9− fetch_file = pkgs: name: spec:
10− let
11− name' = sanitizeName name + "-src";
12− in
13− if spec.builtin or true then
14− builtins_fetchurl { inherit (spec) url sha256; name = name'; }
15− else
16− pkgs.fetchurl { inherit (spec) url sha256; name = name'; };
17−
18− fetch_tarball = pkgs: name: spec:
19− let
20− name' = sanitizeName name + "-src";
21− in
22− if spec.builtin or true then
23− builtins_fetchTarball { name = name'; inherit (spec) url sha256; }
24− else
25− pkgs.fetchzip { name = name'; inherit (spec) url sha256; };
26−
27− fetch_git = name: spec:
28− let
29− ref =
30− if spec ? ref then spec.ref else
31− if spec ? branch then "refs/heads/${spec.branch}" else
32− if spec ? tag then "refs/tags/${spec.tag}" else
33− abort "In git source '${name}': Please specify `ref`, `tag` or `branch`!";
34− in
35− builtins.fetchGit { url = spec.repo; inherit (spec) rev; inherit ref; };
36−
37− fetch_local = spec: spec.path;
38−
39− fetch_builtin-tarball = name: throw
40− ''[${name}] The niv type "builtin-tarball" is deprecated. You should instead use `builtin = true`.
41− $ niv modify ${name} -a type=tarball -a builtin=true'';
42−
43− fetch_builtin-url = name: throw
44− ''[${name}] The niv type "builtin-url" will soon be deprecated. You should instead use `builtin = true`.
45− $ niv modify ${name} -a type=file -a builtin=true'';
46−
47− #
48− # Various helpers
49− #
50−
51− # https://github.com/NixOS/nixpkgs/pull/83241/files#diff-c6f540a4f3bfa4b0e8b6bafd4cd54e8bR695
52− sanitizeName = name:
53− (
54− concatMapStrings (s: if builtins.isList s then "-" else s)
55− (
56− builtins.split "[^[:alnum:]+._?=-]+"
57− ((x: builtins.elemAt (builtins.match "\\.*(.*)" x) 0) name)
58− )
59− );
60−
61− # The set of packages used when specs are fetched using non-builtins.
62− mkPkgs = sources: system:
63− let
64− sourcesNixpkgs =
65− import (builtins_fetchTarball { inherit (sources.nixpkgs) url sha256; }) { inherit system; };
66− hasNixpkgsPath = builtins.any (x: x.prefix == "nixpkgs") builtins.nixPath;
67− hasThisAsNixpkgsPath = <nixpkgs> == ./.;
68− in
69− if builtins.hasAttr "nixpkgs" sources
70− then sourcesNixpkgs
71− else if hasNixpkgsPath && ! hasThisAsNixpkgsPath then
72− import <nixpkgs> {}
73− else
74− abort
75− ''
76− Please specify either <nixpkgs> (through -I or NIX_PATH=nixpkgs=...) or
77− add a package called "nixpkgs" to your sources.json.
78− '';
79−
80− # The actual fetching function.
81− fetch = pkgs: name: spec:
82−
83− if ! builtins.hasAttr "type" spec then
84− abort "ERROR: niv spec ${name} does not have a 'type' attribute"
85− else if spec.type == "file" then fetch_file pkgs name spec
86− else if spec.type == "tarball" then fetch_tarball pkgs name spec
87− else if spec.type == "git" then fetch_git name spec
88− else if spec.type == "local" then fetch_local spec
89− else if spec.type == "builtin-tarball" then fetch_builtin-tarball name
90− else if spec.type == "builtin-url" then fetch_builtin-url name
91− else
92− abort "ERROR: niv spec ${name} has unknown type ${builtins.toJSON spec.type}";
93−
94− # If the environment variable NIV_OVERRIDE_${name} is set, then use
95− # the path directly as opposed to the fetched source.
96− replace = name: drv:
97− let
98− saneName = stringAsChars (c: if isNull (builtins.match "[a-zA-Z0-9]" c) then "_" else c) name;
99− ersatz = builtins.getEnv "NIV_OVERRIDE_${saneName}";
100− in
101− if ersatz == "" then drv else ersatz;
102−
103− # Ports of functions for older nix versions
104−
105− # a Nix version of mapAttrs if the built-in doesn't exist
106− mapAttrs = builtins.mapAttrs or (
107− f: set: with builtins;
108− listToAttrs (map (attr: { name = attr; value = f attr set.${attr}; }) (attrNames set))
109− );
110−
111− # https://github.com/NixOS/nixpkgs/blob/0258808f5744ca980b9a1f24fe0b1e6f0fecee9c/lib/lists.nix#L295
112− range = first: last: if first > last then [] else builtins.genList (n: first + n) (last - first + 1);
113−
114− # https://github.com/NixOS/nixpkgs/blob/0258808f5744ca980b9a1f24fe0b1e6f0fecee9c/lib/strings.nix#L257
115− stringToCharacters = s: map (p: builtins.substring p 1 s) (range 0 (builtins.stringLength s - 1));
116−
117− # https://github.com/NixOS/nixpkgs/blob/0258808f5744ca980b9a1f24fe0b1e6f0fecee9c/lib/strings.nix#L269
118− stringAsChars = f: s: concatStrings (map f (stringToCharacters s));
119− concatMapStrings = f: list: concatStrings (map f list);
120− concatStrings = builtins.concatStringsSep "";
121−
122− # https://github.com/NixOS/nixpkgs/blob/8a9f58a375c401b96da862d969f66429def1d118/lib/attrsets.nix#L331
123− optionalAttrs = cond: as: if cond then as else {};
124−
125− # fetchTarball version that is compatible between all the versions of Nix
126− builtins_fetchTarball = { url, name ? null, sha256 }@attrs:
127− let
128− inherit (builtins) lessThan nixVersion fetchTarball;
129− in
130− if lessThan nixVersion "1.12" then
131− fetchTarball ({ inherit url; } // (optionalAttrs (!isNull name) { inherit name; }))
132− else
133− fetchTarball attrs;
134−
135− # fetchurl version that is compatible between all the versions of Nix
136− builtins_fetchurl = { url, name ? null, sha256 }@attrs:
137− let
138− inherit (builtins) lessThan nixVersion fetchurl;
139− in
140− if lessThan nixVersion "1.12" then
141− fetchurl ({ inherit url; } // (optionalAttrs (!isNull name) { inherit name; }))
142− else
143− fetchurl attrs;
144−
145− # Create the final "sources" from the config
146− mkSources = config:
147− mapAttrs (
148− name: spec:
149− if builtins.hasAttr "outPath" spec
150− then abort
151− "The values in sources.json should not have an 'outPath' attribute"
152− else
153− spec // { outPath = replace name (fetch config.pkgs name spec); }
154− ) config.sources;
155−
156− # The "config" used by the fetchers
157− mkConfig =
158− { sourcesFile ? if builtins.pathExists ./sources.json then ./sources.json else null
159− , sources ? if isNull sourcesFile then {} else builtins.fromJSON (builtins.readFile sourcesFile)
160− , system ? builtins.currentSystem
161− , pkgs ? mkPkgs sources system
162− }: rec {
163− # The sources, i.e. the attribute set of spec name to spec
164− inherit sources;
165−
166− # The "pkgs" (evaluated nixpkgs) to use for e.g. non-builtin fetchers
167− inherit pkgs;
168− };
169−
170−in
171−mkSources (mkConfig {}) // { __functor = _: settings: mkSources (mkConfig settings); }
project-m36.cabal+217−188
@@ -1,8 +1,6 @@
1−Cabal-Version: 2.2
2Name: project-m36
1Name: project-m36
3−Version: 0.9.3
2+Version: 0.3
4−License: MIT
3+License: PublicDomain
5−--note that this license specification is erroneous and only labeled MIT to appease hackage which does not recognize public domain packages in cabal >2.2- Project:M36 is dedicated to the public domain
6Build-Type: Simple
4Build-Type: Simple
7Homepage: https://github.com/agentm/project-m36
5Homepage: https://github.com/agentm/project-m36
8Bug-Reports: https://github.com/agentm/project-m36/issues
6Bug-Reports: https://github.com/agentm/project-m36/issues
@@ -10,6 +8,7 @@ Author: AgentM
10Stability: experimental
8Stability: experimental
11Category: Relational Algebra
9Category: Relational Algebra
12Maintainer: agentm@themactionfaction.com
10Maintainer: agentm@themactionfaction.com
11+Cabal-Version: >= 1.10
13Synopsis: Relational Algebra Engine
12Synopsis: Relational Algebra Engine
14Description: A relational algebra engine which can be used to persist and query Haskell data types.
13Description: A relational algebra engine which can be used to persist and query Haskell data types.
15Extra-Source-Files: Changelog.markdown README.markdown
14Extra-Source-Files: Changelog.markdown README.markdown
@@ -23,27 +22,66 @@ Flag profiler
23 Default: False
22 Default: False
24 Manual: True
23 Manual: True
25
24
26−--flag to allow stack to use its older, pinned packages
27−Flag stack
28− Description: build with stack and stackage
29− Manual: True
30− Default: False
31−
32−Flag haskell-scripting
33− Description: enables Haskell scripting which links against GHC as a library
34− Manual: True
35− Default: True
36−
37Library
25Library
38− Build-Depends: base>=4.8 && < 4.15, ghc-paths, mtl, containers, unordered-containers, hashable, haskeline, directory, MonadRandom, random-shuffle, uuid >= 1.3.12, cassava >= 0.4.5.1 && < 0.6, text, bytestring, deepseq, deepseq-generics, vector, parallel, monad-parallel, exceptions, transformers, gnuplot, filepath, zlib, directory, temporary, stm, time, hashable-time, old-locale, rset, attoparsec, either, base64-bytestring, data-interval, extended-reals, aeson >= 1.1, path-pieces, conduit, resourcet, http-api-data, semigroups, QuickCheck, quickcheck-instances, list-t, stm-containers >= 0.2.15, foldl, optparse-applicative, Glob, cryptohash-sha256, text-manipulate >= 0.2.0.1 && < 0.4, winery, curryer-rpc, network, async, vector-instances, recursion-schemes, streamly >= 0.7.2, convertible
26+ Build-Depends: base>=4.8 && < 6.0
39− if flag(haskell-scripting)
27+ ,ghc >= 7.8 && < 8.3
40− Build-Depends: ghc >= 8.2 && < 8.11
28+ ,ghc-paths
41− CPP-Options: -DPM36_HASKELL_SCRIPTING
29+ ,mtl
42− if impl(ghc>= 8) && flag(haskell-scripting)
30+ ,containers
43− build-depends:
31+ ,unordered-containers
44− ghc-boot, ghci
32+ ,hashable
45− if impl(ghc>= 8.6)
33+ ,haskeline
46− Build-Depends: deferred-folds
34+ ,directory
35+ ,MonadRandom
36+ ,random-shuffle
37+ --critical uuid bug in lesser versions https://www.reddit.com/r/haskell/comments/4myot5/psa_make_sure_to_use_uuid_1312/
38+ ,uuid >= 1.3.12
39+ ,cassava >= 0.4.5.1 && < 0.6
40+ ,text
41+ ,bytestring
42+ ,deepseq
43+ ,deepseq-generics
44+ ,vector
45+ ,parallel
46+ ,monad-parallel
47+ ,transformers
48+ ,gnuplot
49+ ,binary
50+ ,filepath
51+ ,zlib
52+ ,directory
53+ ,vector-binary-instances
54+ ,temporary
55+ ,stm
56+ ,time
57+ ,hashable-time
58+ ,old-locale
59+ --used for CSV parsing
60+ ,attoparsec
61+ ,either
62+ ,base64-bytestring
63+ ,data-interval
64+ ,extended-reals
65+ ,network-transport
66+ -- aeson 1.1 and above includes instances for UUID types
67+ ,aeson >= 1.1
68+ ,path-pieces
69+ ,conduit
70+ ,resourcet
71+ ,http-api-data
72+--needed for remote access
73+ ,distributed-process-client-server >= 0.2.3
74+ ,distributed-process >= 0.6.6
75+ ,distributed-process-extras >= 0.3.2
76+ ,distributed-process-async >= 0.2.4
77+ ,network-transport-tcp
78+ ,network-transport
79+ ,list-t
80+ ,stm-containers >= 0.2.15
81+ ,optparse-applicative
82+ ,Glob
83+--used for hashing the transaction graph file to check for differences
84+ ,cryptohash-sha256
47 Exposed-Modules: ProjectM36.Error,
85 Exposed-Modules: ProjectM36.Error,
48 ProjectM36.Transaction,
86 ProjectM36.Transaction,
49 ProjectM36.TransactionGraph,
87 ProjectM36.TransactionGraph,
@@ -52,9 +90,6 @@ Library
52 ProjectM36.TransactionGraph.Merge,
90 ProjectM36.TransactionGraph.Merge,
53 ProjectM36.TransGraphRelationalExpression,
91 ProjectM36.TransGraphRelationalExpression,
54 ProjectM36.Base,
92 ProjectM36.Base,
55− ProjectM36.Serialise.Base,
56− ProjectM36.Serialise.Error,
57− ProjectM36.DataFrame,
58 ProjectM36.Attribute,
93 ProjectM36.Attribute,
59 ProjectM36.AttributeNames,
94 ProjectM36.AttributeNames,
60 ProjectM36.Tuple,
95 ProjectM36.Tuple,
@@ -63,7 +98,6 @@ Library
63 ProjectM36.AtomFunction,
98 ProjectM36.AtomFunction,
64 ProjectM36.AtomFunctionError,
99 ProjectM36.AtomFunctionError,
65 ProjectM36.ScriptSession,
100 ProjectM36.ScriptSession,
66− ProjectM36.Shortcuts,
67 ProjectM36.DatabaseContextFunction,
101 ProjectM36.DatabaseContextFunction,
68 ProjectM36.DatabaseContextFunctionError,
102 ProjectM36.DatabaseContextFunctionError,
69 ProjectM36.DatabaseContextFunctionUtils,
103 ProjectM36.DatabaseContextFunctionUtils,
@@ -77,32 +111,26 @@ Library
77 ProjectM36.Relation.Show.HTML,
111 ProjectM36.Relation.Show.HTML,
78 ProjectM36.StaticOptimizer,
112 ProjectM36.StaticOptimizer,
79 ProjectM36.Relation.Show.Term,
113 ProjectM36.Relation.Show.Term,
80− ProjectM36.WCWidth,
81 ProjectM36.Relation.Show.CSV,
114 ProjectM36.Relation.Show.CSV,
82 ProjectM36.Relation.Show.Gnuplot,
115 ProjectM36.Relation.Show.Gnuplot,
83 ProjectM36.Relation.Parse.CSV,
116 ProjectM36.Relation.Parse.CSV,
84 ProjectM36.IsomorphicSchema,
117 ProjectM36.IsomorphicSchema,
85 ProjectM36.InclusionDependency,
118 ProjectM36.InclusionDependency,
86− ProjectM36.MerkleHash,
87 ProjectM36.Client,
119 ProjectM36.Client,
88 ProjectM36.Client.Simple,
120 ProjectM36.Client.Simple,
89 ProjectM36.Persist,
121 ProjectM36.Persist,
90 ProjectM36.AtomType,
122 ProjectM36.AtomType,
91− ProjectM36.AttributeExpr,
92 ProjectM36.AtomFunctions.Basic,
123 ProjectM36.AtomFunctions.Basic,
93 ProjectM36.AtomFunctions.Primitive,
124 ProjectM36.AtomFunctions.Primitive,
94 ProjectM36.Atomable,
125 ProjectM36.Atomable,
95 ProjectM36.Tupleable,
126 ProjectM36.Tupleable,
96− ProjectM36.Tupleable.Deriving,
97 ProjectM36.DataConstructorDef,
127 ProjectM36.DataConstructorDef,
98 ProjectM36.DataTypes.Basic,
128 ProjectM36.DataTypes.Basic,
99− ProjectM36.DataTypes.Sorting,
100 ProjectM36.DataTypes.Day,
129 ProjectM36.DataTypes.Day,
101 ProjectM36.DataTypes.DateTime,
130 ProjectM36.DataTypes.DateTime,
102 ProjectM36.DataTypes.Either,
131 ProjectM36.DataTypes.Either,
103 ProjectM36.DataTypes.Maybe,
132 ProjectM36.DataTypes.Maybe,
104 ProjectM36.DataTypes.List,
133 ProjectM36.DataTypes.List,
105− ProjectM36.DataTypes.NonEmptyList,
106 ProjectM36.DataTypes.Primitive,
134 ProjectM36.DataTypes.Primitive,
107 ProjectM36.DataTypes.Interval,
135 ProjectM36.DataTypes.Interval,
108 ProjectM36.DataTypes.ByteString,
136 ProjectM36.DataTypes.ByteString,
@@ -114,42 +142,31 @@ Library
114 ProjectM36.Server.EntryPoints,
142 ProjectM36.Server.EntryPoints,
115 ProjectM36.Server.ParseArgs,
143 ProjectM36.Server.ParseArgs,
116 ProjectM36.Server.RemoteCallTypes,
144 ProjectM36.Server.RemoteCallTypes,
117− ProjectM36.Serialise.AtomFunctionError,
118− ProjectM36.Serialise.DataFrame,
119− ProjectM36.Serialise.DatabaseContextFunctionError,
120− ProjectM36.Serialise.IsomorphicSchema,
121 ProjectM36.Session,
145 ProjectM36.Session,
122 ProjectM36.Sessions,
146 ProjectM36.Sessions,
123 ProjectM36.Transaction.Persist,
147 ProjectM36.Transaction.Persist,
124 ProjectM36.TypeConstructor,
148 ProjectM36.TypeConstructor,
125 ProjectM36.TypeConstructorDef,
149 ProjectM36.TypeConstructorDef,
126 ProjectM36.FileLock,
150 ProjectM36.FileLock,
127− ProjectM36.FSType,
151+ ProjectM36.FSType
128− ProjectM36.Arbitrary,
129− ProjectM36.GraphRefRelationalExpr,
130− ProjectM36.NormalizeExpr,
131− ProjectM36.TransactionInfo,
132− ProjectM36.WithNameExpr
133− GHC-Options: -Wall -rdynamic
152+ GHC-Options: -Wall
134 if os(windows)
153 if os(windows)
135− Build-Depends: Win32 >= 2.5.4.1
154+ Build-Depends: Win32 >= 2.3
136 Other-Modules: ProjectM36.Win32Handle
155 Other-Modules: ProjectM36.Win32Handle
137 else
156 else
138− --219- too many exported symbols under Windows and GHC 8.4
139− GHC-Options: -rdynamic -fexternal-interpreter
140 C-sources: cbits/DirectoryFsync.c, cbits/darwin_statfs.c
157 C-sources: cbits/DirectoryFsync.c, cbits/darwin_statfs.c
141 Build-Depends: unix
158 Build-Depends: unix
142 CC-Options: -fPIC
159 CC-Options: -fPIC
143 Hs-Source-Dirs: ./src/lib
160 Hs-Source-Dirs: ./src/lib
144 Default-Language: Haskell2010
161 Default-Language: Haskell2010
145 Default-Extensions: OverloadedStrings, CPP
162 Default-Extensions: OverloadedStrings, CPP
146− if !flag(stack)
163+ if impl(ghc>= 8)
147− Build-Depends: deferred-folds
164+ build-depends:
165+ ghc-boot
148
166
149Executable tutd
167Executable tutd
150− if flag(haskell-scripting)
151− Build-Depends: ghc >= 8.2 && < 8.11
152 Build-Depends: base >=4.8 && <5.0,
168 Build-Depends: base >=4.8 && <5.0,
169+ ghc >= 7.8 && < 8.3,
153 ghc-paths,
170 ghc-paths,
154 project-m36,
171 project-m36,
155 containers,
172 containers,
@@ -163,11 +180,13 @@ Executable tutd
163 MonadRandom, MonadRandom,
180 MonadRandom, MonadRandom,
164 vector,
181 vector,
165 text,
182 text,
183+ vector-binary-instances,
166 time,
184 time,
167 hashable-time,
185 hashable-time,
168 bytestring,
186 bytestring,
169 stm,
187 stm,
170 deepseq,
188 deepseq,
189+ binary,
171 data-interval,
190 data-interval,
172 parallel,
191 parallel,
173 cassava,
192 cassava,
@@ -175,23 +194,14 @@ Executable tutd
175 directory,
194 directory,
176 filepath,
195 filepath,
177 temporary,
196 temporary,
178− megaparsec >= 5.2.0 && < 10,
197+ megaparsec >= 5.2.0 && < 5.4,
179 haskeline,
198 haskeline,
180 random, MonadRandom,
199 random, MonadRandom,
181 base64-bytestring,
200 base64-bytestring,
182 optparse-applicative,
201 optparse-applicative,
183 attoparsec,
202 attoparsec,
184− stm-containers >= 1.0.0,
203+ stm-containers,
185− list-t,
204+ list-t
186− parser-combinators,
187− curryer-rpc,
188− prettyprinter,
189− cryptohash-sha256,
190− --due to decode signature change
191− base16-bytestring >= 1.0.0.0,
192− http-conduit,
193− modern-uri,
194− http-types
195 Other-Modules: TutorialD.Interpreter,
205 Other-Modules: TutorialD.Interpreter,
196 TutorialD.Interpreter.Base,
206 TutorialD.Interpreter.Base,
197 TutorialD.Interpreter.DatabaseContextExpr,
207 TutorialD.Interpreter.DatabaseContextExpr,
@@ -210,21 +220,20 @@ Executable tutd
210 TutorialD.Interpreter.SchemaOperator,
220 TutorialD.Interpreter.SchemaOperator,
211 TutorialD.Interpreter.TransGraphRelationalOperator,
221 TutorialD.Interpreter.TransGraphRelationalOperator,
212 TutorialD.Interpreter.SchemaOperator
222 TutorialD.Interpreter.SchemaOperator
213− TutorialD.Printer
214 main-is: TutorialD/tutd.hs
223 main-is: TutorialD/tutd.hs
215 CC-Options: -fPIC
224 CC-Options: -fPIC
216− GHC-Options: -Wall -threaded
225+ GHC-Options: -Wall
217 Hs-Source-Dirs: ./src/bin
226 Hs-Source-Dirs: ./src/bin
218 Default-Language: Haskell2010
227 Default-Language: Haskell2010
219 Default-Extensions: OverloadedStrings
228 Default-Extensions: OverloadedStrings
220
229
221Executable project-m36-server
230Executable project-m36-server
222− if flag(haskell-scripting)
223− Build-Depends: ghc >= 8.2 && < 8.11
224 Build-Depends: base,
231 Build-Depends: base,
232+ ghc >= 7.8 && < 8.3,
225 ghc-paths,
233 ghc-paths,
226− transformers,
227 project-m36,
234 project-m36,
235+ binary,
236+ transformers,
228 temporary,
237 temporary,
229 data-interval,
238 data-interval,
230 deepseq,
239 deepseq,
@@ -237,6 +246,7 @@ Executable project-m36-server
237 optparse-applicative,
246 optparse-applicative,
238 hashable-time,
247 hashable-time,
239 time,
248 time,
249+ vector-binary-instances,
240 text,
250 text,
241 deepseq-generics,
251 deepseq-generics,
242 mtl,
252 mtl,
@@ -258,7 +268,7 @@ Executable project-m36-server
258Executable bigrel
268Executable bigrel
259 Default-Language: Haskell2010
269 Default-Language: Haskell2010
260 Default-Extensions: OverloadedStrings
270 Default-Extensions: OverloadedStrings
261− Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, optparse-applicative, stm-containers, list-t, ghc, ghc-paths, transformers, project-m36, random, MonadRandom, semigroups, parser-combinators
271+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, optparse-applicative, stm-containers, list-t, ghc, ghc-paths, transformers, project-m36, random, MonadRandom, semigroups
262 Other-Modules: TutorialD.Interpreter.Base,
272 Other-Modules: TutorialD.Interpreter.Base,
263 TutorialD.Interpreter.DatabaseContextExpr,
273 TutorialD.Interpreter.DatabaseContextExpr,
264 TutorialD.Interpreter.RelationalExpr,
274 TutorialD.Interpreter.RelationalExpr,
@@ -269,13 +279,6 @@ Executable bigrel
269 if flag(profiler)
279 if flag(profiler)
270 GHC-Prof-Options: -fprof-auto -rtsopts -threaded -Wall
280 GHC-Prof-Options: -fprof-auto -rtsopts -threaded -Wall
271
281
272−Common commontest
273− Default-Language: Haskell2010
274− Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics,parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, websockets, optparse-applicative, network, aeson, project-m36, random, MonadRandom, semigroups, parser-combinators, winery, curryer-rpc, prettyprinter, base64-bytestring, modern-uri, http-types, http-conduit, base16-bytestring,cryptohash-sha256
275− Default-Extensions: OverloadedStrings
276− GHC-Options: -Wall -threaded
277− Hs-Source-Dirs: test, src/bin
278−
279Benchmark basic-benchmark
282Benchmark basic-benchmark
280 Default-Language: Haskell2010
283 Default-Language: Haskell2010
281 Default-Extensions: OverloadedStrings
284 Default-Extensions: OverloadedStrings
@@ -287,202 +290,233 @@ Benchmark basic-benchmark
287 if flag(profiler)
290 if flag(profiler)
288 GHC-Prof-Options: -fprof-auto -rtsopts -threaded -Wall
291 GHC-Prof-Options: -fprof-auto -rtsopts -threaded -Wall
289
292
290−--benchmark inserts, updates, deletes for a basic use-case to shake out any space leaks
291−Benchmark update-exprs
292− Default-Language: Haskell2010
293− Default-Extensions: OverloadedStrings
294− Build-Depends: base, criterion, project-m36, text, winery
295− Main-Is: benchmark/Server.hs
296− Type: exitcode-stdio-1.0
297− GHC-Options: -Wall -threaded -rtsopts
298− HS-Source-Dirs: ./src/bin
299− if flag(profiler)
300− GHC-Prof-Options: -fprof-auto -rtsopts -threaded -Wall -fexternal-interpreter
301−
302Test-Suite test-tutoriald
293Test-Suite test-tutoriald
303− import: commontest
294+ Default-Language: Haskell2010
295+ Default-Extensions: OverloadedStrings
304 type: exitcode-stdio-1.0
296 type: exitcode-stdio-1.0
305− main-is: TutorialD/InterpreterTest.hs
297+ main-is: test/TutorialD/Interpreter.hs
306− Other-Modules: TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.TransactionGraphOperator, TutorialD.Interpreter.Types, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.TestBase, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.SchemaOperator, TutorialD.Printer
307− Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, stm-containers, list-t, project-m36, random, MonadRandom, semigroups, parser-combinators, prettyprinter
298+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, stm-containers, list-t, project-m36, random, MonadRandom, semigroups
299+ Other-Modules: TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.TransactionGraphOperator, TutorialD.Interpreter.Types, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.TestBase, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.SchemaOperator
300+ GHC-Options: -Wall
301+ Hs-Source-Dirs: ./src/bin, ., test
308
302
309Test-Suite test-tutoriald-atomfunctionscript
303Test-Suite test-tutoriald-atomfunctionscript
310− import: commontest
304+ Default-Language: Haskell2010
305+ Default-Extensions: OverloadedStrings
311 type: exitcode-stdio-1.0
306 type: exitcode-stdio-1.0
312− Other-Modules: TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.TestBase, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.TransactionGraphOperator, TutorialD.Interpreter.Types, TutorialD.Interpreter.SchemaOperator, TutorialD.Printer
307+ Other-Modules: TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.TestBase, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.TransactionGraphOperator, TutorialD.Interpreter.Types, TutorialD.Interpreter.SchemaOperator
313− main-is: TutorialD/Interpreter/AtomFunctionScript.hs
308+ main-is: test/TutorialD/Interpreter/AtomFunctionScript.hs
309+ Build-Depends: base, HUnit, project-m36, uuid, containers, megaparsec, text, vector, directory, bytestring, mtl, haskeline, random, MonadRandom, semigroups, time
310+ GHC-Options: -Wall
311+ Hs-Source-Dirs: ./src/bin, ./test, .
314
312
315Test-Suite test-tutoriald-databasecontextfunctionscript
313Test-Suite test-tutoriald-databasecontextfunctionscript
316− import: commontest
314+ Default-Language: Haskell2010
315+ Default-Extensions: OverloadedStrings
317 type: exitcode-stdio-1.0
316 type: exitcode-stdio-1.0
318− Other-Modules: TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.TestBase, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.TransactionGraphOperator, TutorialD.Interpreter.Types, TutorialD.Interpreter.SchemaOperator, TutorialD.Printer
317+ Other-Modules: TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.TestBase, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.TransactionGraphOperator, TutorialD.Interpreter.Types, TutorialD.Interpreter.SchemaOperator
319− main-is: TutorialD/Interpreter/DatabaseContextFunctionScript.hs
318+ main-is: test/TutorialD/Interpreter/DatabaseContextFunctionScript.hs
319+ Build-Depends: base, HUnit, project-m36, uuid, containers, megaparsec, text, vector, directory, bytestring, mtl, haskeline, random, MonadRandom, semigroups, time
320+ GHC-Options: -Wall
321+ Hs-Source-Dirs: ./src/bin, ./test, .
320
322
321Test-Suite test-relation
323Test-Suite test-relation
322− import: commontest
324+ Default-Language: Haskell2010
325+ Default-Extensions: OverloadedStrings
323 type: exitcode-stdio-1.0
326 type: exitcode-stdio-1.0
324− main-is: Relation/Basic.hs
327+ main-is: test/Relation/Basic.hs
328+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, stm-containers, project-m36, transformers
329+ GHC-Options: -Wall
325
330
326Test-Suite test-static-optimizer
331Test-Suite test-static-optimizer
327− import: commontest
332+ Default-Language: Haskell2010
333+ Default-Extensions: OverloadedStrings
328 type: exitcode-stdio-1.0
334 type: exitcode-stdio-1.0
329− main-is: Relation/StaticOptimizer.hs
335+ main-is: test/Relation/StaticOptimizer.hs
336+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, stm-containers, project-m36, transformers
337+ GHC-Options: -Wall
330
338
331Test-Suite test-transactiongraph-persist
339Test-Suite test-transactiongraph-persist
332− import: commontest
340+ Default-Language: Haskell2010
341+ Default-Extensions: OverloadedStrings
333 type: exitcode-stdio-1.0
342 type: exitcode-stdio-1.0
334− main-is: TransactionGraph/Persist.hs
343+ main-is: test/TransactionGraph/Persist.hs
344+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, stm-containers, project-m36, random, MonadRandom, semigroups
335− Other-Modules: TutorialD.Interpreter.Base, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.Types, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Printer
345+ Other-Modules: TutorialD.Interpreter.Base, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.Types, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.Import.BasicExamples
346+ Hs-Source-Dirs: ., ./src/bin
347+ GHC-Options: -Wall
336
348
337Test-Suite test-relation-import-csv
349Test-Suite test-relation-import-csv
338− import: commontest
350+ Default-Language: Haskell2010
351+ Default-Extensions: OverloadedStrings
339 type: exitcode-stdio-1.0
352 type: exitcode-stdio-1.0
340− main-is: Relation/Import/CSV.hs
353+ main-is: test/Relation/Import/CSV.hs
354+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, stm-containers, project-m36
355+ GHC-Options: -Wall
341
356
342Test-Suite test-tutoriald-import-tutoriald
357Test-Suite test-tutoriald-import-tutoriald
343− import: commontest
358+ Default-Language: Haskell2010
359+ Default-Extensions: OverloadedStrings
344 type: exitcode-stdio-1.0
360 type: exitcode-stdio-1.0
345− main-is: TutorialD/Interpreter/Import/ImportTest.hs
361+ main-is: test/TutorialD/Interpreter/Import/TutorialD.hs
362+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, stm-containers, project-m36, random, MonadRandom, semigroups
346− Other-Modules: TutorialD.Interpreter.Base, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.Types, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Printer
363+ Other-Modules: TutorialD.Interpreter.Base, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.Types, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.Import.BasicExamples
364+ GHC-Options: -Wall
365+ Hs-Source-Dirs: ., ./src/bin
347
366
348Test-Suite test-relation-export-csv
367Test-Suite test-relation-export-csv
349− import: commontest
368+ Default-Language: Haskell2010
369+ Default-Extensions: OverloadedStrings
350 type: exitcode-stdio-1.0
370 type: exitcode-stdio-1.0
351− main-is: Relation/Export/CSV.hs
371+ main-is: test/Relation/Export/CSV.hs
372+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, stm-containers, project-m36
373+ GHC-Options: -Wall
352
374
353Test-Suite test-transactiongraph-merge
375Test-Suite test-transactiongraph-merge
354− import: commontest
376+ Default-Language: Haskell2010
355− type: exitcode-stdio-1.0
377+ Default-Extensions: OverloadedStrings
356− main-is: TransactionGraph/Merge.hs
357−
358−
359−Test-Suite test-prettyprinter
360− import: commontest
361 type: exitcode-stdio-1.0
378 type: exitcode-stdio-1.0
362− main-is: TutorialD/PrinterTest.hs
379+ main-is: test/TransactionGraph/Merge.hs
363− Other-Modules: TutorialD.Printer, TutorialD.Interpreter.Base, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.Types
380+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, template-haskell, transformers, aeson, conduit, either, path-pieces, http-api-data, stm-containers, list-t, project-m36
381+ GHC-Options: -Wall
364
382
365benchmark bench
383benchmark bench
366− import: commontest
384+ Default-Language: Haskell2010
385+ Default-Extensions: OverloadedStrings
367 type: exitcode-stdio-1.0
386 type: exitcode-stdio-1.0
368 main-is: benchmark/Relation.hs
387 main-is: benchmark/Relation.hs
388+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, criterion, stm-containers, project-m36
389+ GHC-Options: -Wall -rtsopts
390+ Hs-Source-Dirs: ./src/bin
369
391
370Test-Suite test-server
392Test-Suite test-server
371− import: commontest
393+ Default-Language: Haskell2010
394+ Default-Extensions: OverloadedStrings
372 type: exitcode-stdio-1.0
395 type: exitcode-stdio-1.0
373− main-is: Server/Main.hs
396+ main-is: test/Server/Main.hs
374−
397+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, network-transport-tcp, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, project-m36, network-transport, semigroups
398+ HS-Source-Dirs: ., ./src/bin
399+ GHC-Options: -Wall
375
400
376Executable Example-SimpleClient
401Executable Example-SimpleClient
377 Default-Language: Haskell2010
402 Default-Language: Haskell2010
378 Default-Extensions: OverloadedStrings
403 Default-Extensions: OverloadedStrings
379− Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics,parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, ghc, ghc-paths, project-m36, random, MonadRandom
404+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, ghc, ghc-paths, project-m36, random, MonadRandom
380 Main-Is: examples/SimpleClient.hs
405 Main-Is: examples/SimpleClient.hs
381− GHC-Options: -Wall -threaded
406+ GHC-Options: -Wall
382
407
383Executable Example-OutOfTheTarpit
408Executable Example-OutOfTheTarpit
384 Default-Language: Haskell2010
409 Default-Language: Haskell2010
385 Default-Extensions: OverloadedStrings
410 Default-Extensions: OverloadedStrings
386− Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics,parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, aeson, path-pieces, either, conduit, http-api-data, template-haskell, ghc, ghc-paths, project-m36, winery
411+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, aeson, path-pieces, either, conduit, http-api-data, template-haskell, ghc, ghc-paths, project-m36
387 Main-Is: examples/out_of_the_tarpit.hs
412 Main-Is: examples/out_of_the_tarpit.hs
388− GHC-Options: -Wall -threaded
413+ GHC-Options: -Wall
389
414
390Executable Example-Blog
415Executable Example-Blog
391 Default-Language: Haskell2010
416 Default-Language: Haskell2010
392 Default-Extensions: OverloadedStrings
417 Default-Extensions: OverloadedStrings
393− Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics,parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, aeson, path-pieces, either, conduit, http-api-data, template-haskell, ghc, ghc-paths, project-m36, scotty, blaze-html, http-types, winery
418+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, aeson, path-pieces, either, conduit, http-api-data, template-haskell, ghc, ghc-paths, project-m36, scotty, blaze-html, http-types
394 Main-Is: examples/blog.hs
419 Main-Is: examples/blog.hs
395− GHC-Options: -Wall -threaded
420+ GHC-Options: -Wall
421+
396
422
397Executable Example-Hair
423Executable Example-Hair
398 Default-Language: Haskell2010
424 Default-Language: Haskell2010
399 Default-Extensions: OverloadedStrings
425 Default-Extensions: OverloadedStrings
400− Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics,parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, aeson, path-pieces, either, conduit, http-api-data, template-haskell, ghc, ghc-paths, project-m36, winery
426+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, aeson, path-pieces, either, conduit, http-api-data, template-haskell, ghc, ghc-paths, project-m36
401 Main-Is: examples/hair.hs
427 Main-Is: examples/hair.hs
402− GHC-Options: -Wall -threaded
428+ GHC-Options: -Wall
403
429
404−Executable Example-Plantfarm
430+Test-Suite test-scripts
405− Default-Language: Haskell2010
406− Default-Extensions: OverloadedStrings
407− Build-Depends: aeson, barbies, base, binary, containers, deepseq, hashable, project-m36, random, scotty, text, winery
408− Main-Is: examples/Plantfarm.hs
409− GHC-Options: -Wall -threaded
410−
411−Executable Example-CustomTupleable
412 Default-Language: Haskell2010
431 Default-Language: Haskell2010
413 Default-Extensions: OverloadedStrings
432 Default-Extensions: OverloadedStrings
414− Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics,parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, aeson, path-pieces, either, conduit, http-api-data, template-haskell, ghc, ghc-paths, project-m36, winery
415− Main-Is: examples/CustomTupleable.hs
416− GHC-Options: -Wall -threaded
417−
418−Executable Example-DerivingCustomTupleable
419− if impl(ghc>=8.6)
420− Buildable: True
421− else
422− Buildable: False
423− Default-Language: Haskell2010
424− Build-Depends: base, text, deepseq, project-m36, winery
425− Main-Is: examples/DerivingCustomTupleable.hs
426− GHC-Options: -Wall -threaded
427−
428−Test-Suite test-scripts
429− import: commontest
430 type: exitcode-stdio-1.0
433 type: exitcode-stdio-1.0
431− main-is: scripts.hs
434+ main-is: test/scripts.hs
435+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, network-transport-tcp, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, project-m36, random, MonadRandom, semigroups
432− Other-Modules: TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.Types, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Printer
436+ Other-Modules: TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.Types, TutorialD.Interpreter.Import.BasicExamples
437+ GHC-Options: -Wall
438+ Hs-Source-Dirs: ., ./src/bin
433
439
434Executable project-m36-websocket-server
440Executable project-m36-websocket-server
435 Default-Language: Haskell2010
441 Default-Language: Haskell2010
436− Build-Depends: base, aeson, path-pieces, either, conduit, http-api-data, template-haskell, websockets, aeson, optparse-applicative, project-m36, containers, bytestring, text, vector, uuid, megaparsec, haskeline, mtl, directory, base64-bytestring, random, MonadRandom, time, semigroups, attoparsec, parser-combinators, prettyprinter, network, modern-uri, http-conduit, base16-bytestring, http-types, cryptohash-sha256, wai, wai-websockets, warp, warp-tls
442+ Build-Depends: base, aeson, path-pieces, either, conduit, http-api-data, template-haskell, websockets, aeson, optparse-applicative, project-m36, containers, bytestring, text, vector, uuid, megaparsec, haskeline, mtl, directory, base64-bytestring, random, MonadRandom, time, network-transport-tcp, semigroups, attoparsec
437 Main-Is: ProjectM36/Server/WebSocket/websocket-server.hs
443 Main-Is: ProjectM36/Server/WebSocket/websocket-server.hs
438− Other-Modules: ProjectM36.Client.Json, ProjectM36.Server.RemoteCallTypes.Json, ProjectM36.Server.WebSocket, TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.TransactionGraphOperator, TutorialD.Interpreter.Types, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.SchemaOperator, TutorialD.Printer
444+ Other-Modules: ProjectM36.Client.Json, ProjectM36.Server.RemoteCallTypes.Json, ProjectM36.Server.WebSocket, TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.TransactionGraphOperator, TutorialD.Interpreter.Types, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.SchemaOperator
439− GHC-Options: -Wall -threaded
445+ GHC-Options: -Wall
440 Hs-Source-Dirs: ./src/bin
446 Hs-Source-Dirs: ./src/bin
441 Default-Extensions: OverloadedStrings
447 Default-Extensions: OverloadedStrings
442
448
443Test-Suite test-websocket-server
449Test-Suite test-websocket-server
444− import: commontest
450+ Default-Language: Haskell2010
445 type: exitcode-stdio-1.0
451 type: exitcode-stdio-1.0
446− main-is: Server/WebSocket.hs
452+ main-is: test/Server/WebSocket.hs
453+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, websockets, optparse-applicative, network, aeson, project-m36, random, MonadRandom, network-transport-tcp, semigroups
447− Other-Modules: TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.TransactionGraphOperator, ProjectM36.Client.Json, ProjectM36.Server.RemoteCallTypes.Json, ProjectM36.Server.WebSocket, TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.Types, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.SchemaOperator, TutorialD.Printer
454+ Other-Modules: TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.TransactionGraphOperator, ProjectM36.Client.Json, ProjectM36.Server.RemoteCallTypes.Json, ProjectM36.Server.WebSocket, TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.Types, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.SchemaOperator
455+ Default-Extensions: OverloadedStrings
456+ GHC-Options: -Wall
457+ Hs-Source-Dirs: ./src/bin, .
448
458
449Test-Suite test-isomorphic-schemas
459Test-Suite test-isomorphic-schemas
450− import: commontest
460+ Default-Language: Haskell2010
451 type: exitcode-stdio-1.0
461 type: exitcode-stdio-1.0
452− main-is: IsomorphicSchema.hs
462+ main-is: test/IsomorphicSchema.hs
463+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, websockets, optparse-applicative, network, aeson, project-m36
464+ Default-Extensions: OverloadedStrings
465+ GHC-Options: -Wall
466+ Hs-Source-Dirs: ./src/bin, .
453
467
454Test-Suite test-atomable
468Test-Suite test-atomable
455− import: commontest
469+ Default-Language: Haskell2010
456 type: exitcode-stdio-1.0
470 type: exitcode-stdio-1.0
457− main-is: Relation/Atomable.hs
471+ main-is: test/Relation/Atomable.hs
472+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, websockets, optparse-applicative, network, aeson, project-m36, random, MonadRandom, semigroups
458− Other-Modules: TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.SchemaOperator, TutorialD.Interpreter.TestBase, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.TransactionGraphOperator, TutorialD.Interpreter.Types, TutorialD.Printer
473+ Other-Modules: TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.SchemaOperator, TutorialD.Interpreter.TestBase, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.TransactionGraphOperator, TutorialD.Interpreter.Types
474+ Default-Extensions: OverloadedStrings
475+ GHC-Options: -Wall
476+ Hs-Source-Dirs: ./src/bin, ., test/
459
477
460Test-Suite test-multiprocess-access
478Test-Suite test-multiprocess-access
461− import: commontest
479+ Default-Language: Haskell2010
462 type: exitcode-stdio-1.0
480 type: exitcode-stdio-1.0
463− main-is: MultiProcessDatabaseAccess.hs
481+ main-is: test/MultiProcessDatabaseAccess.hs
482+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, websockets, optparse-applicative, network, aeson, project-m36, random, MonadRandom
483+ Default-Extensions: OverloadedStrings
484+ GHC-Options: -Wall
485+ Hs-Source-Dirs: ./src/bin, ., test/
464
486
465Test-Suite test-transactiongraph-automerge
487Test-Suite test-transactiongraph-automerge
466− import: commontest
488+ Default-Language: Haskell2010
467 type: exitcode-stdio-1.0
489 type: exitcode-stdio-1.0
468− main-is: TransactionGraph/Automerge.hs
490+ main-is: test/TransactionGraph/Automerge.hs
491+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, websockets, optparse-applicative, network, aeson, project-m36, random, MonadRandom, semigroups
469− Other-Modules: TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.SchemaOperator, TutorialD.Interpreter.TestBase, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.TransactionGraphOperator, TutorialD.Interpreter.Types, TutorialD.Printer
492+ Other-Modules: TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.SchemaOperator, TutorialD.Interpreter.TestBase, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.TransactionGraphOperator, TutorialD.Interpreter.Types
493+ Default-Extensions: OverloadedStrings
494+ GHC-Options: -Wall
495+ Hs-Source-Dirs: ./src/bin, ., test/
470
496
471Test-Suite test-tupleable
497Test-Suite test-tupleable
472− import: commontest
498+ Default-Language: Haskell2010
473 type: exitcode-stdio-1.0
499 type: exitcode-stdio-1.0
474− main-is: Relation/Tupleable.hs
500+ main-is: test/Relation/Tupleable.hs
501+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, websockets, optparse-applicative, network, aeson, project-m36, random, MonadRandom, semigroups
502+ Default-Extensions: OverloadedStrings
503+ GHC-Options: -Wall
504+ Hs-Source-Dirs: ./src/bin, ., test/
475
505
476Test-Suite test-client-simple
506Test-Suite test-client-simple
477− import: commontest
507+ Default-Language: Haskell2010
478− Main-Is: Client/Simple.hs
508+ Main-Is: test/Client/Simple.hs
479 type: exitcode-stdio-1.0
509 type: exitcode-stdio-1.0
510+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, transformers, stm-containers, list-t, websockets, optparse-applicative, network, aeson, project-m36, random, MonadRandom, semigroups
511+ Default-Extensions: OverloadedStrings
512+ GHC-Options: -Wall
513+ Hs-Source-Dirs: ./src/bin, ., test/
480
514
481-- test for file handle leaks
515-- test for file handle leaks
482Executable handles
516Executable handles
483 Default-Language: Haskell2010
517 Default-Language: Haskell2010
484 Default-Extensions: OverloadedStrings
518 Default-Extensions: OverloadedStrings
485− Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics,parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, optparse-applicative, stm-containers, list-t, ghc, ghc-paths, transformers, project-m36, random, MonadRandom, semigroups, parser-combinators, prettyprinter, modern-uri, http-types, http-conduit, base16-bytestring, cryptohash-sha256
519+ Build-Depends: base, HUnit, Cabal, containers, hashable, unordered-containers, mtl, vector, vector-binary-instances, time, hashable-time, bytestring, uuid, stm, deepseq, deepseq-generics, binary, parallel, cassava, attoparsec, gnuplot, directory, temporary, haskeline, megaparsec, text, base64-bytestring, data-interval, filepath, optparse-applicative, stm-containers, list-t, ghc, ghc-paths, transformers, project-m36, random, MonadRandom, semigroups
486 main-is: benchmark/Handles.hs
520 main-is: benchmark/Handles.hs
487 Other-Modules: TutorialD.Interpreter,
521 Other-Modules: TutorialD.Interpreter,
488 TutorialD.Interpreter.Base,
522 TutorialD.Interpreter.Base,
@@ -501,14 +535,9 @@ Executable handles
501 TutorialD.Interpreter.TransGraphRelationalOperator,
535 TutorialD.Interpreter.TransGraphRelationalOperator,
502 TutorialD.Interpreter.TransactionGraphOperator,
536 TutorialD.Interpreter.TransactionGraphOperator,
503 TutorialD.Interpreter.Types
537 TutorialD.Interpreter.Types
504− TutorialD.Printer
505 GHC-Options: -Wall -threaded -rtsopts
538 GHC-Options: -Wall -threaded -rtsopts
506 HS-Source-Dirs: ./src/bin
539 HS-Source-Dirs: ./src/bin
507 if flag(profiler)
540 if flag(profiler)
508 GHC-Prof-Options: -fprof-auto -rtsopts -threaded -Wall
541 GHC-Prof-Options: -fprof-auto -rtsopts -threaded -Wall
509−
542+
510−Test-Suite test-dataframe
543+
511− import: commontest
512− type: exitcode-stdio-1.0
513− Main-Is: DataFrame.hs
514− Other-Modules: TutorialD.Interpreter, TutorialD.Interpreter.Base, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.DatabaseContextIOOperator, TutorialD.Interpreter.Export.Base, TutorialD.Interpreter.Export.CSV, TutorialD.Interpreter.Import.Base, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Interpreter.Import.CSV, TutorialD.Interpreter.Import.TutorialD, TutorialD.Interpreter.InformationOperator, TutorialD.Interpreter.RODatabaseContextOperator, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.SchemaOperator, TutorialD.Interpreter.TestBase, TutorialD.Interpreter.TransGraphRelationalOperator, TutorialD.Interpreter.TransactionGraphOperator, TutorialD.Interpreter.Types, TutorialD.Printer
release.nixdeleted−36
@@ -1,36 +0,0 @@
1−{ compiler ? "ghc8104"
2−, sources ? import ./nix/sources.nix
3−, pkgs ? import sources.nixpkgs { }
4−}:
5−let
6− doJailbreak = pkgs.haskell.lib.doJailbreak;
7− needsCocoa = drv:
8− if pkgs.stdenv.isDarwin
9− then drv.overrideDerivation (old:
10− { buildInputs = [ pkgs.darwin.apple_sdk.frameworks.Cocoa ] ++ old.buildInputs; }
11− )
12− else drv;
13−
14− haskellPackages = pkgs.haskell.packages.${compiler}.override {
15− overrides = self: super: {
16− curryer-rpc = self.callCabal2nix "curryer-rpc" sources.curryer { };
17− streamly = doJailbreak (needsCocoa (self.callCabal2nix "streamly" sources.streamly { }));
18− project-m36 = ((self.callCabal2nixWithOptions "project-m36" ./. "-f-haskell-scripting" { }));
19− };
20− };
21−in
22−{
23− project = haskellPackages.project-m36;
24−
25− shell = haskellPackages.shellFor {
26− packages = p: [
27− p.project-m36
28− ];
29− buildInputs = [
30− haskellPackages.ghcid
31− haskellPackages.hlint
32− pkgs.docker
33− ];
34− withHoogle = true;
35− };
36−}
runghcid.sh+1−1
@@ -1,2 +1,2 @@
1#!/bin/sh
1#!/bin/sh
2−~/.cabal/bin/ghcid --command="cabal new-repl $1"
2+./.cabal-sandbox/bin/ghcid --command="cabal repl $1"
scripts/DateExamples.tutd+2−2
@@ -20,7 +20,7 @@ sp := relation{tuple{s# "S1",p# "P1",qty 300},
20 tuple{s# "S3",p# "P2",qty 200},
20 tuple{s# "S3",p# "P2",qty 200},
21 tuple{s# "S4",p# "P4",qty 300},
21 tuple{s# "S4",p# "P4",qty 300},
22 tuple{s# "S4",p# "P5",qty 400}};
22 tuple{s# "S4",p# "P5",qty 400}};
23−key s_pkey {s#} s;
23+key s_pkey {s#} s
24−key p_key {p#} p;
24+key p_key {p#} p
25foreign key s_sp_fk sp{s#} in s{s#};
25foreign key s_sp_fk sp{s#} in s{s#};
26foreign key p_sp_fk sp{p#} in p{p#};
26foreign key p_sp_fk sp{p#} in p{p#};
scripts/multiline.tutddeleted−2
@@ -1,2 +0,0 @@
1−x:=relation{
2−tuple{ x 2}} -- nice
shell.nixdeleted−1
@@ -1 +0,0 @@
1−(import ./release.nix { }).shell
src/bin/ProjectM36/Client/Json.hs+1−4
@@ -3,7 +3,6 @@ module ProjectM36.Client.Json where
3import Data.Aeson
3import Data.Aeson
4import ProjectM36.Server.RemoteCallTypes.Json ()
4import ProjectM36.Server.RemoteCallTypes.Json ()
5import ProjectM36.Client
5import ProjectM36.Client
6−import ProjectM36.TransactionGraph
7import Control.Exception (IOException)
6import Control.Exception (IOException)
8
7
9instance ToJSON EvaluatedNotification
8instance ToJSON EvaluatedNotification
@@ -12,6 +11,4 @@ instance FromJSON EvaluatedNotification
12instance ToJSON ConnectionError
11instance ToJSON ConnectionError
13
12
14instance ToJSON IOException where
13instance ToJSON IOException where
15− toJSON err = object ["IOException" .= show err]
14+ toJSON err = object ["IOException" .= show err]
16−
17−instance ToJSON MerkleValidationError
src/bin/ProjectM36/Server/RemoteCallTypes/Json.hs+21−51
@@ -1,17 +1,14 @@
1--create a bunch of orphan instances for use with the websocket server
1--create a bunch of orphan instances for use with the websocket server
2−{-# LANGUAGE FlexibleInstances #-}
2+{-# LANGUAGE FlexibleInstances, TypeSynonymInstances #-}
3{-# OPTIONS_GHC -fno-warn-orphans #-}
3{-# OPTIONS_GHC -fno-warn-orphans #-}
4module ProjectM36.Server.RemoteCallTypes.Json where
4module ProjectM36.Server.RemoteCallTypes.Json where
5import ProjectM36.AtomFunctionError
5import ProjectM36.AtomFunctionError
6import ProjectM36.Base
6import ProjectM36.Base
7−import ProjectM36.DataFrame
8import ProjectM36.DatabaseContextFunctionError
7import ProjectM36.DatabaseContextFunctionError
9import ProjectM36.DataTypes.Primitive
8import ProjectM36.DataTypes.Primitive
10import ProjectM36.Error
9import ProjectM36.Error
11import ProjectM36.IsomorphicSchema
10import ProjectM36.IsomorphicSchema
12import ProjectM36.Server.RemoteCallTypes
11import ProjectM36.Server.RemoteCallTypes
13−import ProjectM36.MerkleHash
14−import ProjectM36.Attribute as A
15
12
16import Data.Aeson
13import Data.Aeson
17import Data.ByteString.Base64 as B64
14import Data.ByteString.Base64 as B64
@@ -24,9 +21,6 @@ instance FromJSON RelationalExpr
24instance ToJSON TupleExpr
21instance ToJSON TupleExpr
25instance FromJSON TupleExpr
22instance FromJSON TupleExpr
26
23
27−instance ToJSON TupleExprs
28−instance FromJSON TupleExprs
29−
30instance ToJSON RestrictionPredicateExpr
24instance ToJSON RestrictionPredicateExpr
31instance FromJSON RestrictionPredicateExpr
25instance FromJSON RestrictionPredicateExpr
32
26
@@ -45,11 +39,8 @@ instance FromJSON ExecuteRelationalExpr
45instance ToJSON Relation
39instance ToJSON Relation
46instance FromJSON Relation
40instance FromJSON Relation
47
41
48−instance ToJSON Attribute where
42+instance ToJSON Attribute
49− toJSON (Attribute attrName aType) = object [ "name" .= attrName
50− , "type" .= toJSON aType ]
51−instance FromJSON Attribute where
43+instance FromJSON Attribute
52− parseJSON = withObject "Attribute" $ \v -> Attribute <$> v .: "name" <*> v .: "type"
53
44
54instance ToJSON ExtendTupleExpr
45instance ToJSON ExtendTupleExpr
55instance FromJSON ExtendTupleExpr
46instance FromJSON ExtendTupleExpr
@@ -72,18 +63,6 @@ instance FromJSON SchemaExpr
72instance ToJSON SchemaIsomorph
63instance ToJSON SchemaIsomorph
73instance FromJSON SchemaIsomorph
64instance FromJSON SchemaIsomorph
74
65
75−instance ToJSON DataFrame
76−instance FromJSON DataFrame
77−
78−instance ToJSON DataFrameTuple
79−instance FromJSON DataFrameTuple
80−
81−instance ToJSON AttributeOrder
82−instance FromJSON AttributeOrder
83−
84−instance ToJSON Order
85−instance FromJSON Order
86−
87instance ToJSON Atom where
66instance ToJSON Atom where
88 toJSON atom@(IntegerAtom i) = object [ "type" .= atomTypeForAtom atom,
67 toJSON atom@(IntegerAtom i) = object [ "type" .= atomTypeForAtom atom,
89 "val" .= i ]
68 "val" .= i ]
@@ -101,10 +80,17 @@ instance ToJSON Atom where
101 "val" .= decodeUtf8 (B64.encode i) ]
80 "val" .= decodeUtf8 (B64.encode i) ]
102 toJSON atom@(BoolAtom i) = object [ "type" .= atomTypeForAtom atom,
81 toJSON atom@(BoolAtom i) = object [ "type" .= atomTypeForAtom atom,
103 "val" .= i ]
82 "val" .= i ]
83+
84+ toJSON atom@(IntervalAtom b e i1 i2) = object [ "type" .= atomTypeForAtom atom,
85+ "val" .= object [
86+ "begin" .= toJSON b,
87+ "end" .= toJSON e,
88+ "beginopen" .= i1,
89+ "endopen" .= i2
90+ ]
91+ ]
104 toJSON atom@(RelationAtom i) = object [ "type" .= atomTypeForAtom atom,
92 toJSON atom@(RelationAtom i) = object [ "type" .= atomTypeForAtom atom,
105 "val" .= i ]
93 "val" .= i ]
106− toJSON atom@(RelationalExprAtom i) = object [ "type" .= atomTypeForAtom atom,
107− "val" .= i ]
108 toJSON (ConstructedAtom dConsName atomtype atomlist) = object [
94 toJSON (ConstructedAtom dConsName atomtype atomlist) = object [
109 "dataconstructorname" .= dConsName,
95 "dataconstructorname" .= dConsName,
110 "type" .= toJSON atomtype,
96 "type" .= toJSON atomtype,
@@ -117,7 +103,9 @@ instance FromJSON Atom where
117 case atype of
103 case atype of
118 TypeVariableType _ -> fail "cannot pass TypeVariableType over the wire"
104 TypeVariableType _ -> fail "cannot pass TypeVariableType over the wire"
119 caType@(ConstructedAtomType _ _) -> ConstructedAtom <$> o .: "dataconstructorname" <*> pure caType <*> o .: "atom"
105 caType@(ConstructedAtomType _ _) -> ConstructedAtom <$> o .: "dataconstructorname" <*> pure caType <*> o .: "atom"
120− RelationAtomType _ -> RelationAtom <$> o .: "val"
106+ RelationAtomType _ -> do
107+ rel <- o .: "val"
108+ pure $ RelationAtom rel
121 IntAtomType -> IntAtom <$> o .: "val"
109 IntAtomType -> IntAtom <$> o .: "val"
122 IntegerAtomType -> IntegerAtom <$> o .: "val"
110 IntegerAtomType -> IntegerAtom <$> o .: "val"
123 DoubleAtomType -> DoubleAtom <$> o .: "val"
111 DoubleAtomType -> DoubleAtom <$> o .: "val"
@@ -132,7 +120,12 @@ instance FromJSON Atom where
132 Left err -> fail ("Failed to parse base64-encoded ByteString: " ++ err)
120 Left err -> fail ("Failed to parse base64-encoded ByteString: " ++ err)
133 Right bs -> pure (ByteStringAtom bs)
121 Right bs -> pure (ByteStringAtom bs)
134 BoolAtomType -> BoolAtom <$> o .: "val"
122 BoolAtomType -> BoolAtom <$> o .: "val"
135− RelationalExprAtomType -> RelationalExprAtom <$> o .: "val"
123+ IntervalAtomType _ -> IntervalAtom <$>
124+ ((o .: "val") >>= (.: "begin")) <*>
125+ ((o .: "val") >>= (.: "end")) <*>
126+ ((o .: "val") >>= (.: "beginopen")) <*>
127+ ((o .: "val") >>= (.: "endopen"))
128+
136
129
137instance ToJSON Notification
130instance ToJSON Notification
138instance FromJSON Notification
131instance FromJSON Notification
@@ -140,21 +133,6 @@ instance FromJSON Notification
140instance ToJSON ScriptCompilationError
133instance ToJSON ScriptCompilationError
141instance FromJSON ScriptCompilationError
134instance FromJSON ScriptCompilationError
142
135
143−instance ToJSON MerkleHash where
144− toJSON h = object [ "merklehash" .= decodeUtf8 (B64.encode (_unMerkleHash h))]
145−instance FromJSON MerkleHash where
146− parseJSON = withObject "merklehash" $ \o -> do
147− b64bs <- encodeUtf8 <$> o .: "merklehash"
148− case B64.decode b64bs of
149− Left err -> fail ("Failed to parse merkle hash: " ++ err)
150− Right bs -> pure (MerkleHash bs)
151−
152−instance ToJSON Attributes where
153− toJSON attrs = object ["attributes" .= map toJSON (A.toList attrs)]
154−instance FromJSON Attributes where
155− parseJSON = withObject "Attributes" $ \o ->
156− A.attributesFromList <$> o .: "attributes"
157−
158instance ToJSON RelationalError
136instance ToJSON RelationalError
159instance FromJSON RelationalError
137instance FromJSON RelationalError
160
138
@@ -164,9 +142,6 @@ instance FromJSON SchemaError
164instance ToJSON MergeError
142instance ToJSON MergeError
165instance FromJSON MergeError
143instance FromJSON MergeError
166
144
167−instance ToJSON ImportError'
168−instance FromJSON ImportError'
169−
170instance ToJSON DatabaseContextFunctionError
145instance ToJSON DatabaseContextFunctionError
171instance FromJSON DatabaseContextFunctionError
146instance FromJSON DatabaseContextFunctionError
172
147
@@ -178,8 +153,3 @@ instance FromJSON PersistenceError
178
153
179instance ToJSON AtomFunctionError
154instance ToJSON AtomFunctionError
180instance FromJSON AtomFunctionError
155instance FromJSON AtomFunctionError
181−
182−instance ToJSON WithNameExpr
183−instance FromJSON WithNameExpr
184−
185−
src/bin/ProjectM36/Server/WebSocket.hs+22−41
@@ -1,4 +1,4 @@
1−{-# LANGUAGE LambdaCase, CPP #-}
1+{-# LANGUAGE LambdaCase #-}
2module ProjectM36.Server.WebSocket where
2module ProjectM36.Server.WebSocket where
3-- while the tutd client performs TutorialD parsing on the client, the websocket server will pass tutd to be parsed and executed on the server- otherwise I have to pull in ghcjs as a dependency to allow client-side parsing- that's not appealing because then the frontend is not language-agnostic, but this could change in the future, perhaps by sending different messages over the websocket
3-- while the tutd client performs TutorialD parsing on the client, the websocket server will pass tutd to be parsed and executed on the server- otherwise I have to pull in ghcjs as a dependency to allow client-side parsing- that's not appealing because then the frontend is not language-agnostic, but this could change in the future, perhaps by sending different messages over the websocket
4-- ideally, the wire protocol should not be exposed to a straight string-based API ala SQL, so we could make perhaps a javascript DSL which compiles to the necessary JSON- anaylyze tradeoffs
4-- ideally, the wire protocol should not be exposed to a straight string-based API ala SQL, so we could make perhaps a javascript DSL which compiles to the necessary JSON- anaylyze tradeoffs
@@ -10,26 +10,20 @@ import qualified Data.Text as T
10import qualified Network.WebSockets as WS
10import qualified Network.WebSockets as WS
11import ProjectM36.Server.RemoteCallTypes.Json ()
11import ProjectM36.Server.RemoteCallTypes.Json ()
12import ProjectM36.Client.Json ()
12import ProjectM36.Client.Json ()
13−import ProjectM36.DataFrame
14import ProjectM36.Relation.Show.Term
13import ProjectM36.Relation.Show.Term
15import ProjectM36.Relation.Show.HTML
14import ProjectM36.Relation.Show.HTML
16import Data.Aeson
15import Data.Aeson
17import TutorialD.Interpreter
16import TutorialD.Interpreter
18−import TutorialD.Interpreter.Base (TutorialDOperatorResult(..))
17+import TutorialD.Interpreter.Base
19import ProjectM36.Client
18import ProjectM36.Client
20import Control.Exception
19import Control.Exception
21import Data.Attoparsec.Text
20import Data.Attoparsec.Text
22import Control.Applicative
21import Control.Applicative
23import Text.Megaparsec.Error
22import Text.Megaparsec.Error
24import Data.Functor
23import Data.Functor
25−import Data.Either (fromRight)
26−
27−#if MIN_VERSION_megaparsec(7,0,0)
28−import Data.List.NonEmpty as NE
29−#endif
30
24
31websocketProxyServer :: Port -> Hostname -> WS.ServerApp
25websocketProxyServer :: Port -> Hostname -> WS.ServerApp
32−websocketProxyServer port host pending = do
26+websocketProxyServer port host pending = do
33 conn <- WS.acceptRequest pending
27 conn <- WS.acceptRequest pending
34 let unexpectedMsg = WS.sendTextData conn ("messagenotexpected" :: T.Text)
28 let unexpectedMsg = WS.sendTextData conn ("messagenotexpected" :: T.Text)
35 --phase 1- accept database name for connection
29 --phase 1- accept database name for connection
@@ -38,10 +32,10 @@ websocketProxyServer port host pending = do
38 if not (connectdbmsg `T.isPrefixOf` dbmsg) then unexpectedMsg >> WS.sendClose conn ("" :: T.Text)
32 if not (connectdbmsg `T.isPrefixOf` dbmsg) then unexpectedMsg >> WS.sendClose conn ("" :: T.Text)
39 else do
33 else do
40 let dbname = T.unpack $ T.drop (T.length connectdbmsg) dbmsg
34 let dbname = T.unpack $ T.drop (T.length connectdbmsg) dbmsg
41− bracket (createConnection conn dbname port host)
35+ bracket (createConnection conn dbname port host)
42 (\case
36 (\case
43 Right dbconn -> close dbconn
37 Right dbconn -> close dbconn
44− Left _ -> pure ()) $ \case
38+ Left _ -> pure ()) $ \case
45 Left err -> sendError conn err
39 Left err -> sendError conn err
46 Right dbconn -> do
40 Right dbconn -> do
47 eSessionId <- createSessionAtHead dbconn "master"
41 eSessionId <- createSessionAtHead dbconn "master"
@@ -52,41 +46,34 @@ websocketProxyServer port host pending = do
52 _ <- forever $ do
46 _ <- forever $ do
53 pInfo <- promptInfo sessionId dbconn
47 pInfo <- promptInfo sessionId dbconn
54 --figure out why sending three times during startup is necessary
48 --figure out why sending three times during startup is necessary
55− sendPromptInfo pInfo conn
49+ sendPromptInfo pInfo conn
56 sendPromptInfo pInfo conn
50 sendPromptInfo pInfo conn
57 msg <- WS.receiveData conn :: IO T.Text
51 msg <- WS.receiveData conn :: IO T.Text
58 case parseOnly parseExecuteMessage msg of
52 case parseOnly parseExecuteMessage msg of
59 Left _ -> unexpectedMsg
53 Left _ -> unexpectedMsg
60 Right (presentation, tutdString) ->
54 Right (presentation, tutdString) ->
61 case parseTutorialD tutdString of
55 case parseTutorialD tutdString of
62− Left err -> handleOpResult conn dbconn presentation
63−#if MIN_VERSION_megaparsec(7,0,0)
64− (DisplayErrorResult
65− ("parse error: " `T.append` T.pack
66− (parseErrorPretty . NE.head . bundleErrors $ err)))
67−#else
68− (DisplayErrorResult ("parse error: " `T.append` T.pack (parseErrorPretty err)))
56+ Left err -> handleOpResult conn dbconn presentation (DisplayErrorResult ("parse error: " `T.append` T.pack (parseErrorPretty err)))
69−#endif
70 Right parsed -> do
57 Right parsed -> do
71− let timeoutFilter exc = if exc == RequestTimeoutException
58+ let timeoutFilter exc = if exc == RequestTimeoutException
72− then Just exc
59+ then Just exc
73 else Nothing
60 else Nothing
74 responseHandler = do
61 responseHandler = do
75 result <- evalTutorialD sessionId dbconn SafeEvaluation parsed
62 result <- evalTutorialD sessionId dbconn SafeEvaluation parsed
76 pInfo' <- promptInfo sessionId dbconn
63 pInfo' <- promptInfo sessionId dbconn
77− sendPromptInfo pInfo' conn
64+ sendPromptInfo pInfo' conn
78 handleOpResult conn dbconn presentation result
65 handleOpResult conn dbconn presentation result
79 catchJust timeoutFilter responseHandler (\_ -> handleOpResult conn dbconn presentation (DisplayErrorResult "Request Timed Out."))
66 catchJust timeoutFilter responseHandler (\_ -> handleOpResult conn dbconn presentation (DisplayErrorResult "Request Timed Out."))
80 pure ()
67 pure ()
81−
68+
82−notificationCallback :: WS.Connection -> NotificationCallback
69+notificationCallback :: WS.Connection -> NotificationCallback
83notificationCallback conn notifName evaldNotif = WS.sendTextData conn (encode (object ["notificationname" .= notifName,
70notificationCallback conn notifName evaldNotif = WS.sendTextData conn (encode (object ["notificationname" .= notifName,
84 "evaldnotification" .= evaldNotif
71 "evaldnotification" .= evaldNotif
85 ]))
72 ]))
86−
73+
87--this creates a new database for each connection- perhaps not what we want (?)
74--this creates a new database for each connection- perhaps not what we want (?)
88createConnection :: WS.Connection -> DatabaseName -> Port -> Hostname -> IO (Either ConnectionError Connection)
75createConnection :: WS.Connection -> DatabaseName -> Port -> Hostname -> IO (Either ConnectionError Connection)
89−createConnection wsconn dbname port host = connectProjectM36 (RemoteConnectionInfo dbname host (show port) (notificationCallback wsconn))
76+createConnection wsconn dbname port host = connectProjectM36 (RemoteProcessConnectionInfo dbname (createNodeId host port) (notificationCallback wsconn))
90
77
91sendError :: (ToJSON a) => WS.Connection -> a -> IO ()
78sendError :: (ToJSON a) => WS.Connection -> a -> IO ()
92sendError conn err = WS.sendTextData conn (encode (object ["displayerror" .= err]))
79sendError conn err = WS.sendTextData conn (encode (object ["displayerror" .= err]))
@@ -107,40 +94,34 @@ handleOpResult conn _ presentation (DisplayRelationResult rel) = do
107 texto = ["text" .= showRelation rel | textPresentation presentation]
94 texto = ["text" .= showRelation rel | textPresentation presentation]
108 htmlo = ["html" .= relationAsHTML rel | htmlPresentation presentation]
95 htmlo = ["html" .= relationAsHTML rel | htmlPresentation presentation]
109 WS.sendTextData conn (encode (object ["displayrelation" .= object (jsono ++ texto ++ htmlo)]))
96 WS.sendTextData conn (encode (object ["displayrelation" .= object (jsono ++ texto ++ htmlo)]))
110−handleOpResult conn _ presentation (DisplayDataFrameResult df) = do
111− let jsono = ["json" .= df | jsonPresentation presentation]
112− texto = ["text" .= showDataFrame df | textPresentation presentation]
113− htmlo = ["html" .= dataFrameAsHTML df | htmlPresentation presentation]
114− WS.sendTextData conn (encode (object ["displaydataframe" .= object (jsono ++ texto ++ htmlo)]))
115−
116-- get current schema and head name for client
97-- get current schema and head name for client
117promptInfo :: SessionId -> Connection -> IO (HeadName, SchemaName)
98promptInfo :: SessionId -> Connection -> IO (HeadName, SchemaName)
118promptInfo sessionId conn = do
99promptInfo sessionId conn = do
119− eHeadName <- headName sessionId conn
100+ eHeadName <- headName sessionId conn
120 eSchemaName <- currentSchemaName sessionId conn
101 eSchemaName <- currentSchemaName sessionId conn
121− pure (fromRight "<unknown>" eHeadName, fromRight "<no schema>" eSchemaName)
102+ pure (either (const "<unknown>") id eHeadName, either (const "<no schema>") id eSchemaName)
122−
103+
123sendPromptInfo :: (HeadName, SchemaName) -> WS.Connection -> IO ()
104sendPromptInfo :: (HeadName, SchemaName) -> WS.Connection -> IO ()
124sendPromptInfo (hName, sName) conn = WS.sendTextData conn (encode (object ["promptInfo" .= object ["headname" .= hName, "schemaname" .= sName]]))
105sendPromptInfo (hName, sName) conn = WS.sendTextData conn (encode (object ["promptInfo" .= object ["headname" .= hName, "schemaname" .= sName]]))
125
106
126--a returning relation can be returned as JSON, Text (for consoles), or HTML
107--a returning relation can be returned as JSON, Text (for consoles), or HTML
127data Presentation = Presentation {
108data Presentation = Presentation {
128− jsonPresentation :: Bool,
109+ jsonPresentation :: Bool,
129 textPresentation :: Bool,
110 textPresentation :: Bool,
130 htmlPresentation :: Bool }
111 htmlPresentation :: Bool }
131−
112+
132data PresentationFlag = JSONFlag | TextFlag | HTMLFlag
113data PresentationFlag = JSONFlag | TextFlag | HTMLFlag
133−
114+
134parseExecuteMessage :: Parser (Presentation, T.Text)
115parseExecuteMessage :: Parser (Presentation, T.Text)
135parseExecuteMessage = do
116parseExecuteMessage = do
136 _ <- string "executetutd/"
117 _ <- string "executetutd/"
137 flags <- sepBy ((string "json" $> JSONFlag) <|>
118 flags <- sepBy ((string "json" $> JSONFlag) <|>
138 (string "text" $> TextFlag) <|>
119 (string "text" $> TextFlag) <|>
139 (string "html" $> HTMLFlag)) "+"
120 (string "html" $> HTMLFlag)) "+"
140− let presentation = foldr (\flag acc -> case flag of
121+ let presentation = foldr (\flag acc -> case flag of
141 JSONFlag -> acc {jsonPresentation = True}
122 JSONFlag -> acc {jsonPresentation = True}
142 TextFlag -> acc {textPresentation = True}
123 TextFlag -> acc {textPresentation = True}
143 HTMLFlag -> acc {htmlPresentation = True}) (Presentation False False False) flags
124 HTMLFlag -> acc {htmlPresentation = True}) (Presentation False False False) flags
144 _ <- char ':'
125 _ <- char ':'
145 tutd <- T.pack <$> manyTill anyChar endOfInput
126 tutd <- T.pack <$> manyTill anyChar endOfInput
146− pure (presentation, tutd)
127+ pure (presentation, tutd)
src/bin/ProjectM36/Server/WebSocket/project-m36.js+6−45
@@ -55,10 +55,9 @@ var ProjectM36Connection = function (protocol, host, port, path, dbname, openCal
55* @param {Object} acknowledgementresult - The status update containing an acknowledgement that the query was executed or null.
55* @param {Object} acknowledgementresult - The status update containing an acknowledgement that the query was executed or null.
56* @param {Object} errorResult - The status update containing the error information or null.
56* @param {Object} errorResult - The status update containing the error information or null.
57*/
57*/
58−var ProjectM36Status = function (relationResult, dataFrameResult, acknowledgementResult, errorResult)
58+var ProjectM36Status = function (relationResult, acknowledgementResult, errorResult)
59{
59{
60 this.relation = relationResult;
60 this.relation = relationResult;
61− this.dataframe = dataFrameResult;
62 this.acknowledgement = acknowledgementResult;
61 this.acknowledgement = acknowledgementResult;
63 this.error = errorResult;
62 this.error = errorResult;
64}
63}
@@ -76,7 +75,6 @@ ProjectM36Connection.prototype.readyState = function()
76ProjectM36Connection.prototype.handleResponse = function(message)
75ProjectM36Connection.prototype.handleResponse = function(message)
77{
76{
78 var relation = message["displayrelation"];
77 var relation = message["displayrelation"];
79− var dataframe = message["displaydataframe"];
80 var acknowledged = message["acknowledged"];
78 var acknowledged = message["acknowledged"];
81 var error = message["displayerror"];
79 var error = message["displayerror"];
82 var prompt = message["promptInfo"];
80 var prompt = message["promptInfo"];
@@ -84,17 +82,12 @@ ProjectM36Connection.prototype.handleResponse = function(message)
84
82
85 if(relation)
83 if(relation)
86 {
84 {
87− this.statuscallback(new ProjectM36Status(relation['json'], null, null, null));
85+ this.statuscallback(new ProjectM36Status(relation['json'], null, null));
88− }
89−
90− if(dataframe)
91− {
92− this.statuscallback(new ProjectM36Status(null, dataframe['json'], null, null));
93 }
86 }
94
87
95 if(acknowledged)
88 if(acknowledged)
96 {
89 {
97− this.statuscallback(new ProjectM36Status(null, null, true, null));
90+ this.statuscallback(new ProjectM36Status(null, true, null));
98 }
91 }
99
92
100 if(error)
93 if(error)
@@ -103,7 +96,7 @@ ProjectM36Connection.prototype.handleResponse = function(message)
103 {
96 {
104 error=error.tag; // for error objects
97 error=error.tag; // for error objects
105 }
98 }
106− this.statuscallback(new ProjectM36Status(null, null, null, error['json']));
99+ this.statuscallback(new ProjectM36Status(null, null, error['json']));
107 }
100 }
108
101
109 if(prompt)
102 if(prompt)
@@ -168,7 +161,6 @@ ProjectM36Connection.prototype.generateAtomType = function(attr)
168{
161{
169 var atomType = attr[1]["tag"];
162 var atomType = attr[1]["tag"];
170 var attrName = attr[0];
163 var attrName = attr[0];
171− var accessory = attr[2];
172 var element = document.createElement("span");
164 var element = document.createElement("span");
173 element.textContent = attrName + "::";
165 element.textContent = attrName + "::";
174 if (atomType == "RelationAtomType")
166 if (atomType == "RelationAtomType")
@@ -193,11 +185,7 @@ ProjectM36Connection.prototype.generateAtomType = function(attr)
193 var readableType = atomType.slice(0,-8);
185 var readableType = atomType.slice(0,-8);
194 element.textContent += readableType;
186 element.textContent += readableType;
195 }
187 }
196− if(accessory)
197− {
198− element.textContent += accessory;
199− }
200− return element;
188+ return element
201}
189}
202
190
203ProjectM36Connection.prototype.generateRelationBody = function (body)
191ProjectM36Connection.prototype.generateRelationBody = function (body)
@@ -242,33 +230,6 @@ ProjectM36Connection.prototype.generateAtom = function(atom)
242 return element;
230 return element;
243}
231}
244
232
245−ProjectM36Connection.prototype.generateDataFrame = function(dataframe)
246−{
247− for(var attrIndex=0; attrIndex < dataframe.attributes.length; attrIndex++)
248− {
249− var attr = dataframe.attributes[attrIndex];
250− var ordering = "↕";
251− for(var orderIndex=0; orderIndex < dataframe.orders.length; orderIndex++)
252− {
253− var order = dataframe.orders[orderIndex];
254− if(order[0] == attr[0])
255− {
256− if(order[1] == "AscendingOrder")
257− {
258− ordering = "⬆";
259− }
260− else if(order[1] == "DescendingOrder")
261− {
262− ordering = "⬇";
263− }
264− }
265− }
266− dataframe.attributes[attrIndex].push(ordering);
267− }
268− return this.generateRelation([dataframe.attributes,
269− {asList:dataframe.tuples}]);
270−}
271−
272//special case to make sure that a table appears for "true" and "false"
233//special case to make sure that a table appears for "true" and "false"
273function mungeEmptyRows()
234function mungeEmptyRows()
274{
235{
@@ -288,4 +249,4 @@ function mungeEmptyRows()
288 empty.appendChild(dudHeader);
249 empty.appendChild(dudHeader);
289 }
250 }
290 }
251 }
291−}
252+}
src/bin/ProjectM36/Server/WebSocket/websocket-client.html+1−1
@@ -126,7 +126,7 @@ margin-bottom: 5pt;
126 <li>:showrelvars</li>
126 <li>:showrelvars</li>
127 <li>:showexpr true</li>
127 <li>:showexpr true</li>
128 <li>:showexpr false</li>
128 <li>:showexpr false</li>
129− <li>:importexample cjdate</li>
129+ <li>:importexample date</li>
130 <li>:showexpr s join sp</li>
130 <li>:showexpr s join sp</li>
131 <li>update s where city=&quot;Paris&quot; (status:=10)</li>
131 <li>update s where city=&quot;Paris&quot; (status:=10)</li>
132 <li>:showexpr s</li>
132 <li>:showexpr s</li>
src/bin/ProjectM36/Server/WebSocket/websocket-client.js+1−7
@@ -30,12 +30,6 @@ function updateStatus(status)
30 appendResult(tutd, relastable);
30 appendResult(tutd, relastable);
31 mungeEmptyRows();
31 mungeEmptyRows();
32 }
32 }
33− if(status.dataframe)
34− {
35− var dataframeastable = conn.generateDataFrame(status.dataframe);
36− appendResult(tutd, dataframeastable);
37− mungeEmptyRows();
38− }
39 if(status.acknowledgement)
33 if(status.acknowledgement)
40 {
34 {
41 var ok = document.createElement("span");
35 var ok = document.createElement("span");
@@ -259,4 +253,4 @@ function pageload()
259{
253{
260 installSampleHandlers();
254 installSampleHandlers();
261 setupDefaultConfig();
255 setupDefaultConfig();
262−}
256+}
src/bin/ProjectM36/Server/WebSocket/websocket-server.hs+12−49
@@ -1,63 +1,26 @@
1−{-# LANGUAGE CPP #-}
2−
3−import Control.Concurrent
4−import Control.Exception
5−import Control.Monad (when)
6−import Data.Maybe (isJust)
7−import Data.String (fromString)
8−import Network.HTTP.Types (status400)
9−import Network.Socket
10−import Network.Wai (Application, responseLBS)
11−import Network.Wai.Handler.Warp
12−import Network.Wai.Handler.WarpTLS (runTLS, tlsSettings)
13−import qualified Network.Wai.Handler.WebSockets as WS
14−import Network.WebSockets (defaultConnectionOptions)
15−import ProjectM36.Server
1+import ProjectM36.Server.WebSocket
16import ProjectM36.Server.Config
2import ProjectM36.Server.Config
17import ProjectM36.Server.ParseArgs
3import ProjectM36.Server.ParseArgs
18−import ProjectM36.Server.WebSocket
4+import ProjectM36.Server
5+import Control.Concurrent
6+import qualified Network.WebSockets as WS
7+import Network.Transport.TCP (decodeEndPointAddress)
8+import Control.Exception
19
9
20main :: IO ()
10main :: IO ()
21main = do
11main = do
22 -- launch normal project-m36-server
12 -- launch normal project-m36-server
23 addressMVar <- newEmptyMVar
13 addressMVar <- newEmptyMVar
24− wsConfig <- parseWSConfigWithDefaults (defaultServerConfig {bindPort = 8000, bindHost = "127.0.0.1"})
14+ serverConfig <- parseConfigWithDefaults (defaultServerConfig { bindPort = 8000, bindHost = "127.0.0.1" })
25−
26 --usurp the serverConfig for our websocket server and make the proxied server run locally
15 --usurp the serverConfig for our websocket server and make the proxied server run locally
27− let serverConfig = wsServerConfig wsConfig
28− wsHost = bindHost serverConfig
16+ let wsHost = bindHost serverConfig
29 wsPort = bindPort serverConfig
17 wsPort = bindPort serverConfig
30 serverHost = "127.0.0.1"
18 serverHost = "127.0.0.1"
31 serverConfig' = serverConfig {bindPort = 0, bindHost = serverHost}
19 serverConfig' = serverConfig {bindPort = 0, bindHost = serverHost}
32− configCertificateFile = tlsCertificatePath wsConfig
33− configKeyFile = tlsKeyPath wsConfig
34−
35− when (isJust configCertificateFile /= isJust configKeyFile) $
36− throwIO $ ErrorCall "TLS_CERTIFICATE_PATH and TLS_KEY_PATH must be set in tandem"
37−
38 _ <- forkFinally (launchServer serverConfig' (Just addressMVar) >> pure ()) (either throwIO pure)
20 _ <- forkFinally (launchServer serverConfig' (Just addressMVar) >> pure ()) (either throwIO pure)
39 --wait for server to be listening
21 --wait for server to be listening
40− addr <- takeMVar addressMVar
22+ address <- takeMVar addressMVar
41− let port =
23+ let Just (_, serverPort, _) = decodeEndPointAddress address
42− case addr of
24+ --this built-in server is apparently not meant for production use, but it's easier to test than starting up the wai or snap interfaces
43− SockAddrInet port' _ -> fromIntegral port'
25+ WS.runServer wsHost (fromIntegral wsPort) (websocketProxyServer (read serverPort) serverHost)
44− _ -> error "unsupported socket address (IPv4 only currently)"
45− wsApp = websocketProxyServer port serverHost
46− waiApp = WS.websocketsOr defaultConnectionOptions wsApp backupApp
47− settings = warpSettings wsHost (fromIntegral wsPort)
48−
49− case (configCertificateFile, configKeyFile) of
50− (Just certificate, Just key) -> runTLS (tlsSettings certificate key) settings waiApp
51− _ -> runSettings settings waiApp
52−
53−backupApp :: Application
54−backupApp _ respond = respond $ responseLBS status400 [] "Not a WebSocket request"
55
26
56−warpSettings :: HostName -> Port -> Settings
57−warpSettings host port =
58− setHost (fromString host)
59− . setPort port
60− . setServerName "project-m36"
61− . setTimeout 3600
62− . setGracefulShutdownTimeout (Just 5)
63− $ defaultSettings
src/bin/TutorialD/Interpreter.hs+32−34
@@ -1,4 +1,4 @@
1−{-# LANGUAGE GADTs, LambdaCase, CPP #-}
1+{-# LANGUAGE GADTs, LambdaCase #-}
2module TutorialD.Interpreter where
2module TutorialD.Interpreter where
3import TutorialD.Interpreter.Base
3import TutorialD.Interpreter.Base
4import TutorialD.Interpreter.RODatabaseContextOperator
4import TutorialD.Interpreter.RODatabaseContextOperator
@@ -24,17 +24,16 @@ import ProjectM36.TransactionGraph
24import qualified ProjectM36.Client as C
24import qualified ProjectM36.Client as C
25import ProjectM36.Relation (attributes)
25import ProjectM36.Relation (attributes)
26
26
27+import Text.Megaparsec
28+import Text.Megaparsec.Text
27import System.Console.Haskeline
29import System.Console.Haskeline
28import System.Directory (getHomeDirectory)
30import System.Directory (getHomeDirectory)
29import qualified Data.Text as T
31import qualified Data.Text as T
30import System.IO (hPutStrLn, stderr)
32import System.IO (hPutStrLn, stderr)
31−#if __GLASGOW_HASKELL__ < 804
32import Data.Monoid
33import Data.Monoid
33−#endif
34import Data.List (isPrefixOf)
34import Data.List (isPrefixOf)
35import Control.Exception
35import Control.Exception
36import System.Exit
36import System.Exit
37−import Data.Either (fromRight)
38
37
39{-
38{-
40context ops are read-only operations which only operate on the database context (relvars and constraints)
39context ops are read-only operations which only operate on the database context (relvars and constraints)
@@ -62,7 +61,7 @@ interpreterParserP = safeInterpreterParserP <|>
62 fmap ImportDBContextOp (tutdImportP <* eof) <|>
61 fmap ImportDBContextOp (tutdImportP <* eof) <|>
63 fmap RelVarExportOp (exportCSVP <* eof) <|>
62 fmap RelVarExportOp (exportCSVP <* eof) <|>
64 fmap DatabaseContextIOExprOp (dbContextIOExprP <* eof)
63 fmap DatabaseContextIOExprOp (dbContextIOExprP <* eof)
65−
64+
66-- the safe interpreter never reads or writes the file system
65-- the safe interpreter never reads or writes the file system
67safeInterpreterParserP :: Parser ParsedOperation
66safeInterpreterParserP :: Parser ParsedOperation
68safeInterpreterParserP = fmap RODatabaseContextOp (roDatabaseContextOperatorP <* eof) <|>
67safeInterpreterParserP = fmap RODatabaseContextOp (roDatabaseContextOperatorP <* eof) <|>
@@ -78,13 +77,13 @@ safeInterpreterParserP = fmap RODatabaseContextOp (roDatabaseContextOperatorP <*
78promptText :: Either RelationalError HeadName -> Either RelationalError SchemaName -> StringType
77promptText :: Either RelationalError HeadName -> Either RelationalError SchemaName -> StringType
79promptText eHeadName eSchemaName = "TutorialD (" <> transInfo <> "): "
78promptText eHeadName eSchemaName = "TutorialD (" <> transInfo <> "): "
80 where
79 where
81− transInfo = fromRight "<unknown>" eHeadName <> "/" <> fromRight "<no schema>" eSchemaName
80+ transInfo = either (const "<unknown>") id eHeadName <> "/" <> either (const "<no schema>") id eSchemaName
82−
81+
83−parseTutorialD :: T.Text -> Either ParserError ParsedOperation
82+parseTutorialD :: T.Text -> Either (ParseError Char Dec) ParsedOperation
84parseTutorialD = parse interpreterParserP ""
83parseTutorialD = parse interpreterParserP ""
85
84
86--only parse tutoriald which doesn't result in file I/O
85--only parse tutoriald which doesn't result in file I/O
87−safeParseTutorialD :: T.Text -> Either ParserError ParsedOperation
86+safeParseTutorialD :: T.Text -> Either (ParseError Char Dec) ParsedOperation
88safeParseTutorialD = parse safeInterpreterParserP ""
87safeParseTutorialD = parse safeInterpreterParserP ""
89
88
90data SafeEvaluationFlag = SafeEvaluation | UnsafeEvaluation deriving (Eq)
89data SafeEvaluationFlag = SafeEvaluation | UnsafeEvaluation deriving (Eq)
@@ -107,20 +106,20 @@ evalTutorialDInteractive sessionId conn safe interactive expr = case expr of
107 else
106 else
108 pure res
107 pure res
109 _ -> pure res
108 _ -> pure res
110−
109+
111− (DatabaseContextExprOp execOp) ->
110+ (DatabaseContextExprOp execOp) ->
112− eHandler $ C.executeDatabaseContextExpr sessionId conn execOp
111+ eHandler $ C.executeDatabaseContextExpr sessionId conn execOp
113−
112+
114− (DatabaseContextIOExprOp execOp) ->
113+ (DatabaseContextIOExprOp execOp) ->
115 if needsSafe then
114 if needsSafe then
116 unsafeError
115 unsafeError
117 else
116 else
118 eHandler $ C.executeDatabaseContextIOExpr sessionId conn execOp
117 eHandler $ C.executeDatabaseContextIOExpr sessionId conn execOp
119−
118+
120 (GraphOp execOp) -> do
119 (GraphOp execOp) -> do
121 -- warn if the graph op could cause uncommited changes to be discarded
120 -- warn if the graph op could cause uncommited changes to be discarded
122 eIsDirty <- C.disconnectedTransactionIsDirty sessionId conn
121 eIsDirty <- C.disconnectedTransactionIsDirty sessionId conn
123− let runGraphOp = eHandler $ C.executeGraphExpr sessionId conn execOp
122+ let runGraphOp = eHandler $ C.executeGraphExpr sessionId conn execOp
124 settings = Settings {complete = noCompletion,
123 settings = Settings {complete = noCompletion,
125 historyFile = Nothing,
124 historyFile = Nothing,
126 autoAddHistory = False}
125 autoAddHistory = False}
@@ -144,20 +143,20 @@ evalTutorialDInteractive sessionId conn safe interactive expr = case expr of
144 pure (DisplayErrorResult "Graph operation cancelled.")
143 pure (DisplayErrorResult "Graph operation cancelled.")
145 else
144 else
146 runGraphOp
145 runGraphOp
147−
146+
148 (ConvenienceGraphOp execOp) ->
147 (ConvenienceGraphOp execOp) ->
149 eHandler $ evalConvenienceGraphOp sessionId conn execOp
148 eHandler $ evalConvenienceGraphOp sessionId conn execOp
150
149
151 (ROGraphOp execOp) -> do
150 (ROGraphOp execOp) -> do
152 opResult <- evalROGraphOp sessionId conn execOp
151 opResult <- evalROGraphOp sessionId conn execOp
153− case opResult of
152+ case opResult of
154 Left err -> barf err
153 Left err -> barf err
155 Right rel -> pure (DisplayRelationResult rel)
154 Right rel -> pure (DisplayRelationResult rel)
156−
155+
157 (SchemaOp execOp) ->
156 (SchemaOp execOp) ->
158 eHandler $ evalSchemaOperator sessionId conn execOp
157 eHandler $ evalSchemaOperator sessionId conn execOp
159−
158+
160− (ImportRelVarOp execOp@(RelVarDataImportOperator relVarName _ _)) ->
159+ (ImportRelVarOp execOp@(RelVarDataImportOperator relVarName _ _)) ->
161 if needsSafe then
160 if needsSafe then
162 unsafeError
161 unsafeError
163 else do
162 else do
@@ -175,8 +174,8 @@ evalTutorialDInteractive sessionId conn safe interactive expr = case expr of
175 case exprErr of
174 case exprErr of
176 Left err -> barf err
175 Left err -> barf err
177 Right dbexpr -> evalTutorialD sessionId conn safe (DatabaseContextExprOp dbexpr)
176 Right dbexpr -> evalTutorialD sessionId conn safe (DatabaseContextExprOp dbexpr)
178−
177+
179− (ImportDBContextOp execOp) ->
178+ (ImportDBContextOp execOp) ->
180 if needsSafe then
179 if needsSafe then
181 unsafeError
180 unsafeError
182 else do
181 else do
@@ -184,15 +183,15 @@ evalTutorialDInteractive sessionId conn safe interactive expr = case expr of
184 case eErr of
183 case eErr of
185 Left err -> barf err
184 Left err -> barf err
186 Right dbexprs -> evalTutorialD sessionId conn safe (DatabaseContextExprOp dbexprs)
185 Right dbexprs -> evalTutorialD sessionId conn safe (DatabaseContextExprOp dbexprs)
187−
186+
188− (InfoOp execOp) ->
187+ (InfoOp execOp) ->
189 if needsSafe then
188 if needsSafe then
190 unsafeError
189 unsafeError
191 else
190 else
192 case evalInformationOperator execOp of
191 case evalInformationOperator execOp of
193 Left err -> pure (DisplayErrorResult err)
192 Left err -> pure (DisplayErrorResult err)
194 Right info -> pure (DisplayResult info)
193 Right info -> pure (DisplayResult info)
195−
194+
196 (RelVarExportOp execOp@(RelVarDataExportOperator relExpr _ _)) ->
195 (RelVarExportOp execOp@(RelVarDataExportOperator relExpr _ _)) ->
197 --eval relexpr to relation and pass to export function
196 --eval relexpr to relation and pass to export function
198 if needsSafe then
197 if needsSafe then
@@ -216,20 +215,19 @@ evalTutorialDInteractive sessionId conn safe interactive expr = case expr of
216 unsafeError = pure $ DisplayErrorResult "File I/O operation prohibited."
215 unsafeError = pure $ DisplayErrorResult "File I/O operation prohibited."
217 barf :: RelationalError -> IO TutorialDOperatorResult
216 barf :: RelationalError -> IO TutorialDOperatorResult
218 barf (ScriptError (OtherScriptCompilationError errStr)) = pure (DisplayErrorResult (T.pack errStr))
217 barf (ScriptError (OtherScriptCompilationError errStr)) = pure (DisplayErrorResult (T.pack errStr))
219− barf (ParseError err) = pure (DisplayErrorResult err)
220 barf err = return $ DisplayErrorResult (T.pack (show err))
218 barf err = return $ DisplayErrorResult (T.pack (show err))
221 eHandler io = do
219 eHandler io = do
222 eErr <- io
220 eErr <- io
223 case eErr of
221 case eErr of
224 Left err -> barf err
222 Left err -> barf err
225 Right () -> return QuietSuccessResult
223 Right () -> return QuietSuccessResult
226−
224+
227−type GhcPkgPath = String
225+type GhcPkgPath = String
228type TutorialDExec = String
226type TutorialDExec = String
229type CheckFS = Bool
227type CheckFS = Bool
230−
228+
231data InterpreterConfig = LocalInterpreterConfig PersistenceStrategy HeadName (Maybe TutorialDExec) [GhcPkgPath] CheckFS |
229data InterpreterConfig = LocalInterpreterConfig PersistenceStrategy HeadName (Maybe TutorialDExec) [GhcPkgPath] CheckFS |
232− RemoteInterpreterConfig C.Hostname C.Port C.DatabaseName HeadName (Maybe TutorialDExec) CheckFS
230+ RemoteInterpreterConfig C.NodeId C.DatabaseName HeadName (Maybe TutorialDExec) CheckFS
233
231
234outputNotificationCallback :: C.NotificationCallback
232outputNotificationCallback :: C.NotificationCallback
235outputNotificationCallback notName evaldNot = hPutStrLn stderr $ "Notification received " ++ show notName ++ ":\n" ++ "\n" ++ prettyEvaluatedNotification evaldNot
233outputNotificationCallback notName evaldNot = hPutStrLn stderr $ "Notification received " ++ show notName ++ ":\n" ++ "\n" ++ prettyEvaluatedNotification evaldNot
@@ -258,12 +256,12 @@ reprLoop config sessionId conn = do
258 Just line -> do
256 Just line -> do
259 runTutorialD sessionId conn (Just (T.length prompt)) (T.pack line)
257 runTutorialD sessionId conn (Just (T.length prompt)) (T.pack line)
260 reprLoop config sessionId conn
258 reprLoop config sessionId conn
261−
259+
262
260
263runTutorialD :: C.SessionId -> C.Connection -> Maybe PromptLength -> T.Text -> IO ()
261runTutorialD :: C.SessionId -> C.Connection -> Maybe PromptLength -> T.Text -> IO ()
264−runTutorialD sessionId conn mPromptLength tutd =
262+runTutorialD sessionId conn mPromptLength tutd =
265 case parseTutorialD tutd of
263 case parseTutorialD tutd of
266− Left err ->
264+ Left err ->
267 displayOpResult $ DisplayParseErrorResult mPromptLength err
265 displayOpResult $ DisplayParseErrorResult mPromptLength err
268 Right parsed ->
266 Right parsed ->
269 catchJust (\exc -> if exc == C.RequestTimeoutException then Just exc else Nothing) (do
267 catchJust (\exc -> if exc == C.RequestTimeoutException then Just exc else Nothing) (do
src/bin/TutorialD/Interpreter/Base.hs+40−115
@@ -1,61 +1,33 @@
1{-# LANGUAGE DeriveGeneric, CPP #-}
1{-# LANGUAGE DeriveGeneric, CPP #-}
2−module TutorialD.Interpreter.Base (
2+module TutorialD.Interpreter.Base where
3− module TutorialD.Interpreter.Base,
4− module Text.Megaparsec,
5−#if MIN_VERSION_megaparsec(6,0,0)
6− module Text.Megaparsec.Char,
7− module Control.Applicative
8−#else
9− module Text.Megaparsec.Text
10−#endif
11− )
12− where
13import ProjectM36.Base
3import ProjectM36.Base
14import ProjectM36.AtomType
4import ProjectM36.AtomType
15−import ProjectM36.Attribute as A
16import ProjectM36.Relation
5import ProjectM36.Relation
17−import ProjectM36.DataFrame
18
6
19−#if MIN_VERSION_megaparsec(6,0,0)
20−import Text.Megaparsec.Char
21−import qualified Text.Megaparsec.Char.Lexer as Lex
22import Text.Megaparsec
7import Text.Megaparsec
23−import Data.Void
24−import Control.Applicative hiding (many, some)
25−#else
26import Text.Megaparsec.Text
8import Text.Megaparsec.Text
27import qualified Text.Megaparsec.Lexer as Lex
9import qualified Text.Megaparsec.Lexer as Lex
28−#endif
29−
30import Data.Text hiding (count)
10import Data.Text hiding (count)
31import System.Random
11import System.Random
32import qualified Data.Text as T
12import qualified Data.Text as T
33import qualified Data.List as L
13import qualified Data.List as L
14+import qualified Data.Vector as V
34import qualified Data.Text.IO as TIO
15import qualified Data.Text.IO as TIO
35import System.IO
16import System.IO
36import ProjectM36.Relation.Show.Term
17import ProjectM36.Relation.Show.Term
37import GHC.Generics
18import GHC.Generics
38−#if __GLASGOW_HASKELL__ < 804
39import Data.Monoid
19import Data.Monoid
40−#endif
41import qualified Data.UUID as U
20import qualified Data.UUID as U
42import Control.Monad.Random
21import Control.Monad.Random
43import Data.List.NonEmpty as NE
22import Data.List.NonEmpty as NE
44import Data.Time.Clock
23import Data.Time.Clock
45import Data.Time.Format
24import Data.Time.Format
46−import Control.Monad (void)
47−import Data.Char
48−
49−#if !MIN_VERSION_megaparsec(7,0,0)
50−anySingle :: Parsec Void Text (Token Text)
51−anySingle = anyChar
52−#endif
53
25
54displayOpResult :: TutorialDOperatorResult -> IO ()
26displayOpResult :: TutorialDOperatorResult -> IO ()
55displayOpResult QuitResult = return ()
27displayOpResult QuitResult = return ()
56displayOpResult (DisplayResult out) = TIO.putStrLn out
28displayOpResult (DisplayResult out) = TIO.putStrLn out
57displayOpResult (DisplayIOResult ioout) = ioout
29displayOpResult (DisplayIOResult ioout) = ioout
58−displayOpResult (DisplayErrorResult err) = let outputf = if T.length err > 0 && T.last err /= '\n' then TIO.hPutStrLn else TIO.hPutStr in
30+displayOpResult (DisplayErrorResult err) = let outputf = if T.length err > 0 && T.last err /= '\n' then TIO.hPutStrLn else TIO.hPutStr in
59 outputf stderr ("ERR: " <> err)
31 outputf stderr ("ERR: " <> err)
60displayOpResult QuietSuccessResult = return ()
32displayOpResult QuietSuccessResult = return ()
61displayOpResult (DisplayRelationResult rel) = do
33displayOpResult (DisplayRelationResult rel) = do
@@ -63,36 +35,22 @@ displayOpResult (DisplayRelationResult rel) = do
63 let randomlySortedRel = evalRand (randomizeTupleOrder rel) gen
35 let randomlySortedRel = evalRand (randomizeTupleOrder rel) gen
64 TIO.putStrLn (showRelation randomlySortedRel)
36 TIO.putStrLn (showRelation randomlySortedRel)
65displayOpResult (DisplayParseErrorResult mPromptLength err) = do
37displayOpResult (DisplayParseErrorResult mPromptLength err) = do
66−#if MIN_VERSION_megaparsec(7,0,0)
67− let errorIndent = errorOffset . NE.head . bundleErrors $ err
68− errString = T.pack (parseErrorPretty . NE.head . bundleErrors $ err)
38+ let errString = T.pack (parseErrorPretty err)
69−#else
70− let errorIndent = unPos (sourceColumn (NE.head (errorPos err)))
39+ errorIndent = unPos (sourceColumn (NE.head (errorPos err)))
71− errString = T.pack (parseErrorPretty err)
72−#endif
73 pointyString len = T.justifyRight (len + fromIntegral errorIndent) '_' "^"
40 pointyString len = T.justifyRight (len + fromIntegral errorIndent) '_' "^"
74 maybe (pure ()) (TIO.putStrLn . pointyString) mPromptLength
41 maybe (pure ()) (TIO.putStrLn . pointyString) mPromptLength
75 TIO.putStr ("ERR:" <> errString)
42 TIO.putStr ("ERR:" <> errString)
76−displayOpResult (DisplayDataFrameResult dFrame) = TIO.putStrLn (showDataFrame dFrame)
77
43
78−#if MIN_VERSION_megaparsec(6,0,0)
79−type Parser = Parsec Void Text
80−type ParseStr = Text
81−#else
82−type ParseStr = String
83−#endif
84−
85−-- consumes only horizontal spaces
86spaceConsumer :: Parser ()
44spaceConsumer :: Parser ()
87−spaceConsumer = Lex.space space1 (Lex.skipLineComment "--") (Lex.skipBlockComment "{-" "-}")
45+spaceConsumer = Lex.space (void spaceChar) (Lex.skipLineComment "--") (Lex.skipBlockComment "{-" "-}")
88−
46+
89opChar :: Parser Char
47opChar :: Parser Char
90opChar = oneOf (":!#$%&*+./<=>?\\^|-~" :: String)-- remove "@" so it can be used as attribute marker without spaces
48opChar = oneOf (":!#$%&*+./<=>?\\^|-~" :: String)-- remove "@" so it can be used as attribute marker without spaces
91
49
92−reserved :: ParseStr -> Parser ()
50+reserved :: String -> Parser ()
93reserved word = try (string word *> notFollowedBy opChar *> spaceConsumer)
51reserved word = try (string word *> notFollowedBy opChar *> spaceConsumer)
94
52
95−reservedOp :: ParseStr -> Parser ()
53+reservedOp :: String -> Parser ()
96reservedOp op = try (spaceConsumer *> string op *> notFollowedBy opChar *> spaceConsumer)
54reservedOp op = try (spaceConsumer *> string op *> notFollowedBy opChar *> spaceConsumer)
97
55
98parens :: Parser a -> Parser a
56parens :: Parser a -> Parser a
@@ -104,20 +62,12 @@ braces = between (symbol "{") (symbol "}")
104identifier :: Parser Text
62identifier :: Parser Text
105identifier = do
63identifier = do
106 istart <- letterChar <|> char '_'
64 istart <- letterChar <|> char '_'
107− identifierRemainder istart
108−
109−identifierRemainder :: Char -> Parser Text
110−identifierRemainder c = do
111− rest <- many (alphaNumChar <|> char '_' <|> char '#')
65+ irest <- many (alphaNumChar <|> char '_' <|> char '#')
112 spaceConsumer
66 spaceConsumer
113− pure (pack (c:rest))
67+ pure (pack (istart:irest))
114
68
115−symbol :: ParseStr -> Parser Text
69+symbol :: String -> Parser Text
116−#if MIN_VERSION_megaparsec(6,0,0)
117−symbol sym = Lex.symbol spaceConsumer sym
118−#else
119symbol sym = pack <$> Lex.symbol spaceConsumer sym
70symbol sym = pack <$> Lex.symbol spaceConsumer sym
120−#endif
121
71
122comma :: Parser Text
72comma :: Parser Text
123comma = symbol ","
73comma = symbol ","
@@ -137,80 +87,67 @@ arrow = symbol "->"
137semi :: Parser Text
87semi :: Parser Text
138semi = symbol ";"
88semi = symbol ";"
139
89
140−nline :: Parser Text
90+{-
141−nline = (T.singleton <$> newline) <|> crlf
91+whiteSpace :: Parser ()
92+whiteSpace = Token.whiteSpace lexer
93+-}
142
94
143integer :: Parser Integer
95integer :: Parser Integer
144−#if MIN_VERSION_megaparsec(6,0,0)
145−integer = Lex.signed (pure ()) Lex.decimal <* spaceConsumer
146−#else
147−integer = Lex.signed (pure ()) Lex.integer <* spaceConsumer
96+integer = Lex.integer
148−#endif
149−
150−natural :: Parser Integer
151−#if MIN_VERSION_megaparsec(6,0,0)
152−natural = Lex.decimal <* spaceConsumer
153−#else
154−natural = Lex.integer <* spaceConsumer
155−#endif
156
97
157float :: Parser Double
98float :: Parser Double
158−float = Lex.float <* spaceConsumer
99+float = Lex.float
159
100
160capitalizedIdentifier :: Parser Text
101capitalizedIdentifier :: Parser Text
161−capitalizedIdentifier =
102+capitalizedIdentifier = do
162− upperChar >>= identifierRemainder
103+ fletter <- upperChar
163−
104+ restOfIdentifier_ fletter
105+
106+restOfIdentifier_ :: Char -> Parser Text
107+restOfIdentifier_ fletter = do
108+ rest <- option "" identifier
109+ spaceConsumer
110+ pure (T.cons fletter rest)
111+
164uncapitalizedIdentifier :: Parser Text
112uncapitalizedIdentifier :: Parser Text
165−uncapitalizedIdentifier =
113+uncapitalizedIdentifier = do
166− lowerChar >>= identifierRemainder
114+ fletter <- lowerChar
115+ restOfIdentifier_ fletter
167
116
168showRelationAttributes :: Attributes -> Text
117showRelationAttributes :: Attributes -> Text
169showRelationAttributes attrs = "{" <> T.concat (L.intersperse ", " $ L.map showAttribute attrsL) <> "}"
118showRelationAttributes attrs = "{" <> T.concat (L.intersperse ", " $ L.map showAttribute attrsL) <> "}"
170 where
119 where
171− showAttribute (Attribute name atomType') = name <> " " <> prettyAtomType atomType'
120+ showAttribute (Attribute name atomType) = name <> " " <> prettyAtomType atomType
172− attrsL = A.toList attrs
121+ attrsL = V.toList attrs
173−
174−type PromptLength = Int
175
122
176−#if MIN_VERSION_megaparsec(7,0,0)
123+type PromptLength = Int
177−type ParserError = ParseErrorBundle T.Text Void
178−#elif MIN_VERSION_megaparsec(6,0,0)
179−type ParserError = ParseError Char Void
180−#else
181−type ParserError = ParseError Char Dec
182−#endif
183
124
184data TutorialDOperatorResult = QuitResult |
125data TutorialDOperatorResult = QuitResult |
185 DisplayResult StringType |
126 DisplayResult StringType |
186 DisplayIOResult (IO ()) |
127 DisplayIOResult (IO ()) |
187 DisplayRelationResult Relation |
128 DisplayRelationResult Relation |
188− DisplayDataFrameResult DataFrame |
189 DisplayErrorResult StringType |
129 DisplayErrorResult StringType |
190− DisplayParseErrorResult (Maybe PromptLength) ParserError | -- PromptLength refers to length of prompt text
130+ DisplayParseErrorResult (Maybe PromptLength) (ParseError Char Dec) | -- Int refers to length of prompt text
191 QuietSuccessResult
131 QuietSuccessResult
192 deriving (Generic)
132 deriving (Generic)
193−
133+
194type TransactionGraphWasUpdated = Bool
134type TransactionGraphWasUpdated = Bool
195
135
196--allow for python-style triple quoting because guessing the correct amount of escapes in different contexts is annoying
136--allow for python-style triple quoting because guessing the correct amount of escapes in different contexts is annoying
197tripleQuotedString :: Parser Text
137tripleQuotedString :: Parser Text
198tripleQuotedString = do
138tripleQuotedString = do
199 _ <- tripleQuote
139 _ <- tripleQuote
200− pack <$> manyTill anySingle (try (tripleQuote >> notFollowedBy quote))
140+ pack <$> manyTill anyChar (try (tripleQuote >> notFollowedBy quote))
201−
141+
202normalQuotedString :: Parser Text
142normalQuotedString :: Parser Text
203normalQuotedString = quote *> (T.pack <$> manyTill Lex.charLiteral quote)
143normalQuotedString = quote *> (T.pack <$> manyTill Lex.charLiteral quote)
204
144
205quotedString :: Parser Text
145quotedString :: Parser Text
206quotedString = try tripleQuotedString <|> normalQuotedString
146quotedString = try tripleQuotedString <|> normalQuotedString
207
147
208−quoted :: Parser a -> Parser a
209−quoted = between quote quote
210−
211uuidP :: Parser U.UUID
148uuidP :: Parser U.UUID
212uuidP = do
149uuidP = do
213− uuidStart <- count 8 hexDigitChar
150+ uuidStart <- count 8 hexDigitChar
214 _ <- char '-' -- min 28 with no dashes, maximum 4 dashes
151 _ <- char '-' -- min 28 with no dashes, maximum 4 dashes
215 uuidMid1 <- count 4 hexDigitChar
152 uuidMid1 <- count 4 hexDigitChar
216 _ <- char '-'
153 _ <- char '-'
@@ -229,17 +166,5 @@ utcTimeP = do
229 timeStr <- quotedString
166 timeStr <- quotedString
230 case parseTimeM True defaultTimeLocale "%Y-%m-%d %H:%M:%S" (T.unpack timeStr) of
167 case parseTimeM True defaultTimeLocale "%Y-%m-%d %H:%M:%S" (T.unpack timeStr) of
231 Nothing -> fail "invalid datetime input, use \"YYYY-MM-DD HH:MM:SS\""
168 Nothing -> fail "invalid datetime input, use \"YYYY-MM-DD HH:MM:SS\""
232− Just stamp' -> pure stamp'
169+ Just stamp -> pure stamp
233−
234−
235−colonOp :: Text -> Parser ()
236−colonOp opStr = do
237− _ <- string opStr <* (void spaceChar <|> eof) <* spaceConsumer
238− pure ()
239−
240−hex :: Parser Text
241−hex = takeWhileP (Just "hexadecimal")
242− (\c ->
243− isDigit c
244− || (c >= 'a' && c <= 'f'))
245
170
src/bin/TutorialD/Interpreter/DatabaseContextExpr.hs+34−31
@@ -1,20 +1,20 @@
1−{-# LANGUAGE CPP #-}
2module TutorialD.Interpreter.DatabaseContextExpr where
1module TutorialD.Interpreter.DatabaseContextExpr where
2+import Text.Megaparsec
3+import Text.Megaparsec.Text
3import ProjectM36.Base
4import ProjectM36.Base
4import TutorialD.Interpreter.Base
5import TutorialD.Interpreter.Base
5import qualified Data.Text as T
6import qualified Data.Text as T
6import TutorialD.Interpreter.RelationalExpr
7import TutorialD.Interpreter.RelationalExpr
7import TutorialD.Interpreter.Types
8import TutorialD.Interpreter.Types
8import qualified Data.Map as M
9import qualified Data.Map as M
10+import Control.Monad.State
9import ProjectM36.StaticOptimizer
11import ProjectM36.StaticOptimizer
10import qualified ProjectM36.Error as PM36E
12import qualified ProjectM36.Error as PM36E
11import ProjectM36.Error
13import ProjectM36.Error
12import qualified ProjectM36.RelationalExpression as RE
14import qualified ProjectM36.RelationalExpression as RE
13import ProjectM36.Key
15import ProjectM36.Key
14import ProjectM36.FunctionalDependency
16import ProjectM36.FunctionalDependency
15−#if __GLASGOW_HASKELL__ < 804
16import Data.Monoid
17import Data.Monoid
17−#endif
18import Data.Functor
18import Data.Functor
19
19
20--parsers which create "database expressions" which modify the database context (such as relvar assignment)
20--parsers which create "database expressions" which modify the database context (such as relvar assignment)
@@ -44,47 +44,53 @@ nothingP = spaceConsumer >> pure NoOperation
44assignP :: Parser DatabaseContextExpr
44assignP :: Parser DatabaseContextExpr
45assignP = do
45assignP = do
46 relVarName <- try $ do
46 relVarName <- try $ do
47− relVarName <- relVarNameP
47+ relVarName <- identifier
48 reservedOp ":="
48 reservedOp ":="
49 return relVarName
49 return relVarName
50+ expr <- relExprP
50− Assign relVarName <$> relExprP
51+ pure $ Assign relVarName expr
51
52
52multilineSep :: Parser T.Text
53multilineSep :: Parser T.Text
53multilineSep = newline >> pure "\n"
54multilineSep = newline >> pure "\n"
54
55
55multipleDatabaseContextExprP :: Parser DatabaseContextExpr
56multipleDatabaseContextExprP :: Parser DatabaseContextExpr
56multipleDatabaseContextExprP = do
57multipleDatabaseContextExprP = do
57− exprs <- filter (/= NoOperation) <$> sepBy1 databaseContextExprP semi
58+ exprs <- sepBy1 databaseContextExprP semi
58− pure (MultipleExpr exprs)
59+ pure $ MultipleExpr exprs
59
60
60insertP :: Parser DatabaseContextExpr
61insertP :: Parser DatabaseContextExpr
61insertP = do
62insertP = do
62 reservedOp "insert"
63 reservedOp "insert"
63− relvar <- relVarNameP
64+ relvar <- identifier
64− Insert relvar <$> relExprP
65+ expr <- relExprP
66+ pure $ Insert relvar expr
65
67
66defineP :: Parser DatabaseContextExpr
68defineP :: Parser DatabaseContextExpr
67defineP = do
69defineP = do
68 relVarName <- try $ do
70 relVarName <- try $ do
69− relVarName <- relVarNameP
71+ relVarName <- identifier
70 reservedOp "::"
72 reservedOp "::"
71 return relVarName
73 return relVarName
74+ attributeSet <- makeAttributeExprsP
72− Define relVarName <$> makeAttributeExprsP
75+ pure $ Define relVarName attributeSet
73
76
74undefineP :: Parser DatabaseContextExpr
77undefineP :: Parser DatabaseContextExpr
75undefineP = do
78undefineP = do
76 reservedOp "undefine"
79 reservedOp "undefine"
77− Undefine <$> relVarNameP
80+ relVarName <- identifier
81+ return $ Undefine relVarName
78
82
79deleteP :: Parser DatabaseContextExpr
83deleteP :: Parser DatabaseContextExpr
80deleteP = do
84deleteP = do
81 reservedOp "delete"
85 reservedOp "delete"
86+ relVarName <- identifier
82− Delete <$> relVarNameP <*> option TruePredicate (reservedOp "where" *> restrictionPredicateP)
87+ predicate <- option TruePredicate (reservedOp "where" *> restrictionPredicateP)
88+ return $ Delete relVarName predicate
83
89
84updateP :: Parser DatabaseContextExpr
90updateP :: Parser DatabaseContextExpr
85updateP = do
91updateP = do
86 reservedOp "update"
92 reservedOp "update"
87− relVarName <- relVarNameP
93+ relVarName <- identifier
88 predicate <- option TruePredicate (reservedOp "where" *> restrictionPredicateP <* spaceConsumer)
94 predicate <- option TruePredicate (reservedOp "where" *> restrictionPredicateP <* spaceConsumer)
89 attributeAssignments <- M.fromList <$> parens (sepBy attributeAssignmentP comma)
95 attributeAssignments <- M.fromList <$> parens (sepBy attributeAssignmentP comma)
90 return $ Update relVarName attributeAssignments predicate
96 return $ Update relVarName attributeAssignments predicate
@@ -108,7 +114,8 @@ addConstraintP = do
108deleteConstraintP :: Parser DatabaseContextExpr
114deleteConstraintP :: Parser DatabaseContextExpr
109deleteConstraintP = do
115deleteConstraintP = do
110 reserved "deleteconstraint"
116 reserved "deleteconstraint"
117+ constraintName <- identifier
111− RemoveInclusionDependency <$> identifier
118+ pure $ RemoveInclusionDependency constraintName
112
119
113-- key <constraint name> {<uniqueness attributes>} <uniqueness relexpr>
120-- key <constraint name> {<uniqueness attributes>} <uniqueness relexpr>
114keyP :: Parser DatabaseContextExpr
121keyP :: Parser DatabaseContextExpr
@@ -148,12 +155,14 @@ addNotificationP = do
148 notName <- identifier
155 notName <- identifier
149 triggerExpr <- relExprP
156 triggerExpr <- relExprP
150 resultOldExpr <- relExprP
157 resultOldExpr <- relExprP
158+ resultNewExpr <- relExprP
151− AddNotification notName triggerExpr resultOldExpr <$> relExprP
159+ pure $ AddNotification notName triggerExpr resultOldExpr resultNewExpr
152
160
153removeNotificationP :: Parser DatabaseContextExpr
161removeNotificationP :: Parser DatabaseContextExpr
154removeNotificationP = do
162removeNotificationP = do
155 reserved "unnotify"
163 reserved "unnotify"
164+ notName <- identifier
156− RemoveNotification <$> identifier
165+ pure $ RemoveNotification notName
157
166
158-- | data Hair = Bald | Color Text
167-- | data Hair = Bald | Color Text
159addTypeConstructorP :: Parser DatabaseContextExpr
168addTypeConstructorP :: Parser DatabaseContextExpr
@@ -167,7 +176,7 @@ addTypeConstructorP = do
167removeTypeConstructorP :: Parser DatabaseContextExpr
176removeTypeConstructorP :: Parser DatabaseContextExpr
168removeTypeConstructorP = do
177removeTypeConstructorP = do
169 reserved "undata"
178 reserved "undata"
170− RemoveTypeConstructor <$> typeConstructorNameP
179+ RemoveTypeConstructor <$> identifier
171
180
172removeAtomFunctionP :: Parser DatabaseContextExpr
181removeAtomFunctionP :: Parser DatabaseContextExpr
173removeAtomFunctionP = do
182removeAtomFunctionP = do
@@ -179,35 +188,29 @@ removeDatabaseContextFunctionP = do
179 reserved "removedatabasecontextfunction"
188 reserved "removedatabasecontextfunction"
180 RemoveDatabaseContextFunction <$> quotedString
189 RemoveDatabaseContextFunction <$> quotedString
181
190
182−functionNameP :: Parser AtomFunctionName
183−functionNameP = uncapitalizedIdentifier
184−
185executeDatabaseContextFunctionP :: Parser DatabaseContextExpr
191executeDatabaseContextFunctionP :: Parser DatabaseContextExpr
186executeDatabaseContextFunctionP = do
192executeDatabaseContextFunctionP = do
187 reserved "execute"
193 reserved "execute"
188− funcName <- functionNameP
194+ funcName <- identifier
189 args <- parens (sepBy atomExprP comma)
195 args <- parens (sepBy atomExprP comma)
190 pure (ExecuteDatabaseContextFunction funcName args)
196 pure (ExecuteDatabaseContextFunction funcName args)
191
197
192databaseExprOpP :: Parser DatabaseContextExpr
198databaseExprOpP :: Parser DatabaseContextExpr
193databaseExprOpP = multipleDatabaseContextExprP
199databaseExprOpP = multipleDatabaseContextExprP
194
200
195−{-
196evalDatabaseContextExpr :: Bool -> DatabaseContext -> DatabaseContextExpr -> Either RelationalError DatabaseContext
201evalDatabaseContextExpr :: Bool -> DatabaseContext -> DatabaseContextExpr -> Either RelationalError DatabaseContext
197evalDatabaseContextExpr useOptimizer context expr = do
202evalDatabaseContextExpr useOptimizer context expr = do
198 optimizedExpr <- evalState (applyStaticDatabaseOptimization expr) (RE.freshDatabaseState context)
203 optimizedExpr <- evalState (applyStaticDatabaseOptimization expr) (RE.freshDatabaseState context)
199 case runState (RE.evalDatabaseContextExpr (if useOptimizer then optimizedExpr else expr)) (RE.freshDatabaseState context) of
204 case runState (RE.evalDatabaseContextExpr (if useOptimizer then optimizedExpr else expr)) (RE.freshDatabaseState context) of
200 (Right (), (context',_, _)) -> Right context'
205 (Right (), (context',_, _)) -> Right context'
201 (Left err, _) -> Left err
206 (Left err, _) -> Left err
202−-}
203
207
208+
204−interpretDatabaseContextExpr :: DatabaseContext -> TransactionId -> TransactionGraph -> T.Text -> Either RelationalError DatabaseContext
209+interpretDatabaseContextExpr :: DatabaseContext -> T.Text -> Either RelationalError DatabaseContext
205−interpretDatabaseContextExpr context transId graph tutdstring =
210+interpretDatabaseContextExpr context tutdstring = case parse databaseExprOpP "" tutdstring of
206− case parse databaseExprOpP "" tutdstring of
207− Left err -> Left $ PM36E.ParseError (T.pack (show err))
211+ Left err -> Left $ PM36E.ParseError (T.pack (show err))
208− Right parsed -> do
212+ Right parsed ->
209− let env = RE.mkDatabaseContextEvalEnv transId graph
213+ evalDatabaseContextExpr True context parsed
210− RE.dbc_context <$> RE.runDatabaseContextEvalMonad context env (optimizeAndEvalDatabaseContextExpr True parsed)
211
214
212{-
215{-
213--no optimization
216--no optimization
src/bin/TutorialD/Interpreter/DatabaseContextIOOperator.hs+8−27
@@ -1,8 +1,11 @@
1--compiling the script requires the IO monad because it must load modules from the filesystem, so we create the function and generate the requisite DatabaseExpr here.
1--compiling the script requires the IO monad because it must load modules from the filesystem, so we create the function and generate the requisite DatabaseExpr here.
2module TutorialD.Interpreter.DatabaseContextIOOperator where
2module TutorialD.Interpreter.DatabaseContextIOOperator where
3import ProjectM36.Base
3import ProjectM36.Base
4+
4import TutorialD.Interpreter.Base
5import TutorialD.Interpreter.Base
5import TutorialD.Interpreter.Types
6import TutorialD.Interpreter.Types
7+import Text.Megaparsec
8+import Text.Megaparsec.Text
6import Data.Text
9import Data.Text
7
10
8addAtomFunctionExprP :: Parser DatabaseContextIOExpr
11addAtomFunctionExprP :: Parser DatabaseContextIOExpr
@@ -10,41 +13,19 @@ addAtomFunctionExprP = dbioexprP "addatomfunction" AddAtomFunction
10
13
11addDatabaseContextFunctionExprP :: Parser DatabaseContextIOExpr
14addDatabaseContextFunctionExprP :: Parser DatabaseContextIOExpr
12addDatabaseContextFunctionExprP = dbioexprP "adddatabasecontextfunction" AddDatabaseContextFunction
15addDatabaseContextFunctionExprP = dbioexprP "adddatabasecontextfunction" AddDatabaseContextFunction
13−
14−createArbitraryRelationP :: Parser DatabaseContextIOExpr
15−createArbitraryRelationP = do
16− reserved "createarbitraryrelation"
17− relVarName <- identifier
18− attrExprs <- makeAttributeExprsP :: Parser [AttributeExpr]
19− min' <- fromInteger <$> integer
20− _ <- symbol "-"
21− max' <- fromInteger <$> integer
22− pure $ CreateArbitraryRelation relVarName attrExprs (min',max')
23
16
24−dbioexprP :: ParseStr -> (Text -> [TypeConstructor] -> Text -> DatabaseContextIOExpr) -> Parser DatabaseContextIOExpr
17+dbioexprP :: String -> (Text -> [TypeConstructor] -> Text -> DatabaseContextIOExpr) -> Parser DatabaseContextIOExpr
25dbioexprP res adt = do
18dbioexprP res adt = do
26 reserved res
19 reserved res
27 funcName <- quotedString
20 funcName <- quotedString
28 funcType <- atomTypeSignatureP
21 funcType <- atomTypeSignatureP
22+ funcScript <- quotedString
29− adt funcName funcType <$> quotedString
23+ pure $ adt funcName funcType funcScript
30
24
31atomTypeSignatureP :: Parser [TypeConstructor]
25atomTypeSignatureP :: Parser [TypeConstructor]
32atomTypeSignatureP = sepBy typeConstructorP arrow
26atomTypeSignatureP = sepBy typeConstructorP arrow
33
27
34dbContextIOExprP :: Parser DatabaseContextIOExpr
28dbContextIOExprP :: Parser DatabaseContextIOExpr
35−dbContextIOExprP = addAtomFunctionExprP <|>
29+dbContextIOExprP = addAtomFunctionExprP <|> addDatabaseContextFunctionExprP
36− addDatabaseContextFunctionExprP <|>
30+
37− loadAtomFunctionsP <|>
38− loadDatabaseContextFunctionsP <|>
39− createArbitraryRelationP
40−
41−loadAtomFunctionsP :: Parser DatabaseContextIOExpr
42−loadAtomFunctionsP = do
43− reserved "loadatomfunctions"
44− LoadAtomFunctions <$> quotedString <*> quotedString <*> fmap unpack quotedString
45−
46−loadDatabaseContextFunctionsP :: Parser DatabaseContextIOExpr
47−loadDatabaseContextFunctionsP = do
48− reserved "loaddatabasecontextfunctions"
49− LoadDatabaseContextFunctions <$> quotedString <*> quotedString <*> fmap unpack quotedString
50
31
src/bin/TutorialD/Interpreter/Export/Base.hs−3
@@ -1,10 +1,7 @@
1−{-# LANGUAGE CPP #-}
2module TutorialD.Interpreter.Export.Base where
1module TutorialD.Interpreter.Export.Base where
3import ProjectM36.Base
2import ProjectM36.Base
4import ProjectM36.Error
3import ProjectM36.Error
5−#if __GLASGOW_HASKELL__ < 804
6import Data.Monoid
4import Data.Monoid
7−#endif
8
5
9data RelVarDataExportOperator = RelVarDataExportOperator RelationalExpr FilePath (RelVarDataExportOperator -> Relation -> IO (Maybe RelationalError))
6data RelVarDataExportOperator = RelVarDataExportOperator RelationalExpr FilePath (RelVarDataExportOperator -> Relation -> IO (Maybe RelationalError))
10
7
src/bin/TutorialD/Interpreter/Export/CSV.hs+2−1
@@ -2,9 +2,10 @@ module TutorialD.Interpreter.Export.CSV where
2import ProjectM36.Relation.Show.CSV
2import ProjectM36.Relation.Show.CSV
3import TutorialD.Interpreter.Export.Base
3import TutorialD.Interpreter.Export.Base
4import TutorialD.Interpreter.RelationalExpr
4import TutorialD.Interpreter.RelationalExpr
5−import TutorialD.Interpreter.Base hiding (try)
5+import TutorialD.Interpreter.Base
6import ProjectM36.Base
6import ProjectM36.Base
7import ProjectM36.Error
7import ProjectM36.Error
8+import Text.Megaparsec.Text
8import qualified Data.ByteString.Lazy as BS
9import qualified Data.ByteString.Lazy as BS
9import Control.Exception (try)
10import Control.Exception (try)
10import qualified Data.Text as T
11import qualified Data.Text as T
src/bin/TutorialD/Interpreter/Import/Base.hs+3−11
@@ -1,12 +1,7 @@
1−{-# LANGUAGE CPP #-}
2module TutorialD.Interpreter.Import.Base where
1module TutorialD.Interpreter.Import.Base where
3import ProjectM36.Base
2import ProjectM36.Base
4import ProjectM36.Error
3import ProjectM36.Error
5−import Text.URI (URI)
6−import Data.Text (Text)
7−#if __GLASGOW_HASKELL__ < 804
8import Data.Monoid
4import Data.Monoid
9−#endif
10
5
11-- | import data into a relation variable
6-- | import data into a relation variable
12data RelVarDataImportOperator = RelVarDataImportOperator RelVarName FilePath (RelVarName -> TypeConstructorMapping -> Attributes -> FilePath -> IO (Either RelationalError DatabaseContextExpr))
7data RelVarDataImportOperator = RelVarDataImportOperator RelVarName FilePath (RelVarName -> TypeConstructorMapping -> Attributes -> FilePath -> IO (Either RelationalError DatabaseContextExpr))
@@ -14,14 +9,11 @@ data RelVarDataImportOperator = RelVarDataImportOperator RelVarName FilePath (Re
14instance Show RelVarDataImportOperator where
9instance Show RelVarDataImportOperator where
15 show (RelVarDataImportOperator rv path _) = "RelVarDataImportOperator " <> show rv <> " " <> path
10 show (RelVarDataImportOperator rv path _) = "RelVarDataImportOperator " <> show rv <> " " <> path
16
11
17−type HashVerification = Maybe Text
18−
19-- | import data into a database context
12-- | import data into a database context
20−data DatabaseContextDataImportOperator = DatabaseContextDataImportOperator URI HashVerification (URI -> HashVerification -> IO (Either RelationalError DatabaseContextExpr))
13+data DatabaseContextDataImportOperator = DatabaseContextDataImportOperator FilePath (FilePath -> IO (Either RelationalError DatabaseContextExpr))
21
14
22instance Show DatabaseContextDataImportOperator where
15instance Show DatabaseContextDataImportOperator where
23− show (DatabaseContextDataImportOperator uri hash _) =
16+ show (DatabaseContextDataImportOperator path _) = "DatabaseContextDataImportOperator " <> path
24− "DatabaseContextDataImportOperator " <> show uri <> " " <> show hash
25
17
26-- perhaps create a structure to import a whole transaction graph section in the future
18-- perhaps create a structure to import a whole transaction graph section in the future
27
19
@@ -29,4 +21,4 @@ evalRelVarDataImportOperator :: RelVarDataImportOperator -> TypeConstructorMappi
29evalRelVarDataImportOperator (RelVarDataImportOperator relVarName path importFunc) tConsMap attrs = importFunc relVarName tConsMap attrs path
21evalRelVarDataImportOperator (RelVarDataImportOperator relVarName path importFunc) tConsMap attrs = importFunc relVarName tConsMap attrs path
30
22
31evalDatabaseContextDataImportOperator :: DatabaseContextDataImportOperator -> IO (Either RelationalError DatabaseContextExpr)
23evalDatabaseContextDataImportOperator :: DatabaseContextDataImportOperator -> IO (Either RelationalError DatabaseContextExpr)
32−evalDatabaseContextDataImportOperator (DatabaseContextDataImportOperator uri hash importFunc) = importFunc uri hash
24+evalDatabaseContextDataImportOperator (DatabaseContextDataImportOperator path importFunc) = importFunc path
src/bin/TutorialD/Interpreter/Import/BasicExamples.hs+2−6
@@ -1,14 +1,10 @@
1−{-# LANGUAGE CPP #-}
2--includes some hardcoded examples which can be imported even during safe evaluation (no file I/O)
1--includes some hardcoded examples which can be imported even during safe evaluation (no file I/O)
3module TutorialD.Interpreter.Import.BasicExamples where
2module TutorialD.Interpreter.Import.BasicExamples where
4import ProjectM36.DateExamples
3import ProjectM36.DateExamples
5import ProjectM36.Base
4import ProjectM36.Base
6import ProjectM36.DatabaseContext
5import ProjectM36.DatabaseContext
7import TutorialD.Interpreter.Base
6import TutorialD.Interpreter.Base
8−
9−#if !MIN_VERSION_megaparsec(6,0,0)
10import Text.Megaparsec.Text
7import Text.Megaparsec.Text
11−#endif
12
8
13data ImportBasicExampleOperator = ImportBasicDateExampleOperator
9data ImportBasicExampleOperator = ImportBasicDateExampleOperator
14 deriving (Show)
10 deriving (Show)
@@ -20,8 +16,8 @@ importBasicExampleOperatorP :: Parser ImportBasicExampleOperator
20importBasicExampleOperatorP = do
16importBasicExampleOperatorP = do
21 reservedOp ":importexample"
17 reservedOp ":importexample"
22 example <- identifier
18 example <- identifier
23− if example == "cjdate" then
19+ if example == "date" then
24 pure ImportBasicDateExampleOperator
20 pure ImportBasicDateExampleOperator
25 else
21 else
26 fail "Unknown example name"
22 fail "Unknown example name"
27−
23+
src/bin/TutorialD/Interpreter/Import/CSV.hs+5−5
@@ -1,4 +1,3 @@
1−{-# LANGUAGE CPP #-}
2module TutorialD.Interpreter.Import.CSV where
1module TutorialD.Interpreter.Import.CSV where
3import TutorialD.Interpreter.Import.Base
2import TutorialD.Interpreter.Import.Base
4import ProjectM36.Base
3import ProjectM36.Base
@@ -6,7 +5,8 @@ import ProjectM36.Error
6import ProjectM36.Relation.Parse.CSV hiding (quotedString)
5import ProjectM36.Relation.Parse.CSV hiding (quotedString)
7import qualified Data.ByteString.Lazy as BS
6import qualified Data.ByteString.Lazy as BS
8import qualified Data.Text as T
7import qualified Data.Text as T
8+import Text.Megaparsec.Text
9−import TutorialD.Interpreter.Base hiding (try)
9+import TutorialD.Interpreter.Base
10import Control.Exception
10import Control.Exception
11
11
12importCSVRelation :: RelVarName -> TypeConstructorMapping -> Attributes -> FilePath -> IO (Either RelationalError DatabaseContextExpr)
12importCSVRelation :: RelVarName -> TypeConstructorMapping -> Attributes -> FilePath -> IO (Either RelationalError DatabaseContextExpr)
@@ -14,10 +14,10 @@ importCSVRelation relVarName tConsMap attrs pathIn = do
14 --TODO: handle filesystem errors
14 --TODO: handle filesystem errors
15 csvData <- try (BS.readFile pathIn) :: IO (Either IOError BS.ByteString)
15 csvData <- try (BS.readFile pathIn) :: IO (Either IOError BS.ByteString)
16 case csvData of
16 case csvData of
17− Left err -> pure $ Left (ImportError (ImportFileError (T.pack (show err))))
17+ Left err -> return $ Left (ImportError $ T.pack (show err))
18 Right csvData' -> case csvAsRelation attrs tConsMap csvData' of
18 Right csvData' -> case csvAsRelation attrs tConsMap csvData' of
19− Left err -> pure $ Left (ParseError $ T.pack (show err))
19+ Left err -> return $ Left (ParseError $ T.pack (show err))
20− Right csvRel -> pure $ Right (Insert relVarName (ExistingRelation csvRel))
20+ Right csvRel -> return $ Right (Insert relVarName (ExistingRelation csvRel))
21
21
22importCSVP :: Parser RelVarDataImportOperator
22importCSVP :: Parser RelVarDataImportOperator
23importCSVP = do
23importCSVP = do
src/bin/TutorialD/Interpreter/Import/TutorialD.hs+15−70
@@ -1,86 +1,31 @@
1module TutorialD.Interpreter.Import.TutorialD where
1module TutorialD.Interpreter.Import.TutorialD where
2import ProjectM36.Base
2import ProjectM36.Base
3import TutorialD.Interpreter.Import.Base
3import TutorialD.Interpreter.Import.Base
4−import TutorialD.Interpreter.Base hiding (try)
4+import TutorialD.Interpreter.Base
5import TutorialD.Interpreter.DatabaseContextExpr
5import TutorialD.Interpreter.DatabaseContextExpr
6+import Text.Megaparsec.Text
7+import Text.Megaparsec hiding (try)
6import ProjectM36.Error
8import ProjectM36.Error
7import qualified ProjectM36.Error as PM36E
9import qualified ProjectM36.Error as PM36E
8import qualified Data.Text as T
10import qualified Data.Text as T
9import Control.Exception
11import Control.Exception
10−import qualified Data.ByteString as BS
12+import qualified Data.Text.IO as TIO
11−import qualified Data.Text.Encoding as TE
12−import qualified Text.URI as URI
13−import Text.URI (URI)
14−import Crypto.Hash.SHA256
15−import Data.ByteString.Base16 as B16
16−import Network.HTTP.Simple
17−import Network.HTTP.Types
18−--import a file containing TutorialD database context expressions via local files or HTTP/HTTPS
13+--import a file containing TutorialD database context expressions
19
14
20−importTutorialDFromFile :: URI -> HashVerification -> IO (Either RelationalError DatabaseContextExpr)
15+importTutorialD :: FilePath -> IO (Either RelationalError DatabaseContextExpr)
21−importTutorialDFromFile fileURI mHash = do
16+importTutorialD pathIn = do
22− case URI.uriPath fileURI of
23− Just (False, _) -> do
24− eTutdBytes <- try (BS.readFile filePath) :: IO (Either IOError BS.ByteString)
17+ tutdData <- try (TIO.readFile pathIn) :: IO (Either IOError T.Text)
25− case eTutdBytes of
18+ case tutdData of
26− Left err -> pure $ Left (ImportError (ImportFileError (T.pack (show err))))
19+ Left err -> return $ Left (ImportError $ T.pack (show err))
27− Right tutdBytes ->
20+ Right tutdData' ->
28− case validateBytes tutdBytes mHash of
29− Left err -> pure (Left err)
30− Right tutdBytes' -> importTutorialDBytes tutdBytes'
31− _ -> pure (Left (ImportError (InvalidFileURIError (URI.render fileURI))))
32− where
33− filePath = drop (length ("file://" :: String)) (URI.renderStr fileURI)
34−
35−
36−importTutorialDBytes :: BS.ByteString -> IO (Either RelationalError DatabaseContextExpr)
37−importTutorialDBytes tutdBytes =
38− case TE.decodeUtf8' tutdBytes of
39− Left err -> pure (Left (ImportError (ImportFileDecodeError (T.pack (show err)))))
40− Right tutdUtf8 ->
41− case parse (multipleDatabaseContextExprP <* eof) "import" tutdUtf8 of
21+ case parse multipleDatabaseContextExprP "import" tutdData' of
42 --parseErrorPretty is new in megaparsec 5
22 --parseErrorPretty is new in megaparsec 5
43− Left err -> pure (Left (PM36E.ParseError (T.pack (errorBundlePretty err))))
23+ Left err -> pure (Left (PM36E.ParseError (T.pack (show err))))
44 Right expr -> pure (Right expr)
24 Right expr -> pure (Right expr)
45
25
46−importTutorialDViaHTTP :: URI -> HashVerification -> IO (Either RelationalError DatabaseContextExpr)
47−importTutorialDViaHTTP uri mHash = do
48− reqURI <- parseRequest (URI.renderStr uri)
49− response <- httpBS reqURI
50− let scode = getResponseStatus response
51− if scode == ok200 then
52− let byteBody = getResponseBody response in
53− case validateBytes byteBody mHash of
54− Right byteBody' -> do
55− importTutorialDBytes byteBody'
56− Left err -> pure (Left err)
57− else
58− pure (Left (ImportError (ImportDownloadError (T.pack ("download failed: " <> show scode)))))
59−
60−validateBytes :: BS.ByteString -> HashVerification -> Either RelationalError BS.ByteString
61−validateBytes tutdBytes mHash =
62− case mHash of
63− Nothing -> pure tutdBytes
64− Just expectedHashText ->
65− case B16.decode (TE.encodeUtf8 expectedHashText) of
66− Left _ -> Left (ImportError (InvalidSHA256Error expectedHashText))
67− Right expectedHash | hashBytes == expectedHash -> pure tutdBytes
68− | otherwise ->
69− let p = TE.decodeUtf8 . B16.encode in
70− Left (ImportError (SHA256MismatchError (p expectedHash) (p hashBytes)))
71− where
72− hashBytes = hash tutdBytes
73−
74−
75tutdImportP :: Parser DatabaseContextDataImportOperator
26tutdImportP :: Parser DatabaseContextDataImportOperator
76tutdImportP = do
27tutdImportP = do
77 reserved ":importtutd"
28 reserved ":importtutd"
78− uri <- quoted URI.parser
29+ path <- quotedString
79 spaceConsumer
30 spaceConsumer
80− mhash <- optional (quoted hex)
81− handler <- case URI.unRText <$> URI.uriScheme uri of
82− Nothing -> fail "URI scheme missing"
83− Just "file" -> pure importTutorialDFromFile
84− Just scheme | scheme `elem` ["http", "https"] -> pure importTutorialDViaHTTP
85− | otherwise -> fail ( "unsupported URI scheme: " <> show scheme)
86− pure $ DatabaseContextDataImportOperator uri mhash handler
31+ return $ DatabaseContextDataImportOperator (T.unpack path) importTutorialD
src/bin/TutorialD/Interpreter/InformationOperator.hs+1−5
@@ -2,12 +2,8 @@
2module TutorialD.Interpreter.InformationOperator where
2module TutorialD.Interpreter.InformationOperator where
3import Data.Text
3import Data.Text
4import Text.Megaparsec
4import Text.Megaparsec
5+import Text.Megaparsec.Text
5import TutorialD.Interpreter.Base
6import TutorialD.Interpreter.Base
6−-- older versions of stack fail to
7−#if !defined(VERSION_project_m36)
8−# warning Failed to discover proper version from cabal_macros.h
9−# define VERSION_project_m36 "<unknown>"
10−#endif
11
7
12-- this module provides information about the current interpreter
8-- this module provides information about the current interpreter
13
9
src/bin/TutorialD/Interpreter/RODatabaseContextOperator.hs+25−94
@@ -1,16 +1,14 @@
1{-# LANGUAGE GADTs #-}
1{-# LANGUAGE GADTs #-}
2module TutorialD.Interpreter.RODatabaseContextOperator where
2module TutorialD.Interpreter.RODatabaseContextOperator where
3import ProjectM36.Base
3import ProjectM36.Base
4−import ProjectM36.Relation
5−import qualified ProjectM36.DataFrame as DF
6import ProjectM36.Error
4import ProjectM36.Error
7−import ProjectM36.Tuple
8import ProjectM36.InclusionDependency
5import ProjectM36.InclusionDependency
9import qualified ProjectM36.Client as C
6import qualified ProjectM36.Client as C
7+import Text.Megaparsec
8+import Text.Megaparsec.Text
10import TutorialD.Interpreter.Base
9import TutorialD.Interpreter.Base
11import TutorialD.Interpreter.RelationalExpr
10import TutorialD.Interpreter.RelationalExpr
12import TutorialD.Interpreter.DatabaseContextExpr
11import TutorialD.Interpreter.DatabaseContextExpr
13−import TutorialD.Printer
14import Control.Monad.State
12import Control.Monad.State
15import qualified Data.Text as T
13import qualified Data.Text as T
16import ProjectM36.Relation.Show.Gnuplot
14import ProjectM36.Relation.Show.Gnuplot
@@ -22,57 +20,53 @@ data RODatabaseContextOperator where
22 ShowRelation :: RelationalExpr -> RODatabaseContextOperator
20 ShowRelation :: RelationalExpr -> RODatabaseContextOperator
23 PlotRelation :: RelationalExpr -> RODatabaseContextOperator
21 PlotRelation :: RelationalExpr -> RODatabaseContextOperator
24 ShowRelationType :: RelationalExpr -> RODatabaseContextOperator
22 ShowRelationType :: RelationalExpr -> RODatabaseContextOperator
25− ShowConstraints :: StringType -> RODatabaseContextOperator
23+ ShowConstraint :: StringType -> RODatabaseContextOperator
26 ShowPlan :: DatabaseContextExpr -> RODatabaseContextOperator
24 ShowPlan :: DatabaseContextExpr -> RODatabaseContextOperator
27 ShowTypes :: RODatabaseContextOperator
25 ShowTypes :: RODatabaseContextOperator
28 ShowRelationVariables :: RODatabaseContextOperator
26 ShowRelationVariables :: RODatabaseContextOperator
29− ShowAtomFunctions :: RODatabaseContextOperator
30− ShowDatabaseContextFunctions :: RODatabaseContextOperator
31− ShowDataFrame :: DF.DataFrameExpr -> RODatabaseContextOperator
32 Quit :: RODatabaseContextOperator
27 Quit :: RODatabaseContextOperator
33 deriving (Show)
28 deriving (Show)
34
29
35typeP :: Parser RODatabaseContextOperator
30typeP :: Parser RODatabaseContextOperator
36typeP = do
31typeP = do
37− colonOp ":type"
32+ reservedOp ":type"
38− ShowRelationType <$> relExprP
33+ expr <- relExprP
34+ return $ ShowRelationType expr
39
35
40showRelP :: Parser RODatabaseContextOperator
36showRelP :: Parser RODatabaseContextOperator
41showRelP = do
37showRelP = do
42− colonOp ":showexpr"
38+ reservedOp ":showexpr"
43− ShowRelation <$> relExprP
39+ expr <- relExprP
40+ return $ ShowRelation expr
44
41
45showPlanP :: Parser RODatabaseContextOperator
42showPlanP :: Parser RODatabaseContextOperator
46showPlanP = do
43showPlanP = do
47− colonOp ":showplan"
44+ reservedOp ":showplan"
48− ShowPlan <$> databaseContextExprP
45+ expr <- databaseContextExprP
46+ return $ ShowPlan expr
49
47
50showTypesP :: Parser RODatabaseContextOperator
48showTypesP :: Parser RODatabaseContextOperator
51−showTypesP = colonOp ":showtypes" >> pure ShowTypes
49+showTypesP = reserved ":showtypes" >> pure ShowTypes
52
50
53showRelationVariables :: Parser RODatabaseContextOperator
51showRelationVariables :: Parser RODatabaseContextOperator
54−showRelationVariables = colonOp ":showrelvars" >> pure ShowRelationVariables
52+showRelationVariables = reserved ":showrelvars" >> pure ShowRelationVariables
55−
56−showAtomFunctionsP :: Parser RODatabaseContextOperator
57−showAtomFunctionsP = colonOp ":showatomfunctions" >> pure ShowAtomFunctions
58−
59−showDatabaseContextFunctionsP :: Parser RODatabaseContextOperator
60−showDatabaseContextFunctionsP = colonOp ":showdatabasecontextfunctions" >> pure ShowDatabaseContextFunctions
61
53
62quitP :: Parser RODatabaseContextOperator
54quitP :: Parser RODatabaseContextOperator
63quitP = do
55quitP = do
64− colonOp ":quit"
56+ reservedOp ":quit"
65 return Quit
57 return Quit
66
58
67showConstraintsP :: Parser RODatabaseContextOperator
59showConstraintsP :: Parser RODatabaseContextOperator
68showConstraintsP = do
60showConstraintsP = do
69− colonOp ":constraints"
61+ reservedOp ":constraints"
70− ShowConstraints <$> option "" identifier
62+ constraintName <- option "" identifier
63+ return $ ShowConstraint constraintName
71
64
72plotRelExprP :: Parser RODatabaseContextOperator
65plotRelExprP :: Parser RODatabaseContextOperator
73plotRelExprP = do
66plotRelExprP = do
74− colonOp ":plotexpr"
67+ reserved ":plotexpr"
75− PlotRelation <$> relExprP
68+ expr <- relExprP
69+ return $ PlotRelation expr
76
70
77roDatabaseContextOperatorP :: Parser RODatabaseContextOperator
71roDatabaseContextOperatorP :: Parser RODatabaseContextOperator
78roDatabaseContextOperatorP = typeP
72roDatabaseContextOperatorP = typeP
@@ -82,9 +76,6 @@ roDatabaseContextOperatorP = typeP
82 <|> showConstraintsP
76 <|> showConstraintsP
83 <|> showPlanP
77 <|> showPlanP
84 <|> showTypesP
78 <|> showTypesP
85− <|> showAtomFunctionsP
86− <|> showDatabaseContextFunctionsP
87− <|> showDataFrameP
88 <|> quitP
79 <|> quitP
89
80
90--logically, these read-only operations could happen purely, but not if a remote call is required
81--logically, these read-only operations could happen purely, but not if a remote call is required
@@ -109,16 +100,15 @@ evalRODatabaseContextOp sessionId conn (PlotRelation expr) = do
109 err <- plotRelation rel
100 err <- plotRelation rel
110 when (isJust err) $ print err
101 when (isJust err) $ print err
111
102
112−evalRODatabaseContextOp sessionId conn (ShowConstraints name) = do
103+evalRODatabaseContextOp sessionId conn (ShowConstraint name) = do
113 eIncDeps <- C.inclusionDependencies sessionId conn
104 eIncDeps <- C.inclusionDependencies sessionId conn
114 let val = case eIncDeps of
105 let val = case eIncDeps of
115 Left err -> Left err
106 Left err -> Left err
116 Right incDeps -> case name of
107 Right incDeps -> case name of
117− "" -> inclusionDependenciesAsRelation incDeps >>= renderRelExprsInIncDeps
108+ "" -> inclusionDependenciesAsRelation incDeps
118 depName -> case M.lookup depName incDeps of
109 depName -> case M.lookup depName incDeps of
119 Nothing -> Left (InclusionDependencyNameNotInUseError depName)
110 Nothing -> Left (InclusionDependencyNameNotInUseError depName)
120− Just dep ->
121− inclusionDependenciesAsRelation (M.singleton depName dep) >>= renderRelExprsInIncDeps
111+ Just dep -> inclusionDependenciesAsRelation (M.singleton depName dep)
122 pure $ case val of
112 pure $ case val of
123 Left err -> DisplayErrorResult (T.pack (show err))
113 Left err -> DisplayErrorResult (T.pack (show err))
124 Right rel -> DisplayRelationResult rel
114 Right rel -> DisplayRelationResult rel
@@ -140,25 +130,7 @@ evalRODatabaseContextOp sessionId conn ShowRelationVariables = do
140 case eRel of
130 case eRel of
141 Left err -> pure $ DisplayErrorResult (T.pack (show err))
131 Left err -> pure $ DisplayErrorResult (T.pack (show err))
142 Right rel -> evalRODatabaseContextOp sessionId conn (ShowRelation (ExistingRelation rel))
132 Right rel -> evalRODatabaseContextOp sessionId conn (ShowRelation (ExistingRelation rel))
143−
144−evalRODatabaseContextOp sessionId conn ShowAtomFunctions = do
145− eRel <- C.atomFunctionsAsRelation sessionId conn
146− case eRel of
147− Left err -> pure $ DisplayErrorResult (T.pack (show err))
148− Right rel -> evalRODatabaseContextOp sessionId conn (ShowRelation (ExistingRelation rel))
149−
150−evalRODatabaseContextOp sessionId conn ShowDatabaseContextFunctions = do
151− eRel <- C.databaseContextFunctionsAsRelation sessionId conn
152− case eRel of
153− Left err -> pure $ DisplayErrorResult (T.pack (show err))
154− Right rel -> evalRODatabaseContextOp sessionId conn (ShowRelation (ExistingRelation rel))
155
133
156−evalRODatabaseContextOp sessionId conn (ShowDataFrame dfExpr) = do
157− eDataFrame <- C.executeDataFrameExpr sessionId conn dfExpr
158− case eDataFrame of
159− Left err -> pure (DisplayErrorResult (T.pack (show err)))
160− Right dframe -> pure (DisplayDataFrameResult dframe)
161−
162evalRODatabaseContextOp _ _ Quit = pure QuitResult
134evalRODatabaseContextOp _ _ Quit = pure QuitResult
163
135
164interpretRODatabaseContextOp :: C.SessionId -> C.Connection -> T.Text -> IO TutorialDOperatorResult
136interpretRODatabaseContextOp :: C.SessionId -> C.Connection -> T.Text -> IO TutorialDOperatorResult
@@ -166,45 +138,4 @@ interpretRODatabaseContextOp sessionId conn tutdstring = case parse roDatabaseCo
166 Left err -> pure $ DisplayErrorResult (T.pack (show err))
138 Left err -> pure $ DisplayErrorResult (T.pack (show err))
167 Right parsed -> evalRODatabaseContextOp sessionId conn parsed
139 Right parsed -> evalRODatabaseContextOp sessionId conn parsed
168
140
169−showDataFrameP :: Parser RODatabaseContextOperator
141+
170−showDataFrameP = do
171− colonOp ":showdataframe"
172− relExpr <- relExprP
173− reservedOp "orderby"
174− attrOrdersExpr <- attrOrdersExprP
175− mbOffset <- optional offsetP
176− mbLimit <- optional limitP
177− pure $ ShowDataFrame (DF.DataFrameExpr relExpr attrOrdersExpr mbOffset mbLimit)
178−
179−
180−offsetP :: Parser Integer
181−offsetP = do
182− reservedOp "offset"
183− natural
184−
185−limitP :: Parser Integer
186−limitP = do
187− reservedOp "limit"
188− natural
189−
190−attrOrdersExprP :: Parser [DF.AttributeOrderExpr]
191−attrOrdersExprP = braces (sepBy attrOrderExprP comma)
192−
193−attrOrderExprP :: Parser DF.AttributeOrderExpr
194−attrOrderExprP = DF.AttributeOrderExpr <$> identifier <*> orderP
195−
196−orderP :: Parser DF.Order
197−orderP = try (reservedOp "ascending" >> pure DF.AscendingOrder) <|> try (reservedOp "descending" >> pure DF.DescendingOrder) <|> pure DF.AscendingOrder
198−
199−-- render RelationalExprAtoms as TutorialD
200−renderRelExprsInIncDeps :: Relation -> Either RelationalError Relation
201−renderRelExprsInIncDeps = relMogrify tupMapper attrs
202− where
203− tupMapper tup = pure $ mkRelationTupleFromMap (M.map mapper (tupleToMap tup))
204− mapper (RelationalExprAtom expr) = TextAtom (T.pack (show (prettyRelationalExpr expr)))
205− mapper atom = atom
206− attrs = C.attributesFromList [Attribute "name" TextAtomType,
207− Attribute "sub" TextAtomType,
208− Attribute "super" TextAtomType
209− ]
210−
src/bin/TutorialD/Interpreter/RelationalExpr.hs+71−94
@@ -1,12 +1,8 @@
1−{-# LANGUAGE CPP #-}
2module TutorialD.Interpreter.RelationalExpr where
1module TutorialD.Interpreter.RelationalExpr where
3import Text.Megaparsec
2import Text.Megaparsec
4−#if MIN_VERSION_megaparsec(7,0,0)
5−import Control.Monad.Combinators.Expr
6−#else
7import Text.Megaparsec.Expr
3import Text.Megaparsec.Expr
8−#endif
9import ProjectM36.Base
4import ProjectM36.Base
5+import Text.Megaparsec.Text
10import TutorialD.Interpreter.Base
6import TutorialD.Interpreter.Base
11import TutorialD.Interpreter.Types
7import TutorialD.Interpreter.Types
12import qualified Data.Text as T
8import qualified Data.Text as T
@@ -15,38 +11,40 @@ import qualified Data.Map as M
15import Data.List (sort)
11import Data.List (sort)
16import ProjectM36.MiscUtils
12import ProjectM36.MiscUtils
17
13
14+class RelationalMarkerExpr a where
15+ parseMarkerP :: Parser a
16+
17+instance RelationalMarkerExpr () where
18+ parseMarkerP = pure ()
19+
18--used in projection
20--used in projection
19attributeListP :: RelationalMarkerExpr a => Parser (AttributeNamesBase a)
21attributeListP :: RelationalMarkerExpr a => Parser (AttributeNamesBase a)
20−attributeListP =
22+attributeListP =
21 (reservedOp "all but" >>
23 (reservedOp "all but" >>
22− InvertedAttributeNames . S.fromList <$> sepBy attributeNameP comma) <|>
24+ InvertedAttributeNames . S.fromList <$> sepBy identifier comma) <|>
23−
24 (reservedOp "all from" >>
25 (reservedOp "all from" >>
25 RelationalExprAttributeNames <$> relExprP) <|>
26 RelationalExprAttributeNames <$> relExprP) <|>
26−
27− (reservedOp "union of" >>
28− UnionAttributeNames <$> braces attributeListP <*> braces attributeListP) <|>
29−
30− (reservedOp "intersection of" >>
31− IntersectAttributeNames <$> braces attributeListP <*> braces attributeListP) <|>
32−
33− (AttributeNames . S.fromList <$> sepBy attributeNameP comma)
27+ (AttributeNames . S.fromList <$> sepBy identifier comma)
34−
35
28
36makeRelationP :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
29makeRelationP :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
37makeRelationP = do
30makeRelationP = do
38 reserved "relation"
31 reserved "relation"
39 attrExprs <- try (fmap Just makeAttributeExprsP) <|> pure Nothing
32 attrExprs <- try (fmap Just makeAttributeExprsP) <|> pure Nothing
40 tupleExprs <- braces (sepBy tupleExprP comma) <|> pure []
33 tupleExprs <- braces (sepBy tupleExprP comma) <|> pure []
41− marker <- parseMarkerP
42− pure $ MakeRelationFromExprs attrExprs (TupleExprs marker tupleExprs)
34+ pure $ MakeRelationFromExprs attrExprs tupleExprs
43
35
36+--used in relation creation
37+makeAttributeExprsP :: RelationalMarkerExpr a => Parser [AttributeExprBase a]
38+makeAttributeExprsP = braces (sepBy attributeAndTypeNameP comma)
44
39
40+attributeAndTypeNameP :: RelationalMarkerExpr a => Parser (AttributeExprBase a)
41+attributeAndTypeNameP = AttributeAndTypeNameExpr <$> identifier <*> typeConstructorP <*> parseMarkerP
42+
45--abstract data type parser- in this context, the type constructor must not include any type arguments
43--abstract data type parser- in this context, the type constructor must not include any type arguments
46--Either Text Int
44--Either Text Int
47adTypeConstructorP :: Parser TypeConstructor
45adTypeConstructorP :: Parser TypeConstructor
48adTypeConstructorP = do
46adTypeConstructorP = do
49− tConsName <- typeConstructorNameP
47+ tConsName <- capitalizedIdentifier
50 tConsArgs <- many typeConstructorP
48 tConsArgs <- many typeConstructorP
51 pure $ ADTypeConstructor tConsName tConsArgs
49 pure $ ADTypeConstructor tConsName tConsArgs
52
50
@@ -56,25 +54,27 @@ tupleExprP = do
56 attrAssocs <- braces (sepBy tupleAtomExprP comma)
54 attrAssocs <- braces (sepBy tupleAtomExprP comma)
57 --detect duplicate attribute names
55 --detect duplicate attribute names
58 let dupAttrNames = dupes (sort (map fst attrAssocs))
56 let dupAttrNames = dupes (sort (map fst attrAssocs))
59− if not (null dupAttrNames) then
57+ if not (null dupAttrNames) then
60 fail ("Attribute names duplicated: " ++ show dupAttrNames)
58 fail ("Attribute names duplicated: " ++ show dupAttrNames)
61 else
59 else
62 pure (TupleExpr (M.fromList attrAssocs))
60 pure (TupleExpr (M.fromList attrAssocs))
63
61
64tupleAtomExprP :: RelationalMarkerExpr a => Parser (AttributeName, AtomExprBase a)
62tupleAtomExprP :: RelationalMarkerExpr a => Parser (AttributeName, AtomExprBase a)
65tupleAtomExprP = do
63tupleAtomExprP = do
66− attributeName <- attributeNameP
64+ attributeName <- identifier
67 atomExpr <- atomExprP
65 atomExpr <- atomExprP
68 pure (attributeName, atomExpr)
66 pure (attributeName, atomExpr)
69−
67+
70projectP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
68projectP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
69+projectP = do
71−projectP = Project <$> braces attributeListP
70+ attrs <- braces attributeListP
71+ pure $ Project attrs
72
72
73renameClauseP :: Parser (T.Text, T.Text)
73renameClauseP :: Parser (T.Text, T.Text)
74renameClauseP = do
74renameClauseP = do
75− oldAttr <- attributeNameP
75+ oldAttr <- identifier
76 reservedOp "as"
76 reservedOp "as"
77− newAttr <- attributeNameP
77+ newAttr <- identifier
78 pure (oldAttr, newAttr)
78 pure (oldAttr, newAttr)
79
79
80renameP :: Parser (RelationalExprBase a -> RelationalExprBase a)
80renameP :: Parser (RelationalExprBase a -> RelationalExprBase a)
@@ -83,7 +83,7 @@ renameP = do
83 renameList <- braces (sepBy renameClauseP comma)
83 renameList <- braces (sepBy renameClauseP comma)
84 case renameList of
84 case renameList of
85 [] -> pure (Restrict TruePredicate) --no-op when rename list is empty
85 [] -> pure (Restrict TruePredicate) --no-op when rename list is empty
86− renames ->
86+ renames ->
87 pure $ \expr -> foldl (\acc (oldAttr, newAttr) -> Rename oldAttr newAttr acc) expr renames
87 pure $ \expr -> foldl (\acc (oldAttr, newAttr) -> Rename oldAttr newAttr acc) expr renames
88
88
89whereClauseP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
89whereClauseP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
@@ -93,7 +93,7 @@ groupClauseP :: RelationalMarkerExpr a => Parser (AttributeNamesBase a, T.Text)
93groupClauseP = do
93groupClauseP = do
94 attrs <- braces attributeListP
94 attrs <- braces attributeListP
95 reservedOp "as"
95 reservedOp "as"
96− newAttrName <- attributeNameP
96+ newAttrName <- identifier
97 pure (attrs, newAttrName)
97 pure (attrs, newAttrName)
98
98
99groupP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
99groupP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
@@ -106,30 +106,28 @@ groupP = do
106ungroupP :: Parser (RelationalExprBase a -> RelationalExprBase a)
106ungroupP :: Parser (RelationalExprBase a -> RelationalExprBase a)
107ungroupP = do
107ungroupP = do
108 reservedOp "ungroup"
108 reservedOp "ungroup"
109− Ungroup <$> attributeNameP
109+ rvaAttrName <- identifier
110+ pure $ Ungroup rvaAttrName
110
111
111extendP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
112extendP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
112extendP = do
113extendP = do
113 reservedOp ":"
114 reservedOp ":"
114− extends <- braces (sepBy extendTupleExpressionP comma)
115+ tupleExpr <- braces extendTupleExpressionP
115− case extends of
116+ return $ Extend tupleExpr
116− [] -> pure (Restrict TruePredicate)
117+
117− extends' ->
118− pure $ \expr -> foldl (flip Extend) expr extends'
119−
120semijoinP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a -> RelationalExprBase a)
118semijoinP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a -> RelationalExprBase a)
121semijoinP = do
119semijoinP = do
122 reservedOp "semijoin" <|> reservedOp "matching"
120 reservedOp "semijoin" <|> reservedOp "matching"
123− pure (\exprA exprB ->
121+ pure (\exprA exprB ->
124 Project (RelationalExprAttributeNames exprA) (Join exprA exprB))
122 Project (RelationalExprAttributeNames exprA) (Join exprA exprB))
125−
123+
126−antijoinP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a -> RelationalExprBase a)
124+antijoinP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a -> RelationalExprBase a)
127antijoinP = do
125antijoinP = do
128 reservedOp "not matching" <|> reservedOp "antijoin"
126 reservedOp "not matching" <|> reservedOp "antijoin"
129 pure (\exprA exprB ->
127 pure (\exprA exprB ->
130 Difference exprA (
128 Difference exprA (
131 Project (RelationalExprAttributeNames exprA) (Join exprA exprB)))
129 Project (RelationalExprAttributeNames exprA) (Join exprA exprB)))
132−
130+
133relOperators :: RelationalMarkerExpr a => [[Operator Parser (RelationalExprBase a)]]
131relOperators :: RelationalMarkerExpr a => [[Operator Parser (RelationalExprBase a)]]
134relOperators = [
132relOperators = [
135 [Postfix projectP],
133 [Postfix projectP],
@@ -142,23 +140,15 @@ relOperators = [
142 [InfixL antijoinP],
140 [InfixL antijoinP],
143 [InfixL (reservedOp "union" >> return Union)],
141 [InfixL (reservedOp "union" >> return Union)],
144 [InfixL (reservedOp "minus" >> return Difference)],
142 [InfixL (reservedOp "minus" >> return Difference)],
145− [InfixN (reservedOp "=" >> return Equals),
143+ [InfixN (reservedOp "=" >> return Equals)],
146− InfixN (reservedOp "/=" >> return NotEquals)],
147 [Postfix extendP]
144 [Postfix extendP]
148 ]
145 ]
149
146
150relExprP :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
147relExprP :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
151−relExprP = try withMacroExprP <|> makeExprParser relTerm relOperators
148+relExprP = makeExprParser relTerm relOperators
152−
153−--allow for additional characters
154−attributeNameP :: Parser AttributeName
155−attributeNameP = uncapitalizedIdentifier
156−
157−relVarNameP :: Parser RelVarName
158−relVarNameP = uncapitalizedIdentifier
159
149
160relVarP :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
150relVarP :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
161−relVarP = RelationVariable <$> relVarNameP <*> parseMarkerP
151+relVarP = RelationVariable <$> identifier <*> parseMarkerP
162
152
163relTerm :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
153relTerm :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
164relTerm = parens relExprP
154relTerm = parens relExprP
@@ -179,15 +169,17 @@ restrictionPredicateP = makeExprParser predicateTerm predicateOperators
179 <|> relationalBooleanExprP
169 <|> relationalBooleanExprP
180
170
181relationalBooleanExprP :: RelationalMarkerExpr a => Parser (RestrictionPredicateExprBase a)
171relationalBooleanExprP :: RelationalMarkerExpr a => Parser (RestrictionPredicateExprBase a)
182−relationalBooleanExprP =
172+relationalBooleanExprP = do
173+ relexpr <- parens relExprP <|> relTerm
183 --we can't actually detect if the type is relational boolean, so we just pass it to the next phase
174 --we can't actually detect if the type is relational boolean, so we just pass it to the next phase
184− RelationalExprPredicate <$> (parens relExprP <|> relTerm)
175+ return $ RelationalExprPredicate relexpr
185−
176+
186restrictionAttributeEqualityP :: RelationalMarkerExpr a => Parser (RestrictionPredicateExprBase a)
177restrictionAttributeEqualityP :: RelationalMarkerExpr a => Parser (RestrictionPredicateExprBase a)
187restrictionAttributeEqualityP = do
178restrictionAttributeEqualityP = do
188− attributeName <- attributeNameP
179+ attributeName <- identifier
189 reservedOp "="
180 reservedOp "="
181+ atomexpr <- atomExprP
190− AttributeEqualityPredicate attributeName <$> atomExprP
182+ return $ AttributeEqualityPredicate attributeName atomexpr
191
183
192restrictionAtomExprP :: RelationalMarkerExpr a=> Parser (RestrictionPredicateExprBase a) --atoms which are of type "boolean"
184restrictionAtomExprP :: RelationalMarkerExpr a=> Parser (RestrictionPredicateExprBase a) --atoms which are of type "boolean"
193restrictionAtomExprP = do
185restrictionAtomExprP = do
@@ -202,9 +194,10 @@ extendTupleExpressionP = attributeExtendTupleExpressionP
202
194
203attributeExtendTupleExpressionP :: RelationalMarkerExpr a => Parser (ExtendTupleExprBase a)
195attributeExtendTupleExpressionP :: RelationalMarkerExpr a => Parser (ExtendTupleExprBase a)
204attributeExtendTupleExpressionP = do
196attributeExtendTupleExpressionP = do
205− newAttr <- attributeNameP
197+ newAttr <- identifier
206 reservedOp ":="
198 reservedOp ":="
199+ atom <- atomExprP
207− AttributeExtendTupleExpr newAttr <$> atomExprP
200+ return $ AttributeExtendTupleExpr newAttr atom
208
201
209atomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
202atomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
210atomExprP = consumeAtomExprP True
203atomExprP = consumeAtomExprP True
@@ -214,34 +207,38 @@ consumeAtomExprP consume = try functionAtomExprP <|>
214 try (parens (constructedAtomExprP True)) <|>
207 try (parens (constructedAtomExprP True)) <|>
215 constructedAtomExprP consume <|>
208 constructedAtomExprP consume <|>
216 attributeAtomExprP <|>
209 attributeAtomExprP <|>
217− try nakedAtomExprP <|>
210+ nakedAtomExprP <|>
218 relationalAtomExprP
211 relationalAtomExprP
219−
220
212
221attributeAtomExprP :: Parser (AtomExprBase a)
213attributeAtomExprP :: Parser (AtomExprBase a)
222attributeAtomExprP = do
214attributeAtomExprP = do
223 _ <- string "@"
215 _ <- string "@"
216+ attrName <- identifier
224− AttributeAtomExpr <$> attributeNameP
217+ return $ AttributeAtomExpr attrName
225
218
226nakedAtomExprP :: Parser (AtomExprBase a)
219nakedAtomExprP :: Parser (AtomExprBase a)
227nakedAtomExprP = NakedAtomExpr <$> atomP
220nakedAtomExprP = NakedAtomExpr <$> atomP
228
221
229constructedAtomExprP :: RelationalMarkerExpr a => Bool -> Parser (AtomExprBase a)
222constructedAtomExprP :: RelationalMarkerExpr a => Bool -> Parser (AtomExprBase a)
230constructedAtomExprP consume = do
223constructedAtomExprP consume = do
231− dConsName <- dataConstructorNameP
224+ dConsName <- capitalizedIdentifier
232 dConsArgs <- if consume then sepBy (consumeAtomExprP False) spaceConsumer else pure []
225 dConsArgs <- if consume then sepBy (consumeAtomExprP False) spaceConsumer else pure []
226+ marker <- parseMarkerP
233− ConstructedAtomExpr dConsName dConsArgs <$> parseMarkerP
227+ pure $ ConstructedAtomExpr dConsName dConsArgs marker
234−
228+
235-- used only for primitive type parsing ?
229-- used only for primitive type parsing ?
236atomP :: Parser Atom
230atomP :: Parser Atom
237−atomP = stringAtomP <|>
231+atomP = stringAtomP <|>
238− try doubleAtomP <|>
232+ doubleAtomP <|>
239− integerAtomP <|>
233+ integerAtomP <|>
240 boolAtomP
234 boolAtomP
241−
235+
242functionAtomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
236functionAtomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
243−functionAtomExprP =
237+functionAtomExprP = do
238+ funcName <- identifier
244− FunctionAtomExpr <$> uncapitalizedIdentifier <*> parens (sepBy atomExprP comma) <*> parseMarkerP
239+ argList <- parens (sepBy atomExprP comma)
240+ marker <- parseMarkerP
241+ return $ FunctionAtomExpr funcName argList marker
245
242
246relationalAtomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
243relationalAtomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
247relationalAtomExprP = RelationAtomExpr <$> relExprP
244relationalAtomExprP = RelationAtomExpr <$> relExprP
@@ -249,36 +246,16 @@ relationalAtomExprP = RelationAtomExpr <$> relExprP
249stringAtomP :: Parser Atom
246stringAtomP :: Parser Atom
250stringAtomP = TextAtom <$> quotedString
247stringAtomP = TextAtom <$> quotedString
251
248
252−doubleAtomP :: Parser Atom
249+doubleAtomP :: Parser Atom
253−doubleAtomP = DoubleAtom <$> float
250+doubleAtomP = DoubleAtom <$> try float
254
251
255integerAtomP :: Parser Atom
252integerAtomP :: Parser Atom
256integerAtomP = IntegerAtom <$> integer
253integerAtomP = IntegerAtom <$> integer
257
254
258boolAtomP :: Parser Atom
255boolAtomP :: Parser Atom
259boolAtomP = do
256boolAtomP = do
260− v <- identifier
257+ val <- char 't' <|> char 'f'
261− if v == "t" || v == "f" then
262− pure $ BoolAtom (v == "t")
258+ return $ BoolAtom (val == 't')
263− else
259+
264− fail "invalid boolAtom"
265−
266−
267relationAtomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
260relationAtomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
268relationAtomExprP = RelationAtomExpr <$> makeRelationP
261relationAtomExprP = RelationAtomExpr <$> makeRelationP
269−
270−withMacroExprP :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
271−withMacroExprP = do
272− reservedOp "with"
273− views <- parens (sepBy1 createMacroP comma)
274− With views <$> relExprP
275−
276−createMacroP :: RelationalMarkerExpr a => Parser (WithNameExprBase a, RelationalExprBase a)
277−createMacroP = do
278− name <- identifier
279− reservedOp "as"
280− expr <- relExprP
281− marker <- parseMarkerP
282− pure (WithNameExpr name marker, expr)
283−
284−
src/bin/TutorialD/Interpreter/SchemaOperator.hs+5−3
@@ -1,5 +1,7 @@
1module TutorialD.Interpreter.SchemaOperator where
1module TutorialD.Interpreter.SchemaOperator where
2import Text.Megaparsec
2import Text.Megaparsec
3+import Text.Megaparsec.Text
4+
3import ProjectM36.Base
5import ProjectM36.Base
4import ProjectM36.IsomorphicSchema
6import ProjectM36.IsomorphicSchema
5import ProjectM36.Session
7import ProjectM36.Session
@@ -42,7 +44,7 @@ isoRestrictP = do
42 reserved "isorestrict"
44 reserved "isorestrict"
43 relVarIn <- qrelVarP
45 relVarIn <- qrelVarP
44 relvarsOut <- isoRestrictOutRelVarsP
46 relvarsOut <- isoRestrictOutRelVarsP
45− IsoRestrict relVarIn <$> restrictionPredicateP <*> pure relvarsOut
47+ IsoRestrict <$> pure relVarIn <*> restrictionPredicateP <*> pure relvarsOut
46
48
47isoRestrictOutRelVarsP :: Parser (RelVarName, RelVarName)
49isoRestrictOutRelVarsP :: Parser (RelVarName, RelVarName)
48isoRestrictOutRelVarsP = (,) <$> qrelVarP <*> qrelVarP
50isoRestrictOutRelVarsP = (,) <$> qrelVarP <*> qrelVarP
@@ -55,7 +57,7 @@ isoUnionP = do
55 reserved "isounion"
57 reserved "isounion"
56 relVarsIn <- isoUnionInRelVarsP
58 relVarsIn <- isoUnionInRelVarsP
57 relVarsOut <- qrelVarP
59 relVarsOut <- qrelVarP
58− IsoUnion relVarsIn <$> restrictionPredicateP <*> pure relVarsOut
60+ IsoUnion <$> pure relVarsIn <*> restrictionPredicateP <*> pure relVarsOut
59
61
60isoRenameP :: Parser SchemaIsomorph
62isoRenameP :: Parser SchemaIsomorph
61isoRenameP = do
63isoRenameP = do
@@ -74,4 +76,4 @@ isoUnionInRelVarsP = (,) <$> qrelVarP <*> qrelVarP
74evalSchemaOperator :: SessionId -> Connection -> SchemaOperator -> IO (Either RelationalError ())
76evalSchemaOperator :: SessionId -> Connection -> SchemaOperator -> IO (Either RelationalError ())
75evalSchemaOperator sessionId conn (ModifySchemaExpr expr) = executeSchemaExpr sessionId conn expr
77evalSchemaOperator sessionId conn (ModifySchemaExpr expr) = executeSchemaExpr sessionId conn expr
76evalSchemaOperator sessionId conn (SetCurrentSchema sname) = setCurrentSchemaName sessionId conn sname
78evalSchemaOperator sessionId conn (SetCurrentSchema sname) = setCurrentSchemaName sessionId conn sname
77−
79+
src/bin/TutorialD/Interpreter/TransGraphRelationalOperator.hs+9−5
@@ -1,19 +1,21 @@
1−{-# LANGUAGE FlexibleInstances #-}
1+{-# LANGUAGE TypeSynonymInstances, FlexibleInstances #-}
2{-# OPTIONS_GHC -fno-warn-orphans #-}
2{-# OPTIONS_GHC -fno-warn-orphans #-}
3module TutorialD.Interpreter.TransGraphRelationalOperator where
3module TutorialD.Interpreter.TransGraphRelationalOperator where
4import ProjectM36.TransGraphRelationalExpression
4import ProjectM36.TransGraphRelationalExpression
5import ProjectM36.TransactionGraph
5import ProjectM36.TransactionGraph
6−import TutorialD.Interpreter.Types
7import qualified ProjectM36.Client as C
6import qualified ProjectM36.Client as C
8
7
9import TutorialD.Interpreter.Base
8import TutorialD.Interpreter.Base
10import TutorialD.Interpreter.RelationalExpr
9import TutorialD.Interpreter.RelationalExpr
11
10
11+import Text.Megaparsec
12+import Text.Megaparsec.Text
13+
12import qualified Data.Text as T
14import qualified Data.Text as T
13
15
14instance RelationalMarkerExpr TransactionIdLookup where
16instance RelationalMarkerExpr TransactionIdLookup where
15 parseMarkerP = string "@" *> transactionIdLookupP
17 parseMarkerP = string "@" *> transactionIdLookupP
16−
18+
17newtype TransGraphRelationalOperator = ShowTransGraphRelation TransGraphRelationalExpr
19newtype TransGraphRelationalOperator = ShowTransGraphRelation TransGraphRelationalExpr
18 deriving Show
20 deriving Show
19
21
@@ -27,7 +29,9 @@ transactionIdHeadBacktrackP = (string "~" *> (TransactionIdHeadParentBacktrack <
27 (string "@" *> (TransactionStampHeadBacktrack <$> utcTimeP))
29 (string "@" *> (TransactionStampHeadBacktrack <$> utcTimeP))
28
30
29backtrackP :: Parser Int
31backtrackP :: Parser Int
32+backtrackP = do
30−backtrackP = fromIntegral <$> integer <|> pure 1
33+ steps <- integer <|> pure 1
34+ pure (fromIntegral steps)
31
35
32transGraphRelationalOpP :: Parser TransGraphRelationalOperator
36transGraphRelationalOpP :: Parser TransGraphRelationalOperator
33transGraphRelationalOpP = showTransGraphRelationalOpP
37transGraphRelationalOpP = showTransGraphRelationalOpP
@@ -43,4 +47,4 @@ evalTransGraphRelationalOp sessionId conn (ShowTransGraphRelation expr) = do
43 case res of
47 case res of
44 Left err -> pure $ DisplayErrorResult $ T.pack (show err)
48 Left err -> pure $ DisplayErrorResult $ T.pack (show err)
45 Right rel -> pure $ DisplayRelationResult rel
49 Right rel -> pure $ DisplayRelationResult rel
46−
50+
src/bin/TutorialD/Interpreter/TransactionGraphOperator.hs+19−18
@@ -1,10 +1,11 @@
1{-# LANGUAGE GADTs #-}
1{-# LANGUAGE GADTs #-}
2module TutorialD.Interpreter.TransactionGraphOperator where
2module TutorialD.Interpreter.TransactionGraphOperator where
3import TutorialD.Interpreter.Base
3import TutorialD.Interpreter.Base
4+import Text.Megaparsec.Text
5+import Text.Megaparsec
4import ProjectM36.TransactionGraph hiding (autoMergeToHead)
6import ProjectM36.TransactionGraph hiding (autoMergeToHead)
5−import ProjectM36.Client as C
7+import ProjectM36.Client
6import ProjectM36.Base
8import ProjectM36.Base
7−import ProjectM36.Relation (relationTrue)
8import Data.Functor
9import Data.Functor
9
10
10data ConvenienceTransactionGraphOperator = AutoMergeToHead MergeStrategy HeadName
11data ConvenienceTransactionGraphOperator = AutoMergeToHead MergeStrategy HeadName
@@ -21,12 +22,14 @@ autoMergeToHeadP = do
21jumpToHeadP :: Parser TransactionGraphOperator
22jumpToHeadP :: Parser TransactionGraphOperator
22jumpToHeadP = do
23jumpToHeadP = do
23 reservedOp ":jumphead"
24 reservedOp ":jumphead"
25+ headid <- identifier
24− JumpToHead <$> identifier
26+ return $ JumpToHead headid
25
27
26jumpToTransactionP :: Parser TransactionGraphOperator
28jumpToTransactionP :: Parser TransactionGraphOperator
27jumpToTransactionP = do
29jumpToTransactionP = do
28 reservedOp ":jump"
30 reservedOp ":jump"
31+ uuid <- uuidP
29− JumpToTransaction <$> uuidP
32+ return $ JumpToTransaction uuid
30
33
31walkBackToTimeP :: Parser TransactionGraphOperator
34walkBackToTimeP :: Parser TransactionGraphOperator
32walkBackToTimeP = do
35walkBackToTimeP = do
@@ -36,7 +39,8 @@ walkBackToTimeP = do
36branchTransactionP :: Parser TransactionGraphOperator
39branchTransactionP :: Parser TransactionGraphOperator
37branchTransactionP = do
40branchTransactionP = do
38 reservedOp ":branch"
41 reservedOp ":branch"
39− Branch <$> identifier
42+ branchName <- identifier
43+ return $ Branch branchName
40
44
41deleteBranchP :: Parser TransactionGraphOperator
45deleteBranchP :: Parser TransactionGraphOperator
42deleteBranchP = do
46deleteBranchP = do
@@ -62,18 +66,20 @@ mergeTransactionStrategyP :: Parser MergeStrategy
62mergeTransactionStrategyP = (reserved "union" $> UnionMergeStrategy) <|>
66mergeTransactionStrategyP = (reserved "union" $> UnionMergeStrategy) <|>
63 (do
67 (do
64 reserved "selectedbranch"
68 reserved "selectedbranch"
65− SelectedBranchMergeStrategy <$> identifier) <|>
69+ branch <- identifier
70+ pure (SelectedBranchMergeStrategy branch)) <|>
66 (do
71 (do
67 reserved "unionpreferbranch"
72 reserved "unionpreferbranch"
68− UnionPreferMergeStrategy <$> identifier)
73+ branch <- identifier
74+ pure (UnionPreferMergeStrategy branch))
69
75
70mergeTransactionsP :: Parser TransactionGraphOperator
76mergeTransactionsP :: Parser TransactionGraphOperator
71mergeTransactionsP = do
77mergeTransactionsP = do
72 reservedOp ":mergetrans"
78 reservedOp ":mergetrans"
73− MergeTransactions <$> mergeTransactionStrategyP <*> identifier <*> identifier
79+ strategy <- mergeTransactionStrategyP
74−
80+ headA <- identifier
75−validateMerkleHashesP :: Parser ROTransactionGraphOperator
81+ headB <- identifier
76−validateMerkleHashesP = reservedOp ":validatemerklehashes" $> ValidateMerkleHashes
82+ pure (MergeTransactions strategy headA headB)
77
83
78transactionGraphOpP :: Parser TransactionGraphOperator
84transactionGraphOpP :: Parser TransactionGraphOperator
79transactionGraphOpP =
85transactionGraphOpP =
@@ -87,7 +93,7 @@ transactionGraphOpP =
87 <|> mergeTransactionsP
93 <|> mergeTransactionsP
88
94
89roTransactionGraphOpP :: Parser ROTransactionGraphOperator
95roTransactionGraphOpP :: Parser ROTransactionGraphOperator
90−roTransactionGraphOpP = showGraphP <|> validateMerkleHashesP
96+roTransactionGraphOpP = showGraphP
91
97
92
98
93
99
@@ -105,11 +111,6 @@ interpretOps newUUID trans@(DisconnectedTransaction _ context) transGraph instri
105
111
106evalROGraphOp :: SessionId -> Connection -> ROTransactionGraphOperator -> IO (Either RelationalError Relation)
112evalROGraphOp :: SessionId -> Connection -> ROTransactionGraphOperator -> IO (Either RelationalError Relation)
107evalROGraphOp sessionId conn ShowGraph = transactionGraphAsRelation sessionId conn
113evalROGraphOp sessionId conn ShowGraph = transactionGraphAsRelation sessionId conn
108−evalROGraphOp sessionId conn ValidateMerkleHashes = do
109− eVal <- C.validateMerkleHashes sessionId conn
110− case eVal of
111− Left err -> pure (Left err)
112− Right _ -> pure (Right relationTrue)
113
114
114evalConvenienceGraphOp :: SessionId -> Connection -> ConvenienceTransactionGraphOperator -> IO (Either RelationalError ())
115evalConvenienceGraphOp :: SessionId -> Connection -> ConvenienceTransactionGraphOperator -> IO (Either RelationalError ())
115−evalConvenienceGraphOp sessionId conn (AutoMergeToHead strat head') = autoMergeToHead sessionId conn strat head'
116+evalConvenienceGraphOp sessionId conn (AutoMergeToHead strat head') = autoMergeToHead sessionId conn strat head'
src/bin/TutorialD/Interpreter/Types.hs+21−32
@@ -1,60 +1,49 @@
1--parse type and data constructors
1--parse type and data constructors
2module TutorialD.Interpreter.Types where
2module TutorialD.Interpreter.Types where
3import ProjectM36.Base
3import ProjectM36.Base
4+import Text.Megaparsec.Text
4import Text.Megaparsec
5import Text.Megaparsec
5import TutorialD.Interpreter.Base
6import TutorialD.Interpreter.Base
6−
7+import ProjectM36.DataTypes.Primitive
7−class RelationalMarkerExpr a where
8+import qualified Data.Text as T
8− parseMarkerP :: Parser a
9−
10−instance RelationalMarkerExpr () where
11− parseMarkerP = pure ()
12−
13−typeConstructorNameP :: Parser TypeConstructorName
14−typeConstructorNameP = capitalizedIdentifier
15−
16−dataConstructorNameP :: Parser DataConstructorName
17−dataConstructorNameP = capitalizedIdentifier
18
9
19-- | Upper case names are type names while lower case names are polymorphic typeconstructor arguments.
10-- | Upper case names are type names while lower case names are polymorphic typeconstructor arguments.
20-- data *Either a b* = Left a | Right b
11-- data *Either a b* = Left a | Right b
21typeConstructorDefP :: Parser TypeConstructorDef
12typeConstructorDefP :: Parser TypeConstructorDef
22−typeConstructorDefP = ADTypeConstructorDef <$> typeConstructorNameP <*> typeVarNamesP
13+typeConstructorDefP = ADTypeConstructorDef <$> capitalizedIdentifier <*> typeVarNamesP
23
14
24typeVarNamesP :: Parser [TypeVarName]
15typeVarNamesP :: Parser [TypeVarName]
25typeVarNamesP = many uncapitalizedIdentifier
16typeVarNamesP = many uncapitalizedIdentifier
26
17
27-- data Either a b = *Left a* | *Right b*
18-- data Either a b = *Left a* | *Right b*
28dataConstructorDefP :: Parser DataConstructorDef
19dataConstructorDefP :: Parser DataConstructorDef
29−dataConstructorDefP = DataConstructorDef <$> typeConstructorNameP <*> many dataConstructorDefArgP
20+dataConstructorDefP = DataConstructorDef <$> capitalizedIdentifier <*> many dataConstructorDefArgP
30
21
31-- data *Either a b* = Left *a* | Right *b*
22-- data *Either a b* = Left *a* | Right *b*
32dataConstructorDefArgP :: Parser DataConstructorDefArg
23dataConstructorDefArgP :: Parser DataConstructorDefArg
33−dataConstructorDefArgP = DataConstructorDefTypeConstructorArg <$> (monoTypeConstructorP <|> parens typeConstructorP) <|>
24+dataConstructorDefArgP = parens (DataConstructorDefTypeConstructorArg <$> typeConstructorP) <|>
25+ DataConstructorDefTypeConstructorArg <$> typeConstructorP <|>
34 DataConstructorDefTypeVarNameArg <$> uncapitalizedIdentifier
26 DataConstructorDefTypeVarNameArg <$> uncapitalizedIdentifier
35
27
36−-- relation{a Int} in type construction (no tuples parsed)
28+--built-in, nullary type constructors
29+-- Int, Text, etc.
37−relationTypeConstructorP :: Parser TypeConstructor
30+primitiveTypeConstructorP :: Parser TypeConstructor
38−relationTypeConstructorP = do
31+primitiveTypeConstructorP = choice (map (\(PrimitiveTypeConstructorDef name typ, _) -> do
39− reserved "relation"
32+ tName <- try $ symbol (T.unpack name)
40− RelationAtomTypeConstructor <$> makeAttributeExprsP
33+ pure $ PrimitiveTypeConstructor tName typ)
41−
34+ primitiveTypeConstructorMapping)
42−--used in relation creation
43−makeAttributeExprsP :: RelationalMarkerExpr a => Parser [AttributeExprBase a]
44−makeAttributeExprsP = braces (sepBy attributeAndTypeNameP comma)
45−
46−attributeAndTypeNameP :: RelationalMarkerExpr a => Parser (AttributeExprBase a)
47−attributeAndTypeNameP = AttributeAndTypeNameExpr <$> identifier <*> typeConstructorP <*> parseMarkerP
48
35
49-- *Either Int Text*, *Int*
36-- *Either Int Text*, *Int*
50typeConstructorP :: Parser TypeConstructor
37typeConstructorP :: Parser TypeConstructor
51−typeConstructorP = relationTypeConstructorP <|>
38+typeConstructorP = primitiveTypeConstructorP <|>
39+ TypeVariable <$> uncapitalizedIdentifier <|>
52− ADTypeConstructor <$> capitalizedIdentifier <*> many (monoTypeConstructorP <|> parens typeConstructorP) <|>
40+ ADTypeConstructor <$> capitalizedIdentifier <*> many (parens typeConstructorP <|>
53− monoTypeConstructorP
41+ monoTypeConstructorP)
54
42
55monoTypeConstructorP :: Parser TypeConstructor
43monoTypeConstructorP :: Parser TypeConstructor
44+monoTypeConstructorP = primitiveTypeConstructorP <|>
56−monoTypeConstructorP = ADTypeConstructor <$> typeConstructorNameP <*> pure [] <|>
45+ ADTypeConstructor <$> capitalizedIdentifier <*> pure [] <|>
57− TypeVariable <$> uncapitalizedIdentifier
46+ TypeVariable <$> uncapitalizedIdentifier
58
47
59
48
60
49
src/bin/TutorialD/Printer.hsdeleted−165
@@ -1,165 +0,0 @@
1−{-# OPTIONS_GHC -fno-warn-orphans #-}
2−{-# LANGUAGE FlexibleInstances #-}
3−{-# LANGUAGE OverloadedStrings #-}
4−{-# LANGUAGE ScopedTypeVariables #-}
5−{-# LANGUAGE TypeApplications #-}
6−module TutorialD.Printer where
7−import ProjectM36.Base
8−import ProjectM36.Attribute as A hiding (null)
9−import Data.Text.Prettyprint.Doc
10−import qualified Data.Set as S hiding (fromList)
11−import qualified Data.Vector as V
12−import qualified Data.Map.Strict as M
13−import Data.Time.Calendar
14−import Data.Time.Clock.POSIX
15−import qualified Data.ByteString.Base64 as B64
16−import qualified Data.Text.Encoding as TE
17−
18−instance Pretty Atom where
19− pretty (IntegerAtom x) = pretty x
20− pretty (IntAtom x) = "int" <> parensList [pretty x]
21− pretty (DoubleAtom x) = pretty x
22− pretty (TextAtom x) = dquotes (pretty x)
23− pretty (DayAtom x) = "fromGregorian" <> parensList [pretty a, pretty b, pretty c]
24− where
25− (a,b,c) = toGregorian x
26− pretty (DateTimeAtom time) = "dateTimeFromEpochSeconds" <> parensList [pretty @Integer (round (utcTimeToPOSIXSeconds time))]
27− pretty (ByteStringAtom bs) = "bytestring" <> parensList [dquotes (pretty (TE.decodeUtf8 (B64.encode bs)))]
28− pretty (BoolAtom x) = if x then "t" else "f"
29− pretty (RelationAtom x) = pretty x
30− pretty (RelationalExprAtom re) = pretty re
31− pretty (ConstructedAtom n _ as) = pretty n <+> prettyList as
32−
33−instance Pretty AtomExpr where
34− pretty (AttributeAtomExpr attrName) = pretty attrName
35− pretty (NakedAtomExpr atom) = pretty atom
36− pretty (FunctionAtomExpr atomFuncName' atomExprs _) = pretty atomFuncName' <> prettyAtomExprsAsArguments atomExprs
37− pretty (RelationAtomExpr relExpr) = pretty relExpr
38− pretty (ConstructedAtomExpr dName [] _) = pretty dName
39− pretty (ConstructedAtomExpr dName atomExprs _) = pretty dName <+> hsep (map prettyAtomExpr atomExprs)
40−
41−prettyAtomExpr :: AtomExpr -> Doc ann
42−prettyAtomExpr atomExpr =
43− case atomExpr of
44− AttributeAtomExpr attrName -> "@" <> pretty attrName
45− ConstructedAtomExpr dConsName [] () -> pretty dConsName
46− ConstructedAtomExpr dConsName atomExprs () -> parens (pretty dConsName <+> hsep (map prettyAtomExpr atomExprs))
47− _ -> pretty atomExpr
48−
49−prettyAtomExprsAsArguments :: [AtomExpr] -> Doc ann
50−prettyAtomExprsAsArguments = align . parensList . map addAt
51− where addAt (atomExpr :: AtomExpr) =
52− case atomExpr of
53− AttributeAtomExpr attrName -> "@" <> pretty attrName
54− _ -> pretty atomExpr
55−
56−instance Pretty TupleExpr where
57− pretty (TupleExpr map') = "tuple" <> bracesList (Prelude.map (\(attrName,atom)-> pretty attrName <+> pretty atom) (M.toList map'))
58−
59−instance Pretty RelationTuple where
60− pretty (RelationTuple attrs atoms) = "tuple" <> bracesList (zipWith (\x y-> pretty x <+> pretty y) (V.toList (attributeNames attrs)) (V.toList atoms))
61−
62−instance Pretty Relation where
63− pretty (Relation attrs tupSet) | attrs == mempty && null (asList tupSet) = "false"
64− pretty (Relation attrs tupSet) | attrs == mempty && asList tupSet == [RelationTuple mempty mempty] = "true"
65− pretty (Relation attrs tupSet) = "relation" <> prettyBracesList (A.toList attrs) <> prettyBracesList (asList tupSet)
66−
67−instance Pretty Attribute where
68− pretty (Attribute n aTy) = pretty n <+> pretty (show aTy) -- workaround
69−
70−instance Pretty RelationalExpr where
71− pretty (RelationVariable n _) = pretty n
72− pretty (ExistingRelation r) = pretty r
73− pretty (NotEquals a b) = pretty' a <+> "!=" <+> pretty' b
74− pretty (Equals a b) = pretty' a <+> "==" <+> pretty' b
75− pretty (Project ns r) = pretty' (ignoreProjects r) <> pretty ns
76− pretty (Extend ext r) = collectExtends r <> pretty ext <> "}"
77− pretty (MakeRelationFromExprs Nothing (TupleExprs () tupExprs)) = "relation" <> prettyBracesList tupExprs
78− pretty (MakeRelationFromExprs (Just attrExprs) (TupleExprs () tupExprs)) = "relation" <> prettyBracesList attrExprs <> prettyBracesList tupExprs
79− pretty (MakeStaticRelation attrs tupSet) = "relation" <> prettyBracesList (A.toList attrs) <> prettyBracesList (asList tupSet)
80− pretty (Union a b) = parens $ pretty' a <+> "union" <+> pretty' b
81− pretty (Join a b) = parens $ pretty' a <+> "join" <+> pretty' b
82− pretty (Rename n1 n2 relExpr) = parens $ pretty relExpr <+> "rename" <+> braces (pretty n1 <+> "as" <+> pretty n2)
83− pretty (Difference a b) = parens $ pretty' a <+> "minus" <+> pretty' b
84− pretty (Group attrNames attrName relExpr) = parens $ pretty relExpr <+> "group" <+> parens (pretty attrNames <+> "as" <+> pretty attrName)
85− pretty (Ungroup attrName relExpr) = parens $ pretty' relExpr <+> "ungroup" <+> pretty attrName
86− pretty (Restrict resPreExpr relExpr) = parens $ pretty' relExpr <+> "where" <+> pretty resPreExpr
87− pretty (With pairs a) = "with" <+> parensList (map (\(name,expr)-> pretty name <+> "as" <+> pretty expr) pairs) <+> pretty' a
88−
89−-- relvar:{a:=?}:{b:=?}:... in ADTs => relvar:{a:=?, b:=?, ...} in Doc ann
90−collectExtends :: RelationalExpr -> Doc ann
91−collectExtends (Extend ext r) = collectExtends r <> pretty ext <> ", "
92−collectExtends r = pretty r <> ":{"
93−
94−--relvar{a,b,c,...}{a,b,...}..{a} => relvar{a}
95−ignoreProjects :: RelationalExpr -> RelationalExpr
96−ignoreProjects (Project _ r) = ignoreProjects r
97−ignoreProjects r = r
98−
99−prettyRelationalExpr :: RelationalExpr -> Doc n
100−prettyRelationalExpr (RelationVariable n _) = pretty n
101−prettyRelationalExpr r = parens (pretty r)
102−
103−pretty' :: RelationalExpr -> Doc n
104−pretty' = prettyRelationalExpr
105−
106−instance Pretty AttributeNames where
107− pretty (AttributeNames attrNames) = prettyBracesList (S.toList attrNames)
108− pretty (InvertedAttributeNames attrNames) = braces $ "all but" <+> concatWith (surround ", ") (map pretty (S.toList attrNames))
109− pretty (RelationalExprAttributeNames relExpr) = braces $ "all from" <+> pretty relExpr
110− pretty (UnionAttributeNames aAttrNames bAttrNames) = braces ("union of" <+> pretty aAttrNames <+> pretty bAttrNames)
111− pretty (IntersectAttributeNames aAttrNames bAttrNames) = braces ("intersection of" <+> pretty aAttrNames <+> pretty bAttrNames)
112−
113−instance Pretty AttributeExpr where
114− pretty (NakedAttributeExpr attr) = pretty attr
115− pretty (AttributeAndTypeNameExpr name typeCons _) = pretty name <+> pretty typeCons
116−
117−instance Pretty TypeConstructor where
118− pretty (ADTypeConstructor tcName []) = pretty tcName
119− pretty (ADTypeConstructor tcName tConsArgs) = pretty tcName <+> hsep (map pretty tConsArgs)
120− pretty (PrimitiveTypeConstructor tcName atomType') = pretty tcName <+> pretty atomType'
121− pretty (RelationAtomTypeConstructor attrExprs) = "relation" <> prettyBracesList attrExprs
122− pretty (TypeVariable x) = pretty x
123−
124−instance Pretty AtomType where
125− pretty IntAtomType = "Int"
126− pretty IntegerAtomType = "Integer"
127− pretty DoubleAtomType = "Double"
128− pretty TextAtomType = "Text"
129− pretty DayAtomType = "Day"
130− pretty DateTimeAtomType = "DateTime"
131− pretty ByteStringAtomType = "ByteString"
132− pretty BoolAtomType = "Bool"
133− pretty (RelationAtomType attrs) = "relation " <+> prettyBracesList (A.toList attrs)
134− pretty (ConstructedAtomType tcName tvMap) = pretty tcName <+> hsep (map pretty (M.toList tvMap)) --order matters
135− pretty RelationalExprAtomType = "RelationalExpr"
136− pretty (TypeVariableType x) = pretty x
137−
138−instance Pretty ExtendTupleExpr where
139− pretty (AttributeExtendTupleExpr attrName atomExpr) = pretty attrName <> ":=" <> pretty atomExpr
140−
141−
142−instance Pretty RestrictionPredicateExpr where
143− pretty TruePredicate = "true"
144− pretty (AndPredicate a b) = pretty a <+> "and" <+> pretty b
145− pretty (OrPredicate a b) = pretty a <+> "or" <+> pretty b
146− pretty (NotPredicate a) = "not" <+> pretty a
147− pretty (RelationalExprPredicate relExpr) = pretty relExpr
148− pretty (AtomExprPredicate atomExpr) = pretty atomExpr
149− pretty (AttributeEqualityPredicate attrName atomExpr) = pretty attrName <> "=" <> pretty atomExpr
150−
151−instance Pretty WithNameExpr where
152− pretty (WithNameExpr name _) = pretty name
153−
154−bracesList :: [Doc ann] -> Doc ann
155−bracesList = group . encloseSep (flatAlt "{ " "{") (flatAlt " }" "}") ", "
156−
157−prettyBracesList :: Pretty a => [a] -> Doc ann
158−prettyBracesList = align . bracesList . map pretty
159−
160−parensList :: [Doc ann] -> Doc ann
161−parensList = group . encloseSep (flatAlt "( " "(") (flatAlt " )" ")") ", "
162−
163−prettyParensList :: Pretty a => [a] -> Doc ann
164−prettyParensList = align . parensList . map pretty
165−
src/bin/TutorialD/tutd.hs+17−24
@@ -5,58 +5,58 @@ import ProjectM36.Client
5import ProjectM36.Server.ParseArgs
5import ProjectM36.Server.ParseArgs
6import ProjectM36.Server
6import ProjectM36.Server
7import System.IO
7import System.IO
8−import GHC.IO.Encoding
9import Options.Applicative
8import Options.Applicative
10import System.Exit
9import System.Exit
11−import Control.Monad
12−#if __GLASGOW_HASKELL__ < 804
13import Data.Monoid
10import Data.Monoid
14−#endif
15import Data.Maybe
11import Data.Maybe
16import qualified Data.Text as T
12import qualified Data.Text as T
17
13
18−#if !defined(VERSION_project_m36)
19−# warning Failed to discover proper version from cabal_macros.h
20−# define VERSION_project_m36 "<unknown>"
21−#endif
22−
23parseArgs :: Parser InterpreterConfig
14parseArgs :: Parser InterpreterConfig
24parseArgs = LocalInterpreterConfig <$> parsePersistenceStrategy <*> parseHeadName <*> parseTutDExec <*> many parseGhcPkgPath <*> parseCheckFS <|>
15parseArgs = LocalInterpreterConfig <$> parsePersistenceStrategy <*> parseHeadName <*> parseTutDExec <*> many parseGhcPkgPath <*> parseCheckFS <|>
25− RemoteInterpreterConfig <$> parseHostname "127.0.0.1" <*> parsePort defaultServerPort <*> parseDatabaseName <*> parseHeadName <*> parseTutDExec <*> parseCheckFS
16+ RemoteInterpreterConfig <$> parseNodeId <*> parseDatabaseName <*> parseHeadName <*> parseTutDExec <*> parseCheckFS
26
17
27parseHeadName :: Parser HeadName
18parseHeadName :: Parser HeadName
28parseHeadName = option auto (long "head" <>
19parseHeadName = option auto (long "head" <>
29 help "Start session at head name." <>
20 help "Start session at head name." <>
30− metavar "GRAPH HEAD NAME" <>
31 value "master"
21 value "master"
32 )
22 )
33
23
24+parseNodeId :: Parser NodeId
25+parseNodeId = createNodeId <$>
26+ strOption (long "host" <>
27+ short 'h' <>
28+ help "Remote host name" <>
29+ value "127.0.0.1") <*>
30+ option auto (long "port" <>
31+ short 'p' <>
32+ help "Remote port" <>
33+ value defaultServerPort)
34+
34--just execute some tutd and exit
35--just execute some tutd and exit
35parseTutDExec :: Parser (Maybe TutorialDExec)
36parseTutDExec :: Parser (Maybe TutorialDExec)
36parseTutDExec = optional $ strOption (long "exec-tutd" <>
37parseTutDExec = optional $ strOption (long "exec-tutd" <>
37 short 'e' <>
38 short 'e' <>
38− metavar "TUTORIALD" <>
39 help "Execute TutorialD expression and exit"
39 help "Execute TutorialD expression and exit"
40 )
40 )
41
41
42opts :: ParserInfo InterpreterConfig
42opts :: ParserInfo InterpreterConfig
43−opts = info (parseArgs <**> helpOption) idm
43+opts = info parseArgs idm
44
44
45connectionInfoForConfig :: InterpreterConfig -> ConnectionInfo
45connectionInfoForConfig :: InterpreterConfig -> ConnectionInfo
46connectionInfoForConfig (LocalInterpreterConfig pStrategy _ _ ghcPkgPaths _) = InProcessConnectionInfo pStrategy outputNotificationCallback ghcPkgPaths
46connectionInfoForConfig (LocalInterpreterConfig pStrategy _ _ ghcPkgPaths _) = InProcessConnectionInfo pStrategy outputNotificationCallback ghcPkgPaths
47−connectionInfoForConfig (RemoteInterpreterConfig remoteHost remotePort remoteDBName _ _ _) = RemoteConnectionInfo remoteDBName remoteHost (show remotePort) outputNotificationCallback
47+connectionInfoForConfig (RemoteInterpreterConfig remoteNodeId remoteDBName _ _ _) = RemoteProcessConnectionInfo remoteDBName remoteNodeId outputNotificationCallback
48
48
49headNameForConfig :: InterpreterConfig -> HeadName
49headNameForConfig :: InterpreterConfig -> HeadName
50headNameForConfig (LocalInterpreterConfig _ headn _ _ _) = headn
50headNameForConfig (LocalInterpreterConfig _ headn _ _ _) = headn
51−headNameForConfig (RemoteInterpreterConfig _ _ _ headn _ _) = headn
51+headNameForConfig (RemoteInterpreterConfig _ _ headn _ _) = headn
52
52
53execTutDForConfig :: InterpreterConfig -> Maybe String
53execTutDForConfig :: InterpreterConfig -> Maybe String
54execTutDForConfig (LocalInterpreterConfig _ _ t _ _) = t
54execTutDForConfig (LocalInterpreterConfig _ _ t _ _) = t
55−execTutDForConfig (RemoteInterpreterConfig _ _ _ _ t _) = t
55+execTutDForConfig (RemoteInterpreterConfig _ _ _ t _) = t
56
56
57checkFSForConfig :: InterpreterConfig -> Bool
57checkFSForConfig :: InterpreterConfig -> Bool
58checkFSForConfig (LocalInterpreterConfig _ _ _ _ c) = c
58checkFSForConfig (LocalInterpreterConfig _ _ _ _ c) = c
59−checkFSForConfig (RemoteInterpreterConfig _ _ _ _ _ c) = c
59+checkFSForConfig (RemoteInterpreterConfig _ _ _ _ c) = c
60
60
61persistenceStrategyForConfig :: InterpreterConfig -> Maybe PersistenceStrategy
61persistenceStrategyForConfig :: InterpreterConfig -> Maybe PersistenceStrategy
62persistenceStrategyForConfig (LocalInterpreterConfig strat _ _ _ _) = Just strat
62persistenceStrategyForConfig (LocalInterpreterConfig strat _ _ _ _) = Just strat
@@ -75,15 +75,8 @@ printWelcome = do
75 putStrLn "A full tutorial is available at:"
75 putStrLn "A full tutorial is available at:"
76 putStrLn "https://github.com/agentm/project-m36/blob/master/docs/tutd_tutorial.markdown"
76 putStrLn "https://github.com/agentm/project-m36/blob/master/docs/tutd_tutorial.markdown"
77
77
78−-- | If the locale is set to ASCII, upgrade it to UTF-8 because tutd outputs UTF-8-encoded attributes. This is especially important in light docker images where the locale data may be missing.
79−setLocaleIfNecessary :: IO ()
80−setLocaleIfNecessary = do
81− l <- getLocaleEncoding
82− when (textEncodingName l == "ASCII") (setLocaleEncoding utf8)
83−
84main :: IO ()
78main :: IO ()
85main = do
79main = do
86− setLocaleIfNecessary
87 interpreterConfig <- execParser opts
80 interpreterConfig <- execParser opts
88 let connInfo = connectionInfoForConfig interpreterConfig
81 let connInfo = connectionInfoForConfig interpreterConfig
89 fscheck <- checkFSType (checkFSForConfig interpreterConfig) (fromMaybe NoPersistence (persistenceStrategyForConfig interpreterConfig))
82 fscheck <- checkFSType (checkFSForConfig interpreterConfig) (fromMaybe NoPersistence (persistenceStrategyForConfig interpreterConfig))
src/bin/benchmark/Handles.hs+16−26
@@ -4,17 +4,16 @@ import ProjectM36.Client
4import ProjectM36.Persist
4import ProjectM36.Persist
5import Options.Applicative
5import Options.Applicative
6import TutorialD.Interpreter
6import TutorialD.Interpreter
7−import TutorialD.Interpreter.Base hiding (Parser, option)
7+import TutorialD.Interpreter.Base
8import qualified Data.Text as T
8import qualified Data.Text as T
9−#if __GLASGOW_HASKELL__ < 804
9+import Text.Megaparsec hiding (option)
10import Data.Monoid
10import Data.Monoid
11−#endif
12import Control.Monad
11import Control.Monad
13
12
14data HandlesArgs = HandlesArgs {
13data HandlesArgs = HandlesArgs {
15 openCloseCount :: Int,
14 openCloseCount :: Int,
16 transactionCount :: Int,
15 transactionCount :: Int,
17− dbdir :: FilePath,
16+ dbdir :: FilePath,
18 tutdSetup :: String,
17 tutdSetup :: String,
19 tutdIterate :: String
18 tutdIterate :: String
20 }
19 }
@@ -40,13 +39,13 @@ parseTutdIterate = strOption (short 'i' <> long "iterate-tutd" <> value "update
40main :: IO ()
39main :: IO ()
41main = do
40main = do
42 args <- execParser $ info (helper <*> parseArgs) fullDesc
41 args <- execParser $ info (helper <*> parseArgs) fullDesc
43− replicateM_ (openCloseCount args) (runOpenClose
42+ replicateM_ (openCloseCount args) (runOpenClose
44 (T.pack (tutdSetup args))
43 (T.pack (tutdSetup args))
45 (T.pack (tutdIterate args))
44 (T.pack (tutdIterate args))
46− (transactionCount args)
45+ (transactionCount args)
47 (dbdir args))
46 (dbdir args))
48−
47+
49−runOpenClose :: T.Text -> T.Text -> Int -> FilePath -> IO ()
48+runOpenClose :: T.Text -> T.Text -> Int -> FilePath -> IO ()
50runOpenClose tutdSetup' tutdIterate' tCount dbdir' = do
49runOpenClose tutdSetup' tutdIterate' tCount dbdir' = do
51 let connInfo = InProcessConnectionInfo (MinimalPersistence dbdir') emptyNotificationCallback []
50 let connInfo = InProcessConnectionInfo (MinimalPersistence dbdir') emptyNotificationCallback []
52 eConn <- connectProjectM36 connInfo
51 eConn <- connectProjectM36 connInfo
@@ -56,7 +55,7 @@ runOpenClose tutdSetup' tutdIterate' tCount dbdir' = do
56 eSess <- createSessionAtHead conn "master"
55 eSess <- createSessionAtHead conn "master"
57 case eSess of
56 case eSess of
58 Left err -> error (show err)
57 Left err -> error (show err)
59− Right session ->
58+ Right session ->
60 --database setup
59 --database setup
61 case parseTutorialD tutdSetup' of
60 case parseTutorialD tutdSetup' of
62 Left err -> error (show err)
61 Left err -> error (show err)
@@ -64,19 +63,14 @@ runOpenClose tutdSetup' tutdIterate' tCount dbdir' = do
64 res <- evalTutorialD session conn UnsafeEvaluation parsed
63 res <- evalTutorialD session conn UnsafeEvaluation parsed
65 case res of
64 case res of
66 DisplayErrorResult err -> error (T.unpack err)
65 DisplayErrorResult err -> error (T.unpack err)
67− DisplayParseErrorResult _ err ->
66+ DisplayParseErrorResult _ err -> error (parseErrorPretty err)
68−#if MIN_VERSION_megaparsec(7,0,0)
69− error (errorBundlePretty err)
70−#else
71− error (parseErrorPretty err)
72−#endif
73− _ -> do
67+ _ -> do
74 replicateM_ tCount (runTransaction tutdIterate' session conn)
68 replicateM_ tCount (runTransaction tutdIterate' session conn)
75 close conn
69 close conn
76 printFdCount
70 printFdCount
77−
71+
78runTransaction :: T.Text -> SessionId -> Connection -> IO ()
72runTransaction :: T.Text -> SessionId -> Connection -> IO ()
79−runTransaction tutdIterate' sess conn =
73+runTransaction tutdIterate' sess conn =
80 --run tutd on every iteration
74 --run tutd on every iteration
81 case parseTutorialD tutdIterate' of
75 case parseTutorialD tutdIterate' of
82 Left err -> error (show err)
76 Left err -> error (show err)
@@ -84,14 +78,10 @@ runTransaction tutdIterate' sess conn =
84 res <- evalTutorialD sess conn UnsafeEvaluation parsed
78 res <- evalTutorialD sess conn UnsafeEvaluation parsed
85 case res of
79 case res of
86 DisplayErrorResult err -> error (T.unpack err)
80 DisplayErrorResult err -> error (T.unpack err)
87− DisplayParseErrorResult _ err ->
81+ DisplayParseErrorResult _ err -> error (parseErrorPretty err)
88−#if MIN_VERSION_megaparsec(7,0,0)
89− error (errorBundlePretty err)
90−#else
91− error (parseErrorPretty err)
92−#endif
93− _ -> do
82+ _ -> do
94− eErr <- commit sess conn
83+ eErr <- commit sess conn
95 case eErr of
84 case eErr of
96 Left err -> error (show err)
85 Left err -> error (show err)
97 Right _ -> printFdCount
86 Right _ -> printFdCount
87+
src/bin/benchmark/bigrel.hs+19−42
@@ -1,39 +1,33 @@
1−{-# LANGUAGE FlexibleInstances, CPP #-}
1+{-# LANGUAGE FlexibleInstances #-}
2{-# OPTIONS_GHC -fno-warn-orphans #-}
2{-# OPTIONS_GHC -fno-warn-orphans #-}
3import ProjectM36.Base
3import ProjectM36.Base
4import ProjectM36.Relation
4import ProjectM36.Relation
5import ProjectM36.DateExamples
5import ProjectM36.DateExamples
6import ProjectM36.Error
6import ProjectM36.Error
7−import ProjectM36.StaticOptimizer
8import qualified ProjectM36.Attribute as A
7import qualified ProjectM36.Attribute as A
9import qualified Data.Text as T
8import qualified Data.Text as T
10−--import ProjectM36.Relation.Show.CSV
9+import ProjectM36.Relation.Show.CSV
11import ProjectM36.Relation.Show.HTML
10import ProjectM36.Relation.Show.HTML
11+import TutorialD.Interpreter.DatabaseContextExpr (interpretDatabaseContextExpr)
12import ProjectM36.RelationalExpression
12import ProjectM36.RelationalExpression
13−import ProjectM36.TransactionGraph
14−--import qualified Data.HashSet as HS
13+import qualified Data.HashSet as HS
15−--import qualified Data.ByteString.Lazy.Char8 as BS
14+import qualified Data.ByteString.Lazy.Char8 as BS
16−--import qualified Data.IntMap as IM
15+import qualified Data.IntMap as IM
17−--import qualified Data.Hashable as Hash
16+import qualified Data.Hashable as Hash
18import qualified Data.Vector as V
17import qualified Data.Vector as V
19import Options.Applicative
18import Options.Applicative
19+import qualified Data.Map as M
20import qualified Data.Text.IO as TIO
20import qualified Data.Text.IO as TIO
21import System.IO
21import System.IO
22+import Control.Monad.State
22import Control.DeepSeq
23import Control.DeepSeq
23import Data.Text hiding (map)
24import Data.Text hiding (map)
24−import Data.Time.Clock
25−import Data.UUID.V4
26−#if __GLASGOW_HASKELL__ < 804
27import Data.Monoid
25import Data.Monoid
28−#endif
29
26
30−
31−{-
32dumpcsv :: Relation -> IO ()
27dumpcsv :: Relation -> IO ()
33dumpcsv rel = case relationAsCSV rel of
28dumpcsv rel = case relationAsCSV rel of
34 Left err -> hPrint stderr err
29 Left err -> hPrint stderr err
35 Right bsData -> BS.putStrLn bsData
30 Right bsData -> BS.putStrLn bsData
36−-}
37
31
38data BigrelArgs = BigrelArgs Int Int Text
32data BigrelArgs = BigrelArgs Int Int Text
39
33
@@ -64,63 +58,46 @@ matrixRun (BigrelArgs attributeCount tupleCount tutd) =
64 Right rel -> if tutd == "" then
58 Right rel -> if tutd == "" then
65 putStrLn "Done."
59 putStrLn "Done."
66 else do
60 else do
67− now <- getCurrentTime
68− tid <- nextRandom
69 let setx = Assign "x" (ExistingRelation (force rel))
61 let setx = Assign "x" (ExistingRelation (force rel))
70− graph = bootstrapTransactionGraph now tid dateExamples
62+ (context,_,_) = execState (evalDatabaseContextExpr setx) (freshDatabaseState dateExamples)
71− env = mkDatabaseContextEvalEnv tid graph
63+ interpreted = interpretDatabaseContextExpr context tutd
72− eNewState = runDatabaseContextEvalMonad dateExamples env (optimizeAndEvalDatabaseContextExpr True setx)
73 --plan = interpretRODatabaseContextOp context $ ":showplan " ++ tutd
64 --plan = interpretRODatabaseContextOp context $ ":showplan " ++ tutd
74 --displayOpResult plan
65 --displayOpResult plan
75− case eNewState of
66+ case interpreted of
76− Right newState -> do
77− let ctx = dbc_context newState
78− Right x = optimizeAndEvalRelationalExpr env' (RelationVariable "x" ())
79− env' = RelationalExprEnv ctx graph Nothing
80− TIO.putStrLn $ relationAsHTML x
67+ Right context' -> TIO.putStrLn $ relationAsHTML (relationVariables context' M.! "x")
81 Left err -> hPrint stderr err
68 Left err -> hPrint stderr err
82
69
83−{-
70+
84intmapMatrixRun :: IO ()
71intmapMatrixRun :: IO ()
85intmapMatrixRun = do
72intmapMatrixRun = do
86 let matrix = intmapMatrixRelation 100 100000
73 let matrix = intmapMatrixRelation 100 100000
87 print matrix
74 print matrix
88−-}
89
75
90--compare IntMap speed and size
76--compare IntMap speed and size
91--this is about 3 times faster (9 minutes) for 10x100000 and uses 800 MB
77--this is about 3 times faster (9 minutes) for 10x100000 and uses 800 MB
92−{-
93intmapMatrixRelation :: Int -> Int -> HS.HashSet (IM.IntMap Atom)
78intmapMatrixRelation :: Int -> Int -> HS.HashSet (IM.IntMap Atom)
94intmapMatrixRelation attributeCount tupleCount = HS.fromList $ map mapper [0..tupleCount]
79intmapMatrixRelation attributeCount tupleCount = HS.fromList $ map mapper [0..tupleCount]
95 where
80 where
96 mapper tupCount = IM.fromList $ map (\c-> (c, IntAtom (fromIntegral tupCount))) [0..attributeCount]
81 mapper tupCount = IM.fromList $ map (\c-> (c, IntAtom (fromIntegral tupCount))) [0..attributeCount]
97−-}
98−-- instance Hash.Hashable (IM.IntMap Atom) where
99−-- hashWithSalt salt tupMap = Hash.hashWithSalt salt (show tupMap)
100
82
101−{-
83+instance Hash.Hashable (IM.IntMap Atom) where
84+ hashWithSalt salt tupMap = Hash.hashWithSalt salt (show tupMap)
85+
102vectorMatrixRun :: IO ()
86vectorMatrixRun :: IO ()
103vectorMatrixRun = do
87vectorMatrixRun = do
104 let matrix = vectorMatrixRelation 100 100000
88 let matrix = vectorMatrixRelation 100 100000
105 print matrix
89 print matrix
106−-}
107−-- 20 s 90 MBs- a clear win- ideal size is 10 * 100000 * 8 bytes = 80 MB! without IntAtom wrapper
108−--with IntAtom wrapper: 1m12s 90 MB
109−{-
110−
111
90
112-- 20 s 90 MBs- a clear win- ideal size is 10 * 100000 * 8 bytes = 80 MB! without IntAtom wrapper
91-- 20 s 90 MBs- a clear win- ideal size is 10 * 100000 * 8 bytes = 80 MB! without IntAtom wrapper
113--with IntAtom wrapper: 1m12s 90 MB
92--with IntAtom wrapper: 1m12s 90 MB
114−{-
115−
116vectorMatrixRelation :: Int -> Int -> HS.HashSet (V.Vector Atom)
93vectorMatrixRelation :: Int -> Int -> HS.HashSet (V.Vector Atom)
117vectorMatrixRelation attributeCount tupleCount = HS.fromList $ map mapper [0..tupleCount]
94vectorMatrixRelation attributeCount tupleCount = HS.fromList $ map mapper [0..tupleCount]
118 where
95 where
119 mapper tupCount = V.replicate attributeCount (IntAtom (fromIntegral tupCount))
96 mapper tupCount = V.replicate attributeCount (IntAtom (fromIntegral tupCount))
120−-}
97+
121instance Hash.Hashable (V.Vector Atom) where
98instance Hash.Hashable (V.Vector Atom) where
122 hashWithSalt salt vec = Hash.hashWithSalt salt (show vec)
99 hashWithSalt salt vec = Hash.hashWithSalt salt (show vec)
123−-}
100+
124-- returns a relation with tupleCount tuples with a set of integer attributes attributesCount long
101-- returns a relation with tupleCount tuples with a set of integer attributes attributesCount long
125-- this is useful for performance and resource usage testing
102-- this is useful for performance and resource usage testing
126matrixRelation :: Int -> Int -> Either RelationalError Relation
103matrixRelation :: Int -> Int -> Either RelationalError Relation
src/lib/ProjectM36/Arbitrary.hsdeleted−127
@@ -1,127 +0,0 @@
1−{-# LANGUAGE ExistentialQuantification,FlexibleInstances,OverloadedStrings #-}
2−{-# OPTIONS_GHC -fno-warn-orphans #-}
3−
4−module ProjectM36.Arbitrary where
5−import ProjectM36.Base
6−import ProjectM36.Error
7−import ProjectM36.AtomFunctionError
8−import ProjectM36.AtomType
9−import ProjectM36.Attribute (atomType)
10−import ProjectM36.DataConstructorDef as DCD
11−import ProjectM36.DataTypes.Interval
12−import ProjectM36.Relation
13−import qualified Data.Vector as V
14−import Data.Text (Text)
15−import Test.QuickCheck
16−import Test.QuickCheck.Instances ()
17−import qualified Data.ByteString.Char8 as B
18−import Data.Time
19−import Control.Monad.Reader
20−
21−arbitrary' :: AtomType -> WithTCMap Gen (Either RelationalError Atom)
22−arbitrary' IntegerAtomType =
23− Right . IntegerAtom <$> lift (arbitrary :: Gen Integer)
24−
25−arbitrary' (RelationAtomType attrs) = do
26− tcMap <-ask
27− maybeRel <- lift $ runReaderT (arbitraryRelation attrs (0,5)) tcMap
28− case maybeRel of
29− Left err -> pure $ Left err
30− Right rel -> pure $ Right $ RelationAtom rel
31−
32−arbitrary' IntAtomType =
33− Right . IntAtom <$> lift (arbitrary :: Gen Int)
34−
35−arbitrary' DoubleAtomType =
36− Right . DoubleAtom <$> lift (arbitrary :: Gen Double)
37−
38−arbitrary' TextAtomType =
39− Right . TextAtom <$> lift (arbitrary :: Gen Text)
40−
41−arbitrary' DayAtomType =
42− Right . DayAtom <$> lift (arbitrary :: Gen Day)
43−
44−arbitrary' DateTimeAtomType =
45− Right . DateTimeAtom <$> lift (arbitrary :: Gen UTCTime)
46−
47−arbitrary' ByteStringAtomType =
48− Right . ByteStringAtom <$> lift (arbitrary :: Gen B.ByteString)
49−
50−arbitrary' BoolAtomType =
51− Right . BoolAtom <$> lift (arbitrary :: Gen Bool)
52−
53−arbitrary' RelationalExprAtomType =
54− pure (Right (RelationalExprAtom (ExistingRelation relationTrue))) -- don't bother with arbitrary relational expressions
55−
56−arbitrary' constructedAtomType@(ConstructedAtomType tcName tvMap)
57− --special-casing for Interval type
58− | isIntervalAtomType constructedAtomType = createArbitraryInterval (intervalSubType constructedAtomType)
59− | otherwise = do
60− tcMap <- ask
61− let maybeTCons = findTypeConstructor tcName tcMap
62− let eitherTCons = maybeToRight (NoSuchTypeConstructorName tcName) maybeTCons
63− let eitherDCDefs = snd <$> eitherTCons
64− let eitherGenDCDef = elements <$> eitherDCDefs
65− case eitherGenDCDef of
66− Left err -> pure $ Left err
67− Right genDCDef -> do
68− dcDef <- lift genDCDef
69− case resolvedAtomTypesForDataConstructorDefArgs tcMap tvMap dcDef of
70− Left err -> pure $ Left err
71− Right atomTypes -> do
72− let genListOfEitherAtom = mapM (\aTy->runReaderT (arbitrary' aTy) tcMap) atomTypes
73− listOfEitherAtom <- lift genListOfEitherAtom
74− let eitherListOfAtom = sequence listOfEitherAtom
75− case eitherListOfAtom of
76− Left err -> pure $ Left err
77− Right listOfAtom -> pure $ Right $ ConstructedAtom (DCD.name dcDef) constructedAtomType listOfAtom
78−arbitrary' (TypeVariableType _) = error "arbitrary on type variable"
79−
80−maybeToRight :: b -> Maybe a -> Either b a
81−maybeToRight _ (Just x) = Right x
82−maybeToRight y Nothing = Left y
83−
84−arbitraryRelationTuple :: Attributes -> WithTCMap Gen (Either RelationalError RelationTuple)
85−arbitraryRelationTuple attris = do
86− tcMap <- ask
87− listOfMaybeAType <- lift $ mapM ((\aTy -> runReaderT (arbitrary' aTy) tcMap) . atomType) (V.toList (attributesVec attris))
88− case sequence listOfMaybeAType of
89− Left err -> pure $ Left err
90− Right listOfAttr -> do
91− let vectorOfAttr = V.fromList listOfAttr
92− pure $ Right $ RelationTuple attris vectorOfAttr
93−
94−arbitraryWithRange :: Gen (Either RelationalError RelationTuple) -> Range -> Gen [Either RelationalError RelationTuple]
95−arbitraryWithRange genEitherTuple range = do
96− num <- choose range
97− vectorOf num genEitherTuple
98−
99−arbitraryRelation :: Attributes -> Range -> WithTCMap Gen (Either RelationalError Relation)
100−arbitraryRelation attris range = do
101− tcMap <- ask
102− let genEitherTuple = runReaderT (arbitraryRelationTuple attris) tcMap
103− listOfEitherTuple <- lift $ arbitraryWithRange genEitherTuple range
104− let eitherTupleList = sequence listOfEitherTuple
105− case eitherTupleList of
106− Left err -> pure $ Left err
107− Right tupleList -> pure $ Right $ Relation attris $ RelationTupleSet tupleList
108−
109−type WithTCMap a = ReaderT TypeConstructorMapping a
110−
111−createArbitraryInterval :: AtomType -> WithTCMap Gen (Either RelationalError Atom)
112−createArbitraryInterval subType = if supportsInterval subType then do
113− eBegin <- arbitrary' subType
114− eEnd <- arbitrary' subType
115− beginopen <- lift (arbitrary :: Gen Bool)
116− endopen <- lift (arbitrary :: Gen Bool)
117− case eBegin of
118− Left err -> pure (Left err)
119− Right begin ->
120− case eEnd of
121− Left err -> pure (Left err)
122− Right end ->
123− case createInterval begin end beginopen endopen of
124− Left _ -> createArbitraryInterval subType
125− Right val -> pure (Right val)
126− else
127− pure $ Left (ProjectM36.Error.AtomFunctionUserError (AtomTypeDoesNotSupportIntervalError (prettyAtomType subType)))
src/lib/ProjectM36/Atom.hs+10−15
@@ -1,11 +1,11 @@
1module ProjectM36.Atom where
1module ProjectM36.Atom where
2import ProjectM36.Base
2import ProjectM36.Base
3import ProjectM36.Error
3import ProjectM36.Error
4−import ProjectM36.DataTypes.Interval
5import qualified Data.Text as T
4import qualified Data.Text as T
6−#if __GLASGOW_HASKELL__ < 804
5+--import Data.Time.Calendar
6+--import Data.Time.Clock
7+--import Data.ByteString (ByteString)
7import Data.Monoid
8import Data.Monoid
8−#endif
9
9
10relationForAtom :: Atom -> Either RelationalError Relation
10relationForAtom :: Atom -> Either RelationalError Relation
11relationForAtom (RelationAtom rel) = Right rel
11relationForAtom (RelationAtom rel) = Right rel
@@ -15,24 +15,19 @@ atomToText :: Atom -> T.Text
15atomToText (IntegerAtom i) = (T.pack . show) i
15atomToText (IntegerAtom i) = (T.pack . show) i
16atomToText (IntAtom i) = (T.pack . show) i
16atomToText (IntAtom i) = (T.pack . show) i
17atomToText (DoubleAtom i) = (T.pack . show) i
17atomToText (DoubleAtom i) = (T.pack . show) i
18−atomToText (TextAtom i) = (T.pack . show) i --quotes necessary for ConstructedAtom subatoms
18+atomToText (TextAtom i) = (T.pack . show) i --does this break quoting in CSV export?
19atomToText (DayAtom i) = (T.pack . show) i
19atomToText (DayAtom i) = (T.pack . show) i
20atomToText (DateTimeAtom i) = (T.pack . show) i
20atomToText (DateTimeAtom i) = (T.pack . show) i
21atomToText (ByteStringAtom i) = (T.pack . show) i
21atomToText (ByteStringAtom i) = (T.pack . show) i
22atomToText (BoolAtom i) = (T.pack . show) i
22atomToText (BoolAtom i) = (T.pack . show) i
23−atomToText (RelationalExprAtom re) = (T.pack . show) re
23+atomToText (IntervalAtom b e bo be) = beginp <> begin <> "," <> end <> endp
24+ where beginp = if bo then "(" else "["
25+ begin = atomToText b
26+ end = atomToText e
27+ endp = if be then ")" else "]"
24
28
25atomToText (RelationAtom i) = (T.pack . show) i
29atomToText (RelationAtom i) = (T.pack . show) i
26−atomToText (ConstructedAtom dConsName typ atoms)
30+atomToText (ConstructedAtom dConsName _ atoms) = dConsName <> dConsArgs
27− | isIntervalAtomType typ = case atoms of --special handling for printing intervals
28− [b, e, BoolAtom bo, BoolAtom be] ->
29− let beginp = if bo then "(" else "["
30− begin = atomToText b
31− end = atomToText e
32− endp = if be then ")" else "]" in
33− beginp <> begin <> "," <> end <> endp
34− _ -> "invalid interval"
35− | otherwise = dConsName <> dConsArgs
36 where
31 where
37 parensAtomToText a@(ConstructedAtom _ _ []) = atomToText a
32 parensAtomToText a@(ConstructedAtom _ _ []) = atomToText a
38 parensAtomToText a@ConstructedAtom{} = "(" <> atomToText a <> ")"
33 parensAtomToText a@ConstructedAtom{} = "(" <> atomToText a <> ")"
src/lib/ProjectM36/AtomFunction.hs+1−35
@@ -1,20 +1,11 @@
1−{-# LANGUAGE CPP #-}
2module ProjectM36.AtomFunction where
1module ProjectM36.AtomFunction where
3import ProjectM36.Base
2import ProjectM36.Base
4−import ProjectM36.Serialise.Base ()
5import ProjectM36.Error
3import ProjectM36.Error
6−import ProjectM36.Relation
7−import ProjectM36.AtomType
8import ProjectM36.AtomFunctionError
4import ProjectM36.AtomFunctionError
9−import ProjectM36.ScriptSession
10import qualified ProjectM36.Attribute as A
5import qualified ProjectM36.Attribute as A
11import qualified Data.HashSet as HS
6import qualified Data.HashSet as HS
12−import qualified Data.Text as T
13−import qualified Data.ByteString.Lazy as BL
14−import Codec.Winery
15
7
16foldAtomFuncType :: AtomType -> AtomType -> [AtomType]
8foldAtomFuncType :: AtomType -> AtomType -> [AtomType]
17−--the underscore in the attribute name means that any attributes are acceptable
18foldAtomFuncType foldType returnType = [RelationAtomType (A.attributesFromList [Attribute "_" foldType]), returnType]
9foldAtomFuncType foldType returnType = [RelationAtomType (A.attributesFromList [Attribute "_" foldType]), returnType]
19
10
20atomFunctionForName :: AtomFunctionName -> AtomFunctions -> Either RelationalError AtomFunction
11atomFunctionForName :: AtomFunctionName -> AtomFunctions -> Either RelationalError AtomFunction
@@ -73,29 +64,4 @@ createScriptedAtomFunction funcName argsType retType = AddAtomFunction funcName
73 argsType ++ [ADTypeConstructor "Either" [
64 argsType ++ [ADTypeConstructor "Either" [
74 ADTypeConstructor "AtomFunctionError" [],
65 ADTypeConstructor "AtomFunctionError" [],
75 retType]])
66 retType]])
76−
67+
77−loadAtomFunctions :: ModName -> FuncName -> FilePath -> IO (Either LoadSymbolError [AtomFunction])
78−#ifdef PM36_HASKELL_SCRIPTING
79−loadAtomFunctions = loadFunction
80−#else
81−loadAtomFunctions _ _ _ = pure (Left LoadSymbolError)
82−#endif
83−
84−atomFunctionsAsRelation :: AtomFunctions -> Either RelationalError Relation
85−atomFunctionsAsRelation funcs = mkRelationFromList attrs tups
86− where tups = map atomFuncToTuple (HS.toList funcs)
87− attrs = A.attributesFromList [Attribute "name" TextAtomType,
88− Attribute "arguments" TextAtomType]
89− atomFuncToTuple aFunc = [TextAtom (atomFuncName aFunc),
90− TextAtom (atomFuncTypeToText aFunc)]
91− atomFuncTypeToText aFunc = T.intercalate " -> " (map prettyAtomType (atomFuncType aFunc))
92−
93−--for calculating the merkle hash
94−hashBytes :: AtomFunction -> BL.ByteString
95−hashBytes func = BL.fromChunks [serialise (atomFuncName func),
96− serialise (atomFuncType func),
97− bodyBin
98− ]
99− where
100− bodyBin = case atomFuncBody func of
101− AtomFunctionBody mScript _ -> serialise mScript
src/lib/ProjectM36/AtomFunctionError.hs+2−2
@@ -1,5 +1,6 @@
1{-# LANGUAGE DeriveGeneric, DeriveAnyClass #-}
1{-# LANGUAGE DeriveGeneric, DeriveAnyClass #-}
2module ProjectM36.AtomFunctionError where
2module ProjectM36.AtomFunctionError where
3+import Data.Binary
3import GHC.Generics
4import GHC.Generics
4import Control.DeepSeq
5import Control.DeepSeq
5import Data.Text
6import Data.Text
@@ -8,10 +9,9 @@ data AtomFunctionError = AtomFunctionUserError String |
8 AtomFunctionTypeMismatchError |
9 AtomFunctionTypeMismatchError |
9 InvalidIntervalOrderingError |
10 InvalidIntervalOrderingError |
10 InvalidIntervalBoundariesError |
11 InvalidIntervalBoundariesError |
11− InvalidIntBoundError |
12 AtomFunctionEmptyRelationError |
12 AtomFunctionEmptyRelationError |
13 AtomTypeDoesNotSupportOrderingError Text |
13 AtomTypeDoesNotSupportOrderingError Text |
14 AtomTypeDoesNotSupportIntervalError Text |
14 AtomTypeDoesNotSupportIntervalError Text |
15 AtomFunctionBytesDecodingError String
15 AtomFunctionBytesDecodingError String
16− deriving(Generic, Eq, Show, NFData)
16+ deriving(Generic, Eq, Show, Binary, NFData)
17
17
src/lib/ProjectM36/AtomFunctions/Basic.hs−2
@@ -6,7 +6,6 @@ import ProjectM36.DataTypes.Either
6import ProjectM36.DataTypes.Maybe
6import ProjectM36.DataTypes.Maybe
7import ProjectM36.DataTypes.Interval
7import ProjectM36.DataTypes.Interval
8import ProjectM36.DataTypes.ByteString
8import ProjectM36.DataTypes.ByteString
9−import ProjectM36.DataTypes.NonEmptyList
10import ProjectM36.AtomFunctions.Primitive
9import ProjectM36.AtomFunctions.Primitive
11import ProjectM36.AtomFunction
10import ProjectM36.AtomFunction
12import ProjectM36.DataTypes.List
11import ProjectM36.DataTypes.List
@@ -20,7 +19,6 @@ basicAtomFunctions = HS.unions [primitiveAtomFunctions,
20 eitherAtomFunctions,
19 eitherAtomFunctions,
21 maybeAtomFunctions,
20 maybeAtomFunctions,
22 listAtomFunctions,
21 listAtomFunctions,
23− nonEmptyListAtomFunctions,
24 bytestringAtomFunctions,
22 bytestringAtomFunctions,
25 intervalAtomFunctions]
23 intervalAtomFunctions]
26
24
src/lib/ProjectM36/AtomFunctions/Primitive.hs+1−9
@@ -43,15 +43,7 @@ primitiveAtomFunctions = HS.fromList [
43 atomFuncBody = body $ integerAtomFuncLessThan True >=> boolAtomNot},
43 atomFuncBody = body $ integerAtomFuncLessThan True >=> boolAtomNot},
44 AtomFunction { atomFuncName = "not",
44 AtomFunction { atomFuncName = "not",
45 atomFuncType = [BoolAtomType, BoolAtomType],
45 atomFuncType = [BoolAtomType, BoolAtomType],
46− atomFuncBody = body $ \(b:_) -> boolAtomNot b },
46+ atomFuncBody = body $ \(b:_) -> boolAtomNot b }
47− AtomFunction { atomFuncName = "int",
48− atomFuncType = [IntegerAtomType, IntAtomType],
49− atomFuncBody = body $ \(IntegerAtom v:_) -> if v < fromIntegral (maxBound :: Int) then
50− pure (IntAtom (fromIntegral v))
51− else
52− Left InvalidIntBoundError
53− }
54−
55 ]
47 ]
56 where
48 where
57 body = AtomFunctionBody Nothing
49 body = AtomFunctionBody Nothing
src/lib/ProjectM36/AtomType.hs+64−210
@@ -6,7 +6,6 @@ import qualified ProjectM36.DataConstructorDef as DCD
6import ProjectM36.MiscUtils
6import ProjectM36.MiscUtils
7import ProjectM36.Error
7import ProjectM36.Error
8import ProjectM36.DataTypes.Primitive
8import ProjectM36.DataTypes.Primitive
9−import ProjectM36.AttributeExpr as AE
10import qualified ProjectM36.Attribute as A
9import qualified ProjectM36.Attribute as A
11import qualified Data.Vector as V
10import qualified Data.Vector as V
12import qualified Data.Set as S
11import qualified Data.Set as S
@@ -31,7 +30,6 @@ findDataConstructor dName = foldr tConsFolder Nothing
31 [dCons] -> Just dCons
30 [dCons] -> Just dCons
32 _ -> error "More than one data constructor with the same name found"
31 _ -> error "More than one data constructor with the same name found"
33
32
34−{-
35-- | Scan the atom types and return the resultant ConstructedAtomType or error.
33-- | Scan the atom types and return the resultant ConstructedAtomType or error.
36-- Used in typeFromAtomExpr to validate argument types.
34-- Used in typeFromAtomExpr to validate argument types.
37atomTypeForDataConstructorName :: DataConstructorName -> [AtomType] -> TypeConstructorMapping -> Either RelationalError AtomType
35atomTypeForDataConstructorName :: DataConstructorName -> [AtomType] -> TypeConstructorMapping -> Either RelationalError AtomType
@@ -40,21 +38,28 @@ atomTypeForDataConstructorName dConsName atomTypesIn tConsList =
40 case findDataConstructor dConsName tConsList of
38 case findDataConstructor dConsName tConsList of
41 Nothing -> Left (NoSuchDataConstructorError dConsName)
39 Nothing -> Left (NoSuchDataConstructorError dConsName)
42 Just (tCons, dCons) -> do
40 Just (tCons, dCons) -> do
43− dConsVars <- resolveDataConstructorTypeVars dCons atomTypesIn tConsList
41+ typeVars <- resolveDataConstructorTypeVars dCons atomTypesIn tConsList
44− let tConsVars = M.fromList (map TypeVariableType (TCD.typeVars tCons))
45− allVars = M.union dConsVars tConsVars
46− ConstructedAtomType (TCD.name tCons) <$> allVars
42+ pure (ConstructedAtomType (TCD.name tCons) typeVars)
47−-}
48
43
49atomTypeForDataConstructorDefArg :: DataConstructorDefArg -> AtomType -> TypeConstructorMapping -> Either RelationalError AtomType
44atomTypeForDataConstructorDefArg :: DataConstructorDefArg -> AtomType -> TypeConstructorMapping -> Either RelationalError AtomType
50−atomTypeForDataConstructorDefArg (DataConstructorDefTypeConstructorArg tCons) aType tConss = do
45+atomTypeForDataConstructorDefArg (DataConstructorDefTypeConstructorArg tCons) aType tConss =
51− isValidAtomTypeForTypeConstructor aType tCons tConss
46+ case isValidAtomTypeForTypeConstructor aType tCons tConss of
52− pure aType
47+ Just err -> Left err
48+ Nothing -> Right aType
53
49
54atomTypeForDataConstructorDefArg (DataConstructorDefTypeVarNameArg _) aType _ = Right aType --any type is OK
50atomTypeForDataConstructorDefArg (DataConstructorDefTypeVarNameArg _) aType _ = Right aType --any type is OK
55
51
52+--reconcile the atom-in types with the type constructors
53+isValidAtomTypeForTypeConstructor :: AtomType -> TypeConstructor -> TypeConstructorMapping -> Maybe RelationalError
54+isValidAtomTypeForTypeConstructor aType (PrimitiveTypeConstructor _ expectedAType) _ = if expectedAType /= aType then Just (AtomTypeMismatchError expectedAType aType) else Nothing
55+
56+--lookup constructor name and check if the incoming atom types are valid
57+isValidAtomTypeForTypeConstructor (ConstructedAtomType tConsName _) (ADTypeConstructor expectedTConsName _) _ = if tConsName /= expectedTConsName then Just (TypeConstructorNameMismatch expectedTConsName tConsName) else Nothing
58+
59+isValidAtomTypeForTypeConstructor aType tCons _ = Just (AtomTypeTypeConstructorReconciliationError aType (TC.name tCons))
60+
56-- | Used to determine if the atom arguments can be used with the data constructor.
61-- | Used to determine if the atom arguments can be used with the data constructor.
57−-- | This is the entry point for type-checking from RelationalExpression.hs
62+-- | This is the entry point for type-checking from RelationalExpression.hs.
58atomTypeForDataConstructor :: TypeConstructorMapping -> DataConstructorName -> [AtomType] -> Either RelationalError AtomType
63atomTypeForDataConstructor :: TypeConstructorMapping -> DataConstructorName -> [AtomType] -> Either RelationalError AtomType
59atomTypeForDataConstructor tConss dConsName atomArgTypes =
64atomTypeForDataConstructor tConss dConsName atomArgTypes =
60 --lookup the data constructor
65 --lookup the data constructor
@@ -62,12 +67,8 @@ atomTypeForDataConstructor tConss dConsName atomArgTypes =
62 Nothing -> Left (NoSuchDataConstructorError dConsName)
67 Nothing -> Left (NoSuchDataConstructorError dConsName)
63 Just (tCons, dCons) -> do
68 Just (tCons, dCons) -> do
64 --validate that the type constructor arguments are fulfilled in the data constructor
69 --validate that the type constructor arguments are fulfilled in the data constructor
65− dConsVars <- resolveDataConstructorTypeVars dCons atomArgTypes tConss
70+ typeVars <- resolveDataConstructorTypeVars dCons atomArgTypes tConss
66− let tConsVars = M.fromList (map (\v -> (v, TypeVariableType v)) (TCD.typeVars tCons))
67− allVars = M.union dConsVars tConsVars
68− unresolvedType = ConstructedAtomType (TCD.name tCons) allVars
71+ pure (ConstructedAtomType (TCD.name tCons) typeVars)
69− --validateAtomType unresolvedType tConss -- do not validate here because the type may not be fully resolved at this point
70− pure unresolvedType
71
72
72-- | Walks the data and type constructors to extract the type variable map.
73-- | Walks the data and type constructors to extract the type variable map.
73resolveDataConstructorTypeVars :: DataConstructorDef -> [AtomType] -> TypeConstructorMapping -> Either RelationalError TypeVarMap
74resolveDataConstructorTypeVars :: DataConstructorDef -> [AtomType] -> TypeConstructorMapping -> Either RelationalError TypeVarMap
@@ -81,11 +82,10 @@ resolveDataConstructorTypeVars dCons@(DataConstructorDef _ defArgs) aTypeArgs tC
81 --if any two maps have the same key and different values, this indicates a type arg mismatch
82 --if any two maps have the same key and different values, this indicates a type arg mismatch
82 let typeVarMapFolder valMap acc = case acc of
83 let typeVarMapFolder valMap acc = case acc of
83 Left err -> Left err
84 Left err -> Left err
84− Right accMap ->
85+ Right accMap -> if accMap `M.isSubmapOf` valMap then
85− case resolveAtomTypesInTypeVarMap valMap accMap of
86+ Right (M.union accMap valMap)
87+ else
86− Left (TypeConstructorTypeVarMissing _) -> Left (DataConstructorTypeVarsMismatch (DCD.name dCons) accMap valMap)
88+ Left (DataConstructorTypeVarsMismatch (DCD.name dCons) accMap valMap)
87− Left err -> Left err
88− Right ok -> pure ok
89 case foldr typeVarMapFolder (Right M.empty) maps of
89 case foldr typeVarMapFolder (Right M.empty) maps of
90 Left err -> Left err
90 Left err -> Left err
91 Right typeVarMaps -> pure typeVarMaps
91 Right typeVarMaps -> pure typeVarMaps
@@ -116,103 +116,36 @@ resolveTypeConstructorTypeVars (ADTypeConstructor tConsName _) (ConstructedAtomT
116 Right pVarMap'
116 Right pVarMap'
117 else
117 else
118 Left (TypeConstructorTypeVarsMismatch expectedPVarNames (M.keysSet pVarMap'))
118 Left (TypeConstructorTypeVarsMismatch expectedPVarNames (M.keysSet pVarMap'))
119−resolveTypeConstructorTypeVars (TypeVariable tvName) typ _ = case typ of
119+resolveTypeConstructorTypeVars (TypeVariable tvName) typ _ = Right (M.singleton tvName typ)
120− TypeVariableType nam -> Left (TypeConstructorTypeVarMissing nam)
121− _ -> Right (M.singleton tvName typ)
122−resolveTypeConstructorTypeVars (ADTypeConstructor tConsName []) typ tConss = case findTypeConstructor tConsName tConss of
123− Just (PrimitiveTypeConstructorDef _ _, _) -> Right M.empty
124− _ -> Left (TypeConstructorAtomTypeMismatch tConsName typ)
125−
126resolveTypeConstructorTypeVars (ADTypeConstructor tConsName _) typ _ = Left (TypeConstructorAtomTypeMismatch tConsName typ)
120resolveTypeConstructorTypeVars (ADTypeConstructor tConsName _) typ _ = Left (TypeConstructorAtomTypeMismatch tConsName typ)
127−
128−resolveTypeConstructorTypeVars (RelationAtomTypeConstructor attrExprs) typ tConsMap =
129− case typ of
130− RelationAtomType attrs ->
131− --resolve any typevars in the attrExprs
132− M.unions <$> mapM (\(expectedAtomType, attrExpr) -> resolveAttributeExprTypeVars attrExpr expectedAtomType tConsMap) (zip (A.atomTypesList attrs) attrExprs)
133− otherType -> Left (AtomTypeMismatchError typ otherType)
134−
135−--used when recursing down sub-relation type definition
136−resolveAttributeExprTypeVars :: AttributeExprBase a -> AtomType -> TypeConstructorMapping -> Either RelationalError TypeVarMap
137−resolveAttributeExprTypeVars (NakedAttributeExpr attr) aType _ = pure $ resolveTypeVariable (A.atomType attr) aType
138−resolveAttributeExprTypeVars (AttributeAndTypeNameExpr _ tCons _) aType tConsMap = resolveTypeConstructorTypeVars tCons aType tConsMap
139
121
140-- check that type vars on the right also appear on the left
122-- check that type vars on the right also appear on the left
141-- check that the data constructor names are unique
123-- check that the data constructor names are unique
142−validateTypeConstructorDef :: TypeConstructorDef -> [DataConstructorDef] -> TypeConstructorMapping -> Either RelationalError ()
124+validateTypeConstructorDef :: TypeConstructorDef -> [DataConstructorDef] -> [RelationalError]
143−validateTypeConstructorDef tConsDef dConsList tConsMap = do
125+validateTypeConstructorDef tConsDef dConsList = execWriter $ do
144 let duplicateDConsNames = dupes (L.sort (map DCD.name dConsList))
126 let duplicateDConsNames = dupes (L.sort (map DCD.name dConsList))
145− unless (null duplicateDConsNames) (Left (someErrors (map DataConstructorNameInUseError duplicateDConsNames)))
127+ mapM_ tell [map DataConstructorNameInUseError duplicateDConsNames]
146 let leftSideVars = S.fromList (TCD.typeVars tConsDef)
128 let leftSideVars = S.fromList (TCD.typeVars tConsDef)
147 rightSideVars = S.unions (map DCD.typeVars dConsList)
129 rightSideVars = S.unions (map DCD.typeVars dConsList)
148 varsDiff = S.difference leftSideVars rightSideVars
130 varsDiff = S.difference leftSideVars rightSideVars
149− when (S.size varsDiff > 0) (Left (someErrors (map DataConstructorUsesUndeclaredTypeVariable (S.toList varsDiff))))
131+ mapM_ tell [map DataConstructorUsesUndeclaredTypeVariable (S.toList varsDiff)]
150− mapM_ (\dConsDef -> validateDataConstructorDef dConsDef tConsDef tConsMap) dConsList
132+ pure ()
151−
133+
152−--check that the data constructor names are not in use (recursively)
153−validateDataConstructorDef :: DataConstructorDef -> TypeConstructorDef -> TypeConstructorMapping -> Either RelationalError ()
154−validateDataConstructorDef (DataConstructorDef dConsName dConsDefArgs) tConsDef tConsMap =
155− case findDataConstructor dConsName tConsMap of
156− Just _ -> Left (DataConstructorNameInUseError dConsName)
157− Nothing ->
158− mapM_ (\arg -> validateDataConstructorDefArg arg tConsDef tConsMap) dConsDefArgs
159−
160−
161−validateDataConstructorDefArg :: DataConstructorDefArg -> TypeConstructorDef -> TypeConstructorMapping -> Either RelationalError ()
162−validateDataConstructorDefArg (DataConstructorDefTypeConstructorArg (PrimitiveTypeConstructor _ _)) _ _ = Right ()
163−validateDataConstructorDefArg (DataConstructorDefTypeConstructorArg (TypeVariable _)) _ _ = Right ()
164−validateDataConstructorDefArg (DataConstructorDefTypeConstructorArg tCons) tConsDef tConsMap = case findTypeConstructor (TC.name tCons) tConsMap of
165− Nothing ->
166− when (TC.name tCons /= TCD.name tConsDef) (Left (NoSuchTypeConstructorName (TC.name tCons))) --allows for recursively-defined types
167− Just (ADTypeConstructorDef _ tConsArgs, _) -> do --validate that the argument count matches- type matching can occur later
168− let existingCount = length tConsArgs
169− newCount = length (TC.arguments tCons)
170− when (newCount /= existingCount) (Left (ConstructedAtomArgumentCountMismatchError existingCount newCount))
171− Just (PrimitiveTypeConstructorDef _ _, _) -> pure ()
172−validateDataConstructorDefArg (DataConstructorDefTypeVarNameArg _) _ _ = Right ()
173−
174−atomTypeForTypeConstructor :: TypeConstructor -> TypeConstructorMapping -> TypeVarMap -> Either RelationalError AtomType
175−atomTypeForTypeConstructor = atomTypeForTypeConstructorValidate False
176
134
177-- | Create an atom type iff all type variables are provided.
135-- | Create an atom type iff all type variables are provided.
178-- Either Int Text -> ConstructedAtomType "Either" {Int , Text}
136-- Either Int Text -> ConstructedAtomType "Either" {Int , Text}
179−atomTypeForTypeConstructorValidate :: Bool -> TypeConstructor -> TypeConstructorMapping -> TypeVarMap -> Either RelationalError AtomType
137+atomTypeForTypeConstructor :: TypeConstructor -> TypeConstructorMapping -> TypeVarMap -> Either RelationalError AtomType
180−atomTypeForTypeConstructorValidate _ (PrimitiveTypeConstructor _ aType) _ _ = Right aType
138+atomTypeForTypeConstructor (PrimitiveTypeConstructor _ aType) _ _ = Right aType
181−atomTypeForTypeConstructorValidate validate (TypeVariable tvname) _ tvMap = case M.lookup tvname tvMap of
139+atomTypeForTypeConstructor (TypeVariable tvname) _ tvMap = case M.lookup tvname tvMap of
182− Nothing -> if validate then
183− Left (TypeConstructorTypeVarMissing tvname)
184− else
185− pure (TypeVariableType tvname)
140+ Nothing -> Right (TypeVariableType tvname)
186 Just typ -> Right typ
141 Just typ -> Right typ
187−atomTypeForTypeConstructorValidate _ (RelationAtomTypeConstructor attrExprs) tConsMap tvMap = do
188− resolvedAtomTypes <- mapM (\expr -> atomTypeForAttributeExpr expr tConsMap tvMap) attrExprs
189− let attrs = zipWith Attribute (map AE.attributeName attrExprs) resolvedAtomTypes
190− pure (RelationAtomType (A.attributesFromList attrs))
191−atomTypeForTypeConstructorValidate val tCons tConss tvMap = case findTypeConstructor (TC.name tCons) tConss of
142+atomTypeForTypeConstructor tCons tConss tvMap = case findTypeConstructor (TC.name tCons) tConss of
192 Nothing -> Left (NoSuchTypeConstructorError (TC.name tCons))
143 Nothing -> Left (NoSuchTypeConstructorError (TC.name tCons))
193− Just (PrimitiveTypeConstructorDef _ aType, _) -> Right aType
194 Just (tConsDef, _) -> do
144 Just (tConsDef, _) -> do
195− tConsArgTypes <- mapM (\tConsArg -> atomTypeForTypeConstructorValidate val tConsArg tConss tvMap) (TC.arguments tCons)
145+ tConsArgTypes <- mapM (\tConsArg -> atomTypeForTypeConstructor tConsArg tConss tvMap) (TC.arguments tCons)
196− let pVarNames = TCD.typeVars tConsDef
146+ let pVarNames = TCD.typeVars tConsDef
197− tConsArgs = M.fromList (zip pVarNames tConsArgTypes)
147+ tConsArgs = M.fromList (zip pVarNames tConsArgTypes)
198− Right (ConstructedAtomType (TC.name tCons) tConsArgs)
148+ Right (ConstructedAtomType (TC.name tCons) tConsArgs)
199−
200−
201−atomTypeForAttributeExpr :: AttributeExprBase a -> TypeConstructorMapping -> TypeVarMap -> Either RelationalError AtomType
202−atomTypeForAttributeExpr (NakedAttributeExpr attr) _ _ = pure (A.atomType attr)
203−atomTypeForAttributeExpr (AttributeAndTypeNameExpr _ tCons _) tConsMap tvMap = atomTypeForTypeConstructorValidate True tCons tConsMap tvMap
204−
205−--reconcile the atom-in types with the type constructors
206−isValidAtomTypeForTypeConstructor :: AtomType -> TypeConstructor -> TypeConstructorMapping -> Either RelationalError ()
207−isValidAtomTypeForTypeConstructor aType (PrimitiveTypeConstructor _ expectedAType) _ = if expectedAType /= aType then Left (AtomTypeMismatchError expectedAType aType) else pure ()
208−
209−--lookup constructor name and check if the incoming atom types are valid
210−isValidAtomTypeForTypeConstructor (ConstructedAtomType tConsName _) (ADTypeConstructor expectedTConsName _) _ = if tConsName /= expectedTConsName then Left (TypeConstructorNameMismatch expectedTConsName tConsName) else pure ()
211−
212−isValidAtomTypeForTypeConstructor (RelationAtomType attrs) (RelationAtomTypeConstructor attrExprs) tConsMap = do
213− evaldAtomTypes <- mapM (\expr -> atomTypeForAttributeExpr expr tConsMap M.empty) attrExprs
214− mapM_ (uncurry resolveAtomType) (zip (A.atomTypesList attrs) evaldAtomTypes)
215−isValidAtomTypeForTypeConstructor aType tCons _ = Left (AtomTypeTypeConstructorReconciliationError aType (TC.name tCons))
216
149
217findTypeConstructor :: TypeConstructorName -> TypeConstructorMapping -> Maybe (TypeConstructorDef, [DataConstructorDef])
150findTypeConstructor :: TypeConstructorName -> TypeConstructorMapping -> Maybe (TypeConstructorDef, [DataConstructorDef])
218findTypeConstructor name = foldr tConsFolder Nothing
151findTypeConstructor name = foldr tConsFolder Nothing
@@ -221,30 +154,17 @@ findTypeConstructor name = foldr tConsFolder Nothing
221 Just (tCons, dConsList)
154 Just (tCons, dConsList)
222 else
155 else
223 accum
156 accum
224−
157+
225−resolveAttributes :: Attribute -> Attribute -> Either RelationalError Attribute
226−resolveAttributes attrA attrB =
227− if A.attributeName attrA /= A.attributeName attrB then
228− Left $ AttributeNamesMismatchError (S.fromList (map A.attributeName [attrA, attrB]))
229− else
230− Attribute (A.attributeName attrA) <$> resolveAtomType (A.atomType attrA) (A.atomType attrB)
231−
232−--given two atom types, try to resolve type variables
233resolveAtomType :: AtomType -> AtomType -> Either RelationalError AtomType
158resolveAtomType :: AtomType -> AtomType -> Either RelationalError AtomType
234−resolveAtomType (ConstructedAtomType tConsName resolvedTypeVarMap) (ConstructedAtomType _ unresolvedTypeVarMap) =
159+resolveAtomType (ConstructedAtomType tConsName resolvedTypeVarMap) (ConstructedAtomType _ unresolvedTypeVarMap) = do
235− ConstructedAtomType tConsName <$> resolveAtomTypesInTypeVarMap resolvedTypeVarMap unresolvedTypeVarMap
160+ tVarMap <- resolveAtomTypesInTypeVarMap resolvedTypeVarMap unresolvedTypeVarMap
161+ pure (ConstructedAtomType tConsName tVarMap)
236resolveAtomType typeFromRelation unresolvedType = if typeFromRelation == unresolvedType then
162resolveAtomType typeFromRelation unresolvedType = if typeFromRelation == unresolvedType then
237 Right typeFromRelation
163 Right typeFromRelation
238 else
164 else
239 Left (AtomTypeMismatchError typeFromRelation unresolvedType)
165 Left (AtomTypeMismatchError typeFromRelation unresolvedType)
240
166
241−{-
242−--walk an `AtomType` and apply the type variables in the map
243−resolveAtomTypeVars :: TypeVarMap -> AtomType -> AtomType
244−resolveAtomTypeVars tvMap typ@(TypeVariableType nam) = fromMaybe typ (M.lookup nam tvMap)
245−resolveAtomTypeVars tvMap (RelationAtomType relAttrs) =
246−-}
247−-- this could be optimized to reduce new tuple creation
167+-- this could be optimized to reduce new tuple creation- if anyatomtype does not appear, just return the original typevarmap
248resolveAtomTypesInTypeVarMap :: TypeVarMap -> TypeVarMap -> Either RelationalError TypeVarMap
168resolveAtomTypesInTypeVarMap :: TypeVarMap -> TypeVarMap -> Either RelationalError TypeVarMap
249resolveAtomTypesInTypeVarMap resolvedTypeMap unresolvedTypeMap = do
169resolveAtomTypesInTypeVarMap resolvedTypeMap unresolvedTypeMap = do
250 {-
170 {-
@@ -260,42 +180,29 @@ resolveAtomTypesInTypeVarMap resolvedTypeMap unresolvedTypeMap = do
260 let resolveTypePair resKey resType =
180 let resolveTypePair resKey resType =
261 -- if the key is missing in the unresolved type map, then fill it in with the value from the resolved map
181 -- if the key is missing in the unresolved type map, then fill it in with the value from the resolved map
262 case M.lookup resKey unresolvedTypeMap of
182 case M.lookup resKey unresolvedTypeMap of
263− Just unresType -> case unresType of
183+ Just unresType -> case unresType of
264 --do we need to recurse for RelationAtomType?
184 --do we need to recurse for RelationAtomType?
265 subType@(ConstructedAtomType _ _) -> do
185 subType@(ConstructedAtomType _ _) -> do
266 resSubType <- resolveAtomType resType subType
186 resSubType <- resolveAtomType resType subType
267 pure (resKey, resSubType)
187 pure (resKey, resSubType)
268− TypeVariableType _ -> pure (resKey, resType)
188+ otherType -> pure (resKey, otherType)
269− typ -> if typ == resType then
270− pure (resKey, resType)
271− else
272− Left $ AtomTypeMismatchError typ resType
273 Nothing ->
189 Nothing ->
274 pure (resKey, resType) --swipe the missing type var from the expected map
190 pure (resKey, resType) --swipe the missing type var from the expected map
275 tVarList <- mapM (uncurry resolveTypePair) (M.toList resolvedTypeMap)
191 tVarList <- mapM (uncurry resolveTypePair) (M.toList resolvedTypeMap)
276 pure (M.fromList tVarList)
192 pure (M.fromList tVarList)
277
193
278-- | See notes at `resolveTypesInTuple`. The typeFromRelation must not include any wildcards.
194-- | See notes at `resolveTypesInTuple`. The typeFromRelation must not include any wildcards.
279−resolveTypeInAtom :: AtomType -> Atom -> TypeConstructorMapping -> Either RelationalError Atom
195+resolveTypeInAtom :: AtomType -> Atom -> Either RelationalError Atom
280−resolveTypeInAtom typeFromRelation@(ConstructedAtomType _ tvMap) atomIn@(ConstructedAtom dConsName _ args) tConss = do
196+resolveTypeInAtom typeFromRelation atomIn@(ConstructedAtom dConsName _ args) = do
281 newType <- resolveAtomType typeFromRelation (atomTypeForAtom atomIn)
197 newType <- resolveAtomType typeFromRelation (atomTypeForAtom atomIn)
282− case findDataConstructor dConsName tConss of
283− Nothing -> -- the atom may have been constructed using a constructor function without a public data constructor, no further resolution is possible
284− pure atomIn
285− Just (_, dConsDef) -> do
286− atomArgTypes <- resolvedAtomTypesForDataConstructorDefArgs tConss tvMap dConsDef
287− newArgs <- mapM (\(atom, atomTyp) -> resolveTypeInAtom atomTyp atom tConss) (zip args atomArgTypes)
288− pure (ConstructedAtom dConsName newType newArgs)
198+ pure (ConstructedAtom dConsName newType args)
289−resolveTypeInAtom (RelationAtomType attrs) (RelationAtom (Relation _ tupSet)) tConss = do
290− let newTups = mapM (resolveTypesInTuple attrs tConss) (asList tupSet)
291− RelationAtom . Relation attrs . RelationTupleSet <$> newTups
292−resolveTypeInAtom _ atom _ = Right atom
199+resolveTypeInAtom _ atom = Right atom
293
200
294-- | When creating a tuple, the data constructor may not complete the type constructor arguments, so the wildcard "TypeVar x" fills in the type constructor's argument. The tuple type must be resolved before it can be part of a relation, however.
201-- | When creating a tuple, the data constructor may not complete the type constructor arguments, so the wildcard "TypeVar x" fills in the type constructor's argument. The tuple type must be resolved before it can be part of a relation, however.
295-- Example: "Nothing" does not specify the the argument in "Maybe a", so allow delayed resolution in the tuple before it is added to the relation. Note that this resolution could cause a type error. Hardly a Hindley-Milner system.
202-- Example: "Nothing" does not specify the the argument in "Maybe a", so allow delayed resolution in the tuple before it is added to the relation. Note that this resolution could cause a type error. Hardly a Hindley-Milner system.
296−resolveTypesInTuple :: Attributes -> TypeConstructorMapping -> RelationTuple -> Either RelationalError RelationTuple
203+resolveTypesInTuple :: Attributes -> RelationTuple -> Either RelationalError RelationTuple
297−resolveTypesInTuple resolvedAttrs tConss (RelationTuple _ tupAtoms) = do
204+resolveTypesInTuple resolvedAttrs (RelationTuple _ tupAtoms) = do
298− newAtoms <- mapM (\(atom, resolvedType) -> resolveTypeInAtom resolvedType atom tConss) (zip (V.toList tupAtoms) $ A.atomTypesList resolvedAttrs)
205+ newAtoms <- mapM (\(atom, resolvedType) -> resolveTypeInAtom resolvedType atom) (zip (V.toList tupAtoms) $ map A.atomType (V.toList resolvedAttrs))
299 Right (RelationTuple resolvedAttrs (V.fromList newAtoms))
206 Right (RelationTuple resolvedAttrs (V.fromList newAtoms))
300
207
301-- | Validate that the type is provided with complete type variables for type constructors.
208-- | Validate that the type is provided with complete type variables for type constructors.
@@ -310,38 +217,12 @@ validateAtomType typ@(ConstructedAtomType tConsName tVarMap) tConss =
310 if not (S.null diff) then
217 if not (S.null diff) then
311 Left $ TypeConstructorTypeVarsMismatch expectedTyVarNames actualTyVarNames
218 Left $ TypeConstructorTypeVarsMismatch expectedTyVarNames actualTyVarNames
312 else
219 else
313− validateTypeVarMap tVarMap tConss
220+ Right ()
314− _ -> Right ()
221+ _ -> Right ()
315−validateAtomType (RelationAtomType attrs) tConss =
222+validateAtomType _ _ = Right ()
316− mapM_ (\attr ->
317− validateAtomType (A.atomType attr) tConss) (attributesVec attrs)
318−validateAtomType (TypeVariableType x) _ = Left (TypeConstructorTypeVarMissing x)
319−validateAtomType _ _ = pure ()
320−
321−validateAttributes :: TypeConstructorMapping -> Attributes -> Either RelationalError ()
322−validateAttributes tConss attrs =
323− if not (null errs) then
324− Left (someErrors errs)
325− else
326− pure ()
327− where
328− errs = lefts $ map (`validateAtomType` tConss) (A.atomTypesList attrs)
329−
330−--ensure that all type vars are fully resolved
331−validateTypeVarMap :: TypeVarMap -> TypeConstructorMapping -> Either RelationalError ()
332−validateTypeVarMap tvMap tConss = mapM_ (`validateAtomType` tConss) $ M.elems tvMap
333
223
334validateTuple :: RelationTuple -> TypeConstructorMapping -> Either RelationalError ()
224validateTuple :: RelationTuple -> TypeConstructorMapping -> Either RelationalError ()
335−validateTuple (RelationTuple _ atoms) tConss = mapM_ (`validateAtom` tConss) atoms
225+validateTuple (RelationTuple _ atoms) tConss = mapM_ (\a -> validateAtomType (atomTypeForAtom a) tConss) atoms
336−
337−--ensure that all types are fully resolved
338−validateAtom :: Atom -> TypeConstructorMapping -> Either RelationalError ()
339−validateAtom (RelationAtom (Relation _ tupSet)) tConss = mapM_ (`validateTuple` tConss) (asList tupSet)
340−validateAtom (ConstructedAtom _ dConsType atomArgs) tConss = do
341− validateAtomType dConsType tConss
342− mapM_ (`validateAtom` tConss) atomArgs
343−validateAtom _ _ = pure ()
344−
345
226
346-- | Determine if two types are equal or compatible (including special handling for TypeVar x).
227-- | Determine if two types are equal or compatible (including special handling for TypeVar x).
347atomTypeVerify :: AtomType -> AtomType -> Either RelationalError AtomType
228atomTypeVerify :: AtomType -> AtomType -> Either RelationalError AtomType
@@ -358,8 +239,9 @@ atomTypeVerify x@(RelationAtomType attrs1) y@(RelationAtomType attrs2) = do
358 if notElem "_" [name1, name2] && name1 /= name2 then
239 if notElem "_" [name1, name2] && name1 /= name2 then
359 Left $ AtomTypeMismatchError x y
240 Left $ AtomTypeMismatchError x y
360 else
241 else
361− atomTypeVerify (A.atomType attr1) (A.atomType attr2)) $ V.toList (V.zip (attributesVec attrs1) (attributesVec attrs2))
242+ atomTypeVerify (A.atomType attr1) (A.atomType attr2)) $ V.toList (V.zip attrs1 attrs2)
362 return x
243 return x
244+atomTypeVerify (IntervalAtomType typA) (IntervalAtomType typB) = atomTypeVerify typA typB
363atomTypeVerify x y = if x == y then
245atomTypeVerify x y = if x == y then
364 Right x
246 Right x
365 else
247 else
@@ -367,26 +249,20 @@ atomTypeVerify x y = if x == y then
367
249
368-- | Determine if two typeVars are logically compatible.
250-- | Determine if two typeVars are logically compatible.
369typeVarMapsVerify :: TypeVarMap -> TypeVarMap -> Bool
251typeVarMapsVerify :: TypeVarMap -> TypeVarMap -> Bool
370−typeVarMapsVerify a b = M.keysSet a == M.keysSet b && (length . rights) zipped == M.size a
252+typeVarMapsVerify a b = M.keysSet a == M.keysSet b && (length . rights) (map (\((_,v1),(_,v2)) -> atomTypeVerify v1 v2) (zip (M.toAscList a) (M.toAscList b))) == M.size a
371− where
372− zipped = zipWith
373− (curry (\ ((_, v1), (_, v2)) -> atomTypeVerify v1 v2))
374− (M.toAscList a)
375− (M.toAscList b)
376
253
377prettyAtomType :: AtomType -> T.Text
254prettyAtomType :: AtomType -> T.Text
378−prettyAtomType (RelationAtomType attrs) = "relation {" `T.append` T.intercalate "," (map prettyAttribute (V.toList (attributesVec attrs))) `T.append` "}"
255+prettyAtomType (RelationAtomType attrs) = "relation {" `T.append` T.intercalate "," (map prettyAttribute (V.toList attrs)) `T.append` "}"
379prettyAtomType (ConstructedAtomType tConsName typeVarMap) = tConsName `T.append` T.concat (map showTypeVars (M.toList typeVarMap))
256prettyAtomType (ConstructedAtomType tConsName typeVarMap) = tConsName `T.append` T.concat (map showTypeVars (M.toList typeVarMap))
380 where
257 where
381− showTypeVars (_, TypeVariableType x) = " " <> x
382 showTypeVars (tyVarName, aType) = " (" `T.append` tyVarName `T.append` "::" `T.append` prettyAtomType aType `T.append` ")"
258 showTypeVars (tyVarName, aType) = " (" `T.append` tyVarName `T.append` "::" `T.append` prettyAtomType aType `T.append` ")"
383-- it would be nice to have the original ordering, but we don't have access to the type constructor here- maybe the typevarmap should be also positional (ordered map?)
259-- it would be nice to have the original ordering, but we don't have access to the type constructor here- maybe the typevarmap should be also positional (ordered map?)
384−prettyAtomType (TypeVariableType x) = x
260+prettyAtomType (TypeVariableType x) = "?TypeVariableType " <> x <> "?"
261+prettyAtomType (IntervalAtomType tv) = "Interval (" <> prettyAtomType tv <> ")"
385prettyAtomType aType = T.take (T.length fullName - T.length "AtomType") fullName
262prettyAtomType aType = T.take (T.length fullName - T.length "AtomType") fullName
386 where fullName = (T.pack . show) aType
263 where fullName = (T.pack . show) aType
387
264
388prettyAttribute :: Attribute -> T.Text
265prettyAttribute :: Attribute -> T.Text
389−prettyAttribute (Attribute _ (TypeVariableType x)) = x
390prettyAttribute attr = A.attributeName attr `T.append` "::" `T.append` prettyAtomType (A.atomType attr)
266prettyAttribute attr = A.attributeName attr `T.append` "::" `T.append` prettyAtomType (A.atomType attr)
391
267
392resolveTypeVariables :: [AtomType] -> [AtomType] -> Either RelationalError TypeVarMap
268resolveTypeVariables :: [AtomType] -> [AtomType] -> Either RelationalError TypeVarMap
@@ -406,6 +282,7 @@ resolveTypeVariables expectedArgTypes actualArgTypes = do
406
282
407resolveTypeVariable :: AtomType -> AtomType -> TypeVarMap
283resolveTypeVariable :: AtomType -> AtomType -> TypeVarMap
408resolveTypeVariable (TypeVariableType tv) typ = M.singleton tv typ
284resolveTypeVariable (TypeVariableType tv) typ = M.singleton tv typ
285+resolveTypeVariable (IntervalAtomType ityp) typ = resolveTypeVariable ityp typ
409resolveTypeVariable (ConstructedAtomType _ _) (ConstructedAtomType _ actualTvMap) = actualTvMap
286resolveTypeVariable (ConstructedAtomType _ _) (ConstructedAtomType _ actualTvMap) = actualTvMap
410resolveTypeVariable _ _ = M.empty
287resolveTypeVariable _ _ = M.empty
411
288
@@ -416,6 +293,7 @@ resolveFunctionReturnValue funcName tvMap (ConstructedAtomType tCons retMap) = d
416 pure (ConstructedAtomType tCons (M.intersection tvMap retMap))
293 pure (ConstructedAtomType tCons (M.intersection tvMap retMap))
417 else
294 else
418 Left (AtomFunctionTypeVariableResolutionError funcName (fst (head (M.toList diff))))
295 Left (AtomFunctionTypeVariableResolutionError funcName (fst (head (M.toList diff))))
296+resolveFunctionReturnValue funcName tvMap (IntervalAtomType tv) = IntervalAtomType <$> resolveFunctionReturnValue funcName tvMap tv
419resolveFunctionReturnValue funcName tvMap (TypeVariableType tvName) = case M.lookup tvName tvMap of
297resolveFunctionReturnValue funcName tvMap (TypeVariableType tvName) = case M.lookup tvName tvMap of
420 Nothing -> Left (AtomFunctionTypeVariableResolutionError funcName tvName)
298 Nothing -> Left (AtomFunctionTypeVariableResolutionError funcName tvName)
421 Just typ -> pure typ
299 Just typ -> pure typ
@@ -430,27 +308,3 @@ resolvedAtomTypeForDataConstructorDefArg tConsMap tvMap (DataConstructorDefTypeC
430resolvedAtomTypeForDataConstructorDefArg _ tvMap (DataConstructorDefTypeVarNameArg tvName) = case M.lookup tvName tvMap of
308resolvedAtomTypeForDataConstructorDefArg _ tvMap (DataConstructorDefTypeVarNameArg tvName) = case M.lookup tvName tvMap of
431 Nothing -> Left (DataConstructorUsesUndeclaredTypeVariable tvName)
309 Nothing -> Left (DataConstructorUsesUndeclaredTypeVariable tvName)
432 Just typ -> Right typ
310 Just typ -> Right typ
433−
434−isResolvedType :: AtomType -> Bool
435−isResolvedType typ =
436− case typ of
437− IntAtomType -> True
438− IntegerAtomType -> True
439− DoubleAtomType -> True
440− TextAtomType -> True
441− DayAtomType -> True
442− DateTimeAtomType -> True
443− ByteStringAtomType -> True
444− BoolAtomType -> True
445− RelationalExprAtomType -> True
446− RelationAtomType attrs -> isResolvedAttributes attrs
447− ConstructedAtomType _ tvMap -> all isResolvedType (M.elems tvMap)
448− TypeVariableType _ -> False
449−
450−isResolvedAttributes :: Attributes -> Bool
451−isResolvedAttributes attrs = all isResolvedAttribute (V.toList (attributesVec attrs))
452−
453−isResolvedAttribute :: Attribute -> Bool
454−isResolvedAttribute = isResolvedType . A.atomType
455−
456−--given two AtomTypes x,y
src/lib/ProjectM36/Atomable.hs+56−68
@@ -1,28 +1,39 @@
1{-# LANGUAGE DefaultSignatures, TypeFamilies, TypeOperators, PolyKinds, FlexibleInstances, ScopedTypeVariables, FlexibleContexts #-}
1{-# LANGUAGE DefaultSignatures, TypeFamilies, TypeOperators, PolyKinds, FlexibleInstances, ScopedTypeVariables, FlexibleContexts #-}
2−{-# OPTIONS_GHC -fno-warn-orphans #-}
3module ProjectM36.Atomable where
2module ProjectM36.Atomable where
4--http://stackoverflow.com/questions/13448361/type-families-with-ghc-generics-or-data-data
3--http://stackoverflow.com/questions/13448361/type-families-with-ghc-generics-or-data-data
5--instances to marshal Haskell ADTs to ConstructedAtoms and back
4--instances to marshal Haskell ADTs to ConstructedAtoms and back
6import ProjectM36.Base
5import ProjectM36.Base
6+import ProjectM36.DataTypes.Primitive
7import ProjectM36.DataTypes.List
7import ProjectM36.DataTypes.List
8−import ProjectM36.DataTypes.NonEmptyList
9import ProjectM36.DataTypes.Maybe
8import ProjectM36.DataTypes.Maybe
10import ProjectM36.DataTypes.Either
9import ProjectM36.DataTypes.Either
11import GHC.Generics
10import GHC.Generics
12import qualified Data.Map as M
11import qualified Data.Map as M
13import qualified Data.Text as T
12import qualified Data.Text as T
14−import qualified Data.Vector as V
15import Control.DeepSeq (NFData)
13import Control.DeepSeq (NFData)
14+import Data.Binary
16import Control.Applicative
15import Control.Applicative
17import Data.Time.Calendar
16import Data.Time.Calendar
18import Data.ByteString (ByteString)
17import Data.ByteString (ByteString)
19import Data.Time.Clock
18import Data.Time.Clock
19+import Data.Maybe
20import Data.Proxy
20import Data.Proxy
21−import qualified Data.List.NonEmpty as NE
22−import Codec.Winery
23
21
22+--also add haskell scripting atomable support
23+--rename this module to Atomable along with test
24+
25+{-
26+data Test1T = Test1C Int
27+ deriving (Generic, Show, Eq, Binary, NFData, Atomable)
28+
29+data Test2T = Test2C Int Int
30+ deriving (Generic, Show, Eq, Binary, NFData, Atomable)
31+
32+data Test3T = Test3Ca | Test3Cb
33+ deriving (Generic, Show, Eq, Binary, NFData, Atomable)
34+-}
24-- | All database values ("atoms") adhere to the 'Atomable' typeclass. This class is derivable allowing new datatypes to be easily marshaling between Haskell values and database values.
35-- | All database values ("atoms") adhere to the 'Atomable' typeclass. This class is derivable allowing new datatypes to be easily marshaling between Haskell values and database values.
25−class (Eq a, NFData a, Serialise a, Show a) => Atomable a where
36+class (Eq a, NFData a, Binary a, Show a) => Atomable a where
26 toAtom :: a -> Atom
37 toAtom :: a -> Atom
27 default toAtom :: (Generic a, AtomableG (Rep a)) => a -> Atom
38 default toAtom :: (Generic a, AtomableG (Rep a)) => a -> Atom
28 toAtom v = toAtomG (from v) (toAtomTypeG (from v))
39 toAtom v = toAtomG (from v) (toAtomTypeG (from v))
@@ -41,9 +52,9 @@ class (Eq a, NFData a, Serialise a, Show a) => Atomable a where
41 toAtomType _ = toAtomTypeG (from (undefined :: a))
52 toAtomType _ = toAtomTypeG (from (undefined :: a))
42
53
43 -- | Creates DatabaseContextExpr necessary to load the type constructor and data constructor into the database.
54 -- | Creates DatabaseContextExpr necessary to load the type constructor and data constructor into the database.
44− toAddTypeExpr :: proxy a -> DatabaseContextExpr
55+ toAddTypeExpr :: Proxy a -> DatabaseContextExpr
45 default toAddTypeExpr :: (Generic a, AtomableG (Rep a)) => proxy a -> DatabaseContextExpr
56 default toAddTypeExpr :: (Generic a, AtomableG (Rep a)) => proxy a -> DatabaseContextExpr
46− toAddTypeExpr _ = toAddTypeExprG (from (error "insufficient laziness" :: a)) (toAtomType (Proxy :: Proxy a))
57+ toAddTypeExpr _ = toAddTypeExprG (from (undefined :: a)) (toAtomType (Proxy :: Proxy a))
47
58
48instance Atomable Integer where
59instance Atomable Integer where
49 toAtom = IntegerAtom
60 toAtom = IntegerAtom
@@ -135,23 +146,15 @@ instance (Atomable a, Atomable b) => Atomable (Either a b) where
135--convert to ADT list
146--convert to ADT list
136instance Atomable a => Atomable [a] where
147instance Atomable a => Atomable [a] where
137 toAtom [] = ConstructedAtom "Empty" (listAtomType (toAtomType (Proxy :: Proxy a))) []
148 toAtom [] = ConstructedAtom "Empty" (listAtomType (toAtomType (Proxy :: Proxy a))) []
138− toAtom (x:xs) = ConstructedAtom "Cons" (listAtomType (toAtomType (Proxy :: Proxy a))) (toAtom x: [toAtom xs])
149+ toAtom (x:xs) = ConstructedAtom "Cons" (listAtomType (toAtomType (Proxy :: Proxy a))) (map toAtom (x:xs))
139
150
140 fromAtom (ConstructedAtom "Empty" _ _) = []
151 fromAtom (ConstructedAtom "Empty" _ _) = []
141− fromAtom (ConstructedAtom "Cons" _ [x,y]) = fromAtom x:fromAtom y
152+ fromAtom (ConstructedAtom "Cons" _ (x:xs)) = fromAtom x:map fromAtom xs
142 fromAtom _ = error "improper fromAtom [a]"
153 fromAtom _ = error "improper fromAtom [a]"
143
154
144 toAtomType _ = ConstructedAtomType "List" (M.singleton "a" (toAtomType (Proxy :: Proxy a)))
155 toAtomType _ = ConstructedAtomType "List" (M.singleton "a" (toAtomType (Proxy :: Proxy a)))
145 toAddTypeExpr _ = NoOperation
156 toAddTypeExpr _ = NoOperation
146
157
147−instance Atomable a => Atomable (NE.NonEmpty a) where
148− toAtom (x NE.:| []) = ConstructedAtom "NECons" (nonEmptyListAtomType (toAtomType (Proxy :: Proxy a))) [toAtom x]
149− toAtom (x NE.:| xs) = ConstructedAtom "NECons" (nonEmptyListAtomType (toAtomType (Proxy :: Proxy a))) (map toAtom (x:xs))
150− fromAtom _ = error "improper fromAtom (NonEmptyList a)"
151−
152− toAtomType _ = ConstructedAtomType "NonEmptyList" (M.singleton "a" (toAtomType (Proxy :: Proxy a)))
153− toAddTypeExpr _ = NoOperation
154−
155-- Generics
158-- Generics
156class AtomableG g where
159class AtomableG g where
157 --type AtomTG g
160 --type AtomTG g
@@ -167,17 +170,17 @@ class AtomableG g where
167instance (Datatype c, AtomableG a) => AtomableG (M1 D c a) where
170instance (Datatype c, AtomableG a) => AtomableG (M1 D c a) where
168 toAtomG (M1 v) = toAtomG v
171 toAtomG (M1 v) = toAtomG v
169 fromAtomG atom args = M1 <$> fromAtomG atom args
172 fromAtomG atom args = M1 <$> fromAtomG atom args
170− toAtomsG = error "invalid toAtomsG in M1 D"
173+ toAtomsG = undefined
171 toAtomTypeG _ = ConstructedAtomType (T.pack typeName) M.empty -- generics don't allow us to get the type constructor variables- alternatives?
174 toAtomTypeG _ = ConstructedAtomType (T.pack typeName) M.empty -- generics don't allow us to get the type constructor variables- alternatives?
172 where
175 where
173 typeName = datatypeName (undefined :: M1 D c a x)
176 typeName = datatypeName (undefined :: M1 D c a x)
174− toAddTypeExprG ~(M1 v) (ConstructedAtomType tcName _) = AddTypeConstructor tcDef dataConstructors
177+ toAddTypeExprG (M1 v) (ConstructedAtomType tcName _) = AddTypeConstructor tcDef dataConstructors
175 where
178 where
176 tcDef = ADTypeConstructorDef tcName []
179 tcDef = ADTypeConstructorDef tcName []
177 dataConstructors = getConstructorsG v
180 dataConstructors = getConstructorsG v
178 toAddTypeExprG _ _ = NoOperation
181 toAddTypeExprG _ _ = NoOperation
179− getConstructorsG ~(M1 v) = getConstructorsG v
182+ getConstructorsG (M1 v) = getConstructorsG v
180− getConstructorArgsG = error "invalid getConstructorArgsG in M1 D"
183+ getConstructorArgsG = undefined
181
184
182--constructor metadata
185--constructor metadata
183instance (Constructor c, AtomableG a) => AtomableG (M1 C c a) where
186instance (Constructor c, AtomableG a) => AtomableG (M1 C c a) where
@@ -192,11 +195,11 @@ instance (Constructor c, AtomableG a) => AtomableG (M1 C c a) where
192 Nothing
195 Nothing
193 where
196 where
194 dName = T.pack (conName (undefined :: M1 C c a x))
197 dName = T.pack (conName (undefined :: M1 C c a x))
195− fromAtomG _ _ = error "invalid fromAtomG in M1 C"
198+ fromAtomG _ _ = error "unsupported generic traversal"
196− toAtomsG = error "invalid toAtomsG in M1 C"
199+ toAtomsG = undefined
197− toAtomTypeG = error "invalid toAtomTypeG in M1 C"
200+ toAtomTypeG = undefined
198− toAddTypeExprG = error "invalid toAddTypeExprG in M1 C"
201+ toAddTypeExprG = undefined
199− getConstructorsG ~(M1 v) = [DataConstructorDef (T.pack dName) dArgs]
202+ getConstructorsG (M1 v) = [DataConstructorDef (T.pack dName) dArgs]
200 where
203 where
201 dName = conName (undefined :: M1 C c a x)
204 dName = conName (undefined :: M1 C c a x)
202 dArgs = getConstructorArgsG v
205 dArgs = getConstructorArgsG v
@@ -208,9 +211,9 @@ instance (Selector c, AtomableG a) => AtomableG (M1 S c a) where
208 fromAtomG atom args = M1 <$> fromAtomG atom args
211 fromAtomG atom args = M1 <$> fromAtomG atom args
209 toAtomsG (M1 v) = toAtomsG v
212 toAtomsG (M1 v) = toAtomsG v
210 toAtomTypeG (M1 v) = toAtomTypeG v
213 toAtomTypeG (M1 v) = toAtomTypeG v
211− toAddTypeExprG = error "invalid toAddTypeExprG in M1 S"
214+ toAddTypeExprG _ _ = undefined
212− getConstructorsG = error "invalid getConstructorsG in M1 S"
215+ getConstructorsG = undefined
213− getConstructorArgsG ~(M1 v) = getConstructorArgsG v
216+ getConstructorArgsG (M1 v) = getConstructorArgsG v
214
217
215-- field data metadata
218-- field data metadata
216instance (Atomable a) => AtomableG (K1 c a) where
219instance (Atomable a) => AtomableG (K1 c a) where
@@ -220,63 +223,48 @@ instance (Atomable a) => AtomableG (K1 c a) where
220 headatom [] = error "no more atoms for constructor!"
223 headatom [] = error "no more atoms for constructor!"
221 toAtomsG (K1 v) = [toAtom v]
224 toAtomsG (K1 v) = [toAtom v]
222 toAtomTypeG _ = toAtomType (Proxy :: Proxy a)
225 toAtomTypeG _ = toAtomType (Proxy :: Proxy a)
223− toAddTypeExprG = error "invalid toAddTypeExprG in K1"
226+ toAddTypeExprG _ _ = undefined
224− getConstructorsG = error "invalid getConstructorsG in K1"
227+ getConstructorsG = undefined
225− getConstructorArgsG ~(K1 _) = [DataConstructorDefTypeConstructorArg tCons]
228+ getConstructorArgsG (K1 _) = [DataConstructorDefTypeConstructorArg tCons]
226 where
229 where
230+ tCons = PrimitiveTypeConstructor primitiveATypeName primitiveAType
227− tCons = typeToTypeConstructor $ toAtomType (Proxy :: Proxy a)
231+ primitiveAType = toAtomType (Proxy :: Proxy a)
228−
232+ primitiveATypeName = fromMaybe (error ("primitive type missing: " ++ show primitiveAType)) (foldr (\(PrimitiveTypeConstructorDef name typ, _) _ -> if typ == primitiveAType then Just name else Nothing) Nothing primitiveTypeConstructorMapping)
229−typeToTypeConstructor :: AtomType -> TypeConstructor
233+
230−typeToTypeConstructor x@IntAtomType = PrimitiveTypeConstructor "Int" x
231−typeToTypeConstructor x@IntegerAtomType = PrimitiveTypeConstructor "Integer" x
232−typeToTypeConstructor x@DoubleAtomType = PrimitiveTypeConstructor "Double" x
233−typeToTypeConstructor x@TextAtomType = PrimitiveTypeConstructor "Text" x
234−typeToTypeConstructor x@DayAtomType = PrimitiveTypeConstructor "Day" x
235−typeToTypeConstructor x@DateTimeAtomType = PrimitiveTypeConstructor "DateTime" x
236−typeToTypeConstructor x@ByteStringAtomType = PrimitiveTypeConstructor "ByteString" x
237−typeToTypeConstructor x@BoolAtomType = PrimitiveTypeConstructor "Bool" x
238−typeToTypeConstructor x@RelationalExprAtomType = PrimitiveTypeConstructor "RelationalExpr" x
239−typeToTypeConstructor (RelationAtomType attrs)
240− = RelationAtomTypeConstructor $ map attrToAttrExpr $ V.toList (attributesVec attrs)
241− where
242− attrToAttrExpr (Attribute n t) = AttributeAndTypeNameExpr n (typeToTypeConstructor t) ()
243−typeToTypeConstructor (ConstructedAtomType tcName tvMap)
244− = ADTypeConstructor tcName $ map typeToTypeConstructor (M.elems tvMap)
245−typeToTypeConstructor (TypeVariableType tvName) = TypeVariable tvName
246−
247instance AtomableG U1 where
234instance AtomableG U1 where
248− toAtomG = error "invalid toAtomG in U1"
235+ toAtomG = undefined
249 fromAtomG _ _ = pure U1
236 fromAtomG _ _ = pure U1
250 toAtomsG _ = []
237 toAtomsG _ = []
251− toAtomTypeG = error "invalid toAtomTypeG in U1"
238+ toAtomTypeG = undefined
252− toAddTypeExprG = error "invalid toAddTypeExprG in U1"
239+ toAddTypeExprG = undefined
253− getConstructorsG = error "invalid getConstructorsG in U1"
240+ getConstructorsG = undefined
254 getConstructorArgsG _ = []
241 getConstructorArgsG _ = []
255
242
256-- product types
243-- product types
257instance (AtomableG a, AtomableG b) => AtomableG (a :*: b) where
244instance (AtomableG a, AtomableG b) => AtomableG (a :*: b) where
258 toAtomG = undefined
245 toAtomG = undefined
259− fromAtomG atom args = (:*:) <$> fromAtomG atom splitargs1 <*> fromAtomG atom splitargs2
246+ fromAtomG atom args = (:*:) <$> fromAtomG atom [headatom args] <*> fromAtomG atom (tailatoms args)
260− where splitargs1 = take splitpoint args
247+ where headatom (x:_) = x
261− splitargs2 = drop splitpoint args
248+ headatom [] = error "no more atoms in head for product!"
262− splitpoint = length args `div` 2
249+ tailatoms (_:xs) = xs
263− toAtomTypeG = error "invalid toAtomTypeG in :*:"
250+ tailatoms [] = error "no more atoms in tail for product!"
251+ toAtomTypeG = undefined
264 toAtomsG (x :*: y) = toAtomsG x ++ toAtomsG y
252 toAtomsG (x :*: y) = toAtomsG x ++ toAtomsG y
265− toAddTypeExprG = error "invalid toAddTypeExprG in :*:"
253+ toAddTypeExprG _ _ = undefined
266− getConstructorsG = error "invalid getConstructorsG in :*:"
254+ getConstructorsG = undefined
267− getConstructorArgsG ~(x :*: y) = getConstructorArgsG x ++ getConstructorArgsG y
255+ getConstructorArgsG (x :*: y) = getConstructorArgsG x ++ getConstructorArgsG y
268
256
269-- sum types
257-- sum types
270instance (AtomableG a, AtomableG b) => AtomableG (a :+: b) where
258instance (AtomableG a, AtomableG b) => AtomableG (a :+: b) where
271 toAtomG (L1 x) = toAtomG x
259 toAtomG (L1 x) = toAtomG x
272 toAtomG (R1 x) = toAtomG x
260 toAtomG (R1 x) = toAtomG x
273 fromAtomG atom args = (L1 <$> fromAtomG atom args) <|> (R1 <$> fromAtomG atom args)
261 fromAtomG atom args = (L1 <$> fromAtomG atom args) <|> (R1 <$> fromAtomG atom args)
274− toAtomTypeG = error "invalid toAtomTypeG in :+:"
262+ toAtomTypeG = undefined
275 toAtomsG (L1 x) = toAtomsG x
263 toAtomsG (L1 x) = toAtomsG x
276 toAtomsG (R1 x) = toAtomsG x
264 toAtomsG (R1 x) = toAtomsG x
277− toAddTypeExprG = error "invalid toAddTypeExprG in :+:"
265+ toAddTypeExprG _ _ = undefined
278 getConstructorsG _ = getConstructorsG (undefined :: a x) ++ getConstructorsG (undefined :: b x)
266 getConstructorsG _ = getConstructorsG (undefined :: a x) ++ getConstructorsG (undefined :: b x)
279− getConstructorArgsG = error "invalid getConstructorArgsG in :+:"
267+ getConstructorArgsG = undefined
280
268
281--this represents the unimplemented generics traversals which should never be called
269--this represents the unimplemented generics traversals which should never be called
282{-
270{-
src/lib/ProjectM36/Attribute.hs+29−155
@@ -1,4 +1,3 @@
1−{-# OPTIONS_GHC -fno-warn-orphans #-}
2module ProjectM36.Attribute where
1module ProjectM36.Attribute where
3import ProjectM36.Base
2import ProjectM36.Base
4import ProjectM36.Error
3import ProjectM36.Error
@@ -8,57 +7,18 @@ import qualified Data.Vector as V
8import qualified Data.Hashable as Hash
7import qualified Data.Hashable as Hash
9import qualified Data.HashSet as HS
8import qualified Data.HashSet as HS
10import qualified Data.Map as M
9import qualified Data.Map as M
11−import Data.Either
12
10
13arity :: Attributes -> Int
11arity :: Attributes -> Int
14−arity a = V.length (attributesVec a)
12+arity = V.length
15−
16−instance Semigroup Attributes where
17− attrsA <> attrsB =
18− case joinAttributes attrsA attrsB of
19− Left err -> error (show err)
20− Right attrs' -> attrs'
21−
22−instance Monoid Attributes where
23− mempty = Attributes {
24− attributesVec = mempty
25− --,attributeSet = mempty
26− }
27
13
28emptyAttributes :: Attributes
14emptyAttributes :: Attributes
29−emptyAttributes = mempty
15+emptyAttributes = V.empty
30
16
31null :: Attributes -> Bool
17null :: Attributes -> Bool
32−null a = V.null (attributesVec a)
18+null = V.null
33−
34−singleton :: Attribute -> Attributes
35−singleton attr = Attributes {
36− attributesVec = V.singleton attr
37− --,attributesSet = HS.singleton attr
38− }
39−
40−toList :: Attributes -> [Attribute]
41−toList attrs = V.toList (attributesVec attrs)
42
19
43attributesFromList :: [Attribute] -> Attributes
20attributesFromList :: [Attribute] -> Attributes
44−attributesFromList attrsL = Attributes {
21+attributesFromList = V.fromList -- . L.nub --too expensive
45− attributesVec = vec
46− --,attributesSet = hset
47− }
48− where
49− vec = if length attrsL == HS.size hset then
50− --fast path- no duplicates
51− V.fromList attrsL
52− else
53− --duplicate detected, uniqueify while maintaining original ordering
54− V.fromList uniquedL
55− hset = HS.fromList attrsL
56− uniquedL = fst $ foldr (\attr acc@(l,s) ->
57− if HS.member attr s then
58− acc
59− else
60− (l ++ [attr], HS.insert attr s))
61− ([],mempty) attrsL
62
22
63attributeName :: Attribute -> AttributeName
23attributeName :: Attribute -> AttributeName
64attributeName (Attribute name _) = name
24attributeName (Attribute name _) = name
@@ -67,16 +27,14 @@ atomType :: Attribute -> AtomType
67atomType (Attribute _ atype) = atype
27atomType (Attribute _ atype) = atype
68
28
69atomTypes :: Attributes -> V.Vector AtomType
29atomTypes :: Attributes -> V.Vector AtomType
70−atomTypes attrs = V.map atomType (attributesVec attrs)
30+atomTypes = V.map atomType
71−
72−atomTypesList :: Attributes -> [AtomType]
73−atomTypesList = V.toList . atomTypes
74
31
32+--hm- no error-checking here
75addAttribute :: Attribute -> Attributes -> Attributes
33addAttribute :: Attribute -> Attributes -> Attributes
76−addAttribute attr attrs = attrs <> singleton attr
34+addAttribute attr attrs = attrs `V.snoc` attr
77
35
78--if some attribute names overlap but the types do not, then spit back an error
36--if some attribute names overlap but the types do not, then spit back an error
79−{-joinAttributes :: Attributes -> Attributes -> Either RelationalError Attributes
37+joinAttributes :: Attributes -> Attributes -> Either RelationalError Attributes
80joinAttributes attrs1 attrs2 | V.length uniqueOverlappingAttributes /= V.length overlappingAttributes = Left (TupleAttributeTypeMismatchError overlappingAttributes)
38joinAttributes attrs1 attrs2 | V.length uniqueOverlappingAttributes /= V.length overlappingAttributes = Left (TupleAttributeTypeMismatchError overlappingAttributes)
81 | V.length overlappingAttrsDifferentTypes > 0 = Left (TupleAttributeTypeMismatchError overlappingAttrsDifferentTypes)
39 | V.length overlappingAttrsDifferentTypes > 0 = Left (TupleAttributeTypeMismatchError overlappingAttrsDifferentTypes)
82 | otherwise = Right $ vectorUniqueify (attrs1 V.++ attrs2)
40 | otherwise = Right $ vectorUniqueify (attrs1 V.++ attrs2)
@@ -85,52 +43,20 @@ joinAttributes attrs1 attrs2 | V.length uniqueOverlappingAttributes /= V.length
85 attrNames2 = V.map attributeName attrs2
43 attrNames2 = V.map attributeName attrs2
86 uniqueOverlappingAttributes = vectorUniqueify overlappingAttributes
44 uniqueOverlappingAttributes = vectorUniqueify overlappingAttributes
87 overlappingAttributes = V.filter (`V.elem` attrs2) attrs1
45 overlappingAttributes = V.filter (`V.elem` attrs2) attrs1
88−-}
89−joinAttributes :: Attributes -> Attributes -> Either RelationalError Attributes
90−joinAttributes attrs1 attrs2
91− | S.size overlappingNames == 0 = -- fast path, no overlapping names
92− pure (concated id)
93− | attributesForNames overlappingNames attrs1 == attributesForNames overlappingNames attrs2 = -- that atomtypes match
94− pure (concated vectorUniqueify)
95− | otherwise =
96− --special handling to validate that overlapping names have the same atom types
97− Left (TupleAttributeTypeMismatchError (attributesForNames overlappingNames attrs1))
98− where
99− nameSet1 = attributeNameSet attrs1
100− nameSet2 = attributeNameSet attrs2
101− overlappingNames = S.intersection nameSet1 nameSet2
102− concated f = Attributes {
103− attributesVec = f (attributesVec attrs1 <> attributesVec attrs2)
104− --,attributesSet = attributesSet attrs1 <> attributesSet attrs2
105− }
106
46
107addAttributes :: Attributes -> Attributes -> Attributes
47addAttributes :: Attributes -> Attributes -> Attributes
108−addAttributes = (<>)
48+addAttributes = (V.++)
109−
110−member :: Attribute -> Attributes -> Bool
111−member attr attrs = HS.member attr (attributesSet attrs)
112
49
113deleteAttributeName :: AttributeName -> Attributes -> Attributes
50deleteAttributeName :: AttributeName -> Attributes -> Attributes
114−deleteAttributeName attrName = deleteAttributeNames (S.singleton attrName)
51+deleteAttributeName attrName = V.filter (\attr -> attributeName attr /= attrName)
115−
116−deleteAttributeNames :: S.Set AttributeName -> Attributes -> Attributes
117−deleteAttributeNames attrNames attrs = Attributes {
118− attributesVec = vec
119− }
120− where
121− vec = V.filter attrFilter (attributesVec attrs)
122− attrFilter attr = S.notMember (attributeName attr) attrNames
123
52
124renameAttribute :: AttributeName -> Attribute -> Attribute
53renameAttribute :: AttributeName -> Attribute -> Attribute
125renameAttribute newAttrName (Attribute _ typeo) = Attribute newAttrName typeo
54renameAttribute newAttrName (Attribute _ typeo) = Attribute newAttrName typeo
126
55
127renameAttributes :: AttributeName -> AttributeName -> Attributes -> Attributes
56renameAttributes :: AttributeName -> AttributeName -> Attributes -> Attributes
128−renameAttributes oldAttrName newAttrName attrs = Attributes {
57+renameAttributes oldAttrName newAttrName = V.map renamer
129− attributesVec = vec
130− }
131 where
58 where
132− vec = V.map renamer (attributesVec attrs)
133− renamer attr = if attributeName attr == oldAttrName then
59+ renamer attr = if attributeName attr == oldAttrName then
134 renameAttribute newAttrName attr
60 renameAttribute newAttrName attr
135 else
61 else
136 attr
62 attr
@@ -141,13 +67,10 @@ atomTypeForAttributeName attrName attrs = do
141 return atype
67 return atype
142
68
143attributeForName :: AttributeName -> Attributes -> Either RelationalError Attribute
69attributeForName :: AttributeName -> Attributes -> Either RelationalError Attribute
144−attributeForName attrName attrs = case V.find (\attr -> attributeName attr == attrName) (attributesVec attrs) of
70+attributeForName attrName attrs = case V.find (\attr -> attributeName attr == attrName) attrs of
145 Nothing -> Left (NoSuchAttributeNamesError (S.singleton attrName))
71 Nothing -> Left (NoSuchAttributeNamesError (S.singleton attrName))
146 Just attr -> Right attr
72 Just attr -> Right attr
147
73
148−isAttributeNameContained :: AttributeName -> Attributes -> Bool
149−isAttributeNameContained nam attrs = isRight (attributeForName nam attrs)
150−
151--similar to attributesForNames, but returns error if some names are missing
74--similar to attributesForNames, but returns error if some names are missing
152projectionAttributesForNames :: S.Set AttributeName -> Attributes -> Either RelationalError Attributes
75projectionAttributesForNames :: S.Set AttributeName -> Attributes -> Either RelationalError Attributes
153projectionAttributesForNames names attrsIn =
76projectionAttributesForNames names attrsIn =
@@ -159,18 +82,15 @@ projectionAttributesForNames names attrsIn =
159 missingNames = attributeNamesNotContained names (S.fromList (V.toList (attributeNames attrsIn)))
82 missingNames = attributeNamesNotContained names (S.fromList (V.toList (attributeNames attrsIn)))
160
83
161attributesForNames :: S.Set AttributeName -> Attributes -> Attributes
84attributesForNames :: S.Set AttributeName -> Attributes -> Attributes
162−attributesForNames attrNameSet attrs = Attributes {
85+attributesForNames attrNameSet = V.filter filt
163− attributesVec = vec
164− }
165 where
86 where
166− vec = V.filter filt (attributesVec attrs)
167 filt attr = S.member (attributeName attr) attrNameSet
87 filt attr = S.member (attributeName attr) attrNameSet
168
88
169attributeNameSet :: Attributes -> S.Set AttributeName
89attributeNameSet :: Attributes -> S.Set AttributeName
170−attributeNameSet attrs = S.fromList $ V.toList $ V.map (\(Attribute name _) -> name) (attributesVec attrs)
90+attributeNameSet attrVec = S.fromList $ V.toList $ V.map (\(Attribute name _) -> name) attrVec
171
91
172attributeNames :: Attributes -> V.Vector AttributeName
92attributeNames :: Attributes -> V.Vector AttributeName
173−attributeNames attrs = V.map attributeName (attributesVec attrs)
93+attributeNames = V.map attributeName
174
94
175--checks if set s1 is wholly contained in the set s2
95--checks if set s1 is wholly contained in the set s2
176attributesContained :: Attributes -> Attributes -> Bool
96attributesContained :: Attributes -> Attributes -> Bool
@@ -191,88 +111,42 @@ attributeNamesNotContained subset superset = S.filter (`S.notMember` superset) s
191
111
192-- useful for display
112-- useful for display
193orderedAttributes :: Attributes -> [Attribute]
113orderedAttributes :: Attributes -> [Attribute]
194−orderedAttributes attrs = L.sortBy (\a b -> attributeName a `compare` attributeName b) (V.toList (attributesVec attrs))
114+orderedAttributes attrs = L.sortBy (\a b -> attributeName a `compare` attributeName b) (V.toList attrs)
195
115
196orderedAttributeNames :: Attributes -> [AttributeName]
116orderedAttributeNames :: Attributes -> [AttributeName]
197orderedAttributeNames attrs = map attributeName (orderedAttributes attrs)
117orderedAttributeNames attrs = map attributeName (orderedAttributes attrs)
198
118
199-- take two attribute sets and return an attribute set with the attributes which do not match
119-- take two attribute sets and return an attribute set with the attributes which do not match
200−--this is the function which benefits the most from the HashSet representation- this turned up in the insert performance test
201attributesDifference :: Attributes -> Attributes -> Attributes
120attributesDifference :: Attributes -> Attributes -> Attributes
202−{-attributesDifference attrsA attrsB = V.fromList $ diff (V.toList attrsA) (V.toList attrsB)
121+attributesDifference attrsA attrsB = V.fromList $ diff (V.toList attrsA) (V.toList attrsB)
203 where
122 where
204 diff a b = (a L.\\ b) ++ (b L.\\ a)
123 diff a b = (a L.\\ b) ++ (b L.\\ a)
205−-}
206−attributesDifference attrsA attrsB =
207− if attributesSet attrsA == attributesSet attrsB then
208− mempty
209− else
210− Attributes {
211− attributesVec = vec
212− --,attributesSet = hset
213− }
214− where
215− hset = HS.difference setA setB <> HS.difference setB setA
216− setA = attributesSet attrsA
217− setB = attributesSet attrsB
218− vec = V.filter (`HS.member` hset) (attributesVec attrsA <> attributesVec attrsB)
219
124
220vectorUniqueify :: (Hash.Hashable a, Eq a) => V.Vector a -> V.Vector a
125vectorUniqueify :: (Hash.Hashable a, Eq a) => V.Vector a -> V.Vector a
221vectorUniqueify vecIn = V.fromList $ HS.toList $ HS.fromList $ V.toList vecIn
126vectorUniqueify vecIn = V.fromList $ HS.toList $ HS.fromList $ V.toList vecIn
222
127
223--check that each attribute only appears once
128--check that each attribute only appears once
224verifyAttributes :: Attributes -> Either RelationalError Attributes
129verifyAttributes :: Attributes -> Either RelationalError Attributes
225−verifyAttributes attrs =
130+verifyAttributes attrs = if collapsedAttrs /= attrs then
226− if vecSet == attributesSet attrs then
227− pure attrs
228− else
229− Left (TupleAttributeTypeMismatchError diffAttrs)
131+ Left (TupleAttributeTypeMismatchError (attributesDifference collapsedAttrs attrs))
230− where
132+ else
231− vecSet = V.foldr' HS.insert HS.empty (attributesVec attrs)
133+ Right attrs
232− diffSet = HS.difference vecSet (attributesSet attrs) <> HS.difference (attributesSet attrs) vecSet
233− diffAttrs = Attributes {
234− attributesVec = V.fromList (HS.toList diffSet)
235− --,attributesSet = diffSet
236− }
237−
238−--used in Generics derivation for ADTs without named attributes- not to be used elsewhere
239−--drop first n attributes from vector representation
240−drop :: Int -> Attributes -> Attributes
241−drop c attrs = Attributes { attributesVec = vec
242− }
243 where
134 where
244− vec = V.drop c (attributesVec attrs)
135+ collapsedAttrs = vectorUniqueify attrs
245
136
246−
247−-- use this in preference to attributesEqual when the attribute ordering matters such as during tuple unions
248−attributesAndOrderEqual :: Attributes -> Attributes -> Bool
249−attributesAndOrderEqual a b = attributesVec a == attributesVec b
250−
251−-- use to determine if the same attributes are contained (but ordering is irrelevant)
252attributesEqual :: Attributes -> Attributes -> Bool
137attributesEqual :: Attributes -> Attributes -> Bool
253−attributesEqual attrsA attrsB =
138+attributesEqual attrs1 attrs2 = V.null (attributesDifference attrs1 attrs2)
254− attributesVec attrsA == attributesVec attrsB ||
255− attributesSet attrsA == attributesSet attrsB
256
139
257attributesAsMap :: Attributes -> M.Map AttributeName Attribute
140attributesAsMap :: Attributes -> M.Map AttributeName Attribute
258−attributesAsMap attrs = V.foldr' (\attr acc -> M.insert (attributeName attr) attr acc) mempty (attributesVec attrs)
141+attributesAsMap attrs = (M.fromList . V.toList) (V.map (\attr -> (attributeName attr, attr)) attrs)
259−
260
142
261-- | Left-biased union of attributes.
143-- | Left-biased union of attributes.
262union :: Attributes -> Attributes -> Attributes
144union :: Attributes -> Attributes -> Attributes
263−union attrsA attrsB = Attributes {
145+union attrsA attrsB = V.fromList (M.elems unioned)
264− attributesVec = vec
265− --,attributesSet = hset
266− }
267 where
146 where
268− hset = HS.union (attributesSet attrsA) (attributesSet attrsB)
147+ unioned = M.union (attributesAsMap attrsA) (attributesAsMap attrsB)
269− vec = HS.foldr (flip V.snoc) mempty hset
270
148
271intersection :: Attributes -> Attributes -> Attributes
149intersection :: Attributes -> Attributes -> Attributes
272−intersection attrsA attrsB = Attributes {
150+intersection attrsA attrsB = V.fromList (M.elems intersected)
273− attributesVec = vec
274− --,attributesSet = hset
275− }
276 where
151 where
277− hset = HS.intersection (attributesSet attrsA) (attributesSet attrsB)
152+ intersected = M.intersection (attributesAsMap attrsA) (attributesAsMap attrsB)
278− vec = HS.foldr (flip V.snoc) mempty hset
src/lib/ProjectM36/AttributeExpr.hsdeleted−7
@@ -1,7 +0,0 @@
1−module ProjectM36.AttributeExpr where
2−import ProjectM36.Base
3−import ProjectM36.Attribute as A
4−
5−attributeName :: AttributeExprBase a -> AttributeName
6−attributeName (AttributeAndTypeNameExpr nam _ _) = nam
7−attributeName (NakedAttributeExpr attr) = A.attributeName attr
src/lib/ProjectM36/AttributeNames.hs+2−3
@@ -3,9 +3,8 @@ import ProjectM36.Base
3import qualified Data.Set as S
3import qualified Data.Set as S
4--AttributeNames is a data structure which can represent inverted projection attributes and attribute names derived from relational expressions
4--AttributeNames is a data structure which can represent inverted projection attributes and attribute names derived from relational expressions
5
5
6−empty :: AttributeNamesBase a
6+empty :: AttributeNames
7empty = AttributeNames S.empty
7empty = AttributeNames S.empty
8
8
9−all :: AttributeNamesBase a
9+all :: AttributeNames
10all = InvertedAttributeNames S.empty
10all = InvertedAttributeNames S.empty
11−
src/lib/ProjectM36/Base.hs+116−235
@@ -1,12 +1,9 @@
1−{-# LANGUAGE ExistentialQuantification,DeriveGeneric,DeriveAnyClass,FlexibleInstances,OverloadedStrings, DeriveTraversable, DerivingVia, TemplateHaskell, TypeFamilies #-}
1+{-# LANGUAGE ExistentialQuantification,DeriveGeneric,DeriveAnyClass, TypeSynonymInstances, FlexibleInstances #-}
2{-# OPTIONS_GHC -fno-warn-orphans #-}
2{-# OPTIONS_GHC -fno-warn-orphans #-}
3−
4module ProjectM36.Base where
3module ProjectM36.Base where
5import ProjectM36.DatabaseContextFunctionError
4import ProjectM36.DatabaseContextFunctionError
6import ProjectM36.AtomFunctionError
5import ProjectM36.AtomFunctionError
7−import ProjectM36.MerkleHash
8
6
9−import Data.Functor.Foldable.TH
10import qualified Data.Map as M
7import qualified Data.Map as M
11import qualified Data.HashSet as HS
8import qualified Data.HashSet as HS
12import Data.Hashable (Hashable, hashWithSalt)
9import Data.Hashable (Hashable, hashWithSalt)
@@ -15,21 +12,19 @@ import Data.UUID (UUID)
15import Control.DeepSeq (NFData, rnf)
12import Control.DeepSeq (NFData, rnf)
16import Control.DeepSeq.Generics (genericRnf)
13import Control.DeepSeq.Generics (genericRnf)
17import GHC.Generics (Generic)
14import GHC.Generics (Generic)
18−import GHC.Stack
19import qualified Data.Vector as V
15import qualified Data.Vector as V
20import qualified Data.List as L
16import qualified Data.List as L
21import Data.Text (Text,unpack)
17import Data.Text (Text,unpack)
18+import Data.Binary
19+import Data.Vector.Binary()
22import Data.Time.Clock
20import Data.Time.Clock
21+import Data.Time.Clock.POSIX
22+import Data.Time.Calendar (Day,toGregorian,fromGregorian)
23import Data.Hashable.Time ()
23import Data.Hashable.Time ()
24−import Data.Time.Calendar (Day)
25import Data.Typeable
24import Data.Typeable
26import Data.ByteString (ByteString)
25import Data.ByteString (ByteString)
27−import qualified Data.List.NonEmpty as NE
28−import Data.Vector.Instances ()
29
26
30type StringType = Text
27type StringType = Text
31−
32−type DatabaseName = String
33
28
34-- | Database atoms are the smallest, undecomposable units of a tuple. Common examples are integers, text, or unique identity keys.
29-- | Database atoms are the smallest, undecomposable units of a tuple. Common examples are integers, text, or unique identity keys.
35data Atom = IntegerAtom Integer |
30data Atom = IntegerAtom Integer |
@@ -40,10 +35,12 @@ data Atom = IntegerAtom Integer |
40 DateTimeAtom UTCTime |
35 DateTimeAtom UTCTime |
41 ByteStringAtom ByteString |
36 ByteStringAtom ByteString |
42 BoolAtom Bool |
37 BoolAtom Bool |
38+ IntervalAtom Atom Atom OpenInterval OpenInterval |
43 RelationAtom Relation |
39 RelationAtom Relation |
44− RelationalExprAtom RelationalExpr | --used for returning inc deps
45 ConstructedAtom DataConstructorName AtomType [Atom]
40 ConstructedAtom DataConstructorName AtomType [Atom]
46− deriving (Eq, Show, Typeable, NFData, Generic, Read)
41+ deriving (Eq, Show, Binary, Typeable, NFData, Generic)
42+
43+type OpenInterval = Bool
47
44
48instance Hashable Atom where
45instance Hashable Atom where
49 hashWithSalt salt (ConstructedAtom dConsName _ atoms) = salt `hashWithSalt` atoms
46 hashWithSalt salt (ConstructedAtom dConsName _ atoms) = salt `hashWithSalt` atoms
@@ -56,8 +53,20 @@ instance Hashable Atom where
56 hashWithSalt salt (DateTimeAtom dt) = salt `hashWithSalt` dt
53 hashWithSalt salt (DateTimeAtom dt) = salt `hashWithSalt` dt
57 hashWithSalt salt (ByteStringAtom bs) = salt `hashWithSalt` bs
54 hashWithSalt salt (ByteStringAtom bs) = salt `hashWithSalt` bs
58 hashWithSalt salt (BoolAtom b) = salt `hashWithSalt` b
55 hashWithSalt salt (BoolAtom b) = salt `hashWithSalt` b
56+ hashWithSalt salt (IntervalAtom a1 a2 bo be) = salt `hashWithSalt` a1 `hashWithSalt` a2 `hashWithSalt` bo `hashWithSalt` be
59 hashWithSalt salt (RelationAtom r) = salt `hashWithSalt` r
57 hashWithSalt salt (RelationAtom r) = salt `hashWithSalt` r
60− hashWithSalt salt (RelationalExprAtom re) = salt `hashWithSalt` re
58+
59+instance Binary UTCTime where
60+ put utc = put $ toRational (utcTimeToPOSIXSeconds utc)
61+ get = do
62+ r <- get :: Get Rational
63+ return (posixSecondsToUTCTime (fromRational r))
64+
65+instance Binary Day where
66+ put day = put $ toGregorian day
67+ get = do
68+ (y,m,d) <- get :: Get (Integer, Int, Int)
69+ return (fromGregorian y m d)
61
70
62-- I suspect the definition of ConstructedAtomType with its name alone is insufficient to disambiguate the cases; for example, one could create a type named X, remove a type named X, and re-add it using different constructors. However, as long as requests are served from only one DatabaseContext at-a-time, the type name is unambiguous. This will become a problem for time-travel, however.
71-- I suspect the definition of ConstructedAtomType with its name alone is insufficient to disambiguate the cases; for example, one could create a type named X, remove a type named X, and re-add it using different constructors. However, as long as requests are served from only one DatabaseContext at-a-time, the type name is unambiguous. This will become a problem for time-travel, however.
63-- | The AtomType uniquely identifies the type of a atom.
72-- | The AtomType uniquely identifies the type of a atom.
@@ -69,17 +78,13 @@ data AtomType = IntAtomType |
69 DateTimeAtomType |
78 DateTimeAtomType |
70 ByteStringAtomType |
79 ByteStringAtomType |
71 BoolAtomType |
80 BoolAtomType |
81+ IntervalAtomType AtomType |
72 RelationAtomType Attributes |
82 RelationAtomType Attributes |
73 ConstructedAtomType TypeConstructorName TypeVarMap |
83 ConstructedAtomType TypeConstructorName TypeVarMap |
74− RelationalExprAtomType |
75 TypeVariableType TypeVarName
84 TypeVariableType TypeVarName
76 --wildcard used in Atom Functions and tuples for data constructors which don't provide all arguments to the type constructor
85 --wildcard used in Atom Functions and tuples for data constructors which don't provide all arguments to the type constructor
77− deriving (Eq, NFData, Generic, Show, Read, Hashable)
86+ deriving (Eq, NFData, Generic, Binary, Show)
78−
87+
79−instance Ord AtomType where
80− compare = undefined
81−
82−-- this should probably be an ordered dictionary in order to be able to round-trip these arguments
83type TypeVarMap = M.Map TypeVarName AtomType
88type TypeVarMap = M.Map TypeVarName AtomType
84
89
85instance Hashable TypeVarMap where
90instance Hashable TypeVarMap where
@@ -94,37 +99,25 @@ isRelationAtomType _ = False
94type AttributeName = StringType
99type AttributeName = StringType
95
100
96-- | A relation's type is composed of attribute names and types.
101-- | A relation's type is composed of attribute names and types.
97−data Attribute = Attribute AttributeName AtomType deriving (Eq, Show, Read, Generic, NFData)
102+data Attribute = Attribute AttributeName AtomType deriving (Eq, Show, Generic, NFData, Binary)
98
103
99instance Hashable Attribute where
104instance Hashable Attribute where
100 hashWithSalt salt (Attribute attrName _) = hashWithSalt salt attrName
105 hashWithSalt salt (Attribute attrName _) = hashWithSalt salt attrName
101
106
102−type AttributesHash = Int
103−
104-- | 'Attributes' represent the head of a relation.
107-- | 'Attributes' represent the head of a relation.
105−newtype Attributes = Attributes {
106− attributesVec :: V.Vector Attribute
108+type Attributes = V.Vector Attribute
107− --,attributesSet :: HS.HashSet Attribute --compare with this generated in heap profile and benchmarks
108− }
109− deriving (NFData, Read, Hashable, Generic)
110−
111−attributesSet :: Attributes -> HS.HashSet Attribute
112−attributesSet = HS.fromList . V.toList . attributesVec
113−
114−instance Show Attributes where
115− show attrs = "attributesFromList [" <> L.intercalate ", " (map (\attr -> "(" <> show attr <> ")") (V.toList (attributesVec attrs))) <> "]"
116−
117−--when attribute ordering is irrelevant
118−instance Eq Attributes where
119− attrsA == attrsB =
120− attributesVec attrsA == attributesVec attrsB ||
121− attributesSet attrsA == attributesSet attrsB
122
109
110+-- | Equality function for a set of attributes.
111+attributesEqual :: Attributes -> Attributes -> Bool
112+attributesEqual attrs1 attrs2 = attrsAsSet attrs1 == attrsAsSet attrs2
113+ where
114+ attrsAsSet = HS.fromList . V.toList
115+
123sortedAttributesIndices :: Attributes -> [(Int, Attribute)]
116sortedAttributesIndices :: Attributes -> [(Int, Attribute)]
124−sortedAttributesIndices attrs = L.sortBy (\(_, Attribute name1 _) (_,Attribute name2 _) -> compare name1 name2) $ V.toList (V.indexed (attributesVec attrs))
117+sortedAttributesIndices attrs = L.sortBy (\(_, Attribute name1 _) (_,Attribute name2 _) -> compare name1 name2) $ V.toList (V.indexed attrs)
125
118
126-- | The relation's tuple set is the body of the relation.
119-- | The relation's tuple set is the body of the relation.
127−newtype RelationTupleSet = RelationTupleSet { asList :: [RelationTuple] } deriving (Hashable, Show, Generic, Read)
120+newtype RelationTupleSet = RelationTupleSet { asList :: [RelationTuple] } deriving (Hashable, Show, Generic, Binary)
128
121
129instance Read Relation where
122instance Read Relation where
130 readsPrec = error "relation read not supported"
123 readsPrec = error "relation read not supported"
@@ -140,8 +133,8 @@ instance NFData RelationTupleSet where rnf = genericRnf
140instance Hashable RelationTuple where
133instance Hashable RelationTuple where
141 --sanity check the tuple for attribute and tuple counts
134 --sanity check the tuple for attribute and tuple counts
142 --this bit me when tuples were being hashed before being verified
135 --this bit me when tuples were being hashed before being verified
143− hashWithSalt salt (RelationTuple attrs tupVec) = if V.length (attributesVec attrs) /= V.length tupVec then
136+ hashWithSalt salt (RelationTuple attrs tupVec) = if V.length attrs /= V.length tupVec then
144− error ("invalid tuple: attributes and tuple count mismatch " <> show (attributesVec attrs, tupVec))
137+ error "invalid tuple: attributes and tuple count mismatch"
145 else
138 else
146 salt `hashWithSalt`
139 salt `hashWithSalt`
147 sortedAttrs `hashWithSalt`
140 sortedAttrs `hashWithSalt`
@@ -152,23 +145,24 @@ instance Hashable RelationTuple where
152 sortedTupVec = V.map (\(index, _) -> tupVec V.! index) $ V.fromList sortedAttrsIndices
145 sortedTupVec = V.map (\(index, _) -> tupVec V.! index) $ V.fromList sortedAttrsIndices
153
146
154-- | A tuple is a set of attributes mapped to their 'Atom' values.
147-- | A tuple is a set of attributes mapped to their 'Atom' values.
155−data RelationTuple = RelationTuple Attributes (V.Vector Atom) deriving (Show, Read, Generic)
148+data RelationTuple = RelationTuple Attributes (V.Vector Atom) deriving (Show, Generic)
149+
150+instance Binary RelationTuple
156
151
157instance Eq RelationTuple where
152instance Eq RelationTuple where
158− tuple1@(RelationTuple attrs1 _) == tuple2@(RelationTuple attrs2 _) =
153+ (==) tuple1@(RelationTuple attrs1 _) tuple2@(RelationTuple attrs2 _) = attributesEqual attrs1 attrs2 && atomsEqual
159− attrs1 == attrs2 && atomsEqual
160 where
154 where
161− atomForAttribute attr (RelationTuple attrs tupVec) = case V.findIndex (== attr) (attributesVec attrs) of
155+ atomForAttribute attr (RelationTuple attrs tupVec) = case V.findIndex (== attr) attrs of
162− Nothing -> Nothing
156+ Nothing -> Nothing
163− Just index -> tupVec V.!? index
157+ Just index -> tupVec V.!? index
164− atomsEqual = V.all (== True) $ V.map (\attr -> atomForAttribute attr tuple1 == atomForAttribute attr tuple2) (attributesVec attrs1)
158+ atomsEqual = V.all (== True) $ V.map (\attr -> atomForAttribute attr tuple1 == atomForAttribute attr tuple2) attrs1
165
159
166instance NFData RelationTuple where rnf = genericRnf
160instance NFData RelationTuple where rnf = genericRnf
167
161
168data Relation = Relation Attributes RelationTupleSet deriving (Show, Generic,Typeable)
162data Relation = Relation Attributes RelationTupleSet deriving (Show, Generic,Typeable)
169
163
170instance Eq Relation where
164instance Eq Relation where
171− Relation attrs1 tupSet1 == Relation attrs2 tupSet2 = attrs1 == attrs2 && tupSet1 == tupSet2
165+ Relation attrs1 tupSet1 == Relation attrs2 tupSet2 = attributesEqual attrs1 attrs2 && tupSet1 == tupSet2
172
166
173instance NFData Relation where rnf = genericRnf
167instance NFData Relation where rnf = genericRnf
174
168
@@ -179,6 +173,8 @@ instance Hashable Relation where
179 where
173 where
180 sortedAttrs = map snd (sortedAttributesIndices attrs)
174 sortedAttrs = map snd (sortedAttributesIndices attrs)
181
175
176+instance Binary Relation
177+
182-- | Used to represent the number of tuples in a relation.
178-- | Used to represent the number of tuples in a relation.
183data RelationCardinality = Countable | Finite Int deriving (Eq, Show, Generic, Ord)
179data RelationCardinality = Countable | Finite Int deriving (Eq, Show, Generic, Ord)
184
180
@@ -190,7 +186,7 @@ type RelationalExpr = RelationalExprBase ()
190-- | A relational expression represents query (read) operations on a database.
186-- | A relational expression represents query (read) operations on a database.
191data RelationalExprBase a =
187data RelationalExprBase a =
192 --- | Create a relation from tuple expressions.
188 --- | Create a relation from tuple expressions.
193− MakeRelationFromExprs (Maybe [AttributeExprBase a]) (TupleExprsBase a) |
189+ MakeRelationFromExprs (Maybe [AttributeExprBase a]) [TupleExprBase a] |
194 --- | Create and reference a relation from attributes and a tuple set.
190 --- | Create and reference a relation from attributes and a tuple set.
195 MakeStaticRelation Attributes RelationTupleSet |
191 MakeStaticRelation Attributes RelationTupleSet |
196 --- | Reference an existing relation in Haskell-space.
192 --- | Reference an existing relation in Haskell-space.
@@ -199,7 +195,7 @@ data RelationalExprBase a =
199 --in Tutorial D, relational variables pick up the type of the first relation assigned to them
195 --in Tutorial D, relational variables pick up the type of the first relation assigned to them
200 --relational variables should also be able to be explicitly-typed like in Haskell
196 --relational variables should also be able to be explicitly-typed like in Haskell
201 --- | Reference a relation variable by its name.
197 --- | Reference a relation variable by its name.
202− RelationVariable RelVarName a |
198+ RelationVariable RelVarName a |
203 --- | Create a projection over attribute names. (Note that the 'AttributeNames' structure allows for the names to be inverted.)
199 --- | Create a projection over attribute names. (Note that the 'AttributeNames' structure allows for the names to be inverted.)
204 Project (AttributeNamesBase a) (RelationalExprBase a) |
200 Project (AttributeNamesBase a) (RelationalExprBase a) |
205 --- | Create a union of two relational expressions. The expressions should have identical attributes.
201 --- | Create a union of two relational expressions. The expressions should have identical attributes.
@@ -219,21 +215,12 @@ data RelationalExprBase a =
219 --- | Returns the true relation iff
215 --- | Returns the true relation iff
220 Equals (RelationalExprBase a) (RelationalExprBase a) |
216 Equals (RelationalExprBase a) (RelationalExprBase a) |
221 NotEquals (RelationalExprBase a) (RelationalExprBase a) |
217 NotEquals (RelationalExprBase a) (RelationalExprBase a) |
222− Extend (ExtendTupleExprBase a) (RelationalExprBase a) |
218+ Extend (ExtendTupleExprBase a) (RelationalExprBase a)
223 --Summarize :: AtomExpr -> AttributeName -> RelationalExpr -> RelationalExpr -> RelationalExpr -- a special case of Extend
219 --Summarize :: AtomExpr -> AttributeName -> RelationalExpr -> RelationalExpr -> RelationalExpr -- a special case of Extend
224− --Evaluate relationalExpr with scoped views
225− With [(WithNameExprBase a, RelationalExprBase a)] (RelationalExprBase a)
226− deriving (Show, Read, Eq, Generic, NFData, Foldable, Functor, Traversable)
220+ deriving (Show, Eq, Generic, NFData)
227−
221+
228−instance Hashable RelationalExpr
222+instance Binary RelationalExpr
229−
223+
230−data WithNameExprBase a = WithNameExpr RelVarName a
231− deriving (Show, Read, Eq, Generic, NFData, Foldable, Functor, Traversable, Hashable)
232−
233−type WithNameExpr = WithNameExprBase ()
234−
235−type GraphRefWithNameExpr = WithNameExprBase GraphRefTransactionMarker
236−
237type NotificationName = StringType
224type NotificationName = StringType
238type Notifications = M.Map NotificationName Notification
225type Notifications = M.Map NotificationName Notification
239
226
@@ -243,22 +230,20 @@ data Notification = Notification {
243 reportOldExpr :: RelationalExpr, --run the expression in the pre-change context
230 reportOldExpr :: RelationalExpr, --run the expression in the pre-change context
244 reportNewExpr :: RelationalExpr --run the expression in the post-change context
231 reportNewExpr :: RelationalExpr --run the expression in the post-change context
245 }
232 }
246− deriving (Show, Eq, Generic, NFData)
233+ deriving (Show, Eq, Binary, Generic, NFData)
247
234
248type TypeVarName = StringType
235type TypeVarName = StringType
249
236
250-- | Metadata definition for type constructors such as @data Either a b@.
237-- | Metadata definition for type constructors such as @data Either a b@.
251data TypeConstructorDef = ADTypeConstructorDef TypeConstructorName [TypeVarName] |
238data TypeConstructorDef = ADTypeConstructorDef TypeConstructorName [TypeVarName] |
252 PrimitiveTypeConstructorDef TypeConstructorName AtomType
239 PrimitiveTypeConstructorDef TypeConstructorName AtomType
253− deriving (Show, Generic, Eq, NFData, Hashable, Read)
240+ deriving (Show, Generic, Binary, Eq, NFData)
254
241
255-- | Found in data constructors and type declarations: Left (Either Int Text) | Right Int
242-- | Found in data constructors and type declarations: Left (Either Int Text) | Right Int
256−type TypeConstructor = TypeConstructorBase ()
257−data TypeConstructorBase a = ADTypeConstructor TypeConstructorName [TypeConstructor] |
243+data TypeConstructor = ADTypeConstructor TypeConstructorName [TypeConstructor] |
258− PrimitiveTypeConstructor TypeConstructorName AtomType |
244+ PrimitiveTypeConstructor TypeConstructorName AtomType |
259− RelationAtomTypeConstructor [AttributeExprBase a] |
260− TypeVariable TypeVarName
245+ TypeVariable TypeVarName
261− deriving (Show, Generic, Eq, NFData, Hashable, Read)
246+ deriving (Show, Generic, Binary, Eq, NFData)
262
247
263type TypeConstructorMapping = [(TypeConstructorDef, DataConstructorDefs)]
248type TypeConstructorMapping = [(TypeConstructorDef, DataConstructorDefs)]
264
249
@@ -268,23 +253,16 @@ type DataConstructorName = StringType
268type AtomTypeName = StringType
253type AtomTypeName = StringType
269
254
270-- | Used to define a data constructor in a type constructor context such as @Left a | Right b@
255-- | Used to define a data constructor in a type constructor context such as @Left a | Right b@
271−data DataConstructorDef = DataConstructorDef DataConstructorName [DataConstructorDefArg] deriving (Eq, Show, Generic, NFData, Hashable, Read)
256+data DataConstructorDef = DataConstructorDef DataConstructorName [DataConstructorDefArg] deriving (Eq, Show, Binary, Generic, NFData)
272
257
273type DataConstructorDefs = [DataConstructorDef]
258type DataConstructorDefs = [DataConstructorDef]
274
259
275data DataConstructorDefArg = DataConstructorDefTypeConstructorArg TypeConstructor |
260data DataConstructorDefArg = DataConstructorDefTypeConstructorArg TypeConstructor |
276 DataConstructorDefTypeVarNameArg TypeVarName
261 DataConstructorDefTypeVarNameArg TypeVarName
277− deriving (Show, Generic, Eq, NFData, Hashable, Read)
262+ deriving (Show, Generic, Binary, Eq, NFData)
278
263
279type InclusionDependencies = M.Map IncDepName InclusionDependency
264type InclusionDependencies = M.Map IncDepName InclusionDependency
280−type RelationVariables = M.Map RelVarName GraphRefRelationalExpr
265+type RelationVariables = M.Map RelVarName Relation
281−
282−data GraphRefTransactionMarker = TransactionMarker TransactionId |
283− UncommittedContextMarker
284− deriving (Eq, Show, Generic, NFData, Ord)
285−
286−-- a fundamental relational expr to which other relational expressions compile
287−type GraphRefRelationalExpr = RelationalExprBase GraphRefTransactionMarker
288
266
289type SchemaName = StringType
267type SchemaName = StringType
290
268
@@ -292,18 +270,17 @@ type Subschemas = M.Map SchemaName Schema
292
270
293-- | Every transaction has one concrete database context and any number of isomorphic subschemas.
271-- | Every transaction has one concrete database context and any number of isomorphic subschemas.
294data Schemas = Schemas DatabaseContext Subschemas
272data Schemas = Schemas DatabaseContext Subschemas
295− deriving (Generic)
296
273
297-- | The DatabaseContext is a snapshot of a database's evolving state and contains everything a database client can change over time.
274-- | The DatabaseContext is a snapshot of a database's evolving state and contains everything a database client can change over time.
298-- I spent some time thinking about whether the VirtualDatabaseContext/Schema and DatabaseContext data constructors should be the same constructor, but that would allow relation variables to be created in a "virtual" context which would appear to defeat the isomorphisms of the contexts. It should be possible to switch to an alternative schema to view the same equivalent information without information loss. However, allowing all contexts to reference another context while maintaining its own relation variables, new types, etc. could be interesting from a security perspective. For example, if a user creates a new relvar in a virtual context, then does it necessarily appear in all linked contexts? After deliberation, I think the relvar should appear in *all* linked contexts to retain the isomorphic properties, even when the isomorphism is for a subset of the context. This hints that the IsoMorphs should allow for "fall-through"; that is, when a relvar is not defined in the virtual context (for morphing), then the lookup should fall through to the underlying context.
275-- I spent some time thinking about whether the VirtualDatabaseContext/Schema and DatabaseContext data constructors should be the same constructor, but that would allow relation variables to be created in a "virtual" context which would appear to defeat the isomorphisms of the contexts. It should be possible to switch to an alternative schema to view the same equivalent information without information loss. However, allowing all contexts to reference another context while maintaining its own relation variables, new types, etc. could be interesting from a security perspective. For example, if a user creates a new relvar in a virtual context, then does it necessarily appear in all linked contexts? After deliberation, I think the relvar should appear in *all* linked contexts to retain the isomorphic properties, even when the isomorphism is for a subset of the context. This hints that the IsoMorphs should allow for "fall-through"; that is, when a relvar is not defined in the virtual context (for morphing), then the lookup should fall through to the underlying context.
299newtype Schema = Schema SchemaIsomorphs
276newtype Schema = Schema SchemaIsomorphs
300− deriving (Generic)
277+ deriving (Generic, Binary)
301
278
302data SchemaIsomorph = IsoRestrict RelVarName RestrictionPredicateExpr (RelVarName, RelVarName) |
279data SchemaIsomorph = IsoRestrict RelVarName RestrictionPredicateExpr (RelVarName, RelVarName) |
303 IsoRename RelVarName RelVarName |
280 IsoRename RelVarName RelVarName |
304 IsoUnion (RelVarName, RelVarName) RestrictionPredicateExpr RelVarName --maps two relvars to one relvar
281 IsoUnion (RelVarName, RelVarName) RestrictionPredicateExpr RelVarName --maps two relvars to one relvar
305 -- IsoTypeConstructor in morphAttrExpr
282 -- IsoTypeConstructor in morphAttrExpr
306− deriving (Generic, Show)
283+ deriving (Generic, Binary, Show)
307
284
308type SchemaIsomorphs = [SchemaIsomorph]
285type SchemaIsomorphs = [SchemaIsomorph]
309
286
@@ -319,28 +296,24 @@ data DatabaseContext = DatabaseContext {
319type IncDepName = StringType
296type IncDepName = StringType
320
297
321-- | Inclusion dependencies represent every possible database constraint. Constraints enforce specific, arbitrarily-complex rules to which the database context's relation variables must adhere unconditionally.
298-- | Inclusion dependencies represent every possible database constraint. Constraints enforce specific, arbitrarily-complex rules to which the database context's relation variables must adhere unconditionally.
322−data InclusionDependency = InclusionDependency RelationalExpr RelationalExpr deriving (Show, Eq, Generic, NFData, Hashable, Read)
299+data InclusionDependency = InclusionDependency RelationalExpr RelationalExpr deriving (Show, Eq, Generic, NFData)
300+
301+instance Binary InclusionDependency
323
302
324type AttributeNameAtomExprMap = M.Map AttributeName AtomExpr
303type AttributeNameAtomExprMap = M.Map AttributeName AtomExpr
325
304
326--used for returning information about individual expressions
305--used for returning information about individual expressions
327type DatabaseContextExprName = StringType
306type DatabaseContextExprName = StringType
328
307
329−type DatabaseContextExpr = DatabaseContextExprBase ()
330−
331−instance Hashable DatabaseContextExpr
332−
333−type GraphRefDatabaseContextExpr = DatabaseContextExprBase GraphRefTransactionMarker
334−
335-- | Database context expressions modify the database context.
308-- | Database context expressions modify the database context.
336−data DatabaseContextExprBase a =
309+data DatabaseContextExpr =
337 NoOperation |
310 NoOperation |
338− Define RelVarName [AttributeExprBase a] |
311+ Define RelVarName [AttributeExpr] |
339 Undefine RelVarName | --forget existence of relvar X
312 Undefine RelVarName | --forget existence of relvar X
340− Assign RelVarName (RelationalExprBase a) |
313+ Assign RelVarName RelationalExpr |
341− Insert RelVarName (RelationalExprBase a) |
314+ Insert RelVarName RelationalExpr |
342− Delete RelVarName (RestrictionPredicateExprBase a) |
315+ Delete RelVarName RestrictionPredicateExpr |
343− Update RelVarName AttributeNameAtomExprMap (RestrictionPredicateExprBase a) |
316+ Update RelVarName AttributeNameAtomExprMap RestrictionPredicateExpr |
344
317
345 AddInclusionDependency IncDepName InclusionDependency |
318 AddInclusionDependency IncDepName InclusionDependency |
346 RemoveInclusionDependency IncDepName |
319 RemoveInclusionDependency IncDepName |
@@ -356,36 +329,19 @@ data DatabaseContextExprBase a =
356
329
357 RemoveDatabaseContextFunction DatabaseContextFunctionName |
330 RemoveDatabaseContextFunction DatabaseContextFunctionName |
358
331
359− ExecuteDatabaseContextFunction DatabaseContextFunctionName [AtomExprBase a] |
332+ ExecuteDatabaseContextFunction DatabaseContextFunctionName [AtomExpr] |
360
333
361− MultipleExpr [DatabaseContextExprBase a]
334+ MultipleExpr [DatabaseContextExpr]
362− deriving (Show, Read, Eq, Generic, NFData)
335+ deriving (Show, Eq, Binary, Generic)
363−
364−instance Hashable (M.Map AttributeName AtomExpr) where
365− hashWithSalt salt m = salt `hashWithSalt` M.toList m
366
336
367−type ObjModuleName = StringType
368−type ObjFunctionName = StringType
369−type Range = (Int,Int)
370-- | Adding an atom function should be nominally a DatabaseExpr except for the fact that it cannot be performed purely. Thus, we create the DatabaseContextIOExpr.
337-- | Adding an atom function should be nominally a DatabaseExpr except for the fact that it cannot be performed purely. Thus, we create the DatabaseContextIOExpr.
371−data DatabaseContextIOExprBase a =
372− AddAtomFunction AtomFunctionName [TypeConstructor] AtomFunctionBodyScript |
338+data DatabaseContextIOExpr = AddAtomFunction AtomFunctionName [TypeConstructor] AtomFunctionBodyScript |
373− LoadAtomFunctions ObjModuleName ObjFunctionName FilePath |
374− AddDatabaseContextFunction DatabaseContextFunctionName [TypeConstructor] DatabaseContextFunctionBodyScript |
339+ AddDatabaseContextFunction DatabaseContextFunctionName [TypeConstructor] DatabaseContextFunctionBodyScript
375− LoadDatabaseContextFunctions ObjModuleName ObjFunctionName FilePath |
376− CreateArbitraryRelation RelVarName [AttributeExprBase a] Range
377− deriving (Show, Eq, Generic)
340+ deriving (Show, Eq, Generic, Binary)
378
341
379−type GraphRefDatabaseContextIOExpr = DatabaseContextIOExprBase GraphRefTransactionMarker
380−
381−type DatabaseContextIOExpr = DatabaseContextIOExprBase ()
382
342
383type RestrictionPredicateExpr = RestrictionPredicateExprBase ()
343type RestrictionPredicateExpr = RestrictionPredicateExprBase ()
384
344
385−instance Hashable RestrictionPredicateExpr
386−
387−type GraphRefRestrictionPredicateExpr = RestrictionPredicateExprBase GraphRefTransactionMarker
388−
389-- | Restriction predicates are boolean algebra components which, when composed, indicate whether or not a tuple should be retained during a restriction (filtering) operation.
345-- | Restriction predicates are boolean algebra components which, when composed, indicate whether or not a tuple should be retained during a restriction (filtering) operation.
390data RestrictionPredicateExprBase a =
346data RestrictionPredicateExprBase a =
391 TruePredicate |
347 TruePredicate |
@@ -395,7 +351,9 @@ data RestrictionPredicateExprBase a =
395 RelationalExprPredicate (RelationalExprBase a) | --type must be same as true and false relations (no attributes)
351 RelationalExprPredicate (RelationalExprBase a) | --type must be same as true and false relations (no attributes)
396 AtomExprPredicate (AtomExprBase a) | --atom must evaluate to boolean
352 AtomExprPredicate (AtomExprBase a) | --atom must evaluate to boolean
397 AttributeEqualityPredicate AttributeName (AtomExprBase a) -- relationalexpr must result in relation with single tuple
353 AttributeEqualityPredicate AttributeName (AtomExprBase a) -- relationalexpr must result in relation with single tuple
398− deriving (Show, Read, Eq, Generic, NFData, Foldable, Functor, Traversable)
354+ deriving (Show, Eq, Generic, NFData)
355+
356+instance Binary RestrictionPredicateExpr
399
357
400-- child + parent links
358-- child + parent links
401-- | A transaction graph's head name references the leaves of the transaction graph and can be used during session creation to indicate at which point in the graph commits should persist.
359-- | A transaction graph's head name references the leaves of the transaction graph and can be used during session creation to indicate at which point in the graph commits should persist.
@@ -405,42 +363,32 @@ type TransactionHeads = M.Map HeadName Transaction
405
363
406-- | The transaction graph is the global database's state which references every committed transaction.
364-- | The transaction graph is the global database's state which references every committed transaction.
407data TransactionGraph = TransactionGraph TransactionHeads (S.Set Transaction)
365data TransactionGraph = TransactionGraph TransactionHeads (S.Set Transaction)
408− deriving Generic
409−
410−transactionHeadsForGraph :: TransactionGraph -> TransactionHeads
411−transactionHeadsForGraph (TransactionGraph hs _) = hs
412
366
413transactionsForGraph :: TransactionGraph -> S.Set Transaction
367transactionsForGraph :: TransactionGraph -> S.Set Transaction
414−transactionsForGraph (TransactionGraph _ ts) = ts
368+transactionsForGraph (TransactionGraph _ t) = t
369+
370+transactionHeadsForGraph :: TransactionGraph -> TransactionHeads
371+transactionHeadsForGraph (TransactionGraph heads _) = heads
415
372
416-- | Every transaction has context-specific information attached to it.
373-- | Every transaction has context-specific information attached to it.
417−-- The `TransactionDiff`s represent child/edge relationships to previous transactions (branches or continuations of the same branch).
418−data TransactionInfo = TransactionInfo {
374+data TransactionInfo = TransactionInfo TransactionId (S.Set TransactionId) UTCTime | -- 1 parent + n children
419− parents :: TransactionParents,
420− stamp :: UTCTime,
421− merkleHash :: MerkleHash
422− } deriving (Show, Generic)
423−
424−type TransactionParents = NE.NonEmpty TransactionId
425−{-
426−data TransactionInfo = TransactionInfo TransactionId TransactionDiffs UTCTime | -- 1 parent + n children
427− MergeTransactionInfo TransactionId TransactionId TransactionDiffs UTCTime -- 2 parents, n children
375+ MergeTransactionInfo TransactionId TransactionId (S.Set TransactionId) UTCTime -- 2 parents, n children
428− deriving (Show, Generic)
376+ deriving(Show, Generic)
429−-}
377+
378+instance Binary TransactionInfo
430
379
431-- | Every set of modifications made to the database are atomically committed to the transaction graph as a transaction.
380-- | Every set of modifications made to the database are atomically committed to the transaction graph as a transaction.
432type TransactionId = UUID
381type TransactionId = UUID
433
382
434data Transaction = Transaction TransactionId TransactionInfo Schemas
383data Transaction = Transaction TransactionId TransactionInfo Schemas
435− deriving Generic
436
384
437−-- | The disconnected transaction represents an in-progress workspace used by sessions before changes are committed. This is similar to git's "index". After a transaction is committed, it is "connected" in the transaction graph and can no longer be modified.
385+--instance Binary Transaction
438−data DisconnectedTransaction = DisconnectedTransaction TransactionId Schemas DirtyFlag
386+
439−--the database context expression represents a difference between the disconnected transaction and its immutable parent transaction- is this diff expr used at all?
440−
441type DirtyFlag = Bool
387type DirtyFlag = Bool
442
388
443−type TransactionDiffExpr = DatabaseContextExpr
389+-- | The disconnected transaction represents an in-progress workspace used by sessions before changes are committed. This is similar to git's "index". After a transaction is committed, it is "connected" in the transaction graph and can no longer be modified.
390+data DisconnectedTransaction = DisconnectedTransaction TransactionId Schemas DirtyFlag --parentID, context- the context here represents the singular concrete context from the schema
391+--the dirty flag indicates that the database context has diverged from its parent's context
444
392
445transactionId :: Transaction -> TransactionId
393transactionId :: Transaction -> TransactionId
446transactionId (Transaction tid _ _) = tid
394transactionId (Transaction tid _ _) = tid
@@ -456,28 +404,24 @@ instance Ord Transaction where
456
404
457type AtomExpr = AtomExprBase ()
405type AtomExpr = AtomExprBase ()
458
406
459−instance Hashable AtomExpr
460−
461−type GraphRefAtomExpr = AtomExprBase GraphRefTransactionMarker
462−
463-- | An atom expression represents an action to take when extending a relation or when statically defining a relation or a new tuple.
407-- | An atom expression represents an action to take when extending a relation or when statically defining a relation or a new tuple.
464data AtomExprBase a = AttributeAtomExpr AttributeName |
408data AtomExprBase a = AttributeAtomExpr AttributeName |
465 NakedAtomExpr Atom |
409 NakedAtomExpr Atom |
466 FunctionAtomExpr AtomFunctionName [AtomExprBase a] a |
410 FunctionAtomExpr AtomFunctionName [AtomExprBase a] a |
467 RelationAtomExpr (RelationalExprBase a) |
411 RelationAtomExpr (RelationalExprBase a) |
468 ConstructedAtomExpr DataConstructorName [AtomExprBase a] a
412 ConstructedAtomExpr DataConstructorName [AtomExprBase a] a
469− deriving (Eq, Show, Read, Generic, NFData, Foldable, Functor, Traversable)
413+ deriving (Eq,Show,Generic, NFData)
470
414
415+instance Binary AtomExpr
416+
471-- | Used in tuple creation when creating a relation.
417-- | Used in tuple creation when creating a relation.
472data ExtendTupleExprBase a = AttributeExtendTupleExpr AttributeName (AtomExprBase a)
418data ExtendTupleExprBase a = AttributeExtendTupleExpr AttributeName (AtomExprBase a)
473− deriving (Show, Read, Eq, Generic, NFData, Foldable, Functor, Traversable)
419+ deriving (Show, Eq, Generic, NFData)
474
420
475−type ExtendTupleExpr = ExtendTupleExprBase ()
421+type ExtendTupleExpr = ExtendTupleExprBase ()
476−
477−instance Hashable ExtendTupleExpr
478−
479−type GraphRefExtendTupleExpr = ExtendTupleExprBase GraphRefTransactionMarker
480
422
423+instance Binary ExtendTupleExpr
424+
481--enumerates the list of functions available to be run as part of tuple expressions
425--enumerates the list of functions available to be run as part of tuple expressions
482type AtomFunctions = HS.HashSet AtomFunction
426type AtomFunctions = HS.HashSet AtomFunction
483
427
@@ -488,7 +432,6 @@ type AtomFunctionBodyScript = StringType
488type AtomFunctionBodyType = [Atom] -> Either AtomFunctionError Atom
432type AtomFunctionBodyType = [Atom] -> Either AtomFunctionError Atom
489
433
490data AtomFunctionBody = AtomFunctionBody (Maybe AtomFunctionBodyScript) AtomFunctionBodyType
434data AtomFunctionBody = AtomFunctionBody (Maybe AtomFunctionBodyScript) AtomFunctionBodyType
491− deriving Generic
492
435
493instance NFData AtomFunctionBody where
436instance NFData AtomFunctionBody where
494 rnf (AtomFunctionBody mScript _) = rnf mScript
437 rnf (AtomFunctionBody mScript _) = rnf mScript
@@ -523,17 +466,11 @@ data AttributeNamesBase a = AttributeNames (S.Set AttributeName) |
523 UnionAttributeNames (AttributeNamesBase a) (AttributeNamesBase a) |
466 UnionAttributeNames (AttributeNamesBase a) (AttributeNamesBase a) |
524 IntersectAttributeNames (AttributeNamesBase a) (AttributeNamesBase a) |
467 IntersectAttributeNames (AttributeNamesBase a) (AttributeNamesBase a) |
525 RelationalExprAttributeNames (RelationalExprBase a) -- use attribute names from the relational expression's type
468 RelationalExprAttributeNames (RelationalExprBase a) -- use attribute names from the relational expression's type
526− deriving (Eq, Show, Read, Generic, NFData, Foldable, Functor, Traversable)
469+ deriving (Eq, Show, Generic, NFData)
527−
528−instance Hashable AttributeNames
529−
530−instance Hashable (S.Set AttributeName) where
531− hashWithSalt salt s = salt `hashWithSalt` S.toList s
532
470
533−type AttributeNames = AttributeNamesBase ()
471+type AttributeNames = AttributeNamesBase ()
534−
472+instance Binary AttributeNames
535−type GraphRefAttributeNames = AttributeNamesBase GraphRefTransactionMarker
473+
536−
537-- | The persistence strategy is a global database option which represents how to persist the database in the filesystem, if at all.
474-- | The persistence strategy is a global database option which represents how to persist the database in the filesystem, if at all.
538data PersistenceStrategy = NoPersistence | -- ^ no filesystem persistence/memory-only database
475data PersistenceStrategy = NoPersistence | -- ^ no filesystem persistence/memory-only database
539 MinimalPersistence FilePath | -- ^ fsync off, not crash-safe
476 MinimalPersistence FilePath | -- ^ fsync off, not crash-safe
@@ -541,31 +478,19 @@ data PersistenceStrategy = NoPersistence | -- ^ no filesystem persistence/memory
541 deriving (Show, Read)
478 deriving (Show, Read)
542
479
543type AttributeExpr = AttributeExprBase ()
480type AttributeExpr = AttributeExprBase ()
544−type GraphRefAttributeExpr = AttributeExprBase GraphRefTransactionMarker
545
481
546-- | Create attributes dynamically.
482-- | Create attributes dynamically.
547data AttributeExprBase a = AttributeAndTypeNameExpr AttributeName TypeConstructor a |
483data AttributeExprBase a = AttributeAndTypeNameExpr AttributeName TypeConstructor a |
548 NakedAttributeExpr Attribute
484 NakedAttributeExpr Attribute
549− deriving (Eq, Show, Read, Generic, NFData, Foldable, Functor, Traversable, Hashable)
485+ deriving (Eq, Show, Generic, Binary, NFData)
550
486
551-- | Dynamically create a tuple from attribute names and 'AtomExpr's.
487-- | Dynamically create a tuple from attribute names and 'AtomExpr's.
552newtype TupleExprBase a = TupleExpr (M.Map AttributeName (AtomExprBase a))
488newtype TupleExprBase a = TupleExpr (M.Map AttributeName (AtomExprBase a))
553− deriving (Eq, Show, Read, Generic, NFData, Foldable, Functor, Traversable)
489+ deriving (Eq, Show, Generic, NFData)
554−
490+
555−instance Hashable TupleExpr
491+instance Binary TupleExpr
556−
492+
557−type TupleExpr = TupleExprBase ()
493+type TupleExpr = TupleExprBase ()
558−
559−type GraphRefTupleExpr = TupleExprBase GraphRefTransactionMarker
560−
561−data TupleExprsBase a = TupleExprs a [TupleExprBase a]
562− deriving (Eq, Show, Read, Generic, NFData, Foldable, Functor, Traversable)
563−
564−instance Hashable TupleExprs
565−
566−type GraphRefTupleExprs = TupleExprsBase GraphRefTransactionMarker
567−
568−type TupleExprs = TupleExprsBase ()
569
494
570data MergeStrategy =
495data MergeStrategy =
571 -- | After a union merge, the merge transaction is a result of union'ing relvars of the same name, introducing all uniquely-named relvars, union of constraints, union of atom functions, notifications, and types (unless the names and definitions collide, e.g. two types of the same name with different definitions)
496 -- | After a union merge, the merge transaction is a result of union'ing relvars of the same name, introducing all uniquely-named relvars, union of constraints, union of atom functions, notifications, and types (unless the names and definitions collide, e.g. two types of the same name with different definitions)
@@ -574,7 +499,7 @@ data MergeStrategy =
574 UnionPreferMergeStrategy HeadName |
499 UnionPreferMergeStrategy HeadName |
575 -- | Similar to the our/theirs merge strategy in git, the merge transaction's context is identical to that of the last transaction in the selected branch.
500 -- | Similar to the our/theirs merge strategy in git, the merge transaction's context is identical to that of the last transaction in the selected branch.
576 SelectedBranchMergeStrategy HeadName
501 SelectedBranchMergeStrategy HeadName
577− deriving (Eq, Show, Generic, NFData)
502+ deriving (Eq, Show, Binary, Generic, NFData)
578
503
579type DatabaseContextFunctionName = StringType
504type DatabaseContextFunctionName = StringType
580
505
@@ -600,47 +525,3 @@ instance Hashable DatabaseContextFunction where
600
525
601instance Eq DatabaseContextFunction where
526instance Eq DatabaseContextFunction where
602 f1 == f2 = dbcFuncName f1 == dbcFuncName f2
527 f1 == f2 = dbcFuncName f1 == dbcFuncName f2
603−
604−attrTypeVars :: Attribute -> S.Set TypeVarName
605−attrTypeVars (Attribute _ aType) = case aType of
606− IntAtomType -> S.empty
607− IntegerAtomType -> S.empty
608− DoubleAtomType -> S.empty
609− TextAtomType -> S.empty
610− DayAtomType -> S.empty
611− DateTimeAtomType -> S.empty
612− ByteStringAtomType -> S.empty
613− BoolAtomType -> S.empty
614− RelationalExprAtomType -> S.empty
615− (RelationAtomType attrs) -> S.unions (map attrTypeVars (V.toList (attributesVec attrs)))
616− (ConstructedAtomType _ tvMap) -> M.keysSet tvMap
617− (TypeVariableType nam) -> S.singleton nam
618−
619−typeVars :: TypeConstructor -> S.Set TypeVarName
620−typeVars (PrimitiveTypeConstructor _ _) = S.empty
621−typeVars (ADTypeConstructor _ args) = S.unions (map typeVars args)
622−typeVars (TypeVariable v) = S.singleton v
623−typeVars (RelationAtomTypeConstructor attrExprs) = S.unions (map attrExprTypeVars attrExprs)
624−
625−attrExprTypeVars :: AttributeExprBase a -> S.Set TypeVarName
626−attrExprTypeVars (AttributeAndTypeNameExpr _ tCons _) = typeVars tCons
627−attrExprTypeVars (NakedAttributeExpr attr) = attrTypeVars attr
628−
629−atomTypeVars :: AtomType -> S.Set TypeVarName
630−atomTypeVars IntAtomType = S.empty
631−atomTypeVars IntegerAtomType = S.empty
632−atomTypeVars DoubleAtomType = S.empty
633−atomTypeVars TextAtomType = S.empty
634−atomTypeVars DayAtomType = S.empty
635−atomTypeVars DateTimeAtomType = S.empty
636−atomTypeVars ByteStringAtomType = S.empty
637−atomTypeVars BoolAtomType = S.empty
638−atomTypeVars RelationalExprAtomType = S.empty
639−atomTypeVars (RelationAtomType attrs) = S.unions (map attrTypeVars (V.toList (attributesVec attrs)))
640−atomTypeVars (ConstructedAtomType _ tvMap) = M.keysSet tvMap
641−atomTypeVars (TypeVariableType nam) = S.singleton nam
642−
643−unimplemented :: HasCallStack => a
644−unimplemented = error "unimplemented"
645−
646−makeBaseFunctor ''RelationalExprBase
src/lib/ProjectM36/Client.hs+370−381
@@ -1,4 +1,4 @@
1−{-# LANGUAGE DeriveGeneric, ScopedTypeVariables, MonoLocalBinds, DerivingVia #-}
1+{-# LANGUAGE DeriveAnyClass, DeriveGeneric, ScopedTypeVariables, BangPatterns #-}
2{-|
2{-|
3Module: ProjectM36.Client
3Module: ProjectM36.Client
4
4
@@ -9,7 +9,6 @@ module ProjectM36.Client
9 Connection(..),
9 Connection(..),
10 Port,
10 Port,
11 Hostname,
11 Hostname,
12− ServiceName,
13 DatabaseName,
12 DatabaseName,
14 ConnectionError(..),
13 ConnectionError(..),
15 connectProjectM36,
14 connectProjectM36,
@@ -17,8 +16,7 @@ module ProjectM36.Client
17 closeRemote_,
16 closeRemote_,
18 executeRelationalExpr,
17 executeRelationalExpr,
19 executeDatabaseContextExpr,
18 executeDatabaseContextExpr,
20− executeDatabaseContextIOExpr,
19+ executeDatabaseContextIOExpr,
21− executeDataFrameExpr,
22 executeGraphExpr,
20 executeGraphExpr,
23 executeSchemaExpr,
21 executeSchemaExpr,
24 executeTransGraphRelationalExpr,
22 executeTransGraphRelationalExpr,
@@ -27,7 +25,6 @@ module ProjectM36.Client
27 typeForRelationalExpr,
25 typeForRelationalExpr,
28 inclusionDependencies,
26 inclusionDependencies,
29 ProjectM36.Client.typeConstructorMapping,
27 ProjectM36.Client.typeConstructorMapping,
30− ProjectM36.Client.databaseContextFunctionsAsRelation,
31 planForDatabaseContextExpr,
28 planForDatabaseContextExpr,
32 currentSchemaName,
29 currentSchemaName,
33 SchemaName,
30 SchemaName,
@@ -35,7 +32,6 @@ module ProjectM36.Client
35 setCurrentSchemaName,
32 setCurrentSchemaName,
36 transactionGraphAsRelation,
33 transactionGraphAsRelation,
37 relationVariablesAsRelation,
34 relationVariablesAsRelation,
38− ProjectM36.Client.atomFunctionsAsRelation,
39 disconnectedTransactionIsDirty,
35 disconnectedTransactionIsDirty,
40 headName,
36 headName,
41 remoteDBLookupName,
37 remoteDBLookupName,
@@ -44,20 +40,19 @@ module ProjectM36.Client
44 defaultDatabaseName,
40 defaultDatabaseName,
45 defaultRemoteConnectionInfo,
41 defaultRemoteConnectionInfo,
46 defaultHeadName,
42 defaultHeadName,
47− addClientNode,
48 PersistenceStrategy(..),
43 PersistenceStrategy(..),
49 RelationalExpr,
44 RelationalExpr,
50 RelationalExprBase(..),
45 RelationalExprBase(..),
51− DatabaseContextExprBase(..),
52− DatabaseContextExpr,
46+ DatabaseContextExpr(..),
53− DatabaseContextIOExprBase(..),
54− DatabaseContextIOExpr,
47+ DatabaseContextIOExpr(..),
55 Attribute(..),
48 Attribute(..),
56 MergeStrategy(..),
49 MergeStrategy(..),
57 attributesFromList,
50 attributesFromList,
51+ createNodeId,
58 createSessionAtCommit,
52 createSessionAtCommit,
59 createSessionAtHead,
53 createSessionAtHead,
60 closeSession,
54 closeSession,
55+ addClientNode,
61 callTestTimeout_,
56 callTestTimeout_,
62 RelationCardinality(..),
57 RelationCardinality(..),
63 TransactionGraphOperator(..),
58 TransactionGraphOperator(..),
@@ -67,6 +62,7 @@ module ProjectM36.Client
67 TransGraphRelationalExpr,
62 TransGraphRelationalExpr,
68 TransactionIdLookup(..),
63 TransactionIdLookup(..),
69 TransactionIdHeadBacktrack(..),
64 TransactionIdHeadBacktrack(..),
65+ NodeId(..),
70 Atom(..),
66 Atom(..),
71 Session,
67 Session,
72 SessionId,
68 SessionId,
@@ -79,9 +75,8 @@ module ProjectM36.Client
79 databaseContextExprForUniqueKey,
75 databaseContextExprForUniqueKey,
80 databaseContextExprForForeignKey,
76 databaseContextExprForForeignKey,
81 createScriptedAtomFunction,
77 createScriptedAtomFunction,
82− ProjectM36.Client.validateMerkleHashes,
83 AttributeExprBase(..),
78 AttributeExprBase(..),
84− TypeConstructorBase(..),
79+ TypeConstructor(..),
85 TypeConstructorDef(..),
80 TypeConstructorDef(..),
86 DataConstructorDef(..),
81 DataConstructorDef(..),
87 AttributeNamesBase(..),
82 AttributeNamesBase(..),
@@ -89,85 +84,77 @@ module ProjectM36.Client
89 IncDepName,
84 IncDepName,
90 InclusionDependency(..),
85 InclusionDependency(..),
91 AttributeName,
86 AttributeName,
92− DF.DataFrame,
93− DF.DataFrameExpr,
94− DF.AttributeOrderExpr,
95− DF.Order(..),
96 RelationalError(..),
87 RelationalError(..),
97 RequestTimeoutException(..),
88 RequestTimeoutException(..),
98 RemoteProcessDiedException(..),
89 RemoteProcessDiedException(..),
99 AtomType(..),
90 AtomType(..),
100 Atomable(..),
91 Atomable(..),
101 TupleExprBase(..),
92 TupleExprBase(..),
102− TupleExprsBase(..),
103 AtomExprBase(..),
93 AtomExprBase(..),
104 RestrictionPredicateExprBase(..),
94 RestrictionPredicateExprBase(..),
105 withTransaction
95 withTransaction
106 ) where
96 ) where
107import ProjectM36.Base hiding (inclusionDependencies) --defined in this module as well
97import ProjectM36.Base hiding (inclusionDependencies) --defined in this module as well
108import qualified ProjectM36.Base as B
98import qualified ProjectM36.Base as B
109−import ProjectM36.Serialise.Error ()
110import ProjectM36.Error
99import ProjectM36.Error
111import ProjectM36.Atomable
100import ProjectM36.Atomable
112−import ProjectM36.AtomFunction as AF
101+import ProjectM36.AtomFunction
113import ProjectM36.StaticOptimizer
102import ProjectM36.StaticOptimizer
114import ProjectM36.Key
103import ProjectM36.Key
115−import qualified ProjectM36.DataFrame as DF
116−import ProjectM36.DatabaseContextFunction as DCF
117import qualified ProjectM36.IsomorphicSchema as Schema
104import qualified ProjectM36.IsomorphicSchema as Schema
118import Control.Monad.State
105import Control.Monad.State
106+import Control.Monad.Trans.Reader
119import qualified ProjectM36.RelationalExpression as RE
107import qualified ProjectM36.RelationalExpression as RE
120import ProjectM36.DatabaseContext (basicDatabaseContext)
108import ProjectM36.DatabaseContext (basicDatabaseContext)
121import qualified ProjectM36.TransactionGraph as Graph
109import qualified ProjectM36.TransactionGraph as Graph
122−import ProjectM36.TransactionGraph as TG
110+import ProjectM36.TransactionGraph
123import qualified ProjectM36.Transaction as Trans
111import qualified ProjectM36.Transaction as Trans
124import ProjectM36.TransactionGraph.Persist
112import ProjectM36.TransactionGraph.Persist
125import ProjectM36.Attribute
113import ProjectM36.Attribute
126−import ProjectM36.TransGraphRelationalExpression as TGRE (TransGraphRelationalExpr)
114+import ProjectM36.TransGraphRelationalExpression (TransGraphRelationalExpr, evalTransGraphRelationalExpr)
127import ProjectM36.Persist (DiskSync(..))
115import ProjectM36.Persist (DiskSync(..))
128import ProjectM36.FileLock
116import ProjectM36.FileLock
129−import ProjectM36.NormalizeExpr
130import ProjectM36.Notifications
117import ProjectM36.Notifications
131import ProjectM36.Server.RemoteCallTypes
118import ProjectM36.Server.RemoteCallTypes
132import qualified ProjectM36.DisconnectedTransaction as Discon
119import qualified ProjectM36.DisconnectedTransaction as Discon
133import ProjectM36.Relation (typesAsRelation)
120import ProjectM36.Relation (typesAsRelation)
134import ProjectM36.ScriptSession (initScriptSession, ScriptSession)
121import ProjectM36.ScriptSession (initScriptSession, ScriptSession)
135import qualified ProjectM36.Relation as R
122import qualified ProjectM36.Relation as R
123+import qualified ProjectM36.DatabaseContext as DBC
136import Control.Exception.Base
124import Control.Exception.Base
137−import Control.Concurrent.STM
125+import GHC.Conc.Sync
138−import Control.Concurrent.Async
139
126
127+import Network.Transport (Transport(closeTransport))
128+import Network.Transport.TCP (createTransport, defaultTCPParameters, encodeEndPointAddress)
129+import Control.Distributed.Process.Node (newLocalNode, initRemoteTable, runProcess, LocalNode, forkProcess, closeLocalNode)
130+import Control.Distributed.Process.Extras.Internal.Types (whereisRemote)
131+import Control.Distributed.Process.ManagedProcess.Client (call, safeCall)
140import Data.Either (isRight)
132import Data.Either (isRight)
141import Data.UUID.V4 (nextRandom)
133import Data.UUID.V4 (nextRandom)
142import Data.Word
134import Data.Word
143−import Data.Hashable
135+import Control.Distributed.Process (ProcessId, Process, receiveWait, send, match, NodeId(..), reconnect)
144import Control.Exception (IOException, handle, AsyncException, throwIO, fromException, Exception)
136import Control.Exception (IOException, handle, AsyncException, throwIO, fromException, Exception)
145import Control.Concurrent.MVar
137import Control.Concurrent.MVar
146−import Codec.Winery hiding (Schema, schema)
147import qualified Data.Map as M
138import qualified Data.Map as M
148−#if MIN_VERSION_stm_containers(1,0,0)
139+import Control.Distributed.Process.Serializable (Serializable)
149−import qualified StmContainers.Map as StmMap
150−import qualified StmContainers.Set as StmSet
151−#else
152−import qualified STMContainers.Map as StmMap
140+import qualified STMContainers.Map as STMMap
153−import qualified STMContainers.Set as StmSet
141+import qualified STMContainers.Set as STMSet
154−#endif
155import qualified ProjectM36.Session as Sess
142import qualified ProjectM36.Session as Sess
156import ProjectM36.Session
143import ProjectM36.Session
157import ProjectM36.Sessions
144import ProjectM36.Sessions
145+import ListT
146+import Data.Binary (Binary)
158import GHC.Generics (Generic)
147import GHC.Generics (Generic)
159import Control.DeepSeq (force)
148import Control.DeepSeq (force)
160import System.IO
149import System.IO
161import Data.Time.Clock
150import Data.Time.Clock
162−import qualified Network.RPC.Curryer.Client as RPC
163−import qualified Network.RPC.Curryer.Server as RPC
164−import Network.Socket (Socket, AddrInfo(..), getAddrInfo, defaultHints, AddrInfoFlag(..), SocketType(..), ServiceName, hostAddressToTuple, SockAddr(..))
165−import GHC.Conc (unsafeIOToSTM)
166
151
167type Hostname = String
152type Hostname = String
168
153
169type Port = Word16
154type Port = Word16
170
155
156+type DatabaseName = String
157+
171-- | The type for notifications callbacks in the client. When a registered notification fires due to a changed relational expression evaluation, the server propagates the notifications to the clients in the form of the callback.
158-- | The type for notifications callbacks in the client. When a registered notification fires due to a changed relational expression evaluation, the server propagates the notifications to the clients in the form of the callback.
172type NotificationCallback = NotificationName -> EvaluatedNotification -> IO ()
159type NotificationCallback = NotificationName -> EvaluatedNotification -> IO ()
173
160
@@ -187,16 +174,15 @@ data RequestTimeoutException = RequestTimeoutException
187
174
188instance Exception RequestTimeoutException
175instance Exception RequestTimeoutException
189
176
190−-- | Construct a 'ConnectionInfo' to describe how to make the 'Connection'. The database can be run within the current process or running remotely via RPC.
177+-- | Construct a 'ConnectionInfo' to describe how to make the 'Connection'. The database can be run within the current process or running remotely via distributed-process.
191−data ConnectionInfo = InProcessConnectionInfo PersistenceStrategy NotificationCallback [GhcPkgPath] |
178+data ConnectionInfo = InProcessConnectionInfo PersistenceStrategy NotificationCallback [GhcPkgPath]|
192− RemoteConnectionInfo DatabaseName Hostname ServiceName NotificationCallback
179+ RemoteProcessConnectionInfo DatabaseName NodeId NotificationCallback
193
180
194type EvaluatedNotifications = M.Map NotificationName EvaluatedNotification
181type EvaluatedNotifications = M.Map NotificationName EvaluatedNotification
195
182
196-- | Used for callbacks from the server when monitored changes have been made.
183-- | Used for callbacks from the server when monitored changes have been made.
197newtype NotificationMessage = NotificationMessage EvaluatedNotifications
184newtype NotificationMessage = NotificationMessage EvaluatedNotifications
198− deriving (Eq, Show, Generic)
185+ deriving (Binary, Eq, Show, Generic)
199− deriving Serialise via WineryVariant NotificationMessage
200
186
201-- | When a notification is fired, the 'reportOldExpr' is evaluated in the commit's pre-change context while the 'reportNewExpr' is evaluated in the post-change context and they are returned along with the original notification.
187-- | When a notification is fired, the 'reportOldExpr' is evaluated in the commit's pre-change context while the 'reportNewExpr' is evaluated in the post-change context and they are returned along with the original notification.
202data EvaluatedNotification = EvaluatedNotification {
188data EvaluatedNotification = EvaluatedNotification {
@@ -204,10 +190,13 @@ data EvaluatedNotification = EvaluatedNotification {
204 reportOldRelation :: Either RelationalError Relation,
190 reportOldRelation :: Either RelationalError Relation,
205 reportNewRelation :: Either RelationalError Relation
191 reportNewRelation :: Either RelationalError Relation
206 }
192 }
207− deriving (Eq, Show, Generic)
193+ deriving(Binary, Eq, Show, Generic)
208− deriving Serialise via WineryRecord EvaluatedNotification
209
194
210
195
196+-- | Create a 'NodeId' for use in connecting to a remote server using distributed-process.
197+createNodeId :: Hostname -> Port -> NodeId
198+createNodeId host port = NodeId $ encodeEndPointAddress host (show port) 1
199+
211-- | Use this for connecting to remote servers on the default port.
200-- | Use this for connecting to remote servers on the default port.
212defaultServerPort :: Port
201defaultServerPort :: Port
213defaultServerPort = 6543
202defaultServerPort = 6543
@@ -222,107 +211,127 @@ defaultHeadName = "master"
222
211
223-- | Create a connection configuration which connects to the localhost on the default server port and default server database name. The configured notification callback is set to ignore all events.
212-- | Create a connection configuration which connects to the localhost on the default server port and default server database name. The configured notification callback is set to ignore all events.
224defaultRemoteConnectionInfo :: ConnectionInfo
213defaultRemoteConnectionInfo :: ConnectionInfo
225−defaultRemoteConnectionInfo =
226− RemoteConnectionInfo defaultDatabaseName defaultServerHostname (show defaultServerPort) emptyNotificationCallback
214+defaultRemoteConnectionInfo = RemoteProcessConnectionInfo defaultDatabaseName (createNodeId "127.0.0.1" defaultServerPort) emptyNotificationCallback
215+
216+-- | The 'Connection' represents either local or remote access to a database. All operations flow through the connection.
217+type ClientNodes = STMSet.Set ProcessId
227
218
228−defaultServerHostname :: Hostname
219+-- internal structure specific to in-process connections
229−defaultServerHostname = "localhost"
220+data InProcessConnectionConf = InProcessConnectionConf {
221+ ipPersistenceStrategy :: PersistenceStrategy,
222+ ipClientNodes :: ClientNodes,
223+ ipSessions :: Sessions,
224+ ipTransactionGraph :: TVar TransactionGraph,
225+ ipScriptSession :: Maybe ScriptSession,
226+ ipLocalNode :: LocalNode,
227+ ipTransport :: Transport, -- we hold onto this so that we can close it gracefully
228+ ipLocks :: Maybe (LockFile, MVar LockFileHash) -- nothing when NoPersistence
229+ }
230
230
231−newtype RemoteConnectionConf = RemoteConnectionConf RPC.Connection
231+data RemoteProcessConnectionConf = RemoteProcessConnectionConf {
232+ rLocalNode :: LocalNode,
233+ rProcessId :: ProcessId, --remote processId
234+ rTransport :: Transport --the TCP socket transport
235+ }
232
236
233data Connection = InProcessConnection InProcessConnectionConf |
237data Connection = InProcessConnection InProcessConnectionConf |
234− RemoteConnection RemoteConnectionConf
238+ RemoteProcessConnection RemoteProcessConnectionConf
235
239
236-- | There are several reasons why a connection can fail.
240-- | There are several reasons why a connection can fail.
237data ConnectionError = SetupDatabaseDirectoryError PersistenceError |
241data ConnectionError = SetupDatabaseDirectoryError PersistenceError |
238 IOExceptionError IOException |
242 IOExceptionError IOException |
239 NoSuchDatabaseByNameError DatabaseName |
243 NoSuchDatabaseByNameError DatabaseName |
240− DatabaseValidationError [MerkleValidationError] |
241 LoginError
244 LoginError
242 deriving (Show, Eq, Generic)
245 deriving (Show, Eq, Generic)
243
246
244remoteDBLookupName :: DatabaseName -> String
247remoteDBLookupName :: DatabaseName -> String
245remoteDBLookupName = (++) "db-"
248remoteDBLookupName = (++) "db-"
246
249
250+createLocalNode :: IO (LocalNode, Transport)
251+createLocalNode = do
252+ eLocalTransport <- createTransport "127.0.0.1" "0" defaultTCPParameters
253+ case eLocalTransport of
254+ Left err -> error ("failed to create transport: " ++ show err)
255+ Right localTransport -> do
256+ localNode <- newLocalNode localTransport initRemoteTable
257+ pure (localNode, localTransport)
258+
259+notificationListener :: NotificationCallback -> Process ()
260+notificationListener callback = do
261+ --pid <- getSelfPid
262+ --liftIO $ putStrLn $ "LISTENER THREAD START " ++ show pid
263+ _ <- forever $
264+ receiveWait [
265+ match (\(NotificationMessage eNots) ->
266+ --say $ "NOTIFICATION: " ++ show eNots
267+ -- when notifications are thrown, they are not adjusted for the current schema which could be problematic, but we don't have access to the current session here
268+ liftIO $ mapM_ (uncurry callback) (M.toList eNots)
269+ )
270+ ]
271+ --say "LISTENER THREAD EXIT"
272+ pure ()
273+
274+startNotificationListener :: LocalNode -> NotificationCallback -> IO ProcessId
275+startNotificationListener localNode callback = forkProcess localNode (notificationListener callback)
276+
247createScriptSession :: [String] -> IO (Maybe ScriptSession)
277createScriptSession :: [String] -> IO (Maybe ScriptSession)
248createScriptSession ghcPkgPaths = do
278createScriptSession ghcPkgPaths = do
249 eScriptSession <- initScriptSession ghcPkgPaths
279 eScriptSession <- initScriptSession ghcPkgPaths
250 case eScriptSession of
280 case eScriptSession of
251− Left err -> hPutStrLn stderr ("Warning: Haskell scripting disabled: " ++ show err) >> pure Nothing --not a fatal error, but the scripting feature must be disabled
281+ Left err -> hPutStrLn stderr ("Failed to load scripting engine- scripting disabled: " ++ show err) >> pure Nothing --not a fatal error, but the scripting feature must be disabled
252 Right s -> pure (Just s)
282 Right s -> pure (Just s)
253
283
254−
255-- | To create a 'Connection' to a remote or local database, create a 'ConnectionInfo' and call 'connectProjectM36'.
284-- | To create a 'Connection' to a remote or local database, create a 'ConnectionInfo' and call 'connectProjectM36'.
256connectProjectM36 :: ConnectionInfo -> IO (Either ConnectionError Connection)
285connectProjectM36 :: ConnectionInfo -> IO (Either ConnectionError Connection)
257--create a new in-memory database/transaction graph
286--create a new in-memory database/transaction graph
258connectProjectM36 (InProcessConnectionInfo strat notificationCallback ghcPkgPaths) = do
287connectProjectM36 (InProcessConnectionInfo strat notificationCallback ghcPkgPaths) = do
259 freshId <- nextRandom
288 freshId <- nextRandom
260− tstamp <- getCurrentTime
289+ stamp <- getCurrentTime
261 let bootstrapContext = basicDatabaseContext
290 let bootstrapContext = basicDatabaseContext
262− freshGraph = bootstrapTransactionGraph tstamp freshId bootstrapContext
291+ freshGraph = bootstrapTransactionGraph stamp freshId bootstrapContext
263 case strat of
292 case strat of
264 --create date examples graph for now- probably should be empty context in the future
293 --create date examples graph for now- probably should be empty context in the future
265 NoPersistence -> do
294 NoPersistence -> do
266 graphTvar <- newTVarIO freshGraph
295 graphTvar <- newTVarIO freshGraph
267− clientNodes <- StmSet.newIO
296+ clientNodes <- STMSet.newIO
268− sessions <- StmMap.newIO
297+ sessions <- STMMap.newIO
298+ (localNode, transport) <- createLocalNode
299+ notificationPid <- startNotificationListener localNode notificationCallback
269 mScriptSession <- createScriptSession ghcPkgPaths
300 mScriptSession <- createScriptSession ghcPkgPaths
270− notifAsync <- startNotificationListener clientNodes notificationCallback
301+
271 let conn = InProcessConnection InProcessConnectionConf {
302 let conn = InProcessConnection InProcessConnectionConf {
272 ipPersistenceStrategy = strat,
303 ipPersistenceStrategy = strat,
273 ipClientNodes = clientNodes,
304 ipClientNodes = clientNodes,
274 ipSessions = sessions,
305 ipSessions = sessions,
275 ipTransactionGraph = graphTvar,
306 ipTransactionGraph = graphTvar,
276 ipScriptSession = mScriptSession,
307 ipScriptSession = mScriptSession,
308+ ipLocalNode = localNode,
309+ ipTransport = transport,
277− ipLocks = Nothing,
310+ ipLocks = Nothing}
278− ipCallbackAsync = notifAsync
311+ addClientNode conn notificationPid
279− }
280 pure (Right conn)
312 pure (Right conn)
281 MinimalPersistence dbdir -> connectPersistentProjectM36 strat NoDiskSync dbdir freshGraph notificationCallback ghcPkgPaths
313 MinimalPersistence dbdir -> connectPersistentProjectM36 strat NoDiskSync dbdir freshGraph notificationCallback ghcPkgPaths
282 CrashSafePersistence dbdir -> connectPersistentProjectM36 strat FsyncDiskSync dbdir freshGraph notificationCallback ghcPkgPaths
314 CrashSafePersistence dbdir -> connectPersistentProjectM36 strat FsyncDiskSync dbdir freshGraph notificationCallback ghcPkgPaths
283
315
284−connectProjectM36 (RemoteConnectionInfo dbName hostName servicePort notificationCallback) = do
316+connectProjectM36 (RemoteProcessConnectionInfo databaseName serverNodeId notificationCallback) = do
285− --TODO- add notification callback thread
317+ connStatus <- newEmptyMVar
286− let resolutionHints = defaultHints { addrFlags = [AI_NUMERICHOST, AI_NUMERICSERV],
318+ (localNode, transport) <- createLocalNode
287− addrSocketType = Stream
319+ let dbName = remoteDBLookupName databaseName
288− }
320+ --putStrLn $ "Connecting to " ++ show serverNodeId ++ " " ++ dbName
289− resolved <- getAddrInfo (Just resolutionHints) (Just hostName) (Just servicePort)
321+ notificationListenerPid <- startNotificationListener localNode notificationCallback
290− case resolved of
322+ runProcess localNode $ do
291− [] -> error ("DNS resolution failed for" <> hostName <> ":" <> servicePort)
323+ --even a failed connection retains an open socket!
292− addrInfo:_ -> do
324+ mServerProcessId <- whereisRemote serverNodeId dbName
293− --supports IPv4 only for now
325+ case mServerProcessId of
294− let (SockAddrInet port addr) = addrAddress addrInfo
326+ Nothing -> liftIO $ putMVar connStatus $ Left (NoSuchDatabaseByNameError databaseName)
295− notificationHandlers =
327+ Just serverProcessId -> do
296− [RPC.ClientAsyncRequestHandler $
328+ loginConfirmation <- safeLogin (Login notificationListenerPid) serverProcessId
297− \(NotificationMessage notifications') ->
329+ if not loginConfirmation then
298− forM_ (M.toList notifications') (uncurry notificationCallback)
330+ liftIO $ putMVar connStatus (Left LoginError)
299− ]
331+ else
300− let connectExcHandler (e :: IOException) = pure $ Left (IOExceptionError e)
332+ liftIO $ putMVar connStatus (Right $ RemoteProcessConnection RemoteProcessConnectionConf {rLocalNode = localNode, rProcessId = serverProcessId, rTransport = transport})
301− eConn <- (Right <$> RPC.connect notificationHandlers (hostAddressToTuple addr) port) `catch` connectExcHandler
333+ status <- takeMVar connStatus
302− case eConn of
334+ pure status
303− Left err -> pure (Left err)
304− Right conn -> do
305− eRet <- RPC.call conn (Login dbName)
306− case eRet of
307− Left err -> error (show err)
308− Right False -> error "wtf"
309− Right True ->
310− --TODO handle connection errors!
311− pure (Right (RemoteConnection (RemoteConnectionConf conn)))
312−
313−--convert RPC errors into exceptions
314−convertRPCErrors :: RPC.ConnectionError -> IO a
315−convertRPCErrors err =
316− case err of
317− RPC.TimeoutError -> throw RequestTimeoutException
318− RPC.CodecError msg -> error $ "decoding message failed on server: " <> msg
319− RPC.ExceptionError msg -> error $ "server threw exception: " <> msg
320−
321−addClientNode :: Connection -> RPC.Locking Socket -> IO ()
322−addClientNode (RemoteConnection _) _ = error "addClientNode called on remote connection"
323−addClientNode (InProcessConnection conf) lockSock = atomically (StmSet.insert clientInfo (ipClientNodes conf))
324− where
325− clientInfo = RemoteClientInfo lockSock
326
335
327connectPersistentProjectM36 :: PersistenceStrategy ->
336connectPersistentProjectM36 :: PersistenceStrategy ->
328 DiskSync ->
337 DiskSync ->
@@ -341,57 +350,49 @@ connectPersistentProjectM36 strat sync dbdir freshGraph notificationCallback ghc
341 case graph of
350 case graph of
342 Left err' -> return $ Left (SetupDatabaseDirectoryError err')
351 Left err' -> return $ Left (SetupDatabaseDirectoryError err')
343 Right graph' -> do
352 Right graph' -> do
344− case TG.validateMerkleHashes graph' of
345− Left merkleErrs -> pure (Left (DatabaseValidationError merkleErrs))
346− Right _ -> do
347− tvarGraph <- newTVarIO graph'
353+ tvarGraph <- newTVarIO graph'
348− sessions <- StmMap.newIO
354+ sessions <- STMMap.newIO
349− clientNodes <- StmSet.newIO
355+ clientNodes <- STMSet.newIO
356+ (localNode, transport) <- createLocalNode
350− lockMVar <- newMVar digest
357+ lockMVar <- newMVar digest
351− notifAsync <- startNotificationListener clientNodes notificationCallback
352− let conn = InProcessConnection InProcessConnectionConf {
358+ let conn = InProcessConnection InProcessConnectionConf {
353 ipPersistenceStrategy = strat,
359 ipPersistenceStrategy = strat,
354 ipClientNodes = clientNodes,
360 ipClientNodes = clientNodes,
355 ipSessions = sessions,
361 ipSessions = sessions,
356 ipTransactionGraph = tvarGraph,
362 ipTransactionGraph = tvarGraph,
357 ipScriptSession = mScriptSession,
363 ipScriptSession = mScriptSession,
364+ ipLocalNode = localNode,
365+ ipTransport = transport,
358− ipLocks = Just (lockFileH, lockMVar),
366+ ipLocks = Just (lockFileH, lockMVar)
359− ipCallbackAsync = notifAsync
360 }
367 }
361− pure (Right conn)
362−
363−--startup local async process to handle notification callbacks
364−startNotificationListener :: ClientNodes -> NotificationCallback -> IO (Async ())
365−startNotificationListener cNodes notificationCallback = do
366− inProcessClientInfo@(InProcessClientInfo notifMVar) <- InProcessClientInfo <$> newEmptyMVar
367− atomically $ StmSet.insert inProcessClientInfo cNodes
368− async $ forever $ do
369− notifs <- takeMVar notifMVar
370− forM_ (M.toList notifs) $ uncurry notificationCallback
371
368
369+ notificationPid <- startNotificationListener localNode notificationCallback
370+ addClientNode conn notificationPid
371+ pure (Right conn)
372+
372-- | Create a new session at the transaction id and return the session's Id.
373-- | Create a new session at the transaction id and return the session's Id.
373createSessionAtCommit :: Connection -> TransactionId -> IO (Either RelationalError SessionId)
374createSessionAtCommit :: Connection -> TransactionId -> IO (Either RelationalError SessionId)
374createSessionAtCommit conn@(InProcessConnection _) commitId = do
375createSessionAtCommit conn@(InProcessConnection _) commitId = do
375 newSessionId <- nextRandom
376 newSessionId <- nextRandom
376 atomically $ createSessionAtCommit_ commitId newSessionId conn
377 atomically $ createSessionAtCommit_ commitId newSessionId conn
377−createSessionAtCommit conn@(RemoteConnection _) uuid = remoteCall conn (CreateSessionAtCommit uuid)
378+createSessionAtCommit conn@(RemoteProcessConnection _) uuid = remoteCall conn (CreateSessionAtCommit uuid)
378
379
379createSessionAtCommit_ :: TransactionId -> SessionId -> Connection -> STM (Either RelationalError SessionId)
380createSessionAtCommit_ :: TransactionId -> SessionId -> Connection -> STM (Either RelationalError SessionId)
380createSessionAtCommit_ commitId newSessionId (InProcessConnection conf) = do
381createSessionAtCommit_ commitId newSessionId (InProcessConnection conf) = do
381 let sessions = ipSessions conf
382 let sessions = ipSessions conf
382 graphTvar = ipTransactionGraph conf
383 graphTvar = ipTransactionGraph conf
383 graph <- readTVar graphTvar
384 graph <- readTVar graphTvar
384− case RE.transactionForId commitId graph of
385+ case transactionForId commitId graph of
385 Left err -> pure (Left err)
386 Left err -> pure (Left err)
386 Right transaction -> do
387 Right transaction -> do
387 let freshDiscon = DisconnectedTransaction commitId (Trans.schemas transaction) False
388 let freshDiscon = DisconnectedTransaction commitId (Trans.schemas transaction) False
388− keyDuplication <- StmMap.lookup newSessionId sessions
389+ keyDuplication <- STMMap.lookup newSessionId sessions
389 case keyDuplication of
390 case keyDuplication of
390 Just _ -> pure $ Left (SessionIdInUseError newSessionId)
391 Just _ -> pure $ Left (SessionIdInUseError newSessionId)
391 Nothing -> do
392 Nothing -> do
392− StmMap.insert (Session freshDiscon defaultSchemaName) newSessionId sessions
393+ STMMap.insert (Session freshDiscon defaultSchemaName) newSessionId sessions
393 pure $ Right newSessionId
394 pure $ Right newSessionId
394−createSessionAtCommit_ _ _ (RemoteConnection _) = error "createSessionAtCommit_ called on remote connection"
395+createSessionAtCommit_ _ _ (RemoteProcessConnection _) = error "createSessionAtCommit_ called on remote connection"
395
396
396-- | Call 'createSessionAtHead' with a transaction graph's head's name to create a new session pinned to that head. This function returns a 'SessionId' which can be used in other function calls to reference the point in the transaction graph.
397-- | Call 'createSessionAtHead' with a transaction graph's head's name to create a new session pinned to that head. This function returns a 'SessionId' which can be used in other function calls to reference the point in the transaction graph.
397createSessionAtHead :: Connection -> HeadName -> IO (Either RelationalError SessionId)
398createSessionAtHead :: Connection -> HeadName -> IO (Either RelationalError SessionId)
@@ -403,38 +404,42 @@ createSessionAtHead conn@(InProcessConnection conf) headn = do
403 case transactionForHead headn graph of
404 case transactionForHead headn graph of
404 Nothing -> pure $ Left (NoSuchHeadNameError headn)
405 Nothing -> pure $ Left (NoSuchHeadNameError headn)
405 Just trans -> createSessionAtCommit_ (transactionId trans) newSessionId conn
406 Just trans -> createSessionAtCommit_ (transactionId trans) newSessionId conn
406−createSessionAtHead conn@(RemoteConnection _) headn = remoteCall conn (CreateSessionAtHead headn)
407+createSessionAtHead conn@(RemoteProcessConnection _) headn = remoteCall conn (CreateSessionAtHead headn)
408+
409+-- | Used internally for server connections to keep track of remote nodes for the purpose of sending notifications later.
410+addClientNode :: Connection -> ProcessId -> IO ()
411+addClientNode (RemoteProcessConnection _) _ = error "addClientNode called on remote connection"
412+addClientNode (InProcessConnection conf) newProcessId = atomically (STMSet.insert newProcessId (ipClientNodes conf))
407
413
408-- | Discards a session, eliminating any uncommitted changes present in the session.
414-- | Discards a session, eliminating any uncommitted changes present in the session.
409closeSession :: SessionId -> Connection -> IO ()
415closeSession :: SessionId -> Connection -> IO ()
410closeSession sessionId (InProcessConnection conf) =
416closeSession sessionId (InProcessConnection conf) =
411− atomically $ StmMap.delete sessionId (ipSessions conf)
417+ atomically $ STMMap.delete sessionId (ipSessions conf)
412−closeSession sessionId conn@(RemoteConnection _) = remoteCall conn (CloseSession sessionId)
418+closeSession sessionId conn@(RemoteProcessConnection _) = remoteCall conn (CloseSession sessionId)
413
419
414-- | 'close' cleans up the database access connection and closes any relevant sockets.
420-- | 'close' cleans up the database access connection and closes any relevant sockets.
415close :: Connection -> IO ()
421close :: Connection -> IO ()
416close (InProcessConnection conf) = do
422close (InProcessConnection conf) = do
417− cancel (ipCallbackAsync conf)
418 atomically $ do
423 atomically $ do
419 let sessions = ipSessions conf
424 let sessions = ipSessions conf
420−#if MIN_VERSION_stm_containers(1,0,0)
421− StmMap.reset sessions
422−#else
423− StmMap.deleteAll sessions
425+ STMMap.deleteAll sessions
424−#endif
425 pure ()
426 pure ()
427+ closeLocalNode (ipLocalNode conf)
428+ closeTransport (ipTransport conf)
426 let mLocks = ipLocks conf
429 let mLocks = ipLocks conf
427 case mLocks of
430 case mLocks of
428 Nothing -> pure ()
431 Nothing -> pure ()
429 Just (lockFileH, _) -> closeLockFile lockFileH
432 Just (lockFileH, _) -> closeLockFile lockFileH
430
433
431−close (RemoteConnection (RemoteConnectionConf conn)) =
434+close conn@(RemoteProcessConnection conf) = do
432− RPC.close conn
435+ _ <- remoteCall conn Logout :: IO Bool
436+ closeLocalNode (rLocalNode conf)
437+ closeTransport (rTransport conf)
433
438
434--used only by the server EntryPoints
439--used only by the server EntryPoints
435closeRemote_ :: Connection -> IO ()
440closeRemote_ :: Connection -> IO ()
436closeRemote_ (InProcessConnection _) = error "invalid call of closeRemote_ on InProcessConnection"
441closeRemote_ (InProcessConnection _) = error "invalid call of closeRemote_ on InProcessConnection"
437−closeRemote_ (RemoteConnection (RemoteConnectionConf conn)) = RPC.close conn
442+closeRemote_ (RemoteProcessConnection conf) = runProcess (rLocalNode conf) (reconnect (rProcessId conf))
438
443
439 --we need to actually close the localNode's connection to the remote
444 --we need to actually close the localNode's connection to the remote
440--within the database server, we must catch and handle all exception lest they take down the database process- this handling might be different for other use-cases
445--within the database server, we must catch and handle all exception lest they take down the database process- this handling might be different for other use-cases
@@ -445,19 +450,40 @@ excEither = handle handler
445 where
450 where
446 handler exc | Just (_ :: AsyncException) <- fromException exc = throwIO exc
451 handler exc | Just (_ :: AsyncException) <- fromException exc = throwIO exc
447 | otherwise = pure (Left (UnhandledExceptionError (show exc)))
452 | otherwise = pure (Left (UnhandledExceptionError (show exc)))
453+
454+runProcessResult :: LocalNode -> Process a -> IO a
455+runProcessResult localNode proc = do
456+ ret <- newEmptyMVar
457+ runProcess localNode $ do
458+ val <- proc
459+ liftIO $ putMVar ret val
460+ takeMVar ret
461+
462+safeLogin :: Login -> ProcessId -> Process Bool
463+safeLogin login procId = do
464+ ret <- call procId login
465+ case ret of
466+ Left (_ :: ServerError) -> pure False
467+ Right val -> pure val
448
468
449−
450−remoteCall :: (Serialise a, Serialise b) => Connection -> a -> IO b
469+remoteCall :: (Serializable a, Serializable b) => Connection -> a -> IO b
451remoteCall (InProcessConnection _ ) _ = error "remoteCall called on local connection"
470remoteCall (InProcessConnection _ ) _ = error "remoteCall called on local connection"
452−remoteCall (RemoteConnection (RemoteConnectionConf rpcConn)) arg = do
471+remoteCall (RemoteProcessConnection conf) arg = runProcessResult localNode $ do
453− eRet <- RPC.call rpcConn arg
472+ ret <- safeCall serverProcessId arg
454− case eRet of
473+ case ret of
455− Left err -> convertRPCErrors err
474+ Left err -> error ("server died: " ++ show err)
475+ Right ret' -> case ret' of
476+ Left RequestTimeoutError -> liftIO (throwIO RequestTimeoutException)
477+ Left (ProcessDiedError _) -> liftIO (throwIO RemoteProcessDiedException)
456− Right val -> pure val
478+ Right val -> pure val
479+ where
480+ localNode = rLocalNode conf
481+ serverProcessId = rProcessId conf
457
482
458sessionForSessionId :: SessionId -> Sessions -> STM (Either RelationalError Session)
483sessionForSessionId :: SessionId -> Sessions -> STM (Either RelationalError Session)
459−sessionForSessionId sessionId sessions =
484+sessionForSessionId sessionId sessions = do
485+ maybeSession <- STMMap.lookup sessionId sessions
460− maybe (Left $ NoSuchSessionError sessionId) Right <$> StmMap.lookup sessionId sessions
486+ pure $ maybe (Left $ NoSuchSessionError sessionId) Right maybeSession
461
487
462schemaForSessionId :: Session -> STM (Either RelationalError Schema)
488schemaForSessionId :: Session -> STM (Either RelationalError Schema)
463schemaForSessionId session = do
489schemaForSessionId session = do
@@ -488,7 +514,7 @@ currentSchemaName sessionId (InProcessConnection conf) = atomically $ do
488 case eSession of
514 case eSession of
489 Left err -> pure (Left err)
515 Left err -> pure (Left err)
490 Right session -> pure (Right (Sess.schemaName session))
516 Right session -> pure (Right (Sess.schemaName session))
491−currentSchemaName sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveCurrentSchemaName sessionId)
517+currentSchemaName sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveCurrentSchemaName sessionId)
492
518
493-- | Switch to the named isomorphic schema.
519-- | Switch to the named isomorphic schema.
494setCurrentSchemaName :: SessionId -> Connection -> SchemaName -> IO (Either RelationalError ())
520setCurrentSchemaName :: SessionId -> Connection -> SchemaName -> IO (Either RelationalError ())
@@ -499,8 +525,8 @@ setCurrentSchemaName sessionId (InProcessConnection conf) sname = atomically $ d
499 Left err -> pure (Left err)
525 Left err -> pure (Left err)
500 Right session -> case Sess.setSchemaName sname session of
526 Right session -> case Sess.setSchemaName sname session of
501 Left err -> pure (Left err)
527 Left err -> pure (Left err)
502− Right newSession -> StmMap.insert newSession sessionId sessions >> pure (Right ())
528+ Right newSession -> STMMap.insert newSession sessionId sessions >> pure (Right ())
503−setCurrentSchemaName sessionId conn@(RemoteConnection _) sname = remoteCall conn (ExecuteSetCurrentSchema sessionId sname)
529+setCurrentSchemaName sessionId conn@(RemoteProcessConnection _) sname = remoteCall conn (ExecuteSetCurrentSchema sessionId sname)
504
530
505-- | Execute a relational expression in the context of the session and connection. Relational expressions are queries and therefore cannot alter the database.
531-- | Execute a relational expression in the context of the session and connection. Relational expressions are queries and therefore cannot alter the database.
506executeRelationalExpr :: SessionId -> Connection -> RelationalExpr -> IO (Either RelationalError Relation)
532executeRelationalExpr :: SessionId -> Connection -> RelationalExpr -> IO (Either RelationalError Relation)
@@ -516,15 +542,14 @@ executeRelationalExpr sessionId (InProcessConnection conf) expr = excEither $ at
516 Right expr
542 Right expr
517 case expr' of
543 case expr' of
518 Left err -> pure (Left err)
544 Left err -> pure (Left err)
519− Right expr'' -> do
545+ Right expr'' -> case optimizeRelationalExpr (Sess.concreteDatabaseContext session) expr'' of
520− let graphTvar = ipTransactionGraph conf
546+ Left err -> pure (Left err)
521− graph <- readTVar graphTvar
547+ Right optExpr -> do
522− let reEnv = RE.mkRelationalExprEnv (Sess.concreteDatabaseContext session) graph
548+ let evald = runReader (RE.evalRelationalExpr optExpr) (RE.mkRelationalExprState (Sess.concreteDatabaseContext session))
523− case optimizeAndEvalRelationalExpr reEnv expr'' of
549+ case evald of
550+ Left err -> pure (Left err)
524− Right rel -> pure (force (Right rel)) -- this is necessary so that any undefined/error exceptions are spit out here
551+ Right rel -> pure (force (Right rel)) -- this is necessary so that any undefined/error exceptions are spit out here
525− Left err -> pure (Left err)
526−
527−executeRelationalExpr sessionId conn@(RemoteConnection _) relExpr = remoteCall conn (ExecuteRelationalExpr sessionId relExpr)
552+executeRelationalExpr sessionId conn@(RemoteProcessConnection _) relExpr = remoteCall conn (ExecuteRelationalExpr sessionId relExpr)
528
553
529-- | Execute a database context expression in the context of the session and connection. Database expressions modify the current session's disconnected transaction but cannot modify the transaction graph.
554-- | Execute a database context expression in the context of the session and connection. Database expressions modify the current session's disconnected transaction but cannot modify the transaction graph.
530executeDatabaseContextExpr :: SessionId -> Connection -> DatabaseContextExpr -> IO (Either RelationalError ())
555executeDatabaseContextExpr :: SessionId -> Connection -> DatabaseContextExpr -> IO (Either RelationalError ())
@@ -540,54 +565,41 @@ executeDatabaseContextExpr sessionId (InProcessConnection conf) expr = excEither
540 Schema.processDatabaseContextExprInSchema schema expr
565 Schema.processDatabaseContextExprInSchema schema expr
541 case expr' of
566 case expr' of
542 Left err -> pure (Left err)
567 Left err -> pure (Left err)
543− Right expr'' -> do
568+ Right expr'' -> case runState (do
544− graph <- readTVar (ipTransactionGraph conf)
569+ eOptExpr <- applyStaticDatabaseOptimization expr''
570+ case eOptExpr of
571+ Left err -> pure (Left err)
572+ Right optExpr ->
545− let ctx = Sess.concreteDatabaseContext session
573+ RE.evalDatabaseContextExpr optExpr) (RE.freshDatabaseState (Sess.concreteDatabaseContext session)) of
546− env = RE.mkDatabaseContextEvalEnv transId graph
547− transId = Sess.parentId session
548− case RE.runDatabaseContextEvalMonad ctx env (optimizeAndEvalDatabaseContextExpr True expr'') of
549− Left err -> pure (Left err)
574+ (Left err,_) -> pure (Left err)
550− Right newState ->
551− if not (RE.dbc_dirty newState) then --nothing dirtied, nothing to do
575+ (Right (), (_,_,False)) -> pure (Right ()) --optimization- if nothing was dirtied, nothing to do
552− pure (Right ())
576+ (Right (), (!context',_,True)) -> do
553− else do
554− let newDiscon = DisconnectedTransaction (Sess.parentId session) newSchemas True
577+ let newDiscon = DisconnectedTransaction (Sess.parentId session) newSchemas True
555− context' = RE.dbc_context newState
556− newSubschemas = Schema.processDatabaseContextExprSchemasUpdate (Sess.subschemas session) expr
578+ newSubschemas = Schema.processDatabaseContextExprSchemasUpdate (Sess.subschemas session) expr
557− newSchemas = Schemas context' newSubschemas
579+ newSchemas = Schemas context' newSubschemas
558− newSession = Session newDiscon (Sess.schemaName session)
580+ newSession = Session newDiscon (Sess.schemaName session)
559− StmMap.insert newSession sessionId sessions
581+ STMMap.insert newSession sessionId sessions
560− pure (Right ())
582+ pure (Right ())
561−executeDatabaseContextExpr sessionId conn@(RemoteConnection _) dbExpr = remoteCall conn (ExecuteDatabaseContextExpr sessionId dbExpr)
583+executeDatabaseContextExpr sessionId conn@(RemoteProcessConnection _) dbExpr = remoteCall conn (ExecuteDatabaseContextExpr sessionId dbExpr)
562−
584+
563−-- | Similar to a git rebase, 'autoMergeToHead' atomically creates a temporary branch and merges it to the latest commit of the branch referred to by the 'HeadName' and commits the merge. This is useful to reduce incidents of 'TransactionIsNotAHeadError's but at the risk of merge errors (thus making it similar to rebasing). Alternatively, as an optimization, if a simple commit is possible (meaning that the head has not changed), then a fast-forward commit takes place instead.
585+-- | Similar to a git rebase, 'autoMergeToHead' atomically creates a temporary branch and merges it to the latest commit of the branch referred to by the 'HeadName' and commits the merge. This is useful to reduce incidents of 'TransactionIsNotAHeadError's but at the risk of merge errors (thus making it similar to rebasing).
564autoMergeToHead :: SessionId -> Connection -> MergeStrategy -> HeadName -> IO (Either RelationalError ())
586autoMergeToHead :: SessionId -> Connection -> MergeStrategy -> HeadName -> IO (Either RelationalError ())
565autoMergeToHead sessionId (InProcessConnection conf) strat headName' = do
587autoMergeToHead sessionId (InProcessConnection conf) strat headName' = do
566 let sessions = ipSessions conf
588 let sessions = ipSessions conf
567 id1 <- nextRandom
589 id1 <- nextRandom
568 id2 <- nextRandom
590 id2 <- nextRandom
569 id3 <- nextRandom
591 id3 <- nextRandom
570− tstamp <- getCurrentTime
592+ stamp <- getCurrentTime
571 commitLock_ sessionId conf $ \graph -> do
593 commitLock_ sessionId conf $ \graph -> do
572 eSession <- sessionForSessionId sessionId sessions
594 eSession <- sessionForSessionId sessionId sessions
573 case eSession of
595 case eSession of
574 Left err -> pure (Left err)
596 Left err -> pure (Left err)
575− Right session ->
597+ Right session ->
576− case Graph.transactionForHead headName' graph of
577− Nothing -> pure (Left (NoSuchHeadNameError headName'))
578− Just headTrans -> do
579− --attempt fast-forward commit, if possible
580− let graphInfo = if Sess.parentId session == transactionId headTrans then do
581− ret <- Graph.evalGraphOp tstamp id1 (Sess.disconnectedTransaction session) graph Commit
582− pure (ret, [id1])
583− else do
584− ret <- Graph.autoMergeToHead tstamp (id1, id2, id3) (Sess.disconnectedTransaction session) headName' strat graph
598+ case Graph.autoMergeToHead stamp (id1, id2, id3) (Sess.disconnectedTransaction session) headName' strat graph of
585− pure (ret, [id1,id2,id3])
586− case graphInfo of
587− Left err -> pure (Left err)
599+ Left err -> pure (Left err)
588− Right ((discon', graph'), transactionIdsAdded) ->
600+ Right (discon', graph') ->
589− pure (Right (discon', graph', transactionIdsAdded))
601+ pure (Right (discon', graph', [id1, id2, id3]))
590−autoMergeToHead sessionId conn@(RemoteConnection _) strat headName' = remoteCall conn (ExecuteAutoMergeToHead sessionId strat headName')
602+autoMergeToHead sessionId conn@(RemoteProcessConnection _) strat headName' = remoteCall conn (ExecuteAutoMergeToHead sessionId strat headName')
591
603
592-- | Execute a database context IO-monad-based expression for the given session and connection. `DatabaseContextIOExpr`s modify the DatabaseContext but cannot be purely implemented.
604-- | Execute a database context IO-monad-based expression for the given session and connection. `DatabaseContextIOExpr`s modify the DatabaseContext but cannot be purely implemented.
593--this is almost completely identical to executeDatabaseContextExpr above
605--this is almost completely identical to executeDatabaseContextExpr above
@@ -599,35 +611,38 @@ executeDatabaseContextIOExpr sessionId (InProcessConnection conf) expr = excEith
599 case eSession of
611 case eSession of
600 Left err -> pure (Left err)
612 Left err -> pure (Left err)
601 Right session -> do
613 Right session -> do
602− graph <- readTVarIO (ipTransactionGraph conf)
603− let env = RE.DatabaseContextIOEvalEnv transId graph scriptSession
604− transId = Sess.parentId session
605− context = Sess.concreteDatabaseContext session
614+ res <- RE.evalDatabaseContextIOExpr scriptSession (Sess.concreteDatabaseContext session) expr
606− res <- RE.runDatabaseContextIOEvalMonad env context (optimizeAndEvalDatabaseContextIOExpr expr)
607 case res of
615 case res of
608 Left err -> pure (Left err)
616 Left err -> pure (Left err)
609− Right newState -> do
617+ Right context' -> do
610− let newDiscon = DisconnectedTransaction (Sess.parentId session) newSchemas False
618+ let newDiscon = DisconnectedTransaction (Sess.parentId session) newSchemas True
611 newSchemas = Schemas context' (Sess.subschemas session)
619 newSchemas = Schemas context' (Sess.subschemas session)
612 newSession = Session newDiscon (Sess.schemaName session)
620 newSession = Session newDiscon (Sess.schemaName session)
613− context' = RE.dbc_context newState
614− atomically $ StmMap.insert newSession sessionId sessions
621+ atomically $ STMMap.insert newSession sessionId sessions
615 pure (Right ())
622 pure (Right ())
616−executeDatabaseContextIOExpr sessionId conn@(RemoteConnection _) dbExpr = remoteCall conn (ExecuteDatabaseContextIOExpr sessionId dbExpr)
623+executeDatabaseContextIOExpr sessionId conn@(RemoteProcessConnection _) dbExpr = remoteCall conn (ExecuteDatabaseContextIOExpr sessionId dbExpr)
617
624
625+{-
626+executeGraphExprSTM_ :: TransactionId -> SessionId -> Session -> Sessions -> TransactionGraphOperator -> TransactionGraph -> TVar TransactionGraph -> STM (Either RelationalError (TransactionGraph, DisconnectedTransaction)
627+executeGraphExprSTM_ freshId sessionId session sessions graphExpr graph graphTVar= do
628+ case evalGraphOp freshId (Sess.disconnectedTransaction session) graph graphExpr of
629+ Left err -> do
630+ when updateGraphOnError (writeTVar graphTVar graph)
631+ pure $ Left err
632+ Right (discon', graph') -> do
633+ writeTVar graphTVar graph'
634+ let newSession = Session discon' (Sess.schemaName session)
635+ STMMap.insert newSession sessionId sessions
636+ pure $ Right graph'
637+-}
638+
618-- process notifications for commits
639-- process notifications for commits
619−executeCommitExprSTM_
620− :: TransactionGraph
621− -> DatabaseContext
622− -> DatabaseContext
623− -> ClientNodes
624− -> STM (EvaluatedNotifications, ClientNodes)
640+executeCommitExprSTM_ :: DatabaseContext -> DatabaseContext -> ClientNodes -> STM (EvaluatedNotifications, ClientNodes)
625−executeCommitExprSTM_ graph oldContext newContext nodes = do
641+executeCommitExprSTM_ oldContext newContext nodes = do
626 let nots = notifications oldContext
642 let nots = notifications oldContext
627− fireNots = notificationChanges nots graph oldContext newContext
643+ fireNots = notificationChanges nots oldContext newContext
628 evaldNots = M.map mkEvaldNot fireNots
644 evaldNots = M.map mkEvaldNot fireNots
629− evalInContext expr ctx = optimizeAndEvalRelationalExpr (RE.mkRelationalExprEnv ctx graph) expr
645+ evalInContext expr ctx = runReader (RE.evalRelationalExpr expr) (RE.mkRelationalExprState ctx)
630−
631 mkEvaldNot notif = EvaluatedNotification { notification = notif,
646 mkEvaldNot notif = EvaluatedNotification { notification = notif,
632 reportOldRelation = evalInContext (reportOldExpr notif) oldContext,
647 reportOldRelation = evalInContext (reportOldExpr notif) oldContext,
633 reportNewRelation = evalInContext (reportNewExpr notif) newContext}
648 reportNewRelation = evalInContext (reportNewExpr notif) newContext}
@@ -642,29 +657,103 @@ executeGraphExpr :: SessionId -> Connection -> TransactionGraphOperator -> IO (E
642executeGraphExpr sessionId (InProcessConnection conf) graphExpr = excEither $ do
657executeGraphExpr sessionId (InProcessConnection conf) graphExpr = excEither $ do
643 let sessions = ipSessions conf
658 let sessions = ipSessions conf
644 freshId <- nextRandom
659 freshId <- nextRandom
645− tstamp <- getCurrentTime
660+ stamp <- getCurrentTime
646 commitLock_ sessionId conf $ \updatedGraph -> do
661 commitLock_ sessionId conf $ \updatedGraph -> do
647 eSession <- sessionForSessionId sessionId sessions
662 eSession <- sessionForSessionId sessionId sessions
648 case eSession of
663 case eSession of
649 Left err -> pure (Left err)
664 Left err -> pure (Left err)
650 Right session -> do
665 Right session -> do
651 let discon = Sess.disconnectedTransaction session
666 let discon = Sess.disconnectedTransaction session
652− case evalGraphOp tstamp freshId discon updatedGraph graphExpr of
667+ case evalGraphOp stamp freshId discon updatedGraph graphExpr of
653 Left err -> pure (Left err)
668 Left err -> pure (Left err)
654 Right (discon', graph') -> do
669 Right (discon', graph') -> do
655 --if freshId appears in the graph, then we need to pass it on
670 --if freshId appears in the graph, then we need to pass it on
656− let transIds = [freshId | isRight (RE.transactionForId freshId graph')]
671+ let transIds = [freshId | isRight (transactionForId freshId graph')]
657 pure (Right (discon', graph', transIds))
672 pure (Right (discon', graph', transIds))
658−
673+{-
674+executeGraphExpr sessionId (InProcessConnection conf) graphExpr = excEither $ do
675+ let strat = ipPersistenceStrategy conf
676+ clientNodes = ipClientNodes conf
677+ sessions = ipSessions conf
678+ graphTvar = ipTransactionGraph conf
679+ mLockFileH = ipLocks conf
680+ lockHandler body = case graphExpr of
681+ Commit -> case mLockFileH of
682+ Nothing -> body False
683+ Just (lockFileH, lockMVar) -> let acquireLocks = do
684+ lastWrittenDigest <- takeMVar lockMVar
685+ lockFile lockFileH WriteLock
686+ latestDigest <- readGraphTransactionIdDigest strat
687+ pure (latestDigest /= lastWrittenDigest)
688+
689+ releaseLocks _ = do
690+ --still holding the lock- get the latest digest
691+ gDigest <- readGraphTransactionIdDigest strat
692+ unlockFile lockFileH
693+ putMVar lockMVar gDigest
694+ in bracket acquireLocks releaseLocks body
695+ _ -> body False
696+ freshId <- nextRandom
697+ lockHandler $ \dbWrittenByOtherProcess -> do
698+ --if the database file has been updated since we wrote it last, load it before trying to sync our version done- this can result in TransactionNotAHeadErrors
699+ --read transaction data and compare to existing graph
700+ --in the future, we can detect if updated transaction graph can be safely merged (such as with a transaction on a separate head) (rebase-able commits should force the user to rebase from the client to confirm that the action makes sense)
701+ manip <- atomically $ do
702+ eSession <- sessionForSessionId sessionId sessions
703+ --handle graph update by other process
704+ oldGraph <- readTVar graphTvar
705+ case eSession of
706+ Left err -> pure (Left err)
707+ Right session -> do
708+ let mScriptSession = ipScriptSession conf
709+ dbdir = case strat of
710+ MinimalPersistence x -> x
711+ CrashSafePersistence x -> x
712+ _ -> error "accessing dbdir on non-persisted connection"
713+ eRefreshedGraph <- if dbWrittenByOtherProcess then
714+ unsafeIOToSTM (transactionGraphLoad dbdir oldGraph mScriptSession)
715+ else
716+ pure (Right oldGraph)
717+ case eRefreshedGraph of
718+ Left err -> pure (Left (DatabaseLoadError err))
719+ Right refreshedGraph -> do
720+ --snip it
721+ eGraph <- executeGraphExprSTM_ dbWrittenByOtherProcess freshId sessionId session sessions graphExpr refreshedGraph graphTvar
722+ --snip it
723+ case eGraph of
724+ Left err -> pure (Left err)
725+ Right newGraph -> do
726+ --handle commit
727+ if isCommit graphExpr then do
728+ case transactionForId (Sess.parentId session) oldGraph of
729+ Left err -> pure $ Left err
730+ Right previousTrans -> do
731+ (evaldNots, nodes) <- executeCommitExprSTM_ (Trans.concreteDatabaseContext previousTrans) (Sess.concreteDatabaseContext session) clientNodes
732+ nodesToNotify <- toList (STMSet.stream nodes)
733+ pure $ Right (evaldNots, nodesToNotify, newGraph)
734+ else
735+ pure $ Right (M.empty, [], newGraph)
736+ case manip of
737+ Left err -> return $ Just err
738+ Right (notsToFire, nodesToNotify, newGraph) -> do
739+ --update filesystem database, if necessary
740+ processTransactionGraphPersistence strat newGraph
741+ sendNotifications nodesToNotify (ipLocalNode conf) notsToFire
742+ pure Nothing
743+-}
659−executeGraphExpr sessionId conn@(RemoteConnection _) graphExpr = remoteCall conn (ExecuteGraphExpr sessionId graphExpr)
744+executeGraphExpr sessionId conn@(RemoteProcessConnection _) graphExpr = remoteCall conn (ExecuteGraphExpr sessionId graphExpr)
660
745
661-- | A trans-graph expression is a relational query executed against the entirety of a transaction graph.
746-- | A trans-graph expression is a relational query executed against the entirety of a transaction graph.
662executeTransGraphRelationalExpr :: SessionId -> Connection -> TransGraphRelationalExpr -> IO (Either RelationalError Relation)
747executeTransGraphRelationalExpr :: SessionId -> Connection -> TransGraphRelationalExpr -> IO (Either RelationalError Relation)
663executeTransGraphRelationalExpr _ (InProcessConnection conf) tgraphExpr = excEither . atomically $ do
748executeTransGraphRelationalExpr _ (InProcessConnection conf) tgraphExpr = excEither . atomically $ do
664 let graphTvar = ipTransactionGraph conf
749 let graphTvar = ipTransactionGraph conf
665 graph <- readTVar graphTvar
750 graph <- readTVar graphTvar
666− pure $ force $ optimizeAndEvalTransGraphRelationalExpr graph tgraphExpr
751+ case evalTransGraphRelationalExpr tgraphExpr graph of
752+ Left err -> pure (Left err)
753+ Right relExpr -> case runReader (RE.evalRelationalExpr relExpr) (RE.mkRelationalExprState DBC.empty) of
754+ Left err -> pure (Left err)
755+ Right rel -> pure (force (Right rel))
667−executeTransGraphRelationalExpr sessionId conn@(RemoteConnection _) tgraphExpr = remoteCall conn (ExecuteTransGraphRelationalExpr sessionId tgraphExpr)
756+executeTransGraphRelationalExpr sessionId conn@(RemoteProcessConnection _) tgraphExpr = remoteCall conn (ExecuteTransGraphRelationalExpr sessionId tgraphExpr)
668
757
669-- | Schema expressions manipulate the isomorphic schemas for the current 'DatabaseContext'.
758-- | Schema expressions manipulate the isomorphic schemas for the current 'DatabaseContext'.
670executeSchemaExpr :: SessionId -> Connection -> Schema.SchemaExpr -> IO (Either RelationalError ())
759executeSchemaExpr :: SessionId -> Connection -> Schema.SchemaExpr -> IO (Either RelationalError ())
@@ -675,36 +764,32 @@ executeSchemaExpr sessionId (InProcessConnection conf) schemaExpr = atomically $
675 Left err -> pure (Left err)
764 Left err -> pure (Left err)
676 Right (session, _) -> do
765 Right (session, _) -> do
677 let subschemas' = subschemas session
766 let subschemas' = subschemas session
678− transId = Sess.parentId session
679− context = Sess.concreteDatabaseContext session
680− graph <- readTVar (ipTransactionGraph conf)
681− case Schema.evalSchemaExpr schemaExpr context transId graph subschemas' of
767+ case Schema.evalSchemaExpr schemaExpr (Sess.concreteDatabaseContext session) subschemas' of
682 Left err -> pure (Left err)
768 Left err -> pure (Left err)
683 Right (newSubschemas, newContext) -> do
769 Right (newSubschemas, newContext) -> do
684 --hm- maybe we should start using lenses
770 --hm- maybe we should start using lenses
685 let discon = Sess.disconnectedTransaction session
771 let discon = Sess.disconnectedTransaction session
686 newSchemas = Schemas newContext newSubschemas
772 newSchemas = Schemas newContext newSubschemas
687− newSession = Session (DisconnectedTransaction (Discon.parentId discon) newSchemas False) (Sess.schemaName session)
773+ newSession = Session (DisconnectedTransaction (Discon.parentId discon) newSchemas True) (Sess.schemaName session)
688− StmMap.insert newSession sessionId sessions
774+ STMMap.insert newSession sessionId sessions
689 pure (Right ())
775 pure (Right ())
690−executeSchemaExpr sessionId conn@(RemoteConnection _) schemaExpr = remoteCall conn (ExecuteSchemaExpr sessionId schemaExpr)
776+executeSchemaExpr sessionId conn@(RemoteProcessConnection _) schemaExpr = remoteCall conn (ExecuteSchemaExpr sessionId schemaExpr)
691
777
692-- | After modifying a 'DatabaseContext', 'commit' the transaction to the transaction graph at the head which the session is referencing. This will also trigger checks for any notifications which need to be propagated.
778-- | After modifying a 'DatabaseContext', 'commit' the transaction to the transaction graph at the head which the session is referencing. This will also trigger checks for any notifications which need to be propagated.
693commit :: SessionId -> Connection -> IO (Either RelationalError ())
779commit :: SessionId -> Connection -> IO (Either RelationalError ())
694commit sessionId conn@(InProcessConnection _) = executeGraphExpr sessionId conn Commit
780commit sessionId conn@(InProcessConnection _) = executeGraphExpr sessionId conn Commit
695−commit sessionId conn@(RemoteConnection _) = remoteCall conn (ExecuteGraphExpr sessionId Commit)
781+commit sessionId conn@(RemoteProcessConnection _) = remoteCall conn (ExecuteGraphExpr sessionId Commit)
696−
782+
697−sendNotifications :: [ClientInfo] -> EvaluatedNotifications -> IO ()
783+sendNotifications :: [ProcessId] -> LocalNode -> EvaluatedNotifications -> IO ()
698−sendNotifications clients notifs =
784+sendNotifications pids localNode nots = mapM_ sendNots pids
699− unless (M.null notifs) $ forM_ clients sender
785+ where
700− where
786+ sendNots remoteClientPid =
701− sender (RemoteClientInfo sock) = RPC.sendMessage sock (NotificationMessage notifs)
787+ unless (M.null nots) $ runProcess localNode $ send remoteClientPid (NotificationMessage nots)
702− sender (InProcessClientInfo tvar) = putMVar tvar notifs
788+
703−
704-- | Discard any changes made in the current 'Session' and 'DatabaseContext'. This resets the disconnected transaction to reference the original database context of the parent transaction and is a very cheap operation.
789-- | Discard any changes made in the current 'Session' and 'DatabaseContext'. This resets the disconnected transaction to reference the original database context of the parent transaction and is a very cheap operation.
705rollback :: SessionId -> Connection -> IO (Either RelationalError ())
790rollback :: SessionId -> Connection -> IO (Either RelationalError ())
706rollback sessionId conn@(InProcessConnection _) = executeGraphExpr sessionId conn Rollback
791rollback sessionId conn@(InProcessConnection _) = executeGraphExpr sessionId conn Rollback
707−rollback sessionId conn@(RemoteConnection _) = remoteCall conn (ExecuteGraphExpr sessionId Rollback)
792+rollback sessionId conn@(RemoteProcessConnection _) = remoteCall conn (ExecuteGraphExpr sessionId Rollback)
708
793
709-- | Write the transaction graph to disk. This function can be used to incrementally write new transactions to disk.
794-- | Write the transaction graph to disk. This function can be used to incrementally write new transactions to disk.
710processTransactionGraphPersistence :: PersistenceStrategy -> [TransactionId] -> TransactionGraph -> IO ()
795processTransactionGraphPersistence :: PersistenceStrategy -> [TransactionId] -> TransactionGraph -> IO ()
@@ -720,7 +805,7 @@ readGraphTransactionIdDigest (CrashSafePersistence dbdir) = readGraphTransaction
720-- | Return a relation whose type would match that of the relational expression if it were executed. This is useful for checking types and validating a relational expression's types.
805-- | Return a relation whose type would match that of the relational expression if it were executed. This is useful for checking types and validating a relational expression's types.
721typeForRelationalExpr :: SessionId -> Connection -> RelationalExpr -> IO (Either RelationalError Relation)
806typeForRelationalExpr :: SessionId -> Connection -> RelationalExpr -> IO (Either RelationalError Relation)
722typeForRelationalExpr sessionId conn@(InProcessConnection _) relExpr = atomically $ typeForRelationalExprSTM sessionId conn relExpr
807typeForRelationalExpr sessionId conn@(InProcessConnection _) relExpr = atomically $ typeForRelationalExprSTM sessionId conn relExpr
723−typeForRelationalExpr sessionId conn@(RemoteConnection _) relExpr = remoteCall conn (ExecuteTypeForRelationalExpr sessionId relExpr)
808+typeForRelationalExpr sessionId conn@(RemoteProcessConnection _) relExpr = remoteCall conn (ExecuteTypeForRelationalExpr sessionId relExpr)
724
809
725typeForRelationalExprSTM :: SessionId -> Connection -> RelationalExpr -> STM (Either RelationalError Relation)
810typeForRelationalExprSTM :: SessionId -> Connection -> RelationalExpr -> STM (Either RelationalError Relation)
726typeForRelationalExprSTM sessionId (InProcessConnection conf) relExpr = do
811typeForRelationalExprSTM sessionId (InProcessConnection conf) relExpr = do
@@ -735,10 +820,7 @@ typeForRelationalExprSTM sessionId (InProcessConnection conf) relExpr = do
735 Schema.processRelationalExprInSchema schema relExpr
820 Schema.processRelationalExprInSchema schema relExpr
736 case processed of
821 case processed of
737 Left err -> pure (Left err)
822 Left err -> pure (Left err)
738− Right relExpr' -> do
823+ Right relExpr' -> pure $ runReader (RE.typeForRelationalExpr relExpr') (RE.mkRelationalExprState (Sess.concreteDatabaseContext session))
739− graph <- readTVar (ipTransactionGraph conf)
740− let reEnv = RE.mkRelationalExprEnv (Sess.concreteDatabaseContext session) graph
741− pure $ RE.runRelationalExprM reEnv (RE.typeForRelationalExpr relExpr')
742
824
743typeForRelationalExprSTM _ _ _ = error "typeForRelationalExprSTM called on non-local connection"
825typeForRelationalExprSTM _ _ _ = error "typeForRelationalExprSTM called on non-local connection"
744
826
@@ -757,7 +839,7 @@ inclusionDependencies sessionId (InProcessConnection conf) = do
757 else
839 else
758 pure (Schema.inclusionDependenciesInSchema schema (B.inclusionDependencies context))
840 pure (Schema.inclusionDependenciesInSchema schema (B.inclusionDependencies context))
759
841
760−inclusionDependencies sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveInclusionDependencies sessionId)
842+inclusionDependencies sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveInclusionDependencies sessionId)
761
843
762typeConstructorMapping :: SessionId -> Connection -> IO (Either RelationalError TypeConstructorMapping)
844typeConstructorMapping :: SessionId -> Connection -> IO (Either RelationalError TypeConstructorMapping)
763typeConstructorMapping sessionId (InProcessConnection conf) = do
845typeConstructorMapping sessionId (InProcessConnection conf) = do
@@ -768,27 +850,22 @@ typeConstructorMapping sessionId (InProcessConnection conf) = do
768 Left err -> pure $ Left err
850 Left err -> pure $ Left err
769 Right (session, _) -> --warning, no schema support for typeconstructors
851 Right (session, _) -> --warning, no schema support for typeconstructors
770 pure (Right (B.typeConstructorMapping (Sess.concreteDatabaseContext session)))
852 pure (Right (B.typeConstructorMapping (Sess.concreteDatabaseContext session)))
771−typeConstructorMapping sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveTypeConstructorMapping sessionId)
853+typeConstructorMapping sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveTypeConstructorMapping sessionId)
772
854
773-- | Return an optimized database expression which is logically equivalent to the input database expression. This function can be used to determine which expression will actually be evaluated.
855-- | Return an optimized database expression which is logically equivalent to the input database expression. This function can be used to determine which expression will actually be evaluated.
774−planForDatabaseContextExpr :: SessionId -> Connection -> DatabaseContextExpr -> IO (Either RelationalError GraphRefDatabaseContextExpr)
856+planForDatabaseContextExpr :: SessionId -> Connection -> DatabaseContextExpr -> IO (Either RelationalError DatabaseContextExpr)
775planForDatabaseContextExpr sessionId (InProcessConnection conf) dbExpr = do
857planForDatabaseContextExpr sessionId (InProcessConnection conf) dbExpr = do
776 let sessions = ipSessions conf
858 let sessions = ipSessions conf
777 atomically $ do
859 atomically $ do
778− graph <- readTVar (ipTransactionGraph conf)
779 eSession <- sessionAndSchema sessionId sessions
860 eSession <- sessionAndSchema sessionId sessions
780 case eSession of
861 case eSession of
781 Left err -> pure $ Left err
862 Left err -> pure $ Left err
782− Right (session, _) ->
783− if schemaName session == defaultSchemaName then do
863+ Right (session, _) -> if schemaName session == defaultSchemaName then
784− let ctx = Sess.concreteDatabaseContext session
864+ pure $ evalState (applyStaticDatabaseOptimization dbExpr) (RE.freshDatabaseState (Sess.concreteDatabaseContext session))
785− transId = Sess.parentId session
786− gfExpr = runProcessExprM UncommittedContextMarker (processDatabaseContextExpr dbExpr)
787− pure $ runGraphRefSOptDatabaseContextExprM transId ctx graph (optimizeGraphRefDatabaseContextExpr gfExpr)
788− else -- don't show any optimization because the current optimization infrastructure relies on access to the base context- this probably underscores the need for each schema to have its own DatabaseContext, even if it is generated on-the-fly-}
865+ else -- don't show any optimization because the current optimization infrastructure relies on access to the base context- this probably underscores the need for each schema to have its own DatabaseContext, even if it is generated on-the-fly
789− pure (Left NonConcreteSchemaPlanError)
866+ pure (Right dbExpr)
790
867
791−planForDatabaseContextExpr sessionId conn@(RemoteConnection _) dbExpr = remoteCall conn (RetrievePlanForDatabaseContextExpr sessionId dbExpr)
868+planForDatabaseContextExpr sessionId conn@(RemoteProcessConnection _) dbExpr = remoteCall conn (RetrievePlanForDatabaseContextExpr sessionId dbExpr)
792
869
793-- | Return a relation which represents the current state of the global transaction graph. The attributes are
870-- | Return a relation which represents the current state of the global transaction graph. The attributes are
794-- * current- boolean attribute representing whether or not the current session references this transaction
871-- * current- boolean attribute representing whether or not the current session references this transaction
@@ -803,57 +880,30 @@ transactionGraphAsRelation sessionId (InProcessConnection conf) = do
803 eSession <- sessionForSessionId sessionId sessions
880 eSession <- sessionForSessionId sessionId sessions
804 case eSession of
881 case eSession of
805 Left err -> pure $ Left err
882 Left err -> pure $ Left err
806− Right session ->
883+ Right session -> do
884+ graph <- readTVar tvar
807− graphAsRelation (Sess.disconnectedTransaction session) <$> readTVar tvar
885+ pure $ graphAsRelation (Sess.disconnectedTransaction session) graph
808
886
809−transactionGraphAsRelation sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveTransactionGraph sessionId)
887+transactionGraphAsRelation sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveTransactionGraph sessionId)
810
888
811-- | Returns the names and types of the relation variables in the current 'Session'.
889-- | Returns the names and types of the relation variables in the current 'Session'.
812relationVariablesAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
890relationVariablesAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
813relationVariablesAsRelation sessionId (InProcessConnection conf) = do
891relationVariablesAsRelation sessionId (InProcessConnection conf) = do
814 let sessions = ipSessions conf
892 let sessions = ipSessions conf
815 atomically $ do
893 atomically $ do
816− graph <- readTVar (ipTransactionGraph conf)
817 eSession <- sessionAndSchema sessionId sessions
894 eSession <- sessionAndSchema sessionId sessions
818 case eSession of
895 case eSession of
819 Left err -> pure (Left err)
896 Left err -> pure (Left err)
820 Right (session, schema) -> do
897 Right (session, schema) -> do
821 let context = Sess.concreteDatabaseContext session
898 let context = Sess.concreteDatabaseContext session
822 if Sess.schemaName session == defaultSchemaName then
899 if Sess.schemaName session == defaultSchemaName then
823− pure $ RE.relationVariablesAsRelation context graph
900+ pure $ R.relationVariablesAsRelation (relationVariables context)
824 else
901 else
825− case Schema.relationVariablesInSchema schema of
902+ case Schema.relationVariablesInSchema schema context of
826 Left err -> pure (Left err)
903 Left err -> pure (Left err)
827− Right relvars -> do
828− let schemaContext = context {relationVariables = relvars }
829− pure $ RE.relationVariablesAsRelation schemaContext graph
904+ Right relvars -> pure $ R.relationVariablesAsRelation relvars
830
905
831−relationVariablesAsRelation sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveRelationVariableSummary sessionId)
906+relationVariablesAsRelation sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveRelationVariableSummary sessionId)
832−
833−-- | Returns the names and types of the atom functions in the current 'Session'.
834−atomFunctionsAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
835−atomFunctionsAsRelation sessionId (InProcessConnection conf) = do
836− let sessions = ipSessions conf
837− atomically $ do
838− eSession <- sessionAndSchema sessionId sessions
839− case eSession of
840− Left err -> pure (Left err)
841− Right (session, _) ->
842− pure (AF.atomFunctionsAsRelation (atomFunctions (concreteDatabaseContext session)))
843−
844−atomFunctionsAsRelation sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveAtomFunctionSummary sessionId)
845−
846−databaseContextFunctionsAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
847−databaseContextFunctionsAsRelation sessionId (InProcessConnection conf) = do
848− let sessions = ipSessions conf
849− atomically $ do
850− eSession <- sessionAndSchema sessionId sessions
851− case eSession of
852− Left err -> pure (Left err)
853− Right (session, _) ->
854− pure (DCF.databaseContextFunctionsAsRelation (dbcFunctions (concreteDatabaseContext session)))
855−
856−databaseContextFunctionsAsRelation sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveDatabaseContextFunctionSummary sessionId)
857
907
858-- | Returns the transaction id for the connection's disconnected transaction committed parent transaction.
908-- | Returns the transaction id for the connection's disconnected transaction committed parent transaction.
859headTransactionId :: SessionId -> Connection -> IO (Either RelationalError TransactionId)
909headTransactionId :: SessionId -> Connection -> IO (Either RelationalError TransactionId)
@@ -864,7 +914,7 @@ headTransactionId sessionId (InProcessConnection conf) = do
864 case eSession of
914 case eSession of
865 Left err -> pure (Left err)
915 Left err -> pure (Left err)
866 Right session -> pure $ Right (Sess.parentId session)
916 Right session -> pure $ Right (Sess.parentId session)
867−headTransactionId sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveHeadTransactionId sessionId)
917+headTransactionId sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveHeadTransactionId sessionId)
868
918
869headNameSTM_ :: SessionId -> Sessions -> TVar TransactionGraph -> STM (Either RelationalError HeadName)
919headNameSTM_ :: SessionId -> Sessions -> TVar TransactionGraph -> STM (Either RelationalError HeadName)
870headNameSTM_ sessionId sessions graphTvar = do
920headNameSTM_ sessionId sessions graphTvar = do
@@ -872,7 +922,7 @@ headNameSTM_ sessionId sessions graphTvar = do
872 eSession <- sessionForSessionId sessionId sessions
922 eSession <- sessionForSessionId sessionId sessions
873 case eSession of
923 case eSession of
874 Left err -> pure (Left err)
924 Left err -> pure (Left err)
875− Right session -> case RE.transactionForId (Sess.parentId session) graph of
925+ Right session -> case transactionForId (Sess.parentId session) graph of
876 Left err -> pure (Left err)
926 Left err -> pure (Left err)
877 Right parentTrans -> case headNameForTransaction parentTrans graph of
927 Right parentTrans -> case headNameForTransaction parentTrans graph of
878 Nothing -> pure (Left UnknownHeadError)
928 Nothing -> pure (Left UnknownHeadError)
@@ -884,7 +934,7 @@ headName sessionId (InProcessConnection conf) = do
884 let sessions = ipSessions conf
934 let sessions = ipSessions conf
885 graphTvar = ipTransactionGraph conf
935 graphTvar = ipTransactionGraph conf
886 atomically (headNameSTM_ sessionId sessions graphTvar)
936 atomically (headNameSTM_ sessionId sessions graphTvar)
887−headName sessionId conn@(RemoteConnection _) = remoteCall conn (ExecuteHeadName sessionId)
937+headName sessionId conn@(RemoteProcessConnection _) = remoteCall conn (ExecuteHeadName sessionId)
888
938
889-- | Returns a listing of all available atom types.
939-- | Returns a listing of all available atom types.
890atomTypesAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
940atomTypesAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
@@ -898,7 +948,7 @@ atomTypesAsRelation sessionId (InProcessConnection conf) = do
898 case typesAsRelation (B.typeConstructorMapping (Sess.concreteDatabaseContext session)) of
948 case typesAsRelation (B.typeConstructorMapping (Sess.concreteDatabaseContext session)) of
899 Left err -> pure (Left err)
949 Left err -> pure (Left err)
900 Right rel -> pure (Right rel)
950 Right rel -> pure (Right rel)
901−atomTypesAsRelation sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveAtomTypesAsRelation sessionId)
951+atomTypesAsRelation sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveAtomTypesAsRelation sessionId)
902
952
903disconnectedTransactionIsDirty :: SessionId -> Connection -> IO (Either RelationalError Bool)
953disconnectedTransactionIsDirty :: SessionId -> Connection -> IO (Either RelationalError Bool)
904disconnectedTransactionIsDirty sessionId (InProcessConnection conf) = do
954disconnectedTransactionIsDirty sessionId (InProcessConnection conf) = do
@@ -909,23 +959,23 @@ disconnectedTransactionIsDirty sessionId (InProcessConnection conf) = do
909 Left err -> pure (Left err)
959 Left err -> pure (Left err)
910 Right session ->
960 Right session ->
911 pure (Right (isDirty session))
961 pure (Right (isDirty session))
912−disconnectedTransactionIsDirty sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveSessionIsDirty sessionId)
962+disconnectedTransactionIsDirty sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveSessionIsDirty sessionId)
913
963
914--used only for testing- we expect this to throw an exception
964--used only for testing- we expect this to throw an exception
915callTestTimeout_ :: SessionId -> Connection -> IO Bool
965callTestTimeout_ :: SessionId -> Connection -> IO Bool
916callTestTimeout_ _ (InProcessConnection _) = error "bad testing call"
966callTestTimeout_ _ (InProcessConnection _) = error "bad testing call"
917−callTestTimeout_ sessionId conn@(RemoteConnection _) = remoteCall conn (TestTimeout sessionId)
967+callTestTimeout_ sessionId conn@(RemoteProcessConnection _) = remoteCall conn (TestTimeout sessionId)
918
968
919--used in tests only
969--used in tests only
920transactionGraph_ :: Connection -> IO TransactionGraph
970transactionGraph_ :: Connection -> IO TransactionGraph
921−transactionGraph_ (InProcessConnection conf) = readTVarIO (ipTransactionGraph conf)
971+transactionGraph_ (InProcessConnection conf) = atomically $ readTVar (ipTransactionGraph conf)
922transactionGraph_ _ = error "remote connection used"
972transactionGraph_ _ = error "remote connection used"
923
973
924--used in tests only
974--used in tests only
925disconnectedTransaction_ :: SessionId -> Connection -> IO DisconnectedTransaction
975disconnectedTransaction_ :: SessionId -> Connection -> IO DisconnectedTransaction
926disconnectedTransaction_ sessionId (InProcessConnection conf) = do
976disconnectedTransaction_ sessionId (InProcessConnection conf) = do
927 let sessions = ipSessions conf
977 let sessions = ipSessions conf
928− mSession <- atomically $ StmMap.lookup sessionId sessions
978+ mSession <- atomically $ STMMap.lookup sessionId sessions
929 case mSession of
979 case mSession of
930 Nothing -> error "No such session"
980 Nothing -> error "No such session"
931 Just (Sess.Session discon _) -> pure discon
981 Just (Sess.Session discon _) -> pure discon
@@ -983,13 +1033,13 @@ commitLock_ sessionId conf stmBlock = do
983 Right (discon', graph', transactionIdsToPersist) -> do
1033 Right (discon', graph', transactionIdsToPersist) -> do
984 writeTVar graphTvar graph'
1034 writeTVar graphTvar graph'
985 let newSession = Session discon' (Sess.schemaName session)
1035 let newSession = Session discon' (Sess.schemaName session)
986− StmMap.insert newSession sessionId sessions
1036+ STMMap.insert newSession sessionId sessions
987− case RE.transactionForId (Sess.parentId session) oldGraph of
1037+ case transactionForId (Sess.parentId session) oldGraph of
988 Left err -> pure $ Left err
1038 Left err -> pure $ Left err
989 Right previousTrans ->
1039 Right previousTrans ->
990 if not (Prelude.null transactionIdsToPersist) then do
1040 if not (Prelude.null transactionIdsToPersist) then do
991− (evaldNots, nodes) <- executeCommitExprSTM_ graph' (Trans.concreteDatabaseContext previousTrans) (Sess.concreteDatabaseContext session) clientNodes
1041+ (evaldNots, nodes) <- executeCommitExprSTM_ (Trans.concreteDatabaseContext previousTrans) (Sess.concreteDatabaseContext session) clientNodes
992− nodesToNotify <- stmSetToList nodes
1042+ nodesToNotify <- toList (STMSet.stream nodes)
993 pure $ Right (evaldNots, nodesToNotify, graph', transactionIdsToPersist)
1043 pure $ Right (evaldNots, nodesToNotify, graph', transactionIdsToPersist)
994 else pure (Right (M.empty, [], graph', []))
1044 else pure (Right (M.empty, [], graph', []))
995
1045
@@ -999,8 +1049,15 @@ commitLock_ sessionId conf stmBlock = do
999 Right (notsToFire, nodesToNotify, newGraph, transactionIdsToPersist) -> do
1049 Right (notsToFire, nodesToNotify, newGraph, transactionIdsToPersist) -> do
1000 --update filesystem database, if necessary
1050 --update filesystem database, if necessary
1001 processTransactionGraphPersistence strat transactionIdsToPersist newGraph
1051 processTransactionGraphPersistence strat transactionIdsToPersist newGraph
1002− sendNotifications nodesToNotify notsToFire
1052+ sendNotifications nodesToNotify (ipLocalNode conf) notsToFire
1003 pure (Right ())
1053 pure (Right ())
1054+{-
1055+writeDisconAndGraph_ :: TVar TransactionGraph -> SessionId -> Session -> Sessions -> DisconnectedTransaction -> TransactionGraph -> STM ()
1056+writeDisconAndGraph_ graphTvar sessionId session sessions discon graph = do
1057+ writeTVar graphTvar graph
1058+ let newSession = Session discon (Sess.schemaName session)
1059+ STMMap.insert newSession sessionId sessions
1060+-}
1004
1061
1005-- | Runs an IO monad, commits the result when the monad returns no errors, otherwise, rolls back the changes and the error.
1062-- | Runs an IO monad, commits the result when the monad returns no errors, otherwise, rolls back the changes and the error.
1006withTransaction :: SessionId -> Connection -> IO (Either RelationalError a) -> IO (Either RelationalError ()) -> IO (Either RelationalError a)
1063withTransaction :: SessionId -> Connection -> IO (Either RelationalError a) -> IO (Either RelationalError ()) -> IO (Either RelationalError a)
@@ -1025,71 +1082,3 @@ withTransaction sessionId conn io successFunc = bracketOnError (pure ()) (const
1025 Right _ -> pure (Right val)
1082 Right _ -> pure (Right val)
1026 else -- no updates executed, so don't create a commit
1083 else -- no updates executed, so don't create a commit
1027 pure (Right val)
1084 pure (Right val)
1028−
1029−executeDataFrameExpr :: SessionId -> Connection -> DF.DataFrameExpr -> IO (Either RelationalError DF.DataFrame)
1030−executeDataFrameExpr sessionId conn@(InProcessConnection _) dfExpr = do
1031− eRel <- executeRelationalExpr sessionId conn (DF.convertExpr dfExpr)
1032− case eRel of
1033− Left err -> pure (Left err)
1034− Right rel -> do
1035− let relAttrs = R.attributes rel
1036− attrName (DF.AttributeOrderExpr name _) = name
1037− order (DF.AttributeOrderExpr _ ord) = ord
1038− orders = map order (DF.orderExprs dfExpr)
1039− attributeForName' = flip attributeForName relAttrs
1040− attrNames = map attrName (DF.orderExprs dfExpr)
1041− verified = forM attrNames attributeForName'
1042− case verified of
1043− Left err -> pure (Left err)
1044− Right attrs -> do
1045− let attrOrders = zipWith
1046− (DF.AttributeOrder . attributeName)
1047− attrs
1048− orders
1049− case DF.sortDataFrameBy attrOrders . DF.toDataFrame $ rel of
1050− Left err -> pure (Left err)
1051− Right dFrame -> do
1052− let dFrame' = maybe dFrame (`DF.drop'` dFrame) (DF.offset dfExpr)
1053− dFrame'' = maybe dFrame' (`DF.take'` dFrame') (DF.limit dfExpr)
1054− pure (Right dFrame'')
1055−executeDataFrameExpr sessionId conn@(RemoteConnection _) dfExpr = remoteCall conn (ExecuteDataFrameExpr sessionId dfExpr)
1056−
1057−validateMerkleHashes :: SessionId -> Connection -> IO (Either RelationalError ())
1058−validateMerkleHashes sessionId (InProcessConnection conf) = do
1059− let sessions = ipSessions conf
1060− atomically $ do
1061− eSession <- sessionForSessionId sessionId sessions
1062− case eSession of
1063− Left err -> pure (Left err)
1064− Right _ -> do
1065− graph <- readTVar (ipTransactionGraph conf)
1066− case Graph.validateMerkleHashes graph of
1067− Left merkleErrs -> pure $ Left $ someErrors (map (\(MerkleValidationError tid expected actual) -> MerkleHashValidationError tid expected actual) merkleErrs)
1068− Right () -> pure (Right ())
1069−validateMerkleHashes sessionId conn@RemoteConnection{} = remoteCall conn (ExecuteValidateMerkleHashes sessionId)
1070−
1071−type ClientNodes = StmSet.Set ClientInfo
1072−
1073−-- internal structure specific to in-process connections
1074−data InProcessConnectionConf = InProcessConnectionConf {
1075− ipPersistenceStrategy :: PersistenceStrategy,
1076− ipClientNodes :: ClientNodes,
1077− ipSessions :: Sessions,
1078− ipTransactionGraph :: TVar TransactionGraph,
1079− ipScriptSession :: Maybe ScriptSession,
1080− ipLocks :: Maybe (LockFile, MVar LockFileHash), -- nothing when NoPersistence
1081− ipCallbackAsync :: Async ()
1082− }
1083−
1084−-- clients may connect associate one socket/mvar with the server to register for change callbacks
1085−data ClientInfo = RemoteClientInfo (RPC.Locking Socket) |
1086− InProcessClientInfo (MVar EvaluatedNotifications)
1087−
1088−instance Eq ClientInfo where
1089− (RemoteClientInfo a) == (RemoteClientInfo b) = RPC.lockless a == RPC.lockless b
1090− (InProcessClientInfo a) == (InProcessClientInfo b) = a == b
1091− _ == _ = False
1092−
1093−instance Hashable ClientInfo where
1094− hashWithSalt salt (RemoteClientInfo sock) = hashWithSalt salt (show (RPC.lockless sock))
1095− hashWithSalt salt (InProcessClientInfo _) = hashWithSalt salt (1::Int)
src/lib/ProjectM36/Client/Simple.hs+2−3
@@ -25,8 +25,7 @@ module ProjectM36.Client.Simple (
25 C.PersistenceStrategy(..),
25 C.PersistenceStrategy(..),
26 C.NotificationCallback,
26 C.NotificationCallback,
27 C.emptyNotificationCallback,
27 C.emptyNotificationCallback,
28− C.DatabaseContextExprBase(..),
28+ C.DatabaseContextExpr(..),
29− C.DatabaseContextExpr,
30 C.RelationalExprBase(..)
29 C.RelationalExprBase(..)
31 ) where
30 ) where
32
31
@@ -73,7 +72,7 @@ close (_ , conn) = C.close conn
73withTransaction :: DbConn -> Db a -> IO (Either DbError a)
72withTransaction :: DbConn -> Db a -> IO (Either DbError a)
74withTransaction sessconn = withTransactionUsing sessconn UnionMergeStrategy
73withTransaction sessconn = withTransactionUsing sessconn UnionMergeStrategy
75
74
76−-- | Same as 'withTransaction' except that the merge strategy can be specified.
75+-- | Same a 'withTransaction' except that the merge strategy can be specified.
77withTransactionUsing :: DbConn -> MergeStrategy -> Db a -> IO (Either DbError a)
76withTransactionUsing :: DbConn -> MergeStrategy -> Db a -> IO (Either DbError a)
78withTransactionUsing (sess, conn) strat dbm = do
77withTransactionUsing (sess, conn) strat dbm = do
79 eHeadName <- C.headName sess conn
78 eHeadName <- C.headName sess conn
src/lib/ProjectM36/DataConstructorDef.hs+3−2
@@ -1,5 +1,6 @@
1module ProjectM36.DataConstructorDef where
1module ProjectM36.DataConstructorDef where
2−import ProjectM36.Base as B
2+import ProjectM36.Base
3+import qualified ProjectM36.TypeConstructor as TC
3import qualified Data.Set as S
4import qualified Data.Set as S
4
5
5emptyDataConstructor :: DataConstructorName -> DataConstructorDef
6emptyDataConstructor :: DataConstructorName -> DataConstructorDef
@@ -15,6 +16,6 @@ typeVars :: DataConstructorDef -> S.Set TypeVarName
15typeVars (DataConstructorDef _ tConsArgs) = S.unions $ map typeVarsInDefArg tConsArgs
16typeVars (DataConstructorDef _ tConsArgs) = S.unions $ map typeVarsInDefArg tConsArgs
16
17
17typeVarsInDefArg :: DataConstructorDefArg -> S.Set TypeVarName
18typeVarsInDefArg :: DataConstructorDefArg -> S.Set TypeVarName
18−typeVarsInDefArg (DataConstructorDefTypeConstructorArg tCons) = B.typeVars tCons
19+typeVarsInDefArg (DataConstructorDefTypeConstructorArg tCons) = TC.typeVars tCons
19typeVarsInDefArg (DataConstructorDefTypeVarNameArg pVarName) = S.singleton pVarName
20typeVarsInDefArg (DataConstructorDefTypeVarNameArg pVarName) = S.singleton pVarName
20
21
src/lib/ProjectM36/DataFrame.hsdeleted−183
@@ -1,183 +0,0 @@
1−{-# LANGUAGE DeriveGeneric, DerivingVia #-}
2−{- A dataframe is a strongly-typed, ordered list of named tuples. A dataframe differs from a relation in that its tuples are ordered.-}
3−module ProjectM36.DataFrame where
4−import ProjectM36.Base
5−import ProjectM36.Attribute as A hiding (drop)
6−import ProjectM36.Error
7−import qualified ProjectM36.Relation as R
8−import ProjectM36.Relation.Show.Term
9−import qualified ProjectM36.Relation.Show.HTML as RelHTML
10−import ProjectM36.DataTypes.Sorting
11−import ProjectM36.AtomType
12−import ProjectM36.Atom
13−import qualified Data.Vector as V
14−import GHC.Generics
15−import qualified Data.List as L
16−import qualified Data.Set as S
17−import Data.Maybe
18−import qualified Data.Text as T
19−import Control.Arrow
20−#if __GLASGOW_HASKELL__ < 804
21−import Data.Monoid
22−#endif
23−
24−data AttributeOrderExpr = AttributeOrderExpr AttributeName Order
25− deriving (Show, Generic)
26−
27−data AttributeOrder = AttributeOrder AttributeName Order
28− deriving (Show, Generic)
29−
30−data Order = AscendingOrder | DescendingOrder
31− deriving (Eq, Show, Generic)
32−
33−ascending :: T.Text
34−ascending = "⬆"
35−
36−descending :: T.Text
37−descending = "⬇"
38−
39−arbitrary :: T.Text
40−arbitrary = "↕"
41−
42−data DataFrame = DataFrame {
43− orders :: [AttributeOrder],
44− attributes :: Attributes,
45− tuples :: [DataFrameTuple]
46− }
47− deriving (Show, Generic)
48−
49−data DataFrameTuple = DataFrameTuple Attributes (V.Vector Atom)
50− deriving (Eq, Show, Generic)
51−
52−sortDataFrameBy :: [AttributeOrder] -> DataFrame -> Either RelationalError DataFrame
53−sortDataFrameBy attrOrders frame = do
54− attrs <- mapM (\(AttributeOrder nam _) -> A.attributeForName nam (attributes frame)) attrOrders
55− mapM_ (\attr -> if not (isSortableAtomType (atomType attr)) then
56− Left (AttributeNotSortableError attr)
57− else
58− pure ()) attrs
59− pure $ DataFrame attrOrders (attributes frame) (sortTuplesBy (compareTupleByAttributeOrders attrOrders) (tuples frame))
60−
61−sortTuplesBy :: (DataFrameTuple -> DataFrameTuple -> Ordering) -> [DataFrameTuple] -> [DataFrameTuple]
62−sortTuplesBy = L.sortBy
63−
64−compareTupleByAttributeOrders :: [AttributeOrder] -> DataFrameTuple -> DataFrameTuple -> Ordering
65−compareTupleByAttributeOrders attributeOrders tup1 tup2 =
66− let compare' (AttributeOrder attr order) = if order == DescendingOrder
67− then compareTupleByOneAttributeName attr tup2 tup1
68− else compareTupleByOneAttributeName attr tup1 tup2
69− res = map compare' attributeOrders in
70− fromMaybe EQ (L.find (/= EQ) res)
71−
72−compareTupleByOneAttributeName :: AttributeName -> DataFrameTuple -> DataFrameTuple -> Ordering
73−compareTupleByOneAttributeName attr tuple1 tuple2 =
74− let eAtom1 = atomForAttributeName attr tuple1
75− eAtom2 = atomForAttributeName attr tuple2 in
76− case eAtom1 of
77− Left err -> error (show err)
78− Right atom1 ->
79− case eAtom2 of
80− Left err -> error (show err)
81− Right atom2 -> compareAtoms atom1 atom2
82−
83−atomForAttributeName :: AttributeName -> DataFrameTuple -> Either RelationalError Atom
84−atomForAttributeName attrName (DataFrameTuple tupAttrs tupVec) = case V.findIndex (\attr -> attributeName attr == attrName) (attributesVec tupAttrs) of
85− Nothing -> Left (NoSuchAttributeNamesError (S.singleton attrName))
86− Just index -> case tupVec V.!? index of
87− Nothing -> Left (NoSuchAttributeNamesError (S.singleton attrName))
88− Just atom -> Right atom
89−
90−take' :: Integer -> DataFrame -> DataFrame
91−take' n df = df { tuples = take (fromInteger n) (tuples df) }
92−
93−drop' :: Integer -> DataFrame -> DataFrame
94−drop' n df = df { tuples = drop (fromInteger n) (tuples df) }
95−
96−toDataFrame :: Relation -> DataFrame
97−toDataFrame (Relation attrs (RelationTupleSet tuples')) = DataFrame [] attrs (map (\(RelationTuple tupAttrs tupVec) -> DataFrameTuple tupAttrs tupVec) tuples')
98−
99−fromDataFrame :: DataFrame -> Either RelationalError Relation
100−fromDataFrame df = R.mkRelation (attributes df) (RelationTupleSet tuples')
101− where
102− tuples' = map (\(DataFrameTuple attrs' tupVec) -> RelationTuple attrs' tupVec) (tuples df)
103−
104−showDataFrame :: DataFrame -> T.Text
105−showDataFrame = renderTable . dataFrameAsTable
106−
107−--terminal display
108−dataFrameAsTable :: DataFrame -> Table
109−dataFrameAsTable df = (header, body)
110− where
111− oAttrNames = orderedAttributeNames (attributes df)
112− oAttrs = orderedAttributes (attributes df)
113− header = "DF" : map dfPrettyAttribute oAttrs
114− dfPrettyAttribute attr = prettyAttribute attr <> case L.find (\(AttributeOrder nam _) -> nam == attributeName attr) (orders df) of
115− Nothing -> arbitrary
116− Just (AttributeOrder _ AscendingOrder) -> ascending
117− Just (AttributeOrder _ DescendingOrder) -> descending
118− body = snd (L.foldl' tupleFolder (1 :: Int,[]) (tuples df))
119− tupleFolder (count, acc) tuple = (count + 1,
120− acc ++ [T.pack (show count) : map (\attrName -> case atomForAttributeName attrName tuple of
121− Left _ -> "?"
122− Right atom -> showAtom 0 atom
123− ) oAttrNames])
124−
125−-- | A Relation can be converted to a DataFrame for sorting, limits, and offsets.
126−data DataFrameExpr = DataFrameExpr {
127− convertExpr :: RelationalExpr,
128− orderExprs :: [AttributeOrderExpr],
129− offset :: Maybe Integer,
130− limit :: Maybe Integer
131− }
132− deriving (Show, Generic)
133−
134−dataFrameAsHTML :: DataFrame -> T.Text
135−-- web browsers don't display tables with empty cells or empty headers, so we have to insert some placeholders- it's not technically the same, but looks as expected in the browser
136−dataFrameAsHTML df
137− | length (tuples df) == 1 && A.null (attributes df) = style <>
138− tablestart <>
139− "<tr><th></th></tr>" <>
140− "<tr><td></td></tr>" <>
141− tablefooter <> "</table>"
142− | L.null (tuples df) && A.null (attributes df) = style <>
143− tablestart <>
144− "<tr><th></th></tr>" <>
145− tablefooter <>
146− "</table>"
147− | otherwise = style <>
148− tablestart <>
149− attributesAsHTML (attributes df) (orders df) <>
150− tuplesAsHTML (tuples df) <>
151− tablefooter <>
152− "</table>"
153− where
154− cardinality = T.pack (show (length (tuples df)))
155− style = "<style>.pm36dataframe {empty-cells: show;} .pm36dataframe tbody td, .pm36relation th { border: 1px solid black;}</style>"
156− tablefooter = "<tfoot><tr><td colspan=\"100%\">" <> cardinality <> " tuples</td></tr></tfoot>"
157− tablestart = "<table class=\"pm36dataframe\"\">"
158−
159−tuplesAsHTML :: [DataFrameTuple] -> T.Text
160−tuplesAsHTML = foldr folder ""
161− where
162− folder tuple acc = acc <> tupleAsHTML tuple
163−
164−tupleAssocs :: DataFrameTuple -> [(AttributeName, Atom)]
165−tupleAssocs (DataFrameTuple attrs tupVec) = V.toList $ V.map (first attributeName) (V.zip (attributesVec attrs) tupVec)
166−
167−
168−tupleAsHTML :: DataFrameTuple -> T.Text
169−tupleAsHTML tuple = "<tr>" <> T.concat (L.map tupleFrag (tupleAssocs tuple)) <> "</tr>"
170− where
171− tupleFrag tup = "<td>" <> atomAsHTML (snd tup) <> "</td>"
172− atomAsHTML (RelationAtom rel) = RelHTML.relationAsHTML rel
173− atomAsHTML (TextAtom t) = "&quot;" <> t <> "&quot;"
174− atomAsHTML atom = atomToText atom
175−
176−attributesAsHTML :: Attributes -> [AttributeOrder] -> T.Text
177−attributesAsHTML attrs orders' = "<tr>" <> T.concat (map oneAttrHTML (A.toList attrs)) <> "</tr>"
178− where
179− oneAttrHTML attr = "<th>" <> prettyAttribute attr <> ordering (attributeName attr) <> "</th>"
180− ordering attrName = " " <> case L.find (\(AttributeOrder nam _) -> nam == attrName) orders' of
181− Nothing -> "(arb)"
182− Just (AttributeOrder _ AscendingOrder) -> "(asc)"
183− Just (AttributeOrder _ DescendingOrder) -> "(desc)"
src/lib/ProjectM36/DataTypes/Basic.hs+2−4
@@ -1,11 +1,10 @@
1-- wraps up primitives plus other basic data types
1-- wraps up primitives plus other basic data types
2module ProjectM36.DataTypes.Basic where
2module ProjectM36.DataTypes.Basic where
3import ProjectM36.DataTypes.Primitive
3import ProjectM36.DataTypes.Primitive
4+import ProjectM36.DataTypes.Day
4import ProjectM36.DataTypes.Either
5import ProjectM36.DataTypes.Either
5import ProjectM36.DataTypes.Maybe
6import ProjectM36.DataTypes.Maybe
6import ProjectM36.DataTypes.List
7import ProjectM36.DataTypes.List
7−import ProjectM36.DataTypes.NonEmptyList
8−import ProjectM36.DataTypes.Interval
9import ProjectM36.Base
8import ProjectM36.Base
10
9
11basicTypeConstructorMapping :: TypeConstructorMapping
10basicTypeConstructorMapping :: TypeConstructorMapping
@@ -13,7 +12,6 @@ basicTypeConstructorMapping = primitiveTypeConstructorMapping ++
13 maybeTypeConstructorMapping ++
12 maybeTypeConstructorMapping ++
14 eitherTypeConstructorMapping ++
13 eitherTypeConstructorMapping ++
15 listTypeConstructorMapping ++
14 listTypeConstructorMapping ++
16− nonEmptyListTypeConstructorMapping ++
15+ dayTypeConstructorMapping
17− intervalTypeConstructorMapping
18
16
19
17
src/lib/ProjectM36/DataTypes/Day.hs+5−2
@@ -7,11 +7,14 @@ import Data.Time.Calendar
7dayAtomFunctions :: AtomFunctions
7dayAtomFunctions :: AtomFunctions
8dayAtomFunctions = HS.fromList [
8dayAtomFunctions = HS.fromList [
9 AtomFunction { atomFuncName = "fromGregorian",
9 AtomFunction { atomFuncName = "fromGregorian",
10− atomFuncType = [IntegerAtomType, IntegerAtomType, IntegerAtomType, DayAtomType],
10+ atomFuncType = [IntAtomType, IntAtomType, IntAtomType, DayAtomType],
11− atomFuncBody = compiledAtomFunctionBody $ \(IntegerAtom year:IntegerAtom month:IntegerAtom day:_) -> pure $ DayAtom (fromGregorian (fromIntegral year) (fromIntegral month) (fromIntegral day))
11+ atomFuncBody = compiledAtomFunctionBody $ \(IntAtom year:IntAtom month:IntAtom day:_) -> pure $ DayAtom (fromGregorian (fromIntegral year) (fromIntegral month) (fromIntegral day))
12 },
12 },
13 AtomFunction { atomFuncName = "dayEarlierThan",
13 AtomFunction { atomFuncName = "dayEarlierThan",
14 atomFuncType = [DayAtomType, DayAtomType, BoolAtomType],
14 atomFuncType = [DayAtomType, DayAtomType, BoolAtomType],
15 atomFuncBody = compiledAtomFunctionBody $ \(ConstructedAtom _ _ (IntAtom dayA:_):ConstructedAtom _ _ (IntAtom dayB:_):_) -> pure (BoolAtom (dayA < dayB))
15 atomFuncBody = compiledAtomFunctionBody $ \(ConstructedAtom _ _ (IntAtom dayA:_):ConstructedAtom _ _ (IntAtom dayB:_):_) -> pure (BoolAtom (dayA < dayB))
16 }
16 }
17 ]
17 ]
18+
19+dayTypeConstructorMapping :: TypeConstructorMapping
20+dayTypeConstructorMapping = [] -- use fromGregorian
src/lib/ProjectM36/DataTypes/Interval.hs+19−57
@@ -6,24 +6,7 @@ import ProjectM36.AtomType
6import ProjectM36.DataTypes.Primitive
6import ProjectM36.DataTypes.Primitive
7import ProjectM36.AtomFunctionError
7import ProjectM36.AtomFunctionError
8import qualified Data.HashSet as HS
8import qualified Data.HashSet as HS
9−import qualified Data.Map as M
10−import Control.Monad (when)
11−import Data.Maybe
12
9
13−type OpenInterval = Bool
14−
15−intervalSubType :: AtomType -> AtomType
16−intervalSubType typ = if isIntervalAtomType typ then
17− case typ of
18− ConstructedAtomType _ tvMap ->
19− fromMaybe err (M.lookup "a" tvMap)
20− _ -> err
21− else
22− err
23− where
24− err = error "intervalSubType on non-interval type"
25−
26−
27-- in lieu of typeclass support, we just hard-code the types which can be part of an interval
10-- in lieu of typeclass support, we just hard-code the types which can be part of an interval
28supportsInterval :: AtomType -> Bool
11supportsInterval :: AtomType -> Bool
29supportsInterval typ = case typ of
12supportsInterval typ = case typ of
@@ -35,9 +18,9 @@ supportsInterval typ = case typ of
35 DateTimeAtomType -> True
18 DateTimeAtomType -> True
36 ByteStringAtomType -> False
19 ByteStringAtomType -> False
37 BoolAtomType -> False
20 BoolAtomType -> False
21+ IntervalAtomType _ -> False
38 RelationAtomType _ -> False
22 RelationAtomType _ -> False
39 ConstructedAtomType _ _ -> False --once we support an interval-style typeclass, we might enable this
23 ConstructedAtomType _ _ -> False --once we support an interval-style typeclass, we might enable this
40− RelationalExprAtomType -> False
41 TypeVariableType _ -> False
24 TypeVariableType _ -> False
42
25
43supportsOrdering :: AtomType -> Bool
26supportsOrdering :: AtomType -> Bool
@@ -50,8 +33,8 @@ supportsOrdering typ = case typ of
50 DateTimeAtomType -> True
33 DateTimeAtomType -> True
51 ByteStringAtomType -> False
34 ByteStringAtomType -> False
52 BoolAtomType -> False
35 BoolAtomType -> False
36+ IntervalAtomType _ -> False
53 RelationAtomType _ -> False
37 RelationAtomType _ -> False
54− RelationalExprAtomType -> False
55 ConstructedAtomType _ _ -> False --once we support an interval-style typeclass, we might enable this
38 ConstructedAtomType _ _ -> False --once we support an interval-style typeclass, we might enable this
56 TypeVariableType _ -> False
39 TypeVariableType _ -> False
57
40
@@ -84,11 +67,7 @@ createInterval atom1 atom2 bopen eopen = do
84 else
67 else
85 Right valid
68 Right valid
86 LT -> Right valid
69 LT -> Right valid
87− where valid = ConstructedAtom "Interval" iType [atom1, atom2, BoolAtom bopen, BoolAtom eopen]
70+ where valid = IntervalAtom atom1 atom2 bopen eopen
88− iType = intervalAtomType (atomTypeForAtom atom1)
89−
90−intervalAtomType :: AtomType -> AtomType
91−intervalAtomType typ = ConstructedAtomType "Interval" (M.singleton "a" typ)
92
71
93intervalAtomFunctions :: AtomFunctions
72intervalAtomFunctions :: AtomFunctions
94intervalAtomFunctions = HS.fromList [
73intervalAtomFunctions = HS.fromList [
@@ -97,7 +76,7 @@ intervalAtomFunctions = HS.fromList [
97 TypeVariableType "a",
76 TypeVariableType "a",
98 BoolAtomType,
77 BoolAtomType,
99 BoolAtomType,
78 BoolAtomType,
100− intervalAtomType (TypeVariableType "a")],
79+ IntervalAtomType (TypeVariableType "a")],
101 atomFuncBody = compiledAtomFunctionBody $ \(atom1:atom2:BoolAtom bopen:BoolAtom eopen:_) -> do
80 atomFuncBody = compiledAtomFunctionBody $ \(atom1:atom2:BoolAtom bopen:BoolAtom eopen:_) -> do
102 let aType = atomTypeForAtom atom1
81 let aType = atomTypeForAtom atom1
103 if supportsInterval aType then
82 if supportsInterval aType then
@@ -107,40 +86,23 @@ intervalAtomFunctions = HS.fromList [
107 },
86 },
108 AtomFunction {
87 AtomFunction {
109 atomFuncName = "interval_overlaps",
88 atomFuncName = "interval_overlaps",
110− atomFuncType = [intervalAtomType (TypeVariableType "a"),
89+ atomFuncType = [IntervalAtomType (TypeVariableType "a"),
111− intervalAtomType (TypeVariableType "a"),
90+ IntervalAtomType (TypeVariableType "a"),
112 BoolAtomType],
91 BoolAtomType],
113− atomFuncBody = compiledAtomFunctionBody $ \(i1@ConstructedAtom{}:i2@ConstructedAtom{}:_) ->
92+ atomFuncBody = compiledAtomFunctionBody $ \(i1@IntervalAtom{}:i2@IntervalAtom{}:_) -> do
114− BoolAtom <$> intervalOverlaps i1 i2
93+ res <- intervalOverlaps i1 i2
94+ pure (BoolAtom res)
115 }]
95 }]
116−
96+
117−isIntervalAtomType :: AtomType -> Bool
97+
118−isIntervalAtomType (ConstructedAtomType nam tvMap) =
119− nam == "Interval" && M.keys tvMap == ["a"] && case M.lookup "a" tvMap of
120− Nothing -> False
121− Just subType -> supportsInterval subType || subType == TypeVariableType "a"
122−isIntervalAtomType _ = False
123−
124intervalOverlaps :: Atom -> Atom -> Either AtomFunctionError Bool
98intervalOverlaps :: Atom -> Atom -> Either AtomFunctionError Bool
125−intervalOverlaps (ConstructedAtom dCons1 typ1 [i1start,
99+intervalOverlaps (IntervalAtom i1start i1end i1startopen i1endopen) (IntervalAtom i2start i2end i2startopen i2endopen) = do
126− i1end,
127− BoolAtom i1startopen,
128− BoolAtom i1endopen]) (ConstructedAtom dCons2 typ2
129− [i2start,
130− i2end,
131− BoolAtom i2startopen,
132− BoolAtom i2endopen]) = do
133− when (dCons1 /= "Interval" || dCons2 /= "Interval" || not (isIntervalAtomType typ1) || not (isIntervalAtomType typ2)) (Left AtomFunctionTypeMismatchError)
134− cmp1 <- atomCompare i1start i2end
100+ cmp1 <- atomCompare i1start i2end
135− cmp2 <- atomCompare i2start i1end
101+ cmp2 <- atomCompare i2start i1end
136− let startcmp = if i1startopen || i2endopen then oplt else oplte
102+ let startcmp = if i1startopen || i2endopen then oplt else oplte
137− endcmp = if i2startopen || i1endopen then oplt else oplte
103+ endcmp = if i2startopen || i1endopen then oplt else oplte
138− oplte op = op == LT || op == EQ
104+ oplte op = op == LT || op == EQ
139− oplt op = op == LT
105+ oplt op = op == LT
140− pure (startcmp cmp1 && endcmp cmp2)
106+ pure (startcmp cmp1 && endcmp cmp2)
141intervalOverlaps _ _ = Left AtomFunctionTypeMismatchError
107intervalOverlaps _ _ = Left AtomFunctionTypeMismatchError
142
108
143−intervalTypeConstructorMapping :: TypeConstructorMapping
144−intervalTypeConstructorMapping = [(ADTypeConstructorDef "Interval" ["a"], [])]
145−
146−
src/lib/ProjectM36/DataTypes/List.hs+3−2
@@ -37,8 +37,9 @@ listAtomFunctions = HS.fromList [
37 AtomFunction {
37 AtomFunction {
38 atomFuncName = "length",
38 atomFuncName = "length",
39 atomFuncType = [listAtomType (TypeVariableType "a"), IntAtomType],
39 atomFuncType = [listAtomType (TypeVariableType "a"), IntAtomType],
40− atomFuncBody = AtomFunctionBody Nothing (\(listAtom:_) ->
40+ atomFuncBody = AtomFunctionBody Nothing (\(listAtom:_) -> do
41+ c <- listLength listAtom
41− IntAtom . fromIntegral <$> listLength listAtom)
42+ pure (IntAtom (fromIntegral c)))
42 },
43 },
43 AtomFunction {
44 AtomFunction {
44 atomFuncName = "maybeHead",
45 atomFuncName = "maybeHead",
src/lib/ProjectM36/DataTypes/NonEmptyList.hsdeleted−53
@@ -1,53 +0,0 @@
1−module ProjectM36.DataTypes.NonEmptyList where
2−import ProjectM36.Base
3−import qualified Data.Map as M
4−import qualified Data.HashSet as HS
5−import ProjectM36.AtomFunctionError
6−import ProjectM36.DataTypes.List
7−
8−nonEmptyListAtomType :: AtomType -> AtomType
9−nonEmptyListAtomType arg = ConstructedAtomType "NonEmptyList" (M.singleton "a" arg)
10−
11−-- data NonEmptyList = NECons a (Cons a)
12−nonEmptyListTypeConstructorMapping :: TypeConstructorMapping
13−nonEmptyListTypeConstructorMapping = [(ADTypeConstructorDef "NonEmptyList" ["a"],
14− [DataConstructorDef "NECons" [DataConstructorDefTypeVarNameArg "a",
15− DataConstructorDefTypeConstructorArg (ADTypeConstructor "List" [TypeVariable "a"])]])]
16−
17−nonEmptyListLength :: Atom -> Either AtomFunctionError Int
18−nonEmptyListLength (ConstructedAtom "NECons" _ (_:nextCons:_)) = do
19− c <- listLength nextCons
20− pure (c + 1)
21−nonEmptyListLength (ConstructedAtom "NECons" _ _) = pure 1
22−nonEmptyListLength _ = Left AtomFunctionTypeMismatchError
23−
24−nonEmptyListHead :: Atom -> Either AtomFunctionError Atom
25−nonEmptyListHead (ConstructedAtom "NECons" _ (val:_)) = pure val
26−nonEmptyListHead _ = Left AtomFunctionTypeMismatchError
27−
28−{-
29−listMaybeHead :: Atom -> Either AtomFunctionError Atom
30−listMaybeHead (ConstructedAtom "Cons" _ (val:_)) = pure (ConstructedAtom "Just" aType [val])
31− where
32− aType = maybeAtomType (atomTypeForAtom val)
33−listMaybeHead (ConstructedAtom "Empty" (ConstructedAtomType _ tvMap) _) =
34− case M.lookup "a" tvMap of
35− Nothing -> Left AtomFunctionTypeMismatchError
36− Just aType -> pure (ConstructedAtom "Nothing" aType [])
37−listMaybeHead _ = Left AtomFunctionTypeMismatchError
38−-}
39−
40−nonEmptyListAtomFunctions :: AtomFunctions
41−nonEmptyListAtomFunctions = HS.fromList [
42− AtomFunction {
43− atomFuncName = "nonEmptyListLength",
44− atomFuncType = [nonEmptyListAtomType (TypeVariableType "a"), IntAtomType],
45− atomFuncBody = AtomFunctionBody Nothing (\(nonEmptyListAtom:_) ->
46− IntAtom . fromIntegral <$> nonEmptyListLength nonEmptyListAtom)
47− },
48− AtomFunction {
49− atomFuncName = "nonEmptyListHead",
50− atomFuncType = [nonEmptyListAtomType (TypeVariableType "a"), TypeVariableType "a"],
51− atomFuncBody = AtomFunctionBody Nothing (\(nonEmptyListAtom:_) -> nonEmptyListHead nonEmptyListAtom)
52− }
53− ]
src/lib/ProjectM36/DataTypes/Primitive.hs+2−7
@@ -10,9 +10,7 @@ primitiveTypeConstructorMapping = map (\(name, aType) ->
10 ("Text", TextAtomType),
10 ("Text", TextAtomType),
11 ("Double", DoubleAtomType),
11 ("Double", DoubleAtomType),
12 ("Bool", BoolAtomType),
12 ("Bool", BoolAtomType),
13− ("ByteString", ByteStringAtomType),
13+ ("ByteString", ByteStringAtomType)
14− ("DateTime", DateTimeAtomType),
15− ("Day", DayAtomType)
16 ]
14 ]
17
15
18intTypeConstructor :: TypeConstructor
16intTypeConstructor :: TypeConstructor
@@ -27,9 +25,6 @@ textTypeConstructor = PrimitiveTypeConstructor "Text" TextAtomType
27dayTypeConstructor :: TypeConstructor
25dayTypeConstructor :: TypeConstructor
28dayTypeConstructor = PrimitiveTypeConstructor "Day" DayAtomType
26dayTypeConstructor = PrimitiveTypeConstructor "Day" DayAtomType
29
27
30−dateTimeTypeConstructor :: TypeConstructor
31−dateTimeTypeConstructor = PrimitiveTypeConstructor "DateTime" DayAtomType
32−
33-- | Return the type of an 'Atom'.
28-- | Return the type of an 'Atom'.
34atomTypeForAtom :: Atom -> AtomType
29atomTypeForAtom :: Atom -> AtomType
35atomTypeForAtom (IntAtom _) = IntAtomType
30atomTypeForAtom (IntAtom _) = IntAtomType
@@ -40,6 +35,6 @@ atomTypeForAtom (DayAtom _) = DayAtomType
40atomTypeForAtom (DateTimeAtom _) = DateTimeAtomType
35atomTypeForAtom (DateTimeAtom _) = DateTimeAtomType
41atomTypeForAtom (ByteStringAtom _) = ByteStringAtomType
36atomTypeForAtom (ByteStringAtom _) = ByteStringAtomType
42atomTypeForAtom (BoolAtom _) = BoolAtomType
37atomTypeForAtom (BoolAtom _) = BoolAtomType
38+atomTypeForAtom (IntervalAtom a _ _ _) = IntervalAtomType (atomTypeForAtom a)
43atomTypeForAtom (RelationAtom (Relation attrs _)) = RelationAtomType attrs
39atomTypeForAtom (RelationAtom (Relation attrs _)) = RelationAtomType attrs
44atomTypeForAtom (ConstructedAtom _ aType _) = aType
40atomTypeForAtom (ConstructedAtom _ aType _) = aType
45−atomTypeForAtom (RelationalExprAtom _) = RelationalExprAtomType
src/lib/ProjectM36/DataTypes/Sorting.hsdeleted−31
@@ -1,31 +0,0 @@
1−module ProjectM36.DataTypes.Sorting where
2−import ProjectM36.Base
3−
4−compareAtoms :: Atom -> Atom -> Ordering
5−compareAtoms (IntegerAtom i1) (IntegerAtom i2) = compare i1 i2
6−compareAtoms (IntAtom i1) (IntAtom i2) = compare i1 i2
7−compareAtoms (DoubleAtom d1) (DoubleAtom d2) = compare d1 d2
8−compareAtoms (TextAtom t1) (TextAtom t2) = compare t1 t2
9−compareAtoms (DayAtom d1) (DayAtom d2) = compare d1 d2
10−compareAtoms (DateTimeAtom d1) (DateTimeAtom d2) = compare d1 d2
11−compareAtoms (ByteStringAtom b1) (ByteStringAtom b2) = compare b1 b2
12−compareAtoms (BoolAtom b1) (BoolAtom b2) = compare b1 b2
13−compareAtoms (RelationAtom _) _ = EQ
14−compareAtoms ConstructedAtom{} _ = EQ
15−compareAtoms _ _ = EQ
16−
17−isSortableAtomType :: AtomType -> Bool
18−isSortableAtomType typ = case typ of
19− IntAtomType -> True
20− IntegerAtomType -> True
21− DoubleAtomType -> True
22− TextAtomType -> True
23− DayAtomType -> True
24− DateTimeAtomType -> True
25− ByteStringAtomType -> False
26− BoolAtomType -> True
27− RelationalExprAtomType -> False
28− RelationAtomType _ -> False
29− ConstructedAtomType _ _ -> False
30− TypeVariableType _ -> False
31−
src/lib/ProjectM36/DatabaseContext.hs+5−24
@@ -1,15 +1,11 @@
1module ProjectM36.DatabaseContext where
1module ProjectM36.DatabaseContext where
2import ProjectM36.Base
2import ProjectM36.Base
3−import Control.Monad (void)
4import qualified Data.Map as M
3import qualified Data.Map as M
5import qualified Data.HashSet as HS
4import qualified Data.HashSet as HS
6import ProjectM36.DataTypes.Basic
5import ProjectM36.DataTypes.Basic
7import ProjectM36.AtomFunctions.Basic
6import ProjectM36.AtomFunctions.Basic
7+import ProjectM36.DatabaseContextFunction
8import ProjectM36.Relation
8import ProjectM36.Relation
9−import qualified Data.ByteString.Lazy as BL
10−import ProjectM36.AtomFunction as AF
11−import ProjectM36.DatabaseContextFunction as DBCF
12−import Codec.Winery
13
9
14empty :: DatabaseContext
10empty :: DatabaseContext
15empty = DatabaseContext { inclusionDependencies = M.empty,
11empty = DatabaseContext { inclusionDependencies = M.empty,
@@ -18,37 +14,22 @@ empty = DatabaseContext { inclusionDependencies = M.empty,
18 atomFunctions = HS.empty,
14 atomFunctions = HS.empty,
19 dbcFunctions = HS.empty,
15 dbcFunctions = HS.empty,
20 typeConstructorMapping = [] }
16 typeConstructorMapping = [] }
21−
22−-- | Remove TransactionId markers on GraphRefRelationalExpr
23−stripGraphRefRelationalExpr :: GraphRefRelationalExpr -> RelationalExpr
24−stripGraphRefRelationalExpr = void
25
17
26-- | convert an existing database context into its constituent expression.
18-- | convert an existing database context into its constituent expression.
27databaseContextAsDatabaseContextExpr :: DatabaseContext -> DatabaseContextExpr
19databaseContextAsDatabaseContextExpr :: DatabaseContext -> DatabaseContextExpr
28databaseContextAsDatabaseContextExpr context = MultipleExpr $ relVarsExprs ++ incDepsExprs ++ funcsExprs
20databaseContextAsDatabaseContextExpr context = MultipleExpr $ relVarsExprs ++ incDepsExprs ++ funcsExprs
29 where
21 where
30− relVarsExprs = map (\(name, rel) -> Assign name (stripGraphRefRelationalExpr rel)) (M.toList (relationVariables context))
22+ relVarsExprs = map (\(name, rel) -> Assign name (ExistingRelation rel)) (M.toList (relationVariables context))
31 incDepsExprs :: [DatabaseContextExpr]
23 incDepsExprs :: [DatabaseContextExpr]
32 incDepsExprs = map (uncurry AddInclusionDependency) (M.toList (inclusionDependencies context))
24 incDepsExprs = map (uncurry AddInclusionDependency) (M.toList (inclusionDependencies context))
33− funcsExprs = [] -- map (\func -> ) (HS.toList funcs) -- there are no databaseExprs to add atom functions yet-}
25+ funcsExprs = [] -- map (\func -> ) (HS.toList funcs) -- there are no databaseExprs to add atom functions yet
34
26
35basicDatabaseContext :: DatabaseContext
27basicDatabaseContext :: DatabaseContext
36basicDatabaseContext = DatabaseContext { inclusionDependencies = M.empty,
28basicDatabaseContext = DatabaseContext { inclusionDependencies = M.empty,
37− relationVariables = M.fromList [("true", ExistingRelation relationTrue),
29+ relationVariables = M.fromList [("true", relationTrue),
38− ("false", ExistingRelation relationFalse)],
30+ ("false", relationFalse)],
39 atomFunctions = basicAtomFunctions,
31 atomFunctions = basicAtomFunctions,
40 dbcFunctions = basicDatabaseContextFunctions,
32 dbcFunctions = basicDatabaseContextFunctions,
41 notifications = M.empty,
33 notifications = M.empty,
42 typeConstructorMapping = basicTypeConstructorMapping
34 typeConstructorMapping = basicTypeConstructorMapping
43 }
35 }
44−
45−--for building the Merkle hash
46−hashBytes :: DatabaseContext -> BL.ByteString
47−hashBytes ctx = BL.fromChunks [incDeps, rvs, nots, tConsMap] <> atomFs <> dbcFs
48− where
49− incDeps = serialise (inclusionDependencies ctx)
50− rvs = serialise (relationVariables ctx)
51− atomFs = HS.foldr (mappend . AF.hashBytes) mempty (atomFunctions ctx)
52− dbcFs = HS.foldr (mappend . DBCF.hashBytes) mempty (dbcFunctions ctx)
53− nots = serialise (notifications ctx)
54− tConsMap = serialise (typeConstructorMapping ctx)
src/lib/ProjectM36/DatabaseContextFunction.hs+1−36
@@ -1,18 +1,9 @@
1−{-# LANGUAGE CPP #-}
2module ProjectM36.DatabaseContextFunction where
1module ProjectM36.DatabaseContextFunction where
3--implements functions which operate as: [Atom] -> DatabaseContextExpr -> Either RelationalError DatabaseContextExpr
2--implements functions which operate as: [Atom] -> DatabaseContextExpr -> Either RelationalError DatabaseContextExpr
4import ProjectM36.Base
3import ProjectM36.Base
5import ProjectM36.Error
4import ProjectM36.Error
6−import ProjectM36.Serialise.Base ()
7−import ProjectM36.Attribute as A
8−import ProjectM36.Relation
9−import ProjectM36.AtomType
10import qualified Data.HashSet as HS
5import qualified Data.HashSet as HS
11import qualified Data.Map as M
6import qualified Data.Map as M
12−import ProjectM36.ScriptSession
13−import qualified Data.Text as T
14−import qualified Data.ByteString.Lazy as BL
15−import Codec.Winery
16
7
17emptyDatabaseContextFunction :: DatabaseContextFunctionName -> DatabaseContextFunction
8emptyDatabaseContextFunction :: DatabaseContextFunctionName -> DatabaseContextFunction
18emptyDatabaseContextFunction name = DatabaseContextFunction {
9emptyDatabaseContextFunction name = DatabaseContextFunction {
@@ -62,30 +53,4 @@ databaseContextFunctionReturnType tCons = ADTypeConstructor "Either" [
62 tCons]
53 tCons]
63
54
64createScriptedDatabaseContextFunction :: DatabaseContextFunctionName -> [TypeConstructor] -> TypeConstructor -> DatabaseContextFunctionBodyScript -> DatabaseContextIOExpr
55createScriptedDatabaseContextFunction :: DatabaseContextFunctionName -> [TypeConstructor] -> TypeConstructor -> DatabaseContextFunctionBodyScript -> DatabaseContextIOExpr
65−createScriptedDatabaseContextFunction funcName argsIn retArg = AddDatabaseContextFunction funcName (argsIn ++ [databaseContextFunctionReturnType retArg])
56+createScriptedDatabaseContextFunction funcName argsIn retArg = AddDatabaseContextFunction funcName (argsIn ++ [databaseContextFunctionReturnType retArg])
66−
67−loadDatabaseContextFunctions :: ModName -> FuncName -> FilePath -> IO (Either LoadSymbolError [DatabaseContextFunction])
68−#ifdef PM36_HASKELL_SCRIPTING
69−loadDatabaseContextFunctions = loadFunction
70−#else
71−loadDatabaseContextFunctions _ _ _ = pure (Left LoadSymbolError)
72−#endif
73−
74−databaseContextFunctionsAsRelation :: DatabaseContextFunctions -> Either RelationalError Relation
75−databaseContextFunctionsAsRelation dbcFuncs = mkRelationFromList attrs tups
76− where
77− attrs = A.attributesFromList [Attribute "name" TextAtomType,
78− Attribute "arguments" TextAtomType]
79− tups = map dbcFuncToTuple (HS.toList dbcFuncs)
80− dbcFuncToTuple func = [TextAtom (dbcFuncName func),
81− TextAtom (dbcTextType (dbcFuncType func))]
82− dbcTextType typ = T.intercalate " -> " (map prettyAtomType typ ++ ["DatabaseContext", "DatabaseContext"])
83−
84−-- for merkle hash
85−hashBytes :: DatabaseContextFunction -> BL.ByteString
86−hashBytes func = BL.fromChunks [fname, ftype, fbody]
87− where
88− fname = serialise (dbcFuncName func)
89− ftype = serialise (dbcFuncType func)
90− fbody = case dbcFuncBody func of
91− DatabaseContextFunctionBody mBody _ -> serialise mBody
src/lib/ProjectM36/DatabaseContextFunctionError.hs+2−1
@@ -1,8 +1,9 @@
1{-# LANGUAGE DeriveGeneric, DeriveAnyClass #-}
1{-# LANGUAGE DeriveGeneric, DeriveAnyClass #-}
2module ProjectM36.DatabaseContextFunctionError where
2module ProjectM36.DatabaseContextFunctionError where
3import GHC.Generics
3import GHC.Generics
4+import Data.Binary
4import Control.DeepSeq
5import Control.DeepSeq
5
6
6{-# ANN module ("HLint: ignore Use newtype instead of data" :: String) #-}
7{-# ANN module ("HLint: ignore Use newtype instead of data" :: String) #-}
7data DatabaseContextFunctionError = DatabaseContextFunctionUserError String
8data DatabaseContextFunctionError = DatabaseContextFunctionUserError String
8− deriving (Generic, Eq, Show, NFData)
9+ deriving (Generic, Eq, Show, Binary, NFData)
src/lib/ProjectM36/DatabaseContextFunctionUtils.hs+8−15
@@ -3,20 +3,13 @@ import ProjectM36.RelationalExpression
3import ProjectM36.Base
3import ProjectM36.Base
4import ProjectM36.DatabaseContextFunctionError
4import ProjectM36.DatabaseContextFunctionError
5import ProjectM36.Error
5import ProjectM36.Error
6−import ProjectM36.StaticOptimizer
6+import Control.Monad.State
7+import Control.Monad.Trans.Reader
7
8
8−executeDatabaseContextExpr :: DatabaseContextExpr -> TransactionId -> TransactionGraph -> DatabaseContext -> Either DatabaseContextFunctionError DatabaseContext
9+executeDatabaseContextExpr :: DatabaseContextExpr -> DatabaseContext -> Either DatabaseContextFunctionError DatabaseContext
9−executeDatabaseContextExpr expr transId graph context' =
10+executeDatabaseContextExpr expr context = case runState (evalDatabaseContextExpr expr) (freshDatabaseState context) of
10− case run of
11+ (Right (), (context', _, _)) -> pure context'
11− Right st -> pure (dbc_context st)
12− Left err -> error (show err)
12+ (Left err, _) -> error (show err)
13− where
14− env = mkDatabaseContextEvalEnv transId graph
15− run = runDatabaseContextEvalMonad context' env (optimizeAndEvalDatabaseContextExpr True expr)
16
13
17−executeRelationalExpr :: RelationalExpr -> DatabaseContext -> TransactionGraph -> Either RelationalError Relation
14+executeRelationalExpr :: RelationalExpr -> DatabaseContext -> Either RelationalError Relation
18−executeRelationalExpr expr context graph =
15+executeRelationalExpr expr context = runReader (evalRelationalExpr expr) (mkRelationalExprState context)
19− run
20− where
21− env = mkRelationalExprEnv context graph
22− run = optimizeAndEvalRelationalExpr env expr
src/lib/ProjectM36/DateExamples.hs+3−3
@@ -16,9 +16,9 @@ dateExamples = empty { inclusionDependencies = dateIncDeps,
16 atomFunctions = basicAtomFunctions,
16 atomFunctions = basicAtomFunctions,
17 typeConstructorMapping = basicTypeConstructorMapping }
17 typeConstructorMapping = basicTypeConstructorMapping }
18 where -- these must be lower case now that data constructors are in play
18 where -- these must be lower case now that data constructors are in play
19− dateRelVars = M.fromList [("s", ExistingRelation suppliers),
19+ dateRelVars = M.fromList [("s", suppliers),
20− ("p", ExistingRelation products),
20+ ("p", products),
21− ("sp", ExistingRelation supplierProducts)]
21+ ("sp", supplierProducts)]
22 suppliers = suppliersRel
22 suppliers = suppliersRel
23 products = productsRel
23 products = productsRel
24 supplierProducts = supplierProductsRel
24 supplierProducts = supplierProductsRel
src/lib/ProjectM36/DisconnectedTransaction.hs+1−7
@@ -8,10 +8,4 @@ schemas :: DisconnectedTransaction -> Schemas
8schemas (DisconnectedTransaction _ s _) = s
8schemas (DisconnectedTransaction _ s _) = s
9
9
10parentId :: DisconnectedTransaction -> TransactionId
10parentId :: DisconnectedTransaction -> TransactionId
11−parentId (DisconnectedTransaction pid _ _) = pid
11+parentId (DisconnectedTransaction pid _ _) = pid
12−
13−isDirty :: DisconnectedTransaction -> Bool
14−isDirty (DisconnectedTransaction _ _ flag) = flag
15−
16−freshTransaction :: TransactionId -> Schemas -> DisconnectedTransaction
17−freshTransaction tid schemas' = DisconnectedTransaction tid schemas' False
src/lib/ProjectM36/Error.hs+15−28
@@ -1,7 +1,6 @@
1{-# LANGUAGE DeriveGeneric, DeriveAnyClass #-}
1{-# LANGUAGE DeriveGeneric, DeriveAnyClass #-}
2module ProjectM36.Error where
2module ProjectM36.Error where
3import ProjectM36.Base
3import ProjectM36.Base
4−import ProjectM36.MerkleHash
5import ProjectM36.DatabaseContextFunctionError
4import ProjectM36.DatabaseContextFunctionError
6import ProjectM36.AtomFunctionError
5import ProjectM36.AtomFunctionError
7import qualified Data.Set as S
6import qualified Data.Set as S
@@ -9,12 +8,12 @@ import Control.DeepSeq (NFData, rnf)
9import Control.DeepSeq.Generics (genericRnf)
8import Control.DeepSeq.Generics (genericRnf)
10import GHC.Generics (Generic)
9import GHC.Generics (Generic)
11import qualified Data.Text as T
10import qualified Data.Text as T
11+import Data.Binary
12import Data.Typeable
12import Data.Typeable
13import Control.Exception
13import Control.Exception
14
14
15data RelationalError = NoSuchAttributeNamesError (S.Set AttributeName)
15data RelationalError = NoSuchAttributeNamesError (S.Set AttributeName)
16 | TupleAttributeCountMismatchError Int --attribute name
16 | TupleAttributeCountMismatchError Int --attribute name
17− | EmptyAttributesError
18 | DuplicateAttributeNamesError (S.Set AttributeName)
17 | DuplicateAttributeNamesError (S.Set AttributeName)
19 | TupleAttributeTypeMismatchError Attributes
18 | TupleAttributeTypeMismatchError Attributes
20 | AttributeCountMismatchError Int
19 | AttributeCountMismatchError Int
@@ -24,7 +23,7 @@ data RelationalError = NoSuchAttributeNamesError (S.Set AttributeName)
24 | CouldNotInferAttributes
23 | CouldNotInferAttributes
25 | RelVarNotDefinedError RelVarName
24 | RelVarNotDefinedError RelVarName
26 | RelVarAlreadyDefinedError RelVarName
25 | RelVarAlreadyDefinedError RelVarName
27− | RelationTypeMismatchError Attributes Attributes --expected, found
26+ | RelVarAssignmentTypeMismatchError Attributes Attributes --expected, found
28 | InclusionDependencyCheckError IncDepName
27 | InclusionDependencyCheckError IncDepName
29 | InclusionDependencyNameInUseError IncDepName
28 | InclusionDependencyNameInUseError IncDepName
30 | InclusionDependencyNameNotInUseError IncDepName
29 | InclusionDependencyNameNotInUseError IncDepName
@@ -62,7 +61,6 @@ data RelationalError = NoSuchAttributeNamesError (S.Set AttributeName)
62 | AtomTypeNameInUseError AtomTypeName
61 | AtomTypeNameInUseError AtomTypeName
63 | IncompletelyDefinedAtomTypeWithConstructorError
62 | IncompletelyDefinedAtomTypeWithConstructorError
64 | AtomTypeNameNotInUseError AtomTypeName
63 | AtomTypeNameNotInUseError AtomTypeName
65− | AttributeNotSortableError Attribute
66 | FunctionNameInUseError AtomFunctionName
64 | FunctionNameInUseError AtomFunctionName
67 | FunctionNameNotInUseError AtomFunctionName
65 | FunctionNameNotInUseError AtomFunctionName
68 | EmptyCommitError
66 | EmptyCommitError
@@ -81,12 +79,11 @@ data RelationalError = NoSuchAttributeNamesError (S.Set AttributeName)
81 | RelationValuedAttributesNotSupportedError [AttributeName]
79 | RelationValuedAttributesNotSupportedError [AttributeName]
82 | NotificationNameInUseError NotificationName
80 | NotificationNameInUseError NotificationName
83 | NotificationNameNotInUseError NotificationName
81 | NotificationNameNotInUseError NotificationName
84− | ImportError ImportError'
82+ | ImportError T.Text -- really? This should be broken out into some other error type- this has nothing to do with relational algebra
85 | ExportError T.Text
83 | ExportError T.Text
86 | UnhandledExceptionError String
84 | UnhandledExceptionError String
87 | MergeTransactionError MergeError
85 | MergeTransactionError MergeError
88 | ScriptError ScriptCompilationError
86 | ScriptError ScriptCompilationError
89− | LoadFunctionError
90 | DatabaseContextFunctionUserError DatabaseContextFunctionError
87 | DatabaseContextFunctionUserError DatabaseContextFunctionError
91 | DatabaseLoadError PersistenceError
88 | DatabaseLoadError PersistenceError
92
89
@@ -96,21 +93,14 @@ data RelationalError = NoSuchAttributeNamesError (S.Set AttributeName)
96 | SchemaCreationError SchemaError
93 | SchemaCreationError SchemaError
97
94
98 | ImproperDatabaseStateError
95 | ImproperDatabaseStateError
99−
96+
100− | NonConcreteSchemaPlanError
101−
102− | NoUncommittedContextInEvalError
103− | TupleExprsReferenceMultipleMarkersError
104−
105− | MerkleHashValidationError TransactionId MerkleHash MerkleHash
106−
107 | MultipleErrors [RelationalError]
97 | MultipleErrors [RelationalError]
108− deriving (Show,Eq,Generic,Typeable, NFData)
98+ deriving (Show,Eq,Generic,Binary,Typeable, NFData)
109
99
110data PersistenceError = InvalidDirectoryError FilePath |
100data PersistenceError = InvalidDirectoryError FilePath |
111 MissingTransactionError TransactionId |
101 MissingTransactionError TransactionId |
112 WrongDatabaseFormatVersionError String String
102 WrongDatabaseFormatVersionError String String
113− deriving (Show, Eq, Generic, NFData)
103+ deriving (Show, Eq, Generic, Binary, NFData)
114
104
115--collapse list of errors into normal error- if there is just one, just return one
105--collapse list of errors into normal error- if there is just one, just return one
116someErrors :: [RelationalError] -> RelationalError
106someErrors :: [RelationalError] -> RelationalError
@@ -128,7 +118,7 @@ data MergeError = SelectedHeadMismatchMergeError |
128 StrategyViolatesComponentMergeError | --failed merge in inc deps, relvars, etc.
118 StrategyViolatesComponentMergeError | --failed merge in inc deps, relvars, etc.
129 StrategyViolatesRelationVariableMergeError |
119 StrategyViolatesRelationVariableMergeError |
130 StrategyViolatesTypeConstructorMergeError
120 StrategyViolatesTypeConstructorMergeError
131− deriving (Show, Eq, Generic, Typeable)
121+ deriving (Show, Eq, Generic, Binary, Typeable)
132
122
133instance NFData MergeError where rnf = genericRnf
123instance NFData MergeError where rnf = genericRnf
134
124
@@ -136,20 +126,17 @@ data ScriptCompilationError = TypeCheckCompilationError String String | --expect
136 SyntaxErrorCompilationError String |
126 SyntaxErrorCompilationError String |
137 ScriptCompilationDisabledError |
127 ScriptCompilationDisabledError |
138 OtherScriptCompilationError String
128 OtherScriptCompilationError String
139− deriving (Show, Eq, Generic, Typeable, NFData)
129+ deriving (Show, Eq, Generic, Binary, Typeable, NFData)
140
130
141instance Exception ScriptCompilationError
131instance Exception ScriptCompilationError
142
132
143data SchemaError = RelVarReferencesMissing (S.Set RelVarName) |
133data SchemaError = RelVarReferencesMissing (S.Set RelVarName) |
144 RelVarInReferencedMoreThanOnce RelVarName |
134 RelVarInReferencedMoreThanOnce RelVarName |
145 RelVarOutReferencedMoreThanOnce RelVarName
135 RelVarOutReferencedMoreThanOnce RelVarName
146− deriving (Show, Eq, Generic, Typeable, NFData)
136+ deriving (Show, Eq, Generic, Binary, Typeable, NFData)
147−
137+
148−
138+
149−data ImportError' = InvalidSHA256Error T.Text
139+-- errors returned from the distributed-process call handlers
150− | SHA256MismatchError T.Text T.Text
140+data ServerError = RequestTimeoutError |
151− | InvalidFileURIError T.Text
141+ ProcessDiedError String
152− | ImportFileDecodeError T.Text
153− | ImportFileError T.Text
154− | ImportDownloadError T.Text
155− deriving (Show, Eq, Generic, Typeable, NFData)
142+ deriving (Generic, Binary, Eq)
src/lib/ProjectM36/FileLock.hs+15−5
@@ -1,4 +1,4 @@
1−{-# LANGUAGE CPP #-}
1+{-# LANGUAGE CPP, NamedFieldPuns #-}
2--cross-platform file locking utilizing POSIX file locking on Unix/Linux and Windows file locking
2--cross-platform file locking utilizing POSIX file locking on Unix/Linux and Windows file locking
3--hackage's System.FileLock doesn't support POSIX advisory locks nor locking file based on file descriptors, hence this needless rewrite
3--hackage's System.FileLock doesn't support POSIX advisory locks nor locking file based on file descriptors, hence this needless rewrite
4module ProjectM36.FileLock where
4module ProjectM36.FileLock where
@@ -35,6 +35,7 @@ openLockFile path = createFile path
35
35
36closeLockFile :: LockFile -> IO ()
36closeLockFile :: LockFile -> IO ()
37closeLockFile file = do
37closeLockFile file = do
38+ unlockFile file
38 closeHandle file
39 closeHandle file
39
40
40--swiped from System.FileLock package
41--swiped from System.FileLock package
@@ -48,14 +49,22 @@ lockFile winHandle lock = do
48
49
49 allocaBytes sizeof_OVERLAPPED $ \op -> do
50 allocaBytes sizeof_OVERLAPPED $ \op -> do
50 zeroMemory op $ fromIntegral sizeof_OVERLAPPED
51 zeroMemory op $ fromIntegral sizeof_OVERLAPPED
51− failIfFalse_ "LockFileEx" $ c_lockFileEx winHandle (exFlag .|. blockFlag) 0 1 0 op
52+ res <- c_lockFileEx winHandle (exFlag .|. blockFlag) 0 1 0 op
53+ if res then
54+ pure ()
55+ else
56+ error "failed to wait for database lock"
52
57
53unlockFile :: HANDLE -> IO ()
58unlockFile :: HANDLE -> IO ()
54unlockFile winHandle = do
59unlockFile winHandle = do
55 let sizeof_OVERLAPPED = 32
60 let sizeof_OVERLAPPED = 32
56 allocaBytes sizeof_OVERLAPPED $ \op -> do
61 allocaBytes sizeof_OVERLAPPED $ \op -> do
57 zeroMemory op $ fromIntegral sizeof_OVERLAPPED
62 zeroMemory op $ fromIntegral sizeof_OVERLAPPED
58− failIfFalse_ "UnlockFileEx" $ c_unlockFileEx winHandle 0 1 0 op
63+ res <- c_unlockFileEx winHandle 0 1 0 op
64+ if res then
65+ pure ()
66+ else
67+ error ("failed to unlock database lock: " ++ show res)
59
68
60#else
69#else
61--all of this complicated nonsense is fixed if we switch to GHC 8.2 which includes native flock support on handles
70--all of this complicated nonsense is fixed if we switch to GHC 8.2 which includes native flock support on handles
@@ -75,7 +84,8 @@ openLockFile path =
75 LockFile <$> P.createFile path ownerWriteMode
84 LockFile <$> P.createFile path ownerWriteMode
76
85
77closeLockFile :: LockFile -> IO ()
86closeLockFile :: LockFile -> IO ()
78−closeLockFile (LockFile fd) =
87+closeLockFile l@(LockFile fd) = do
88+ unlockFile l
79 P.closeFd fd
89 P.closeFd fd
80
90
81--blocks on lock, if necessary
91--blocks on lock, if necessary
@@ -91,6 +101,6 @@ unlockFile (LockFile fd) =
91 P.waitToSetLock fd (lockStruct P.Unlock)
101 P.waitToSetLock fd (lockStruct P.Unlock)
92#endif
102#endif
93
103
94−data LockType = ReadLock | WriteLock deriving (Show)
104+data LockType = ReadLock | WriteLock
95
105
96
106
src/lib/ProjectM36/GraphRefRelationalExpr.hsdeleted−45
@@ -1,45 +0,0 @@
1−module ProjectM36.GraphRefRelationalExpr where
2−--evaluate relational expressions across the entire transaction graph to support cross-transaction referencing
3−import ProjectM36.Base
4−import qualified Data.Set as S
5−
6−--import Debug.Trace
7−
8−data SingularTransactionRef = SingularTransactionRef GraphRefTransactionMarker |
9− MultipleTransactionsRef |
10− NoTransactionsRef
11− deriving (Eq, Show)
12−
13−instance Semigroup SingularTransactionRef where
14− NoTransactionsRef <> x = x
15− MultipleTransactionsRef <> _ = MultipleTransactionsRef
16− SingularTransactionRef tidA <> s@(SingularTransactionRef tidB) =
17− if tidA == tidB then
18− s
19− else
20− MultipleTransactionsRef
21− s@SingularTransactionRef{} <> NoTransactionsRef = s
22− _ <> MultipleTransactionsRef = MultipleTransactionsRef
23−
24−instance Monoid SingularTransactionRef where
25− mempty = NoTransactionsRef
26−
27−-- | return `Just transid` if this GraphRefRelationalExpr refers to just one transaction in the graph. This is useful for determining if certain optimizations can apply.
28−singularTransaction :: Foldable t => t GraphRefTransactionMarker -> SingularTransactionRef
29−singularTransaction expr
30− | S.null transSet = NoTransactionsRef
31− | S.size transSet == 1 = SingularTransactionRef (head (S.toList transSet))
32− | otherwise = MultipleTransactionsRef
33− where
34− transSet = foldr S.insert S.empty expr
35−
36−-- | Return True if two 'GraphRefRelationalExpr's both refer exclusively to the same transaction (or none at all).
37−inSameTransaction :: GraphRefRelationalExpr -> GraphRefRelationalExpr -> Maybe GraphRefTransactionMarker
38−inSameTransaction exprA exprB = case (stA, stB) of
39− (SingularTransactionRef tA, SingularTransactionRef tB) | tA == tB -> Just tA
40− _ -> Nothing
41− where stA = singularTransaction exprA
42− stB = singularTransaction exprB
43−
44−singularTransactions :: (Foldable f, Foldable t) => f (t GraphRefTransactionMarker) -> SingularTransactionRef
45−singularTransactions = foldMap singularTransaction
src/lib/ProjectM36/InclusionDependency.hs+6−5
@@ -4,16 +4,17 @@ import ProjectM36.Attribute
4import ProjectM36.Error
4import ProjectM36.Error
5import ProjectM36.Relation
5import ProjectM36.Relation
6import qualified Data.Map as M
6import qualified Data.Map as M
7+import qualified Data.Text as T
7
8
8inclusionDependenciesAsRelation :: InclusionDependencies -> Either RelationalError Relation
9inclusionDependenciesAsRelation :: InclusionDependencies -> Either RelationalError Relation
9inclusionDependenciesAsRelation incDeps =
10inclusionDependenciesAsRelation incDeps =
10 mkRelationFromList attrs (map incDepAsAtoms (M.toList incDeps))
11 mkRelationFromList attrs (map incDepAsAtoms (M.toList incDeps))
11 where
12 where
12 attrs = attributesFromList [Attribute "name" TextAtomType,
13 attrs = attributesFromList [Attribute "name" TextAtomType,
13− Attribute "sub" RelationalExprAtomType,
14+ Attribute "sub" TextAtomType,
14− Attribute "super" RelationalExprAtomType
15+ Attribute "super" TextAtomType
15 ]
16 ]
16 incDepAsAtoms (name, InclusionDependency exprA exprB) = [TextAtom name,
17 incDepAsAtoms (name, InclusionDependency exprA exprB) = [TextAtom name,
17− RelationalExprAtom exprA,
18+ TextAtom (T.pack (show exprA)),
18− RelationalExprAtom exprB]
19+ TextAtom (T.pack (show exprB))]
19−
20+
src/lib/ProjectM36/IsomorphicSchema.hs+33−30
@@ -1,20 +1,22 @@
1−{-# LANGUAGE DeriveGeneric, LambdaCase, DerivingVia #-}
1+{-# LANGUAGE DeriveGeneric, DeriveAnyClass, LambdaCase #-}
2module ProjectM36.IsomorphicSchema where
2module ProjectM36.IsomorphicSchema where
3import ProjectM36.Base
3import ProjectM36.Base
4import ProjectM36.Error
4import ProjectM36.Error
5import ProjectM36.MiscUtils
5import ProjectM36.MiscUtils
6−import ProjectM36.Relation
7−import ProjectM36.NormalizeExpr
8import ProjectM36.RelationalExpression
6import ProjectM36.RelationalExpression
7+import ProjectM36.Relation
9import qualified ProjectM36.AttributeNames as AN
8import qualified ProjectM36.AttributeNames as AN
10import Control.Monad
9import Control.Monad
10+import Control.Monad.State
11+import Control.Monad.Trans.Reader
11import GHC.Generics
12import GHC.Generics
13+import Data.Binary
12import qualified Data.Map as M
14import qualified Data.Map as M
13import qualified Data.Set as S
15import qualified Data.Set as S
14import qualified Data.List as L
16import qualified Data.List as L
15−#if __GLASGOW_HASKELL__ < 804
17+import qualified Data.Text as T
16import Data.Monoid
18import Data.Monoid
17−#endif
19+--import Debug.Trace
18-- isomorphic schemas offer bi-directional functors between two schemas
20-- isomorphic schemas offer bi-directional functors between two schemas
19
21
20--TODO: note that renaming a relvar should alter any stored isomorphisms as well
22--TODO: note that renaming a relvar should alter any stored isomorphisms as well
@@ -27,7 +29,8 @@ import Data.Monoid
27
29
28data SchemaExpr = AddSubschema SchemaName SchemaIsomorphs |
30data SchemaExpr = AddSubschema SchemaName SchemaIsomorphs |
29 RemoveSubschema SchemaName
31 RemoveSubschema SchemaName
30− deriving (Generic, Show)
32+ deriving (Generic, Binary, Show)
33+
31
34
32isomorphs :: Schema -> SchemaIsomorphs
35isomorphs :: Schema -> SchemaIsomorphs
33isomorphs (Schema i) = i
36isomorphs (Schema i) = i
@@ -253,15 +256,15 @@ inclusionDependencyInSchema schema (InclusionDependency rexprA rexprB) = do
253inclusionDependenciesInSchema :: Schema -> InclusionDependencies -> Either RelationalError InclusionDependencies
256inclusionDependenciesInSchema :: Schema -> InclusionDependencies -> Either RelationalError InclusionDependencies
254inclusionDependenciesInSchema schema incDeps = M.fromList <$> mapM (\(depName, dep) -> inclusionDependencyInSchema schema dep >>= \newDep -> pure (depName, newDep)) (M.toList incDeps)
257inclusionDependenciesInSchema schema incDeps = M.fromList <$> mapM (\(depName, dep) -> inclusionDependencyInSchema schema dep >>= \newDep -> pure (depName, newDep)) (M.toList incDeps)
255
258
256−relationVariablesInSchema :: Schema -> Either RelationalError RelationVariables
259+relationVariablesInSchema :: Schema -> DatabaseContext -> Either RelationalError RelationVariables
257−relationVariablesInSchema schema@(Schema morphs) = foldM transform M.empty morphs
260+relationVariablesInSchema schema@(Schema morphs) context = foldM transform M.empty morphs
258 where
261 where
259 transform newRvMap morph = do
262 transform newRvMap morph = do
260 let rvNames = isomorphInRelVarNames morph
263 let rvNames = isomorphInRelVarNames morph
261 rvAssocs <- mapM (\rv -> do
264 rvAssocs <- mapM (\rv -> do
262 expr' <- processRelationalExprInSchema schema (RelationVariable rv ())
265 expr' <- processRelationalExprInSchema schema (RelationVariable rv ())
263− let gfExpr = runProcessExprM UncommittedContextMarker (processRelationalExpr expr')
266+ rel <- runReader (evalRelationalExpr expr') (RelationalExprStateElems context)
264− pure (rv, gfExpr)) rvNames
267+ pure (rv, rel)) rvNames
265 pure (M.union newRvMap (M.fromList rvAssocs))
268 pure (M.union newRvMap (M.fromList rvAssocs))
266
269
267
270
@@ -301,32 +304,32 @@ validate morph underlyingRvNames = if S.size invalidRvNames > 0 then
301
304
302-- | Create inclusion dependencies mainly for IsoRestrict because the predicate should hold in the base schema.
305-- | Create inclusion dependencies mainly for IsoRestrict because the predicate should hold in the base schema.
303createIncDepsForIsomorph :: SchemaName -> SchemaIsomorph -> InclusionDependencies
306createIncDepsForIsomorph :: SchemaName -> SchemaIsomorph -> InclusionDependencies
304−createIncDepsForIsomorph sname (IsoRestrict origRv predi (rvTrue, rvFalse)) = let
307+createIncDepsForIsomorph sname (IsoRestrict _ predi (rvTrue, rvFalse)) = let
305 newIncDep predicate rv = InclusionDependency (Project AN.empty (Restrict predicate (RelationVariable rv ()))) (ExistingRelation relationTrue)
308 newIncDep predicate rv = InclusionDependency (Project AN.empty (Restrict predicate (RelationVariable rv ()))) (ExistingRelation relationTrue)
306− incDepName b = "schema" <> "_" <> sname <> "_" <> b in
309+ incDepName b = "schema" <> "_" <> sname <> "_" <> T.pack (show b) in
307− M.fromList [(incDepName (origRv <> "_true"), newIncDep predi rvTrue),
310+ M.fromList [(incDepName True, newIncDep predi rvTrue),
308− (incDepName (origRv <> "_false"), newIncDep (NotPredicate predi) rvFalse)]
311+ (incDepName False, newIncDep (NotPredicate predi) rvFalse)]
309createIncDepsForIsomorph _ _ = M.empty
312createIncDepsForIsomorph _ _ = M.empty
310
313
311-- in the case of IsoRestrict, the database context should be updated with the restriction so that if the restriction does not hold, then the schema cannot be created
314-- in the case of IsoRestrict, the database context should be updated with the restriction so that if the restriction does not hold, then the schema cannot be created
312−evalSchemaExpr :: SchemaExpr -> DatabaseContext -> TransactionId -> TransactionGraph -> Subschemas -> Either RelationalError (Subschemas, DatabaseContext)
315+evalSchemaExpr :: SchemaExpr -> DatabaseContext -> Subschemas -> Either RelationalError (Subschemas, DatabaseContext)
313−evalSchemaExpr (AddSubschema sname morphs) context transId graph sschemas =
316+evalSchemaExpr (AddSubschema sname morphs) context sschemas =
314 if M.member sname sschemas then
317 if M.member sname sschemas then
315 Left (SubschemaNameInUseError sname)
318 Left (SubschemaNameInUseError sname)
316− else
319+ else case valid of
317− case validateSchema (Schema morphs) context of
318− Just err -> Left (SchemaCreationError err)
320+ Just err -> Left (SchemaCreationError err)
319− Nothing -> do
321+ Nothing ->
320− let newSchemas = M.insert sname newSchema sschemas
322+ let newSchemas = M.insert sname newSchema sschemas
321− newSchema = Schema morphs
322− moreIncDeps = foldr (\morph acc -> M.union acc (createIncDepsForIsomorph sname morph)) M.empty morphs
323+ moreIncDeps = foldr (\morph acc -> M.union acc (createIncDepsForIsomorph sname morph)) M.empty morphs
323− incDepExprs = MultipleExpr (map (uncurry AddInclusionDependency) (M.toList moreIncDeps))
324+ incDepExprs = MultipleExpr (map (uncurry AddInclusionDependency) (M.toList moreIncDeps))
324− dbenv = mkDatabaseContextEvalEnv transId graph
325+ in
325− dbstate <- runDatabaseContextEvalMonad context dbenv (evalGraphRefDatabaseContextExpr incDepExprs)
326+ case runState (evalDatabaseContextExpr incDepExprs) (context, M.empty, False) of
326− pure (newSchemas, dbc_context dbstate)
327+ (Left err, _) -> Left err
327−--need to propagate dirty flag here
328+ (Right (), (newContext,_,_)) -> pure (newSchemas, newContext) --need to propagate dirty flag here
328−
329+ where
330+ newSchema = Schema morphs
331+ valid = validateSchema newSchema context
329−evalSchemaExpr (RemoveSubschema sname) context _ _ sschemas = if M.member sname sschemas then
332+evalSchemaExpr (RemoveSubschema sname) context sschemas = if M.member sname sschemas then
330 pure (M.delete sname sschemas, context)
333 pure (M.delete sname sschemas, context)
331 else
334 else
332 Left (SubschemaNameNotInUseError sname)
335 Left (SubschemaNameNotInUseError sname)
src/lib/ProjectM36/Key.hs−2
@@ -2,9 +2,7 @@ module ProjectM36.Key where
2import ProjectM36.Base
2import ProjectM36.Base
3import ProjectM36.Relation
3import ProjectM36.Relation
4import qualified Data.Set as S
4import qualified Data.Set as S
5−#if __GLASGOW_HASKELL__ < 804
6import Data.Monoid
5import Data.Monoid
7−#endif
8
6
9{-
7{-
10keys can be implemented using inclusion dependencies as well: the count of the projection of the keys' attributes must be equal to the count of the tuples- p. 120 Database in Depth
8keys can be implemented using inclusion dependencies as well: the count of the projection of the keys' attributes must be equal to the count of the tuples- p. 120 Database in Depth
src/lib/ProjectM36/MerkleHash.hsdeleted−9
@@ -1,9 +0,0 @@
1−{-# LANGUAGE GeneralizedNewtypeDeriving, DeriveGeneric, DerivingVia #-}
2−module ProjectM36.MerkleHash where
3−import Data.ByteString (ByteString)
4−import GHC.Generics
5−import Control.DeepSeq (NFData)
6−
7−newtype MerkleHash = MerkleHash { _unMerkleHash :: ByteString }
8− deriving (Show, Eq, Generic, Monoid, Semigroup, NFData)
9−
src/lib/ProjectM36/NormalizeExpr.hsdeleted−132
@@ -1,132 +0,0 @@
1−-- | Functions to convert all types of expresions into their GraphRef- equivalents.
2−module ProjectM36.NormalizeExpr where
3−import ProjectM36.Base
4−import Control.Monad.Trans.Reader as R
5−import qualified Data.Map as M
6−
7−--used to process/normalize exprs to their respective graph ref forms
8−type ProcessExprM a = Reader GraphRefTransactionMarker a
9−
10−type CurrentTransactionId = TransactionId
11−
12−runProcessExprM :: GraphRefTransactionMarker -> ProcessExprM a -> a
13−runProcessExprM mtid m = runReader m mtid
14−
15−askMarker :: ProcessExprM GraphRefTransactionMarker
16−askMarker = R.ask
17−
18−-- convert a RelationalExpr into a GraphRefRelationalExpr using the current trans Id
19−processRelationalExpr :: RelationalExpr -> ProcessExprM GraphRefRelationalExpr
20−processRelationalExpr (MakeRelationFromExprs mAttrs tupleExprs) = do
21− mAttrs' <- case mAttrs of
22− Nothing -> pure Nothing
23− Just mAttrs'' -> Just <$> mapM processAttributeExpr mAttrs''
24− MakeRelationFromExprs mAttrs' <$> processTupleExprs tupleExprs
25−processRelationalExpr (MakeStaticRelation attrs tupSet) = pure (MakeStaticRelation attrs tupSet)
26−processRelationalExpr (ExistingRelation rel) = pure (ExistingRelation rel)
27−--requires current trans id and graph
28−processRelationalExpr (RelationVariable rv ()) = RelationVariable rv <$> askMarker
29−processRelationalExpr (Project attrNames expr) = Project <$> processAttributeNames attrNames <*> processRelationalExpr expr
30−processRelationalExpr (Union exprA exprB) = Union <$> processRelationalExpr exprA <*> processRelationalExpr exprB
31−processRelationalExpr (Join exprA exprB) = Join <$> processRelationalExpr exprA <*> processRelationalExpr exprB
32−processRelationalExpr (Rename attrA attrB expr) =
33− Rename attrA attrB <$> processRelationalExpr expr
34−processRelationalExpr (Difference exprA exprB) = Difference <$> processRelationalExpr exprA <*> processRelationalExpr exprB
35−processRelationalExpr (Group attrNames attrName expr) = Group <$> processAttributeNames attrNames <*> pure attrName <*> processRelationalExpr expr
36−processRelationalExpr (Ungroup attrName expr) = Ungroup attrName <$> processRelationalExpr expr
37−processRelationalExpr (Restrict pred' expr) = Restrict <$> processRestrictionPredicateExpr pred' <*> processRelationalExpr expr
38−processRelationalExpr (Equals exprA exprB) =
39− Equals <$> processRelationalExpr exprA <*> processRelationalExpr exprB
40−processRelationalExpr (NotEquals exprA exprB) =
41− NotEquals <$> processRelationalExpr exprA <*> processRelationalExpr exprB
42−processRelationalExpr (Extend extendExpr expr) =
43− Extend <$> processExtendTupleExpr extendExpr <*> processRelationalExpr expr
44−processRelationalExpr (With macros expr) =
45− With <$> mapM (\(wnexpr, macroExpr) -> (,) <$> processWithNameExpr wnexpr <*> processRelationalExpr macroExpr) macros <*> processRelationalExpr expr
46−
47−processWithNameExpr :: WithNameExpr -> ProcessExprM GraphRefWithNameExpr
48−processWithNameExpr (WithNameExpr rvname ()) =
49− WithNameExpr rvname <$> askMarker
50−
51−processAttributeNames :: AttributeNames -> ProcessExprM GraphRefAttributeNames
52−processAttributeNames (AttributeNames nameSet) = pure $ AttributeNames nameSet
53−processAttributeNames (InvertedAttributeNames attrNameSet) =
54− pure $ InvertedAttributeNames attrNameSet
55−processAttributeNames (UnionAttributeNames attrNamesA attrNamesB) = UnionAttributeNames <$> processAttributeNames attrNamesA <*> processAttributeNames attrNamesB
56−processAttributeNames (IntersectAttributeNames attrNamesA attrNamesB) = IntersectAttributeNames <$> processAttributeNames attrNamesA <*> processAttributeNames attrNamesB
57−processAttributeNames (RelationalExprAttributeNames expr) = RelationalExprAttributeNames <$> processRelationalExpr expr
58−
59−processDatabaseContextExpr :: DatabaseContextExpr -> ProcessExprM GraphRefDatabaseContextExpr
60−processDatabaseContextExpr expr =
61− case expr of
62− NoOperation -> pure NoOperation
63− Define nam attrExprs -> Define nam <$> mapM processAttributeExpr attrExprs
64− Undefine nam -> pure (Undefine nam)
65− Assign nam rexpr -> Assign nam <$> processRelationalExpr rexpr
66− Insert nam rexpr -> Insert nam <$> processRelationalExpr rexpr
67− Delete nam pred' -> Delete nam <$> processRestrictionPredicateExpr pred'
68− Update nam attrMap pred' -> Update nam attrMap <$> processRestrictionPredicateExpr pred'
69−
70− AddInclusionDependency nam dep -> pure (AddInclusionDependency nam dep)
71− RemoveInclusionDependency nam -> pure (RemoveInclusionDependency nam)
72− AddNotification nam exprA exprB exprC -> pure (AddNotification nam exprA exprB exprC)
73− RemoveNotification nam -> pure (RemoveNotification nam)
74− AddTypeConstructor tyDef consDefs -> pure (AddTypeConstructor tyDef consDefs)
75− RemoveTypeConstructor tyName -> pure (RemoveTypeConstructor tyName)
76−
77− RemoveAtomFunction aFuncName -> pure (RemoveAtomFunction aFuncName)
78− RemoveDatabaseContextFunction funcName -> pure (RemoveDatabaseContextFunction funcName)
79− ExecuteDatabaseContextFunction funcName atomExprs -> ExecuteDatabaseContextFunction funcName <$> mapM processAtomExpr atomExprs
80− MultipleExpr exprs -> MultipleExpr <$> mapM processDatabaseContextExpr exprs
81−
82−processDatabaseContextIOExpr :: DatabaseContextIOExpr -> ProcessExprM GraphRefDatabaseContextIOExpr
83−processDatabaseContextIOExpr (AddAtomFunction f tcs sc) =
84− pure (AddAtomFunction f tcs sc)
85−processDatabaseContextIOExpr (LoadAtomFunctions mod' fun file) =
86− pure (LoadAtomFunctions mod' fun file)
87−processDatabaseContextIOExpr (AddDatabaseContextFunction mod' fun path) =
88− pure (AddDatabaseContextFunction mod' fun path)
89−processDatabaseContextIOExpr (LoadDatabaseContextFunctions mod' fun path) =
90− pure (LoadDatabaseContextFunctions mod' fun path)
91−processDatabaseContextIOExpr (CreateArbitraryRelation rvName attrExprs range) =
92− CreateArbitraryRelation rvName <$> mapM processAttributeExpr attrExprs <*> pure range
93−
94−processRestrictionPredicateExpr :: RestrictionPredicateExpr -> ProcessExprM GraphRefRestrictionPredicateExpr
95−processRestrictionPredicateExpr TruePredicate = pure TruePredicate
96−processRestrictionPredicateExpr (AndPredicate a b) = AndPredicate <$> processRestrictionPredicateExpr a <*> processRestrictionPredicateExpr b
97−processRestrictionPredicateExpr (OrPredicate a b) = OrPredicate <$> processRestrictionPredicateExpr a <*> processRestrictionPredicateExpr b
98−processRestrictionPredicateExpr (NotPredicate a) = NotPredicate <$> processRestrictionPredicateExpr a
99−processRestrictionPredicateExpr (RelationalExprPredicate expr) =
100− RelationalExprPredicate <$> processRelationalExpr expr
101−processRestrictionPredicateExpr (AtomExprPredicate expr) =
102− AtomExprPredicate <$> processAtomExpr expr
103−processRestrictionPredicateExpr (AttributeEqualityPredicate nam expr) =
104− AttributeEqualityPredicate nam <$> processAtomExpr expr
105−
106−processExtendTupleExpr :: ExtendTupleExpr -> ProcessExprM GraphRefExtendTupleExpr
107−processExtendTupleExpr (AttributeExtendTupleExpr nam atomExpr) =
108− AttributeExtendTupleExpr nam <$> processAtomExpr atomExpr
109−
110−processAtomExpr :: AtomExpr -> ProcessExprM GraphRefAtomExpr
111−processAtomExpr (AttributeAtomExpr nam) = pure $ AttributeAtomExpr nam
112−processAtomExpr (NakedAtomExpr atom) = pure $ NakedAtomExpr atom
113−processAtomExpr (FunctionAtomExpr fName atomExprs ()) =
114− FunctionAtomExpr fName <$> mapM processAtomExpr atomExprs <*> askMarker
115−processAtomExpr (RelationAtomExpr expr) = RelationAtomExpr <$> processRelationalExpr expr
116−processAtomExpr (ConstructedAtomExpr dConsName atomExprs ()) = ConstructedAtomExpr dConsName <$> mapM processAtomExpr atomExprs <*> askMarker
117−
118−processTupleExprs :: TupleExprs -> ProcessExprM GraphRefTupleExprs
119−processTupleExprs (TupleExprs () tupleExprs) = do
120− marker <- askMarker
121− TupleExprs marker <$> mapM processTupleExpr tupleExprs
122−
123−processTupleExpr :: TupleExpr -> ProcessExprM GraphRefTupleExpr
124−processTupleExpr (TupleExpr tMap) =
125− TupleExpr . M.fromList <$> mapM (\(k,v) -> (,) k <$> processAtomExpr v) (M.toList tMap)
126−
127−--convert AttributeExpr to GraphRefAttributeExpr
128−processAttributeExpr :: AttributeExpr -> ProcessExprM GraphRefAttributeExpr
129−processAttributeExpr (AttributeAndTypeNameExpr nam tCons ()) =
130− AttributeAndTypeNameExpr nam tCons <$> askMarker
131−processAttributeExpr (NakedAttributeExpr attr) = pure $ NakedAttributeExpr attr
132−
src/lib/ProjectM36/Notifications.hs+7−12
@@ -1,22 +1,17 @@
1module ProjectM36.Notifications where
1module ProjectM36.Notifications where
2import ProjectM36.Base
2import ProjectM36.Base
3−import ProjectM36.Error
4import ProjectM36.RelationalExpression
3import ProjectM36.RelationalExpression
5−import ProjectM36.StaticOptimizer
4+import Control.Monad.Trans.Reader
6import qualified Data.Map as M
5import qualified Data.Map as M
7import Data.Either (isRight)
6import Data.Either (isRight)
8
7
9-- | Returns the notifications which should be triggered based on the transition from the first 'DatabaseContext' to the second 'DatabaseContext'.
8-- | Returns the notifications which should be triggered based on the transition from the first 'DatabaseContext' to the second 'DatabaseContext'.
10−notificationChanges :: Notifications -> TransactionGraph -> DatabaseContext -> DatabaseContext -> Notifications
9+notificationChanges :: Notifications -> DatabaseContext -> DatabaseContext -> Notifications
11−notificationChanges nots graph context1 context2 = M.filter notificationFilter nots
10+notificationChanges nots context1 context2 = M.filter notificationFilter nots
12 where
11 where
12+ notificationFilter (Notification chExpr _ _) = let oldChangeEval = evalChangeExpr chExpr (RelationalExprStateElems context1)
13+ newChangeEval = evalChangeExpr chExpr (RelationalExprStateElems context2) in
13− notificationFilter (Notification chExpr _ _) = oldChangeEval /= newChangeEval && isRight oldChangeEval
14+ oldChangeEval /= newChangeEval && isRight oldChangeEval
14− where
15+ evalChangeExpr chExpr = runReader (evalRelationalExpr chExpr)
15− oldChangeEval = evalChangeExpr chExpr (mkRelationalExprEnv context1 graph)
16− newChangeEval = evalChangeExpr chExpr (mkRelationalExprEnv context2 graph)
17−
18− evalChangeExpr :: RelationalExpr -> RelationalExprEnv -> Either RelationalError Relation
19− evalChangeExpr chExpr env =
20− optimizeAndEvalRelationalExpr env chExpr
21
16
22
17
src/lib/ProjectM36/Persist.hs+12−16
@@ -6,6 +6,7 @@ module ProjectM36.Persist (writeFileSync,
6 printFdCount,
6 printFdCount,
7 DiskSync(..)) where
7 DiskSync(..)) where
8-- on Windows, use FlushFileBuffers and MoveFileEx
8-- on Windows, use FlushFileBuffers and MoveFileEx
9+import qualified Data.Text.IO as TIO
9import qualified Data.Text as T
10import qualified Data.Text as T
10
11
11#if defined(linux_HOST_OS)
12#if defined(linux_HOST_OS)
@@ -36,8 +37,7 @@ import Foreign.C
36#endif
37#endif
37
38
38import System.IO (withFile, IOMode(WriteMode), Handle)
39import System.IO (withFile, IOMode(WriteMode), Handle)
39−import qualified Data.ByteString as BS'
40+import qualified Data.ByteString.Lazy as BS
40−import qualified Data.Text.Encoding as TE
41
41
42#if defined(mingw32_HOST_OS)
42#if defined(mingw32_HOST_OS)
43import ProjectM36.Win32Handle
43import ProjectM36.Win32Handle
@@ -52,7 +52,7 @@ writeFileSync :: DiskSync -> FilePath -> T.Text -> IO()
52writeFileSync sync path strOut = withFile path WriteMode handler
52writeFileSync sync path strOut = withFile path WriteMode handler
53 where
53 where
54 handler handle = do
54 handler handle = do
55− BS'.hPut handle (TE.encodeUtf8 strOut)
55+ TIO.hPutStr handle strOut
56 syncHandle sync handle
56 syncHandle sync handle
57
57
58renameSync :: DiskSync -> FilePath -> FilePath -> IO ()
58renameSync :: DiskSync -> FilePath -> FilePath -> IO ()
@@ -65,13 +65,7 @@ renameSync sync srcPath dstPath = do
65atomicRename :: FilePath -> FilePath -> IO ()
65atomicRename :: FilePath -> FilePath -> IO ()
66atomicRename srcPath dstPath =
66atomicRename srcPath dstPath =
67#if defined(mingw32_HOST_OS)
67#if defined(mingw32_HOST_OS)
68−#if MIN_VERSION_Win32(2,6,0)
69− let dst = Just dstPath
70−#else
71− let dst = dstPath
72−#endif
73− in
74− Win32.moveFileEx srcPath dst Win32.mOVEFILE_REPLACE_EXISTING
68+ Win32.moveFileEx srcPath dstPath Win32.mOVEFILE_REPLACE_EXISTING
75#else
69#else
76 Posix.rename srcPath dstPath
70 Posix.rename srcPath dstPath
77#endif
71#endif
@@ -85,13 +79,12 @@ syncHandle FsyncDiskSync handle =
85 --fdatasync doesn't exist on macOS
79 --fdatasync doesn't exist on macOS
86 fd <- handleToFd handle
80 fd <- handleToFd handle
87 fileSynchroniseDataOnly fd
81 fileSynchroniseDataOnly fd
88− closeFd fd
89#else
82#else
90 do
83 do
91 fd <- handleToFd handle
84 fd <- handleToFd handle
92 fileSynchronise fd
85 fileSynchronise fd
93− closeFd fd
94#endif
86#endif
87+ closeFd fd
95
88
96syncHandle NoDiskSync _ = pure ()
89syncHandle NoDiskSync _ = pure ()
97
90
@@ -99,10 +92,10 @@ syncDirectory :: DiskSync -> FilePath -> IO ()
99syncDirectory FsyncDiskSync path = directoryFsync path
92syncDirectory FsyncDiskSync path = directoryFsync path
100syncDirectory NoDiskSync _ = pure ()
93syncDirectory NoDiskSync _ = pure ()
101
94
102−writeBSFileSync :: DiskSync -> FilePath -> BS'.ByteString -> IO ()
95+writeBSFileSync :: DiskSync -> FilePath -> BS.ByteString -> IO ()
103writeBSFileSync sync path bstring =
96writeBSFileSync sync path bstring =
104 withFile path WriteMode $ \handle -> do
97 withFile path WriteMode $ \handle -> do
105− BS'.hPut handle bstring
98+ BS.hPut handle bstring
106 syncHandle sync handle
99 syncHandle sync handle
107
100
108directoryFsync :: FilePath -> IO ()
101directoryFsync :: FilePath -> IO ()
@@ -124,10 +117,13 @@ printFdCount =
124 putStrLn "Fd count not supported on this OS."
117 putStrLn "Fd count not supported on this OS."
125#endif
118#endif
126
119
127−#if FDCOUNTSUPPORTED
120+
128fdCount :: IO Int
121fdCount :: IO Int
122+#if FDCOUNTSUPPORTED
129fdCount = do
123fdCount = do
130 fds <- getDirectoryContents FDDIR
124 fds <- getDirectoryContents FDDIR
131 pure ((length fds) - 2)
125 pure ((length fds) - 2)
126+#else
132--not supported on non-linux
127--not supported on non-linux
128+fdCount = pure 0
133−#endif
129+#endif
src/lib/ProjectM36/Relation.hs+46−29
@@ -4,11 +4,14 @@ import qualified Data.Set as S
4import qualified Data.HashSet as HS
4import qualified Data.HashSet as HS
5import Control.Monad
5import Control.Monad
6import qualified Data.Vector as V
6import qualified Data.Vector as V
7+import qualified Data.Map as M
8+import ProjectM36.AtomType
7import ProjectM36.Base
9import ProjectM36.Base
8import ProjectM36.Tuple
10import ProjectM36.Tuple
9import qualified ProjectM36.Attribute as A
11import qualified ProjectM36.Attribute as A
10import ProjectM36.TupleSet
12import ProjectM36.TupleSet
11import ProjectM36.Error
13import ProjectM36.Error
14+import ProjectM36.MiscUtils
12--import qualified Control.Parallel.Strategies as P
15--import qualified Control.Parallel.Strategies as P
13import qualified ProjectM36.TypeConstructorDef as TCD
16import qualified ProjectM36.TypeConstructorDef as TCD
14import qualified ProjectM36.DataConstructorDef as DCD
17import qualified ProjectM36.DataConstructorDef as DCD
@@ -16,6 +19,7 @@ import qualified Data.Text as T
16import Data.Either (isRight)
19import Data.Either (isRight)
17import System.Random.Shuffle
20import System.Random.Shuffle
18import Control.Monad.Random
21import Control.Monad.Random
22+import Data.List (sort)
19
23
20attributes :: Relation -> Attributes
24attributes :: Relation -> Attributes
21attributes (Relation attrs _ ) = attrs
25attributes (Relation attrs _ ) = attrs
@@ -34,13 +38,19 @@ atomTypeForName attrName (Relation attrs _) = A.atomTypeForAttributeName attrNam
34
38
35mkRelationFromList :: Attributes -> [[Atom]] -> Either RelationalError Relation
39mkRelationFromList :: Attributes -> [[Atom]] -> Either RelationalError Relation
36mkRelationFromList attrs atomMatrix = do
40mkRelationFromList attrs atomMatrix = do
37− Relation attrs <$> mkTupleSetFromList attrs atomMatrix
41+ tupSet <- mkTupleSetFromList attrs atomMatrix
42+ return $ Relation attrs tupSet
38
43
39emptyRelationWithAttrs :: Attributes -> Relation
44emptyRelationWithAttrs :: Attributes -> Relation
40emptyRelationWithAttrs attrs = Relation attrs emptyTupleSet
45emptyRelationWithAttrs attrs = Relation attrs emptyTupleSet
41
46
42mkRelation :: Attributes -> RelationTupleSet -> Either RelationalError Relation
47mkRelation :: Attributes -> RelationTupleSet -> Either RelationalError Relation
43mkRelation attrs tupleSet =
48mkRelation attrs tupleSet =
49+ --check that all attributes are unique- this cannot be done when creating attributes because the check can become expensive
50+ let duplicateAttrNames = dupes (sort (map A.attributeName (V.toList attrs))) in
51+ if not (null duplicateAttrNames) then
52+ Left (DuplicateAttributeNamesError (S.fromList duplicateAttrNames))
53+ else
44 --check that all tuples have the same keys
54 --check that all tuples have the same keys
45 --check that all tuples have keys (1-N) where N is the attribute count
55 --check that all tuples have keys (1-N) where N is the attribute count
46 case verifyTupleSet attrs tupleSet of
56 case verifyTupleSet attrs tupleSet of
@@ -55,10 +65,6 @@ mkRelationDeferVerify :: Attributes -> RelationTupleSet -> Either RelationalErro
55mkRelationDeferVerify attrs tupleSet = return $ Relation attrs (RelationTupleSet (filter tupleFilter (asList tupleSet)))
65mkRelationDeferVerify attrs tupleSet = return $ Relation attrs (RelationTupleSet (filter tupleFilter (asList tupleSet)))
56 where
66 where
57 tupleFilter tuple = isRight (verifyTuple attrs tuple)
67 tupleFilter tuple = isRight (verifyTuple attrs tuple)
58−
59−--return a relation of the same type except without any tuples
60−relationWithEmptyTupleSet :: Relation -> Relation
61−relationWithEmptyTupleSet (Relation attrs _) = emptyRelationWithAttrs attrs
62
68
63mkRelationFromTuples :: Attributes -> [RelationTuple] -> Either RelationalError Relation
69mkRelationFromTuples :: Attributes -> [RelationTuple] -> Either RelationalError Relation
64mkRelationFromTuples attrs tupleSetList = do
70mkRelationFromTuples attrs tupleSetList = do
@@ -86,12 +92,13 @@ union (Relation attrs1 tupSet1) (Relation attrs2 tupSet2) =
86 else
92 else
87 Right $ Relation attrs1 newtuples
93 Right $ Relation attrs1 newtuples
88 where
94 where
89− newtuples = tupleSetUnion attrs1 tupSet1 tupSet2
95+ newtuples = RelationTupleSet $ HS.toList . HS.fromList $ asList tupSet1 ++ map (reorderTuple attrs1) (asList tupSet2)
90−
96+
91−project :: S.Set AttributeName -> Relation -> Either RelationalError Relation
97+project :: S.Set AttributeName -> Relation -> Either RelationalError Relation
92project attrNames rel@(Relation _ tupSet) = do
98project attrNames rel@(Relation _ tupSet) = do
93 newAttrs <- A.projectionAttributesForNames attrNames (attributes rel)
99 newAttrs <- A.projectionAttributesForNames attrNames (attributes rel)
100+ let newAttrNameSet = A.attributeNameSet newAttrs
94− newTupleList <- mapM (tupleProject newAttrs) (asList tupSet)
101+ newTupleList = map (tupleProject newAttrNameSet) (asList tupSet)
95 pure (Relation newAttrs (RelationTupleSet (HS.toList (HS.fromList newTupleList))))
102 pure (Relation newAttrs (RelationTupleSet (HS.toList (HS.fromList newTupleList))))
96
103
97rename :: AttributeName -> AttributeName -> Relation -> Either RelationalError Relation
104rename :: AttributeName -> AttributeName -> Relation -> Either RelationalError Relation
@@ -146,7 +153,7 @@ group groupAttrNames newAttrName rel = do
146 groupProjectionAttributes <- A.projectionAttributesForNames groupAttrNames (attributes rel)
153 groupProjectionAttributes <- A.projectionAttributesForNames groupAttrNames (attributes rel)
147 let groupAttr = Attribute newAttrName (RelationAtomType groupProjectionAttributes)
154 let groupAttr = Attribute newAttrName (RelationAtomType groupProjectionAttributes)
148 matchingRelTuple tupIn = case imageRelationFor tupIn rel of
155 matchingRelTuple tupIn = case imageRelationFor tupIn rel of
149− Right rel2 -> RelationTuple (A.singleton groupAttr) (V.singleton (RelationAtom rel2))
156+ Right rel2 -> RelationTuple (V.singleton groupAttr) (V.singleton (RelationAtom rel2))
150 Left _ -> undefined
157 Left _ -> undefined
151 mogrifier tupIn = pure (tupleExtend tupIn (matchingRelTuple tupIn))
158 mogrifier tupIn = pure (tupleExtend tupIn (matchingRelTuple tupIn))
152 newAttrs = A.addAttribute groupAttr nonGroupProjectionAttributes
159 newAttrs = A.addAttribute groupAttr nonGroupProjectionAttributes
@@ -160,8 +167,7 @@ restrictEq :: RelationTuple -> Relation -> Either RelationalError Relation
160restrictEq tuple = restrict rfilter
167restrictEq tuple = restrict rfilter
161 where
168 where
162 rfilter :: RelationTuple -> Either RelationalError Bool
169 rfilter :: RelationTuple -> Either RelationalError Bool
163− rfilter tupleIn = do
164− pure (tupleIntersection tuple tupleIn == tuple)
170+ rfilter tupleIn = pure (tupleIntersection tuple tupleIn == tuple)
165
171
166-- unwrap relation-valued attribute
172-- unwrap relation-valued attribute
167-- return error if relval attrs and nongroup attrs overlap
173-- return error if relval attrs and nongroup attrs overlap
@@ -183,13 +189,13 @@ ungroup relvalAttrName rel = case attributesForRelval relvalAttrName rel of
183tupleUngroup :: AttributeName -> Attributes -> RelationTuple -> Either RelationalError Relation
189tupleUngroup :: AttributeName -> Attributes -> RelationTuple -> Either RelationalError Relation
184tupleUngroup relvalAttrName newAttrs tuple = do
190tupleUngroup relvalAttrName newAttrs tuple = do
185 relvalRelation <- relationForAttributeName relvalAttrName tuple
191 relvalRelation <- relationForAttributeName relvalAttrName tuple
186− let nonGroupAttrs = A.intersection newAttrs (tupleAttributes tuple)
187− nonGroupTupleProjection <- tupleProject nonGroupAttrs tuple
188− let folder tupleIn acc = case acc of
189− Left err -> Left err
190− Right accRel ->
191− union accRel $ Relation newAttrs (RelationTupleSet [tupleExtend nonGroupTupleProjection tupleIn])
192 relFold folder (Right $ Relation newAttrs emptyTupleSet) relvalRelation
192 relFold folder (Right $ Relation newAttrs emptyTupleSet) relvalRelation
193+ where
194+ nonGroupTupleProjection = tupleProject nonGroupAttrNames tuple
195+ nonGroupAttrNames = A.attributeNameSet newAttrs
196+ folder tupleIn acc = case acc of
197+ Left err -> Left err
198+ Right accRel -> union accRel $ Relation newAttrs (RelationTupleSet [tupleExtend nonGroupTupleProjection tupleIn])
193
199
194attributesForRelval :: AttributeName -> Relation -> Either RelationalError Attributes
200attributesForRelval :: AttributeName -> Relation -> Either RelationalError Attributes
195attributesForRelval relvalAttrName (Relation attrs _) = do
201attributesForRelval relvalAttrName (Relation attrs _) = do
@@ -214,7 +220,8 @@ join (Relation attrs1 tupSet1) (Relation attrs2 tupSet2) = do
214 joinedTupSet <- singleTupleSetJoin newAttrs tuple1 tupSet2
220 joinedTupSet <- singleTupleSetJoin newAttrs tuple1 tupSet2
215 return $ joinedTupSet ++ accumulator
221 return $ joinedTupSet ++ accumulator
216 newTupSetList <- foldM tupleSetJoiner [] (asList tupSet1)
222 newTupSetList <- foldM tupleSetJoiner [] (asList tupSet1)
217− Relation newAttrs <$> mkTupleSet newAttrs newTupSetList
223+ newTupSet <- mkTupleSet newAttrs newTupSetList
224+ return $ Relation newAttrs newTupSet
218
225
219-- | Difference takes two relations of the same type and returns a new relation which contains only tuples which appear in the first relation but not the second.
226-- | Difference takes two relations of the same type and returns a new relation which contains only tuples which appear in the first relation but not the second.
220difference :: Relation -> Relation -> Either RelationalError Relation
227difference :: Relation -> Relation -> Either RelationalError Relation
@@ -244,8 +251,7 @@ relMap mapper (Relation attrs tupleSet) =
244
251
245relMogrify :: (RelationTuple -> Either RelationalError RelationTuple) -> Attributes -> Relation -> Either RelationalError Relation
252relMogrify :: (RelationTuple -> Either RelationalError RelationTuple) -> Attributes -> Relation -> Either RelationalError Relation
246relMogrify mapper newAttributes (Relation _ tupSet) = do
253relMogrify mapper newAttributes (Relation _ tupSet) = do
247− newTuples <- mapM (fmap (reorderTuple newAttributes) . mapper) (asList tupSet)
254+ newTuples <- mapM mapper (asList tupSet)
248−
249 mkRelationFromTuples newAttributes newTuples
255 mkRelationFromTuples newAttributes newTuples
250
256
251relFold :: (RelationTuple -> a -> a) -> a -> Relation -> a
257relFold :: (RelationTuple -> a -> a) -> a -> Relation -> a
@@ -291,22 +297,33 @@ typesAsRelation types = mkRelationFromTuples attrs tuples
291 dConsType = RelationAtomType subAttrs
297 dConsType = RelationAtomType subAttrs
292 tuples = map mkTypeConsDescription types
298 tuples = map mkTypeConsDescription types
293
299
294− mkTypeConsDescription (tCons, dConsList) =
295− RelationTuple attrs (V.fromList [TextAtom (TCD.name tCons), mkDataConsRelation dConsList])
300+ mkTypeConsDescription (tCons, dConsList) = RelationTuple attrs (V.fromList [TextAtom (TCD.name tCons), mkDataConsRelation dConsList])
296
301
297 mkDataConsRelation dConsList = case mkRelationFromTuples subAttrs $ map (\dCons -> RelationTuple subAttrs (V.singleton $ TextAtom $ T.intercalate " " (DCD.name dCons:map (T.pack . show) (DCD.fields dCons)))) dConsList of
302 mkDataConsRelation dConsList = case mkRelationFromTuples subAttrs $ map (\dCons -> RelationTuple subAttrs (V.singleton $ TextAtom $ T.intercalate " " (DCD.name dCons:map (T.pack . show) (DCD.fields dCons)))) dConsList of
298 Left err -> error ("mkRelationFromTuples pooped " ++ show err)
303 Left err -> error ("mkRelationFromTuples pooped " ++ show err)
299 Right rel -> RelationAtom rel
304 Right rel -> RelationAtom rel
305+
306+-- | Return a Relation describing the relation variables.
307+relationVariablesAsRelation :: M.Map RelVarName Relation -> Either RelationalError Relation
308+relationVariablesAsRelation relVarMap = mkRelationFromList attrs tups
309+ where
310+ subrelAttrs = A.attributesFromList [Attribute "attribute" TextAtomType, Attribute "type" TextAtomType]
311+ attrs = A.attributesFromList [Attribute "name" TextAtomType,
312+ Attribute "attributes" (RelationAtomType subrelAttrs)]
313+ tups = map relVarToAtomList (M.toList relVarMap)
314+ relVarToAtomList (rvName, rel) = [TextAtom rvName, attributesToRel (attributes rel)]
315+ attributesToRel attrl = case mkRelationFromList subrelAttrs (map attrAtoms (V.toList attrl)) of
316+ Left err -> error ("relationVariablesAsRelation pooped " ++ show err)
317+ Right rel -> RelationAtom rel
318+ attrAtoms a = [TextAtom (A.attributeName a), TextAtom (prettyAtomType (A.atomType a))]
300
319
301-- | Randomly resort the tuples. This is useful for emphasizing that two relations are equal even when they are printed to the console in different orders.
320-- | Randomly resort the tuples. This is useful for emphasizing that two relations are equal even when they are printed to the console in different orders.
302randomizeTupleOrder :: MonadRandom m => Relation -> m Relation
321randomizeTupleOrder :: MonadRandom m => Relation -> m Relation
303−randomizeTupleOrder (Relation attrs tupSet) =
322+randomizeTupleOrder (Relation attrs tupSet) = do
304− Relation attrs . RelationTupleSet <$> shuffleM (asList tupSet)
323+ newTupSet <- shuffleM (asList tupSet)
324+ pure (Relation attrs (RelationTupleSet newTupSet))
305
325
306-- returns a tuple from the tupleset- this is useful for priming folds over the tuples
326-- returns a tuple from the tupleset- this is useful for priming folds over the tuples
307oneTuple :: Relation -> Maybe RelationTuple
327oneTuple :: Relation -> Maybe RelationTuple
308oneTuple (Relation _ (RelationTupleSet [])) = Nothing
328oneTuple (Relation _ (RelationTupleSet [])) = Nothing
309−oneTuple (Relation _ (RelationTupleSet (x:_))) = Just x
329+oneTuple (Relation _ (RelationTupleSet (x:_))) = Just x
310−
311−tuplesList :: Relation -> [RelationTuple]
312−tuplesList (Relation _ tupleSet) = asList tupleSet
src/lib/ProjectM36/Relation/Parse/CSV.hs+39−47
@@ -4,7 +4,6 @@ import ProjectM36.Base
4import ProjectM36.Error
4import ProjectM36.Error
5import ProjectM36.Relation
5import ProjectM36.Relation
6import ProjectM36.AtomType
6import ProjectM36.AtomType
7−import ProjectM36.DataTypes.Interval
8import qualified ProjectM36.Attribute as A
7import qualified ProjectM36.Attribute as A
9
8
10import Data.Csv.Parser
9import Data.Csv.Parser
@@ -38,7 +37,8 @@ csvAsRelation attrs tConsMap inString = case APBL.parse (csvWithHeader csvDecode
38 let strHeader = V.map decodeUtf8 headerRaw
37 let strHeader = V.map decodeUtf8 headerRaw
39 strMapRecords = V.map convertMap vecMapsRaw
38 strMapRecords = V.map convertMap vecMapsRaw
40 convertMap hmap = HM.fromList $ L.map (decodeUtf8 *** (T.unpack . decodeUtf8)) (HM.toList hmap)
39 convertMap hmap = HM.fromList $ L.map (decodeUtf8 *** (T.unpack . decodeUtf8)) (HM.toList hmap)
41− attrNameSet = A.attributeNameSet attrs
40+ attrNames = V.map A.attributeName attrs
41+ attrNameSet = S.fromList (V.toList attrNames)
42 headerSet = S.fromList (V.toList strHeader)
42 headerSet = S.fromList (V.toList strHeader)
43 parseAtom attrName aType textIn = case APT.parseOnly (parseCSVAtomP attrName tConsMap aType <* APT.endOfInput) textIn of
43 parseAtom attrName aType textIn = case APT.parseOnly (parseCSVAtomP attrName tConsMap aType <* APT.endOfInput) textIn of
44 Left err -> Left (ParseError (T.pack err))
44 Left err -> Left (ParseError (T.pack err))
@@ -46,7 +46,7 @@ csvAsRelation attrs tConsMap inString = case APBL.parse (csvWithHeader csvDecode
46 makeTupleList :: HM.HashMap AttributeName String -> [Either CsvImportError Atom]
46 makeTupleList :: HM.HashMap AttributeName String -> [Either CsvImportError Atom]
47 makeTupleList tupMap = V.toList $ V.map (\attr ->
47 makeTupleList tupMap = V.toList $ V.map (\attr ->
48 either (Left . AttributeMappingError) Right $
48 either (Left . AttributeMappingError) Right $
49− parseAtom (A.attributeName attr) (A.atomType attr) (T.pack $ tupMap HM.! A.attributeName attr)) (attributesVec attrs)
49+ parseAtom (A.attributeName attr) (A.atomType attr) (T.pack $ tupMap HM.! A.attributeName attr)) attrs
50 if attrNameSet == headerSet then do
50 if attrNameSet == headerSet then do
51 tupleList <- mapM sequence $ V.toList (V.map makeTupleList strMapRecords)
51 tupleList <- mapM sequence $ V.toList (V.map makeTupleList strMapRecords)
52 case mkRelationFromList attrs tupleList of
52 case mkRelationFromList attrs tupleList of
@@ -57,11 +57,12 @@ csvAsRelation attrs tConsMap inString = case APBL.parse (csvWithHeader csvDecode
57
57
58
58
59parseCSVAtomP :: AttributeName -> TypeConstructorMapping -> AtomType -> APT.Parser (Either RelationalError Atom)
59parseCSVAtomP :: AttributeName -> TypeConstructorMapping -> AtomType -> APT.Parser (Either RelationalError Atom)
60−parseCSVAtomP _ _ IntegerAtomType = Right . IntegerAtom <$> APT.decimal
60+parseCSVAtomP _ _ IntegerAtomType = (Right . IntegerAtom) <$> APT.decimal
61parseCSVAtomP _ _ IntAtomType = Right . IntAtom <$> APT.decimal
61parseCSVAtomP _ _ IntAtomType = Right . IntAtom <$> APT.decimal
62parseCSVAtomP _ _ DoubleAtomType = Right . DoubleAtom <$> APT.double
62parseCSVAtomP _ _ DoubleAtomType = Right . DoubleAtom <$> APT.double
63−parseCSVAtomP _ _ TextAtomType =
63+parseCSVAtomP _ _ TextAtomType = do
64− Right . TextAtom <$> (quotedString <|> takeToEndOfData)
64+ s <- quotedString <|> takeToEndOfData
65+ pure (Right (TextAtom s))
65parseCSVAtomP _ _ DayAtomType = do
66parseCSVAtomP _ _ DayAtomType = do
66 dString <- T.unpack <$> takeToEndOfData
67 dString <- T.unpack <$> takeToEndOfData
67 case readMaybe dString of
68 case readMaybe dString of
@@ -82,50 +83,41 @@ parseCSVAtomP _ _ BoolAtomType = do
82 case readMaybe bString of
83 case readMaybe bString of
83 Nothing -> fail ("invalid BoolAtom string: " ++ bString)
84 Nothing -> fail ("invalid BoolAtom string: " ++ bString)
84 Just b -> pure (Right (BoolAtom b))
85 Just b -> pure (Right (BoolAtom b))
85−parseCSVAtomP _ _ RelationalExprAtomType = do
86+parseCSVAtomP attrName tConsMap (IntervalAtomType iType) = do
86− reString <- T.unpack <$> takeToEndOfData
87+ begin <- (APT.char '[' >> pure False) <|> (APT.char '(' >> pure True)
87− case readMaybe reString of
88+ eBeginv <- parseCSVAtomP attrName tConsMap iType
88− Nothing -> fail ("invalid RelationalExprAtom string: " ++ reString)
89+ case eBeginv of
89− Just b -> pure (Right (RelationalExprAtom b))
90+ Left err -> pure (Left err)
91+ Right beginv -> do
92+ _ <- APT.char ','
93+ eEndv <- parseCSVAtomP attrName tConsMap iType
94+ case eEndv of
95+ Left err -> pure (Left err)
96+ Right endv -> do
97+ end <- (APT.char ']' >> pure False) <|> (APT.char ')' >> pure True)
98+ pure (Right (IntervalAtom beginv endv begin end))
90−parseCSVAtomP attrName tConsMap typ@(ConstructedAtomType _ tvmap)
99+parseCSVAtomP attrName tConsMap typ@(ConstructedAtomType _ tvmap) = do
91− | isIntervalAtomType typ = do
92− begin <- (APT.char '[' >> pure False) <|> (APT.char '(' >> pure True)
93− let iType = intervalSubType typ
94− eBeginv <- parseCSVAtomP attrName tConsMap iType
95− case eBeginv of
96− Left err -> pure (Left err)
97− Right beginv -> do
98− _ <- APT.char ','
99− eEndv <- parseCSVAtomP attrName tConsMap iType
100− case eEndv of
101− Left err -> pure (Left err)
102− Right endv -> do
103− end <- (APT.char ']' >> pure False) <|>
104− (APT.char ')' >> pure True)
105− pure (Right (ConstructedAtom "Interval" typ [beginv, endv,
106− BoolAtom begin, BoolAtom end]))
107− | otherwise = do
108− dConsName <- capitalizedIdentifier
100+ dConsName <- capitalizedIdentifier
109− APT.skipSpace
101+ APT.skipSpace
110 --we need to look up the name right away in order to determine the types of the following arguments
102 --we need to look up the name right away in order to determine the types of the following arguments
111 -- grab the data constructor
103 -- grab the data constructor
112− case findDataConstructor dConsName tConsMap of
104+ case findDataConstructor dConsName tConsMap of
113− Nothing -> pure (Left (NoSuchDataConstructorError dConsName))
105+ Nothing -> pure (Left (NoSuchDataConstructorError dConsName))
114− Just (_, dConsDef) ->
106+ Just (_, dConsDef) ->
115 -- identify the data constructor's expected atom type args
107 -- identify the data constructor's expected atom type args
116− case resolvedAtomTypesForDataConstructorDefArgs tConsMap tvmap dConsDef of
108+ case resolvedAtomTypesForDataConstructorDefArgs tConsMap tvmap dConsDef of
117− Left err -> pure (Left err)
109+ Left err -> pure (Left err)
118− Right argAtomTypes -> do
110+ Right argAtomTypes -> do
119− atomArgs <- mapM (\argTyp -> let parseNextAtom = parseCSVAtomP attrName tConsMap argTyp <* APT.skipSpace in
111+ atomArgs <- mapM (\argTyp -> let parseNextAtom = parseCSVAtomP attrName tConsMap argTyp <* APT.skipSpace in
120− case argTyp of
112+ case argTyp of
121− ConstructedAtomType _ _ ->
113+ ConstructedAtomType _ _ ->
122− parens parseNextAtom <|>
114+ parens parseNextAtom <|>
123− parseNextAtom
115+ parseNextAtom
124− _ -> parseNextAtom
116+ _ -> parseNextAtom
125− ) argAtomTypes
117+ ) argAtomTypes
126− case lefts atomArgs of
118+ case lefts atomArgs of
127− [] -> pure (Right (ConstructedAtom dConsName typ (rights atomArgs)))
119+ [] -> pure (Right (ConstructedAtom dConsName typ (rights atomArgs)))
128− errs -> pure (Left (someErrors errs))
120+ errs -> pure (Left (someErrors errs))
129parseCSVAtomP attrName _ (RelationAtomType _) = pure (Left (RelationValuedAttributesNotSupportedError [attrName]))
121parseCSVAtomP attrName _ (RelationAtomType _) = pure (Left (RelationValuedAttributesNotSupportedError [attrName]))
130parseCSVAtomP _ _ (TypeVariableType x) = pure (Left (TypeConstructorTypeVarMissing x))
122parseCSVAtomP _ _ (TypeVariableType x) = pure (Left (TypeConstructorTypeVarMissing x))
131
123
src/lib/ProjectM36/Relation/Show/CSV.hs+6−6
@@ -1,7 +1,7 @@
1{-# OPTIONS_GHC -fno-warn-orphans #-}
1{-# OPTIONS_GHC -fno-warn-orphans #-}
2module ProjectM36.Relation.Show.CSV where
2module ProjectM36.Relation.Show.CSV where
3import ProjectM36.Base
3import ProjectM36.Base
4−import ProjectM36.Attribute as A
4+import ProjectM36.Attribute
5import Data.Csv
5import Data.Csv
6import ProjectM36.Tuple
6import ProjectM36.Tuple
7import qualified Data.ByteString.Lazy as BS
7import qualified Data.ByteString.Lazy as BS
@@ -17,13 +17,13 @@ relationAsCSV (Relation attrs tupleSet)
17 | relValAttrs /= [] =
17 | relValAttrs /= [] =
18 Left $ RelationValuedAttributesNotSupportedError (map attributeName relValAttrs)
18 Left $ RelationValuedAttributesNotSupportedError (map attributeName relValAttrs)
19 --check that there is at least one attribute
19 --check that there is at least one attribute
20− | A.null attrs =
20+ | V.null attrs =
21 Left $ TupleAttributeCountMismatchError 0
21 Left $ TupleAttributeCountMismatchError 0
22 | otherwise =
22 | otherwise =
23 Right $ encodeByName bsAttrNames $ map RecordRelationTuple (asList tupleSet)
23 Right $ encodeByName bsAttrNames $ map RecordRelationTuple (asList tupleSet)
24 where
24 where
25− relValAttrs = V.toList $ V.filter (isRelationAtomType . atomType) (attributesVec attrs)
25+ relValAttrs = V.toList $ V.filter (isRelationAtomType . atomType) attrs
26− bsAttrNames = V.map (TE.encodeUtf8 . attributeName) (attributesVec attrs)
26+ bsAttrNames = V.map (TE.encodeUtf8 . attributeName) attrs
27
27
28{-
28{-
29instance ToRecord RelationTuple where
29instance ToRecord RelationTuple where
@@ -36,12 +36,12 @@ instance ToNamedRecord RecordRelationTuple where
36 toNamedRecord rTuple = namedRecord $ map (\(k,v) -> TE.encodeUtf8 k .= RecordAtom v) (tupleAssocs $ unTuple rTuple)
36 toNamedRecord rTuple = namedRecord $ map (\(k,v) -> TE.encodeUtf8 k .= RecordAtom v) (tupleAssocs $ unTuple rTuple)
37
37
38instance DefaultOrdered RecordRelationTuple where
38instance DefaultOrdered RecordRelationTuple where
39− headerOrder (RecordRelationTuple tuple) = V.map (TE.encodeUtf8 . attributeName) (attributesVec (tupleAttributes tuple))
39+ headerOrder (RecordRelationTuple tuple) = V.map (TE.encodeUtf8 . attributeName) (tupleAttributes tuple)
40
40
41newtype RecordAtom = RecordAtom {unAtom :: Atom}
41newtype RecordAtom = RecordAtom {unAtom :: Atom}
42
42
43instance ToField RecordAtom where
43instance ToField RecordAtom where
44− toField (RecordAtom (TextAtom atomVal)) = TE.encodeUtf8 atomVal --without this, CSV text atoms are doubly quoted
44+ toField (RecordAtom (TextAtom atomVal)) = TE.encodeUtf8 atomVal --squelch extraneous quotes for text type- the CSV library will add them if necessary
45 toField (RecordAtom atomVal) = (TE.encodeUtf8 . atomToText) atomVal
45 toField (RecordAtom atomVal) = (TE.encodeUtf8 . atomToText) atomVal
46
46
47
47
src/lib/ProjectM36/Relation/Show/HTML.hs+2−5
@@ -3,18 +3,16 @@ import ProjectM36.Base
3import ProjectM36.Relation
3import ProjectM36.Relation
4import ProjectM36.Tuple
4import ProjectM36.Tuple
5import ProjectM36.Atom
5import ProjectM36.Atom
6−import ProjectM36.Attribute as A
7import ProjectM36.AtomType
6import ProjectM36.AtomType
8import qualified Data.List as L
7import qualified Data.List as L
9import Data.Text (Text, pack)
8import Data.Text (Text, pack)
10import qualified Data.Text as T
9import qualified Data.Text as T
11import qualified Data.Text.IO as TIO
10import qualified Data.Text.IO as TIO
12−#if __GLASGOW_HASKELL__ < 804
13import Data.Monoid
11import Data.Monoid
14−#endif
12+import qualified Data.Vector as V
15
13
16attributesAsHTML :: Attributes -> Text
14attributesAsHTML :: Attributes -> Text
17−attributesAsHTML attrs = "<tr>" <> T.concat (map oneAttrHTML (A.toList attrs)) <> "</tr>"
15+attributesAsHTML attrs = "<tr>" <> T.concat (map oneAttrHTML (V.toList attrs)) <> "</tr>"
18 where
16 where
19 oneAttrHTML attr = "<th>" <> prettyAttribute attr <> "</th>"
17 oneAttrHTML attr = "<th>" <> prettyAttribute attr <> "</th>"
20
18
@@ -53,7 +51,6 @@ tupleAsHTML tuple = "<tr>" <> T.concat (L.map tupleFrag (tupleAssocs tuple)) <>
53 where
51 where
54 tupleFrag tup = "<td>" <> atomAsHTML (snd tup) <> "</td>"
52 tupleFrag tup = "<td>" <> atomAsHTML (snd tup) <> "</td>"
55 atomAsHTML (RelationAtom rel) = relationAsHTML rel
53 atomAsHTML (RelationAtom rel) = relationAsHTML rel
56− atomAsHTML (TextAtom t) = "&quot;" <> t <> "&quot;"
57 atomAsHTML atom = atomToText atom
54 atomAsHTML atom = atomToText atom
58
55
59tupleSetAsHTML :: RelationTupleSet -> Text
56tupleSetAsHTML :: RelationTupleSet -> Text
src/lib/ProjectM36/Relation/Show/Term.hs+12−22
@@ -9,12 +9,6 @@ import ProjectM36.Attribute hiding (null)
9import qualified Data.List as L
9import qualified Data.List as L
10import qualified Data.Text as T
10import qualified Data.Text as T
11import Control.Arrow hiding (left)
11import Control.Arrow hiding (left)
12−import Data.ByteString.Base64 as B64
13−import qualified Data.Text.Encoding as TE
14−#if __GLASGOW_HASKELL__ < 804
15−import Data.Monoid
16−#endif
17−import ProjectM36.WCWidth --guess the width that the character will appear as in the terminal
18
12
19boxV :: StringType
13boxV :: StringType
20boxV = "│"
14boxV = "│"
@@ -42,6 +36,16 @@ boxBB = "┴"
42boxC :: StringType
36boxC :: StringType
43boxC = "┼"
37boxC = "┼"
44
38
39+dboxH :: StringType
40+dboxH = "═"
41+dboxL :: StringType
42+dboxL = "╞"
43+dboxR :: StringType
44+dboxR = "╡"
45+
46+class TermSize a where
47+ termLength :: a -> Int
48+
45--represent a relation as a table similar to those drawn by Date
49--represent a relation as a table similar to those drawn by Date
46type Cell = StringType
50type Cell = StringType
47type Table = ([Cell], [[Cell]]) --header, body
51type Table = ([Cell], [[Cell]]) --header, body
@@ -73,7 +77,7 @@ cellSizes (header, body) = map (map maxRowWidth &&& map (length . breakLines)) a
73 0
77 0
74 else
78 else
75 L.maximum (lengths row)
79 L.maximum (lengths row)
76− lengths row = map stringDisplayLength (breakLines row)
80+ lengths row = map T.length (breakLines row)
77 allRows = header : body
81 allRows = header : body
78
82
79relationAsTable :: Relation -> Table
83relationAsTable :: Relation -> Table
@@ -98,8 +102,6 @@ showParens predicate f = if predicate then
98showAtom :: Int -> Atom -> StringType
102showAtom :: Int -> Atom -> StringType
99showAtom _ (RelationAtom rel) = renderTable $ relationAsTable rel
103showAtom _ (RelationAtom rel) = renderTable $ relationAsTable rel
100showAtom level (ConstructedAtom dConsName _ atoms) = showParens (level >= 1 && not (null atoms)) $ T.concat (L.intersperse " " (dConsName : map (showAtom 1) atoms))
104showAtom level (ConstructedAtom dConsName _ atoms) = showParens (level >= 1 && not (null atoms)) $ T.concat (L.intersperse " " (dConsName : map (showAtom 1) atoms))
101−showAtom _ (TextAtom t) = "\"" <> t <> "\""
102−showAtom _ (ByteStringAtom bs) = TE.decodeUtf8 (B64.encode bs)
103showAtom _ atom = atomToText atom
105showAtom _ atom = atomToText atom
104
106
105renderTable :: Table -> StringType
107renderTable :: Table -> StringType
@@ -118,14 +120,13 @@ renderHeader (header, body) columnLocations = renderTopBar `T.append` renderHead
118renderHBar :: StringType -> StringType -> StringType -> [Int] -> StringType
120renderHBar :: StringType -> StringType -> StringType -> [Int] -> StringType
119renderHBar left middle end columnLocations = left `T.append` T.concat (L.intersperse middle (map (`repeatString` boxH) columnLocations)) `T.append` end
121renderHBar left middle end columnLocations = left `T.append` T.concat (L.intersperse middle (map (`repeatString` boxH) columnLocations)) `T.append` end
120
122
121−--pad a block of potentially multi-lined text
122leftPaddedString :: Int -> Int -> StringType -> StringType
123leftPaddedString :: Int -> Int -> StringType -> StringType
123leftPaddedString lineNum size str = if lineNum > length paddedLines -1 then
124leftPaddedString lineNum size str = if lineNum > length paddedLines -1 then
124 repeatString size " "
125 repeatString size " "
125 else
126 else
126 paddedLines !! lineNum
127 paddedLines !! lineNum
127 where
128 where
128− paddedLines = map (\line -> line `T.append` repeatString (size - stringDisplayLength line) " ") (breakLines str)
129+ paddedLines = map (\line -> line `T.append` repeatString (size - T.length line) " ") (breakLines str)
129
130
130renderRow :: [Cell] -> [Int] -> Int -> StringType -> StringType
131renderRow :: [Cell] -> [Int] -> Int -> StringType -> StringType
131renderRow cells columnLocations rowHeight interspersed = T.unlines $ map renderOneLine [0..rowHeight-1]
132renderRow cells columnLocations rowHeight interspersed = T.unlines $ map renderOneLine [0..rowHeight-1]
@@ -146,14 +147,3 @@ repeatString c s = T.concat (replicate c s)
146
147
147showRelation :: Relation -> StringType
148showRelation :: Relation -> StringType
148showRelation rel = renderTable (relationAsTable rel)
149showRelation rel = renderTable (relationAsTable rel)
149−
150−--use wcwidth to guess the string width in the terminal- many CJK characters can take multiple columns in a fixed width font
151−stringDisplayLength :: StringType -> Int
152−stringDisplayLength = T.foldr charSize 0
153− where
154− charSize char accum = let w = wcwidth char in
155− accum + if w < 0 then
156− 1
157− else
158− w
159−
src/lib/ProjectM36/RelationalExpression.hs+618−1079
@@ -1,53 +1,33 @@
1{-# LANGUAGE ScopedTypeVariables #-}
1{-# LANGUAGE ScopedTypeVariables #-}
2−{-# LANGUAGE FlexibleInstances #-}
3−{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE OverloadedStrings #-}
5module ProjectM36.RelationalExpression where
2module ProjectM36.RelationalExpression where
6import ProjectM36.Relation
3import ProjectM36.Relation
7import ProjectM36.Tuple
4import ProjectM36.Tuple
8import ProjectM36.TupleSet
5import ProjectM36.TupleSet
9import ProjectM36.Base
6import ProjectM36.Base
10−import qualified Data.UUID as U
11import ProjectM36.Error
7import ProjectM36.Error
12import ProjectM36.AtomType
8import ProjectM36.AtomType
13−import ProjectM36.Attribute (emptyAttributes, attributesFromList)
9+import ProjectM36.Attribute (emptyAttributes)
14import ProjectM36.ScriptSession
10import ProjectM36.ScriptSession
15import ProjectM36.DataTypes.Primitive
11import ProjectM36.DataTypes.Primitive
16import ProjectM36.AtomFunction
12import ProjectM36.AtomFunction
17import ProjectM36.DatabaseContextFunction
13import ProjectM36.DatabaseContextFunction
18−import ProjectM36.Arbitrary
19−import ProjectM36.GraphRefRelationalExpr
20−import ProjectM36.Transaction
21import qualified ProjectM36.Attribute as A
14import qualified ProjectM36.Attribute as A
22import qualified Data.Map as M
15import qualified Data.Map as M
23import qualified Data.HashSet as HS
16import qualified Data.HashSet as HS
24import qualified Data.Set as S
17import qualified Data.Set as S
25import Control.Monad.State hiding (join)
18import Control.Monad.State hiding (join)
26−import Data.Bifunctor (second)
19+import Control.Exception
27import Data.Maybe
20import Data.Maybe
28import Data.Either
21import Data.Either
29import Data.Char (isUpper)
22import Data.Char (isUpper)
30−import Data.Time
31−import qualified Data.List.NonEmpty as NE
32−import Data.Functor.Identity
33import qualified Data.Text as T
23import qualified Data.Text as T
34import qualified Data.Vector as V
24import qualified Data.Vector as V
35import qualified ProjectM36.TypeConstructorDef as TCD
25import qualified ProjectM36.TypeConstructorDef as TCD
36−import qualified Control.Monad.RWS.Strict as RWS
26+import Control.Monad.Trans.Except
37−import Control.Monad.RWS.Strict (RWST, execRWST, runRWST)
38−import Control.Monad.Except hiding (join)
39−import Control.Monad.Trans.Except (except)
27+import Control.Monad.Trans.Reader
40−import Control.Monad.Reader as R hiding (join)
28+
41−import ProjectM36.NormalizeExpr
42−import ProjectM36.WithNameExpr
43−import Test.QuickCheck
44−import qualified Data.Functor.Foldable as Fold
45−import Control.Applicative
46−#ifdef PM36_HASKELL_SCRIPTING
47−import GHC hiding (getContext)
29+import GHC
48−import Control.Exception
49import GHC.Paths
30import GHC.Paths
50−#endif
51
31
52data DatabaseContextExprDetails = CountUpdatedTuples
32data DatabaseContextExprDetails = CountUpdatedTuples
53
33
@@ -64,63 +44,32 @@ databaseContextExprDetailsFunc CountUpdatedTuples _ relIn = Relation attrs newTu
64 Right ts -> ts
44 Right ts -> ts
65
45
66-- | Used to start a fresh database state for a new database context expression.
46-- | Used to start a fresh database state for a new database context expression.
67−mkDatabaseContextEvalState :: DatabaseContext -> DatabaseContextEvalState
47+freshDatabaseState :: DatabaseContext -> DatabaseStateElems
68−mkDatabaseContextEvalState context = DatabaseContextEvalState {
69− dbc_context = context,
70− dbc_accum = M.empty,
71− dbc_dirty = False
72− } --future work: propagate return accumulator
48+freshDatabaseState ctx = (ctx, M.empty, False) --future work: propagate return accumulator
73
49
74-- we need to pass around a higher level RelationTuple and Attributes in order to solve #52
50-- we need to pass around a higher level RelationTuple and Attributes in order to solve #52
75−data RelationalExprEnv = RelationalExprEnv {
51+data RelationalExprStateElems = RelationalExprStateTupleElems DatabaseContext RelationTuple | -- used when fully evaluating a relexpr
76− re_context :: DatabaseContext,
52+ RelationalExprStateAttrsElems DatabaseContext Attributes | --used when evaluating the type of a relexpr
77− re_graph :: TransactionGraph,
53+ RelationalExprStateElems DatabaseContext --used by default at the top level of evaluation
78− re_extra :: Maybe (Either RelationTuple Attributes)
54+
79− }
55+instance Show RelationalExprStateElems where
80−
56+ show (RelationalExprStateTupleElems _ tup) = "RelationalExprStateTupleElems " ++ show tup
81−envTuple :: GraphRefRelationalExprEnv -> RelationTuple
57+ show (RelationalExprStateAttrsElems _ attrs) = "RelationalExprStateAttrsElems" ++ show attrs
82−envTuple e = fromLeft emptyTuple (fromMaybe (Left emptyTuple) (gre_extra e))
58+ show (RelationalExprStateElems _) = "RelationalExprStateElems"
83−
59+
84−envAttributes :: GraphRefRelationalExprEnv -> Attributes
60+mkRelationalExprState :: DatabaseContext -> RelationalExprStateElems
85−envAttributes e = fromRight emptyAttributes (fromMaybe (Right emptyAttributes) (gre_extra e))
61+mkRelationalExprState = RelationalExprStateElems
62+
63+mergeTuplesIntoRelationalExprState :: RelationTuple -> RelationalExprStateElems -> RelationalExprStateElems
64+mergeTuplesIntoRelationalExprState tupIn (RelationalExprStateElems ctx) = RelationalExprStateTupleElems ctx tupIn
65+mergeTuplesIntoRelationalExprState _ st@(RelationalExprStateAttrsElems _ _) = st
66+mergeTuplesIntoRelationalExprState tupIn (RelationalExprStateTupleElems ctx existingTuple) = let mergedTupMap = M.union (tupleToMap tupIn) (tupleToMap existingTuple) in
67+ RelationalExprStateTupleElems ctx (mkRelationTupleFromMap mergedTupMap)
86
68
87−instance Show RelationalExprEnv where
69+mergeAttributesIntoRelationalExprState :: Attributes -> RelationalExprStateElems -> RelationalExprStateElems
88− show e@RelationalExprEnv{} = "RelationalExprEnv " ++ show (re_extra e)
70+mergeAttributesIntoRelationalExprState attrs (RelationalExprStateElems ctx) = RelationalExprStateAttrsElems ctx attrs
89−
71+mergeAttributesIntoRelationalExprState _ st@(RelationalExprStateTupleElems _ _) = st
90−--used to eval relationalexpr
72+mergeAttributesIntoRelationalExprState attrsIn (RelationalExprStateAttrsElems ctx attrs) = RelationalExprStateAttrsElems ctx (A.union attrsIn attrs)
91−type RelationalExprM a = ReaderT RelationalExprEnv (ExceptT RelationalError Identity) a
92−
93−runRelationalExprM :: RelationalExprEnv -> RelationalExprM a -> Either RelationalError a
94−runRelationalExprM env m = runIdentity (runExceptT (runReaderT m env))
95−
96−reGraph :: RelationalExprM TransactionGraph
97−reGraph = asks re_graph
98−
99−reContext :: RelationalExprM DatabaseContext
100−reContext = asks re_context
101−
102−mkRelationalExprEnv :: DatabaseContext -> TransactionGraph -> RelationalExprEnv
103−mkRelationalExprEnv ctx graph =
104− RelationalExprEnv
105− { re_context = ctx,
106− re_graph = graph,
107− re_extra = Nothing }
108−
109−askEnv :: GraphRefRelationalExprM GraphRefRelationalExprEnv
110−askEnv = R.ask
111−
112−mergeTuplesIntoGraphRefRelationalExprEnv :: RelationTuple -> GraphRefRelationalExprEnv -> GraphRefRelationalExprEnv
113−mergeTuplesIntoGraphRefRelationalExprEnv tupIn env =
114− env { gre_extra = new_elems }
115− where
116− new_elems = Just (Left newTuple)
117− mergedTupMap = M.union (tupleToMap tupIn) (tupleToMap (envTuple env))
118− newTuple = mkRelationTupleFromMap mergedTupMap
119−
120−mergeAttributesIntoGraphRefRelationalExprEnv :: Attributes -> GraphRefRelationalExprEnv -> GraphRefRelationalExprEnv
121−mergeAttributesIntoGraphRefRelationalExprEnv attrsIn e = e { gre_extra = newattrs }
122− where
123− newattrs = Just (Right (A.union attrsIn (envAttributes e)))
124
73
125type ResultAccumName = StringType
74type ResultAccumName = StringType
126
75
@@ -130,403 +79,423 @@ data ResultAccum = ResultAccum { resultAccumFunc :: ResultAccumFunc,
130 resultAccumResult :: Relation
79 resultAccumResult :: Relation
131 }
80 }
132
81
133−data DatabaseContextEvalState = DatabaseContextEvalState {
134− dbc_context :: DatabaseContext, --new, alterable context for a new transaction
135− dbc_accum :: M.Map ResultAccumName ResultAccum,
82+type DatabaseStateElems = (DatabaseContext, M.Map ResultAccumName ResultAccum, DirtyFlag)
136− dbc_dirty :: DirtyFlag
137− }
138
83
139−data DatabaseContextEvalEnv = DatabaseContextEvalEnv
84+type DatabaseState a = State DatabaseStateElems a
140− { dce_transId :: TransactionId,
141− dce_graph :: TransactionGraph
142− }
143
85
144−mkDatabaseContextEvalEnv :: TransactionId -> TransactionGraph -> DatabaseContextEvalEnv
86+getStateContext :: DatabaseState DatabaseContext
145−mkDatabaseContextEvalEnv = DatabaseContextEvalEnv
87+getStateContext = do
146−
88+ (ctx,_, _) <- get
147−type DatabaseContextEvalMonad a = RWST DatabaseContextEvalEnv () DatabaseContextEvalState (ExceptT RelationalError Identity) a
89+ pure ctx
148−
90+
149−runDatabaseContextEvalMonad :: DatabaseContext -> DatabaseContextEvalEnv -> DatabaseContextEvalMonad () -> Either RelationalError DatabaseContextEvalState
91+putStateContext :: DatabaseContext -> DatabaseState ()
150−runDatabaseContextEvalMonad ctx env m = runIdentity (runExceptT (fst <$> execRWST m env freshEnv))
92+putStateContext ctx = do
151− where
93+ (_, accum, _) <- get
152− freshEnv = mkDatabaseContextEvalState ctx
94+ put (ctx, accum, True)
95+
96+type RelationalExprState a = Reader RelationalExprStateElems a
97+
98+stateElemsContext :: RelationalExprStateElems -> DatabaseContext
99+stateElemsContext (RelationalExprStateTupleElems ctx _) = ctx
100+stateElemsContext (RelationalExprStateElems ctx) = ctx
101+stateElemsContext (RelationalExprStateAttrsElems ctx _) = ctx
102+
103+setStateElemsContext :: RelationalExprStateElems -> DatabaseContext -> RelationalExprStateElems
104+setStateElemsContext (RelationalExprStateTupleElems _ tup) ctx = RelationalExprStateTupleElems ctx tup
105+setStateElemsContext (RelationalExprStateElems _) ctx = RelationalExprStateElems ctx
106+setStateElemsContext (RelationalExprStateAttrsElems _ attrs) ctx = RelationalExprStateAttrsElems ctx attrs
107+
108+--relvar state is needed in evaluation of relational expression but only as read-only in order to extract current relvar values
109+evalRelationalExpr :: RelationalExpr -> RelationalExprState (Either RelationalError Relation)
110+evalRelationalExpr (RelationVariable name _) = do
111+ relvarTable <- fmap (relationVariables . stateElemsContext) ask
112+ return $ case M.lookup name relvarTable of
113+ Just res -> Right res
114+ Nothing -> Left $ RelVarNotDefinedError name
115+
116+evalRelationalExpr (Project attrNames expr) = do
117+ eAttrNameSet <- evalAttributeNames attrNames expr
118+ case eAttrNameSet of
119+ Left err -> pure (Left err)
120+ Right attrNameSet -> do
121+ rel <- evalRelationalExpr expr
122+ case rel of
123+ Right rel2 -> pure $ project attrNameSet rel2
124+ Left err -> pure $ Left err
125+
126+evalRelationalExpr (Union exprA exprB) = do
127+ relA <- evalRelationalExpr exprA
128+ relB <- evalRelationalExpr exprB
129+ case relA of
130+ Left err -> return $ Left err
131+ Right relA2 -> case relB of
132+ Left err -> return $ Left err
133+ Right relB2 -> return $ union relA2 relB2
134+
135+evalRelationalExpr (Join exprA exprB) = do
136+ relA <- evalRelationalExpr exprA
137+ relB <- evalRelationalExpr exprB
138+ case relA of
139+ Left err -> return $ Left err
140+ Right relA2 -> case relB of
141+ Left err -> return $ Left err
142+ Right relB2 -> return $ join relA2 relB2
143+
144+evalRelationalExpr (Difference exprA exprB) = do
145+ relA <- evalRelationalExpr exprA
146+ relB <- evalRelationalExpr exprB
147+ case relA of
148+ Left err -> return $ Left err
149+ Right relA2 -> case relB of
150+ Left err -> return $ Left err
151+ Right relB2 -> return $ difference relA2 relB2
152+
153+evalRelationalExpr (MakeStaticRelation attributeSet tupleSet) =
154+ case mkRelation attributeSet tupleSet of
155+ Right rel -> return $ Right rel
156+ Left err -> return $ Left err
153
157
154−
158+evalRelationalExpr (MakeRelationFromExprs mAttrExprs tupleExprs) = do
155−dbcTransId :: DatabaseContextEvalMonad TransactionId
159+ currentContext <- fmap stateElemsContext ask
156−dbcTransId = dce_transId <$> RWS.ask
160+ let tConss = typeConstructorMapping currentContext
157−
161+ -- if the mAttrExprs is Nothing, then we should attempt to infer the tuple attributes from the first tuple itself- note that this is not always possible
158−dbcGraph :: DatabaseContextEvalMonad TransactionGraph
162+ runExceptT $ do
159−dbcGraph = dce_graph <$> RWS.ask
163+ mAttrs <- case mAttrExprs of
160−
164+ Just _ -> do
161−dbcRelationalExprEnv :: DatabaseContextEvalMonad RelationalExprEnv
165+ attrs <- mapM (either throwE pure . evalAttrExpr tConss) (fromMaybe [] mAttrExprs)
162−dbcRelationalExprEnv =
166+ pure (Just (A.attributesFromList attrs))
163− mkRelationalExprEnv <$> getStateContext <*> dbcGraph
167+ Nothing -> pure Nothing
164−
168+ tuples <- mapM (liftE . evalTupleExpr mAttrs) tupleExprs
165−getStateContext :: DatabaseContextEvalMonad DatabaseContext
169+ let attrs = fromMaybe firstTupleAttrs mAttrs
166−getStateContext = gets dbc_context
170+ firstTupleAttrs = if null tuples then A.emptyAttributes else tupleAttributes (head tuples)
167−
171+ either throwE pure (mkRelation attrs (RelationTupleSet tuples))
168−putStateContext :: DatabaseContext -> DatabaseContextEvalMonad ()
169−putStateContext ctx' = do
170− s <- get
171− put (s {dbc_context = ctx', dbc_dirty = True})
172−
173−-- | The context is optionally passed down along in cases where the current context is uncommitted.
174−data GraphRefRelationalExprEnv =
175− GraphRefRelationalExprEnv {
176− gre_context :: Maybe DatabaseContext,
177− gre_graph :: TransactionGraph,
178− gre_extra :: Maybe (Either RelationTuple Attributes)
179− }
180
172
181−type GraphRefRelationalExprM a = ReaderT GraphRefRelationalExprEnv (ExceptT RelationalError Identity) a
173+evalRelationalExpr (ExistingRelation rel) = pure (Right rel)
182−
183−gfTransForId :: TransactionId -> GraphRefRelationalExprM Transaction
184−gfTransForId tid = do
185− graph <- gfGraph
186− lift $ except $ transactionForId tid graph
187−
188−gfDatabaseContextForMarker :: GraphRefTransactionMarker -> GraphRefRelationalExprM DatabaseContext
189−gfDatabaseContextForMarker (TransactionMarker transId) = concreteDatabaseContext <$> gfTransForId transId
190−gfDatabaseContextForMarker UncommittedContextMarker = do
191− mctx <- gre_context <$> askEnv
192− case mctx of
193− Nothing -> throwError NoUncommittedContextInEvalError
194− Just ctx -> pure ctx
195−
196−runGraphRefRelationalExprM :: GraphRefRelationalExprEnv -> GraphRefRelationalExprM a -> Either RelationalError a
197−runGraphRefRelationalExprM env m = runIdentity (runExceptT (runReaderT m env))
198−
199−freshGraphRefRelationalExprEnv :: Maybe DatabaseContext -> TransactionGraph -> GraphRefRelationalExprEnv
200−freshGraphRefRelationalExprEnv mctx graph = GraphRefRelationalExprEnv {
201− gre_context = mctx,
202− gre_graph = graph,
203− gre_extra = Nothing
204− }
205
174
206−gfGraph :: GraphRefRelationalExprM TransactionGraph
175+evalRelationalExpr (Rename oldAttrName newAttrName relExpr) = do
207−gfGraph = asks gre_graph
176+ evald <- evalRelationalExpr relExpr
177+ case evald of
178+ Right rel -> return $ rename oldAttrName newAttrName rel
179+ Left err -> return $ Left err
208
180
209−envContext :: RelationalExprEnv -> DatabaseContext
181+evalRelationalExpr (Group oldAttrNames newAttrName relExpr) = do
210−envContext = re_context
182+ eOldAttrNameSet <- evalAttributeNames oldAttrNames relExpr
211−
183+ case eOldAttrNameSet of
212−setEnvContext :: RelationalExprEnv -> DatabaseContext -> RelationalExprEnv
184+ Left err -> pure (Left err)
213−setEnvContext e ctx = e { re_context = ctx }
185+ Right oldAttrNameSet -> do
186+ evald <- evalRelationalExpr relExpr
187+ case evald of
188+ Right rel -> return $ group oldAttrNameSet newAttrName rel
189+ Left err -> return $ Left err
190+
191+evalRelationalExpr (Ungroup attrName relExpr) = do
192+ evald <- evalRelationalExpr relExpr
193+ case evald of
194+ Right rel -> return $ ungroup attrName rel
195+ Left err -> return $ Left err
196+
197+evalRelationalExpr (Restrict predicateExpr relExpr) = do
198+ evald <- evalRelationalExpr relExpr
199+ case evald of
200+ Left err -> return $ Left err
201+ Right rel -> do
202+ eFilterFunc <- predicateRestrictionFilter (attributes rel) predicateExpr
203+ case eFilterFunc of
204+ Left err -> return $ Left err
205+ Right filterfunc ->
206+ pure (restrict filterfunc rel)
207+
208+evalRelationalExpr (Equals relExprA relExprB) = do
209+ evaldA <- evalRelationalExpr relExprA
210+ evaldB <- evalRelationalExpr relExprB
211+ case evaldA of
212+ Left err -> return $ Left err
213+ Right relA -> case evaldB of
214+ Left err -> return $ Left err
215+ Right relB -> return $ Right $ if relA == relB then relationTrue else relationFalse
216+
217+--warning: copy-pasta from above- refactor
218+evalRelationalExpr (NotEquals relExprA relExprB) = do
219+ evaldA <- evalRelationalExpr relExprA
220+ evaldB <- evalRelationalExpr relExprB
221+ case evaldA of
222+ Left err -> return $ Left err
223+ Right relA -> case evaldB of
224+ Left err -> return $ Left err
225+ Right relB -> return $ Right $ if relA /= relB then relationTrue else relationFalse
226+
227+-- extending a relation adds a single attribute with the results of the per-tuple expression evaluated
228+evalRelationalExpr (Extend tupleExpression relExpr) = do
229+ rstate <- ask
230+ let evald = runReader (evalRelationalExpr relExpr) rstate
231+ case evald of
232+ Left err -> pure (Left err)
233+ Right rel -> do
234+ tupProc <- extendTupleExpressionProcessor rel tupleExpression
235+ case tupProc of
236+ Left err -> pure (Left err)
237+ Right (newAttrs, tupProc') -> pure $ relMogrify tupProc' newAttrs rel
214
238
215--helper function to process relation variable creation/assignment
239--helper function to process relation variable creation/assignment
216−setRelVar :: RelVarName -> GraphRefRelationalExpr -> DatabaseContextEvalMonad ()
240+setRelVar :: RelVarName -> Relation -> DatabaseState (Either RelationalError ())
217−setRelVar relVarName relExpr = do
241+setRelVar relVarName rel = do
218 currentContext <- getStateContext
242 currentContext <- getStateContext
219− --prevent recursive relvar definition by resolving references to relvars in previous states
220− relExpr' <- resolve relExpr
221− let newRelVars = M.insert relVarName relExpr' $ relationVariables currentContext
243+ let newRelVars = M.insert relVarName rel $ relationVariables currentContext
222 potentialContext = currentContext { relationVariables = newRelVars }
244 potentialContext = currentContext { relationVariables = newRelVars }
223− --optimization: if the relexpr is unchanged, skip the update
245+
224− if M.lookup relVarName (relationVariables currentContext) == Just relExpr then
225− pure ()
226− else do
227− --determine when to check constraints
228− graph <- dbcGraph
229− tid <- dbcTransId
230− case checkConstraints potentialContext tid graph of
246+ case checkConstraints potentialContext of
231− Left err -> dbErr err
247+ Just err -> pure (Left err)
232− Right _ -> putStateContext potentialContext
248+ Nothing -> do
233−
249+ putStateContext potentialContext
234−--fast-path insertion- we already know that the previous relvar validated correctly, so we can validate just the relation that is being inserted for attribute matches- without this, even a single tuple relation inserted causes the entire relation to be re-validated unnecessarily
250+ return (Right ())
235−--insertIntoRelVar :: RelVarName -> GraphRefRelationalExpr -> DatabaseContextEvalMonad ()
236
251
237-- it is not an error to delete a relvar which does not exist, just like it is not an error to insert a pre-existing tuple into a relation
252-- it is not an error to delete a relvar which does not exist, just like it is not an error to insert a pre-existing tuple into a relation
238−deleteRelVar :: RelVarName -> DatabaseContextEvalMonad ()
253+deleteRelVar :: RelVarName -> DatabaseState (Either RelationalError ())
239deleteRelVar relVarName = do
254deleteRelVar relVarName = do
240 currContext <- getStateContext
255 currContext <- getStateContext
241 let relVars = relationVariables currContext
256 let relVars = relationVariables currContext
242 if M.notMember relVarName relVars then
257 if M.notMember relVarName relVars then
243− pure ()
258+ pure (Right ())
244 else do
259 else do
245 let newRelVars = M.delete relVarName relVars
260 let newRelVars = M.delete relVarName relVars
246 newContext = currContext { relationVariables = newRelVars }
261 newContext = currContext { relationVariables = newRelVars }
247 putStateContext newContext
262 putStateContext newContext
248− pure ()
263+ pure (Right ())
249
264
250−evalGraphRefDatabaseContextExpr :: GraphRefDatabaseContextExpr -> DatabaseContextEvalMonad ()
265+evalDatabaseContextExpr :: DatabaseContextExpr -> DatabaseState (Either RelationalError ())
251−evalGraphRefDatabaseContextExpr NoOperation = pure ()
266+evalDatabaseContextExpr NoOperation = pure (Right ())
252
267
253−evalGraphRefDatabaseContextExpr (Define relVarName attrExprs) = do
268+evalDatabaseContextExpr (Define relVarName attrExprs) = do
254− context <- getStateContext
255 relvars <- fmap relationVariables getStateContext
269 relvars <- fmap relationVariables getStateContext
256 tConss <- fmap typeConstructorMapping getStateContext
270 tConss <- fmap typeConstructorMapping getStateContext
257− graph <- dbcGraph
271+ let eAttrs = map (evalAttrExpr tConss) attrExprs
258− let eAttrs = runGraphRefRelationalExprM gfEnv (mapM evalGraphRefAttrExpr attrExprs)
259− gfEnv = freshGraphRefRelationalExprEnv (Just context) graph
260− case eAttrs of
272+ case lefts eAttrs of
261− Left err -> dbErr err
273+ err:_ -> pure (Left err)
262− Right attrsList -> do
263− lift $ except $ validateAttributes tConss (A.attributesFromList attrsList)
264− case M.member relVarName relvars of
274+ [] -> case M.member relVarName relvars of
265− True -> dbErr (RelVarAlreadyDefinedError relVarName)
275+ True -> pure (Left (RelVarAlreadyDefinedError relVarName))
266− False -> setRelVar relVarName (ExistingRelation emptyRelation)
276+ False -> setRelVar relVarName emptyRelation >> pure (Right ())
267− where
277+ where
268− attrs = A.attributesFromList attrsList
278+ attrs = A.attributesFromList (rights eAttrs)
269− emptyRelation = Relation attrs emptyTupleSet
279+ emptyRelation = Relation attrs emptyTupleSet
270−
280+
271−evalGraphRefDatabaseContextExpr (Undefine relVarName) = deleteRelVar relVarName
281+evalDatabaseContextExpr (Undefine relVarName) = deleteRelVar relVarName
272−
282+
273−evalGraphRefDatabaseContextExpr (Assign relVarName expr) = do
283+evalDatabaseContextExpr (Assign relVarName expr) = do
274− graph <- re_graph <$> dbcRelationalExprEnv
284+ -- in the future, it would be nice to get types from the RelationalExpr instead of needing to evaluate it
275 context <- getStateContext
285 context <- getStateContext
276− let existingRelVar = M.lookup relVarName (relationVariables context)
286+ let existingRelVar = M.lookup relVarName relVarTable
277− reEnv = freshGraphRefRelationalExprEnv (Just context) graph
287+ relVarTable = relationVariables context
278− eNewExprType = runGraphRefRelationalExprM reEnv (typeForGraphRefRelationalExpr expr)
288+ value = runReader (evalRelationalExpr expr) (RelationalExprStateElems context)
289+ case value of
290+ Left err -> pure (Left err)
279− case existingRelVar of
291+ Right rel -> case existingRelVar of
280− Nothing -> do
281− case runGraphRefRelationalExprM reEnv (typeForGraphRefRelationalExpr expr) of
282− Left err -> dbErr err
283− Right reltype -> do
284− lift $ except $ validateAttributes (typeConstructorMapping context) (attributes reltype)
285− setRelVar relVarName expr
292+ Nothing -> setRelVar relVarName rel
286− Just existingRel -> do
293+ Just existingRel -> let expectedAttributes = attributes existingRel
287− let eExpectedType = runGraphRefRelationalExprM reEnv (typeForGraphRefRelationalExpr existingRel)
294+ foundAttributes = attributes rel in
288− case eExpectedType of
295+ if A.attributesEqual expectedAttributes foundAttributes then
289− Left err -> dbErr err
290− Right expectedType ->
291− case eNewExprType of
292− Left err -> dbErr err
293− Right newExprType -> do
294− if newExprType == expectedType then do
295− lift $ except $ validateAttributes (typeConstructorMapping context) (attributes newExprType)
296− setRelVar relVarName expr
296+ setRelVar relVarName rel
297− else
297+ else
298− dbErr (RelationTypeMismatchError (attributes expectedType) (attributes newExprType))
298+ pure (Left (RelVarAssignmentTypeMismatchError expectedAttributes foundAttributes))
299−
299+
300−evalGraphRefDatabaseContextExpr (Insert relVarName relExpr) = do
300+evalDatabaseContextExpr (Insert relVarName relExpr) = do
301− gfExpr <- relVarByName relVarName
301+ context <- getStateContext
302− let optExpr = applyUnionCollapse (Union
302+ let unionexp = Union relExpr rv
303− relExpr
303+ rv = RelationVariable relVarName ()
304− gfExpr)
304+ unioned = runReader (evalRelationalExpr unionexp) (RelationalExprStateElems context)
305− evalGraphRefDatabaseContextExpr (Assign relVarName optExpr)
305+ origRel = runReader (evalRelationalExpr rv) (RelationalExprStateElems context)
306+ case unioned of
307+ Left err -> pure (Left err)
308+ Right unioned' -> case origRel of
309+ Left err -> pure (Left err)
310+ Right origRel' -> if cardinality unioned' == cardinality origRel' then --no tuples actually inserted
311+ pure (Right ())
312+ else
313+ evalDatabaseContextExpr $ Assign relVarName (ExistingRelation unioned')
314+
315+evalDatabaseContextExpr (Delete relVarName predicate) = do
316+ context <- getStateContext
317+ let rv = RelationVariable relVarName ()
318+ let updatedRel = runReader (evalRelationalExpr (Restrict (NotPredicate predicate) rv)) (RelationalExprStateElems context)
319+ origRel = runReader (evalRelationalExpr rv) (RelationalExprStateElems context)
320+ case updatedRel of
321+ Left err -> pure (Left err)
322+ Right updatedRel' -> case origRel of
323+ Left err -> pure (Left err)
324+ Right origRel' -> if cardinality origRel' == cardinality updatedRel' then
325+ pure (Right ())
326+ else
327+ setRelVar relVarName updatedRel'
306
328
307−evalGraphRefDatabaseContextExpr (Delete relVarName predicate) = do
308− gfExpr <- relVarByName relVarName
309− let optExpr = applyRestrictionCollapse (Restrict (NotPredicate predicate) gfExpr)
310− setRelVar relVarName optExpr
311−
312--union of restricted+updated portion and the unrestricted+unupdated portion
329--union of restricted+updated portion and the unrestricted+unupdated portion
313−evalGraphRefDatabaseContextExpr (Update relVarName atomExprMap pred') = do
330+evalDatabaseContextExpr (Update relVarName atomExprMap restrictionPredicateExpr) = do
314− rvExpr <- relVarByName relVarName
315− graph <- re_graph <$> dbcRelationalExprEnv
316 context <- getStateContext
331 context <- getStateContext
317− let reEnv = freshGraphRefRelationalExprEnv (Just context) graph
332+ let relVarTable = relationVariables context
318− --get the current attributes name in the relvar to ensure that we don't conflict when renaming
333+ case M.lookup relVarName relVarTable of
319− eExprType = runGraphRefRelationalExprM reEnv (typeForGraphRefRelationalExpr rvExpr)
334+ Nothing -> pure (Left (RelVarNotDefinedError relVarName))
320− exprType' <- case eExprType of
335+ Just rel ->
321− Left err -> throwError err
336+ case runReader (predicateRestrictionFilter (attributes rel) restrictionPredicateExpr) (RelationalExprStateElems context) of
322− Right t -> pure t
337+ Left err -> pure (Left err)
323− let unrestrictedPortion = Restrict (NotPredicate pred') rvExpr
338+ Right predicateFunc -> do
324− tmpAttr = tmpAttrC 1
339+ let ret = do
325− tmpAttrC :: Int -> AttributeName -> AttributeName
340+ restrictedPortion <- restrict predicateFunc rel
326− tmpAttrC c attr =
341+ if cardinality restrictedPortion == Finite 0 then
327− let tmpAttrName = "_tmp_" <> T.pack (show c) <> attr in
342+ pure Nothing
328− if tmpAttrName `S.member` A.attributeNameSet (attributes exprType') then
329− tmpAttrC (c+1) attr
330− else
343+ else do
331− tmpAttrName
344+ unrestrictedPortion <- restrict (predicateFunc >=> (pure . not)) rel
332− updateAttr nam atomExpr = Extend (AttributeExtendTupleExpr (tmpAttr nam) atomExpr)
345+ updatedPortion <- relMap (updateTupleWithAtomExprs atomExprMap context) restrictedPortion
333− projectAndRename attr expr = Rename (tmpAttr attr) attr (Project (InvertedAttributeNames (S.singleton attr)) expr)
346+ updatedRel <- updatedPortion `union` unrestrictedPortion
334− restrictedPortion = Restrict pred' rvExpr
347+ pure (Just updatedRel)
335− updated = foldr (\(oldname, atomExpr) accum ->
348+ case ret of
336− let procAtomExpr = runProcessExprM UncommittedContextMarker (processAtomExpr atomExpr) in
349+ Left err -> pure (Left err)
337− updateAttr oldname procAtomExpr accum
350+ Right Nothing -> pure (Right ())
338− ) restrictedPortion (M.toList atomExprMap)
351+ Right (Just updatedRel) -> setRelVar relVarName updatedRel
339− -- the atomExprMap could reference other attributes, so we must perform multi-pass folds
340− updatedPortion = foldr projectAndRename updated (M.keys atomExprMap)
341− setRelVar relVarName (Union unrestrictedPortion updatedPortion)
342
352
343−evalGraphRefDatabaseContextExpr (AddInclusionDependency newDepName newDep) = do
353+evalDatabaseContextExpr (AddInclusionDependency newDepName newDep) = do
344 currContext <- getStateContext
354 currContext <- getStateContext
345− transId <- dbcTransId
346− graph <- dbcGraph
347 let currDeps = inclusionDependencies currContext
355 let currDeps = inclusionDependencies currContext
348 newDeps = M.insert newDepName newDep currDeps
356 newDeps = M.insert newDepName newDep currDeps
349 if M.member newDepName currDeps then
357 if M.member newDepName currDeps then
350− dbErr (InclusionDependencyNameInUseError newDepName)
358+ pure (Left (InclusionDependencyNameInUseError newDepName))
351 else do
359 else do
352 let potentialContext = currContext { inclusionDependencies = newDeps }
360 let potentialContext = currContext { inclusionDependencies = newDeps }
353− -- if the potential context passes all constraints, then save it
354− -- potential optimization: validate only the new constraint- all old constraints must already hold
355− case checkConstraints potentialContext transId graph of
361+ case checkConstraints potentialContext of
356− Left err -> dbErr err
362+ Just err -> pure (Left err)
357− Right _ ->
363+ Nothing -> do
358 putStateContext potentialContext
364 putStateContext potentialContext
365+ return (Right ())
359
366
360−evalGraphRefDatabaseContextExpr (RemoveInclusionDependency depName) = do
367+evalDatabaseContextExpr (RemoveInclusionDependency depName) = do
361 currContext <- getStateContext
368 currContext <- getStateContext
362 let currDeps = inclusionDependencies currContext
369 let currDeps = inclusionDependencies currContext
363 newDeps = M.delete depName currDeps
370 newDeps = M.delete depName currDeps
364 if M.notMember depName currDeps then
371 if M.notMember depName currDeps then
365− dbErr (InclusionDependencyNameNotInUseError depName)
372+ pure (Left (InclusionDependencyNameNotInUseError depName))
366− else
373+ else do
367 putStateContext $ currContext {inclusionDependencies = newDeps }
374 putStateContext $ currContext {inclusionDependencies = newDeps }
375+ return (Right ())
368
376
369-- | Add a notification which will send the resultExpr when triggerExpr changes between commits.
377-- | Add a notification which will send the resultExpr when triggerExpr changes between commits.
370−evalGraphRefDatabaseContextExpr (AddNotification notName triggerExpr resultOldExpr resultNewExpr) = do
378+evalDatabaseContextExpr (AddNotification notName triggerExpr resultOldExpr resultNewExpr) = do
371 currentContext <- getStateContext
379 currentContext <- getStateContext
372 let nots = notifications currentContext
380 let nots = notifications currentContext
373 if M.member notName nots then
381 if M.member notName nots then
374− dbErr (NotificationNameInUseError notName)
382+ pure (Left (NotificationNameInUseError notName))
375 else do
383 else do
376 let newNotifications = M.insert notName newNotification nots
384 let newNotifications = M.insert notName newNotification nots
377 newNotification = Notification { changeExpr = triggerExpr,
385 newNotification = Notification { changeExpr = triggerExpr,
378 reportOldExpr = resultOldExpr,
386 reportOldExpr = resultOldExpr,
379 reportNewExpr = resultNewExpr}
387 reportNewExpr = resultNewExpr}
380 putStateContext $ currentContext { notifications = newNotifications }
388 putStateContext $ currentContext { notifications = newNotifications }
389+ return (Right ())
381
390
382−evalGraphRefDatabaseContextExpr (RemoveNotification notName) = do
391+evalDatabaseContextExpr (RemoveNotification notName) = do
383 currentContext <- getStateContext
392 currentContext <- getStateContext
384 let nots = notifications currentContext
393 let nots = notifications currentContext
385 if M.notMember notName nots then
394 if M.notMember notName nots then
386− dbErr (NotificationNameNotInUseError notName)
395+ pure (Left (NotificationNameNotInUseError notName))
387 else do
396 else do
388 let newNotifications = M.delete notName nots
397 let newNotifications = M.delete notName nots
389 putStateContext $ currentContext { notifications = newNotifications }
398 putStateContext $ currentContext { notifications = newNotifications }
390−
399+ pure (Right ())
391
400
392-- | Adds type and data constructors to the database context.
401-- | Adds type and data constructors to the database context.
393-- validate that the type *and* constructor names are unique! not yet implemented!
402-- validate that the type *and* constructor names are unique! not yet implemented!
394−evalGraphRefDatabaseContextExpr (AddTypeConstructor tConsDef dConsDefList) = do
403+evalDatabaseContextExpr (AddTypeConstructor tConsDef dConsDefList) = do
395 currentContext <- getStateContext
404 currentContext <- getStateContext
396 let oldTypes = typeConstructorMapping currentContext
405 let oldTypes = typeConstructorMapping currentContext
397 tConsName = TCD.name tConsDef
406 tConsName = TCD.name tConsDef
398 -- validate that the constructor's types exist
407 -- validate that the constructor's types exist
399− case validateTypeConstructorDef tConsDef dConsDefList oldTypes of
408+ case validateTypeConstructorDef tConsDef dConsDefList of
400− Left err -> throwError err
409+ errs@(_:_) -> pure (Left (someErrors errs))
401− Right () | T.null tConsName || not (isUpper (T.head tConsName)) -> dbErr (InvalidAtomTypeName tConsName)
410+ [] | T.null tConsName || not (isUpper (T.head tConsName)) -> pure (Left (InvalidAtomTypeName tConsName))
402− | isJust (findTypeConstructor tConsName oldTypes) -> dbErr (AtomTypeNameInUseError tConsName)
411+ | isJust (findTypeConstructor tConsName oldTypes) -> pure (Left (AtomTypeNameInUseError tConsName))
403 | otherwise -> do
412 | otherwise -> do
404 let newTypes = oldTypes ++ [(tConsDef, dConsDefList)]
413 let newTypes = oldTypes ++ [(tConsDef, dConsDefList)]
405 putStateContext $ currentContext { typeConstructorMapping = newTypes }
414 putStateContext $ currentContext { typeConstructorMapping = newTypes }
415+ pure (Right ())
406
416
407-- | Removing the atom constructor prevents new atoms of the type from being created. Existing atoms of the type remain. Thus, the atomTypes list in the DatabaseContext need not be all-inclusive.
417-- | Removing the atom constructor prevents new atoms of the type from being created. Existing atoms of the type remain. Thus, the atomTypes list in the DatabaseContext need not be all-inclusive.
408−evalGraphRefDatabaseContextExpr (RemoveTypeConstructor tConsName) = do
418+evalDatabaseContextExpr (RemoveTypeConstructor tConsName) = do
409 currentContext <- getStateContext
419 currentContext <- getStateContext
410 let oldTypes = typeConstructorMapping currentContext
420 let oldTypes = typeConstructorMapping currentContext
411 if isNothing (findTypeConstructor tConsName oldTypes) then
421 if isNothing (findTypeConstructor tConsName oldTypes) then
412− dbErr (AtomTypeNameNotInUseError tConsName)
422+ pure (Left (AtomTypeNameNotInUseError tConsName))
413 else do
423 else do
414 let newTypes = filter (\(tCons, _) -> TCD.name tCons /= tConsName) oldTypes
424 let newTypes = filter (\(tCons, _) -> TCD.name tCons /= tConsName) oldTypes
415 putStateContext $ currentContext { typeConstructorMapping = newTypes }
425 putStateContext $ currentContext { typeConstructorMapping = newTypes }
426+ pure (Right ())
416
427
417−evalGraphRefDatabaseContextExpr (MultipleExpr exprs) =
428+evalDatabaseContextExpr (MultipleExpr exprs) = do
418 --the multiple expressions must pass the same context around- not the old unmodified context
429 --the multiple expressions must pass the same context around- not the old unmodified context
419− mapM_ evalGraphRefDatabaseContextExpr exprs
430+ evald <- forM exprs evalDatabaseContextExpr
420−
431+ --some lifting magic needed here
432+ case lefts evald of
433+ [] -> pure (Right ())
434+ errs -> pure (Left (someErrors errs))
435+
421−evalGraphRefDatabaseContextExpr (RemoveAtomFunction funcName) = do
436+evalDatabaseContextExpr (RemoveAtomFunction funcName) = do
422 currentContext <- getStateContext
437 currentContext <- getStateContext
423 let atomFuncs = atomFunctions currentContext
438 let atomFuncs = atomFunctions currentContext
424 case atomFunctionForName funcName atomFuncs of
439 case atomFunctionForName funcName atomFuncs of
425− Left err -> dbErr err
440+ Left err -> pure (Left err)
426− Right realFunc ->
427− if isScriptedAtomFunction realFunc then do
441+ Right realFunc -> if isScriptedAtomFunction realFunc then do
428− let updatedFuncs = HS.delete realFunc atomFuncs
442+ let updatedFuncs = HS.delete realFunc atomFuncs
429− putStateContext (currentContext {atomFunctions = updatedFuncs })
443+ putStateContext (currentContext {atomFunctions = updatedFuncs })
444+ pure (Right ())
430− else
445+ else
431− dbErr (PrecompiledFunctionRemoveError funcName)
446+ pure (Left (PrecompiledFunctionRemoveError funcName))
432
447
433−evalGraphRefDatabaseContextExpr (RemoveDatabaseContextFunction funcName) = do
448+evalDatabaseContextExpr (RemoveDatabaseContextFunction funcName) = do
434 context <- getStateContext
449 context <- getStateContext
435 let dbcFuncs = dbcFunctions context
450 let dbcFuncs = dbcFunctions context
436 case databaseContextFunctionForName funcName dbcFuncs of
451 case databaseContextFunctionForName funcName dbcFuncs of
437− Left err -> dbErr err
452+ Left err -> pure (Left err)
438− Right realFunc ->
439− if isScriptedDatabaseContextFunction realFunc then do
453+ Right realFunc -> if isScriptedDatabaseContextFunction realFunc then do
440− let updatedFuncs = HS.delete realFunc dbcFuncs
454+ let updatedFuncs = HS.delete realFunc dbcFuncs
441− putStateContext (context { dbcFunctions = updatedFuncs })
455+ putStateContext (context { dbcFunctions = updatedFuncs })
456+ pure (Right ())
442− else
457+ else
443− dbErr (PrecompiledFunctionRemoveError funcName)
458+ pure (Left (PrecompiledFunctionRemoveError funcName))
444
459
445−evalGraphRefDatabaseContextExpr (ExecuteDatabaseContextFunction funcName atomArgExprs) = do
460+evalDatabaseContextExpr (ExecuteDatabaseContextFunction funcName atomArgExprs) = do
446 context <- getStateContext
461 context <- getStateContext
447− graph <- dbcGraph
448 --resolve atom arguments
462 --resolve atom arguments
449− let eAtomTypes = mapM (runGraphRefRelationalExprM gfEnv . typeForGraphRefAtomExpr emptyAttributes) atomArgExprs
463+ let relExprState = mkRelationalExprState context
464+ eAtomTypes = map (\atomExpr -> runReader (typeFromAtomExpr emptyAttributes atomExpr) relExprState) atomArgExprs
450 eFunc = databaseContextFunctionForName funcName (dbcFunctions context)
465 eFunc = databaseContextFunctionForName funcName (dbcFunctions context)
451− gfEnv = freshGraphRefRelationalExprEnv (Just context) graph
452 case eFunc of
466 case eFunc of
453− Left err -> dbErr err
467+ Left err -> pure (Left err)
454 Right func -> do
468 Right func -> do
455 let expectedArgCount = length (dbcFuncType func)
469 let expectedArgCount = length (dbcFuncType func)
456 actualArgCount = length atomArgExprs
470 actualArgCount = length atomArgExprs
457 if expectedArgCount /= actualArgCount then
471 if expectedArgCount /= actualArgCount then
458− dbErr (FunctionArgumentCountMismatchError expectedArgCount actualArgCount)
472+ pure (Left (FunctionArgumentCountMismatchError expectedArgCount actualArgCount))
459 else
473 else
460 --check that the atom types are valid
474 --check that the atom types are valid
461− case eAtomTypes of
475+ case lefts eAtomTypes of
462− Left err -> dbErr err
476+ _:_ -> pure (Left (someErrors (lefts eAtomTypes)))
463− Right atomTypes -> do
477+ [] -> do
464− let mValidTypes = zipWith (\ expType actType
478+ let atomTypes = rights eAtomTypes
465− -> case atomTypeVerify expType actType of
479+ let mValidTypes = map (\(expType, actType) -> case atomTypeVerify expType actType of
466− Left err -> Just err
480+ Left err -> Just err
467− Right _ -> Nothing)
468− (dbcFuncType func) atomTypes
481+ Right _ -> Nothing) (zip (dbcFuncType func) atomTypes)
469− typeErrors = catMaybes mValidTypes
482+ typeErrors = catMaybes mValidTypes
470− eAtomArgs = map (runGraphRefRelationalExprM gfEnv . evalGraphRefAtomExpr emptyTuple) atomArgExprs
483+ eAtomArgs = map (\arg -> runReader (evalAtomExpr emptyTuple arg) relExprState) atomArgExprs
471 if length (lefts eAtomArgs) > 1 then
484 if length (lefts eAtomArgs) > 1 then
472− dbErr (someErrors (lefts eAtomArgs))
485+ pure (Left (someErrors (lefts eAtomArgs)))
473 else if not (null typeErrors) then
486 else if not (null typeErrors) then
474− dbErr (someErrors typeErrors)
487+ pure (Left (someErrors typeErrors))
475 else
488 else
476 case evalDatabaseContextFunction func (rights eAtomArgs) context of
489 case evalDatabaseContextFunction func (rights eAtomArgs) context of
477− Left err -> dbErr err
490+ Left err -> pure (Left err)
478− Right newContext -> putStateContext newContext
491+ Right newContext -> putStateContext newContext >> pure (Right ())
479−data DatabaseContextIOEvalEnv = DatabaseContextIOEvalEnv
492+
480− { dbcio_transId :: TransactionId,
493+evalDatabaseContextIOExpr :: Maybe ScriptSession -> DatabaseContext -> DatabaseContextIOExpr -> IO (Either RelationalError DatabaseContext)
481− dbcio_graph :: TransactionGraph,
482− dbcio_mScriptSession :: Maybe ScriptSession
483− }
484−
485−type DatabaseContextIOEvalMonad a = RWST DatabaseContextIOEvalEnv () DatabaseContextEvalState IO a
486−
487−runDatabaseContextIOEvalMonad :: DatabaseContextIOEvalEnv -> DatabaseContext -> DatabaseContextIOEvalMonad (Either RelationalError ()) -> IO (Either RelationalError DatabaseContextEvalState)
488−runDatabaseContextIOEvalMonad env ctx m = do
489− res <- runRWST m env freshState
490− case res of
491− (Left err,_,_) -> pure (Left err)
492− (Right (),s,_) -> pure (Right s)
493− where
494− freshState = mkDatabaseContextEvalState ctx
495−
496−requireScriptSession :: DatabaseContextIOEvalMonad (Either RelationalError ScriptSession)
497−requireScriptSession = do
498− env <- RWS.ask
499− case dbcio_mScriptSession env of
500− Nothing -> pure $ Left $ ScriptError ScriptCompilationDisabledError
501− Just ss -> pure (Right ss)
502−
503−putDBCIOContext :: DatabaseContext -> DatabaseContextIOEvalMonad (Either RelationalError ())
504−putDBCIOContext ctx = do
505− RWS.modify (\dbstate -> dbstate { dbc_context = ctx})
506− pure (Right ())
507−
508−getDBCIOContext :: DatabaseContextIOEvalMonad DatabaseContext
509−getDBCIOContext = dbc_context <$> RWS.get
510−
511−getDBCIORelationalExprEnv :: DatabaseContextIOEvalMonad RelationalExprEnv
512−getDBCIORelationalExprEnv = do
513− context <- getDBCIOContext
514− mkRelationalExprEnv context . dbcio_graph <$> RWS.ask
515−
516−evalGraphRefDatabaseContextIOExpr :: GraphRefDatabaseContextIOExpr -> DatabaseContextIOEvalMonad (Either RelationalError ())
517−#if !defined(PM36_HASKELL_SCRIPTING)
518−evalGraphRefDatabaseContextIOExpr AddAtomFunction{} = pure (Left (ScriptError ScriptCompilationDisabledError))
519−evalGraphRefDatabaseContextIOExpr AddDatabaseContextFunction{} = pure (Left (ScriptError ScriptCompilationDisabledError))
520−evalGraphRefDatabaseContextIOExpr LoadAtomFunctions{} = pure (Left (ScriptError ScriptCompilationDisabledError))
521−evalGraphRefDatabaseContextIOExpr LoadDatabaseContextFunctions{} = pure (Left (ScriptError ScriptCompilationDisabledError))
522−#else
523−evalGraphRefDatabaseContextIOExpr (AddAtomFunction funcName funcType script) = do
494+evalDatabaseContextIOExpr mScriptSession currentContext (AddAtomFunction funcName funcType script) =
524− eScriptSession <- requireScriptSession
495+ case mScriptSession of
525− currentContext <- getDBCIOContext
496+ Nothing -> pure (Left (ScriptError ScriptCompilationDisabledError))
526− case eScriptSession of
527− Left err -> pure (Left err)
528− Right scriptSession -> do
497+ Just scriptSession -> do
529− res <- liftIO $ try $ runGhc (Just libdir) $ do
498+ res <- try $ runGhc (Just libdir) $ do
530 setSession (hscEnv scriptSession)
499 setSession (hscEnv scriptSession)
531 let atomFuncs = atomFunctions currentContext
500 let atomFuncs = atomFunctions currentContext
532 case extractAtomFunctionType funcType of
501 case extractAtomFunctionType funcType of
@@ -537,7 +506,7 @@ evalGraphRefDatabaseContextIOExpr (AddAtomFunction funcName funcType script) = d
537 pure $ case eCompiledFunc of
506 pure $ case eCompiledFunc of
538 Left err -> Left (ScriptError err)
507 Left err -> Left (ScriptError err)
539 Right compiledFunc -> do
508 Right compiledFunc -> do
540− funcAtomType <- mapM (\funcTypeArg -> atomTypeForTypeConstructorValidate False funcTypeArg (typeConstructorMapping currentContext) M.empty) adjustedAtomTypeCons
509+ funcAtomType <- mapM (\funcTypeArg -> atomTypeForTypeConstructor funcTypeArg (typeConstructorMapping currentContext) M.empty) adjustedAtomTypeCons
541 let updatedFuncs = HS.insert newAtomFunc atomFuncs
510 let updatedFuncs = HS.insert newAtomFunc atomFuncs
542 newContext = currentContext { atomFunctions = updatedFuncs }
511 newContext = currentContext { atomFunctions = updatedFuncs }
543 newAtomFunc = AtomFunction { atomFuncName = funcName,
512 newAtomFunc = AtomFunction { atomFuncName = funcName,
@@ -552,13 +521,12 @@ evalGraphRefDatabaseContextIOExpr (AddAtomFunction funcName funcType script) = d
552 Left (exc :: SomeException) -> pure $ Left (ScriptError (OtherScriptCompilationError (show exc)))
521 Left (exc :: SomeException) -> pure $ Left (ScriptError (OtherScriptCompilationError (show exc)))
553 Right eContext -> case eContext of
522 Right eContext -> case eContext of
554 Left err -> pure (Left err)
523 Left err -> pure (Left err)
555− Right context' -> putDBCIOContext context'
524+ Right context' -> pure (Right context')
525+
556−evalGraphRefDatabaseContextIOExpr (AddDatabaseContextFunction funcName funcType script) = do
526+evalDatabaseContextIOExpr mScriptSession currentContext (AddDatabaseContextFunction funcName funcType script) =
557− eScriptSession <- requireScriptSession
527+ case mScriptSession of
558− currentContext <- getDBCIOContext
528+ Nothing -> pure (Left (ScriptError ScriptCompilationDisabledError))
559− case eScriptSession of
560− Left err -> pure (Left err)
561− Right scriptSession -> do
529+ Just scriptSession -> do
562 --validate that the function signature is of the form x -> y -> ... -> DatabaseContext -> DatabaseContext
530 --validate that the function signature is of the form x -> y -> ... -> DatabaseContext -> DatabaseContext
563 let last2Args = reverse (take 2 (reverse funcType))
531 let last2Args = reverse (take 2 (reverse funcType))
564 atomArgs = take (length funcType - 2) funcType
532 atomArgs = take (length funcType - 2) funcType
@@ -568,7 +536,7 @@ evalGraphRefDatabaseContextIOExpr (AddDatabaseContextFunction funcName funcType
568 if last2Args /= [ADTypeConstructor "DatabaseContext" [], dbContextTypeCons] then
536 if last2Args /= [ADTypeConstructor "DatabaseContext" [], dbContextTypeCons] then
569 pure (Left (ScriptError (TypeCheckCompilationError expectedType actualType)))
537 pure (Left (ScriptError (TypeCheckCompilationError expectedType actualType)))
570 else do
538 else do
571− res <- liftIO $ try $ runGhc (Just libdir) $ do
539+ res <- try $ runGhc (Just libdir) $ do
572 setSession (hscEnv scriptSession)
540 setSession (hscEnv scriptSession)
573 eCompiledFunc <- compileScript (dbcFunctionBodyType scriptSession) script
541 eCompiledFunc <- compileScript (dbcFunctionBodyType scriptSession) script
574 pure $ case eCompiledFunc of
542 pure $ case eCompiledFunc of
@@ -593,170 +561,123 @@ evalGraphRefDatabaseContextIOExpr (AddDatabaseContextFunction funcName funcType
593 Left (exc :: SomeException) -> pure $ Left (ScriptError (OtherScriptCompilationError (show exc)))
561 Left (exc :: SomeException) -> pure $ Left (ScriptError (OtherScriptCompilationError (show exc)))
594 Right eContext -> case eContext of
562 Right eContext -> case eContext of
595 Left err -> pure (Left err)
563 Left err -> pure (Left err)
596− Right context' -> putDBCIOContext context'
564+ Right context' -> pure (Right context')
597−evalGraphRefDatabaseContextIOExpr (LoadAtomFunctions modName funcName modPath) = do
565+
598− currentContext <- getDBCIOContext
566+
599− eLoadFunc <- liftIO $ loadAtomFunctions (T.unpack modName) (T.unpack funcName) modPath
567+updateTupleWithAtomExprs :: M.Map AttributeName AtomExpr -> DatabaseContext -> RelationTuple -> Either RelationalError RelationTuple
600− case eLoadFunc of
568+updateTupleWithAtomExprs exprMap context tupIn = do
601− Left LoadSymbolError -> pure (Left LoadFunctionError)
569+ --resolve all atom exprs
602− Right atomFunctionListFunc -> let newContext = currentContext { atomFunctions = mergedFuncs }
570+ atomsAssoc <- mapM (\(attrName, atomExpr) -> do
603− mergedFuncs = HS.union (atomFunctions currentContext) (HS.fromList atomFunctionListFunc)
571+ atom <- runReader (evalAtomExpr tupIn atomExpr) (RelationalExprStateElems context)
604− in putDBCIOContext newContext
572+ pure (attrName, atom)
605−evalGraphRefDatabaseContextIOExpr (LoadDatabaseContextFunctions modName funcName modPath) = do
573+ ) (M.toList exprMap)
606− currentContext <- getDBCIOContext
574+ pure (updateTupleWithAtoms (M.fromList atomsAssoc) tupIn)
607− eLoadFunc <- liftIO $ loadDatabaseContextFunctions (T.unpack modName) (T.unpack funcName) modPath
608− case eLoadFunc of
609− Left LoadSymbolError -> pure (Left LoadFunctionError)
610− Right dbcListFunc -> let newContext = currentContext { dbcFunctions = mergedFuncs }
611− mergedFuncs = HS.union (dbcFunctions currentContext) (HS.fromList dbcListFunc)
612− in putDBCIOContext newContext
613−#endif
614−evalGraphRefDatabaseContextIOExpr (CreateArbitraryRelation relVarName attrExprs range) = do
615− --Define
616− currentContext <- getDBCIOContext
617− env <- RWS.ask
618− --create graph ref expr
619− let gfExpr = Define relVarName attrExprs
620− evalEnv = mkDatabaseContextEvalEnv (dbcio_transId env) (dbcio_graph env)
621− graph = dbcio_graph env
622− case runDatabaseContextEvalMonad currentContext evalEnv (evalGraphRefDatabaseContextExpr gfExpr) of
623− Left err -> pure (Left err)
624− Right dbstate -> do
625− --Assign
626− let existingRelVar = M.lookup relVarName relVarTable
627− relVarTable = relationVariables (dbc_context dbstate)
628− case existingRelVar of
629− Nothing -> pure $ Left (RelVarNotDefinedError relVarName)
630− Just existingRel -> do
631− let gfEnv = freshGraphRefRelationalExprEnv (Just currentContext) graph
632− case runGraphRefRelationalExprM gfEnv (typeForGraphRefRelationalExpr existingRel) of
633− Left err -> pure (Left err)
634− Right relType -> do
635− let expectedAttributes = attributes relType
636− tcMap = typeConstructorMapping (dbc_context dbstate)
637− eitherRel <- liftIO $ generate $ runReaderT (arbitraryRelation expectedAttributes range) tcMap
638− case eitherRel of
639− Left err -> pure $ Left err
640− Right rel ->
641− case runDatabaseContextEvalMonad currentContext evalEnv (setRelVar relVarName (ExistingRelation rel)) of
642− Left err -> pure (Left err)
643− Right dbstate' -> putDBCIOContext (dbc_context dbstate')
644
575
645--run verification on all constraints
576--run verification on all constraints
646−checkConstraints :: DatabaseContext -> TransactionId -> TransactionGraph -> Either RelationalError ()
577+checkConstraints :: DatabaseContext -> Maybe RelationalError
647−checkConstraints context transId graph@(TransactionGraph graphHeads transSet) = do
578+checkConstraints context = case failures of
648− mapM_ (uncurry checkIncDep) (M.toList deps)
579+ [] -> Nothing
580+ l:_ -> Just l
649 where
581 where
650− potentialGraph = TransactionGraph graphHeads (S.insert tempTrans transSet)
582+ failures = M.elems $ M.mapMaybeWithKey checkIncDep deps
651− tempStamp = UTCTime { utctDay = fromGregorian 2000 1 1,
652− utctDayTime = secondsToDiffTime 0 }
653− tempSchemas = Schemas context M.empty
654− tempTrans = Transaction U.nil tempTransInfo tempSchemas
655− tempTransInfo = TransactionInfo { parents = transId NE.:| [],
656− stamp = tempStamp,
657− merkleHash = mempty
658− }
659−
660 deps = inclusionDependencies context
583 deps = inclusionDependencies context
661− -- no optimization available here, really? perhaps the optimizer should be passed down to here or the eval function should be passed through the environment
584+ eval expr = runReader (evalRelationalExpr expr) (RelationalExprStateElems context)
662 checkIncDep depName (InclusionDependency subsetExpr supersetExpr) = do
585 checkIncDep depName (InclusionDependency subsetExpr supersetExpr) = do
663− let process = runProcessExprM UncommittedContextMarker
586+ let checkExpr = Equals supersetExpr (Union subsetExpr supersetExpr)
664− gfSubsetExpr = process (processRelationalExpr subsetExpr)
587+ case eval checkExpr of
665− gfSupersetExpr = process (processRelationalExpr supersetExpr)
666− --if both expressions are of a single-attribute (such as with a simple foreign key), the names of the attributes are irrelevant (they need not match) because the expression is unambiguous, but special-casing this to rename the attribute automatically would not be orthogonal behavior and probably cause confusion. Instead, special case the error to make it clear.
667− let gfEnv = freshGraphRefRelationalExprEnv (Just context) graph
668− runGfRel = runGraphRefRelationalExprM gfEnv
669− typeSub <- runGfRel (typeForGraphRefRelationalExpr gfSubsetExpr)
670− typeSuper <- runGfRel (typeForGraphRefRelationalExpr gfSupersetExpr)
671− when (typeSub /= typeSuper) (Left (RelationTypeMismatchError (attributes typeSub) (attributes typeSuper)))
672− let checkExpr = Equals gfSupersetExpr (Union gfSubsetExpr gfSupersetExpr)
673− gfEvald = runGraphRefRelationalExprM gfEnv' (evalGraphRefRelationalExpr checkExpr)
674− gfEnv' = freshGraphRefRelationalExprEnv (Just context) potentialGraph
675− case gfEvald of
676− Left err -> Left err
588+ Left err -> Just err
677 Right resultRel -> if resultRel == relationTrue then
589 Right resultRel -> if resultRel == relationTrue then
678− pure ()
590+ Nothing
679 else
591 else
680− Left (InclusionDependencyCheckError depName)
592+ Just $ InclusionDependencyCheckError depName
681
593
682-- the type of a relational expression is equal to the relation attribute set returned from executing the relational expression; therefore, the type can be cheaply derived by evaluating a relational expression and ignoring and tuple processing
594-- the type of a relational expression is equal to the relation attribute set returned from executing the relational expression; therefore, the type can be cheaply derived by evaluating a relational expression and ignoring and tuple processing
683-- furthermore, the type of a relational expression is the resultant header of the evaluated empty-tupled relation
595-- furthermore, the type of a relational expression is the resultant header of the evaluated empty-tupled relation
684
596
685−typeForRelationalExpr :: RelationalExpr -> RelationalExprM Relation
597+typeForRelationalExpr :: RelationalExpr -> RelationalExprState (Either RelationalError Relation)
686typeForRelationalExpr expr = do
598typeForRelationalExpr expr = do
599+ rstate <- ask
600+ let context = stateElemsContext rstate
687 --replace the relationVariables context element with a cloned set of relation devoid of tuples
601 --replace the relationVariables context element with a cloned set of relation devoid of tuples
688− --evalRelationalExpr could still return an existing relation with tuples, so strip them
602+ let context' = contextWithEmptyTupleSets context
689− graph <- reGraph
603+ rstate' = setStateElemsContext rstate context'
690− context <- reContext
604+ pure (runReader (evalRelationalExpr expr) rstate')
691− let gfExpr = runProcessExprM UncommittedContextMarker (processRelationalExpr expr)
605+
692− gfEnv = freshGraphRefRelationalExprEnv (Just context) graph
606+--returns a database context with all tuples removed
693− runGf = runGraphRefRelationalExprM gfEnv (typeForGraphRefRelationalExpr gfExpr)
607+--this is useful for type checking and optimization
694− lift $ except runGf
608+contextWithEmptyTupleSets :: DatabaseContext -> DatabaseContext
609+contextWithEmptyTupleSets contextIn = contextIn { relationVariables = relVars }
610+ where
611+ relVars = M.map (\rel -> Relation (attributes rel) emptyTupleSet) (relationVariables contextIn)
695
612
696liftE :: (Monad m) => m (Either a b) -> ExceptT a m b
613liftE :: (Monad m) => m (Either a b) -> ExceptT a m b
697liftE v = do
614liftE v = do
698 y <- lift v
615 y <- lift v
699 case y of
616 case y of
700− Left err -> throwError err
617+ Left err -> throwE err
701 Right val -> pure val
618 Right val -> pure val
702
619
703{- used for restrictions- take the restrictionpredicate and return the corresponding filter function -}
620{- used for restrictions- take the restrictionpredicate and return the corresponding filter function -}
704−predicateRestrictionFilter :: Attributes -> GraphRefRestrictionPredicateExpr -> GraphRefRelationalExprM RestrictionFilter
621+predicateRestrictionFilter :: Attributes -> RestrictionPredicateExpr -> RelationalExprState (Either RelationalError RestrictionFilter)
705−predicateRestrictionFilter attrs (AndPredicate expr1 expr2) = do
622+predicateRestrictionFilter attrs (AndPredicate expr1 expr2) =
623+ runExceptT $ do
706− expr1v <- predicateRestrictionFilter attrs expr1
624+ expr1v <- liftE (predicateRestrictionFilter attrs expr1)
707− expr2v <- predicateRestrictionFilter attrs expr2
625+ expr2v <- liftE (predicateRestrictionFilter attrs expr2)
708− pure (\x -> do
626+ pure (\x -> do
709− ev1 <- expr1v x
627+ ev1 <- expr1v x
710− ev2 <- expr2v x
628+ ev2 <- expr2v x
711− pure (ev1 && ev2))
629+ pure (ev1 && ev2))
712
630
713−predicateRestrictionFilter attrs (OrPredicate expr1 expr2) = do
631+predicateRestrictionFilter attrs (OrPredicate expr1 expr2) =
632+ runExceptT $ do
714− expr1v <- predicateRestrictionFilter attrs expr1
633+ expr1v <- liftE (predicateRestrictionFilter attrs expr1)
715− expr2v <- predicateRestrictionFilter attrs expr2
634+ expr2v <- liftE (predicateRestrictionFilter attrs expr2)
716 pure (\x -> do
635 pure (\x -> do
717 ev1 <- expr1v x
636 ev1 <- expr1v x
718 ev2 <- expr2v x
637 ev2 <- expr2v x
719 pure (ev1 || ev2))
638 pure (ev1 || ev2))
720
639
721−predicateRestrictionFilter _ TruePredicate = pure (\_ -> pure True)
640+predicateRestrictionFilter _ TruePredicate = pure (Right (\_ -> pure True))
722
641
723−predicateRestrictionFilter attrs (NotPredicate expr) = do
642+predicateRestrictionFilter attrs (NotPredicate expr) =
643+ runExceptT $ do
724− exprv <- predicateRestrictionFilter attrs expr
644+ exprv <- liftE (predicateRestrictionFilter attrs expr)
725− pure (fmap not . exprv)
645+ pure (\x -> do
646+ ev <- exprv x
647+ pure (not ev))
726
648
727--optimization opportunity: if the subexpression does not reference attributes in the top-level expression, then it need only be evaluated once, statically, outside the tuple filter- see historical implementation here
649--optimization opportunity: if the subexpression does not reference attributes in the top-level expression, then it need only be evaluated once, statically, outside the tuple filter- see historical implementation here
728predicateRestrictionFilter _ (RelationalExprPredicate relExpr) = do
650predicateRestrictionFilter _ (RelationalExprPredicate relExpr) = do
729− renv <- askEnv
651+ rstate <- ask
730− let eval :: RelationTuple -> Either RelationalError Relation
652+ pure (Right (\tup -> case runReader (evalRelationalExpr relExpr) (mergeTuplesIntoRelationalExprState tup rstate) of
731− eval tup =
732− let gfEnv = mergeTuplesIntoGraphRefRelationalExprEnv tup renv in
733− runGraphRefRelationalExprM gfEnv (evalGraphRefRelationalExpr relExpr)
734− pure (\tup -> case eval tup of
735 Left err -> Left err
653 Left err -> Left err
736 Right rel -> if arity rel /= 0 then
654 Right rel -> if arity rel /= 0 then
737 Left (PredicateExpressionError "Relational restriction filter must evaluate to 'true' or 'false'")
655 Left (PredicateExpressionError "Relational restriction filter must evaluate to 'true' or 'false'")
738 else
656 else
739− pure (rel == relationTrue))
657+ pure (rel == relationTrue)))
740
658
741predicateRestrictionFilter attrs (AttributeEqualityPredicate attrName atomExpr) = do
659predicateRestrictionFilter attrs (AttributeEqualityPredicate attrName atomExpr) = do
742− env <- askEnv
660+ rstate <- ask
743− let attrs' = A.union attrs (envAttributes env)
661+ let (attrs', ctxtup') = case rstate of
744− ctxtup' = envTuple env
662+ RelationalExprStateElems _ -> (attrs, emptyTuple)
663+ RelationalExprStateAttrsElems _ _ -> (attrs, emptyTuple)
664+ RelationalExprStateTupleElems _ ctxtup -> (A.union attrs (tupleAttributes ctxtup), ctxtup)
665+ runExceptT $ do
745− atomExprType <- typeForGraphRefAtomExpr attrs' atomExpr
666+ atomExprType <- liftE (typeFromAtomExpr attrs' atomExpr)
746− attr <- lift $ except $ case A.attributeForName attrName attrs of
667+ attr <- either throwE pure $ case A.attributeForName attrName attrs of
747 Right attr -> Right attr
668 Right attr -> Right attr
748 Left (NoSuchAttributeNamesError _) -> case A.attributeForName attrName (tupleAttributes ctxtup') of
669 Left (NoSuchAttributeNamesError _) -> case A.attributeForName attrName (tupleAttributes ctxtup') of
749 Right ctxattr -> Right ctxattr
670 Right ctxattr -> Right ctxattr
750 Left err2@(NoSuchAttributeNamesError _) -> Left err2
671 Left err2@(NoSuchAttributeNamesError _) -> Left err2
751 Left err -> Left err
672 Left err -> Left err
752 Left err -> Left err
673 Left err -> Left err
753− if atomExprType /= A.atomType attr then
674+ if atomExprType /= A.atomType attr then
754− throwError (TupleAttributeTypeMismatchError (A.attributesFromList [attr]))
675+ throwE (TupleAttributeTypeMismatchError (A.attributesFromList [attr]))
755− else
676+ else
756 pure $ \tupleIn -> let evalAndCmp atomIn = case atomEvald of
677 pure $ \tupleIn -> let evalAndCmp atomIn = case atomEvald of
757 Right atomCmp -> atomCmp == atomIn
678 Right atomCmp -> atomCmp == atomIn
758 Left _ -> False
679 Left _ -> False
759− atomEvald = runGraphRefRelationalExprM env (evalGraphRefAtomExpr tupleIn atomExpr)
680+ atomEvald = runReader (evalAtomExpr tupleIn atomExpr) rstate
760 in
681 in
761 pure $ case atomForAttributeName attrName tupleIn of
682 pure $ case atomForAttributeName attrName tupleIn of
762 Left (NoSuchAttributeNamesError _) -> case atomForAttributeName attrName ctxtup' of
683 Left (NoSuchAttributeNamesError _) -> case atomForAttributeName attrName ctxtup' of
@@ -767,626 +688,244 @@ predicateRestrictionFilter attrs (AttributeEqualityPredicate attrName atomExpr)
767-- in the future, it would be useful to do typechecking on the attribute and atom expr filters in advance
688-- in the future, it would be useful to do typechecking on the attribute and atom expr filters in advance
768predicateRestrictionFilter attrs (AtomExprPredicate atomExpr) = do
689predicateRestrictionFilter attrs (AtomExprPredicate atomExpr) = do
769 --merge attrs into the state attributes
690 --merge attrs into the state attributes
770− renv <- askEnv
691+ rstate <- ask
692+ runExceptT $ do
771− aType <- typeForGraphRefAtomExpr attrs atomExpr
693+ aType <- liftE (typeFromAtomExpr attrs atomExpr)
772− if aType /= BoolAtomType then
694+ if aType /= BoolAtomType then
773− throwError (AtomTypeMismatchError aType BoolAtomType)
695+ throwE (AtomTypeMismatchError aType BoolAtomType)
774− else
696+ else
775 pure (\tupleIn ->
697 pure (\tupleIn ->
776− case runGraphRefRelationalExprM renv (evalGraphRefAtomExpr tupleIn atomExpr) of
698+ pure $ case runReader (evalAtomExpr tupleIn atomExpr) rstate of
777− Left err -> Left err
699+ Left _ -> False
778− Right boolAtomValue -> pure (boolAtomValue == BoolAtom True))
700+ Right boolAtomValue -> boolAtomValue == BoolAtom True)
779
701
780tupleExprCheckNewAttrName :: AttributeName -> Relation -> Either RelationalError Relation
702tupleExprCheckNewAttrName :: AttributeName -> Relation -> Either RelationalError Relation
781tupleExprCheckNewAttrName attrName rel = if isRight (attributeForName attrName rel) then
703tupleExprCheckNewAttrName attrName rel = if isRight (attributeForName attrName rel) then
782− Left (AttributeNameInUseError attrName)
704+ Left (error "SPAMMIT" $ AttributeNameInUseError attrName)
783 else
705 else
784 Right rel
706 Right rel
785
707
786−extendGraphRefTupleExpressionProcessor :: Relation -> GraphRefExtendTupleExpr -> GraphRefRelationalExprM (Attributes, RelationTuple -> Either RelationalError RelationTuple)
708+extendTupleExpressionProcessor :: Relation -> ExtendTupleExpr -> RelationalExprState (Either RelationalError (Attributes, RelationTuple -> Either RelationalError RelationTuple))
787−extendGraphRefTupleExpressionProcessor relIn (AttributeExtendTupleExpr newAttrName atomExpr) =
709+extendTupleExpressionProcessor relIn (AttributeExtendTupleExpr newAttrName atomExpr) = do
788−-- renv <- askEnv
710+ rstate <- ask
789 -- check that the attribute name is not in use
711 -- check that the attribute name is not in use
790 case tupleExprCheckNewAttrName newAttrName relIn of
712 case tupleExprCheckNewAttrName newAttrName relIn of
791− Left err -> throwError err
713+ Left err -> pure (Left err)
792− Right _ -> do
714+ Right _ -> runExceptT $ do
793− atomExprType <- typeForGraphRefAtomExpr (attributes relIn) atomExpr
715+ atomExprType <- liftE (typeFromAtomExpr (attributes relIn) atomExpr)
794− atomExprType' <- verifyGraphRefAtomExprTypes relIn atomExpr atomExprType
716+ atomExprType' <- liftE (verifyAtomExprTypes relIn atomExpr atomExprType)
795 let newAttrs = A.attributesFromList [Attribute newAttrName atomExprType']
717 let newAttrs = A.attributesFromList [Attribute newAttrName atomExprType']
796 newAndOldAttrs = A.addAttributes (attributes relIn) newAttrs
718 newAndOldAttrs = A.addAttributes (attributes relIn) newAttrs
797− env <- ask
719+ pure (newAndOldAttrs, \tup -> let substate = mergeTuplesIntoRelationalExprState tup rstate in case runReader (evalAtomExpr tup atomExpr) substate of
798− pure (newAndOldAttrs, \tup -> do
720+ Left err -> Left err
799− let gfEnv = mergeTuplesIntoGraphRefRelationalExprEnv tup env
800− atom <- runGraphRefRelationalExprM gfEnv (evalGraphRefAtomExpr tup atomExpr)
801− Right (tupleAtomExtend newAttrName atom tup)
721+ Right atom -> Right (tupleAtomExtend newAttrName atom tup)
802 )
722 )
803
723
804−evalGraphRefAtomExpr :: RelationTuple -> GraphRefAtomExpr -> GraphRefRelationalExprM Atom
724+evalAtomExpr :: RelationTuple -> AtomExpr -> RelationalExprState (Either RelationalError Atom)
805−evalGraphRefAtomExpr tupIn (AttributeAtomExpr attrName) =
806− case atomForAttributeName attrName tupIn of
725+evalAtomExpr tupIn (AttributeAtomExpr attrName) = case atomForAttributeName attrName tupIn of
807− Right atom -> pure atom
726+ Right atom -> pure (Right atom)
808− Left err@(NoSuchAttributeNamesError _) -> do
727+ err@(Left (NoSuchAttributeNamesError _)) -> do
809− env <- askEnv
728+ rstate <- ask
810− case gre_extra env of
729+ case rstate of
811− Nothing -> throwError err
730+ RelationalExprStateElems _ -> pure err
731+ RelationalExprStateAttrsElems _ _ -> pure err
812− Just (Left ctxtup) -> lift $ except $ atomForAttributeName attrName ctxtup
732+ RelationalExprStateTupleElems _ ctxtup -> pure (atomForAttributeName attrName ctxtup)
813− Just (Right _) -> throwError err
814− Left err -> throwError err
733+ Left err -> pure (Left err)
815−evalGraphRefAtomExpr _ (NakedAtomExpr atom) = pure atom
734+evalAtomExpr _ (NakedAtomExpr atom) = pure (Right atom)
816−evalGraphRefAtomExpr tupIn (FunctionAtomExpr funcName arguments tid) = do
735+evalAtomExpr tupIn (FunctionAtomExpr funcName arguments ()) = do
817− argTypes <- mapM (typeForGraphRefAtomExpr (tupleAttributes tupIn)) arguments
736+ argTypes <- mapM (typeFromAtomExpr (tupleAttributes tupIn)) arguments
818− context <- gfDatabaseContextForMarker tid
737+ context <- fmap stateElemsContext ask
738+ runExceptT $ do
819− let functions = atomFunctions context
739+ let functions = atomFunctions context
820− func <- lift $ except (atomFunctionForName funcName functions)
740+ func <- either throwE pure (atomFunctionForName funcName functions)
821− let expectedArgCount = length (atomFuncType func) - 1
741+ let expectedArgCount = length (atomFuncType func) - 1
822− actualArgCount = length argTypes
742+ actualArgCount = length argTypes
743+ safeInit [_] = []
823− safeInit [] = [] -- different behavior from normal init
744+ safeInit [] = [] -- different behavior from normal init
824− safeInit xs = init xs
745+ safeInit (_:xs) = safeInit xs
825− if expectedArgCount /= actualArgCount then
746+ if expectedArgCount /= actualArgCount then
826− throwError (FunctionArgumentCountMismatchError expectedArgCount actualArgCount)
747+ throwE (FunctionArgumentCountMismatchError expectedArgCount actualArgCount)
827− else do
748+ else do
828− let zippedArgs = zip (safeInit (atomFuncType func)) argTypes
749+ mapM_ (\(expType, actType) -> either throwE pure (atomTypeVerify expType actType)) (safeInit (zip (atomFuncType func) argTypes))
829− mapM_ (\(expType, actType) ->
830− lift $ except (atomTypeVerify expType actType)) zippedArgs
831− evaldArgs <- mapM (evalGraphRefAtomExpr tupIn) arguments
750+ evaldArgs <- mapM (liftE . evalAtomExpr tupIn) arguments
832 case evalAtomFunction func evaldArgs of
751 case evalAtomFunction func evaldArgs of
833− Left err -> throwError (AtomFunctionUserError err)
752+ Left err -> throwE (AtomFunctionUserError err)
834 Right result -> do
753 Right result -> do
835 --validate that the result matches the expected type
754 --validate that the result matches the expected type
836− _ <- lift $ except (atomTypeVerify (last (atomFuncType func)) (atomTypeForAtom result))
755+ _ <- either throwE pure (atomTypeVerify (last (atomFuncType func)) (atomTypeForAtom result))
837 pure result
756 pure result
838−evalGraphRefAtomExpr tupIn (RelationAtomExpr relExpr) = do
757+evalAtomExpr tupIn (RelationAtomExpr relExpr) = do
839 --merge existing state tuple context into new state tuple context to support an arbitrary number of levels, but new attributes trounce old attributes
758 --merge existing state tuple context into new state tuple context to support an arbitrary number of levels, but new attributes trounce old attributes
840− env <- ask
759+ rstate <- ask
841− let gfEnv = mergeTuplesIntoGraphRefRelationalExprEnv tupIn env
760+ runExceptT $ do
842− relAtom <- lift $ except $ runGraphRefRelationalExprM gfEnv (evalGraphRefRelationalExpr relExpr)
761+ let newState = mergeTuplesIntoRelationalExprState tupIn rstate
762+ relAtom <- either throwE pure (runReader (evalRelationalExpr relExpr) newState)
843− pure (RelationAtom relAtom)
763+ pure (RelationAtom relAtom)
844−evalGraphRefAtomExpr tupIn cons@(ConstructedAtomExpr dConsName dConsArgs _) = do --why is the tid unused here? suspicious
764+evalAtomExpr tupIn cons@(ConstructedAtomExpr dConsName dConsArgs ()) = runExceptT $ do
845− let mergeEnv = mergeTuplesIntoGraphRefRelationalExprEnv tupIn
765+ rstate <- lift ask
766+ let newState = mergeTuplesIntoRelationalExprState tupIn rstate
846− aType <- local mergeEnv (typeForGraphRefAtomExpr (tupleAttributes tupIn) cons)
767+ aType <- either throwE pure (runReader (typeFromAtomExpr (tupleAttributes tupIn) cons) newState)
847− argAtoms <- local mergeEnv $
768+ argAtoms <- mapM (\arg -> either throwE pure (runReader (evalAtomExpr tupIn arg) newState)) dConsArgs
848− mapM (evalGraphRefAtomExpr tupIn) dConsArgs
849 pure (ConstructedAtom dConsName aType argAtoms)
769 pure (ConstructedAtom dConsName aType argAtoms)
850
770
851−typeForGraphRefAtomExpr :: Attributes -> GraphRefAtomExpr -> GraphRefRelationalExprM AtomType
771+typeFromAtomExpr :: Attributes -> AtomExpr -> RelationalExprState (Either RelationalError AtomType)
852−typeForGraphRefAtomExpr attrs (AttributeAtomExpr attrName) = do
772+typeFromAtomExpr attrs (AttributeAtomExpr attrName) = do
853− renv <- askEnv
773+ rstate <- ask
854 case A.atomTypeForAttributeName attrName attrs of
774 case A.atomTypeForAttributeName attrName attrs of
855− Right aType -> pure aType
775+ Right aType -> pure (Right aType)
856− Left err@(NoSuchAttributeNamesError _) ->
776+ Left err@(NoSuchAttributeNamesError _) -> case rstate of
857− let envTup = envTuple renv
858− envAttrs = envAttributes renv in
859− case A.attributeForName attrName envAttrs of
777+ RelationalExprStateAttrsElems _ attrs' -> case A.attributeForName attrName attrs' of
778+ Left err' -> pure (Left err')
860− Right attr -> pure (A.atomType attr)
779+ Right attr -> pure (Right (A.atomType attr))
780+ RelationalExprStateElems _ -> pure (Left err)
861− Left _ -> case atomForAttributeName attrName envTup of
781+ RelationalExprStateTupleElems _ tup -> case atomForAttributeName attrName tup of
862− Right atom -> pure (atomTypeForAtom atom)
782+ Left err' -> pure (Left err')
863− Left _ -> --throwError (traceStack (show ("typeForGRAtomExpr", attrs, envTup)) err)
783+ Right atom -> pure (Right (atomTypeForAtom atom))
864− throwError err
865− Left err -> throwError err
784+ Left err -> pure (Left err)
866−
867−typeForGraphRefAtomExpr _ (NakedAtomExpr atom) = pure (atomTypeForAtom atom)
785+typeFromAtomExpr _ (NakedAtomExpr atom) = pure (Right (atomTypeForAtom atom))
868−typeForGraphRefAtomExpr attrs (FunctionAtomExpr funcName atomArgs transId) = do
786+typeFromAtomExpr attrs (FunctionAtomExpr funcName atomArgs _) = do
787+ context <- fmap stateElemsContext ask
869− funcs <- atomFunctions <$> gfDatabaseContextForMarker transId
788+ let funcs = atomFunctions context
870 case atomFunctionForName funcName funcs of
789 case atomFunctionForName funcName funcs of
871− Left err -> throwError err
790+ Left err -> pure (Left err)
872 Right func -> do
791 Right func -> do
873 let funcRetType = last (atomFuncType func)
792 let funcRetType = last (atomFuncType func)
874 funcArgTypes = init (atomFuncType func)
793 funcArgTypes = init (atomFuncType func)
875− argTypes <- mapM (typeForGraphRefAtomExpr attrs) atomArgs
794+ eArgTypes <- mapM (typeFromAtomExpr attrs) atomArgs
795+ case lefts eArgTypes of
796+ errs@(_:_) -> pure (Left (someErrors errs))
797+ [] -> do
876− let eTvMap = resolveTypeVariables funcArgTypes argTypes
798+ let eTvMap = resolveTypeVariables funcArgTypes argTypes
799+ argTypes = rights eArgTypes
877− case eTvMap of
800+ case eTvMap of
878− Left err -> throwError err
801+ Left err -> pure (Left err)
879− Right tvMap -> lift $ except $ resolveFunctionReturnValue funcName tvMap funcRetType
802+ Right tvMap -> pure (resolveFunctionReturnValue funcName tvMap funcRetType)
880−typeForGraphRefAtomExpr attrs (RelationAtomExpr relExpr) = do
803+typeFromAtomExpr attrs (RelationAtomExpr relExpr) = runExceptT $ do
881− relType <- R.local (mergeAttributesIntoGraphRefRelationalExprEnv attrs) (typeForGraphRefRelationalExpr relExpr)
804+ rstate <- lift ask
805+ relType <- either throwE pure (runReader (typeForRelationalExpr relExpr) (mergeAttributesIntoRelationalExprState attrs rstate))
882 pure (RelationAtomType (attributes relType))
806 pure (RelationAtomType (attributes relType))
883-- grab the type of the data constructor, then validate that the args match the expected types
807-- grab the type of the data constructor, then validate that the args match the expected types
884−typeForGraphRefAtomExpr attrs (ConstructedAtomExpr dConsName dConsArgs tid) =
808+typeFromAtomExpr attrs (ConstructedAtomExpr dConsName dConsArgs _) =
885− do
809+ runExceptT $ do
886− argsTypes <- mapM (typeForGraphRefAtomExpr attrs) dConsArgs
810+ argsTypes <- mapM (liftE . typeFromAtomExpr attrs) dConsArgs
887− tConsMap <- typeConstructorMapping <$> gfDatabaseContextForMarker tid
811+ context <- fmap stateElemsContext (lift ask)
888− lift $ except $ atomTypeForDataConstructor tConsMap dConsName argsTypes
812+ aType <- either throwE pure (atomTypeForDataConstructor (typeConstructorMapping context) dConsName argsTypes)
813+ pure aType
889
814
890-- | Validate that the type of the AtomExpr matches the expected type.
815-- | Validate that the type of the AtomExpr matches the expected type.
891−verifyGraphRefAtomExprTypes :: Relation -> GraphRefAtomExpr -> AtomType -> GraphRefRelationalExprM AtomType
816+verifyAtomExprTypes :: Relation -> AtomExpr -> AtomType -> RelationalExprState (Either RelationalError AtomType)
892−verifyGraphRefAtomExprTypes relIn (AttributeAtomExpr attrName) expectedType = do
817+verifyAtomExprTypes relIn (AttributeAtomExpr attrName) expectedType = runExceptT $ do
893− env <- askEnv
818+ rstate <- lift ask
894 case A.atomTypeForAttributeName attrName (attributes relIn) of
819 case A.atomTypeForAttributeName attrName (attributes relIn) of
895− Right aType -> lift $ except $ atomTypeVerify expectedType aType
820+ Right aType -> either throwE pure (atomTypeVerify expectedType aType)
896− (Left err@(NoSuchAttributeNamesError _)) ->
821+ (Left err@(NoSuchAttributeNamesError _)) -> case rstate of
897− let attrs' = envAttributes env in
822+ RelationalExprStateTupleElems _ _ -> throwE err
898− if attrs' == emptyAttributes then
823+ RelationalExprStateElems _ -> throwE err
899− throwError err
900− else
901− case A.attributeForName attrName attrs' of
824+ RelationalExprStateAttrsElems _ attrs -> case A.attributeForName attrName attrs of
902− Left err' -> throwError err'
825+ Left err' -> throwE err'
903− Right attrType -> lift $ except $ atomTypeVerify expectedType (A.atomType attrType)
826+ Right attrType -> either throwE pure (atomTypeVerify expectedType (A.atomType attrType))
904− Left err -> throwError err
827+ Left err -> throwE err
905−
906−verifyGraphRefAtomExprTypes _ (NakedAtomExpr atom) expectedType =
907− lift $ except $ atomTypeVerify expectedType (atomTypeForAtom atom)
828+verifyAtomExprTypes _ (NakedAtomExpr atom) expectedType = pure (atomTypeVerify expectedType (atomTypeForAtom atom))
908−verifyGraphRefAtomExprTypes relIn (FunctionAtomExpr funcName funcArgExprs tid) expectedType = do
829+verifyAtomExprTypes relIn (FunctionAtomExpr funcName funcArgExprs _) expectedType = do
909− context <- gfDatabaseContextForMarker tid
830+ rstate <- ask
910 let functions = atomFunctions context
831 let functions = atomFunctions context
832+ context = stateElemsContext rstate
833+ runExceptT $ do
911− func <- lift $ except $ atomFunctionForName funcName functions
834+ func <- either throwE pure (atomFunctionForName funcName functions)
912− let expectedArgTypes = atomFuncType func
835+ let expectedArgTypes = atomFuncType func
913− funcArgVerifier (atomExpr, expectedType2, argCount) = do
836+ funcArgTypes <- mapM (\(atomExpr,expectedType2,argCount) -> case runReader (verifyAtomExprTypes relIn atomExpr expectedType2) rstate of
914− let handler :: RelationalError -> GraphRefRelationalExprM AtomType
915− handler (AtomTypeMismatchError expSubType actSubType) = throwError (AtomFunctionTypeError funcName argCount expSubType actSubType)
837+ Left (AtomTypeMismatchError expSubType actSubType) -> throwE (AtomFunctionTypeError funcName argCount expSubType actSubType)
916− handler err = throwError err
838+ Left err -> throwE err
917− verifyGraphRefAtomExprTypes relIn atomExpr expectedType2 `catchError` handler
839+ Right x -> pure x
918− funcArgTypes <- mapM funcArgVerifier $ zip3 funcArgExprs expectedArgTypes [1..]
840+ ) $ zip3 funcArgExprs expectedArgTypes [1..]
919− if length funcArgTypes /= length expectedArgTypes - 1 then
841+ if length funcArgTypes /= length expectedArgTypes - 1 then
920− throwError (AtomTypeCountError funcArgTypes expectedArgTypes)
842+ throwE (AtomTypeCountError funcArgTypes expectedArgTypes)
921 else
843 else
922− lift $ except $ atomTypeVerify expectedType (last expectedArgTypes)
844+ either throwE pure (atomTypeVerify expectedType (last expectedArgTypes))
923−verifyGraphRefAtomExprTypes relIn (RelationAtomExpr relationExpr) expectedType =
845+verifyAtomExprTypes relIn (RelationAtomExpr relationExpr) expectedType = runExceptT $ do
924− do
846+ rstate <- lift ask
925− let mergedAttrsEnv e = mergeAttributesIntoGraphRefRelationalExprEnv (attributes relIn) e
847+ relType <- either throwE pure (runReader (typeForRelationalExpr relationExpr) (mergeAttributesIntoRelationalExprState (attributes relIn) rstate))
926− relType <- R.local mergedAttrsEnv (typeForGraphRefRelationalExpr relationExpr)
927− lift $ except $ atomTypeVerify expectedType (RelationAtomType (attributes relType))
848+ either throwE pure (atomTypeVerify expectedType (RelationAtomType (attributes relType)))
928−verifyGraphRefAtomExprTypes rel cons@ConstructedAtomExpr{} expectedType = do
849+verifyAtomExprTypes rel cons@ConstructedAtomExpr{} expectedType = runExceptT $ do
929− cType <- typeForGraphRefAtomExpr (attributes rel) cons
850+ cType <- liftE (typeFromAtomExpr (attributes rel) cons)
930− lift $ except $ atomTypeVerify expectedType cType
851+ either throwE pure (atomTypeVerify expectedType cType)
931
852
932-- | Look up the type's name and create a new attribute.
853-- | Look up the type's name and create a new attribute.
933−evalGraphRefAttrExpr :: GraphRefAttributeExpr -> GraphRefRelationalExprM Attribute
854+evalAttrExpr :: TypeConstructorMapping -> AttributeExpr -> Either RelationalError Attribute
934−evalGraphRefAttrExpr (AttributeAndTypeNameExpr attrName tCons transId) = do
855+evalAttrExpr aTypes (AttributeAndTypeNameExpr attrName tCons ()) = do
935− tConsMap <- typeConstructorMapping <$> gfDatabaseContextForMarker transId
856+ aType <- atomTypeForTypeConstructor tCons aTypes M.empty
936− aType <- lift $ except $ atomTypeForTypeConstructorValidate True tCons tConsMap M.empty
937− lift $ except $ validateAtomType aType tConsMap
938− pure $ Attribute attrName aType
857+ Right (Attribute attrName aType)
939
858
940−evalGraphRefAttrExpr (NakedAttributeExpr attr) = pure attr
859+evalAttrExpr _ (NakedAttributeExpr attr) = Right attr
941−
860+
942−-- for tuple type concrete resolution (Nothing ==> Maybe Int) when the attributes hint is Nothing, we need to first process all the tuples, then extract the concrete types on a per-attribute basis, then reprocess the tuples to include the concrete types
861+evalTupleExpr :: Maybe Attributes -> TupleExpr -> RelationalExprState (Either RelationalError RelationTuple)
943−evalGraphRefTupleExprs :: Maybe Attributes -> GraphRefTupleExprs -> GraphRefRelationalExprM [RelationTuple]
944−evalGraphRefTupleExprs _ (TupleExprs _ []) = pure []
945−evalGraphRefTupleExprs mAttrs (TupleExprs fixedMarker tupleExprL) = do
946− tuples <- mapM (evalGraphRefTupleExpr mAttrs) tupleExprL
947− finalAttrs <- case mAttrs of
948− Just attrs -> pure attrs
949− Nothing ->
950− case tuples of
951− [] -> pure emptyAttributes
952− (headTuple:tailTuples) -> do
953− --gather up resolved atom types or throw an error if an attribute cannot be made concrete from the inferred types- this could still fail if the type cannot be inferred (e.g. from [Nothing, Nothing])
954− let
955− processTupleAttrs (tupAttr, accAttr) =
956− --if the attribute is a constructedatomtype, we can recurse into it to potentially resolve type variables
957− if isResolvedAttribute accAttr && tupAttr == accAttr then
958− pure accAttr
959− else
960− lift $ except $ resolveAttributes accAttr tupAttr
961− mostResolvedTypes <-
962− foldM (\acc tup -> do
963− let zipped = zip (V.toList . attributesVec $ tupleAttributes tup) acc
964− accNames = S.fromList $ map A.attributeName acc
965− tupNames = A.attributeNameSet (tupleAttributes tup)
966− attrNamesDiff = S.union (S.difference accNames tupNames) (S.difference tupNames accNames)
967− unless (null attrNamesDiff) (throwError (AttributeNamesMismatchError attrNamesDiff))
968− nextTupleAttrs <- mapM processTupleAttrs zipped
969− let diff = A.attributesDifference (A.attributesFromList nextTupleAttrs) (A.attributesFromList acc)
970− if diff == A.emptyAttributes then
971− pure nextTupleAttrs
972− else
973− throwError (TupleAttributeTypeMismatchError diff)
974− ) (V.toList . attributesVec $ tupleAttributes headTuple) tailTuples
975− pure (A.attributesFromList mostResolvedTypes)
976− --strategy: if all the tuple expr transaction markers refer to one location, then we can pass the type constructor mapping from that location, otherwise, we cannot assume that the types are the same
977− tConsMap <- case singularTransactions tupleExprL of
978− SingularTransactionRef commonTransId ->
979− typeConstructorMapping <$> gfDatabaseContextForMarker commonTransId
980− NoTransactionsRef ->
981− typeConstructorMapping <$> gfDatabaseContextForMarker fixedMarker
982− -- if there are multiple transaction markers in the TupleExprs, then we can't assume a single type constructor mapping- this could be improved in the future, but if all the tuples are fully resolved, then we don't need further resolution
983− _ -> throwError TupleExprsReferenceMultipleMarkersError
984− lift $ except $ validateAttributes tConsMap finalAttrs
985− mapM (lift . except . resolveTypesInTuple finalAttrs tConsMap) tuples
986−
987−
988−--resolveAttributes (Attribute "gonk" (ConstructedAtomType "Either" (fromList [("a",IntegerAtomType),("b",TypeVariableType "b")]))) (Attribute "gonk" (ConstructedAtomType "Either" (fromList [("a",TypeVariableType "a"),("b",TextAtomType)])))
989−
990−evalGraphRefTupleExpr :: Maybe Attributes -> GraphRefTupleExpr -> GraphRefRelationalExprM RelationTuple
991−evalGraphRefTupleExpr mAttrs (TupleExpr tupMap) = do
862+evalTupleExpr attrs (TupleExpr tupMap) = do
863+ context <- fmap stateElemsContext ask
864+ runExceptT $ do
992 -- it's not possible for AtomExprs in tuple constructors to reference other Attributes' atoms due to the necessary order-of-operations (need a tuple to pass to evalAtomExpr)- it may be possible with some refactoring of type usage or delayed evaluation- needs more thought, but not a priority
865 -- it's not possible for AtomExprs in tuple constructors to reference other Attributes' atoms due to the necessary order-of-operations (need a tuple to pass to evalAtomExpr)- it may be possible with some refactoring of type usage or delayed evaluation- needs more thought, but not a priority
993 -- I could adjust this logic so that when the attributes are not specified (Nothing), then I can attempt to extract the attributes from the tuple- the type resolution will blow up if an ambiguous data constructor is used (Left 4) and this should allow simple cases to "relation{tuple{a 4}}" to be processed
866 -- I could adjust this logic so that when the attributes are not specified (Nothing), then I can attempt to extract the attributes from the tuple- the type resolution will blow up if an ambiguous data constructor is used (Left 4) and this should allow simple cases to "relation{tuple{a 4}}" to be processed
994− let attrs = fromMaybe A.emptyAttributes mAttrs
995− resolveOneAtom (attrName, aExpr) =
867+ attrAtoms <- mapM (\(attrName, aExpr) -> do
996− do
868+ newAtomType <- liftE (typeFromAtomExpr A.emptyAttributes aExpr)
997− --provided when the relation header is available
998− let eExpectedAtomType = A.atomTypeForAttributeName attrName attrs
999− unresolvedType <- typeForGraphRefAtomExpr attrs aExpr
1000− resolvedType <- case eExpectedAtomType of
1001− Left _ -> pure unresolvedType
1002− Right typeHint -> lift $ except $ resolveAtomType typeHint unresolvedType
1003− --resolve atom typevars based on resolvedType?
1004− newAtom <- evalGraphRefAtomExpr emptyTuple aExpr
869+ newAtom <- liftE (evalAtomExpr emptyTuple aExpr)
1005− pure (attrName, newAtom, resolvedType)
870+ pure (attrName, newAtom, newAtomType)
1006− attrAtoms <- mapM resolveOneAtom (M.toList tupMap)
871+ ) (M.toList tupMap)
1007− let tupAttrs = A.attributesFromList $ map (\(attrName, _, aType) -> Attribute attrName aType) attrAtoms
872+ let tupAttrs = A.attributesFromList $ map (\(attrName, _, aType) -> Attribute attrName aType) attrAtoms
1008− atoms = V.fromList $ map (\(_, atom, _) -> atom) attrAtoms
873+ atoms = V.fromList $ map (\(_, atom, _) -> atom) attrAtoms
1009− tup = mkRelationTuple tupAttrs atoms
874+ tup = mkRelationTuple tupAttrs atoms
875+ tConss = typeConstructorMapping context
1010− finalAttrs = fromMaybe tupAttrs mAttrs
876+ finalAttrs = fromMaybe tupAttrs attrs
1011 --verify that the attributes match
877 --verify that the attributes match
1012− when (A.attributeNameSet finalAttrs /= A.attributeNameSet tupAttrs) $ throwError (TupleAttributeTypeMismatchError tupAttrs)
878+ when (A.attributeNameSet finalAttrs /= A.attributeNameSet tupAttrs) $ throwE (TupleAttributeTypeMismatchError tupAttrs)
1013− --we can't resolve types here- they have to be resolved at the atom level where the graph ref is held
1014− --tup' <- lift $ except (resolveTypesInTuple finalAttrs tConss (reorderTuple finalAttrs tup))
879+ tup' <- either throwE pure (resolveTypesInTuple finalAttrs (reorderTuple finalAttrs tup))
1015− let tup' = reorderTuple finalAttrs tup
1016− --TODO: restore type resolution
1017−-- _ <- lift $ except (validateTuple tup' tConss)
880+ _ <- either throwE pure (validateTuple tup' tConss)
1018− pure tup'
881+ pure tup'
1019−
882+
1020−--temporary implementation until we have a proper planner+executor
883+evalAttributeNames :: AttributeNames -> RelationalExpr -> RelationalExprState (Either RelationalError (S.Set AttributeName))
1021−evalGraphRefRelationalExpr :: GraphRefRelationalExpr -> GraphRefRelationalExprM Relation
1022−evalGraphRefRelationalExpr (MakeRelationFromExprs mAttrExprs tupleExprs) = do
1023− mAttrs <- case mAttrExprs of
1024− Just _ ->
1025− Just . A.attributesFromList <$> mapM evalGraphRefAttrExpr (fromMaybe [] mAttrExprs)
1026− Nothing -> pure Nothing
1027− tuples <- evalGraphRefTupleExprs mAttrs tupleExprs
1028− let attrs = fromMaybe firstTupleAttrs mAttrs
1029− firstTupleAttrs = if null tuples then A.emptyAttributes else tupleAttributes (head tuples)
1030− lift $ except $ mkRelation attrs (RelationTupleSet tuples)
1031−evalGraphRefRelationalExpr (MakeStaticRelation attributeSet tupleSet) =
1032− lift $ except $ mkRelation attributeSet tupleSet
1033−evalGraphRefRelationalExpr (ExistingRelation rel) = pure rel
1034−evalGraphRefRelationalExpr (RelationVariable name tid) = do
1035− ctx <- gfDatabaseContextForMarker tid
1036− case M.lookup name (relationVariables ctx) of
1037− Nothing -> throwError (RelVarNotDefinedError name)
1038− Just rv -> evalGraphRefRelationalExpr rv
1039−evalGraphRefRelationalExpr (Project attrNames expr) = do
1040− attrNameSet <- evalGraphRefAttributeNames attrNames expr
1041− rel <- evalGraphRefRelationalExpr expr
1042− lift $ except $ project attrNameSet rel
1043−evalGraphRefRelationalExpr (Union exprA exprB) = do
1044− relA <- evalGraphRefRelationalExpr exprA
1045− relB <- evalGraphRefRelationalExpr exprB
1046− lift $ except $ union relA relB
1047−evalGraphRefRelationalExpr (Join exprA exprB) = do
1048− relA <- evalGraphRefRelationalExpr exprA
1049− relB <- evalGraphRefRelationalExpr exprB
1050− lift $ except $ join relA relB
1051−evalGraphRefRelationalExpr (Rename oldName newName expr) = do
1052− rel <- evalGraphRefRelationalExpr expr
1053− lift $ except $ rename oldName newName rel
1054−evalGraphRefRelationalExpr (Difference exprA exprB) = do
1055− relA <- evalGraphRefRelationalExpr exprA
1056− relB <- evalGraphRefRelationalExpr exprB
1057− lift $ except $ difference relA relB
1058−evalGraphRefRelationalExpr (Group groupAttrNames newAttrName expr) = do
1059− groupNames <- evalGraphRefAttributeNames groupAttrNames expr
1060− rel <- evalGraphRefRelationalExpr expr
1061− lift $ except $ group groupNames newAttrName rel
1062−evalGraphRefRelationalExpr (Ungroup groupAttrName expr) = do
1063− rel <- evalGraphRefRelationalExpr expr
1064− lift $ except $ ungroup groupAttrName rel
1065−evalGraphRefRelationalExpr (Restrict predExpr expr) = do
1066− rel <- evalGraphRefRelationalExpr expr
1067− filt <- predicateRestrictionFilter (attributes rel) predExpr
1068− lift $ except $ restrict filt rel
1069−evalGraphRefRelationalExpr (Equals exprA exprB) = do
1070− relA <- evalGraphRefRelationalExpr exprA
1071− relB <- evalGraphRefRelationalExpr exprB
1072− pure $ if relA == relB then relationTrue else relationFalse
1073−evalGraphRefRelationalExpr (NotEquals exprA exprB) = do
1074− relA <- evalGraphRefRelationalExpr exprA
1075− relB <- evalGraphRefRelationalExpr exprB
1076− pure $ if relA == relB then relationFalse else relationTrue
1077−evalGraphRefRelationalExpr (Extend extendTupleExpr expr) = do
1078− rel <- evalGraphRefRelationalExpr expr
1079− (newAttrs, tupProc) <- extendGraphRefTupleExpressionProcessor rel extendTupleExpr
1080− lift $ except $ relMogrify tupProc newAttrs rel
1081−evalGraphRefRelationalExpr expr@With{} =
1082− --strategy A: add relation variables to the contexts in the graph
1083− --strategy B: drop in macros in place (easier programmatically)
1084− --strategy B implementation
1085− evalGraphRefRelationalExpr (substituteWithNameMacros [] expr)
1086−
1087−dbContextForTransId :: TransactionId -> TransactionGraph -> Either RelationalError DatabaseContext
1088−dbContextForTransId tid graph = do
1089− trans <- transactionForId tid graph
1090− pure (concreteDatabaseContext trans)
1091−
1092−transactionForId :: TransactionId -> TransactionGraph -> Either RelationalError Transaction
1093−transactionForId tid graph
1094− | tid == U.nil =
1095− Left RootTransactionTraversalError
1096− | S.null matchingTrans =
1097− Left $ NoSuchTransactionError tid
1098− | otherwise =
1099− Right $ head (S.toList matchingTrans)
1100− where
1101− matchingTrans = S.filter (\(Transaction idMatch _ _) -> idMatch == tid) (transactionsForGraph graph)
1102−
1103−typeForGraphRefRelationalExpr :: GraphRefRelationalExpr -> GraphRefRelationalExprM Relation
1104−typeForGraphRefRelationalExpr (MakeStaticRelation attrs _) = lift $ except $ mkRelation attrs emptyTupleSet
1105−typeForGraphRefRelationalExpr (ExistingRelation rel) = pure (emptyRelationWithAttrs (attributes rel))
1106−typeForGraphRefRelationalExpr (MakeRelationFromExprs mAttrExprs tupleExprs) = do
1107− mAttrs <- case mAttrExprs of
1108− Just attrExprs -> do
1109− attrs <- mapM evalGraphRefAttributeExpr attrExprs
1110− pure (Just (attributesFromList attrs))
1111− Nothing -> pure Nothing
1112− tuples <- evalGraphRefTupleExprs mAttrs tupleExprs
1113− let retAttrs = case tuples of
1114− (tup:_) -> tupleAttributes tup
1115− [] -> fromMaybe A.emptyAttributes mAttrs
1116− pure $ emptyRelationWithAttrs retAttrs
1117−
1118−typeForGraphRefRelationalExpr (RelationVariable rvName tid) = do
1119− relVars <- relationVariables <$> gfDatabaseContextForMarker tid
1120− case M.lookup rvName relVars of
1121− Nothing -> throwError (RelVarNotDefinedError rvName)
1122− Just rvExpr ->
1123− typeForGraphRefRelationalExpr rvExpr
1124−typeForGraphRefRelationalExpr (Project attrNames expr) = do
1125− exprType' <- typeForGraphRefRelationalExpr expr
1126− projectionAttrs <- evalGraphRefAttributeNames attrNames expr
1127− lift $ except $ project projectionAttrs exprType'
1128−typeForGraphRefRelationalExpr (Union exprA exprB) = do
1129− exprA' <- typeForGraphRefRelationalExpr exprA
1130− exprB' <- typeForGraphRefRelationalExpr exprB
1131− lift $ except $ union exprA' exprB'
1132−typeForGraphRefRelationalExpr (Join exprA exprB) = do
1133− exprA' <- typeForGraphRefRelationalExpr exprA
1134− exprB' <- typeForGraphRefRelationalExpr exprB
1135− lift $ except $ join exprA' exprB'
1136−typeForGraphRefRelationalExpr (Rename oldAttr newAttr expr) = do
1137− expr' <- typeForGraphRefRelationalExpr expr
1138− lift $ except $ rename oldAttr newAttr expr'
1139−typeForGraphRefRelationalExpr (Difference exprA exprB) = do
1140− exprA' <- typeForGraphRefRelationalExpr exprA
1141− exprB' <- typeForGraphRefRelationalExpr exprB
1142− lift $ except $ difference exprA' exprB'
1143−typeForGraphRefRelationalExpr (Group groupNames attrName expr) = do
1144− expr' <- typeForGraphRefRelationalExpr expr
1145− groupNames' <- evalGraphRefAttributeNames groupNames expr
1146− lift $ except $ group groupNames' attrName expr'
1147−typeForGraphRefRelationalExpr (Ungroup groupAttrName expr) = do
1148− expr' <- typeForGraphRefRelationalExpr expr
1149− lift $ except $ ungroup groupAttrName expr'
1150−typeForGraphRefRelationalExpr (Restrict pred' expr) = do
1151− expr' <- typeForGraphRefRelationalExpr expr
1152− filt <- predicateRestrictionFilter (attributes expr') pred'
1153− lift $ except $ restrict filt expr'
1154−typeForGraphRefRelationalExpr Equals{} =
1155− pure relationFalse
1156−typeForGraphRefRelationalExpr NotEquals{} =
1157− pure relationFalse
1158−typeForGraphRefRelationalExpr (Extend extendTupleExpr expr) = do
1159− rel <- typeForGraphRefRelationalExpr expr
1160− evalGraphRefRelationalExpr (Extend extendTupleExpr (ExistingRelation rel))
1161−typeForGraphRefRelationalExpr expr@(With withs _) = do
1162− let expr' = substituteWithNameMacros [] expr
1163− checkMacroName (WithNameExpr macroName tid) = do
1164− rvs <- relationVariables <$> gfDatabaseContextForMarker tid
1165− case M.lookup macroName rvs of
1166− Just _ -> lift $ except $ Left (RelVarAlreadyDefinedError macroName) --this error does not include the transaction marker, but should be good enough to identify the cause
1167− Nothing -> pure ()
1168− mapM_ (checkMacroName . fst) withs
1169− typeForGraphRefRelationalExpr expr'
1170−
1171−evalGraphRefAttributeNames :: GraphRefAttributeNames -> GraphRefRelationalExpr -> GraphRefRelationalExprM (S.Set AttributeName)
1172−evalGraphRefAttributeNames attrNames expr = do
884+evalAttributeNames attrNames expr = do
1173− exprType' <- typeForGraphRefRelationalExpr expr
885+ eExprType <- typeForRelationalExpr expr
886+ case eExprType of
887+ Left err -> pure (Left err)
888+ Right exprTyp -> do
1174− let typeNameSet = S.fromList (V.toList (A.attributeNames (attributes exprType')))
889+ let typeNameSet = S.fromList (V.toList (A.attributeNames (attributes exprTyp)))
1175− case attrNames of
890+ case attrNames of
1176− AttributeNames names ->
891+ AttributeNames names ->
1177− case A.projectionAttributesForNames names (attributes exprType') of
892+ case A.projectionAttributesForNames names (attributes exprTyp) of
1178− Left err -> throwError err
893+ Left err -> pure (Left err)
1179− Right attrs -> pure (S.fromList (V.toList (A.attributeNames attrs)))
894+ Right attrs -> pure (Right (S.fromList (V.toList (A.attributeNames attrs))))
1180
895
1181− InvertedAttributeNames names -> do
896+ InvertedAttributeNames names -> do
1182 let nonExistentAttributeNames = A.attributeNamesNotContained names typeNameSet
897 let nonExistentAttributeNames = A.attributeNamesNotContained names typeNameSet
1183 if not (S.null nonExistentAttributeNames) then
898 if not (S.null nonExistentAttributeNames) then
1184− throwError $ AttributeNamesMismatchError nonExistentAttributeNames
899+ pure (Left (AttributeNamesMismatchError nonExistentAttributeNames))
1185 else
900 else
1186− pure (A.nonMatchingAttributeNameSet names typeNameSet)
901+ pure (Right (A.nonMatchingAttributeNameSet names typeNameSet))
1187
902
1188− UnionAttributeNames namesA namesB -> do
903+ UnionAttributeNames namesA namesB -> do
1189− nameSetA <- evalGraphRefAttributeNames namesA expr
904+ eNameSetA <- evalAttributeNames namesA expr
1190− nameSetB <- evalGraphRefAttributeNames namesB expr
905+ case eNameSetA of
906+ Left err -> pure (Left err)
907+ Right nameSetA -> do
908+ eNameSetB <- evalAttributeNames namesB expr
909+ case eNameSetB of
910+ Left err -> pure (Left err)
911+ Right nameSetB ->
1191− pure (S.union nameSetA nameSetB)
912+ pure (Right (S.union nameSetA nameSetB))
1192
913
1193− IntersectAttributeNames namesA namesB -> do
914+ IntersectAttributeNames namesA namesB -> do
1194− nameSetA <- evalGraphRefAttributeNames namesA expr
915+ eNameSetA <- evalAttributeNames namesA expr
1195− nameSetB <- evalGraphRefAttributeNames namesB expr
916+ case eNameSetA of
917+ Left err -> pure (Left err)
918+ Right nameSetA -> do
919+ eNameSetB <- evalAttributeNames namesB expr
920+ case eNameSetB of
921+ Left err -> pure (Left err)
922+ Right nameSetB ->
1196− pure (S.intersection nameSetA nameSetB)
923+ pure (Right (S.intersection nameSetA nameSetB))
1197
924
1198− RelationalExprAttributeNames attrExpr -> do
925+ RelationalExprAttributeNames attrExpr -> do
1199− attrExprType <- typeForGraphRefRelationalExpr attrExpr
926+ eAttrExprType <- typeForRelationalExpr attrExpr
927+ case eAttrExprType of
928+ Left err -> pure (Left err)
1200− pure (A.attributeNameSet (attributes attrExprType))
929+ Right attrExprType -> pure (Right (A.attributeNameSet (attributes attrExprType)))
1201−
930+
1202−evalGraphRefAttributeExpr :: GraphRefAttributeExpr -> GraphRefRelationalExprM Attribute
1203−evalGraphRefAttributeExpr (AttributeAndTypeNameExpr attrName tCons tid) = do
1204− tConsMap <- typeConstructorMapping <$> gfDatabaseContextForMarker tid
1205− case atomTypeForTypeConstructorValidate True tCons tConsMap M.empty of
1206− Left err -> throwError err
1207− Right aType -> do
1208− case validateAtomType aType tConsMap of
1209− Left err -> throwError err
1210− Right _ -> pure (Attribute attrName aType)
1211−evalGraphRefAttributeExpr (NakedAttributeExpr attr) = pure attr
1212−
1213−mkEmptyRelVars :: RelationVariables -> RelationVariables
1214−mkEmptyRelVars = M.map mkEmptyRelVar
1215− where
1216− mkEmptyRelVar expr@MakeRelationFromExprs{} = expr --do not truncate here because we might lose essential type information in emptying the tuples
1217− mkEmptyRelVar (MakeStaticRelation attrs _) = MakeStaticRelation attrs emptyTupleSet
1218− mkEmptyRelVar (ExistingRelation rel) = ExistingRelation (emptyRelationWithAttrs (attributes rel))
1219− mkEmptyRelVar rv@RelationVariable{} = Restrict (NotPredicate TruePredicate) rv
1220− mkEmptyRelVar (Project attrNames expr) = Project attrNames (mkEmptyRelVar expr)
1221− mkEmptyRelVar (Union exprA exprB) = Union (mkEmptyRelVar exprA) (mkEmptyRelVar exprB)
1222− mkEmptyRelVar (Join exprA exprB) = Join (mkEmptyRelVar exprA) (mkEmptyRelVar exprB)
1223− mkEmptyRelVar (Rename nameA nameB expr) = Rename nameA nameB (mkEmptyRelVar expr)
1224− mkEmptyRelVar (Difference exprA exprB) = Difference (mkEmptyRelVar exprA) (mkEmptyRelVar exprB)
1225− mkEmptyRelVar (Group attrNames attrName expr) = Group attrNames attrName (mkEmptyRelVar expr)
1226− mkEmptyRelVar (Ungroup attrName expr) = Ungroup attrName (mkEmptyRelVar expr)
1227− mkEmptyRelVar (Restrict pred' expr) = Restrict pred' (mkEmptyRelVar expr)
1228− mkEmptyRelVar (Equals exprA exprB) = Equals (mkEmptyRelVar exprA) (mkEmptyRelVar exprB)
1229− mkEmptyRelVar (NotEquals exprA exprB) = NotEquals (mkEmptyRelVar exprA) (mkEmptyRelVar exprB)
1230− mkEmptyRelVar (Extend extTuple expr) = Extend extTuple (mkEmptyRelVar expr)
1231− mkEmptyRelVar (With macros expr) = With (map (second mkEmptyRelVar) macros) (mkEmptyRelVar expr)
1232−
1233−
1234−dbErr :: RelationalError -> DatabaseContextEvalMonad ()
1235−dbErr err = lift (except (Left err))
1236−
1237−-- | Return a Relation describing the relation variables.
1238−relationVariablesAsRelation :: DatabaseContext -> TransactionGraph -> Either RelationalError Relation
1239−relationVariablesAsRelation ctx graph = do
1240− let subrelAttrs = A.attributesFromList [Attribute "attribute" TextAtomType, Attribute "type" TextAtomType]
1241− attrs = A.attributesFromList [Attribute "name" TextAtomType,
1242− Attribute "attributes" (RelationAtomType subrelAttrs)]
1243− relVars = relationVariables ctx
1244− mkRvDesc (rvName, gfExpr) = do
1245− let gfEnv = freshGraphRefRelationalExprEnv (Just ctx) graph
1246− gfType <- runGraphRefRelationalExprM gfEnv (typeForGraphRefRelationalExpr gfExpr)
1247− pure (rvName, gfType)
1248− relVarToAtomList (rvName, rel) = [TextAtom rvName, attributesToRel (attributesVec (attributes rel))]
1249− attrAtoms a = [TextAtom (A.attributeName a), TextAtom (prettyAtomType (A.atomType a))]
1250− attributesToRel attrl = case mkRelationFromList subrelAttrs (map attrAtoms (V.toList attrl)) of
1251− Left err -> error ("relationVariablesAsRelation pooped " ++ show err)
1252− Right rel -> RelationAtom rel
1253− rvs <- mapM mkRvDesc (M.toList relVars)
1254− let tups = map relVarToAtomList rvs
1255− mkRelationFromList attrs tups
1256−
1257−-- | An unoptimized variant of evalGraphRefRelationalExpr for testing.
1258−evalRelationalExpr :: RelationalExpr -> RelationalExprM Relation
1259−evalRelationalExpr expr = do
1260− graph <- reGraph
1261− context <- reContext
1262− let expr' = runProcessExprM UncommittedContextMarker (processRelationalExpr expr)
1263− gfEnv = freshGraphRefRelationalExprEnv (Just context) graph
1264− case runGraphRefRelationalExprM gfEnv (evalGraphRefRelationalExpr expr') of
1265− Left err -> throwError err
1266− Right rel -> pure rel
1267−
1268−class (MonadError RelationalError m, Monad m) => DatabaseContextM m where
1269− getContext :: m DatabaseContext
1270−
1271−instance DatabaseContextM (ReaderT GraphRefRelationalExprEnv (ExceptT RelationalError Identity)) where
1272− getContext = gfDatabaseContextForMarker UncommittedContextMarker
1273−
1274−instance DatabaseContextM (RWST DatabaseContextEvalEnv () DatabaseContextEvalState (ExceptT RelationalError Identity)) where
1275− getContext = getStateContext
1276−
1277−relVarByName :: DatabaseContextM m => RelVarName -> m GraphRefRelationalExpr
1278−relVarByName rvName = do
1279− relvars <- relationVariables <$> getContext
1280− case M.lookup rvName relvars of
1281− Nothing -> throwError (RelVarNotDefinedError rvName)
1282− Just gfexpr -> pure gfexpr
1283−
1284−-- | resolve UncommittedTransactionMarker whenever possible- this is important in the DatabaseContext in order to mitigate self-referencing loops for updates
1285−class ResolveGraphRefTransactionMarker a where
1286− resolve :: a -> DatabaseContextEvalMonad a
1287−
1288−-- s := s union t
1289−instance ResolveGraphRefTransactionMarker GraphRefRelationalExpr where
1290− resolve (MakeRelationFromExprs mAttrs tupleExprs) =
1291− MakeRelationFromExprs mAttrs <$> resolve tupleExprs
1292− resolve orig@MakeStaticRelation{} = pure orig
1293− resolve orig@ExistingRelation{} = pure orig
1294− resolve orig@(RelationVariable rvName UncommittedContextMarker) = do
1295− rvMap <- relationVariables <$> getStateContext
1296− case M.lookup rvName rvMap of
1297− Nothing -> pure orig
1298− Just resolvedRv -> resolve resolvedRv
1299− resolve orig@RelationVariable{} = pure orig
1300− resolve (Project attrNames relExpr) = Project <$> resolve attrNames <*> resolve relExpr
1301− resolve (Union exprA exprB) = Union <$> resolve exprA <*> resolve exprB
1302− resolve (Join exprA exprB) = Join <$> resolve exprA <*> resolve exprB
1303− resolve (Rename attrA attrB expr) = Rename attrA attrB <$> resolve expr
1304− resolve (Difference exprA exprB) = Difference <$> resolve exprA <*> resolve exprB
1305− resolve (Group namesA nameB expr) = Group <$> resolve namesA <*> pure nameB <*> resolve expr
1306− resolve (Ungroup nameA expr) = Ungroup nameA <$> resolve expr
1307− resolve (Restrict restrictExpr relExpr) = Restrict <$> resolve restrictExpr <*> resolve relExpr
1308− resolve (Equals exprA exprB) = Equals <$> resolve exprA <*> resolve exprB
1309− resolve (NotEquals exprA exprB) = NotEquals <$> resolve exprA <*> resolve exprB
1310− resolve (Extend extendExpr relExpr) = Extend <$> resolve extendExpr <*> resolve relExpr
1311− resolve (With withExprs relExpr) = With <$> mapM (\(nam, expr) -> (,) <$> resolve nam <*> resolve expr) withExprs <*> resolve relExpr
1312−
1313−instance ResolveGraphRefTransactionMarker GraphRefTupleExprs where
1314− resolve (TupleExprs marker tupleExprs) =
1315− TupleExprs marker <$> mapM resolve tupleExprs
1316−
1317−instance ResolveGraphRefTransactionMarker GraphRefTupleExpr where
1318− resolve (TupleExpr tupMap) = do
1319− tupMap' <- mapM (\(attrName, expr) -> (,) attrName <$> resolve expr ) (M.toList tupMap)
1320− pure (TupleExpr (M.fromList tupMap'))
1321−
1322−instance ResolveGraphRefTransactionMarker GraphRefAttributeNames where
1323− resolve orig@AttributeNames{} = pure orig
1324− resolve orig@InvertedAttributeNames{} = pure orig
1325− resolve (UnionAttributeNames namesA namesB) = UnionAttributeNames <$> resolve namesA <*> resolve namesB
1326− resolve (IntersectAttributeNames namesA namesB) = IntersectAttributeNames <$> resolve namesA <*> resolve namesB
1327− resolve (RelationalExprAttributeNames expr) = RelationalExprAttributeNames <$> resolve expr
1328−
1329−instance ResolveGraphRefTransactionMarker GraphRefRestrictionPredicateExpr where
1330− resolve TruePredicate = pure TruePredicate
1331− resolve (AndPredicate exprA exprB) = AndPredicate <$> resolve exprA <*> resolve exprB
1332− resolve (OrPredicate exprA exprB) = OrPredicate <$> resolve exprA <*> resolve exprB
1333− resolve (NotPredicate expr) = NotPredicate <$> resolve expr
1334− resolve (RelationalExprPredicate expr) = RelationalExprPredicate <$> resolve expr
1335− resolve (AtomExprPredicate expr) = AtomExprPredicate <$> resolve expr
1336− resolve (AttributeEqualityPredicate nam expr)= AttributeEqualityPredicate nam <$> resolve expr
1337−
1338−instance ResolveGraphRefTransactionMarker GraphRefExtendTupleExpr where
1339− resolve (AttributeExtendTupleExpr nam atomExpr) = AttributeExtendTupleExpr nam <$> resolve atomExpr
1340−
1341−instance ResolveGraphRefTransactionMarker GraphRefWithNameExpr where
1342− resolve orig@WithNameExpr{} = pure orig -- match uncommitted marker?
1343−
1344−instance ResolveGraphRefTransactionMarker GraphRefAtomExpr where
1345− resolve orig@AttributeAtomExpr{} = pure orig
1346− resolve orig@NakedAtomExpr{} = pure orig
1347− resolve (FunctionAtomExpr nam atomExprs marker) =
1348− FunctionAtomExpr nam <$> mapM resolve atomExprs <*> pure marker
1349− resolve (RelationAtomExpr expr) = RelationAtomExpr <$> resolve expr
1350− resolve (ConstructedAtomExpr dConsName atomExprs marker) =
1351− ConstructedAtomExpr dConsName <$> mapM resolve atomExprs <*> pure marker
1352−
1353−--convert series of simple Union queries into MakeStaticRelation
1354−-- this is especially useful for long, nested applications of Union with simple tuples
1355−-- Union (MakeRelation x y) (MakeRelation x y') -> MakeRelation x (y + y')
1356−
1357−--MakeRelationFromExprs Nothing (TupleExprs UncommittedContextMarker [TupleExpr (fromList [("name", NakedAtomExpr (TextAtom "steve"))])])
1358−
1359−applyUnionCollapse :: GraphRefRelationalExpr -> GraphRefRelationalExpr
1360−applyUnionCollapse = Fold.cata opt
1361− where
1362− opt :: RelationalExprBaseF GraphRefTransactionMarker GraphRefRelationalExpr -> GraphRefRelationalExpr
1363− opt (UnionF exprA exprB) | exprA == exprB = exprA
1364− opt (UnionF
1365− exprA@(MakeRelationFromExprs mAttrs1 tupExprs1)
1366− exprB@(MakeRelationFromExprs mAttrs2 tupExprs2)) | tupExprs1 == tupExprs2 = MakeRelationFromExprs (mAttrs1 <|> mAttrs2) tupExprs1
1367− | tupExprsNull tupExprs1 = exprB
1368− | tupExprsNull tupExprs2 = exprA
1369− opt x = Fold.embed x
1370− tupExprsNull (TupleExprs _ []) = True
1371− tupExprsNull _ = False
1372−
1373−
1374−--UPDATE optimization- find matching where clause in "lower" levels of renaming
1375−--update x where y=1 set (x:=5,z:=10); update x where y=1 set(x:=6,z:=11)
1376−-- =>
1377−-- update x where y=1 set (x:=6,z:=11)
1378−-- future opt: match individual attributes update x where y=1 set (x:=5); update x where y=1 set (z:=11) => update x where y=1 set (x:=5,z:=11)
1379−
1380−--strategy: try to collapse the top-level update (union (restrict pred MakeRelationFromExpr) expr) if it contains the same predicate and resultant relation
1381−
1382−--DELETE optimization
1383−-- if a restriction matches a previous restriction, combine them
1384−-- O(1) since it only scans at the top level, critical in benchmarks generating redundant deletions
1385−applyRestrictionCollapse :: GraphRefRelationalExpr -> GraphRefRelationalExpr
1386−applyRestrictionCollapse orig@(Restrict npred@(NotPredicate _) expr) =
1387− case expr of
1388− orig'@(Restrict npred'@(NotPredicate _) _) | npred == npred' -> orig'
1389− _ -> orig
1390−applyRestrictionCollapse expr = expr
1391
931
1392−
src/lib/ProjectM36/ScriptSession.hs+31−132
@@ -1,12 +1,7 @@
1−{-# LANGUAGE UnboxedTuples, KindSignatures, DataKinds #-}
2−#ifdef PM36_HASKELL_SCRIPTING
3−{-# LANGUAGE MagicHash #-}
4−#endif
5module ProjectM36.ScriptSession where
1module ProjectM36.ScriptSession where
6
2
7−#ifdef PM36_HASKELL_SCRIPTING
8import ProjectM36.Error
3import ProjectM36.Error
9−import GHC
4+
10import Control.Exception
5import Control.Exception
11import Control.Monad
6import Control.Monad
12import System.IO.Error
7import System.IO.Error
@@ -14,63 +9,32 @@ import System.Directory
14import Control.Monad.IO.Class
9import Control.Monad.IO.Class
15import System.FilePath.Glob
10import System.FilePath.Glob
16import System.FilePath
11import System.FilePath
17−import System.Info (os, arch)
18import Data.Text (Text, unpack)
12import Data.Text (Text, unpack)
19import Data.Maybe
13import Data.Maybe
14+
15+import GHC
20import GHC.Paths (libdir)
16import GHC.Paths (libdir)
21−import System.Environment
22#if __GLASGOW_HASKELL__ >= 800
17#if __GLASGOW_HASKELL__ >= 800
23import GHC.LanguageExtensions
18import GHC.LanguageExtensions
24−import GHCi.ObjLink
25−#else
26−import ObjLink
27−#endif
28−#if __GLASGOW_HASKELL__ >= 802
29−import BasicTypes
30#endif
19#endif
31import DynFlags
20import DynFlags
32import Panic
21import Panic
33import Outputable --hiding ((<>))
22import Outputable --hiding ((<>))
34import PprTyThing
23import PprTyThing
35import Unsafe.Coerce
24import Unsafe.Coerce
36−#if __GLASGOW_HASKELL__ >= 802
37import Type
25import Type
38−#elif __GLASGOW_HASKELL__ >= 710
39−import Type hiding (pprTyThing)
40−#else
41−#endif
42−import GHC.Exts (addrToAny#)
43−import GHC.Ptr (Ptr(..))
44−import Encoding
45−#endif
46−
47
26
48data ScriptSession = ScriptSession {
27data ScriptSession = ScriptSession {
49−#ifdef PM36_HASKELL_SCRIPTING
50− hscEnv :: HscEnv,
28+ hscEnv :: HscEnv,
51 atomFunctionBodyType :: Type,
29 atomFunctionBodyType :: Type,
52 dbcFunctionBodyType :: Type
30 dbcFunctionBodyType :: Type
53−#endif
54 }
31 }
55−
32+
56−#ifdef PM36_HASKELL_SCRIPTING
57−data ScriptSessionError = ScriptSessionLoadError GhcException
33+newtype ScriptSessionError = ScriptSessionLoadError GhcException
58− | ScriptingDisabled
59 deriving (Show)
34 deriving (Show)
60−#else
61−data ScriptSessionError = ScriptingDisabled
62− deriving (Show)
63−#endif
64−
65−data LoadSymbolError = LoadSymbolError
66−type ModName = String
67−type FuncName = String
68
35
69-- | Configure a GHC environment/session which we will use for all script compilation.
36-- | Configure a GHC environment/session which we will use for all script compilation.
70initScriptSession :: [String] -> IO (Either ScriptSessionError ScriptSession)
37initScriptSession :: [String] -> IO (Either ScriptSessionError ScriptSession)
71−#if !defined(PM36_HASKELL_SCRIPTING)
72−initScriptSession _ = pure (Left ScriptingDisabled)
73−#else
74initScriptSession ghcPkgPaths = do
38initScriptSession ghcPkgPaths = do
75 --for the sake of convenience, for developers' builds, include the local cabal sandbox package database and the cabal new-build package database
39 --for the sake of convenience, for developers' builds, include the local cabal sandbox package database and the cabal new-build package database
76 eHomeDir <- tryJust (guard . isDoesNotExistError) getHomeDirectory
40 eHomeDir <- tryJust (guard . isDoesNotExistError) getHomeDirectory
@@ -79,47 +43,36 @@ initScriptSession ghcPkgPaths = do
79 handleGhcException excHandler $ runGhc (Just libdir) $ do
43 handleGhcException excHandler $ runGhc (Just libdir) $ do
80 dflags <- getSessionDynFlags
44 dflags <- getSessionDynFlags
81 let ghcVersion = projectVersion dflags
45 let ghcVersion = projectVersion dflags
82− -- get nix packages dir, if available
83− mNixLibDir <- liftIO $ lookupEnv "NIX_GHC_LIBDIR"
84
46
85 sandboxPkgPaths <- liftIO $ concat <$> mapM glob [
47 sandboxPkgPaths <- liftIO $ concat <$> mapM glob [
86− --"./dist-newstyle/packagedb/ghc-" ++ ghcVersion, --rely on cabal 3's ghc.environment install: "cabal install --lib project-m36"
48+ "./dist-newstyle/packagedb/ghc-" ++ ghcVersion,
87− ".cabal-sandbox/*ghc-" ++ ghcVersion ++ "-packages.conf.d",
49+ ".cabal-sandbox/*ghc-" ++ ghcVersion ++ "-packages.conf.d",
88− ".stack-work/install/*/*/" ++ ghcVersion ++ "/pkgdb",
89− ".stack-work/install/*/pkgdb/", --windows stack build
90− "C:/sr/snapshots/b201cfe6/pkgdb", --windows stack build- ideally, we could run `stack path --snapshot-pkg-db, but this is sufficient to pass CI
91− homeDir </> ".stack/snapshots/*/*/" ++ ghcVersion ++ "/pkgdb"
92− --homeDir </> ".cabal/store/ghc-" ++ ghcVersion ++ "/package.db"
50+ homeDir </> ".cabal/store/ghc-" ++ ghcVersion ++ "/package.db"
93 ]
51 ]
94−
52+
95− let localPkgPaths = map PkgConfFile (ghcPkgPaths ++ sandboxPkgPaths ++ maybeToList mNixLibDir)
53+ let localPkgPaths = map PkgConfFile (ghcPkgPaths ++ sandboxPkgPaths)
96−
54+
97− let dflags' = applyGopts . applyXopts $ dflags { hscTarget = HscInterpreted ,
55+ let dflags' = applyGopts . applyXopts $ dflags { hscTarget = HscInterpreted ,
98− ghcLink = LinkInMemory,
56+ ghcLink = LinkInMemory,
99 safeHaskell = Sf_Trustworthy,
57 safeHaskell = Sf_Trustworthy,
100 safeInfer = True,
58 safeInfer = True,
101 safeInferred = True,
59 safeInferred = True,
102 --verbosity = 3,
60 --verbosity = 3,
103−#if __GLASGOW_HASKELL__ >= 800
61+#if __GLASGOW_HASKELL__ >= 800
104 trustFlags = map TrustPackage required_packages,
62 trustFlags = map TrustPackage required_packages,
105−#endif
63+#endif
106 packageFlags = packageFlags dflags ++ packages,
64 packageFlags = packageFlags dflags ++ packages,
107−#if __GLASGOW_HASKELL__ >= 802
108− packageDBFlags = map PackageDB localPkgPaths
109−#else
110 extraPkgConfs = const (localPkgPaths ++ [UserPkgConf, GlobalPkgConf])
65 extraPkgConfs = const (localPkgPaths ++ [UserPkgConf, GlobalPkgConf])
111−#endif
112−
113 }
66 }
114 applyGopts flags = foldl gopt_set flags gopts
67 applyGopts flags = foldl gopt_set flags gopts
115 applyXopts flags = foldl xopt_set flags xopts
68 applyXopts flags = foldl xopt_set flags xopts
116#if __GLASGOW_HASKELL__ >= 800
69#if __GLASGOW_HASKELL__ >= 800
117 xopts = [OverloadedStrings, ExtendedDefaultRules, ImplicitPrelude, ScopedTypeVariables]
70 xopts = [OverloadedStrings, ExtendedDefaultRules, ImplicitPrelude, ScopedTypeVariables]
118−#else
71+#else
119 xopts = [Opt_OverloadedStrings, Opt_ExtendedDefaultRules, Opt_ImplicitPrelude, Opt_ScopedTypeVariables]
72 xopts = [Opt_OverloadedStrings, Opt_ExtendedDefaultRules, Opt_ImplicitPrelude, Opt_ScopedTypeVariables]
120#endif
73#endif
121 gopts = [] --[Opt_DistrustAllPackages, Opt_PackageTrust]
74 gopts = [] --[Opt_DistrustAllPackages, Opt_PackageTrust]
122− required_packages = ["base",
75+ required_packages = ["base",
123 "containers",
76 "containers",
124 "Glob",
77 "Glob",
125 "directory",
78 "directory",
@@ -128,6 +81,8 @@ initScriptSession ghcPkgPaths = do
128 "uuid",
81 "uuid",
129 "vector",
82 "vector",
130 "text",
83 "text",
84+ "binary",
85+ "vector-binary-instances",
131 "time",
86 "time",
132 "project-m36",
87 "project-m36",
133 "bytestring"]
88 "bytestring"]
@@ -139,33 +94,16 @@ initScriptSession ghcPkgPaths = do
139 --liftIO $ traceShowM (showSDoc dflags' (ppr packages))
94 --liftIO $ traceShowM (showSDoc dflags' (ppr packages))
140 _ <- setSessionDynFlags dflags'
95 _ <- setSessionDynFlags dflags'
141 let safeImportDecl mn mQual = ImportDecl {
96 let safeImportDecl mn mQual = ImportDecl {
142−#if __GLASGOW_HASKELL__ >= 802
143− ideclSourceSrc = NoSourceText,
144−#else
145 ideclSourceSrc = Nothing,
97 ideclSourceSrc = Nothing,
146−#endif
147−
148−#if __GLASGOW_HASKELL__ >= 810
149− ideclExt = noExtField,
150−#elif __GLASGOW_HASKELL__ >= 806
151− ideclExt = NoExt,
152−#endif
153 ideclName = noLoc mn,
98 ideclName = noLoc mn,
154 ideclPkgQual = Nothing,
99 ideclPkgQual = Nothing,
155 ideclSource = False,
100 ideclSource = False,
156 ideclSafe = True,
101 ideclSafe = True,
157 ideclImplicit = False,
102 ideclImplicit = False,
158−#if __GLASGOW_HASKELL__ >= 810
159− ideclQualified = if isJust mQual then QualifiedPre else NotQualified,
160−#else
161 ideclQualified = isJust mQual,
103 ideclQualified = isJust mQual,
162−#endif
163 ideclAs = mQual,
104 ideclAs = mQual,
164 ideclHiding = Nothing
105 ideclHiding = Nothing
165 }
106 }
166−#if __GLASGOW_HASKELL__ >= 806
167− :: ImportDecl (GhcPass (c :: Pass))
168−#endif
169 unqualifiedModules = map (\modn -> IIDecl $ safeImportDecl (mkModuleName modn) Nothing) [
107 unqualifiedModules = map (\modn -> IIDecl $ safeImportDecl (mkModuleName modn) Nothing) [
170 "Prelude",
108 "Prelude",
171 "Data.Map",
109 "Data.Map",
@@ -178,12 +116,7 @@ initScriptSession ghcPkgPaths = do
178 "ProjectM36.DatabaseContextFunctionError",
116 "ProjectM36.DatabaseContextFunctionError",
179 "ProjectM36.DatabaseContextFunctionUtils",
117 "ProjectM36.DatabaseContextFunctionUtils",
180 "ProjectM36.RelationalExpression"]
118 "ProjectM36.RelationalExpression"]
181−#if __GLASGOW_HASKELL__ >= 802
182− mkModName = noLoc . mkModuleName
183−#else
184− mkModName = mkModuleName
185−#endif
186− qualifiedModules = map (\(modn, qualNam) -> IIDecl $ safeImportDecl (mkModuleName modn) (Just (mkModName qualNam))) [
119+ qualifiedModules = map (\(modn, qualNam) -> IIDecl $ safeImportDecl (mkModuleName modn) (Just (mkModuleName qualNam))) [
187 ("Data.Text", "T")
120 ("Data.Text", "T")
188 ]
121 ]
189 setContext (unqualifiedModules ++ qualifiedModules)
122 setContext (unqualifiedModules ++ qualifiedModules)
@@ -195,8 +128,8 @@ initScriptSession ghcPkgPaths = do
195addImport :: String -> Ghc ()
128addImport :: String -> Ghc ()
196addImport moduleNam = do
129addImport moduleNam = do
197 ctx <- getContext
130 ctx <- getContext
198− setContext (IIDecl (simpleImportDecl (mkModuleName moduleNam)) : ctx)
131+ setContext ( (IIDecl $ simpleImportDecl (mkModuleName moduleNam)) : ctx )
199−
132+
200showType :: DynFlags -> Type -> String
133showType :: DynFlags -> Type -> String
201showType dflags ty = showSDocForUser dflags alwaysQualify (pprTypeForUser ty)
134showType dflags ty = showSDocForUser dflags alwaysQualify (pprTypeForUser ty)
202
135
@@ -221,55 +154,21 @@ compileScript funcType script = do
221 mErr <- typeCheckScript funcType script
154 mErr <- typeCheckScript funcType script
222 case mErr of
155 case mErr of
223 Just err -> pure (Left err)
156 Just err -> pure (Left err)
224− Nothing ->
157+ Nothing -> do
225 --catch exception here
158 --catch exception here
226 --we could potentially wrap the script with Atom pattern matching so that the script doesn't have to do it, but the change to an Atom ADT should make it easier. Still, it would be nice if the script didn't have to handle a list of arguments, for example.
159 --we could potentially wrap the script with Atom pattern matching so that the script doesn't have to do it, but the change to an Atom ADT should make it easier. Still, it would be nice if the script didn't have to handle a list of arguments, for example.
227 -- we can't use dynCompileExpr here because
160 -- we can't use dynCompileExpr here because
228− Right . unsafeCoerce <$> compileExpr sScript
161+ func <- compileExpr sScript
229−
162+ pure $ Right (unsafeCoerce func)
163+
230−typeCheckScript :: Type -> Text -> Ghc (Maybe ScriptCompilationError)
164+typeCheckScript :: Type -> Text -> Ghc (Maybe ScriptCompilationError)
231typeCheckScript expectedType inp = do
165typeCheckScript expectedType inp = do
232− dflags <- getSessionDynFlags
166+ dflags <- getSessionDynFlags
233 --catch exception for SyntaxError
167 --catch exception for SyntaxError
234−#if __GLASGOW_HASKELL__ >= 802
235− funcType <- GHC.exprType TM_Inst (unpack inp)
236−#else
237 funcType <- GHC.exprType (unpack inp)
168 funcType <- GHC.exprType (unpack inp)
238−#endif
239− --liftIO $ putStrLn $ showType dflags expectedType ++ ":::" ++ showType dflags funcType
169+ --liftIO $ putStrLn $ showType dflags expectedType ++ ":::" ++ showType dflags funcType
240 if eqType funcType expectedType then
170 if eqType funcType expectedType then
241 pure Nothing
171 pure Nothing
242 else
172 else
243 pure (Just (TypeCheckCompilationError (showType dflags expectedType) (showType dflags funcType)))
173 pure (Just (TypeCheckCompilationError (showType dflags expectedType) (showType dflags funcType)))
244−
174+
245−mangleSymbol :: Maybe String -> String -> String -> String
246−mangleSymbol pkg module' valsym =
247− prefixUnderscore ++
248− maybe "" (\p -> zEncodeString p ++ "_") pkg ++
249− zEncodeString module' ++ "_" ++ zEncodeString valsym ++ "_closure"
250−
251−loadFunction :: ModName -> FuncName -> FilePath -> IO (Either LoadSymbolError a)
252−loadFunction modName funcName objPath = do
253−#if __GLASGOW_HASKELL__ >= 802
254− initObjLinker RetainCAFs
255−#else
256− initObjLinker
257−#endif
258− loadObj objPath
259− _ <- resolveObjs
260− ptr <- lookupSymbol (mangleSymbol Nothing modName funcName)
261− case ptr of
262− Nothing -> pure (Left LoadSymbolError)
263− Just (Ptr addr) -> case addrToAny# addr of
264− (# hval #) -> pure (Right hval)
265−
266−prefixUnderscore :: String
267−prefixUnderscore =
268− case (os,arch) of
269− ("mingw32","x86_64") -> ""
270− ("cygwin","x86_64") -> ""
271− ("mingw32",_) -> "_"
272− ("darwin",_) -> "_"
273− ("cygwin",_) -> "_"
274− _ -> ""
275−#endif
src/lib/ProjectM36/Serialise/AtomFunctionError.hsdeleted−7
@@ -1,7 +0,0 @@
1−{-# LANGUAGE DerivingVia, StandaloneDeriving #-}
2−{-# OPTIONS_GHC -fno-warn-orphans #-}
3−module ProjectM36.Serialise.AtomFunctionError where
4−import Codec.Winery
5−import ProjectM36.AtomFunctionError
6−
7−deriving via WineryVariant AtomFunctionError instance Serialise AtomFunctionError
src/lib/ProjectM36/Serialise/Base.hsdeleted−85
@@ -1,85 +0,0 @@
1−{-# LANGUAGE StandaloneDeriving, DerivingVia, TypeApplications, TypeSynonymInstances, ScopedTypeVariables #-}
2−{-# OPTIONS_GHC -fno-warn-orphans #-}
3−--Serialise instances for ProjectM36.Base data types- orphan instance city
4−module ProjectM36.Serialise.Base where
5−import Codec.Winery hiding (Schema)
6−import Codec.Winery.Internal
7−import Control.Monad
8−import ProjectM36.Base
9−import ProjectM36.MerkleHash
10−import Data.UUID
11−import Data.Proxy
12−import Data.Word
13−import ProjectM36.Attribute as A
14−import qualified Data.List.NonEmpty as NE
15−import qualified Data.Vector as V
16−import Data.Time.Calendar (Day,toGregorian,fromGregorian)
17−
18−deriving via WineryVariant Atom instance Serialise Atom
19−deriving via WineryVariant AtomType instance Serialise AtomType
20−deriving via WineryVariant Attribute instance Serialise Attribute
21−deriving via WineryVariant RelationTupleSet instance Serialise RelationTupleSet
22−deriving via WineryVariant RelationTuple instance Serialise RelationTuple
23−deriving via WineryVariant Relation instance Serialise Relation
24−deriving via WineryVariant RelationCardinality instance Serialise RelationCardinality
25−deriving via WineryVariant (RelationalExprBase a) instance Serialise a => Serialise (RelationalExprBase a)
26−deriving via WineryVariant (WithNameExprBase a) instance Serialise a => Serialise (WithNameExprBase a)
27−deriving via WineryVariant Notification instance Serialise Notification
28−deriving via WineryVariant TypeConstructorDef instance Serialise TypeConstructorDef
29−deriving via WineryVariant (TypeConstructorBase a) instance Serialise a => Serialise (TypeConstructorBase a)
30−deriving via WineryVariant DataConstructorDef instance Serialise DataConstructorDef
31−deriving via WineryVariant DataConstructorDefArg instance Serialise DataConstructorDefArg
32−deriving via WineryVariant GraphRefTransactionMarker instance Serialise GraphRefTransactionMarker
33−deriving via WineryVariant SchemaIsomorph instance Serialise SchemaIsomorph
34−deriving via WineryVariant InclusionDependency instance Serialise InclusionDependency
35−deriving via WineryVariant (DatabaseContextExprBase a) instance Serialise a => Serialise (DatabaseContextExprBase a)
36−deriving via WineryVariant (DatabaseContextIOExprBase a) instance Serialise a => Serialise (DatabaseContextIOExprBase a)
37−deriving via WineryVariant (RestrictionPredicateExprBase a) instance Serialise a => Serialise (RestrictionPredicateExprBase a)
38−deriving via WineryVariant TransactionInfo instance Serialise TransactionInfo
39−deriving via WineryVariant (AtomExprBase a) instance Serialise a => Serialise (AtomExprBase a)
40−deriving via WineryVariant MerkleHash instance Serialise MerkleHash
41−deriving via WineryVariant (AttributeExprBase a) instance Serialise a => Serialise (AttributeExprBase a)
42−deriving via WineryVariant (TupleExprsBase a) instance Serialise a => Serialise (TupleExprsBase a)
43−deriving via WineryVariant (TupleExprBase a) instance Serialise a => Serialise (TupleExprBase a)
44−deriving via WineryVariant (AttributeNamesBase a) instance Serialise a => Serialise (AttributeNamesBase a)
45−deriving via WineryVariant (ExtendTupleExprBase a) instance Serialise a => Serialise (ExtendTupleExprBase a)
46−deriving via WineryVariant Schema instance Serialise Schema
47−deriving via WineryVariant MergeStrategy instance Serialise MergeStrategy
48−
49−fromWordsTup :: (Word32, Word32, Word32, Word32) -> TransactionId
50−fromWordsTup (a,b,c,d) = fromWords a b c d
51−
52−instance Serialise TransactionId where
53− schemaGen _ = getSchema (Proxy @(Word32, Word32, Word32, Word32))
54− toBuilder uuid = toBuilder (toWords uuid)
55− extractor = fromWordsTup <$> extractor
56− decodeCurrent = fromWordsTup <$> decodeCurrent
57−
58−instance Serialise a => Serialise (NE.NonEmpty a) where
59− schemaGen _ = SVector <$> getSchema (Proxy @a)
60− toBuilder xs = varInt (length xs) <> foldMap toBuilder xs
61− extractor = NE.fromList . V.toList <$> extractListBy extractor --use nonempty instead to replace error with winery error
62− decodeCurrent = do
63− n <- decodeVarInt
64− l <- replicateM n decodeCurrent
65− pure (NE.fromList l)
66−
67−fromGregorianTup :: (Integer, Int, Int) -> Day
68−fromGregorianTup (a, b, c) = fromGregorian a b c
69−
70−instance Serialise Day where
71− schemaGen _ = getSchema (Proxy @(Integer, Int, Int))
72− toBuilder day = toBuilder (toGregorian day)
73− extractor = fromGregorianTup <$> extractor
74− decodeCurrent = fromGregorianTup <$> decodeCurrent
75−
76−instance Serialise Attributes where
77− schemaGen _ = SVector <$> getSchema (Proxy @Attribute)
78− toBuilder attrs = varInt (V.length (attributesVec attrs)) <> foldMap toBuilder (V.toList (attributesVec attrs))
79− extractor =
80− attributesFromList . V.toList <$> extractListBy extractor
81−
82− decodeCurrent = do
83− n <- decodeVarInt
84− l <- replicateM n decodeCurrent
85− pure (A.attributesFromList l)
src/lib/ProjectM36/Serialise/DataFrame.hsdeleted−13
@@ -1,13 +0,0 @@
1−{-# LANGUAGE DerivingVia, StandaloneDeriving #-}
2−{-# OPTIONS_GHC -fno-warn-orphans #-}
3−module ProjectM36.Serialise.DataFrame where
4−import Codec.Winery
5−import ProjectM36.DataFrame
6−import ProjectM36.Serialise.Base ()
7−
8−deriving via WineryVariant AttributeOrderExpr instance Serialise AttributeOrderExpr
9−deriving via WineryVariant AttributeOrder instance Serialise AttributeOrder
10−deriving via WineryVariant Order instance Serialise Order
11−deriving via WineryRecord DataFrame instance Serialise DataFrame
12−deriving via WineryVariant DataFrameTuple instance Serialise DataFrameTuple
13−deriving via WineryRecord DataFrameExpr instance Serialise DataFrameExpr
src/lib/ProjectM36/Serialise/DatabaseContextFunctionError.hsdeleted−7
@@ -1,7 +0,0 @@
1−{-# LANGUAGE DerivingVia, StandaloneDeriving #-}
2−{-# OPTIONS_GHC -fno-warn-orphans #-}
3−module ProjectM36.Serialise.DatabaseContextFunctionError where
4−import Codec.Winery
5−import ProjectM36.DatabaseContextFunctionError
6−
7−deriving via WineryVariant DatabaseContextFunctionError instance Serialise DatabaseContextFunctionError
src/lib/ProjectM36/Serialise/Error.hsdeleted−15
@@ -1,15 +0,0 @@
1−{-# LANGUAGE DerivingVia, StandaloneDeriving #-}
2−{-# OPTIONS_GHC -fno-warn-orphans #-}
3−module ProjectM36.Serialise.Error where
4−import ProjectM36.Error
5−import Codec.Winery
6−import ProjectM36.Serialise.Base ()
7−import ProjectM36.Serialise.AtomFunctionError ()
8−import ProjectM36.Serialise.DatabaseContextFunctionError ()
9−
10−deriving via WineryVariant RelationalError instance Serialise RelationalError
11−deriving via WineryVariant MergeError instance Serialise MergeError
12−deriving via WineryVariant ScriptCompilationError instance Serialise ScriptCompilationError
13−deriving via WineryVariant PersistenceError instance Serialise PersistenceError
14−deriving via WineryVariant SchemaError instance Serialise SchemaError
15−deriving via WineryVariant ImportError' instance Serialise ImportError'
src/lib/ProjectM36/Serialise/IsomorphicSchema.hsdeleted−7
@@ -1,7 +0,0 @@
1−{-# LANGUAGE StandaloneDeriving, DerivingVia, TypeSynonymInstances, ScopedTypeVariables #-}
2−{-# OPTIONS_GHC -fno-warn-orphans #-}
3−module ProjectM36.Serialise.IsomorphicSchema where
4−import Codec.Winery
5−import ProjectM36.IsomorphicSchema
6−
7−deriving via WineryVariant SchemaExpr instance Serialise SchemaExpr
src/lib/ProjectM36/Serialise/MergeError.hsdeleted−1
@@ -1 +0,0 @@
1−
src/lib/ProjectM36/Server.hs+82−166
@@ -7,119 +7,73 @@ import ProjectM36.Server.RemoteCallTypes
7import ProjectM36.Server.Config (ServerConfig(..))
7import ProjectM36.Server.Config (ServerConfig(..))
8import ProjectM36.FSType
8import ProjectM36.FSType
9
9
10+import Control.Monad.IO.Class (liftIO)
11+import Network.Transport.TCP (createTransport, defaultTCPParameters)
12+import Network.Transport (EndPointAddress(..), newEndPoint, address)
13+import Control.Distributed.Process.Node (initRemoteTable, runProcess, newLocalNode, initRemoteTable)
14+import Control.Distributed.Process.Extras.Time (Delay(..))
15+import Control.Distributed.Process (Process, register, getSelfPid)
16+import Control.Distributed.Process.ManagedProcess (defaultProcess, UnhandledMessagePolicy(..), ProcessDefinition(..), handleCall, serve, InitHandler, InitResult(..))
10−import Control.Concurrent.MVar (MVar)
17+import Control.Concurrent.MVar (putMVar, MVar)
11import System.IO (stderr, hPutStrLn)
18import System.IO (stderr, hPutStrLn)
12import System.FilePath (takeDirectory)
19import System.FilePath (takeDirectory)
13import System.Directory (doesDirectoryExist)
20import System.Directory (doesDirectoryExist)
14−import Network.RPC.Curryer.Server
15−import Network.Socket
16−import qualified StmContainers.Map as StmMap
17−import Control.Concurrent.STM
18−
19−type TestMode = Bool
20−
21−requestHandlers :: TestMode -> Maybe Timeout -> RequestHandlers ServerState
22−requestHandlers testFlag ti =
23− [
24− RequestHandler (\sState (Login dbName) -> do
25− addClientLogin dbName sState
26− conn <- getConn sState
27− handleLogin conn (connectionSocket sState)),
28− RequestHandler (\sState Logout -> do
29− conn <- getConn sState
30− handleLogout ti conn),
31− RequestHandler $ \sState (ExecuteHeadName sessionId) -> do
32− --socket -> dbname --maybe create a socket->client state mapping in the server state, too
33− conn <- getConn sState
34− handleExecuteHeadName ti sessionId conn,
35− RequestHandler (\sState (ExecuteRelationalExpr sessionId expr) -> do
36− conn <- getConn sState
37− handleExecuteRelationalExpr ti sessionId conn expr),
38− RequestHandler (\sState (ExecuteDataFrameExpr sessionId expr) -> do
39− conn <- getConn sState
40− handleExecuteDataFrameExpr ti sessionId conn expr),
41− RequestHandler (\sState (ExecuteDatabaseContextExpr sessionId expr) -> do
42− conn <- getConn sState
43− handleExecuteDatabaseContextExpr ti sessionId conn expr),
44− RequestHandler (\sState (ExecuteDatabaseContextIOExpr sessionId expr) -> do
45− conn <- getConn sState
46− handleExecuteDatabaseContextIOExpr ti sessionId conn expr),
47− RequestHandler (\sState (ExecuteGraphExpr sessionId expr) -> do
48− conn <- getConn sState
49− handleExecuteGraphExpr ti sessionId conn expr),
50− RequestHandler (\sState (ExecuteTransGraphRelationalExpr sessionId expr) -> do
51− conn <- getConn sState
52− handleExecuteTransGraphRelationalExpr ti sessionId conn expr),
53− RequestHandler (\sState (ExecuteTypeForRelationalExpr sessionId expr) -> do
54− conn <- getConn sState
55− handleExecuteTypeForRelationalExpr ti sessionId conn expr),
56− RequestHandler (\sState (RetrieveInclusionDependencies sessionId) -> do
57− conn <- getConn sState
58− handleRetrieveInclusionDependencies ti sessionId conn),
59− RequestHandler (\sState (RetrievePlanForDatabaseContextExpr sessionId dbExpr) -> do
60− conn <- getConn sState
61− handleRetrievePlanForDatabaseContextExpr ti sessionId conn dbExpr),
62− RequestHandler (\sState (RetrieveHeadTransactionId sessionId) -> do
63− conn <- getConn sState
64− handleRetrieveHeadTransactionId ti sessionId conn),
65− RequestHandler (\sState (RetrieveTransactionGraph sessionId) -> do
66− conn <- getConn sState
67− handleRetrieveTransactionGraph ti sessionId conn),
68− RequestHandler (\sState (CreateSessionAtHead headn) -> do
69− conn <- getConn sState
70− handleCreateSessionAtHead ti conn headn),
71− RequestHandler (\sState (CreateSessionAtCommit commitId) -> do
72− conn <- getConn sState
73− handleCreateSessionAtCommit ti conn commitId),
74− RequestHandler (\sState (CloseSession sessionId) -> do
75− conn <- getConn sState
76− handleCloseSession sessionId conn),
77− RequestHandler (\sState (RetrieveAtomTypesAsRelation sessionId) -> do
78− conn <- getConn sState
79− handleRetrieveAtomTypesAsRelation ti sessionId conn),
80− RequestHandler (\sState (RetrieveRelationVariableSummary sessionId) -> do
81− conn <- getConn sState
82− handleRetrieveRelationVariableSummary ti sessionId conn),
83− RequestHandler (\sState (RetrieveAtomFunctionSummary sessionId) -> do
84− conn <- getConn sState
85− handleRetrieveAtomFunctionSummary ti sessionId conn),
86− RequestHandler (\sState (RetrieveDatabaseContextFunctionSummary sessionId) -> do
87− conn <- getConn sState
88− handleRetrieveDatabaseContextFunctionSummary ti sessionId conn), RequestHandler (\sState (RetrieveCurrentSchemaName sessionId) -> do
89− conn <- getConn sState
90− handleRetrieveCurrentSchemaName ti sessionId conn),
91− RequestHandler (\sState (ExecuteSchemaExpr sessionId schemaExpr) -> do
92− conn <- getConn sState
93− handleExecuteSchemaExpr ti sessionId conn schemaExpr),
94− RequestHandler (\sState (RetrieveSessionIsDirty sessionId) -> do
95− conn <- getConn sState
96− handleRetrieveSessionIsDirty ti sessionId conn),
97− RequestHandler (\sState (ExecuteAutoMergeToHead sessionId strat headName') -> do
98− conn <- getConn sState
99− handleExecuteAutoMergeToHead ti sessionId conn strat headName'),
100− RequestHandler (\sState (RetrieveTypeConstructorMapping sessionId) -> do
101− conn <- getConn sState
102− handleRetrieveTypeConstructorMapping ti sessionId conn),
103− RequestHandler (\sState (ExecuteValidateMerkleHashes sessionId) -> do
104− conn <- getConn sState
105− handleValidateMerkleHashes ti sessionId conn)
106− ] ++ if testFlag then testModeHandlers ti else []
107−
108−getConn :: ConnectionState ServerState -> IO Connection
109−getConn connState = do
110− let sock = lockless (connectionSocket connState)
111− sState = connectionServerState connState
112− mConn <- connectionForClient sock sState
113− case mConn of
114− Nothing -> error "failed to find socket in client map"
115− Just conn -> pure conn
116−
117−testModeHandlers :: Maybe Timeout -> RequestHandlers ServerState
118−testModeHandlers ti = [RequestHandler (\sState (TestTimeout sessionId) -> do
119− conn <- getConn sState
120− handleTestTimeout ti sessionId conn)]
121
21
22+-- the state should be a mapping of remote connection to the disconnected transaction- the graph should be the same, so discon must be removed from the stm tuple
23+--trying to refactor this for less repetition is very challenging because the return type cannot be polymorphic or the distributed-process call gets confused and drops messages
24+serverDefinition :: Bool -> Timeout -> ProcessDefinition Connection
25+serverDefinition testBool ti = defaultProcess {
26+ apiHandlers = [
27+ handleCall (\conn (ExecuteHeadName sessionId) -> handleExecuteHeadName ti sessionId conn),
28+ handleCall (\conn (ExecuteRelationalExpr sessionId expr) -> handleExecuteRelationalExpr ti sessionId conn expr),
29+ handleCall (\conn (ExecuteDatabaseContextExpr sessionId expr) -> handleExecuteDatabaseContextExpr ti sessionId conn expr),
30+ handleCall (\conn (ExecuteDatabaseContextIOExpr sessionId expr) -> handleExecuteDatabaseContextIOExpr ti sessionId conn expr),
31+ handleCall (\conn (ExecuteGraphExpr sessionId expr) -> handleExecuteGraphExpr ti sessionId conn expr),
32+ handleCall (\conn (ExecuteTransGraphRelationalExpr sessionId expr) -> handleExecuteTransGraphRelationalExpr ti sessionId conn expr),
33+ handleCall (\conn (ExecuteTypeForRelationalExpr sessionId expr) -> handleExecuteTypeForRelationalExpr ti sessionId conn expr),
34+ handleCall (\conn (RetrieveInclusionDependencies sessionId) -> handleRetrieveInclusionDependencies ti sessionId conn),
35+ handleCall (\conn (RetrievePlanForDatabaseContextExpr sessionId dbExpr) -> handleRetrievePlanForDatabaseContextExpr ti sessionId conn dbExpr),
36+ handleCall (\conn (RetrieveHeadTransactionId sessionId) -> handleRetrieveHeadTransactionId ti sessionId conn),
37+ handleCall (\conn (RetrieveTransactionGraph sessionId) -> handleRetrieveTransactionGraph ti sessionId conn),
38+ handleCall (\conn (Login procId) -> handleLogin ti conn procId),
39+ handleCall (\conn (CreateSessionAtHead headn) -> handleCreateSessionAtHead ti conn headn),
40+ handleCall (\conn (CreateSessionAtCommit commitId) -> handleCreateSessionAtCommit ti conn commitId),
41+ handleCall (\conn (CloseSession sessionId) -> handleCloseSession ti sessionId conn),
42+ handleCall (\conn (RetrieveAtomTypesAsRelation sessionId) -> handleRetrieveAtomTypesAsRelation ti sessionId conn),
43+ handleCall (\conn (RetrieveRelationVariableSummary sessionId) -> handleRetrieveRelationVariableSummary ti sessionId conn),
44+ handleCall (\conn (RetrieveCurrentSchemaName sessionId) -> handleRetrieveCurrentSchemaName ti sessionId conn),
45+ handleCall (\conn (ExecuteSchemaExpr sessionId schemaExpr) -> handleExecuteSchemaExpr ti sessionId conn schemaExpr),
46+ handleCall (\conn (RetrieveSessionIsDirty sessionId) -> handleRetrieveSessionIsDirty ti sessionId conn),
47+ handleCall (\conn (ExecuteAutoMergeToHead sessionId strat headName') -> handleExecuteAutoMergeToHead ti sessionId conn strat headName'),
48+ handleCall (\conn (RetrieveTypeConstructorMapping sessionId) -> handleRetrieveTypeConstructorMapping ti sessionId conn),
49+ handleCall (\conn Logout -> handleLogout ti conn)
50+ ] ++ testModeHandlers,
51+ unhandledMessagePolicy = Terminate
52+ --unhandledMessagePolicy = Log
53+ }
54+ where
55+ testModeHandlers = if not testBool then
56+ []
57+ else
58+ [handleCall (\conn (TestTimeout sessionId) -> handleTestTimeout ti sessionId conn)]
59+
122
60
61+initServer :: InitHandler (Connection, DatabaseName, Maybe (MVar EndPointAddress), EndPointAddress) Connection
62+initServer (conn, dbname, mAddressMVar, saddress) = do
63+ registerDB dbname
64+ case mAddressMVar of
65+ Nothing -> pure ()
66+ Just addressMVar -> liftIO $ putMVar addressMVar saddress
67+ --traceShowM ("server started on " ++ show saddress)
68+ pure $ InitOk conn Infinity
69+
70+registerDB :: DatabaseName -> Process ()
71+registerDB dbname = do
72+ self <- getSelfPid
73+ let dbname' = remoteDBLookupName dbname
74+ register dbname' self
75+ --liftIO $ putStrLn $ "registered " ++ (show self) ++ " " ++ dbname'
76+
123-- | A notification callback which logs the notification to stderr and does nothing else.
77-- | A notification callback which logs the notification to stderr and does nothing else.
124loggingNotificationCallback :: NotificationCallback
78loggingNotificationCallback :: NotificationCallback
125loggingNotificationCallback notName evaldNot = hPutStrLn stderr $ "Notification received \"" ++ show notName ++ "\": " ++ show evaldNot
79loggingNotificationCallback notName evaldNot = hPutStrLn stderr $ "Notification received \"" ++ show notName ++ "\": " ++ show evaldNot
@@ -144,47 +98,9 @@ checkFSType performCheck strat =
144checkFSErrorMsg :: String
98checkFSErrorMsg :: String
145checkFSErrorMsg = "The filesystem does not support journaling so writes may not be crash-safe. Use --disable-fscheck to disable this fatal error."
99checkFSErrorMsg = "The filesystem does not support journaling so writes may not be crash-safe. Use --disable-fscheck to disable this fatal error."
146
100
147−-- Sockets do not implement hashable, so we just use their string values as keys
148−type SocketString = String
149−
150−data ServerState =
151− ServerState {
152− --map available databases to local database configurations
153− stateDBMap :: StmMap.Map DatabaseName Connection,
154− --map clients to database names- after logging in, clients are afixed to specific database names
155− stateClientMap :: StmMap.Map SocketString DatabaseName
156− }
157−
158−-- add a client socket to the database mapping
159−addClientLogin :: DatabaseName -> ConnectionState ServerState -> IO ()
160−addClientLogin dbName cState = do
161− let clientMap = stateClientMap (connectionServerState cState)
162− sock = lockless (connectionSocket cState)
163− atomically $ do
164− mVal <- StmMap.lookup (show sock) clientMap
165− case mVal of
166− Nothing -> StmMap.insert dbName (show sock) clientMap
167− Just _ -> pure () --TODO: throw exception- user already logged in
168−
169−connectionForClient :: Socket -> ServerState -> IO (Maybe Connection)
170−connectionForClient sock sState =
171− atomically $ do
172− mdbname <- StmMap.lookup (show sock) (stateClientMap sState)
173− case mdbname of
174− Nothing -> pure Nothing
175− Just dbname ->
176− StmMap.lookup dbname (stateDBMap sState)
177−
178−initialServerState :: DatabaseName -> Connection -> IO ServerState
179−initialServerState dbName conn =
180− atomically $ do
181− dbmap <- StmMap.new
182− clientMap <- StmMap.new
183− StmMap.insert conn dbName dbmap
184− pure (ServerState { stateDBMap = dbmap, stateClientMap = clientMap })
185-- | A synchronous function to start the project-m36 daemon given an appropriate 'ServerConfig'. Note that this function only returns if the server exits. Returns False if the daemon exited due to an error. If the second argument is not Nothing, the port is put after the server is ready to service the port.
101-- | A synchronous function to start the project-m36 daemon given an appropriate 'ServerConfig'. Note that this function only returns if the server exits. Returns False if the daemon exited due to an error. If the second argument is not Nothing, the port is put after the server is ready to service the port.
186−launchServer :: ServerConfig -> Maybe (MVar SockAddr) -> IO Bool
102+launchServer :: ServerConfig -> Maybe (MVar EndPointAddress) -> IO Bool
187−launchServer daemonConfig mAddr = do
103+launchServer daemonConfig mAddressMVar = do
188 checkFSResult <- checkFSType (checkFS daemonConfig) (persistenceStrategy daemonConfig)
104 checkFSResult <- checkFSType (checkFS daemonConfig) (persistenceStrategy daemonConfig)
189 if not checkFSResult then do
105 if not checkFSResult then do
190 hPutStrLn stderr checkFSErrorMsg
106 hPutStrLn stderr checkFSErrorMsg
@@ -197,21 +113,21 @@ launchServer daemonConfig mAddr = do
197 pure False
113 pure False
198 Right conn -> do
114 Right conn -> do
199 let hostname = bindHost daemonConfig
115 let hostname = bindHost daemonConfig
200− port = fromIntegral (bindPort daemonConfig)
116+ port = bindPort daemonConfig
201−
117+ etransport <- createTransport hostname (show port) defaultTCPParameters
202−
118+ case etransport of
203− --curryer only supports IPv4 for now
119+ Left err -> error ("failed to create transport: " ++ show err)
204− let addrHints = defaultHints { addrSocketType = Stream, addrFamily = AF_INET }
120+ Right transport -> do
205− hostAddrs <- getAddrInfo (Just addrHints) (Just hostname) Nothing
121+ eEndpoint <- newEndPoint transport
206− case hostAddrs of
122+ case eEndpoint of
207− [] -> hPutStrLn stderr ("Failed to resolve: " <> hostname) >> pure False
123+ Left err -> hPutStrLn stderr ("Failed to create transport: " ++ show err) >> pure False
208− (AddrInfo _ _ _ _ (SockAddrInet _ addr32) _):_ -> do
124+ Right endpoint -> do
209− let hostAddr = hostAddressToTuple addr32
125+ localTCPNode <- newLocalNode transport initRemoteTable
210− mTimeout = fromIntegral <$> case perRequestTimeout daemonConfig of
126+ --traceShowM ("newLocalNode in Server " ++ show (localNodeId localTCPNode))
211− 0 -> Nothing
127+ runProcess localTCPNode $ do
212− v -> Just v
128+ let testBool = testMode daemonConfig
213−
129+ reqTimeout = perRequestTimeout daemonConfig
214− sState <- initialServerState (databaseName daemonConfig) conn
130+ serve (conn, databaseName daemonConfig, mAddressMVar, address endpoint) initServer (serverDefinition testBool reqTimeout)
215− serve (requestHandlers (testMode daemonConfig) mTimeout) sState hostAddr port mAddr
131+ liftIO $ putStrLn "serve returned"
216− _ -> error "unsupported socket addressing mode (IPv4 only currently)"
132+ pure True
217−
133+
src/lib/ProjectM36/Server/Config.hs−6
@@ -12,12 +12,6 @@ data ServerConfig = ServerConfig { persistenceStrategy :: PersistenceStrategy,
12 }
12 }
13 deriving (Show)
13 deriving (Show)
14
14
15−data WebsocketServerConfig = WebsocketServerConfig { wsServerConfig :: ServerConfig,
16− tlsCertificatePath :: Maybe String,
17− tlsKeyPath :: Maybe String
18− }
19− deriving (Show)
20−
21defaultServerConfig :: ServerConfig
15defaultServerConfig :: ServerConfig
22defaultServerConfig = ServerConfig { persistenceStrategy = NoPersistence,
16defaultServerConfig = ServerConfig { persistenceStrategy = NoPersistence,
23 checkFS = True,
17 checkFS = True,
src/lib/ProjectM36/Server/EntryPoints.hs+138−127
@@ -1,146 +1,157 @@
1−{-# LANGUAGE MonoLocalBinds #-}
2module ProjectM36.Server.EntryPoints where
1module ProjectM36.Server.EntryPoints where
3import ProjectM36.Base hiding (inclusionDependencies)
2import ProjectM36.Base hiding (inclusionDependencies)
4import ProjectM36.IsomorphicSchema
3import ProjectM36.IsomorphicSchema
5import ProjectM36.Client as C
4import ProjectM36.Client as C
5+import ProjectM36.Error
6+import Control.Distributed.Process (Process, ProcessId)
7+import Control.Distributed.Process.ManagedProcess (ProcessReply)
8+import Control.Distributed.Process.ManagedProcess.Server (reply)
9+import Control.Distributed.Process.Async (async, task, waitCancelTimeout, AsyncResult(..))
10+import Control.Distributed.Process.Serializable (Serializable)
11+import Control.Monad.IO.Class (liftIO)
6import Data.Map
12import Data.Map
7import Control.Concurrent (threadDelay)
13import Control.Concurrent (threadDelay)
8−import Network.RPC.Curryer.Server
9−import System.Timeout hiding (Timeout)
10−import Network.Socket
11−import Control.Exception
12
14
13−timeoutOrDie :: Maybe Timeout -> IO a -> IO (Maybe a)
15+timeoutOrDie :: Serializable a => Timeout -> IO a -> Process (Either ServerError a)
14−timeoutOrDie mMicros act =
16+timeoutOrDie micros act =
15− case mMicros of
17+ if micros == 0 then
16− Nothing -> Just <$> act
18+ liftIO act >>= \x -> pure (Right x)
17− Just micros ->
19+ else do
18− timeout (fromIntegral micros) act
20+ asyncUnit <- async (task (liftIO act))
21+ asyncRes <- waitCancelTimeout micros asyncUnit
22+ case asyncRes of
23+ AsyncDone x -> pure (Right x)
24+ AsyncCancelled -> pure (Left RequestTimeoutError)
25+ AsyncFailed reason -> pure (Left (ProcessDiedError (show reason)))
26+ AsyncLinkFailed reason -> pure (Left (ProcessDiedError (show reason)))
27+ AsyncPending -> pure (Left (ProcessDiedError "process pending"))
28+
29+type Timeout = Int
19
30
20−timeoutRelErr :: Maybe Timeout -> IO (Either RelationalError a) -> IO (Either RelationalError a)
31+type Reply a = Process (ProcessReply (Either ServerError a) Connection)
21−timeoutRelErr mMicros act = do
32+
22− ret <- timeoutOrDie mMicros act
33+handleExecuteRelationalExpr :: Timeout -> SessionId -> Connection -> RelationalExpr -> Reply (Either RelationalError Relation)
34+handleExecuteRelationalExpr ti sessionId conn expr = do
35+ ret <- timeoutOrDie ti (executeRelationalExpr sessionId conn expr)
36+ reply ret conn
37+
38+handleExecuteDatabaseContextExpr :: Timeout -> SessionId -> Connection -> DatabaseContextExpr -> Reply (Either RelationalError ())
39+handleExecuteDatabaseContextExpr ti sessionId conn dbexpr = do
40+ ret <- timeoutOrDie ti (executeDatabaseContextExpr sessionId conn dbexpr)
41+ reply ret conn
42+
43+handleExecuteDatabaseContextIOExpr :: Timeout -> SessionId -> Connection -> DatabaseContextIOExpr -> Reply (Either RelationalError ())
44+handleExecuteDatabaseContextIOExpr ti sessionId conn dbexpr = do
45+ ret <- timeoutOrDie ti (executeDatabaseContextIOExpr sessionId conn dbexpr)
46+ reply ret conn
47+
48+handleExecuteHeadName :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError HeadName)
49+handleExecuteHeadName ti sessionId conn = do
50+ ret <- timeoutOrDie ti (headName sessionId conn)
51+ reply ret conn
52+
53+handleLogin :: Timeout -> Connection -> ProcessId -> Reply Bool
54+handleLogin ti conn newClientProcessId = do
55+ ret <- timeoutOrDie ti (addClientNode conn newClientProcessId)
23 case ret of
56 case ret of
24− Nothing -> throw TimeoutException
57+ Right () -> reply (Right True) conn
25− Just v -> pure v
58+ Left err -> reply (Left err) conn
26−
59+
27−
60+handleExecuteGraphExpr :: Timeout -> SessionId -> Connection -> TransactionGraphOperator -> Reply (Either RelationalError ())
28−handleExecuteRelationalExpr :: Maybe Timeout -> SessionId -> Connection -> RelationalExpr -> IO (Either RelationalError Relation)
61+handleExecuteGraphExpr ti sessionId conn graphExpr = do
29−handleExecuteRelationalExpr ti sessionId conn expr =
62+ ret <- timeoutOrDie ti (executeGraphExpr sessionId conn graphExpr)
30− timeoutRelErr ti (executeRelationalExpr sessionId conn expr)
63+ reply ret conn
64+
65+handleExecuteTransGraphRelationalExpr :: Timeout -> SessionId -> Connection -> TransGraphRelationalExpr -> Reply (Either RelationalError Relation)
66+handleExecuteTransGraphRelationalExpr ti sessionId conn graphExpr = do
67+ ret <- timeoutOrDie ti (executeTransGraphRelationalExpr sessionId conn graphExpr)
68+ reply ret conn
31
69
32−handleExecuteDataFrameExpr :: Maybe Timeout -> SessionId -> Connection -> DataFrameExpr -> IO (Either RelationalError DataFrame)
70+handleExecuteTypeForRelationalExpr :: Timeout -> SessionId -> Connection -> RelationalExpr -> Reply (Either RelationalError Relation)
33−handleExecuteDataFrameExpr ti sessionId conn expr =
71+handleExecuteTypeForRelationalExpr ti sessionId conn relExpr = do
34− timeoutRelErr ti (executeDataFrameExpr sessionId conn expr)
72+ ret <- timeoutOrDie ti (typeForRelationalExpr sessionId conn relExpr)
35−
73+ reply ret conn
36−handleExecuteDatabaseContextExpr :: Maybe Timeout -> SessionId -> Connection -> DatabaseContextExpr -> IO (Either RelationalError ())
74+
37−handleExecuteDatabaseContextExpr ti sessionId conn dbexpr =
75+handleRetrieveInclusionDependencies :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError (Map IncDepName InclusionDependency))
38− timeoutRelErr ti (executeDatabaseContextExpr sessionId conn dbexpr)
76+handleRetrieveInclusionDependencies ti sessionId conn = do
39−
77+ ret <- timeoutOrDie ti (inclusionDependencies sessionId conn)
40−handleExecuteDatabaseContextIOExpr :: Maybe Timeout -> SessionId -> Connection -> DatabaseContextIOExpr -> IO (Either RelationalError ())
78+ reply ret conn
41−handleExecuteDatabaseContextIOExpr ti sessionId conn dbexpr =
79+
42− timeoutRelErr ti (executeDatabaseContextIOExpr sessionId conn dbexpr)
80+handleRetrievePlanForDatabaseContextExpr :: Timeout -> SessionId -> Connection -> DatabaseContextExpr -> Reply (Either RelationalError DatabaseContextExpr)
43−
81+handleRetrievePlanForDatabaseContextExpr ti sessionId conn dbExpr = do
44−handleExecuteHeadName :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError HeadName)
82+ ret <- timeoutOrDie ti (planForDatabaseContextExpr sessionId conn dbExpr)
45−handleExecuteHeadName ti sessionId conn =
83+ reply ret conn
46− timeoutRelErr ti (headName sessionId conn)
84+
47−
85+handleRetrieveTransactionGraph :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError Relation)
48−handleLogin :: Connection -> Locking Socket -> IO Bool
86+handleRetrieveTransactionGraph ti sessionId conn = do
49−handleLogin conn lockSock = do
87+ ret <- timeoutOrDie ti (transactionGraphAsRelation sessionId conn)
50− addClientNode conn lockSock
88+ reply ret conn
51− pure True
89+
52−
90+handleRetrieveHeadTransactionId :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError TransactionId)
53−handleExecuteGraphExpr :: Maybe Timeout -> SessionId -> Connection -> TransactionGraphOperator -> IO (Either RelationalError ())
91+handleRetrieveHeadTransactionId ti sessionId conn = do
54−handleExecuteGraphExpr ti sessionId conn graphExpr =
92+ ret <- timeoutOrDie ti (headTransactionId sessionId conn)
55− timeoutRelErr ti (executeGraphExpr sessionId conn graphExpr)
93+ reply ret conn
56−
94+
57−handleExecuteTransGraphRelationalExpr :: Maybe Timeout -> SessionId -> Connection -> TransGraphRelationalExpr -> IO (Either RelationalError Relation)
95+handleCreateSessionAtCommit :: Timeout -> Connection -> TransactionId -> Reply (Either RelationalError SessionId)
58−handleExecuteTransGraphRelationalExpr ti sessionId conn graphExpr =
96+handleCreateSessionAtCommit ti conn commitId = do
59− timeoutRelErr ti (executeTransGraphRelationalExpr sessionId conn graphExpr)
97+ ret <- timeoutOrDie ti (createSessionAtCommit conn commitId)
60−
98+ reply ret conn
61−handleExecuteTypeForRelationalExpr :: Maybe Timeout -> SessionId -> Connection -> RelationalExpr -> IO (Either RelationalError Relation)
99+
62−handleExecuteTypeForRelationalExpr ti sessionId conn relExpr =
100+handleCreateSessionAtHead :: Timeout -> Connection -> HeadName -> Reply (Either RelationalError SessionId)
63− timeoutRelErr ti (typeForRelationalExpr sessionId conn relExpr)
101+handleCreateSessionAtHead ti conn headn = do
64−
102+ ret <- timeoutOrDie ti (createSessionAtHead conn headn)
65−handleRetrieveInclusionDependencies :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError (Map IncDepName InclusionDependency))
103+ reply ret conn
66−handleRetrieveInclusionDependencies ti sessionId conn =
104+
67− timeoutRelErr ti (inclusionDependencies sessionId conn)
105+handleCloseSession :: Timeout -> SessionId -> Connection -> Reply ()
68−
106+handleCloseSession ti sessionId conn = do
69−handleRetrievePlanForDatabaseContextExpr :: Maybe Timeout -> SessionId -> Connection -> DatabaseContextExpr -> IO (Either RelationalError GraphRefDatabaseContextExpr)
107+ ret <- timeoutOrDie ti (closeSession sessionId conn)
70−handleRetrievePlanForDatabaseContextExpr ti sessionId conn dbExpr =
108+ case ret of
71− timeoutRelErr ti (planForDatabaseContextExpr sessionId conn dbExpr)
109+ Right () -> reply (Right ()) conn
72−
110+ Left err -> reply (Left err) conn
73−handleRetrieveTransactionGraph :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError Relation)
74−handleRetrieveTransactionGraph ti sessionId conn =
75− timeoutRelErr ti (transactionGraphAsRelation sessionId conn)
76−
77−handleRetrieveHeadTransactionId :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError TransactionId)
78−handleRetrieveHeadTransactionId ti sessionId conn =
79− timeoutRelErr ti (headTransactionId sessionId conn)
80−
81−handleCreateSessionAtCommit :: Maybe Timeout -> Connection -> TransactionId -> IO (Either RelationalError SessionId)
82−handleCreateSessionAtCommit ti conn commitId =
83− timeoutRelErr ti (createSessionAtCommit conn commitId)
84−
85−handleCreateSessionAtHead :: Maybe Timeout -> Connection -> HeadName -> IO (Either RelationalError SessionId)
86−handleCreateSessionAtHead ti conn headn =
87− timeoutRelErr ti (createSessionAtHead conn headn)
88−
89−handleCloseSession :: SessionId -> Connection -> IO ()
90−handleCloseSession =
91− closeSession
92
111
93−handleRetrieveAtomTypesAsRelation :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError Relation)
112+handleRetrieveAtomTypesAsRelation :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError Relation)
94−handleRetrieveAtomTypesAsRelation ti sessionId conn =
113+handleRetrieveAtomTypesAsRelation ti sessionId conn = do
95− timeoutRelErr ti (atomTypesAsRelation sessionId conn)
114+ ret <- timeoutOrDie ti (atomTypesAsRelation sessionId conn)
115+ reply ret conn
96
116
97-- | Returns a relation which lists the names of relvars in the current session as well as its types.
117-- | Returns a relation which lists the names of relvars in the current session as well as its types.
98−handleRetrieveRelationVariableSummary :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError Relation)
118+handleRetrieveRelationVariableSummary :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError Relation)
99−handleRetrieveRelationVariableSummary ti sessionId conn =
119+handleRetrieveRelationVariableSummary ti sessionId conn = do
100− timeoutRelErr ti (relationVariablesAsRelation sessionId conn)
120+ ret <- timeoutOrDie ti (relationVariablesAsRelation sessionId conn)
101−
121+ reply ret conn
102−handleRetrieveAtomFunctionSummary :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError Relation)
122+
103−handleRetrieveAtomFunctionSummary ti sessionId conn =
123+handleRetrieveCurrentSchemaName :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError SchemaName)
104− timeoutRelErr ti (atomFunctionsAsRelation sessionId conn)
124+handleRetrieveCurrentSchemaName ti sessionId conn = do
105−
125+ ret <- timeoutOrDie ti (currentSchemaName sessionId conn)
106−handleRetrieveDatabaseContextFunctionSummary :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError Relation)
126+ reply ret conn
107−handleRetrieveDatabaseContextFunctionSummary ti sessionId conn =
108− timeoutRelErr ti (databaseContextFunctionsAsRelation sessionId conn)
109−
110−handleRetrieveCurrentSchemaName :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError SchemaName)
111−handleRetrieveCurrentSchemaName ti sessionId conn =
112− timeoutRelErr ti (currentSchemaName sessionId conn)
113
127
114−handleExecuteSchemaExpr :: Maybe Timeout -> SessionId -> Connection -> SchemaExpr -> IO (Either RelationalError ())
128+handleExecuteSchemaExpr :: Timeout -> SessionId -> Connection -> SchemaExpr -> Reply (Either RelationalError ())
115−handleExecuteSchemaExpr ti sessionId conn schemaExpr =
129+handleExecuteSchemaExpr ti sessionId conn schemaExpr = do
116− timeoutRelErr ti (executeSchemaExpr sessionId conn schemaExpr)
130+ ret <- timeoutOrDie ti (executeSchemaExpr sessionId conn schemaExpr)
131+ reply ret conn
117
132
118−handleLogout :: Maybe Timeout -> Connection -> IO Bool
133+handleLogout :: Timeout -> Connection -> Reply Bool
119−handleLogout _ _ =
134+handleLogout _ =
120 --liftIO $ closeRemote_ conn
135 --liftIO $ closeRemote_ conn
121− pure True
136+ reply (pure True)
122
137
123−handleTestTimeout :: Maybe Timeout -> SessionId -> Connection -> IO Bool
138+handleTestTimeout :: Timeout -> SessionId -> Connection -> Reply Bool
124−handleTestTimeout ti _ _ = do
139+handleTestTimeout ti _ conn = do
125− ret <- timeoutRelErr ti (threadDelay 100000 >> pure (Right ()))
140+ ret <- timeoutOrDie ti (threadDelay 100000 >> pure True)
126− case ret of
141+ reply ret conn
127− Right () -> pure True
128− Left _ -> pure False
129
142
130−
143+handleRetrieveSessionIsDirty :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError Bool)
131−
144+handleRetrieveSessionIsDirty ti sessionId conn = do
132−handleRetrieveSessionIsDirty :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError Bool)
145+ ret <- timeoutOrDie ti (disconnectedTransactionIsDirty sessionId conn)
133−handleRetrieveSessionIsDirty ti sessionId conn =
146+ reply ret conn
134− timeoutRelErr ti (disconnectedTransactionIsDirty sessionId conn)
147+
135−
148+handleExecuteAutoMergeToHead :: Timeout -> SessionId -> Connection -> MergeStrategy -> HeadName -> Reply (Either RelationalError ())
136−handleExecuteAutoMergeToHead :: Maybe Timeout -> SessionId -> Connection -> MergeStrategy -> HeadName -> IO (Either RelationalError ())
149+handleExecuteAutoMergeToHead ti sessionId conn strat headName' = do
137−handleExecuteAutoMergeToHead ti sessionId conn strat headName' =
150+ ret <- timeoutOrDie ti (autoMergeToHead sessionId conn strat headName')
138− timeoutRelErr ti (autoMergeToHead sessionId conn strat headName')
151+ reply ret conn
139
152
140−handleRetrieveTypeConstructorMapping :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError TypeConstructorMapping)
153+handleRetrieveTypeConstructorMapping :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError TypeConstructorMapping)
141−handleRetrieveTypeConstructorMapping ti sessionId conn =
154+handleRetrieveTypeConstructorMapping ti sessionId conn = do
142− timeoutRelErr ti (C.typeConstructorMapping sessionId conn)
155+ ret <- timeoutOrDie ti (C.typeConstructorMapping sessionId conn)
143−
156+ reply ret conn
144−handleValidateMerkleHashes :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError ())
157+
145−handleValidateMerkleHashes ti sessionId conn =
146− timeoutRelErr ti (C.validateMerkleHashes sessionId conn)
src/lib/ProjectM36/Server/ParseArgs.hs+25−60
@@ -3,100 +3,65 @@ import ProjectM36.Base
3import ProjectM36.Client
3import ProjectM36.Client
4import Options.Applicative
4import Options.Applicative
5import ProjectM36.Server.Config
5import ProjectM36.Server.Config
6−#if __GLASGOW_HASKELL__ < 804
7import Data.Monoid
6import Data.Monoid
8−#endif
9
7
10parseArgsWithDefaults :: ServerConfig -> Parser ServerConfig
8parseArgsWithDefaults :: ServerConfig -> Parser ServerConfig
11−parseArgsWithDefaults defaults = ServerConfig <$>
9+parseArgsWithDefaults defaults = ServerConfig <$>
12− parsePersistenceStrategy <*>
10+ parsePersistenceStrategy <*>
13− parseCheckFS <*>
11+ parseCheckFS <*>
14− parseDatabaseName <*>
12+ parseDatabaseName <*>
15− parseHostname (bindHost defaults) <*>
13+ parseHostname (bindHost defaults) <*>
16− parsePort (bindPort defaults) <*>
14+ parsePort (bindPort defaults) <*>
17− many parseGhcPkgPath <*>
15+ many parseGhcPkgPath <*>
18− parseTimeout (perRequestTimeout defaults) <*>
16+ parseTimeout (perRequestTimeout defaults) <*>
19− parseTestMode
17+ pure False
20−
18+
21parsePersistenceStrategy :: Parser PersistenceStrategy
19parsePersistenceStrategy :: Parser PersistenceStrategy
22parsePersistenceStrategy = CrashSafePersistence <$> (dbdirOpt <* fsyncOpt) <|>
20parsePersistenceStrategy = CrashSafePersistence <$> (dbdirOpt <* fsyncOpt) <|>
23 MinimalPersistence <$> dbdirOpt <|>
21 MinimalPersistence <$> dbdirOpt <|>
24 pure NoPersistence
22 pure NoPersistence
25− where
23+ where
26− dbdirOpt = strOption (short 'd' <>
24+ dbdirOpt = strOption (short 'd' <>
27− long "database-directory" <>
25+ long "database-directory" <>
28 metavar "DIRECTORY" <>
26 metavar "DIRECTORY" <>
29 showDefaultWith show
27 showDefaultWith show
30 )
28 )
31 fsyncOpt = switch (short 'f' <>
29 fsyncOpt = switch (short 'f' <>
32 long "fsync" <>
30 long "fsync" <>
33 help "Fsync all new transactions.")
31 help "Fsync all new transactions.")
34−
32+
35−parseTestMode :: Parser Bool
33+parseCheckFS :: Parser Bool
36−parseTestMode = flag True False (long "test-mode" <> hidden)
37−
38−parseCheckFS :: Parser Bool
39parseCheckFS = flag True False (long "disable-fscheck" <>
34parseCheckFS = flag True False (long "disable-fscheck" <>
40 help "Disable filesystem check for journaling.")
35 help "Disable filesystem check for journaling.")
41−
36+
42parseDatabaseName :: Parser DatabaseName
37parseDatabaseName :: Parser DatabaseName
43parseDatabaseName = strOption (short 'n' <>
38parseDatabaseName = strOption (short 'n' <>
44 long "database" <>
39 long "database" <>
45 metavar "DATABASE_NAME")
40 metavar "DATABASE_NAME")
46−
41+
47−parseHostname :: Hostname -> Parser Hostname
42+parseHostname :: Hostname -> Parser Hostname
48parseHostname defHostname = strOption (short 'h' <>
43parseHostname defHostname = strOption (short 'h' <>
49 long "hostname" <>
44 long "hostname" <>
50 metavar "HOST_NAME" <>
45 metavar "HOST_NAME" <>
51 value defHostname)
46 value defHostname)
52−
47+
53−parsePort :: Port -> Parser Port
48+parsePort :: Port -> Parser Port
54parsePort defPort = option auto (short 'p' <>
49parsePort defPort = option auto (short 'p' <>
55 long "port" <>
50 long "port" <>
56 metavar "PORT_NUMBER" <>
51 metavar "PORT_NUMBER" <>
57 value defPort)
52 value defPort)
58−
53+
59parseGhcPkgPath :: Parser String
54parseGhcPkgPath :: Parser String
60parseGhcPkgPath = strOption (long "ghc-pkg-dir" <>
55parseGhcPkgPath = strOption (long "ghc-pkg-dir" <>
61 metavar "GHC_PACKAGE_DIRECTORY")
56 metavar "GHC_PACKAGE_DIRECTORY")
62−
57+
63−parseTimeout :: Int -> Parser Int
58+parseTimeout :: Int -> Parser Int
64parseTimeout defTimeout = option auto (long "timeout" <>
59parseTimeout defTimeout = option auto (long "timeout" <>
65 metavar "MICROSECONDS" <>
60 metavar "MICROSECONDS" <>
66 value defTimeout)
61 value defTimeout)
67
62
68parseConfig :: IO ServerConfig
63parseConfig :: IO ServerConfig
69parseConfig = parseConfigWithDefaults defaultServerConfig
64parseConfig = parseConfigWithDefaults defaultServerConfig
70−
65+
71parseConfigWithDefaults :: ServerConfig -> IO ServerConfig
66parseConfigWithDefaults :: ServerConfig -> IO ServerConfig
72−parseConfigWithDefaults defaults = execParser (info (parseArgsWithDefaults defaults <**> helpOption) idm)
67+parseConfigWithDefaults defaults = execParser (info (parseArgsWithDefaults defaults) idm)
73−
74−parseWSConfigWithDefaults :: ServerConfig -> IO WebsocketServerConfig
75−parseWSConfigWithDefaults defaults = execParser (info (parseWSArgsWithDefaults defaults <**> helpOption) idm)
76−
77−parseWSArgsWithDefaults :: ServerConfig -> Parser WebsocketServerConfig
78−parseWSArgsWithDefaults defaults = WebsocketServerConfig <$>
79− parseArgsWithDefaults defaults <*>
80− parseTlsCertificatePath <*>
81− parseTlsKeyPath
82−
83−
84−parseTlsCertificatePath :: Parser (Maybe String)
85−parseTlsCertificatePath = optional $ strOption (long "tls-certificate-path" <>
86− metavar "TLS_CERTIFICATE_PATH")
87−
88−parseTlsKeyPath :: Parser (Maybe String)
89−parseTlsKeyPath = optional $ strOption (long "tls-key-path" <>
90− metavar "TLS_KEY_PATH")
91−
92−helpOption :: Parser (a -> a)
93−helpOption = abortOption helpText $ mconcat
94− [ long "help"
95− , help "Show this help text"
96− , hidden ]
97− where
98−#if MIN_VERSION_optparse_applicative(0,16,0)
99− helpText = ShowHelpText Nothing
100−#else
101− helpText = ShowHelpText
102−#endif
src/lib/ProjectM36/Server/RemoteCallTypes.hs+32−71
@@ -1,103 +1,64 @@
1−{-# LANGUAGE DeriveGeneric, DerivingVia, CPP #-}
1+{-# LANGUAGE DeriveAnyClass, DeriveGeneric #-}
2module ProjectM36.Server.RemoteCallTypes where
2module ProjectM36.Server.RemoteCallTypes where
3import ProjectM36.Base
3import ProjectM36.Base
4import ProjectM36.IsomorphicSchema
4import ProjectM36.IsomorphicSchema
5import ProjectM36.TransactionGraph
5import ProjectM36.TransactionGraph
6−import ProjectM36.DataFrame
7import ProjectM36.TransGraphRelationalExpression
6import ProjectM36.TransGraphRelationalExpression
8import ProjectM36.Session
7import ProjectM36.Session
9−import ProjectM36.Serialise.DataFrame ()
10−import ProjectM36.Serialise.IsomorphicSchema ()
11import GHC.Generics
8import GHC.Generics
12−import Codec.Winery
9+import Data.Binary
13−
10+import Control.Distributed.Process (ProcessId)
14−#define RPCData(typeName) deriving Generic \
15− deriving Serialise via WineryVariant typeName
16
11
17{-# ANN module ("HLint: ignore Use newtype instead of data" :: String) #-}
12{-# ANN module ("HLint: ignore Use newtype instead of data" :: String) #-}
18-- | The initial login message. The argument should be the process id of the initiating client. This ProcessId will receive notification callbacks.
13-- | The initial login message. The argument should be the process id of the initiating client. This ProcessId will receive notification callbacks.
19−data Login = Login DatabaseName
14+data Login = Login ProcessId
20− RPCData(Login)
15+ deriving (Binary, Generic)
21
16
22data Logout = Logout
17data Logout = Logout
23− RPCData(Logout)
18+ deriving (Binary, Generic)
24−
19+data ExecuteRelationalExpr = ExecuteRelationalExpr SessionId RelationalExpr
25−data ExecuteRelationalExpr = ExecuteRelationalExpr SessionId RelationalExpr
20+ deriving (Binary, Generic)
26− RPCData(ExecuteRelationalExpr)
27−
28−data ExecuteDataFrameExpr = ExecuteDataFrameExpr SessionId DataFrameExpr
29− RPCData(ExecuteDataFrameExpr)
30−
31data ExecuteDatabaseContextExpr = ExecuteDatabaseContextExpr SessionId DatabaseContextExpr
21data ExecuteDatabaseContextExpr = ExecuteDatabaseContextExpr SessionId DatabaseContextExpr
32− RPCData(ExecuteDatabaseContextExpr)
22+ deriving (Binary, Generic)
33−
34data ExecuteDatabaseContextIOExpr = ExecuteDatabaseContextIOExpr SessionId DatabaseContextIOExpr
23data ExecuteDatabaseContextIOExpr = ExecuteDatabaseContextIOExpr SessionId DatabaseContextIOExpr
35− RPCData(ExecuteDatabaseContextIOExpr)
24+ deriving (Binary, Generic)
36−
37data ExecuteGraphExpr = ExecuteGraphExpr SessionId TransactionGraphOperator
25data ExecuteGraphExpr = ExecuteGraphExpr SessionId TransactionGraphOperator
38− RPCData(ExecuteGraphExpr)
26+ deriving (Binary, Generic)
39−
40data ExecuteTransGraphRelationalExpr = ExecuteTransGraphRelationalExpr SessionId TransGraphRelationalExpr
27data ExecuteTransGraphRelationalExpr = ExecuteTransGraphRelationalExpr SessionId TransGraphRelationalExpr
41− RPCData(ExecuteTransGraphRelationalExpr)
28+ deriving (Binary, Generic)
42−
43data ExecuteHeadName = ExecuteHeadName SessionId
29data ExecuteHeadName = ExecuteHeadName SessionId
44− RPCData(ExecuteHeadName)
30+ deriving (Binary, Generic)
45−
46data ExecuteTypeForRelationalExpr = ExecuteTypeForRelationalExpr SessionId RelationalExpr
31data ExecuteTypeForRelationalExpr = ExecuteTypeForRelationalExpr SessionId RelationalExpr
47− RPCData(ExecuteTypeForRelationalExpr)
32+ deriving (Binary, Generic)
48−
33+data ExecuteSchemaExpr = ExecuteSchemaExpr SessionId SchemaExpr
49−data ExecuteSchemaExpr = ExecuteSchemaExpr SessionId SchemaExpr RPCData(ExecuteSchemaExpr)
34+ deriving (Binary, Generic)
50−
51data ExecuteSetCurrentSchema = ExecuteSetCurrentSchema SessionId SchemaName
35data ExecuteSetCurrentSchema = ExecuteSetCurrentSchema SessionId SchemaName
52− RPCData(ExecuteSetCurrentSchema)
36+ deriving (Binary, Generic)
53−
54data RetrieveInclusionDependencies = RetrieveInclusionDependencies SessionId
37data RetrieveInclusionDependencies = RetrieveInclusionDependencies SessionId
55− RPCData(RetrieveInclusionDependencies)
38+ deriving (Binary, Generic)
56−
57data RetrievePlanForDatabaseContextExpr = RetrievePlanForDatabaseContextExpr SessionId DatabaseContextExpr
39data RetrievePlanForDatabaseContextExpr = RetrievePlanForDatabaseContextExpr SessionId DatabaseContextExpr
58− RPCData(RetrievePlanForDatabaseContextExpr)
40+ deriving (Binary, Generic)
59−
60data RetrieveTransactionGraph = RetrieveTransactionGraph SessionId
41data RetrieveTransactionGraph = RetrieveTransactionGraph SessionId
61− RPCData(RetrieveTransactionGraph)
42+ deriving (Binary, Generic)
62−
63data RetrieveHeadTransactionId = RetrieveHeadTransactionId SessionId
43data RetrieveHeadTransactionId = RetrieveHeadTransactionId SessionId
64− RPCData(RetrieveHeadTransactionId)
44+ deriving (Binary, Generic)
65−
66data CreateSessionAtCommit = CreateSessionAtCommit TransactionId
45data CreateSessionAtCommit = CreateSessionAtCommit TransactionId
67− RPCData(CreateSessionAtCommit)
46+ deriving (Binary, Generic)
68−
69data CreateSessionAtHead = CreateSessionAtHead HeadName
47data CreateSessionAtHead = CreateSessionAtHead HeadName
70− RPCData(CreateSessionAtHead)
48+ deriving (Binary, Generic)
71−
72data CloseSession = CloseSession SessionId
49data CloseSession = CloseSession SessionId
73− RPCData(CloseSession)
50+ deriving (Binary, Generic)
74−
75data RetrieveAtomTypesAsRelation = RetrieveAtomTypesAsRelation SessionId
51data RetrieveAtomTypesAsRelation = RetrieveAtomTypesAsRelation SessionId
76− RPCData(RetrieveAtomTypesAsRelation)
52+ deriving (Binary, Generic)
77−
78data RetrieveRelationVariableSummary = RetrieveRelationVariableSummary SessionId
53data RetrieveRelationVariableSummary = RetrieveRelationVariableSummary SessionId
79− RPCData(RetrieveRelationVariableSummary)
54+ deriving (Binary, Generic)
80−
81−data RetrieveAtomFunctionSummary = RetrieveAtomFunctionSummary SessionId
82− RPCData(RetrieveAtomFunctionSummary)
83−
84−data RetrieveDatabaseContextFunctionSummary = RetrieveDatabaseContextFunctionSummary SessionId
85− RPCData(RetrieveDatabaseContextFunctionSummary)
86−
87data RetrieveCurrentSchemaName = RetrieveCurrentSchemaName SessionId
55data RetrieveCurrentSchemaName = RetrieveCurrentSchemaName SessionId
88− RPCData(RetrieveCurrentSchemaName)
56+ deriving (Binary, Generic)
89−
90data TestTimeout = TestTimeout SessionId
57data TestTimeout = TestTimeout SessionId
91− RPCData(TestTimeout)
58+ deriving (Binary, Generic)
92−
59+data RetrieveSessionIsDirty = RetrieveSessionIsDirty SessionId
93−data RetrieveSessionIsDirty = RetrieveSessionIsDirty SessionId
60+ deriving (Binary, Generic)
94− RPCData(RetrieveSessionIsDirty)
95−
96data ExecuteAutoMergeToHead = ExecuteAutoMergeToHead SessionId MergeStrategy HeadName
61data ExecuteAutoMergeToHead = ExecuteAutoMergeToHead SessionId MergeStrategy HeadName
97− RPCData(ExecuteAutoMergeToHead)
62+ deriving (Binary, Generic)
98−
99data RetrieveTypeConstructorMapping = RetrieveTypeConstructorMapping SessionId
63data RetrieveTypeConstructorMapping = RetrieveTypeConstructorMapping SessionId
100− RPCData(RetrieveTypeConstructorMapping)
64+ deriving (Binary, Generic)
101−
102−data ExecuteValidateMerkleHashes = ExecuteValidateMerkleHashes SessionId
103− RPCData(ExecuteValidateMerkleHashes)
src/lib/ProjectM36/Session.hs+2−3
@@ -3,7 +3,6 @@ import ProjectM36.Base
3import Data.UUID
3import Data.UUID
4import qualified Data.Map as M
4import qualified Data.Map as M
5import ProjectM36.Error
5import ProjectM36.Error
6−import qualified ProjectM36.DisconnectedTransaction as Discon
7
6
8type SessionId = UUID
7type SessionId = UUID
9
8
@@ -19,7 +18,7 @@ disconnectedTransaction :: Session -> DisconnectedTransaction
19disconnectedTransaction (Session discon _) = discon
18disconnectedTransaction (Session discon _) = discon
20
19
21isDirty :: Session -> DirtyFlag
20isDirty :: Session -> DirtyFlag
22−isDirty (Session discon _) = Discon.isDirty discon
21+isDirty (Session (DisconnectedTransaction _ _ dirtyFlag) _) = dirtyFlag
23
22
24concreteDatabaseContext :: Session -> DatabaseContext
23concreteDatabaseContext :: Session -> DatabaseContext
25concreteDatabaseContext (Session (DisconnectedTransaction _ (Schemas context _) _) _) = context
24concreteDatabaseContext (Session (DisconnectedTransaction _ (Schemas context _) _) _) = context
@@ -41,4 +40,4 @@ setSchemaName sname session = if sname == defaultSchemaName || M.member sname (s
41 pure (Session (disconnectedTransaction session) sname)
40 pure (Session (disconnectedTransaction session) sname)
42 else
41 else
43 Left (SubschemaNameNotInUseError sname)
42 Left (SubschemaNameNotInUseError sname)
44−
43+
src/lib/ProjectM36/Sessions.hs+7−29
@@ -1,42 +1,18 @@
1−{-# LANGUAGE PackageImports #-}
2module ProjectM36.Sessions where
1module ProjectM36.Sessions where
3import Control.Concurrent.STM
2import Control.Concurrent.STM
4−#if MIN_VERSION_stm_containers(1,0,0)
3+import qualified STMContainers.Map as STMMap
5−import qualified StmContainers.Map as StmMap
4+import ListT
6−import qualified StmContainers.Set as StmSet
7−#else
8−import qualified STMContainers.Map as StmMap
9−import qualified STMContainers.Set as StmSet
10−#endif
11import ProjectM36.Attribute
5import ProjectM36.Attribute
12import ProjectM36.Base
6import ProjectM36.Base
13import ProjectM36.Session
7import ProjectM36.Session
14import ProjectM36.Relation
8import ProjectM36.Relation
15import ProjectM36.Error
9import ProjectM36.Error
16import qualified Data.UUID as U
10import qualified Data.UUID as U
17−#if MIN_VERSION_stm_containers(1,0,0)
18−import qualified Control.Foldl as Foldl
19−import qualified DeferredFolds.UnfoldlM as UF
20−#else
21−import "list-t" ListT
22−#endif
23
11
24−type Sessions = StmMap.Map SessionId Session
12+type Sessions = STMMap.Map SessionId Session
25
13
26−--from https://github.com/nikita-volkov/stm-containers/blob/master/test/Main/MapTests.hs
14+stmMapToList :: STMMap.Map k v -> STM [(k, v)]
27−stmMapToList :: StmMap.Map k v -> STM [(k, v)]
15+stmMapToList = ListT.fold (\l -> return . (:l)) [] . STMMap.stream
28−#if MIN_VERSION_stm_containers(1,0,0)
29−stmMapToList = UF.foldM (Foldl.generalize Foldl.list) . StmMap.unfoldlM
30−#else
31−stmMapToList = ListT.fold (\l -> return . (:l)) [] . StmMap.stream
32−#endif
33−
34−stmSetToList :: StmSet.Set v -> STM [v]
35−#if MIN_VERSION_stm_containers(1,0,0)
36−stmSetToList = UF.foldM (Foldl.generalize Foldl.list) . StmSet.unfoldlM
37−#else
38−stmSetToList = ListT.fold (\l -> return . (:l)) [] . StmSet.stream
39−#endif
40
16
41uuidAtom :: U.UUID -> Atom
17uuidAtom :: U.UUID -> Atom
42uuidAtom = TextAtom . U.toText
18uuidAtom = TextAtom . U.toText
@@ -47,3 +23,5 @@ sessionsAsRelation sessions = do
47 let atomMatrix = map (\(sessionId, session) -> [uuidAtom sessionId, uuidAtom (parentId session)]) sessionAssocs
23 let atomMatrix = map (\(sessionId, session) -> [uuidAtom sessionId, uuidAtom (parentId session)]) sessionAssocs
48 pure $ mkRelationFromList (attributesFromList [Attribute "sessionid" TextAtomType,
24 pure $ mkRelationFromList (attributesFromList [Attribute "sessionid" TextAtomType,
49 Attribute "parentCommit" TextAtomType]) atomMatrix
25 Attribute "parentCommit" TextAtomType]) atomMatrix
26+
27+
src/lib/ProjectM36/Shortcuts.hsdeleted−247
@@ -1,247 +0,0 @@
1−{-# OPTIONS_GHC -fno-warn-orphans #-}
2−{-# LANGUAGE ScopedTypeVariables #-}
3−{-# LANGUAGE TypeApplications #-}
4−{-# LANGUAGE FlexibleInstances #-}
5−{-# LANGUAGE MultiParamTypeClasses #-}
6−{-# LANGUAGE TypeFamilies #-}
7−{-# LANGUAGE ExtendedDefaultRules #-}
8−{-# LANGUAGE ExistentialQuantification #-}
9−{-# LANGUAGE FlexibleContexts #-}
10−{-# LANGUAGE GADTs #-}
11−{-# LANGUAGE UndecidableInstances #-}
12−module ProjectM36.Shortcuts where
13−-- users need OverloadedLabels, OverloadedLists, and default(Int,Text) to use these shortcuts.
14−import Data.Text hiding (foldl, map)
15−import ProjectM36.Base
16−import ProjectM36.Relation
17−import ProjectM36.Atomable
18−import Prelude hiding ((!!))
19−import Data.Proxy
20−import GHC.OverloadedLabels
21−import GHC.TypeLits hiding (Text)
22−import qualified Data.Text as T
23−import qualified Data.Map as M
24−import qualified Data.Set as S
25−import GHC.Exts (IsList(..))
26−import Data.Convertible
27−
28−default (Text)
29−
30−instance IsList (AttributeNamesBase ()) where
31− type Item (AttributeNamesBase ()) = AttributeName
32− fromList = AttributeNames . S.fromList
33− toList (AttributeNames ns) = S.toList ns
34− toList _ = error "needs AttributeNames"
35−
36−instance IsList (TupleExprsBase ()) where
37− type Item TupleExprs = TupleExpr
38− fromList ts = TupleExprs () ts
39− toList (TupleExprs _ ts) = ts
40−
41−instance IsList TupleExpr where
42− type Item TupleExpr = (AttributeName, AtomExpr)
43− fromList attributeValues = TupleExpr (M.fromList attributeValues)
44− toList (TupleExpr attributeValues) = M.toList attributeValues
45−
46−
47−-- #xxx :: Text
48−instance KnownSymbol x => IsLabel x Text where
49− fromLabel = T.pack $ symbolVal @x Proxy
50−
51−-- #relvarName :: RelationalExpr
52−instance KnownSymbol x => IsLabel x RelationalExpr where
53− fromLabel = RelationVariable (T.pack $ symbolVal @x Proxy) ()
54−
55−-- *Main> #a Int :: AttributeExpr
56−-- NakedAttributeExpr (Attribute "a" IntAtomType)
57−-- *Main> #a (Attr @[Int]) :: AttributeExpr
58−-- NakedAttributeExpr (Attribute "a" (ConstructedAtomType "List" (fromList [("a",IntAtomType)])))
59−-- can't offer a Relation atomtype -- don't know how to express a Relation type in haskell type. Maybe something a HList of (Text, a) ?
60−--
61−-- ps. I don't understand the usage of "AttributeAndTypeNameExpr AttributeName TypeConstructor a"
62−instance (KnownSymbol x, Atomable a)=> IsLabel x (HaskAtomType a -> AttributeExpr) where
63− fromLabel = (NakedAttributeExpr . Attribute name) . toAtomType''
64− where name = T.pack $ symbolVal @x Proxy
65−
66−-- (#a 1) :: ExtendTupleExpr
67−-- no need for :=
68−instance (Convertible a AtomExpr, KnownSymbol x) => IsLabel x (a -> ExtendTupleExpr) where
69− fromLabel x = AttributeExtendTupleExpr name (convert x)
70− where name = T.pack $ symbolVal @x Proxy
71−
72−-- #name AtomExpr
73−-- ex. tuple [ #name 3 ]
74−-- default(Text) is needed in client code to avoid `no Atomable Char`
75−instance (Convertible a AtomExpr, KnownSymbol x) => IsLabel x (a -> (AttributeName, AtomExpr)) where
76− fromLabel = \x -> (name, convert x)
77− where name = T.pack $ symbolVal @x Proxy
78−
79−-- *Main> #a [1] :: AtomExpr
80−-- FunctionAtomExpr "a" [NakedAtomExpr (IntegerAtom 1)] ()
81−--
82−-- This usage is not working in RestrictionPredicateExpr and AttributeExtendTupleExpr. Use f "a" [1] instead.
83−instance (KnownSymbol x, Convertible a AtomExpr) => IsLabel x ([a] -> AtomExpr) where
84− fromLabel = \as' -> FunctionAtomExpr name (map convert as') ()
85− where name = T.pack $ symbolVal @x Proxy
86−
87−instance (KnownSymbol x) => IsLabel x AtomExpr where
88− fromLabel = AttributeAtomExpr name
89− where name = T.pack $ symbolVal @x Proxy
90−
91−
92−data HaskAtomType a where
93− Int :: HaskAtomType Int
94− Integer :: HaskAtomType Integer
95− Double :: HaskAtomType Double
96− Text :: HaskAtomType Text
97−-- Day :: HaskAtomType Day
98−-- DateTime :: HaskAtomType DateTime
99−-- ByteString :: HaskAtomType ByteString
100− Bool :: HaskAtomType Bool
101− Attr :: Atomable a => HaskAtomType a -- a Proxy-like value for type application.
102−
103−toAtomType'' :: Atomable a => HaskAtomType a -> AtomType
104−toAtomType'' (_ :: HaskAtomType a) = toAtomType (Proxy @a)
105−
106−-- usage: relation [tuple [#a 1, #b "b"], tuple [#a 2, #b "b"]]
107−relation :: [TupleExpr] -> RelationalExpr
108−relation ts = MakeRelationFromExprs Nothing (TupleExprs () ts)
109−
110−relation' :: [AttributeExprBase ()] -> [TupleExpr] -> RelationalExpr
111−relation' as' ts = MakeRelationFromExprs (Just as') (TupleExprs () ts)
112−
113−-- usage: tuple [#name "Mike",#age 6]
114−tuple :: [(AttributeName, AtomExpr)] -> TupleExprBase ()
115−tuple as' = TupleExpr (M.fromList as')
116−
117−-- #a rename [#b `as` #c]
118−rename :: RelationalExpr -> [(AttributeName,AttributeName)] -> RelationalExpr
119−rename relExpr renameList = case renameList of
120− [] -> Restrict TruePredicate relExpr
121− renames ->
122− foldl (\acc (old,new) -> Rename old new acc) relExpr renames
123−
124−--project !!
125−-- #a !! [#b,#c]
126−infix 9 !!
127−(!!) :: RelationalExpr -> AttributeNames -> RelationalExpr
128−relExpr !! xs = Project xs relExpr
129−
130−--join ><
131−-- #a >< #b
132−(><) :: RelationalExpr -> RelationalExpr -> RelationalExpr
133−a >< b = Join a b
134−
135−allBut :: AttributeNames -> AttributeNames
136−allBut (AttributeNames ns) = InvertedAttributeNames ns
137−allBut _ = error "give allBut something other than attribute names."
138−
139−allFrom :: RelationalExpr -> AttributeNames
140−allFrom = RelationalExprAttributeNames
141−
142−as :: AttributeNames -> AttributeName -> (AttributeNames, AttributeName)
143−as = (,)
144−
145−-- #a `group` ([#b,#c] `as` #d)
146−group :: RelationalExpr -> (AttributeNames, AttributeName) -> RelationalExpr
147−group relExpr (aNames, aName) = Group aNames aName relExpr
148−
149−-- #a `ungroup` #b
150−ungroup :: RelationalExpr -> AttributeName -> RelationalExpr
151−ungroup relExpr aName = Ungroup aName relExpr
152−
153−-- *Main> #a #:= true #: ( #b (f "count" [1,2]))
154−-- Assign "a" (Extend (AttributeExtendTupleExpr "b" (FunctionAtomExpr "count" [NakedAtomExpr (IntegerAtom 1),NakedAtomExpr (IntegerAtom 2)] ())) (ExistingRelation (Relation attributesFromList [] (RelationTupleSet {asList = [RelationTuple attributesFromList [] []]}))))
155−(#:) :: RelationalExpr -> ExtendTupleExpr -> RelationalExpr
156−a #: b = Extend b a
157−infix 8 #:
158−
159−instance Convertible AtomExpr AtomExpr where
160− safeConvert n = Right n
161−
162−instance Convertible RelVarName AtomExpr where
163− safeConvert n = Right $ RelationAtomExpr (RelationVariable n ())
164−
165−instance Convertible RelationalExpr AtomExpr where
166− safeConvert relExpr = Right $ RelationAtomExpr relExpr
167−
168−instance Convertible RelVarName RelationalExpr where
169− safeConvert n = Right $ RelationVariable n ()
170−
171−-- @ in tutd
172−-- (@@) "aaa"
173−(@@) :: AttributeName -> AtomExpr
174−(@@) = AttributeAtomExpr
175−
176−-- works in RestrictedPredicateExpr and AttributeExtendTupleExpr
177−-- usage: f "gte" [1]
178−f :: Convertible a AtomExpr => AtomFunctionName -> [a] -> AtomExpr
179−f n as' = FunctionAtomExpr n (map convert as') ()
180−
181−-- DatabaseContextExpr
182−-- define
183−(#::) :: RelVarName -> [AttributeExpr] -> DatabaseContextExpr
184−s #:: xs = Define s xs
185−infix 5 #::
186−
187−-- assign
188−(#:=) :: RelVarName -> RelationalExpr -> DatabaseContextExpr
189−s #:= r = Assign s r
190−infix 5 #:=
191−
192−class Boolean a b where
193− (&&&) :: a -> b -> RestrictionPredicateExpr
194− infixl 6 &&&
195− (|||) :: a -> b -> RestrictionPredicateExpr
196− infixl 5 |||
197−
198−-- where: @~ mimics the restriction symbol in algebra
199−-- usage: true #: (#a 1) @~ #a ?= 1 &&& not' false ||| (f "gte" [1])
200−(@~) :: Convertible a RestrictionPredicateExpr => RelationalExpr -> a -> RelationalExpr
201−(@~) relExpr resPreExpr = Restrict (convert resPreExpr) relExpr
202−infix 4 @~
203−
204−true :: RelationalExpr
205−true = ExistingRelation relationTrue
206−
207−false :: RelationalExpr
208−false = ExistingRelation relationFalse
209−
210−trueP :: RestrictionPredicateExprBase a
211−trueP = TruePredicate
212−
213−falseP :: RestrictionPredicateExprBase a
214−falseP = NotPredicate TruePredicate
215−
216−(?=) :: Convertible a AtomExpr => AttributeName -> a -> RestrictionPredicateExpr
217−(?=) name a = AttributeEqualityPredicate name (convert a)
218−infix 9 ?=
219−
220−not' :: Convertible a RestrictionPredicateExpr => a -> RestrictionPredicateExpr
221−not' = NotPredicate . convert
222−
223−instance (Convertible a RestrictionPredicateExpr, Convertible b RestrictionPredicateExpr) => Boolean a b where
224− a &&& b = AndPredicate (convert a) (convert b)
225− a ||| b = OrPredicate (convert a) (convert b)
226−
227−instance {-# Incoherent #-} Atomable a => Convertible a RestrictionPredicateExpr where
228− safeConvert n = Right $ AtomExprPredicate $ toAtomExpr . toAtom $ n
229−
230−instance {-# Incoherent #-} Convertible RelationalExpr RestrictionPredicateExpr where
231− safeConvert a = Right $ RelationalExprPredicate a
232−
233−instance {-# Incoherent #-} Convertible AtomExpr RestrictionPredicateExpr where
234− safeConvert a = Right $ AtomExprPredicate a
235−
236−instance {-# Incoherent #-} Convertible RestrictionPredicateExpr RestrictionPredicateExpr where
237− safeConvert a = Right a
238−
239−instance {-# Incoherent #-} Atomable a => Convertible a AtomExpr where
240− safeConvert n = Right $ toAtomExpr . toAtom $ n
241−
242−toAtomExpr :: Atom -> AtomExpr
243−toAtomExpr (ConstructedAtom n _ xs) = ConstructedAtomExpr n (toAtomExpr <$> xs) ()
244−toAtomExpr a = NakedAtomExpr a
245−
246−
247−
src/lib/ProjectM36/StaticOptimizer.hs+248−373
@@ -1,402 +1,287 @@
1−{-# LANGUAGE FlexibleInstances #-}
2−{-# LANGUAGE FlexibleContexts #-}
3module ProjectM36.StaticOptimizer where
1module ProjectM36.StaticOptimizer where
4import ProjectM36.Base
2import ProjectM36.Base
5−import ProjectM36.GraphRefRelationalExpr
6−import ProjectM36.Relation
7import ProjectM36.RelationalExpression
3import ProjectM36.RelationalExpression
8−import ProjectM36.TransGraphRelationalExpression as TGRE hiding (askGraph)
4+import ProjectM36.Relation
9import ProjectM36.Error
5import ProjectM36.Error
10−import ProjectM36.Transaction
11−import ProjectM36.NormalizeExpr
12import qualified ProjectM36.Attribute as A
6import qualified ProjectM36.Attribute as A
13import qualified ProjectM36.AttributeNames as AS
7import qualified ProjectM36.AttributeNames as AS
14import ProjectM36.TupleSet
8import ProjectM36.TupleSet
15import Control.Monad.State
9import Control.Monad.State
16−import Control.Monad.Reader
10+import Data.Either (rights, lefts)
17−import Control.Monad.Except
11+import Control.Monad.Trans.Reader
18−import Control.Monad.Trans.Except
19−import Data.Functor.Identity
20import qualified Data.Map as M
12import qualified Data.Map as M
21import qualified Data.Set as S
13import qualified Data.Set as S
22
14
23-- the static optimizer performs optimizations which need not take any specific-relation statistics into account
15-- the static optimizer performs optimizations which need not take any specific-relation statistics into account
24−
16+optimizeRelationalExpr :: DatabaseContext -> RelationalExpr -> Either RelationalError RelationalExpr
25−data GraphRefSOptRelationalExprEnv =
17+optimizeRelationalExpr context expr = runReader (optimizeRelationalExprReader expr) (mkRelationalExprState context)
26− GraphRefSOptRelationalExprEnv
18+
27− {
19+optimizeRelationalExprReader :: RelationalExpr -> RelationalExprState (Either RelationalError RelationalExpr)
28− ore_graph :: TransactionGraph,
20+optimizeRelationalExprReader expr = do
29− ore_mcontext :: Maybe DatabaseContext
21+ eOptExpr <- applyStaticRelationalOptimization expr
30− }
31−
32−type GraphRefSOptRelationalExprM a = ReaderT GraphRefSOptRelationalExprEnv (ExceptT RelationalError Identity) a
33−
34−data GraphRefSOptDatabaseContextExprEnv =
35− GraphRefSOptDatabaseContextExprEnv
36− {
37− odce_graph :: TransactionGraph,
38− odce_context :: DatabaseContext, --not optional for DatabaseContextExpr evaluation
39− odce_transId :: TransactionId -- parent if context is committed- needed because MultipleExpr optimization requires running the DatabaseContextExprs (with empty relvars)
40− }
41−
42−type GraphRefSOptDatabaseContextExprM a = ReaderT GraphRefSOptDatabaseContextExprEnv (ExceptT RelationalError Identity) a
43−
44−-- | A temporary function to be replaced by IO-based implementation.
45−optimizeAndEvalRelationalExpr :: RelationalExprEnv -> RelationalExpr -> Either RelationalError Relation
46−optimizeAndEvalRelationalExpr env expr = do
47− let gfExpr = runProcessExprM UncommittedContextMarker (processRelationalExpr expr) -- references parent tid instead of context! options- I could add the context to the graph with a new transid or implement an evalRelationalExpr in RE.hs to use the context (which is what I had previously)
48− graph = re_graph env
49− ctx = re_context env
50− gfEnv = freshGraphRefRelationalExprEnv (Just ctx) graph
51− optExpr <- runGraphRefSOptRelationalExprM (Just ctx) (re_graph env) (fullOptimizeGraphRefRelationalExpr gfExpr)
52− runGraphRefRelationalExprM gfEnv (evalGraphRefRelationalExpr optExpr)
53−
54−class Monad m => AskGraphContext m where
55− askGraph :: m TransactionGraph
56− askContext :: m DatabaseContext
57−
58−instance AskGraphContext (ReaderT GraphRefSOptDatabaseContextExprEnv (ExceptT RelationalError Identity)) where
59− askGraph = asks odce_graph
60− askContext = asks odce_context
61−
62−instance AskGraphContext (ReaderT GraphRefSOptRelationalExprEnv (ExceptT RelationalError Identity)) where
63− askGraph = asks ore_graph
64− askContext = do
65− mctx <- asks ore_mcontext
66− case mctx of
67− Nothing -> throwError NoUncommittedContextInEvalError
68− Just ctx -> pure ctx
69−
70−askTransId :: GraphRefSOptDatabaseContextExprM TransactionId
71−askTransId = asks odce_transId
72−
73−askMaybeContext :: GraphRefSOptRelationalExprM (Maybe DatabaseContext)
74−askMaybeContext = asks ore_mcontext
75−
76−optimizeDatabaseContextExpr :: DatabaseContextExpr -> GraphRefSOptDatabaseContextExprM GraphRefDatabaseContextExpr
77−optimizeDatabaseContextExpr expr = do
78− let gfExpr = runProcessExprM UncommittedContextMarker (processDatabaseContextExpr expr)
79− optimizeGraphRefDatabaseContextExpr gfExpr
80−
81−optimizeAndEvalDatabaseContextExpr :: Bool -> DatabaseContextExpr -> DatabaseContextEvalMonad ()
82−optimizeAndEvalDatabaseContextExpr optimize expr = do
83− graph <- asks dce_graph
84− transId <- asks dce_transId
85− context <- getStateContext
86− let gfExpr = runProcessExprM UncommittedContextMarker (processDatabaseContextExpr expr)
87− eOptExpr = if optimize then
88− runGraphRefSOptDatabaseContextExprM transId context graph (optimizeGraphRefDatabaseContextExpr gfExpr)
89− else
90− pure gfExpr
91− case eOptExpr of
92− Left err -> throwError err
93− Right optExpr -> evalGraphRefDatabaseContextExpr optExpr
94−
95−
96−optimizeAndEvalTransGraphRelationalExpr :: TransactionGraph -> TransGraphRelationalExpr -> Either RelationalError Relation
97−optimizeAndEvalTransGraphRelationalExpr graph tgExpr = do
98− gfExpr <- TGRE.process (TransGraphEvalEnv graph) tgExpr
99− optExpr <- runGraphRefSOptRelationalExprM Nothing graph (fullOptimizeGraphRefRelationalExpr gfExpr)
100− let gfEnv = freshGraphRefRelationalExprEnv Nothing graph
101− runGraphRefRelationalExprM gfEnv (evalGraphRefRelationalExpr optExpr)
102−
103−optimizeAndEvalDatabaseContextIOExpr :: DatabaseContextIOExpr -> DatabaseContextIOEvalMonad (Either RelationalError ())
104−optimizeAndEvalDatabaseContextIOExpr expr = do
105− transId <- asks dbcio_transId
106− ctx <- getDBCIOContext
107− graph <- asks dbcio_graph
108− let gfExpr = runProcessExprM UncommittedContextMarker (processDatabaseContextIOExpr expr)
109− eOptExpr = runGraphRefSOptDatabaseContextExprM transId ctx graph (optimizeDatabaseContextIOExpr gfExpr)
110 case eOptExpr of
22 case eOptExpr of
111 Left err -> pure (Left err)
23 Left err -> pure (Left err)
112 Right optExpr ->
24 Right optExpr ->
113− evalGraphRefDatabaseContextIOExpr optExpr
25+ applyStaticJoinElimination (applyStaticRestrictionPushdown (applyStaticRestrictionCollapse optExpr))
114−
115−{-
116−runStaticOptimizerMonad :: RelationalExprEnv -> StaticOptimizerMonad a -> Either RelationalError a
117−runStaticOptimizerMonad env m = runIdentity (runExceptT (runReaderT m env))
118−-}
119−
120−runGraphRefSOptRelationalExprM ::
121− Maybe DatabaseContext ->
122− TransactionGraph ->
123− GraphRefSOptRelationalExprM a ->
124− Either RelationalError a
125−runGraphRefSOptRelationalExprM mctx graph m = runIdentity (runExceptT (runReaderT m env))
126− where
127− env = GraphRefSOptRelationalExprEnv {
128− ore_graph = graph,
129− ore_mcontext = mctx
130− }
131−
132−
133−runGraphRefSOptDatabaseContextExprM ::
134− TransactionId ->
135− DatabaseContext ->
136− TransactionGraph ->
137− GraphRefSOptDatabaseContextExprM a ->
138− Either RelationalError a
139−runGraphRefSOptDatabaseContextExprM tid ctx graph m =
140− runIdentity (runExceptT (runReaderT m env))
141− where
142− env = GraphRefSOptDatabaseContextExprEnv {
143− odce_graph = graph,
144− odce_context = ctx,
145− odce_transId = tid
146− }
147−
148−optimizeGraphRefRelationalExpr' ::
149− Maybe DatabaseContext ->
150− TransactionGraph ->
151− GraphRefRelationalExpr ->
152− Either RelationalError GraphRefRelationalExpr
153−optimizeGraphRefRelationalExpr' mctx graph expr =
154− runIdentity (runExceptT (runReaderT (optimizeGraphRefRelationalExpr expr) env))
155− where
156− env = GraphRefSOptRelationalExprEnv {
157− ore_graph = graph,
158− ore_mcontext = mctx
159− }
160−
161−-- | optimize relational expression within database context expr monad
162−liftGraphRefRelExpr :: GraphRefSOptRelationalExprM a -> GraphRefSOptDatabaseContextExprM a
163−liftGraphRefRelExpr m = do
164− context <- asks odce_context
165− graph <- asks odce_graph
166− lift $ except $ runGraphRefSOptRelationalExprM (Just context) graph m
167−
168−fullOptimizeGraphRefRelationalExpr :: GraphRefRelationalExpr -> GraphRefSOptRelationalExprM GraphRefRelationalExpr
169−fullOptimizeGraphRefRelationalExpr expr = do
170− optExpr <- optimizeGraphRefRelationalExpr expr
171− let optExpr' = applyStaticRestrictionPushdown (applyStaticRestrictionCollapse optExpr)
172− applyStaticJoinElimination optExpr'
173
26
27+optimizeDatabaseContextExpr :: DatabaseContext -> DatabaseContextExpr -> Either RelationalError DatabaseContextExpr
28+optimizeDatabaseContextExpr context dbExpr = evalState (applyStaticDatabaseOptimization dbExpr) (freshDatabaseState context)
174-- apply optimizations which merely remove steps to become no-ops: example: projection of a relation across all of its attributes => original relation
29-- apply optimizations which merely remove steps to become no-ops: example: projection of a relation across all of its attributes => original relation
175
30
176--should optimizations offer the possibility to pure errors? If they perform the up-front type-checking, maybe so
31--should optimizations offer the possibility to pure errors? If they perform the up-front type-checking, maybe so
177−optimizeGraphRefRelationalExpr :: GraphRefRelationalExpr -> GraphRefSOptRelationalExprM GraphRefRelationalExpr
32+applyStaticRelationalOptimization :: RelationalExpr -> RelationalExprState (Either RelationalError RelationalExpr)
178−optimizeGraphRefRelationalExpr e@(MakeStaticRelation _ _) = pure e
33+applyStaticRelationalOptimization e@(MakeStaticRelation _ _) = pure $ Right e
179
34
180−optimizeGraphRefRelationalExpr e@MakeRelationFromExprs{} = pure e
35+applyStaticRelationalOptimization e@(MakeRelationFromExprs _ _) = pure $ Right e
181
36
182−optimizeGraphRefRelationalExpr e@(ExistingRelation _) = pure e
37+applyStaticRelationalOptimization e@(ExistingRelation _) = pure $ Right e
183
38
184−optimizeGraphRefRelationalExpr e@(RelationVariable _ _) = pure e
39+applyStaticRelationalOptimization e@(RelationVariable _ _) = pure $ Right e
185
40
186--remove project of attributes which removes no attributes
41--remove project of attributes which removes no attributes
187−optimizeGraphRefRelationalExpr (Project attrNameSet expr) = do
42+applyStaticRelationalOptimization (Project attrNameSet expr) = do
188− graph <- askGraph
43+ relType <- typeForRelationalExpr expr
189− mctx <- askMaybeContext
190− let relType = runGraphRefRelationalExprM gfEnv (typeForGraphRefRelationalExpr expr)
191− gfEnv = freshGraphRefRelationalExprEnv mctx graph
192 case relType of
44 case relType of
193− Left err -> throwError err
45+ Left err -> pure $ Left err
194 Right relType2
46 Right relType2
195− | AS.all == attrNameSet ->
47+ | AS.all == attrNameSet ->
196− optimizeGraphRefRelationalExpr expr
48+ applyStaticRelationalOptimization expr
197 | AttributeNames (attributeNames relType2) == attrNameSet ->
49 | AttributeNames (attributeNames relType2) == attrNameSet ->
198− optimizeGraphRefRelationalExpr expr
50+ applyStaticRelationalOptimization expr
199 | otherwise -> do
51 | otherwise -> do
200− optSubExpr <- optimizeGraphRefRelationalExpr expr
52+ optimizedSubExpression <- applyStaticRelationalOptimization expr
201− pure (Project attrNameSet optSubExpr)
53+ case optimizedSubExpression of
54+ Left err -> pure $ Left err
55+ Right optSubExpr -> pure (Right (Project attrNameSet optSubExpr))
202
56
203−optimizeGraphRefRelationalExpr (Union exprA exprB) = do
57+applyStaticRelationalOptimization (Union exprA exprB) = do
204− optExprA <- optimizeGraphRefRelationalExpr exprA
58+ eOptExprA <- applyStaticRelationalOptimization exprA
205− optExprB <- optimizeGraphRefRelationalExpr exprB
59+ eOptExprB <- applyStaticRelationalOptimization exprB
206− -- (x where pred1) union (x where pred2) -> (x where pred1 or pred2)
60+ case eOptExprA of
207− case (optExprA, optExprB) of
61+ Left err -> pure $ Left err
208− (Restrict predA (RelationVariable nameA sA),
62+ Right optExprA -> case eOptExprB of
209− Restrict predB (RelationVariable nameB sB)) | nameA == nameB && sA == sB -> pure (Restrict (AndPredicate predA predB) (RelationVariable nameA sA))
63+ Left err -> pure $ Left err
210− (exprA', exprB') | isEmptyRelationExpr exprA' -> pure exprB'
64+ Right optExprB -> -- (x where pred1) union (x where pred2) -> (x where pred1 or pred2)
211− | isEmptyRelationExpr exprB' -> pure exprA'
65+ case (optExprA, optExprB) of
66+ (Restrict predA (RelationVariable nameA ()),
67+ Restrict predB (RelationVariable nameB ())) | nameA == nameB -> pure (Right (Restrict (AndPredicate predA predB) (RelationVariable nameA ())))
212 _ -> if optExprA == optExprB then
68 _ -> if optExprA == optExprB then
213− pure optExprA
69+ pure (Right optExprA)
214 else
70 else
215− pure $ Union optExprA optExprB
71+ pure $ Right $ Union optExprA optExprB
216
72
217−optimizeGraphRefRelationalExpr (Join exprA exprB) = do
73+applyStaticRelationalOptimization (Join exprA exprB) = do
218− optExprA <- optimizeGraphRefRelationalExpr exprA
74+ eOptExprA <- applyStaticRelationalOptimization exprA
219− optExprB <- optimizeGraphRefRelationalExpr exprB
75+ eOptExprB <- applyStaticRelationalOptimization exprB
220− -- if the relvars to join are the same but with predicates, then just AndPredicate the predicates
76+ case eOptExprA of
221− case (optExprA, optExprB) of
77+ Left err -> pure $ Left err
222− (Restrict predA (RelationVariable nameA sA),
78+ Right optExprA -> case eOptExprB of
223− Restrict predB (RelationVariable nameB sB)) | nameA == nameB && sA == sB -> pure (Restrict (AndPredicate predA predB) (RelationVariable nameA sA))
79+ Left err -> pure $ Left err
80+ Right optExprB ->
81+ -- if the relvars to join are the same but with predicates, then just AndPredicate the predicates
82+ case (optExprA, optExprB) of
83+ (Restrict predA (RelationVariable nameA ()),
84+ Restrict predB (RelationVariable nameB ())) | nameA == nameB -> pure (Right (Restrict (AndPredicate predA predB) (RelationVariable nameA ())))
224 _ -> if optExprA == optExprB then --A join A == A
85 _ -> if optExprA == optExprB then --A join A == A
225− pure optExprA
86+ pure (Right optExprA)
226 else
87 else
227− pure (Join optExprA optExprB)
88+ pure (Right (Join optExprA optExprB))
228
89
229−optimizeGraphRefRelationalExpr (Difference exprA exprB) = do
90+applyStaticRelationalOptimization (Difference exprA exprB) = do
230− graph <- askGraph
91+ optExprA <- applyStaticRelationalOptimization exprA
231− context <- askMaybeContext
92+ optExprB <- applyStaticRelationalOptimization exprB
232− optExprA <- optimizeGraphRefRelationalExpr exprA
93+ case optExprA of
233− optExprB <- optimizeGraphRefRelationalExpr exprB
94+ Left err -> pure $ Left err
234− if optExprA == optExprB then do --A difference A == A where false
95+ Right optExprA2 -> case optExprB of
235− let eEmptyRel = runGraphRefRelationalExprM gfEnv (typeForGraphRefRelationalExpr optExprA)
96+ Left err -> pure $ Left err
236− gfEnv = freshGraphRefRelationalExprEnv context graph
97+ Right optExprB2 -> if optExprA == optExprB then do --A difference A == A where false
237− case eEmptyRel of
98+ eEmptyRel <- typeForRelationalExpr optExprA2
238− Left err -> throwError err
99+ case eEmptyRel of
239− Right emptyRel -> pure (ExistingRelation emptyRel)
100+ Left err -> pure (Left err)
240− else
101+ Right emptyRel -> pure (Right (ExistingRelation emptyRel))
241− pure (Difference optExprA optExprB)
102+ else
103+ pure $ Right (Difference optExprA2 optExprB2)
242
104
243−optimizeGraphRefRelationalExpr e@Rename{} = pure e
105+applyStaticRelationalOptimization e@Rename{} = pure $ Right e
244
106
245−optimizeGraphRefRelationalExpr (Group oldAttrNames newAttrName expr) =
107+applyStaticRelationalOptimization (Group oldAttrNames newAttrName expr) =
246− pure $ Group oldAttrNames newAttrName expr
108+ pure $ Right $ Group oldAttrNames newAttrName expr
247
109
248−optimizeGraphRefRelationalExpr (Ungroup attrName expr) =
110+applyStaticRelationalOptimization (Ungroup attrName expr) =
249− pure $ Ungroup attrName expr
111+ pure $ Right $ Ungroup attrName expr
250
112
251--remove restriction of nothing
113--remove restriction of nothing
252−optimizeGraphRefRelationalExpr (Restrict predicate expr) = do
114+applyStaticRelationalOptimization (Restrict predicate expr) = do
253− graph <- askGraph
254− mctx <- askMaybeContext
255 optimizedPredicate <- applyStaticPredicateOptimization predicate
115 optimizedPredicate <- applyStaticPredicateOptimization predicate
256 case optimizedPredicate of
116 case optimizedPredicate of
257− optimizedPredicate' | isTrueExpr optimizedPredicate' -> optimizeGraphRefRelationalExpr expr -- remove predicate entirely
117+ Left err -> pure $ Left err
258− optimizedPredicate' | isFalseExpr optimizedPredicate' -> do -- replace where false predicate with empty relation with attributes from relexpr
118+ Right optimizedPredicate2
259− let attributesRel = runGraphRefRelationalExprM gfEnv (typeForGraphRefRelationalExpr expr)
119+ | isTrueExpr optimizedPredicate2 -> applyStaticRelationalOptimization expr -- remove predicate entirely
260− gfEnv = freshGraphRefRelationalExprEnv mctx graph
120+ | isFalseExpr optimizedPredicate2 -> do -- replace where false predicate with empty relation with attributes from relexpr
121+ attributesRel <- typeForRelationalExpr expr
261 case attributesRel of
122 case attributesRel of
262− Left err -> throwError err
123+ Left err -> pure $ Left err
263− Right attributesRelA -> pure $ MakeStaticRelation (attributes attributesRelA) emptyTupleSet
124+ Right attributesRelA -> pure $ Right $ MakeStaticRelation (attributes attributesRelA) emptyTupleSet
264 | otherwise -> do
125 | otherwise -> do
265− optSubExpr <- optimizeGraphRefRelationalExpr expr
126+ optimizedSubExpression <- applyStaticRelationalOptimization expr
266− pure $ Restrict optimizedPredicate' optSubExpr
127+ case optimizedSubExpression of
128+ Left err -> pure $ Left err
129+ Right optSubExpr -> pure $ Right $ Restrict optimizedPredicate2 optSubExpr
267
130
268−optimizeGraphRefRelationalExpr e@(Equals _ _) = pure e
131+applyStaticRelationalOptimization e@(Equals _ _) = pure $ Right e
269
132
270−optimizeGraphRefRelationalExpr e@(NotEquals _ _) = pure e
133+applyStaticRelationalOptimization e@(NotEquals _ _) = pure $ Right e
271
134
272−optimizeGraphRefRelationalExpr e@(Extend _ _) = pure e
135+applyStaticRelationalOptimization e@(Extend _ _) = pure $ Right e
273
136
274−optimizeGraphRefRelationalExpr e@(With _ _) = pure e
137+applyStaticDatabaseOptimization :: DatabaseContextExpr -> DatabaseState (Either RelationalError DatabaseContextExpr)
138+applyStaticDatabaseOptimization x@NoOperation = pure $ Right x
139+applyStaticDatabaseOptimization x@(Define _ _) = pure $ Right x
275
140
276−-- database context expr
141+applyStaticDatabaseOptimization x@(Undefine _) = pure $ Right x
277−optimizeGraphRefDatabaseContextExpr :: GraphRefDatabaseContextExpr -> GraphRefSOptDatabaseContextExprM GraphRefDatabaseContextExpr
278−optimizeGraphRefDatabaseContextExpr x@NoOperation = pure x
279−optimizeGraphRefDatabaseContextExpr x@(Define _ _) = pure x
280
142
281−optimizeGraphRefDatabaseContextExpr x@(Undefine _) = pure x
143+applyStaticDatabaseOptimization (Assign name expr) = do
282−
144+ context <- getStateContext
283−optimizeGraphRefDatabaseContextExpr (Assign name expr) = do
145+ let optimizedExpr = optimizeRelationalExpr context expr
284− optExpr <- liftGraphRefRelExpr (fullOptimizeGraphRefRelationalExpr expr)
146+ case optimizedExpr of
285− pure $ Assign name optExpr
147+ Left err -> pure $ Left err
148+ Right optimizedExpr2 -> pure $ Right (Assign name optimizedExpr2)
286
149
287−optimizeGraphRefDatabaseContextExpr (Insert targetName expr) = do
150+applyStaticDatabaseOptimization (Insert targetName expr) = do
288− optimizedExpr <- liftGraphRefRelExpr (fullOptimizeGraphRefRelationalExpr expr)
151+ context <- getStateContext
289− if isEmptyRelationExpr optimizedExpr then -- if we are trying to insert an empty relation, do nothing
152+ let optimizedExpr = optimizeRelationalExpr context expr
290− pure NoOperation
153+ case optimizedExpr of
291− else
154+ Left err -> pure $ Left err
292− case optimizedExpr of
155+ Right optimizedExpr2 -> if isEmptyRelationExpr optimizedExpr2 then -- if we are trying to insert an empty relation, do nothing
293− -- if the target relvar and the insert relvar are the same, there is nothing to do
156+ pure (Right NoOperation)
294− -- insert s s -> NoOperation
157+ else
295− RelationVariable insName _ | insName == targetName -> pure NoOperation
158+ case optimizedExpr2 of
296− _ -> pure (Insert targetName optimizedExpr)
159+ -- if the target relvar and the insert relvar are the same, there is nothing to do
160+ -- insert s s -> NoOperation
161+ RelationVariable insName () | insName == targetName -> pure (Right NoOperation)
162+ _ -> pure $ Right (Insert targetName optimizedExpr2)
297
163
298−optimizeGraphRefDatabaseContextExpr (Delete name predicate) =
164+applyStaticDatabaseOptimization (Delete name predicate) = do
299− Delete name <$> liftGraphRefRelExpr (applyStaticPredicateOptimization predicate)
165+ context <- getStateContext
166+ let optimizedPredicate = runReader (applyStaticPredicateOptimization predicate) (RelationalExprStateElems context)
167+ case optimizedPredicate of
168+ Left err -> pure $ Left err
169+ Right optimizedPredicate2 -> pure $ Right (Delete name optimizedPredicate2)
300
170
301−optimizeGraphRefDatabaseContextExpr (Update name upmap predicate) =
171+applyStaticDatabaseOptimization (Update name upmap predicate) = do
302− Update name upmap <$> liftGraphRefRelExpr (applyStaticPredicateOptimization predicate)
172+ context <- getStateContext
173+ let optimizedPredicate = runReader (applyStaticPredicateOptimization predicate) (RelationalExprStateElems context)
174+ case optimizedPredicate of
175+ Left err -> pure $ Left err
176+ Right optimizedPredicate2 -> pure $ Right (Update name upmap optimizedPredicate2)
303
177
304−optimizeGraphRefDatabaseContextExpr dep@(AddInclusionDependency _ _) = pure dep
178+applyStaticDatabaseOptimization dep@(AddInclusionDependency _ _) = pure $ Right dep
305
179
306−optimizeGraphRefDatabaseContextExpr (RemoveInclusionDependency name) = pure (RemoveInclusionDependency name)
180+applyStaticDatabaseOptimization (RemoveInclusionDependency name) = pure $ Right (RemoveInclusionDependency name)
307
181
308−optimizeGraphRefDatabaseContextExpr (AddNotification name triggerExpr resultOldExpr resultNewExpr) =
182+applyStaticDatabaseOptimization (AddNotification name triggerExpr resultOldExpr resultNewExpr) = do
309− --we can't optimize these expressions until they run
183+ context <- getStateContext
310− pure (AddNotification name triggerExpr resultOldExpr resultNewExpr)
184+ let eTriggerExprOpt = optimizeRelationalExpr context triggerExpr
185+ case eTriggerExprOpt of
186+ Left err -> pure $ Left err
187+ Right triggerExprOpt -> --it doesn't make sense to optimize queries when we don't have their proper contexts
188+ pure (Right (AddNotification name triggerExprOpt resultOldExpr resultNewExpr))
311
189
312−optimizeGraphRefDatabaseContextExpr notif@(RemoveNotification _) = pure notif
190+applyStaticDatabaseOptimization notif@(RemoveNotification _) = pure (Right notif)
313
191
314−optimizeGraphRefDatabaseContextExpr c@(AddTypeConstructor _ _) = pure c
192+applyStaticDatabaseOptimization c@(AddTypeConstructor _ _) = pure (Right c)
315−optimizeGraphRefDatabaseContextExpr c@(RemoveTypeConstructor _) = pure c
193+applyStaticDatabaseOptimization c@(RemoveTypeConstructor _) = pure (Right c)
316−optimizeGraphRefDatabaseContextExpr c@(RemoveAtomFunction _) = pure c
194+applyStaticDatabaseOptimization c@(RemoveAtomFunction _) = pure (Right c)
317−optimizeGraphRefDatabaseContextExpr c@(RemoveDatabaseContextFunction _) = pure c
195+applyStaticDatabaseOptimization c@(RemoveDatabaseContextFunction _) = pure (Right c)
318−optimizeGraphRefDatabaseContextExpr c@(ExecuteDatabaseContextFunction _ _) = pure c
196+applyStaticDatabaseOptimization c@(ExecuteDatabaseContextFunction _ _) = pure (Right c)
319
197
320--optimization: from pgsql lists- check for join condition referencing foreign key- if join projection project away the referenced table, then it does not need to be scanned
198--optimization: from pgsql lists- check for join condition referencing foreign key- if join projection project away the referenced table, then it does not need to be scanned
321
199
322--applyStaticDatabaseOptimization (MultipleExpr exprs) = pure $ Right $ MultipleExpr exprs
200--applyStaticDatabaseOptimization (MultipleExpr exprs) = pure $ Right $ MultipleExpr exprs
323--for multiple expressions, we must evaluate
201--for multiple expressions, we must evaluate
324−optimizeGraphRefDatabaseContextExpr (MultipleExpr exprs) = do
202+applyStaticDatabaseOptimization (MultipleExpr exprs) = do
325− --a previous expression in the exprs list could create a relvar; we don't want to miss it, so we clear the tuples and execute the expression to get an empty relation in the relvar
203+ context <- getStateContext
326− context <- askContext
204+ let optExprs = evalState substateRunner (contextWithEmptyTupleSets context, M.empty, False)
327− graph <- askGraph
205+ let errors = lefts optExprs
328− parentId <- askTransId
206+ if not (null errors) then
329−
207+ pure $ Left (head errors)
330− let emptyRvs ctx = ctx { relationVariables = mkEmptyRelVars (relationVariables ctx) }
208+ else
331− dbcEnv = mkDatabaseContextEvalEnv parentId graph
209+ pure $ Right $ MultipleExpr (rights optExprs)
332− folder (ctx, expracc) expr = do
210+ where
333− --optimize the expr and run it against empty relvars to add it to the context
211+ substateRunner = forM exprs $ \expr -> do
334− case runGraphRefSOptDatabaseContextExprM parentId ctx graph (optimizeGraphRefDatabaseContextExpr expr) of
212+ --a previous expression could create a relvar, we don't want to miss it, so we clear the tuples and execute the expression to get an empty relation in the relvar
335− Left err -> throwError err
213+ _ <- evalDatabaseContextExpr expr
336− Right optExpr ->
214+ applyStaticDatabaseOptimization expr
337− case runDatabaseContextEvalMonad ctx dbcEnv (evalGraphRefDatabaseContextExpr optExpr) of
215+ --this error handling could be improved with some lifting presumably
338− Left err -> throwError err
216+ --restore original context
339− Right dbcState ->
217+
340− pure (emptyRvs $ dbc_context dbcState, expracc ++ [optExpr])
218+applyStaticPredicateOptimization :: RestrictionPredicateExpr -> RelationalExprState (Either RelationalError RestrictionPredicateExpr)
341−
342− (_, exprs') <- foldM folder (context,[]) exprs
343− pure (MultipleExpr exprs')
344−
345−applyStaticPredicateOptimization :: GraphRefRestrictionPredicateExpr -> GraphRefSOptRelationalExprM GraphRefRestrictionPredicateExpr
346applyStaticPredicateOptimization predi = do
219applyStaticPredicateOptimization predi = do
347− optPred <- case predi of
220+ eOptPred <- case predi of
348-- where x and x => where x
221-- where x and x => where x
349 AndPredicate pred1 pred2 -> do
222 AndPredicate pred1 pred2 -> do
350− optPredA <- applyStaticPredicateOptimization pred1
223+ eOptPred1 <- applyStaticPredicateOptimization pred1
351− optPredB <- applyStaticPredicateOptimization pred2
224+ case eOptPred1 of
352− if optPredA == optPredB then
225+ Left err -> pure (Left err)
353− pure optPredA
226+ Right optPred1 -> do
354− else
227+ eOptPred2 <- applyStaticPredicateOptimization pred2
355− pure (AndPredicate optPredA optPredB)
228+ case eOptPred2 of
229+ Left err -> pure (Left err)
230+ Right optPred2 ->
231+ if optPred1 == optPred2 then
232+ pure (Right optPred1)
233+ else
234+ pure (Right (AndPredicate optPred1 optPred2))
356-- where x or x => where x
235-- where x or x => where x
357 OrPredicate pred1 pred2 -> do
236 OrPredicate pred1 pred2 -> do
358− optPredA <- applyStaticPredicateOptimization pred1
237+ eOptPred1 <- applyStaticPredicateOptimization pred1
359− optPredB <- applyStaticPredicateOptimization pred2
238+ case eOptPred1 of
360− if (optPredA == optPredB) || isTrueExpr optPredA then
239+ Left err -> pure (Left err)
361− pure optPredA
240+ Right optPred1 -> do
362− else if isTrueExpr optPredB then
241+ eOptPred2 <- applyStaticPredicateOptimization pred2
363− pure optPredB
242+ case eOptPred2 of
364− else
243+ Left err -> pure (Left err)
365− pure (OrPredicate optPredA optPredB)
244+ Right optPred2 | optPred1 == optPred2 -> pure (Right optPred1)
245+ | isTrueExpr optPred1 -> pure (Right optPred1) -- True or x -> True
246+ | isTrueExpr optPred2 -> pure (Right optPred2)
247+ | otherwise -> pure (Right (OrPredicate optPred1 optPred2))
366 AttributeEqualityPredicate attrNameA (AttributeAtomExpr attrNameB) ->
248 AttributeEqualityPredicate attrNameA (AttributeAtomExpr attrNameB) ->
367 if attrNameA == attrNameB then
249 if attrNameA == attrNameB then
368− pure TruePredicate
250+ pure (Right TruePredicate)
369 else
251 else
370− pure predi
252+ pure (Right predi)
371− AttributeEqualityPredicate{} -> pure predi
253+ AttributeEqualityPredicate{} -> pure (Right predi)
372− TruePredicate -> pure predi
254+ TruePredicate -> pure $ Right predi
373− NotPredicate{} -> pure predi
255+ NotPredicate{} -> pure $ Right predi
374− RelationalExprPredicate{} -> pure predi
256+ RelationalExprPredicate{} -> pure (Right predi)
375− AtomExprPredicate{} -> pure predi
257+ AtomExprPredicate{} -> pure (Right predi)
376− let attrMap = findStaticRestrictionPredicates optPred
258+ case eOptPred of
377− pure (replaceStaticAtomExprs optPred attrMap)
259+ Left err -> pure (Left err)
260+ Right optPred ->
261+ let attrMap = findStaticRestrictionPredicates optPred in
262+ pure (Right (replaceStaticAtomExprs optPred attrMap))
378
263
379--determines if an atom expression is tautologically true
264--determines if an atom expression is tautologically true
380−isTrueExpr :: RestrictionPredicateExprBase a -> Bool
265+isTrueExpr :: RestrictionPredicateExpr -> Bool
381isTrueExpr TruePredicate = True
266isTrueExpr TruePredicate = True
382isTrueExpr (AtomExprPredicate (NakedAtomExpr (BoolAtom True))) = True
267isTrueExpr (AtomExprPredicate (NakedAtomExpr (BoolAtom True))) = True
383isTrueExpr _ = False
268isTrueExpr _ = False
384
269
385--determines if an atom expression is tautologically false
270--determines if an atom expression is tautologically false
386−isFalseExpr :: RestrictionPredicateExprBase a -> Bool
271+isFalseExpr :: RestrictionPredicateExpr -> Bool
387isFalseExpr (NotPredicate expr) = isTrueExpr expr
272isFalseExpr (NotPredicate expr) = isTrueExpr expr
388isFalseExpr (AtomExprPredicate (NakedAtomExpr (BoolAtom False))) = True
273isFalseExpr (AtomExprPredicate (NakedAtomExpr (BoolAtom False))) = True
389isFalseExpr _ = False
274isFalseExpr _ = False
390
275
391-- determine if the created relation can statically be determined to be empty
276-- determine if the created relation can statically be determined to be empty
392−isEmptyRelationExpr :: RelationalExprBase a -> Bool
277+isEmptyRelationExpr :: RelationalExpr -> Bool
393−isEmptyRelationExpr (MakeRelationFromExprs _ (TupleExprs _ [])) = True
278+isEmptyRelationExpr (MakeRelationFromExprs _ []) = True
394isEmptyRelationExpr (MakeStaticRelation _ tupSet) = null (asList tupSet)
279isEmptyRelationExpr (MakeStaticRelation _ tupSet) = null (asList tupSet)
395isEmptyRelationExpr (ExistingRelation rel) = rel == emptyRelationWithAttrs (attributes rel)
280isEmptyRelationExpr (ExistingRelation rel) = rel == emptyRelationWithAttrs (attributes rel)
396isEmptyRelationExpr _ = False
281isEmptyRelationExpr _ = False
397
282
398--transitive static variable optimization
283--transitive static variable optimization
399−replaceStaticAtomExprs :: GraphRefRestrictionPredicateExpr -> M.Map AttributeName GraphRefAtomExpr -> GraphRefRestrictionPredicateExpr
284+replaceStaticAtomExprs :: RestrictionPredicateExpr -> M.Map AttributeName AtomExpr -> RestrictionPredicateExpr
400replaceStaticAtomExprs predIn replaceMap = case predIn of
285replaceStaticAtomExprs predIn replaceMap = case predIn of
401 AttributeEqualityPredicate newAttrName (AttributeAtomExpr matchName) -> case M.lookup matchName replaceMap of
286 AttributeEqualityPredicate newAttrName (AttributeAtomExpr matchName) -> case M.lookup matchName replaceMap of
402 Nothing -> predIn
287 Nothing -> predIn
@@ -409,7 +294,7 @@ replaceStaticAtomExprs predIn replaceMap = case predIn of
409 RelationalExprPredicate{} -> predIn
294 RelationalExprPredicate{} -> predIn
410 AtomExprPredicate{} -> predIn
295 AtomExprPredicate{} -> predIn
411-- used for transitive attribute optimization- only works on statically-determined atoms for now- in the future, this could work for all AtomExprs which don't reference attributes
296-- used for transitive attribute optimization- only works on statically-determined atoms for now- in the future, this could work for all AtomExprs which don't reference attributes
412−findStaticRestrictionPredicates :: GraphRefRestrictionPredicateExpr -> M.Map AttributeName GraphRefAtomExpr
297+findStaticRestrictionPredicates :: RestrictionPredicateExpr -> M.Map AttributeName AtomExpr
413findStaticRestrictionPredicates (AttributeEqualityPredicate attrName atomExpr) =
298findStaticRestrictionPredicates (AttributeEqualityPredicate attrName atomExpr) =
414 case atomExpr of
299 case atomExpr of
415 val@NakedAtomExpr{} -> M.singleton attrName val
300 val@NakedAtomExpr{} -> M.singleton attrName val
@@ -433,72 +318,66 @@ isStaticAtomExpr FunctionAtomExpr{} = False
433isStaticAtomExpr RelationAtomExpr{} = False
318isStaticAtomExpr RelationAtomExpr{} = False
434
319
435--if the projection of a join only uses the attributes from one of the expressions and there is a foreign key relationship between the expressions, we know that the join is inconsequential and can be removed
320--if the projection of a join only uses the attributes from one of the expressions and there is a foreign key relationship between the expressions, we know that the join is inconsequential and can be removed
436−applyStaticJoinElimination :: GraphRefRelationalExpr -> GraphRefSOptRelationalExprM GraphRefRelationalExpr
321+applyStaticJoinElimination :: RelationalExpr -> RelationalExprState (Either RelationalError RelationalExpr)
437applyStaticJoinElimination expr@(Project attrNameSet (Join exprA exprB)) = do
322applyStaticJoinElimination expr@(Project attrNameSet (Join exprA exprB)) = do
438− graph <- askGraph
323+ relState <- ask
439− case inSameTransaction exprA exprB of
324+ eProjType <- typeForRelationalExpr expr
440− -- the sub exprs are in different transactions or none at all, so we cannot extract inclusion dependencies across transaction boundaries
325+ eTypeA <- typeForRelationalExpr exprA
441− Nothing -> pure expr
326+ eTypeB <- typeForRelationalExpr exprB
442− Just marker -> do
327+ case eProjType of
443− commonContext <- case marker of
328+ Left err -> pure (Left err)
444− UncommittedContextMarker -> askContext
329+ Right projType ->
445− TransactionMarker tid -> concreteDatabaseContext <$> lift (except (transactionForId tid graph))
330+ case eTypeA of
446− let typeForExpr e = lift $ except $ runGraphRefRelationalExprM gfEnv (typeForGraphRefRelationalExpr e)
331+ Left err -> pure (Left err)
447− gfEnv = freshGraphRefRelationalExprEnv (Just commonContext) graph
332+ Right typeA ->
448−
333+ case eTypeB of
449− projType <- typeForExpr expr
334+ Left err -> pure (Left err)
450− typeA <- typeForExpr exprA
335+ Right typeB -> do
451− typeB <- typeForExpr exprB
336+ let matchesProjectionAttributes
452− let matchesProjectionAttributes
337+ | attrNames projType `S.isSubsetOf` attrNames typeA =
453− | attrNames projType `S.isSubsetOf` attrNames typeA =
338+ Just ((exprA, typeA), (exprB, typeB))
454− Just ((exprA, typeA), (exprB, typeB))
339+ | attrNames projType `S.isSubsetOf` attrNames typeB =
455− | attrNames projType `S.isSubsetOf` attrNames typeB =
340+ Just ((exprB, typeB), (exprA, typeA))
456− Just ((exprB, typeB), (exprA, typeA))
341+ | otherwise =
457− | otherwise =
342+ Nothing
458− Nothing
343+ attrNames = A.attributeNameSet . attributes
459− attrNames = A.attributeNameSet . attributes
344+ case matchesProjectionAttributes of
460− case matchesProjectionAttributes of
345+ Nothing -> -- this optimization does not apply
461− Nothing -> -- this optimization does not apply
346+ pure (Right expr)
462− pure expr
347+ Just ((joinedExpr, joinedType), (unjoinedExpr, _)) -> do
463− Just ((joinedExpr, joinedType), (unjoinedExpr, _)) -> do
348+ --scan inclusion dependencies for a foreign key relationship
464− --lookup transaction
349+ incDeps <- inclusionDependencies . stateElemsContext <$> ask
465− --scan inclusion dependencies for a foreign key relationship
350+ let fkConstraint = foldM isFkConstraint False incDeps
466− let incDeps = inclusionDependencies commonContext
351+ --search for matching fk constraint
467− fkConstraint = foldM isFkConstraint False incDeps
352+ isFkConstraint acc (InclusionDependency (Project subattrNames subrv) (Project _ superrv)) =
468− --search for matching fk constraint
353+ case runReader (evalAttributeNames subattrNames expr) relState of
469− isFkConstraint acc (InclusionDependency (Project subAttrNames subrv) (Project _ superrv)) = do
354+ Left _ -> pure acc
470− let gfSubAttrNames = processM (processAttributeNames subAttrNames)
355+ Right subAttrNameSet ->
471− gfSubRv = processM (processRelationalExpr subrv)
356+ pure (acc || (joinedExpr == subrv &&
472− gfSuperRv = processM (processRelationalExpr superrv)
357+ unjoinedExpr == superrv &&
473− processM = runProcessExprM marker
358+ -- the fk attribute is one of the projection attributes
474− case runGraphRefRelationalExprM gfEnv (evalGraphRefAttributeNames gfSubAttrNames expr) of
359+ A.attributeNamesContained subAttrNameSet (A.attributeNameSet (attributes joinedType))
475− Left _ -> pure acc
476− Right subAttrNameSet ->
477− pure (acc || (joinedExpr == gfSubRv &&
478− unjoinedExpr == gfSuperRv &&
479− -- the fk attribute is one of the projection attributes
480− A.attributeNamesContained subAttrNameSet (A.attributeNameSet (attributes joinedType))
481 ))
360 ))
482− isFkConstraint acc _ = pure acc
361+ isFkConstraint acc _ = pure acc
483− case fkConstraint of
362+ case fkConstraint of
484− Right True -> --join elimination optimization applies
363+ Right True -> --join elimination optimization applies
485− optimizeGraphRefRelationalExpr (Project attrNameSet joinedExpr)
364+ applyStaticRelationalOptimization (Project attrNameSet joinedExpr)
486− Right False -> --join elimination optimization does not apply
365+ Right False -> --join elimination optimization does not apply
487− pure expr
366+ pure (Right expr)
488− Left err -> throwError err
367+ Left err ->
368+ pure (Left err)
489
369
490−applyStaticJoinElimination expr = pure expr
370+applyStaticJoinElimination expr = pure (Right expr)
491
371
492--restriction collapse converts chained restrictions into (Restrict (And pred1 pred2 pred3...))
372--restriction collapse converts chained restrictions into (Restrict (And pred1 pred2 pred3...))
493 --this optimization should be fairly uncontroversial- performing a tuple scan once is cheaper than twice- parallelization can still take place
373 --this optimization should be fairly uncontroversial- performing a tuple scan once is cheaper than twice- parallelization can still take place
494−applyStaticRestrictionCollapse :: GraphRefRelationalExpr -> GraphRefRelationalExpr
374+applyStaticRestrictionCollapse :: RelationalExpr -> RelationalExpr
495applyStaticRestrictionCollapse expr =
375applyStaticRestrictionCollapse expr =
496 case expr of
376 case expr of
497 MakeRelationFromExprs _ _ -> expr
377 MakeRelationFromExprs _ _ -> expr
498 MakeStaticRelation _ _ -> expr
378 MakeStaticRelation _ _ -> expr
499 ExistingRelation _ -> expr
379 ExistingRelation _ -> expr
500 RelationVariable _ _ -> expr
380 RelationVariable _ _ -> expr
501− With _ _ -> expr
502 Project attrs subexpr ->
381 Project attrs subexpr ->
503 Project attrs (applyStaticRestrictionCollapse subexpr)
382 Project attrs (applyStaticRestrictionCollapse subexpr)
504 Union sub1 sub2 ->
383 Union sub1 sub2 ->
@@ -528,20 +407,19 @@ applyStaticRestrictionCollapse expr =
528 andPreds = foldr (\(Restrict subpred _) acc -> AndPredicate acc subpred) firstPred (tail restrictions) in
407 andPreds = foldr (\(Restrict subpred _) acc -> AndPredicate acc subpred) firstPred (tail restrictions) in
529 Restrict andPreds optFinalExpr
408 Restrict andPreds optFinalExpr
530
409
531−sequentialRestrictions :: RelationalExprBase a -> [RelationalExprBase a]
410+sequentialRestrictions :: RelationalExpr -> [RelationalExpr]
532sequentialRestrictions expr@(Restrict _ subexpr) = expr:sequentialRestrictions subexpr
411sequentialRestrictions expr@(Restrict _ subexpr) = expr:sequentialRestrictions subexpr
533sequentialRestrictions _ = []
412sequentialRestrictions _ = []
534
413
535--restriction pushdown only really makes sense for tuple-oriented storage schemes where performing a restriction before projection can cut down on the intermediate storage needed to store the data before the projection
414--restriction pushdown only really makes sense for tuple-oriented storage schemes where performing a restriction before projection can cut down on the intermediate storage needed to store the data before the projection
536-- x{proj} where c1 -> (x where c1){proj} #project on fewer tuples
415-- x{proj} where c1 -> (x where c1){proj} #project on fewer tuples
537-- (x union y) where c -> (x where c) union (y where c) #with a selective restriction, fewer tuples will need to be joined
416-- (x union y) where c -> (x where c) union (y where c) #with a selective restriction, fewer tuples will need to be joined
538−applyStaticRestrictionPushdown :: GraphRefRelationalExpr -> GraphRefRelationalExpr
417+applyStaticRestrictionPushdown :: RelationalExpr -> RelationalExpr
539applyStaticRestrictionPushdown expr = case expr of
418applyStaticRestrictionPushdown expr = case expr of
540 MakeRelationFromExprs _ _ -> expr
419 MakeRelationFromExprs _ _ -> expr
541 MakeStaticRelation _ _ -> expr
420 MakeStaticRelation _ _ -> expr
542 ExistingRelation _ -> expr
421 ExistingRelation _ -> expr
543 RelationVariable _ _ -> expr
422 RelationVariable _ _ -> expr
544− With _ _ -> expr
545 Project _ _ -> expr
423 Project _ _ -> expr
546 --this transformation cannot be inverted because the projection attributes might not exist in the inverted version
424 --this transformation cannot be inverted because the projection attributes might not exist in the inverted version
547 Restrict restrictAttrs (Project projAttrs subexpr) ->
425 Restrict restrictAttrs (Project projAttrs subexpr) ->
@@ -572,7 +450,4 @@ applyStaticRestrictionPushdown expr = case expr of
572 Extend n sub ->
450 Extend n sub ->
573 Extend n (applyStaticRestrictionPushdown sub)
451 Extend n (applyStaticRestrictionPushdown sub)
574
452
575−-- no optimizations available
453+
576−optimizeDatabaseContextIOExpr :: GraphRefDatabaseContextIOExpr -> GraphRefSOptDatabaseContextExprM GraphRefDatabaseContextIOExpr
577−optimizeDatabaseContextIOExpr = pure
578−
src/lib/ProjectM36/TransGraphRelationalExpression.hs+136−141
@@ -1,180 +1,175 @@
1−{-# LANGUAGE FlexibleInstances #-}
1+{-# LANGUAGE TypeSynonymInstances, FlexibleInstances #-}
2{-# OPTIONS_GHC -fno-warn-orphans #-}
2{-# OPTIONS_GHC -fno-warn-orphans #-}
3--really, a better name for this module could be "TransTransactionGraphRelationalExpr", but that name is too long
3--really, a better name for this module could be "TransTransactionGraphRelationalExpr", but that name is too long
4module ProjectM36.TransGraphRelationalExpression where
4module ProjectM36.TransGraphRelationalExpression where
5import ProjectM36.Base
5import ProjectM36.Base
6import ProjectM36.TransactionGraph
6import ProjectM36.TransactionGraph
7+import ProjectM36.Transaction
8+import ProjectM36.RelationalExpression
7import ProjectM36.Error
9import ProjectM36.Error
10+import ProjectM36.Tuple
11+import ProjectM36.AtomType
8import qualified Data.Map as M
12import qualified Data.Map as M
9import Control.Monad.Trans.Reader
13import Control.Monad.Trans.Reader
10−import Control.Monad.Trans.Class
14+import Data.Binary
11−import Control.Monad.Trans.Except
12−import Data.Functor.Identity
13
15
14-- | The TransGraphRelationalExpression is equivalent to a relational expression except that relation variables can reference points in the transaction graph (at previous points in time).
16-- | The TransGraphRelationalExpression is equivalent to a relational expression except that relation variables can reference points in the transaction graph (at previous points in time).
15type TransGraphRelationalExpr = RelationalExprBase TransactionIdLookup
17type TransGraphRelationalExpr = RelationalExprBase TransactionIdLookup
16
18
19+instance Binary TransGraphRelationalExpr
20+
17type TransGraphAttributeNames = AttributeNamesBase TransactionIdLookup
21type TransGraphAttributeNames = AttributeNamesBase TransactionIdLookup
18
22
23+instance Binary TransGraphAttributeNames
24+
19type TransGraphExtendTupleExpr = ExtendTupleExprBase TransactionIdLookup
25type TransGraphExtendTupleExpr = ExtendTupleExprBase TransactionIdLookup
20
26
27+instance Binary TransGraphExtendTupleExpr
28+
21type TransGraphTupleExpr = TupleExprBase TransactionIdLookup
29type TransGraphTupleExpr = TupleExprBase TransactionIdLookup
22
30
23−type TransGraphTupleExprs = TupleExprsBase TransactionIdLookup
31+instance Binary TransGraphTupleExpr
24
32
25type TransGraphRestrictionPredicateExpr = RestrictionPredicateExprBase TransactionIdLookup
33type TransGraphRestrictionPredicateExpr = RestrictionPredicateExprBase TransactionIdLookup
26
34
27−type TransGraphAtomExpr = AtomExprBase TransactionIdLookup
35+instance Binary TransGraphRestrictionPredicateExpr
28−
29−type TransGraphAttributeExpr = AttributeExprBase TransactionIdLookup
30−
31−type TransGraphWithNameExpr = WithNameExprBase TransactionIdLookup
32
36
33−newtype TransGraphEvalEnv = TransGraphEvalEnv {
37+type TransGraphAtomExpr = AtomExprBase TransactionIdLookup
34− tge_graph :: TransactionGraph
35− }
36−
37−type TransGraphEvalMonad a = ReaderT TransGraphEvalEnv (ExceptT RelationalError Identity) a
38−
39−process :: TransGraphEvalEnv -> TransGraphRelationalExpr -> Either RelationalError GraphRefRelationalExpr
40−process env texpr = runIdentity (runExceptT (runReaderT (processTransGraphRelationalExpr texpr) env))
41−
42−liftE :: Either RelationalError a -> TransGraphEvalMonad a
43−liftE = lift . except
44−
45−askGraph :: TransGraphEvalMonad TransactionGraph
46−askGraph = tge_graph <$> ask
47
38
48−findTransId :: TransactionIdLookup -> TransGraphEvalMonad GraphRefTransactionMarker
39+instance Binary TransGraphAtomExpr
49−findTransId tlook = TransactionMarker . transactionId <$> findTrans tlook
50
40
51−findTrans :: TransactionIdLookup -> TransGraphEvalMonad Transaction
41+type TransGraphAttributeExpr = AttributeExprBase TransactionIdLookup
52−findTrans tlook = do
53− graph <- askGraph
54− liftE $ lookupTransaction graph tlook
55
42
56-- OUTDATED a previous attempt at this function attempted to convert TransGraphRelationalExpr to RelationalExpr by resolving the transaction lookups. However, there is no way to resolve a FunctionAtomExpr to an Atom without fully evaluating the higher levels (TupleExpr, etc.). An anonymous function expression cannot be serialized, so that workaround is out. Still, I suspect we can reuse the existing static optimizer logic to work on both structures. The current conversion reduces the chance of whole-query optimization due to full-evaluation on top of full-evaluation, so this function would benefit from some re-design.
43-- OUTDATED a previous attempt at this function attempted to convert TransGraphRelationalExpr to RelationalExpr by resolving the transaction lookups. However, there is no way to resolve a FunctionAtomExpr to an Atom without fully evaluating the higher levels (TupleExpr, etc.). An anonymous function expression cannot be serialized, so that workaround is out. Still, I suspect we can reuse the existing static optimizer logic to work on both structures. The current conversion reduces the chance of whole-query optimization due to full-evaluation on top of full-evaluation, so this function would benefit from some re-design.
57−processTransGraphRelationalExpr :: TransGraphRelationalExpr -> TransGraphEvalMonad GraphRefRelationalExpr
44+evalTransGraphRelationalExpr :: TransGraphRelationalExpr -> TransactionGraph -> Either RelationalError RelationalExpr
58−processTransGraphRelationalExpr (MakeRelationFromExprs mAttrExprs tupleExprs) = do
45+evalTransGraphRelationalExpr (MakeRelationFromExprs mAttrExprs tupleExprs) graph = do
59− tupleExprs' <- processTransGraphTupleExprs tupleExprs
46+ tupleExprs' <- mapM (evalTransGraphTupleExpr graph) tupleExprs
60 case mAttrExprs of
47 case mAttrExprs of
61 Nothing -> pure (MakeRelationFromExprs Nothing tupleExprs')
48 Nothing -> pure (MakeRelationFromExprs Nothing tupleExprs')
62 Just attrExprs -> do
49 Just attrExprs -> do
63− attrExprs' <- mapM processTransGraphAttributeExpr attrExprs
50+ attrExprs' <- mapM (evalTransGraphAttributeExpr graph) attrExprs
64 pure (MakeRelationFromExprs (Just attrExprs') tupleExprs')
51 pure (MakeRelationFromExprs (Just attrExprs') tupleExprs')
65−processTransGraphRelationalExpr (MakeStaticRelation attrs tupSet) = pure (MakeStaticRelation attrs tupSet)
52+evalTransGraphRelationalExpr (MakeStaticRelation attrs tupSet) _ = pure (MakeStaticRelation attrs tupSet)
66−processTransGraphRelationalExpr (ExistingRelation rel) = pure (ExistingRelation rel)
53+evalTransGraphRelationalExpr (ExistingRelation rel) _ = pure (ExistingRelation rel)
67−processTransGraphRelationalExpr (RelationVariable rvname transLookup) =
54+evalTransGraphRelationalExpr (RelationVariable rvname transLookup) graph = do
68− RelationVariable rvname <$> findTransId transLookup
55+ trans <- lookupTransaction graph transLookup
69−processTransGraphRelationalExpr (Project transAttrNames expr) =
56+ rel <- runReader (evalRelationalExpr (RelationVariable rvname ())) (RelationalExprStateElems (concreteDatabaseContext trans))
70− Project <$> processTransGraphAttributeNames transAttrNames <*> processTransGraphRelationalExpr expr
57+ pure (ExistingRelation rel)
71−processTransGraphRelationalExpr (Union exprA exprB) =
58+evalTransGraphRelationalExpr (Project transAttrNames expr) graph = do
72− Union <$> processTransGraphRelationalExpr exprA <*> processTransGraphRelationalExpr exprB
59+ expr' <- evalTransGraphRelationalExpr expr graph
73−processTransGraphRelationalExpr (Join exprA exprB) =
60+ attrNames <- evalTransAttributeNames transAttrNames graph
74− Join <$> processTransGraphRelationalExpr exprA <*> processTransGraphRelationalExpr exprB
61+ pure (Project attrNames expr')
75−processTransGraphRelationalExpr (Rename attrName1 attrName2 expr) =
62+evalTransGraphRelationalExpr (Union exprA exprB) graph = do
76− Rename attrName1 attrName2 <$> processTransGraphRelationalExpr expr
63+ exprA' <- evalTransGraphRelationalExpr exprA graph
77−processTransGraphRelationalExpr (Difference exprA exprB) =
64+ exprB' <- evalTransGraphRelationalExpr exprB graph
78− Difference <$> processTransGraphRelationalExpr exprA <*> processTransGraphRelationalExpr exprB
65+ pure (Union exprA' exprB')
79−processTransGraphRelationalExpr (Group transAttrNames attrName expr) =
66+evalTransGraphRelationalExpr (Join exprA exprB) graph = do
80− Group <$>
67+ exprA' <- evalTransGraphRelationalExpr exprA graph
81− processTransGraphAttributeNames transAttrNames <*>
68+ exprB' <- evalTransGraphRelationalExpr exprB graph
82− pure attrName <*>
69+ pure (Join exprA' exprB')
83− processTransGraphRelationalExpr expr
70+evalTransGraphRelationalExpr (Rename attrName1 attrName2 expr) graph = do
84−processTransGraphRelationalExpr (Ungroup attrName expr) =
71+ expr' <- evalTransGraphRelationalExpr expr graph
85− Ungroup attrName <$> processTransGraphRelationalExpr expr
72+ pure (Rename attrName1 attrName2 expr')
86−processTransGraphRelationalExpr (Restrict predicateExpr expr) =
73+evalTransGraphRelationalExpr (Difference exprA exprB) graph = do
87− Restrict <$> evalTransGraphRestrictionPredicateExpr predicateExpr <*>
74+ exprA' <- evalTransGraphRelationalExpr exprA graph
88− processTransGraphRelationalExpr expr
75+ exprB' <- evalTransGraphRelationalExpr exprB graph
89−processTransGraphRelationalExpr (Equals exprA exprB) = do
76+ pure (Difference exprA' exprB')
90− exprA' <- processTransGraphRelationalExpr exprA
77+evalTransGraphRelationalExpr (Group transAttrNames attrName expr) graph = do
91− exprB' <- processTransGraphRelationalExpr exprB
78+ expr' <- evalTransGraphRelationalExpr expr graph
79+ attrNames <- evalTransAttributeNames transAttrNames graph
80+ pure (Group attrNames attrName expr')
81+evalTransGraphRelationalExpr (Ungroup attrName expr) graph = do
82+ expr' <- evalTransGraphRelationalExpr expr graph
83+ pure (Ungroup attrName expr')
84+evalTransGraphRelationalExpr (Restrict predicateExpr expr) graph = do
85+ expr' <- evalTransGraphRelationalExpr expr graph
86+ predicateExpr' <- evalTransGraphRestrictionPredicateExpr predicateExpr graph
87+ pure (Restrict predicateExpr' expr')
88+evalTransGraphRelationalExpr (Equals exprA exprB) graph = do
89+ exprA' <- evalTransGraphRelationalExpr exprA graph
90+ exprB' <- evalTransGraphRelationalExpr exprB graph
92 pure (Equals exprA' exprB')
91 pure (Equals exprA' exprB')
93−processTransGraphRelationalExpr (NotEquals exprA exprB) = do
92+evalTransGraphRelationalExpr (NotEquals exprA exprB) graph = do
94− exprA' <- processTransGraphRelationalExpr exprA
93+ exprA' <- evalTransGraphRelationalExpr exprA graph
95− exprB' <- processTransGraphRelationalExpr exprB
94+ exprB' <- evalTransGraphRelationalExpr exprB graph
96 pure (NotEquals exprA' exprB')
95 pure (NotEquals exprA' exprB')
97−processTransGraphRelationalExpr (Extend extendExpr expr) = do
96+evalTransGraphRelationalExpr (Extend extendExpr expr) graph = do
98− extendExpr' <- processTransGraphExtendTupleExpr extendExpr
97+ extendExpr' <- evalTransGraphExtendTupleExpr extendExpr graph
99− expr' <- processTransGraphRelationalExpr expr
98+ expr' <- evalTransGraphRelationalExpr expr graph
100 pure (Extend extendExpr' expr')
99 pure (Extend extendExpr' expr')
101−processTransGraphRelationalExpr (With views expr) = do
100+
102− evaldViews <- mapM (\(wnexpr, vexpr) -> do
101+evalTransGraphTupleExpr :: TransactionGraph -> TransGraphTupleExpr -> Either RelationalError TupleExpr
103− wnexpr' <- processTransGraphWithNameExpr wnexpr
102+evalTransGraphTupleExpr graph (TupleExpr attrMap) = do
104− vexpr' <- processTransGraphRelationalExpr vexpr
103+ attrAssoc <- mapM (\(attrName, atomExpr) -> do
105− pure (wnexpr', vexpr')
104+ aExpr <- evalTransGraphAtomExpr graph atomExpr
106− ) views
107− expr' <- processTransGraphRelationalExpr expr
108− pure (With evaldViews expr')
109−
110−processTransGraphTupleExprs :: TransGraphTupleExprs -> TransGraphEvalMonad GraphRefTupleExprs
111−processTransGraphTupleExprs (TupleExprs marker texprs) =
112− TupleExprs <$> findTransId marker <*> mapM processTransGraphTupleExpr texprs
113−
114−processTransGraphTupleExpr :: TransGraphTupleExpr -> TransGraphEvalMonad GraphRefTupleExpr
115−processTransGraphTupleExpr (TupleExpr attrMap) = do
116− let attrAssoc = mapM (\(attrName, atomExpr) -> do
117− aExpr <- processTransGraphAtomExpr atomExpr
118 pure (attrName, aExpr)
105 pure (attrName, aExpr)
119 ) (M.toList attrMap)
106 ) (M.toList attrMap)
120− TupleExpr . M.fromList <$> attrAssoc
107+ pure (TupleExpr (M.fromList attrAssoc))
121
108
122−processTransGraphAtomExpr :: TransGraphAtomExpr -> TransGraphEvalMonad GraphRefAtomExpr
109+evalTransGraphAtomExpr :: TransactionGraph -> TransGraphAtomExpr -> Either RelationalError AtomExpr
123−processTransGraphAtomExpr (AttributeAtomExpr aname) = pure $ AttributeAtomExpr aname
110+evalTransGraphAtomExpr _ (AttributeAtomExpr aname) = pure $ AttributeAtomExpr aname
124−processTransGraphAtomExpr (NakedAtomExpr atom) = pure $ NakedAtomExpr atom
111+evalTransGraphAtomExpr _ (NakedAtomExpr atom) = pure $ NakedAtomExpr atom
125−processTransGraphAtomExpr (FunctionAtomExpr funcName args tLookup) =
112+evalTransGraphAtomExpr graph (FunctionAtomExpr funcName args tLookup) = do
126− FunctionAtomExpr funcName <$> mapM processTransGraphAtomExpr args <*> findTransId tLookup
113+ trans <- lookupTransaction graph tLookup
127−processTransGraphAtomExpr (RelationAtomExpr expr) =
114+ --I can't return a FunctionAtomExpr because the function needs to be resolved at a specific context
128− RelationAtomExpr <$> processTransGraphRelationalExpr expr
115+ args' <- mapM (evalTransGraphAtomExpr graph) args
129−processTransGraphAtomExpr (ConstructedAtomExpr dConsName args tLookup) =
116+ atom <- runReader (evalAtomExpr emptyTuple (FunctionAtomExpr funcName args' ())) (RelationalExprStateElems (concreteDatabaseContext trans))
130− ConstructedAtomExpr dConsName <$> mapM processTransGraphAtomExpr args <*> findTransId tLookup
117+ pure (NakedAtomExpr atom)
131−evalTransGraphRestrictionPredicateExpr :: TransGraphRestrictionPredicateExpr -> TransGraphEvalMonad GraphRefRestrictionPredicateExpr
118+evalTransGraphAtomExpr graph (RelationAtomExpr expr) = do
132−evalTransGraphRestrictionPredicateExpr TruePredicate = pure TruePredicate
119+ expr' <- evalTransGraphRelationalExpr expr graph
133−evalTransGraphRestrictionPredicateExpr (AndPredicate exprA exprB) = do
120+ pure (RelationAtomExpr expr')
134− exprA' <- evalTransGraphRestrictionPredicateExpr exprA
121+evalTransGraphAtomExpr graph (ConstructedAtomExpr dConsName args tLookup) = do
135− exprB' <- evalTransGraphRestrictionPredicateExpr exprB
122+ trans <- lookupTransaction graph tLookup
123+ args' <- mapM (evalTransGraphAtomExpr graph) args
124+ atom <- runReader (evalAtomExpr emptyTuple (ConstructedAtomExpr dConsName args' ())) (RelationalExprStateElems (concreteDatabaseContext trans))
125+ pure (NakedAtomExpr atom)
126+
127+evalTransGraphRestrictionPredicateExpr :: TransGraphRestrictionPredicateExpr -> TransactionGraph -> Either RelationalError RestrictionPredicateExpr
128+evalTransGraphRestrictionPredicateExpr TruePredicate _ = pure TruePredicate
129+evalTransGraphRestrictionPredicateExpr (AndPredicate exprA exprB) graph = do
130+ exprA' <- evalTransGraphRestrictionPredicateExpr exprA graph
131+ exprB' <- evalTransGraphRestrictionPredicateExpr exprB graph
136 pure (AndPredicate exprA' exprB')
132 pure (AndPredicate exprA' exprB')
137−evalTransGraphRestrictionPredicateExpr (OrPredicate exprA exprB) = do
133+evalTransGraphRestrictionPredicateExpr (OrPredicate exprA exprB) graph = do
138− exprA' <- evalTransGraphRestrictionPredicateExpr exprA
134+ exprA' <- evalTransGraphRestrictionPredicateExpr exprA graph
139− exprB' <- evalTransGraphRestrictionPredicateExpr exprB
135+ exprB' <- evalTransGraphRestrictionPredicateExpr exprB graph
140 pure (OrPredicate exprA' exprB')
136 pure (OrPredicate exprA' exprB')
141−evalTransGraphRestrictionPredicateExpr (NotPredicate expr) = do
137+evalTransGraphRestrictionPredicateExpr (NotPredicate expr) graph = do
142− let expr' = evalTransGraphRestrictionPredicateExpr expr
138+ expr' <- evalTransGraphRestrictionPredicateExpr expr graph
143− NotPredicate <$> expr'
139+ pure (NotPredicate expr')
144−evalTransGraphRestrictionPredicateExpr (RelationalExprPredicate expr) = do
140+evalTransGraphRestrictionPredicateExpr (RelationalExprPredicate expr) graph = do
145− let expr' = processTransGraphRelationalExpr expr
141+ expr' <- evalTransGraphRelationalExpr expr graph
146− RelationalExprPredicate <$> expr'
142+ pure (RelationalExprPredicate expr')
147−evalTransGraphRestrictionPredicateExpr (AtomExprPredicate expr) = do
143+evalTransGraphRestrictionPredicateExpr (AtomExprPredicate expr) graph = do
148− let expr' = processTransGraphAtomExpr expr
144+ expr' <- evalTransGraphAtomExpr graph expr
149− AtomExprPredicate <$> expr'
145+ pure (AtomExprPredicate expr')
150−evalTransGraphRestrictionPredicateExpr (AttributeEqualityPredicate attrName expr) = do
146+evalTransGraphRestrictionPredicateExpr (AttributeEqualityPredicate attrName expr) graph = do
151− let expr' = processTransGraphAtomExpr expr
147+ expr' <- evalTransGraphAtomExpr graph expr
152− AttributeEqualityPredicate attrName <$> expr'
148+ pure (AttributeEqualityPredicate attrName expr')
153
149
154−processTransGraphExtendTupleExpr :: TransGraphExtendTupleExpr -> TransGraphEvalMonad GraphRefExtendTupleExpr
150+evalTransGraphExtendTupleExpr :: TransGraphExtendTupleExpr -> TransactionGraph -> Either RelationalError ExtendTupleExpr
155−processTransGraphExtendTupleExpr (AttributeExtendTupleExpr attrName expr) =
151+evalTransGraphExtendTupleExpr (AttributeExtendTupleExpr attrName expr) graph = do
156− AttributeExtendTupleExpr attrName <$> processTransGraphAtomExpr expr
152+ expr' <- evalTransGraphAtomExpr graph expr
157−
153+ pure (AttributeExtendTupleExpr attrName expr')
158−processTransGraphAttributeExpr :: TransGraphAttributeExpr -> TransGraphEvalMonad GraphRefAttributeExpr
154+
159−processTransGraphAttributeExpr (AttributeAndTypeNameExpr attrName tCons tLookup) =
155+evalTransGraphAttributeExpr :: TransactionGraph -> TransGraphAttributeExpr -> Either RelationalError AttributeExpr
160− AttributeAndTypeNameExpr attrName tCons <$> findTransId tLookup
156+evalTransGraphAttributeExpr graph (AttributeAndTypeNameExpr attrName tCons tLookup) = do
161−processTransGraphAttributeExpr (NakedAttributeExpr attr) = pure (NakedAttributeExpr attr)
157+ trans <- lookupTransaction graph tLookup
162−
158+ aType <- atomTypeForTypeConstructor tCons (typeConstructorMapping (concreteDatabaseContext trans)) M.empty
163−processTransGraphAttributeNames :: TransGraphAttributeNames -> TransGraphEvalMonad GraphRefAttributeNames
159+ pure (NakedAttributeExpr (Attribute attrName aType))
164−processTransGraphAttributeNames (AttributeNames names) = pure (AttributeNames names)
160+evalTransGraphAttributeExpr _ (NakedAttributeExpr attr) = pure (NakedAttributeExpr attr)
165−processTransGraphAttributeNames (InvertedAttributeNames names) = pure (InvertedAttributeNames names)
161+
166−processTransGraphAttributeNames (UnionAttributeNames namesA namesB) = do
162+evalTransAttributeNames :: TransGraphAttributeNames -> TransactionGraph -> Either RelationalError AttributeNames
167− nA <- processTransGraphAttributeNames namesA
163+evalTransAttributeNames (AttributeNames names) _ = Right (AttributeNames names)
168− nB <- processTransGraphAttributeNames namesB
164+evalTransAttributeNames (InvertedAttributeNames names) _ = Right (InvertedAttributeNames names)
169− pure (UnionAttributeNames nA nB)
165+evalTransAttributeNames (UnionAttributeNames namesA namesB) graph = do
170−processTransGraphAttributeNames (IntersectAttributeNames namesA namesB) = do
166+ nA <- evalTransAttributeNames namesA graph
171− nA <- processTransGraphAttributeNames namesA
167+ nB <- evalTransAttributeNames namesB graph
172− nB <- processTransGraphAttributeNames namesB
168+ Right (UnionAttributeNames nA nB)
173− pure (IntersectAttributeNames nA nB)
169+evalTransAttributeNames (IntersectAttributeNames namesA namesB) graph = do
174−processTransGraphAttributeNames (RelationalExprAttributeNames expr) = do
170+ nA <- evalTransAttributeNames namesA graph
175− evaldExpr <- processTransGraphRelationalExpr expr
171+ nB <- evalTransAttributeNames namesB graph
176− pure (RelationalExprAttributeNames evaldExpr)
172+ Right (IntersectAttributeNames nA nB)
177−
173+evalTransAttributeNames (RelationalExprAttributeNames expr) graph = do
178−processTransGraphWithNameExpr :: TransGraphWithNameExpr -> TransGraphEvalMonad GraphRefWithNameExpr
174+ evaldExpr <- evalTransGraphRelationalExpr expr graph
179−processTransGraphWithNameExpr (WithNameExpr rvname tlookup) =
175+ Right (RelationalExprAttributeNames evaldExpr)
180− WithNameExpr rvname <$> findTransId tlookup
src/lib/ProjectM36/Transaction.hs+16−24
@@ -3,24 +3,28 @@ import ProjectM36.Base
3import qualified Data.Set as S
3import qualified Data.Set as S
4import qualified Data.UUID as U
4import qualified Data.UUID as U
5import Data.Time.Clock
5import Data.Time.Clock
6−import qualified Data.List.NonEmpty as NE
7
6
8−parentIds :: Transaction -> S.Set TransactionId
7+transactionTimestamp :: Transaction -> UTCTime
9−parentIds (Transaction _ tinfo _) = S.fromList (NE.toList (parents tinfo))
8+transactionTimestamp (Transaction _ (TransactionInfo _ _ stamp) _) = stamp
9+transactionTimestamp (Transaction _ (MergeTransactionInfo _ _ _ stamp) _) = stamp
10
10
11−rootParent :: TransactionParents
11+transactionParentIds :: Transaction -> S.Set TransactionId
12−rootParent = singleParent U.nil
12+transactionParentIds (Transaction _ (TransactionInfo pId _ _) _) = S.singleton pId
13+transactionParentIds (Transaction _ (MergeTransactionInfo pId1 pId2 _ _) _) = S.fromList [pId1, pId2]
13
14
14−singleParent :: TransactionId -> TransactionParents
15+transactionChildIds :: Transaction -> S.Set TransactionId
15−singleParent tid = tid NE.:| []
16+transactionChildIds (Transaction _ (TransactionInfo _ children _) _) = children
17+transactionChildIds (Transaction _ (MergeTransactionInfo _ _ children _) _) = children
18+
19+-- | Create a new transaction which is identical to the original except that a new set of child transaction ids is added.
20+transactionSetChildren :: Transaction -> S.Set TransactionId -> Transaction
21+transactionSetChildren t@(Transaction _ (TransactionInfo pId _ stamp) schemas') childIds = Transaction (transactionId t) (TransactionInfo pId childIds stamp) schemas'
22+transactionSetChildren t@(Transaction _ (MergeTransactionInfo pId1 pId2 _ stamp) schemas') childIds = Transaction (transactionId t) (MergeTransactionInfo pId1 pId2 childIds stamp) schemas'
16
23
17-- | Return the same transaction but referencing only the specific child transactions. This is useful when traversing a graph and returning a subgraph. This doesn't filter parent transactions because it assumes a head-to-root traversal.
24-- | Return the same transaction but referencing only the specific child transactions. This is useful when traversing a graph and returning a subgraph. This doesn't filter parent transactions because it assumes a head-to-root traversal.
18filterTransactionInfoTransactions :: S.Set TransactionId -> TransactionInfo -> TransactionInfo
25filterTransactionInfoTransactions :: S.Set TransactionId -> TransactionInfo -> TransactionInfo
19−filterTransactionInfoTransactions filterIds tinfo =
26+filterTransactionInfoTransactions filterIds (TransactionInfo parentId childIds stamp) = TransactionInfo (filterParent parentId filterIds) (S.intersection childIds filterIds) stamp
20− tinfo { parents = case
27+filterTransactionInfoTransactions filterIds (MergeTransactionInfo parentIdA parentIdB childIds stamp) = MergeTransactionInfo (filterParent parentIdA filterIds) (filterParent parentIdB filterIds) (S.intersection childIds filterIds) stamp
21− NE.filter (`S.member` filterIds) (parents tinfo) of
22− [] -> rootParent
23− xs -> NE.fromList xs}
24
28
25filterParent :: TransactionId -> S.Set TransactionId -> TransactionId
29filterParent :: TransactionId -> S.Set TransactionId -> TransactionId
26filterParent parentId validIds = if S.member parentId validIds then parentId else U.nil
30filterParent parentId validIds = if S.member parentId validIds then parentId else U.nil
@@ -40,15 +44,3 @@ schemas (Transaction _ _ schemas') = schemas'
40-- | Returns all subschemas which are isomorphic or sub-isomorphic to the concrete schema.
44-- | Returns all subschemas which are isomorphic or sub-isomorphic to the concrete schema.
41subschemas :: Transaction -> Subschemas
45subschemas :: Transaction -> Subschemas
42subschemas (Transaction _ _ (Schemas _ sschemas)) = sschemas
46subschemas (Transaction _ _ (Schemas _ sschemas)) = sschemas
43−
44−fresh :: TransactionId -> UTCTime -> Schemas -> Transaction
45−fresh freshId stamp' = Transaction freshId tinfo
46− where
47− tinfo = TransactionInfo {parents = rootParent,
48− stamp = stamp',
49− merkleHash = mempty
50− }
51−
52−timestamp :: Transaction -> UTCTime
53−timestamp (Transaction _ tinfo _) = stamp tinfo
54−
src/lib/ProjectM36/Transaction/Persist.hs+59−66
@@ -1,4 +1,3 @@
1−{-# LANGUAGE TypeApplications #-}
2module ProjectM36.Transaction.Persist where
1module ProjectM36.Transaction.Persist where
3import ProjectM36.Base
2import ProjectM36.Base
4import ProjectM36.Error
3import ProjectM36.Error
@@ -8,24 +7,25 @@ import ProjectM36.AtomFunction
8import ProjectM36.Persist (writeBSFileSync, DiskSync, renameSync)
7import ProjectM36.Persist (writeBSFileSync, DiskSync, renameSync)
9import qualified Data.Map as M
8import qualified Data.Map as M
10import qualified Data.HashSet as HS
9import qualified Data.HashSet as HS
10+import qualified Data.Binary as B
11+--import qualified Data.ByteString as BS
11import System.FilePath
12import System.FilePath
12import System.Directory
13import System.Directory
13import qualified Data.Text as T
14import qualified Data.Text as T
14import Control.Monad
15import Control.Monad
15import ProjectM36.ScriptSession
16import ProjectM36.ScriptSession
16import ProjectM36.AtomFunctions.Basic (precompiledAtomFunctions)
17import ProjectM36.AtomFunctions.Basic (precompiledAtomFunctions)
17−import Codec.Winery
18−
19−#ifdef PM36_HASKELL_SCRIPTING
20−import GHC
21import Control.Exception
18import Control.Exception
19+import GHC
22import GHC.Paths
20import GHC.Paths
23−#endif
21+import Codec.Compression.GZip
22+import qualified Data.ByteString as BS
23+import qualified Data.ByteString.Lazy as BSL
24
24
25getDirectoryNames :: FilePath -> IO [FilePath]
25getDirectoryNames :: FilePath -> IO [FilePath]
26−getDirectoryNames path =
26+getDirectoryNames path = do
27− filter (\ n -> n `notElem` ["..", "."]) <$> getDirectoryContents path
27+ subpaths <- getDirectoryContents path
28−
28+ return $ filter (\n -> n `notElem` ["..", "."]) subpaths
29
29
30tempTransactionDir :: FilePath -> TransactionId -> FilePath
30tempTransactionDir :: FilePath -> TransactionId -> FilePath
31tempTransactionDir dbdir transId = dbdir </> "." ++ show transId
31tempTransactionDir dbdir transId = dbdir </> "." ++ show transId
@@ -36,8 +36,8 @@ transactionDir dbdir transId = dbdir </> show transId
36transactionInfoPath :: FilePath -> FilePath
36transactionInfoPath :: FilePath -> FilePath
37transactionInfoPath transdir = transdir </> "info"
37transactionInfoPath transdir = transdir </> "info"
38
38
39−relvarsPath :: FilePath -> FilePath
39+relvarsDir :: FilePath -> FilePath
40−relvarsPath transdir = transdir </> "relvars"
40+relvarsDir transdir = transdir </> "relvars"
41
41
42incDepsDir :: FilePath -> FilePath
42incDepsDir :: FilePath -> FilePath
43incDepsDir transdir = transdir </> "incdeps"
43incDepsDir transdir = transdir </> "incdeps"
@@ -62,7 +62,7 @@ readTransaction dbdir transId mScriptSession = do
62 return $ Left $ MissingTransactionError transId
62 return $ Left $ MissingTransactionError transId
63 else do
63 else do
64 relvars <- readRelVars transDir
64 relvars <- readRelVars transDir
65− transInfo <- readFileDeserialise (transactionInfoPath transDir)
65+ transInfo <- B.decodeFile (transactionInfoPath transDir)
66 incDeps <- readIncDeps transDir
66 incDeps <- readIncDeps transDir
67 typeCons <- readTypeConstructorMapping transDir
67 typeCons <- readTypeConstructorMapping transDir
68 sschemas <- readSubschemas transDir
68 sschemas <- readSubschemas transDir
@@ -85,75 +85,77 @@ writeTransaction sync dbdir trans = do
85 transDirExists <- doesDirectoryExist finalTransDir
85 transDirExists <- doesDirectoryExist finalTransDir
86 unless transDirExists $ do
86 unless transDirExists $ do
87 --create sub directories
87 --create sub directories
88− mapM_ createDirectory [tempTransDir, incDepsDir tempTransDir, dbcFuncsDir tempTransDir]
88+ mapM_ createDirectory [tempTransDir, relvarsDir tempTransDir, incDepsDir tempTransDir, dbcFuncsDir tempTransDir]
89 writeRelVars sync tempTransDir (relationVariables context)
89 writeRelVars sync tempTransDir (relationVariables context)
90 writeIncDeps sync tempTransDir (inclusionDependencies context)
90 writeIncDeps sync tempTransDir (inclusionDependencies context)
91 writeAtomFuncs sync tempTransDir (atomFunctions context)
91 writeAtomFuncs sync tempTransDir (atomFunctions context)
92 writeDBCFuncs sync tempTransDir (dbcFunctions context)
92 writeDBCFuncs sync tempTransDir (dbcFunctions context)
93 writeTypeConstructorMapping sync tempTransDir (typeConstructorMapping context)
93 writeTypeConstructorMapping sync tempTransDir (typeConstructorMapping context)
94 writeSubschemas sync tempTransDir (subschemas trans)
94 writeSubschemas sync tempTransDir (subschemas trans)
95− writeFileSerialise (transactionInfoPath tempTransDir) (transactionInfo trans)
95+ B.encodeFile (transactionInfoPath tempTransDir) (transactionInfo trans)
96 --move the temp directory to final location
96 --move the temp directory to final location
97 renameSync sync tempTransDir finalTransDir
97 renameSync sync tempTransDir finalTransDir
98+ pure ()
99+
100+writeRelVar :: DiskSync -> FilePath -> (RelVarName, Relation) -> IO ()
101+writeRelVar sync transDir (relvarName, rel) = do
102+ let relvarPath = relvarsDir transDir </> T.unpack relvarName
103+ writeBSFileSync sync relvarPath (compress (B.encode rel))
104+
105+writeRelVars :: DiskSync -> FilePath -> M.Map RelVarName Relation -> IO ()
106+writeRelVars sync transDir relvars = mapM_ (writeRelVar sync transDir) $ M.toList relvars
98
107
99−writeRelVars :: DiskSync -> FilePath -> RelationVariables -> IO ()
108+readRelVars :: FilePath -> IO (M.Map RelVarName Relation)
100−writeRelVars sync transDir relvars = do
109+readRelVars transDir = do
101− let path = relvarsPath transDir
110+ let relvarsPath = relvarsDir transDir
102− writeBSFileSync sync path (serialise relvars)
111+ relvarNames <- getDirectoryNames relvarsPath
103−
112+ relvars <- mapM (\name -> do
104−readRelVars :: FilePath -> IO RelationVariables
113+ rel <- B.decode . decompress . BSL.fromStrict <$> BS.readFile (relvarsPath </> name)
105−readRelVars transDir =
114+ return (T.pack name, rel)) relvarNames
106− readFileDeserialise (relvarsPath transDir)
115+ return $ M.fromList relvars
107
116
108writeAtomFuncs :: DiskSync -> FilePath -> AtomFunctions -> IO ()
117writeAtomFuncs :: DiskSync -> FilePath -> AtomFunctions -> IO ()
109writeAtomFuncs sync transDir funcs = do
118writeAtomFuncs sync transDir funcs = do
110 let atomFuncPath = atomFuncsPath transDir
119 let atomFuncPath = atomFuncsPath transDir
111− writeBSFileSync sync atomFuncPath (serialise $ map (\f -> (atomFuncType f, atomFuncName f, atomFunctionScript f)) (HS.toList funcs))
120+ writeBSFileSync sync atomFuncPath (B.encode $ map (\f -> (atomFuncType f, atomFuncName f, atomFunctionScript f)) (HS.toList funcs))
112
121
113--all the atom functions are in one file
122--all the atom functions are in one file
114readAtomFuncs :: FilePath -> Maybe ScriptSession -> IO AtomFunctions
123readAtomFuncs :: FilePath -> Maybe ScriptSession -> IO AtomFunctions
115readAtomFuncs transDir mScriptSession = do
124readAtomFuncs transDir mScriptSession = do
116− atomFuncsList <- readFileDeserialise (atomFuncsPath transDir)
125+ atomFuncsList <- B.decodeFile (atomFuncsPath transDir)
117 --only Haskell script functions can be serialized
126 --only Haskell script functions can be serialized
118 --we always return the pre-compiled functions
127 --we always return the pre-compiled functions
119 funcs <- mapM (\(funcType, funcName, mFuncScript) -> loadAtomFunc precompiledAtomFunctions mScriptSession funcName funcType mFuncScript) atomFuncsList
128 funcs <- mapM (\(funcType, funcName, mFuncScript) -> loadAtomFunc precompiledAtomFunctions mScriptSession funcName funcType mFuncScript) atomFuncsList
120 pure (HS.union precompiledAtomFunctions (HS.fromList funcs))
129 pure (HS.union precompiledAtomFunctions (HS.fromList funcs))
121
130
122loadAtomFunc :: AtomFunctions -> Maybe ScriptSession -> AtomFunctionName -> [AtomType] -> Maybe AtomFunctionBodyScript -> IO AtomFunction
131loadAtomFunc :: AtomFunctions -> Maybe ScriptSession -> AtomFunctionName -> [AtomType] -> Maybe AtomFunctionBodyScript -> IO AtomFunction
123−loadAtomFunc precompiledFuncs _mScriptSession funcName _funcType mFuncScript = case mFuncScript of
132+loadAtomFunc precompiledFuncs mScriptSession funcName funcType mFuncScript = case mFuncScript of
124 --handle pre-compiled case- pull it from the precompiled list
133 --handle pre-compiled case- pull it from the precompiled list
125 Nothing -> case atomFunctionForName funcName precompiledFuncs of
134 Nothing -> case atomFunctionForName funcName precompiledFuncs of
126 --WARNING: possible landmine here if we remove a precompiled atom function in the future, then the transaction cannot be restored
135 --WARNING: possible landmine here if we remove a precompiled atom function in the future, then the transaction cannot be restored
127 Left _ -> error ("expected precompiled atom function: " ++ T.unpack funcName)
136 Left _ -> error ("expected precompiled atom function: " ++ T.unpack funcName)
128 Right realFunc -> pure realFunc
137 Right realFunc -> pure realFunc
129 --handle a real Haskell scripted function- compile and load
138 --handle a real Haskell scripted function- compile and load
130− Just _funcScript ->
139+ Just funcScript ->
131−#ifdef PM36_HASKELL_SCRIPTING
140+ case mScriptSession of
132− case _mScriptSession of
133 Nothing -> error "attempted to read serialized AtomFunction without scripting enabled"
141 Nothing -> error "attempted to read serialized AtomFunction without scripting enabled"
134 Just scriptSession -> do
142 Just scriptSession -> do
135 --risk of GHC exception during compilation here
143 --risk of GHC exception during compilation here
136 eCompiledScript <- runGhc (Just libdir) $ do
144 eCompiledScript <- runGhc (Just libdir) $ do
137 setSession (hscEnv scriptSession)
145 setSession (hscEnv scriptSession)
138− compileScript (atomFunctionBodyType scriptSession) _funcScript
146+ compileScript (atomFunctionBodyType scriptSession) funcScript
139 case eCompiledScript of
147 case eCompiledScript of
140 Left err -> throwIO err
148 Left err -> throwIO err
141 Right compiledScript -> pure AtomFunction { atomFuncName = funcName,
149 Right compiledScript -> pure AtomFunction { atomFuncName = funcName,
142− atomFuncType = _funcType,
150+ atomFuncType = funcType,
143− atomFuncBody = AtomFunctionBody (Just _funcScript) compiledScript }
151+ atomFuncBody = AtomFunctionBody (Just funcScript) compiledScript }
144−#else
145− error "Haskell scripting is disabled"
146−#endif
147
152
148--if the script session is enabled, compile the script, otherwise, hard error!
153--if the script session is enabled, compile the script, otherwise, hard error!
149
154
150readAtomFunc :: FilePath -> AtomFunctionName -> Maybe ScriptSession -> AtomFunctions -> IO AtomFunction
155readAtomFunc :: FilePath -> AtomFunctionName -> Maybe ScriptSession -> AtomFunctions -> IO AtomFunction
151−#if !defined(PM36_HASKELL_SCRIPTING)
152−readAtomFunc _ _ _ _ = error "Haskell scripting is disabled"
153−#else
154readAtomFunc transDir funcName mScriptSession precompiledFuncs = do
156readAtomFunc transDir funcName mScriptSession precompiledFuncs = do
155 let atomFuncPath = atomFuncsPath transDir
157 let atomFuncPath = atomFuncsPath transDir
156− (funcType, mFuncScript) <- readFileDeserialise @([AtomType],Maybe T.Text) atomFuncPath
158+ (funcType, mFuncScript) <- B.decodeFile atomFuncPath
157 case mFuncScript of
159 case mFuncScript of
158 --handle pre-compiled case- pull it from the precompiled list
160 --handle pre-compiled case- pull it from the precompiled list
159 Nothing -> case atomFunctionForName funcName precompiledFuncs of
161 Nothing -> case atomFunctionForName funcName precompiledFuncs of
@@ -161,8 +163,7 @@ readAtomFunc transDir funcName mScriptSession precompiledFuncs = do
161 Left _ -> error ("expected precompiled atom function: " ++ T.unpack funcName)
163 Left _ -> error ("expected precompiled atom function: " ++ T.unpack funcName)
162 Right realFunc -> pure realFunc
164 Right realFunc -> pure realFunc
163 --handle a real Haskell scripted function- compile and load
165 --handle a real Haskell scripted function- compile and load
164− Just funcScript ->
166+ Just funcScript ->
165−
166 case mScriptSession of
167 case mScriptSession of
167 Nothing -> error "attempted to read serialized AtomFunction without scripting enabled"
168 Nothing -> error "attempted to read serialized AtomFunction without scripting enabled"
168 Just scriptSession -> do
169 Just scriptSession -> do
@@ -175,7 +176,6 @@ readAtomFunc transDir funcName mScriptSession precompiledFuncs = do
175 Right compiledScript -> pure AtomFunction { atomFuncName = funcName,
176 Right compiledScript -> pure AtomFunction { atomFuncName = funcName,
176 atomFuncType = funcType,
177 atomFuncType = funcType,
177 atomFuncBody = AtomFunctionBody (Just funcScript) compiledScript }
178 atomFuncBody = AtomFunctionBody (Just funcScript) compiledScript }
178−#endif
179
179
180
180
181writeDBCFuncs :: DiskSync -> FilePath -> DatabaseContextFunctions -> IO ()
181writeDBCFuncs :: DiskSync -> FilePath -> DatabaseContextFunctions -> IO ()
@@ -184,48 +184,40 @@ writeDBCFuncs sync transDir funcs = mapM_ (writeDBCFunc sync transDir) (HS.toLis
184writeDBCFunc :: DiskSync -> FilePath -> DatabaseContextFunction -> IO ()
184writeDBCFunc :: DiskSync -> FilePath -> DatabaseContextFunction -> IO ()
185writeDBCFunc sync transDir func = do
185writeDBCFunc sync transDir func = do
186 let dbcFuncPath = dbcFuncsDir transDir </> T.unpack (dbcFuncName func)
186 let dbcFuncPath = dbcFuncsDir transDir </> T.unpack (dbcFuncName func)
187− writeBSFileSync sync dbcFuncPath (serialise (dbcFuncType func, databaseContextFunctionScript func))
187+ writeBSFileSync sync dbcFuncPath (B.encode (dbcFuncType func, databaseContextFunctionScript func))
188
188
189readDBCFuncs :: FilePath -> Maybe ScriptSession -> IO DatabaseContextFunctions
189readDBCFuncs :: FilePath -> Maybe ScriptSession -> IO DatabaseContextFunctions
190readDBCFuncs transDir mScriptSession = do
190readDBCFuncs transDir mScriptSession = do
191 funcNames <- getDirectoryNames (dbcFuncsDir transDir)
191 funcNames <- getDirectoryNames (dbcFuncsDir transDir)
192 --only Haskell script functions can be serialized
192 --only Haskell script functions can be serialized
193 --we always return the pre-compiled functions
193 --we always return the pre-compiled functions
194− let funcs = mapM ((\name -> readDBCFunc transDir name mScriptSession precompiledDatabaseContextFunctions) . T.pack) funcNames
194+ funcs <- mapM ((\name -> readDBCFunc transDir name mScriptSession precompiledDatabaseContextFunctions) . T.pack) funcNames
195− HS.union basicDatabaseContextFunctions . HS.fromList <$> funcs
195+ return $ HS.union basicDatabaseContextFunctions (HS.fromList funcs)
196
196
197−readDBCFunc :: FilePath -> DatabaseContextFunctionName -> Maybe ScriptSession -> DatabaseContextFunctions -> IO DatabaseContextFunction
197+readDBCFunc :: FilePath -> DatabaseContextFunctionName -> Maybe ScriptSession -> DatabaseContextFunctions -> IO DatabaseContextFunction
198−#if !defined(PM36_HASKELL_SCRIPTING)
199−readDBCFunc transDir funcName _ precompiledFuncs = do
200−#else
201readDBCFunc transDir funcName mScriptSession precompiledFuncs = do
198readDBCFunc transDir funcName mScriptSession precompiledFuncs = do
202−#endif
203 let dbcFuncPath = dbcFuncsDir transDir </> T.unpack funcName
199 let dbcFuncPath = dbcFuncsDir transDir </> T.unpack funcName
204− (_funcType, mFuncScript) <- readFileDeserialise @([AtomType], Maybe T.Text) dbcFuncPath
200+ (funcType, mFuncScript) <- B.decodeFile dbcFuncPath
205 case mFuncScript of
201 case mFuncScript of
206 Nothing -> case databaseContextFunctionForName funcName precompiledFuncs of
202 Nothing -> case databaseContextFunctionForName funcName precompiledFuncs of
207 Left _ -> error ("expected precompiled dbc function: " ++ T.unpack funcName)
203 Left _ -> error ("expected precompiled dbc function: " ++ T.unpack funcName)
208 Right realFunc -> pure realFunc --return precompiled function
204 Right realFunc -> pure realFunc --return precompiled function
209− Just _funcScript ->
205+ Just funcScript ->
210−#ifdef PM36_HASKELL_SCRIPTING
211 case mScriptSession of
206 case mScriptSession of
212 Nothing -> error "attempted to read serialized AtomFunction without scripting enabled"
207 Nothing -> error "attempted to read serialized AtomFunction without scripting enabled"
213 Just scriptSession -> do
208 Just scriptSession -> do
214 eCompiledScript <- runGhc (Just libdir) $ do
209 eCompiledScript <- runGhc (Just libdir) $ do
215 setSession (hscEnv scriptSession)
210 setSession (hscEnv scriptSession)
216− compileScript (dbcFunctionBodyType scriptSession) _funcScript
211+ compileScript (dbcFunctionBodyType scriptSession) funcScript
217 case eCompiledScript of
212 case eCompiledScript of
218 Left err -> throwIO err
213 Left err -> throwIO err
219 Right compiledScript -> pure DatabaseContextFunction { dbcFuncName = funcName,
214 Right compiledScript -> pure DatabaseContextFunction { dbcFuncName = funcName,
220− dbcFuncType = _funcType,
215+ dbcFuncType = funcType,
221− dbcFuncBody = DatabaseContextFunctionBody (Just _funcScript) compiledScript}
216+ dbcFuncBody = DatabaseContextFunctionBody (Just funcScript) compiledScript}
222−#else
223− error "Haskell scripting is disabled"
224−#endif
225
217
226writeIncDep :: DiskSync -> FilePath -> (IncDepName, InclusionDependency) -> IO ()
218writeIncDep :: DiskSync -> FilePath -> (IncDepName, InclusionDependency) -> IO ()
227writeIncDep sync transDir (incDepName, incDep) =
219writeIncDep sync transDir (incDepName, incDep) =
228− writeBSFileSync sync (incDepsDir transDir </> T.unpack incDepName) $ serialise incDep
220+ writeBSFileSync sync (incDepsDir transDir </> T.unpack incDepName) $ B.encode incDep
229
221
230writeIncDeps :: DiskSync -> FilePath -> M.Map IncDepName InclusionDependency -> IO ()
222writeIncDeps :: DiskSync -> FilePath -> M.Map IncDepName InclusionDependency -> IO ()
231writeIncDeps sync transDir incdeps = mapM_ (writeIncDep sync transDir) $ M.toList incdeps
223writeIncDeps sync transDir incdeps = mapM_ (writeIncDep sync transDir) $ M.toList incdeps
@@ -233,32 +225,33 @@ writeIncDeps sync transDir incdeps = mapM_ (writeIncDep sync transDir) $ M.toLis
233readIncDep :: FilePath -> IncDepName -> IO (IncDepName, InclusionDependency)
225readIncDep :: FilePath -> IncDepName -> IO (IncDepName, InclusionDependency)
234readIncDep transDir incdepName = do
226readIncDep transDir incdepName = do
235 let incDepPath = incDepsDir transDir </> T.unpack incdepName
227 let incDepPath = incDepsDir transDir </> T.unpack incdepName
236− incDepData <- readFileDeserialise incDepPath
228+ incDepData <- B.decodeFile incDepPath
237 pure (incdepName, incDepData)
229 pure (incdepName, incDepData)
238
230
239readIncDeps :: FilePath -> IO (M.Map IncDepName InclusionDependency)
231readIncDeps :: FilePath -> IO (M.Map IncDepName InclusionDependency)
240readIncDeps transDir = do
232readIncDeps transDir = do
241 let incDepsPath = incDepsDir transDir
233 let incDepsPath = incDepsDir transDir
242 incDepNames <- getDirectoryNames incDepsPath
234 incDepNames <- getDirectoryNames incDepsPath
243− M.fromList <$> mapM (readIncDep transDir . T.pack) incDepNames
235+ incDeps <- mapM (readIncDep transDir . T.pack) incDepNames
236+ return $ M.fromList incDeps
244
237
245readSubschemas :: FilePath -> IO Subschemas
238readSubschemas :: FilePath -> IO Subschemas
246readSubschemas transDir = do
239readSubschemas transDir = do
247 let sschemasPath = subschemasPath transDir
240 let sschemasPath = subschemasPath transDir
248− readFileDeserialise sschemasPath
241+ B.decodeFile sschemasPath
249
242
250writeSubschemas :: DiskSync -> FilePath -> Subschemas -> IO ()
243writeSubschemas :: DiskSync -> FilePath -> Subschemas -> IO ()
251writeSubschemas sync transDir sschemas = do
244writeSubschemas sync transDir sschemas = do
252 let sschemasPath = subschemasPath transDir
245 let sschemasPath = subschemasPath transDir
253− writeBSFileSync sync sschemasPath (serialise sschemas)
246+ writeBSFileSync sync sschemasPath (B.encode sschemas)
254
247
255writeTypeConstructorMapping :: DiskSync -> FilePath -> TypeConstructorMapping -> IO ()
248writeTypeConstructorMapping :: DiskSync -> FilePath -> TypeConstructorMapping -> IO ()
256writeTypeConstructorMapping sync path types = let atPath = typeConsPath path in
249writeTypeConstructorMapping sync path types = let atPath = typeConsPath path in
257− writeBSFileSync sync atPath $ serialise types
250+ writeBSFileSync sync atPath $ B.encode types
258
251
259readTypeConstructorMapping :: FilePath -> IO TypeConstructorMapping
252readTypeConstructorMapping :: FilePath -> IO TypeConstructorMapping
260readTypeConstructorMapping path = do
253readTypeConstructorMapping path = do
261 let atPath = typeConsPath path
254 let atPath = typeConsPath path
262− readFileDeserialise atPath
255+ B.decodeFile atPath
263−
264
256
257+
src/lib/ProjectM36/Transaction/Type.hsdeleted−8
@@ -1,8 +0,0 @@
1−module ProjectM36.Transaction where
2−import ProjectM36.Base
3−
4−uid :: Transaction -> TransactionId
5−uid (Transaction uid _ _) = uid
6−
7−info :: Transaction -> TransactionInfo
8−info (Transaction _ info _) = info
src/lib/ProjectM36/TransactionDiffs.hsdeleted−12
@@ -1,12 +0,0 @@
1−module ProjectM36.TransactionDiffs where
2−import ProjectM36.Base
3−import Data.List.NonEmpty
4−import Data.UUID as U
5−
6−{-
7−root :: TransactionDiffs
8−root = single U.nil NoOperation
9−
10−single :: TransactionId -> TransactionDiffExpr -> TransactionDiffs
11−single tid expr = (tid, expr) :| []
12−-}
src/lib/ProjectM36/TransactionGraph.hs+151−240
@@ -1,52 +1,46 @@
1−{-# LANGUAGE DeriveGeneric, CPP, FlexibleContexts, DerivingVia #-}
1+{-# LANGUAGE DeriveAnyClass, DeriveGeneric #-}
2module ProjectM36.TransactionGraph where
2module ProjectM36.TransactionGraph where
3import ProjectM36.Base
3import ProjectM36.Base
4import ProjectM36.Error
4import ProjectM36.Error
5import ProjectM36.Transaction
5import ProjectM36.Transaction
6−import ProjectM36.TransactionInfo as TI
7import ProjectM36.Relation
6import ProjectM36.Relation
8import ProjectM36.TupleSet
7import ProjectM36.TupleSet
9import ProjectM36.Tuple
8import ProjectM36.Tuple
10import ProjectM36.RelationalExpression
9import ProjectM36.RelationalExpression
11import ProjectM36.TransactionGraph.Merge
10import ProjectM36.TransactionGraph.Merge
12−import ProjectM36.MerkleHash
13import qualified ProjectM36.DisconnectedTransaction as Discon
11import qualified ProjectM36.DisconnectedTransaction as Discon
14−import qualified ProjectM36.Attribute as A
15
12
16−import Codec.Winery
17−import Control.Monad.Except hiding (join)
18−import Control.Monad.Reader hiding (join)
19import qualified Data.Vector as V
13import qualified Data.Vector as V
14+import qualified ProjectM36.Attribute as A
20import qualified Data.UUID as U
15import qualified Data.UUID as U
21import qualified Data.Set as S
16import qualified Data.Set as S
22import qualified Data.Map as M
17import qualified Data.Map as M
23−import qualified Data.List.NonEmpty as NE
18+import Control.Monad
24import Data.Time.Clock
19import Data.Time.Clock
25import qualified Data.Text as T
20import qualified Data.Text as T
26import GHC.Generics
21import GHC.Generics
22+import Data.Binary
27import Data.Either (lefts, rights, isRight)
23import Data.Either (lefts, rights, isRight)
28−#if __GLASGOW_HASKELL__ < 804
29import Data.Monoid
24import Data.Monoid
30−#endif
31import Control.Arrow
25import Control.Arrow
32import Data.Maybe
26import Data.Maybe
33−import Data.UUID.V4
27+
34−import qualified Data.ByteString.Lazy as BL
28+{-
35−import ProjectM36.DatabaseContext as DBC
29+--import Debug.Trace
36−import Crypto.Hash.SHA256
30+import Control.Monad.Reader
31+import qualified ProjectM36.DisconnectedTransaction as D
32+-}
37
33
38-- | Record a lookup for a specific transaction in the graph.
34-- | Record a lookup for a specific transaction in the graph.
39data TransactionIdLookup = TransactionIdLookup TransactionId |
35data TransactionIdLookup = TransactionIdLookup TransactionId |
40 TransactionIdHeadNameLookup HeadName [TransactionIdHeadBacktrack]
36 TransactionIdHeadNameLookup HeadName [TransactionIdHeadBacktrack]
41− deriving (Show, Eq, Generic)
37+ deriving (Show, Eq, Binary, Generic)
42− deriving Serialise via WineryVariant TransactionIdLookup
43
38
44-- | Used for git-style head backtracking such as topic~3^2.
39-- | Used for git-style head backtracking such as topic~3^2.
45−data TransactionIdHeadBacktrack = TransactionIdHeadParentBacktrack Int | -- ^ git equivalent of ~v: walk back n parents, arbitrarily choosing a parent when a choice must be made
40+data TransactionIdHeadBacktrack = TransactionIdHeadParentBacktrack Int | -- ^ git equivalent of ~: walk back n parents, arbitrarily choosing a parent when a choice must be made
46 TransactionIdHeadBranchBacktrack Int | -- ^ git equivalent of ^: walk back one parent level to the nth arbitrarily-chosen parent
41 TransactionIdHeadBranchBacktrack Int | -- ^ git equivalent of ^: walk back one parent level to the nth arbitrarily-chosen parent
47 TransactionStampHeadBacktrack UTCTime -- ^ git equivalent of 'git-rev-list -n 1 --before X' find the first transaction which was created before the timestamp
42 TransactionStampHeadBacktrack UTCTime -- ^ git equivalent of 'git-rev-list -n 1 --before X' find the first transaction which was created before the timestamp
48− deriving (Show, Eq, Generic)
43+ deriving (Show, Eq, Binary, Generic)
49− deriving Serialise via WineryVariant TransactionIdHeadBacktrack
50
44
51
45
52-- | Operators which manipulate a transaction graph and which transaction the current 'Session' is based upon.
46-- | Operators which manipulate a transaction graph and which transaction the current 'Session' is based upon.
@@ -58,32 +52,22 @@ data TransactionGraphOperator = JumpToHead HeadName |
58 MergeTransactions MergeStrategy HeadName HeadName |
52 MergeTransactions MergeStrategy HeadName HeadName |
59 Commit |
53 Commit |
60 Rollback
54 Rollback
61− deriving (Eq, Show, Generic)
55+ deriving (Eq, Show, Binary, Generic)
62− deriving Serialise via WineryVariant TransactionGraphOperator
63
56
64isCommit :: TransactionGraphOperator -> Bool
57isCommit :: TransactionGraphOperator -> Bool
65isCommit Commit = True
58isCommit Commit = True
66isCommit _ = False
59isCommit _ = False
67
60
68−data ROTransactionGraphOperator = ShowGraph | ValidateMerkleHashes
61+data ROTransactionGraphOperator = ShowGraph
69 deriving Show
62 deriving Show
70
63
71bootstrapTransactionGraph :: UTCTime -> TransactionId -> DatabaseContext -> TransactionGraph
64bootstrapTransactionGraph :: UTCTime -> TransactionId -> DatabaseContext -> TransactionGraph
72−bootstrapTransactionGraph stamp' freshId context = TransactionGraph bootstrapHeads bootstrapTransactions
65+bootstrapTransactionGraph stamp freshId context = TransactionGraph bootstrapHeads bootstrapTransactions
73 where
66 where
74 bootstrapHeads = M.singleton "master" freshTransaction
67 bootstrapHeads = M.singleton "master" freshTransaction
75 newSchemas = Schemas context M.empty
68 newSchemas = Schemas context M.empty
76− freshTransaction = fresh freshId stamp' newSchemas
69+ freshTransaction = Transaction freshId (TransactionInfo U.nil S.empty stamp) newSchemas
77− hashedTransaction = Transaction freshId ((transactionInfo freshTransaction) { merkleHash = calculateMerkleHash freshTransaction emptyTransactionGraph }) newSchemas
70+ bootstrapTransactions = S.singleton freshTransaction
78− bootstrapTransactions = S.singleton hashedTransaction
79−
80−-- | Create a transaction graph from a context.
81−freshTransactionGraph :: DatabaseContext -> IO (TransactionGraph, TransactionId)
82−freshTransactionGraph ctx = do
83− now <- getCurrentTime
84− freshId <- nextRandom
85− pure (bootstrapTransactionGraph now freshId ctx, freshId)
86−
87
71
88emptyTransactionGraph :: TransactionGraph
72emptyTransactionGraph :: TransactionGraph
89emptyTransactionGraph = TransactionGraph M.empty S.empty
73emptyTransactionGraph = TransactionGraph M.empty S.empty
@@ -102,79 +86,76 @@ headNameForTransaction transaction (TransactionGraph heads _) = if M.null matchi
102 where
86 where
103 matchingTrans = M.filter (transaction ==) heads
87 matchingTrans = M.filter (transaction ==) heads
104
88
105−transactionsForIds :: S.Set TransactionId -> TransactionGraph -> Either RelationalError (S.Set Transaction)
89+transactionForId :: TransactionId -> TransactionGraph -> Either RelationalError Transaction
106−transactionsForIds idSet graph =
90+transactionForId tid graph
107− S.fromList <$> forM (S.toList idSet) (`transactionForId` graph)
91+ | tid == U.nil =
92+ Left RootTransactionTraversalError
93+ | S.null matchingTrans =
94+ Left $ NoSuchTransactionError tid
95+ | otherwise =
96+ Right $ head (S.toList matchingTrans)
97+ where
98+ matchingTrans = S.filter (\(Transaction idMatch _ _) -> idMatch == tid) (transactionsForGraph graph)
108
99
109−-- | A root transaction terminates a graph and has no parents.
100+transactionsForIds :: S.Set TransactionId -> TransactionGraph -> Either RelationalError (S.Set Transaction)
110−isRootTransaction :: Transaction -> Bool
101+transactionsForIds idSet graph = do
111−isRootTransaction trans = parentIds trans == S.singleton U.nil
102+ transList <- forM (S.toList idSet) (`transactionForId` graph)
103+ return (S.fromList transList)
112
104
113−rootTransactions :: TransactionGraph -> S.Set Transaction
105+isRootTransaction :: Transaction -> TransactionGraph -> Bool
114−rootTransactions graph = S.filter isRootTransaction (transactionsForGraph graph)
106+isRootTransaction (Transaction _ (TransactionInfo pId _ _) _) _ = U.null pId
107+isRootTransaction (Transaction _ MergeTransactionInfo{} _) _ = False
115
108
116-- the first transaction has no parent - all other do have parents- merges have two parents
109-- the first transaction has no parent - all other do have parents- merges have two parents
117parentTransactions :: Transaction -> TransactionGraph -> Either RelationalError (S.Set Transaction)
110parentTransactions :: Transaction -> TransactionGraph -> Either RelationalError (S.Set Transaction)
118−parentTransactions trans = transactionsForIds (parentIds trans)
111+parentTransactions (Transaction _ (TransactionInfo pId _ _) _) graph = do
112+ trans <- transactionForId pId graph
113+ return (S.singleton trans)
114+
115+parentTransactions (Transaction _ (MergeTransactionInfo pId1 pId2 _ _) _ ) graph = transactionsForIds (S.fromList [pId1, pId2]) graph
116+
119
117
120childTransactions :: Transaction -> TransactionGraph -> Either RelationalError (S.Set Transaction)
118childTransactions :: Transaction -> TransactionGraph -> Either RelationalError (S.Set Transaction)
121−childTransactions trans graph = transactionsForIds childIds graph
119+childTransactions (Transaction _ (TransactionInfo _ children _) _) = transactionsForIds children
122− where
120+childTransactions (Transaction _ (MergeTransactionInfo _ _ children _) _) = transactionsForIds children
123− childIds = S.map transactionId (S.filter filt (transactionsForGraph graph))
124− filt trans' = S.member (transactionId trans) (parentIds trans')
125
121
126-- create a new commit and add it to the heads
122-- create a new commit and add it to the heads
127-- technically, the new head could be added to an existing commit, but by adding a new commit, the new head is unambiguously linked to a new commit (with a context indentical to its parent)
123-- technically, the new head could be added to an existing commit, but by adding a new commit, the new head is unambiguously linked to a new commit (with a context indentical to its parent)
128addBranch :: UTCTime -> TransactionId -> HeadName -> TransactionId -> TransactionGraph -> Either RelationalError (Transaction, TransactionGraph)
124addBranch :: UTCTime -> TransactionId -> HeadName -> TransactionId -> TransactionGraph -> Either RelationalError (Transaction, TransactionGraph)
129−addBranch stamp' newId newBranchName branchPointId graph = do
125+addBranch stamp newId newBranchName branchPointId graph = do
130 parentTrans <- transactionForId branchPointId graph
126 parentTrans <- transactionForId branchPointId graph
131− let newTrans = Transaction newId (TI.singleParent branchPointId stamp') (schemas parentTrans)
127+ let newTrans = Transaction newId (TransactionInfo branchPointId S.empty stamp) (schemas parentTrans)
132 addTransactionToGraph newBranchName newTrans graph
128 addTransactionToGraph newBranchName newTrans graph
133
129
134--adds a disconnected transaction to a transaction graph at some head
130--adds a disconnected transaction to a transaction graph at some head
135addDisconnectedTransaction :: UTCTime -> TransactionId -> HeadName -> DisconnectedTransaction -> TransactionGraph -> Either RelationalError (Transaction, TransactionGraph)
131addDisconnectedTransaction :: UTCTime -> TransactionId -> HeadName -> DisconnectedTransaction -> TransactionGraph -> Either RelationalError (Transaction, TransactionGraph)
136−addDisconnectedTransaction stamp' newId headName (DisconnectedTransaction parentId schemas' _) graph = addTransactionToGraph headName newTrans' graph
132+addDisconnectedTransaction stamp newId headName (DisconnectedTransaction parentId schemas' _) = addTransactionToGraph headName (Transaction newId (TransactionInfo parentId S.empty stamp) schemas')
137− where
133+
138− newTrans = Transaction newId newTInfo schemas'
134+
139− newTInfo = TI.singleParent parentId stamp'
140− newTrans' = Transaction newId (newTInfo { merkleHash = newHash }) schemas'
141− newHash = calculateMerkleHash newTrans graph--lookup parents in graph to calculate
142−--LOOP
143addTransactionToGraph :: HeadName -> Transaction -> TransactionGraph -> Either RelationalError (Transaction, TransactionGraph)
135addTransactionToGraph :: HeadName -> Transaction -> TransactionGraph -> Either RelationalError (Transaction, TransactionGraph)
144addTransactionToGraph headName newTrans graph = do
136addTransactionToGraph headName newTrans graph = do
145− let parentIds' = parentIds newTrans
137+ let parentIds = transactionParentIds newTrans
138+ childIds = transactionChildIds newTrans
146 newId = transactionId newTrans
139 newId = transactionId newTrans
147 validateIds ids = mapM (`transactionForId` graph) (S.toList ids)
140 validateIds ids = mapM (`transactionForId` graph) (S.toList ids)
148− childTs <- childTransactions newTrans graph
141+ addChildTransaction trans = transactionSetChildren trans (S.insert newId (transactionChildIds trans))
149 --validate that the parent transactions are in the graph
142 --validate that the parent transactions are in the graph
150− _ <- validateIds parentIds'
143+ _ <- validateIds parentIds
151− when (S.size parentIds' < 1) (Left $ NewTransactionMissingParentError newId)
144+ when (S.size parentIds < 1) (Left $ NewTransactionMissingParentError newId)
152 --if the headName already exists, ensure that it refers to a parent
145 --if the headName already exists, ensure that it refers to a parent
153 case transactionForHead headName graph of
146 case transactionForHead headName graph of
154 Nothing -> pure () -- any headName is OK
147 Nothing -> pure () -- any headName is OK
155− Just trans -> when (S.notMember (transactionId trans) parentIds') (Left (HeadNameSwitchingHeadProhibitedError headName))
148+ Just trans -> when (S.notMember (transactionId trans) parentIds) (Left (HeadNameSwitchingHeadProhibitedError headName))
156 --validate that the transaction has no children
149 --validate that the transaction has no children
157− unless (S.null childTs) (Left $ NewTransactionMayNotHaveChildrenError newId)
150+ unless (S.null childIds) (Left $ NewTransactionMayNotHaveChildrenError newId)
158 --validate that the trasaction's id is unique
151 --validate that the trasaction's id is unique
159 when (isRight (transactionForId newId graph)) (Left (TransactionIdInUseError newId))
152 when (isRight (transactionForId newId graph)) (Left (TransactionIdInUseError newId))
160− --replace all references to UncommittedTransactionMarker to new transaction id
153+ --update the parent transactions to point to the new transaction
161− let newTrans' = newTransUncommittedReplace newTrans
154+ parents <- mapM (`transactionForId` graph) (S.toList parentIds)
162− updatedTransSet = S.insert newTrans' (transactionsForGraph graph)
155+ let updatedParents = S.map addChildTransaction (S.fromList parents)
163− updatedHeads = M.insert headName newTrans' (transactionHeadsForGraph graph)
156+ updatedTransSet = S.insert newTrans (S.union updatedParents (transactionsForGraph graph))
164− pure (newTrans', TransactionGraph updatedHeads updatedTransSet)
157+ updatedHeads = M.insert headName newTrans (transactionHeadsForGraph graph)
165−
158+ pure (newTrans, TransactionGraph updatedHeads updatedTransSet)
166−--replace all occurrences of the uncommitted context marker
167−newTransUncommittedReplace :: Transaction -> Transaction
168−newTransUncommittedReplace trans@(Transaction tid tinfo (Schemas ctx sschemas)) =
169− Transaction tid tinfo (Schemas fixedContext sschemas)
170− where
171− uncommittedReplace UncommittedContextMarker = TransactionMarker tid
172− uncommittedReplace marker = marker
173− relvars = relationVariables (concreteDatabaseContext trans)
174− fixedRelvars = M.map (fmap uncommittedReplace) relvars
175− fixedContext = ctx { relationVariables = fixedRelvars }
176−
177−
178
159
179validateGraph :: TransactionGraph -> Maybe [RelationalError]
160validateGraph :: TransactionGraph -> Maybe [RelationalError]
180validateGraph graph@(TransactionGraph _ transSet) = do
161validateGraph graph@(TransactionGraph _ transSet) = do
@@ -246,7 +227,7 @@ evalGraphOp _ _ discon graph (WalkBackToTime backTime) = do
246 case transactionForId jumpDest graph of
227 case transactionForId jumpDest graph of
247 Left err -> Left err
228 Left err -> Left err
248 Right trans -> do
229 Right trans -> do
249− let disconnectedTrans = Discon.freshTransaction (transactionId trans) (schemas trans)
230+ let disconnectedTrans = DisconnectedTransaction (transactionId trans) (schemas trans) False
250 Right (disconnectedTrans, graph)
231 Right (disconnectedTrans, graph)
251
232
252-- add new head pointing to branchPoint
233-- add new head pointing to branchPoint
@@ -264,15 +245,15 @@ evalGraphOp newId discon@(DisconnectedTransaction parentId disconContext) graph
264
245
265-- create a new commit and add it to the heads
246-- create a new commit and add it to the heads
266-- technically, the new head could be added to an existing commit, but by adding a new commit, the new head is unambiguously linked to a new commit (with a context indentical to its parent)
247-- technically, the new head could be added to an existing commit, but by adding a new commit, the new head is unambiguously linked to a new commit (with a context indentical to its parent)
267−evalGraphOp stamp' newId (DisconnectedTransaction parentId schemas' _) graph (Branch newBranchName) = do
248+evalGraphOp stamp newId (DisconnectedTransaction parentId schemas' _) graph (Branch newBranchName) = do
268− let newDiscon = Discon.freshTransaction newId schemas'
249+ let newDiscon = DisconnectedTransaction newId schemas' False
269− case addBranch stamp' newId newBranchName parentId graph of
250+ case addBranch stamp newId newBranchName parentId graph of
270 Left err -> Left err
251 Left err -> Left err
271 Right (_, newGraph) -> Right (newDiscon, newGraph)
252 Right (_, newGraph) -> Right (newDiscon, newGraph)
272
253
273-- add the disconnected transaction to the graph
254-- add the disconnected transaction to the graph
274-- affects graph and disconnectedtransaction- the new disconnectedtransaction's parent is the freshly committed transaction
255-- affects graph and disconnectedtransaction- the new disconnectedtransaction's parent is the freshly committed transaction
275−evalGraphOp stamp' newTransId discon@(DisconnectedTransaction parentId schemas' _) graph Commit = case transactionForId parentId graph of
256+evalGraphOp stamp newTransId discon@(DisconnectedTransaction parentId schemas' _) graph Commit = case transactionForId parentId graph of
276 Left err -> Left err
257 Left err -> Left err
277 Right parentTransaction -> case headNameForTransaction parentTransaction graph of
258 Right parentTransaction -> case headNameForTransaction parentTransaction graph of
278 Nothing -> Left $ TransactionIsNotAHeadError parentId
259 Nothing -> Left $ TransactionIsNotAHeadError parentId
@@ -280,20 +261,17 @@ evalGraphOp stamp' newTransId discon@(DisconnectedTransaction parentId schemas'
280 Left err-> Left err
261 Left err-> Left err
281 Right (_, updatedGraph) -> Right (newDisconnectedTrans, updatedGraph)
262 Right (_, updatedGraph) -> Right (newDisconnectedTrans, updatedGraph)
282 where
263 where
283− newDisconnectedTrans = Discon.freshTransaction newTransId schemas'
264+ newDisconnectedTrans = DisconnectedTransaction newTransId schemas' False
284− maybeUpdatedGraph = addDisconnectedTransaction stamp' newTransId headName discon graph
265+ maybeUpdatedGraph = addDisconnectedTransaction stamp newTransId headName discon graph
285
266
286-- refresh the disconnected transaction, return the same graph
267-- refresh the disconnected transaction, return the same graph
287evalGraphOp _ _ (DisconnectedTransaction parentId _ _) graph Rollback = case transactionForId parentId graph of
268evalGraphOp _ _ (DisconnectedTransaction parentId _ _) graph Rollback = case transactionForId parentId graph of
288 Left err -> Left err
269 Left err -> Left err
289 Right parentTransaction -> Right (newDiscon, graph)
270 Right parentTransaction -> Right (newDiscon, graph)
290 where
271 where
291− newDiscon = Discon.freshTransaction parentId (schemas parentTransaction)
272+ newDiscon = DisconnectedTransaction parentId (schemas parentTransaction) False
292
273
293−evalGraphOp stamp' newId (DisconnectedTransaction parentId _ _) graph (MergeTransactions mergeStrategy headNameA headNameB) =
274+evalGraphOp stamp newId (DisconnectedTransaction parentId _ _) graph (MergeTransactions mergeStrategy headNameA headNameB) = mergeTransactions stamp newId parentId mergeStrategy (headNameA, headNameB) graph
294− runGraphRefRelationalExprM env $ mergeTransactions stamp' newId parentId mergeStrategy (headNameA, headNameB)
295− where
296− env = freshGraphRefRelationalExprEnv Nothing graph
297
275
298evalGraphOp _ _ discon graph@(TransactionGraph graphHeads transSet) (DeleteBranch branchName) = case transactionForHead branchName graph of
276evalGraphOp _ _ discon graph@(TransactionGraph graphHeads transSet) (DeleteBranch branchName) = case transactionForHead branchName graph of
299 Nothing -> Left (NoSuchHeadNameError branchName)
277 Nothing -> Left (NoSuchHeadNameError branchName)
@@ -306,7 +284,6 @@ graphAsRelation (DisconnectedTransaction parentId _ _) graph@(TransactionGraph _
306 mkRelationFromList attrs tupleMatrix
284 mkRelationFromList attrs tupleMatrix
307 where
285 where
308 attrs = A.attributesFromList [Attribute "id" TextAtomType,
286 attrs = A.attributesFromList [Attribute "id" TextAtomType,
309− Attribute "hash" ByteStringAtomType,
310 Attribute "stamp" DateTimeAtomType,
287 Attribute "stamp" DateTimeAtomType,
311 Attribute "parents" (RelationAtomType parentAttributes),
288 Attribute "parents" (RelationAtomType parentAttributes),
312 Attribute "current" BoolAtomType,
289 Attribute "current" BoolAtomType,
@@ -316,8 +293,7 @@ graphAsRelation (DisconnectedTransaction parentId _ _) graph@(TransactionGraph _
316 tupleGenerator transaction = case transactionParentsRelation transaction graph of
293 tupleGenerator transaction = case transactionParentsRelation transaction graph of
317 Left err -> Left err
294 Left err -> Left err
318 Right parentTransRel -> Right [TextAtom $ T.pack $ show (transactionId transaction),
295 Right parentTransRel -> Right [TextAtom $ T.pack $ show (transactionId transaction),
319− ByteStringAtom $ _unMerkleHash (merkleHash (transactionInfo transaction)),
296+ DateTimeAtom (transactionTimestamp transaction),
320− DateTimeAtom (timestamp transaction),
321 RelationAtom parentTransRel,
297 RelationAtom parentTransRel,
322 BoolAtom $ parentId == transactionId transaction,
298 BoolAtom $ parentId == transactionId transaction,
323 TextAtom $ fromMaybe "" (headNameForTransaction transaction graph)
299 TextAtom $ fromMaybe "" (headNameForTransaction transaction graph)
@@ -325,7 +301,7 @@ graphAsRelation (DisconnectedTransaction parentId _ _) graph@(TransactionGraph _
325
301
326transactionParentsRelation :: Transaction -> TransactionGraph -> Either RelationalError Relation
302transactionParentsRelation :: Transaction -> TransactionGraph -> Either RelationalError Relation
327transactionParentsRelation trans graph =
303transactionParentsRelation trans graph =
328− if isRootTransaction trans then
304+ if isRootTransaction trans graph then
329 mkRelation attrs emptyTupleSet
305 mkRelation attrs emptyTupleSet
330 else do
306 else do
331 parentTransSet <- parentTransactions trans graph
307 parentTransSet <- parentTransactions trans graph
@@ -344,47 +320,39 @@ evalROGraphOp discon graph ShowGraph = do
344-}
320-}
345
321
346-- | Execute the merge strategy against the transactions, returning a new transaction which can be then added to the transaction graph
322-- | Execute the merge strategy against the transactions, returning a new transaction which can be then added to the transaction graph
347−createMergeTransaction :: UTCTime -> TransactionId -> MergeStrategy -> (Transaction, Transaction) -> GraphRefRelationalExprM Transaction
323+createMergeTransaction :: UTCTime -> TransactionId -> MergeStrategy -> TransactionGraph -> (Transaction, Transaction) -> Either MergeError Transaction
348−createMergeTransaction stamp' newId (SelectedBranchMergeStrategy selectedBranch) t2@(trans1, trans2) = do
324+createMergeTransaction stamp newId (SelectedBranchMergeStrategy selectedBranch) graph t2@(trans1, trans2) = do
349− graph <- gfGraph
350 selectedTrans <- validateHeadName selectedBranch graph t2
325 selectedTrans <- validateHeadName selectedBranch graph t2
351− pure $ addMerkleHash graph $
326+ pure $ Transaction newId (MergeTransactionInfo (transactionId trans1) (transactionId trans2) S.empty stamp) (schemas selectedTrans)
352− Transaction newId (TransactionInfo {
353− parents = NE.fromList [transactionId trans1,
354− transactionId trans2],
355− stamp = stamp',
356− merkleHash = mempty }) (schemas selectedTrans)
357
327
358-- merge functions, relvars, individually
328-- merge functions, relvars, individually
359−createMergeTransaction stamp' newId strat@UnionMergeStrategy t2 =
329+createMergeTransaction stamp newId strat@UnionMergeStrategy graph t2 = createUnionMergeTransaction stamp newId strat graph t2
360− createUnionMergeTransaction stamp' newId strat t2
361
330
362-- merge function, relvars, but, on error, just take the component from the preferred branch
331-- merge function, relvars, but, on error, just take the component from the preferred branch
363−createMergeTransaction stamp' newId strat@(UnionPreferMergeStrategy _) t2 =
332+createMergeTransaction stamp newId strat@(UnionPreferMergeStrategy _) graph t2 = createUnionMergeTransaction stamp newId strat graph t2
364− createUnionMergeTransaction stamp' newId strat t2
365
333
366-- | Returns the correct Transaction for the branch name in the graph and ensures that it is one of the two transaction arguments in the tuple.
334-- | Returns the correct Transaction for the branch name in the graph and ensures that it is one of the two transaction arguments in the tuple.
367−validateHeadName :: HeadName -> TransactionGraph -> (Transaction, Transaction) -> GraphRefRelationalExprM Transaction
335+validateHeadName :: HeadName -> TransactionGraph -> (Transaction, Transaction) -> Either MergeError Transaction
368validateHeadName headName graph (t1, t2) =
336validateHeadName headName graph (t1, t2) =
369 case transactionForHead headName graph of
337 case transactionForHead headName graph of
370− Nothing -> throwError (MergeTransactionError SelectedHeadMismatchMergeError)
338+ Nothing -> Left SelectedHeadMismatchMergeError
371 Just trans -> if trans /= t1 && trans /= t2 then
339 Just trans -> if trans /= t1 && trans /= t2 then
372− throwError (MergeTransactionError SelectedHeadMismatchMergeError)
340+ Left SelectedHeadMismatchMergeError
373 else
341 else
374− pure trans
342+ Right trans
375
343
376-- Algorithm: start at one transaction and work backwards up the parents. If there is a node we have not yet visited as a child, then walk that up to its head. If that branch contains the goal transaction, then we have completed a valid subgraph traversal.
344-- Algorithm: start at one transaction and work backwards up the parents. If there is a node we have not yet visited as a child, then walk that up to its head. If that branch contains the goal transaction, then we have completed a valid subgraph traversal.
377subGraphOfFirstCommonAncestor :: TransactionGraph -> TransactionHeads -> Transaction -> Transaction -> S.Set Transaction -> Either RelationalError TransactionGraph
345subGraphOfFirstCommonAncestor :: TransactionGraph -> TransactionHeads -> Transaction -> Transaction -> S.Set Transaction -> Either RelationalError TransactionGraph
378−subGraphOfFirstCommonAncestor origGraph resultHeads currentTrans' goalTrans traverseSet = do
346+subGraphOfFirstCommonAncestor origGraph resultHeads currentTrans goalTrans traverseSet = do
379− let currentid = transactionId currentTrans'
347+ let currentid = transactionId currentTrans
380 goalid = transactionId goalTrans
348 goalid = transactionId goalTrans
381− if currentTrans' == goalTrans then
349+ if currentTrans == goalTrans then
382 Right (TransactionGraph resultHeads traverseSet) -- add filter
350 Right (TransactionGraph resultHeads traverseSet) -- add filter
383 --catch root transaction to improve error?
351 --catch root transaction to improve error?
384 else do
352 else do
385− currentTransChildren <- childTransactions currentTrans' origGraph
353+ currentTransChildren <- S.fromList <$> mapM (`transactionForId` origGraph) (S.toList (transactionChildIds currentTrans))
386− let searchChildren = S.difference (S.insert currentTrans' traverseSet) currentTransChildren
354+ let searchChildren = S.difference (S.insert currentTrans traverseSet) currentTransChildren
387− searchChild start' = pathToTransaction origGraph start' goalTrans (S.insert currentTrans' traverseSet)
355+ searchChild start = pathToTransaction origGraph start goalTrans (S.insert currentTrans traverseSet)
388 childSearches = map searchChild (S.toList searchChildren)
356 childSearches = map searchChild (S.toList searchChildren)
389 errors = lefts childSearches
357 errors = lefts childSearches
390 pathsFound = rights childSearches
358 pathsFound = rights childSearches
@@ -393,16 +361,17 @@ subGraphOfFirstCommonAncestor origGraph resultHeads currentTrans' goalTrans trav
393 unless (null realErrors) (Left (head realErrors))
361 unless (null realErrors) (Left (head realErrors))
394 -- if no paths found, search the parent
362 -- if no paths found, search the parent
395 if null pathsFound then
363 if null pathsFound then
396− case oneParent currentTrans' of
364+ case oneParent currentTrans of
397 Left RootTransactionTraversalError -> Left (NoCommonTransactionAncestorError currentid goalid)
365 Left RootTransactionTraversalError -> Left (NoCommonTransactionAncestorError currentid goalid)
398 Left err -> Left err
366 Left err -> Left err
399 Right currentTransParent ->
367 Right currentTransParent ->
400− subGraphOfFirstCommonAncestor origGraph resultHeads currentTransParent goalTrans (S.insert currentTrans' traverseSet)
368+ subGraphOfFirstCommonAncestor origGraph resultHeads currentTransParent goalTrans (S.insert currentTrans traverseSet)
401 else -- we found a path
369 else -- we found a path
402 Right (TransactionGraph resultHeads (S.unions (traverseSet : pathsFound)))
370 Right (TransactionGraph resultHeads (S.unions (traverseSet : pathsFound)))
403 where
371 where
404− oneParent (Transaction _ tinfo _) = transactionForId (NE.head (parents tinfo)) origGraph
372+ oneParent (Transaction _ (TransactionInfo parentId _ _) _) = transactionForId parentId origGraph
405−
373+ oneParent (Transaction _ (MergeTransactionInfo parentId _ _ _) _) = transactionForId parentId origGraph
374+
406-- | Search from a past graph point to all following heads for a specific transaction. If found, return the transaction path, otherwise a RelationalError.
375-- | Search from a past graph point to all following heads for a specific transaction. If found, return the transaction path, otherwise a RelationalError.
407pathToTransaction :: TransactionGraph -> Transaction -> Transaction -> S.Set Transaction -> Either RelationalError (S.Set Transaction)
376pathToTransaction :: TransactionGraph -> Transaction -> Transaction -> S.Set Transaction -> Either RelationalError (S.Set Transaction)
408pathToTransaction graph currentTransaction targetTransaction accumTransSet = do
377pathToTransaction graph currentTransaction targetTransaction accumTransSet = do
@@ -410,11 +379,11 @@ pathToTransaction graph currentTransaction targetTransaction accumTransSet = do
410 if transactionId targetTransaction == transactionId currentTransaction then
379 if transactionId targetTransaction == transactionId currentTransaction then
411 Right accumTransSet
380 Right accumTransSet
412 else do
381 else do
413− currentTransChildren <- childTransactions currentTransaction graph
382+ currentTransChildren <- mapM (`transactionForId` graph) (S.toList (transactionChildIds currentTransaction))
414 if null currentTransChildren then
383 if null currentTransChildren then
415 Left (FailedToFindTransactionError targetId)
384 Left (FailedToFindTransactionError targetId)
416 else do
385 else do
417− let searches = map (\t -> pathToTransaction graph t targetTransaction (S.insert t accumTransSet)) (S.toList currentTransChildren)
386+ let searches = map (\t -> pathToTransaction graph t targetTransaction (S.insert t accumTransSet)) currentTransChildren
418 let realErrors = filter (/= FailedToFindTransactionError targetId) (lefts searches)
387 let realErrors = filter (/= FailedToFindTransactionError targetId) (lefts searches)
419 paths = rights searches
388 paths = rights searches
420 if not (null realErrors) then -- found some real errors
389 if not (null realErrors) then -- found some real errors
@@ -424,39 +393,35 @@ pathToTransaction graph currentTransaction targetTransaction accumTransSet = do
424 else --we have some paths!
393 else --we have some paths!
425 Right (S.unions paths)
394 Right (S.unions paths)
426
395
427−mergeTransactions :: UTCTime -> TransactionId -> TransactionId -> MergeStrategy -> (HeadName, HeadName) -> GraphRefRelationalExprM (DisconnectedTransaction, TransactionGraph)
396+mergeTransactions :: UTCTime -> TransactionId -> TransactionId -> MergeStrategy -> (HeadName, HeadName) -> TransactionGraph -> Either RelationalError (DisconnectedTransaction, TransactionGraph)
428−mergeTransactions stamp' newId parentId mergeStrategy (headNameA, headNameB) = do
397+mergeTransactions stamp newId parentId mergeStrategy (headNameA, headNameB) graph = do
429− graph <- gfGraph
430 let transactionForHeadErr name = case transactionForHead name graph of
398 let transactionForHeadErr name = case transactionForHead name graph of
431− Nothing -> throwError (NoSuchHeadNameError name)
399+ Nothing -> Left (NoSuchHeadNameError name)
432− Just t -> pure t
400+ Just t -> Right t
433− runE e = case e of
401+ transA <- transactionForHeadErr headNameA
434− Left e' -> throwError e'
402+ transB <- transactionForHeadErr headNameB
435− Right v -> pure v
403+ disconParent <- transactionForId parentId graph
436− transA <- transactionForHeadErr headNameA
404+ let subHeads = M.filterWithKey (\k _ -> elem k [headNameA, headNameB]) (transactionHeadsForGraph graph)
437− transB <- transactionForHeadErr headNameB
405+ subGraph <- subGraphOfFirstCommonAncestor graph subHeads transA transB S.empty
438− disconParent <- gfTransForId parentId
406+ subGraph' <- filterSubGraph subGraph subHeads
439− let subHeads = M.filterWithKey (\k _ -> k `elem` [headNameA, headNameB]) (transactionHeadsForGraph graph)
407+ case createMergeTransaction stamp newId mergeStrategy subGraph' (transA, transB) of
440− subGraph <- runE $ subGraphOfFirstCommonAncestor graph subHeads transA transB S.empty
408+ Left err -> Left (MergeTransactionError err)
441− subGraph' <- runE $ filterSubGraph subGraph subHeads
409+ Right mergedTrans -> case checkConstraints (concreteDatabaseContext mergedTrans) of
442− mergedTrans <- local (const (freshGraphRefRelationalExprEnv Nothing subGraph')) $ createMergeTransaction stamp' newId mergeStrategy (transA, transB)
410+ Just err -> Left err
443− case headNameForTransaction disconParent graph of
411+ Nothing -> case headNameForTransaction disconParent graph of
444− Nothing -> throwError (TransactionIsNotAHeadError parentId)
412+ Nothing -> Left (TransactionIsNotAHeadError parentId)
445 Just headName -> do
413 Just headName -> do
446− (newTrans, newGraph) <- runE $ addTransactionToGraph headName mergedTrans graph
414+ (newTrans, newGraph) <- addTransactionToGraph headName mergedTrans graph
447− case checkConstraints (concreteDatabaseContext mergedTrans) newId graph of
415+ let newGraph' = TransactionGraph (transactionHeadsForGraph newGraph) (transactionsForGraph newGraph)
448− Left err -> throwError err
416+ newDiscon = DisconnectedTransaction newId (schemas newTrans) False
449− Right _ -> do
417+ pure (newDiscon, newGraph')
450− let newGraph' = TransactionGraph (transactionHeadsForGraph newGraph) (transactionsForGraph newGraph)
451− newDiscon = Discon.freshTransaction newId (schemas newTrans)
452− pure (newDiscon, newGraph')
453
418
454--TEMPORARY COPY/PASTE
419--TEMPORARY COPY/PASTE
455showTransactionStructureX :: Transaction -> TransactionGraph -> String
420showTransactionStructureX :: Transaction -> TransactionGraph -> String
456showTransactionStructureX trans graph = headInfo ++ " " ++ show (transactionId trans) ++ " " ++ parentTransactionsInfo
421showTransactionStructureX trans graph = headInfo ++ " " ++ show (transactionId trans) ++ " " ++ parentTransactionsInfo
457 where
422 where
458 headInfo = maybe "" show (headNameForTransaction trans graph)
423 headInfo = maybe "" show (headNameForTransaction trans graph)
459− parentTransactionsInfo = if isRootTransaction trans then "root" else case parentTransactions trans graph of
424+ parentTransactionsInfo = if isRootTransaction trans graph then "root" else case parentTransactions trans graph of
460 Left err -> show err
425 Left err -> show err
461 Right parentTransSet -> concat $ S.toList $ S.map (show . transactionId) parentTransSet
426 Right parentTransSet -> concat $ S.toList $ S.map (show . transactionId) parentTransSet
462
427
@@ -475,29 +440,25 @@ filterSubGraph graph heads = Right $ TransactionGraph newHeads newTransSet
475 newHeads = M.map (filterTransaction validIds) heads
440 newHeads = M.map (filterTransaction validIds) heads
476
441
477--helper function for commonalities in union merge
442--helper function for commonalities in union merge
478−createUnionMergeTransaction :: UTCTime -> TransactionId -> MergeStrategy -> (Transaction, Transaction) -> GraphRefRelationalExprM Transaction
443+createUnionMergeTransaction :: UTCTime -> TransactionId -> MergeStrategy -> TransactionGraph -> (Transaction, Transaction) -> Either MergeError Transaction
479−createUnionMergeTransaction stamp' newId strategy (t1,t2) = do
444+createUnionMergeTransaction stamp newId strategy graph (t1,t2) = do
480 let contextA = concreteDatabaseContext t1
445 let contextA = concreteDatabaseContext t1
481 contextB = concreteDatabaseContext t2
446 contextB = concreteDatabaseContext t2
482− liftMergeE x = case x of
447+
483− Left e -> throwError (MergeTransactionError e)
484− Right t -> pure t
485−
486− graph <- gfGraph
487 preference <- case strategy of
448 preference <- case strategy of
488 UnionMergeStrategy -> pure PreferNeither
449 UnionMergeStrategy -> pure PreferNeither
489 UnionPreferMergeStrategy preferBranch ->
450 UnionPreferMergeStrategy preferBranch ->
490 case transactionForHead preferBranch graph of
451 case transactionForHead preferBranch graph of
491− Nothing -> throwError (MergeTransactionError (PreferredHeadMissingMergeError preferBranch))
452+ Nothing -> Left (PreferredHeadMissingMergeError preferBranch)
492 Just preferredTrans -> pure $ if t1 == preferredTrans then PreferFirst else PreferSecond
453 Just preferredTrans -> pure $ if t1 == preferredTrans then PreferFirst else PreferSecond
493− badStrat -> throwError (MergeTransactionError (InvalidMergeStrategyError badStrat))
454+ badStrat -> Left (InvalidMergeStrategyError badStrat)
494
455
495− incDeps <- liftMergeE $ unionMergeMaps preference (inclusionDependencies contextA) (inclusionDependencies contextB)
456+ incDeps <- unionMergeMaps preference (inclusionDependencies contextA) (inclusionDependencies contextB)
496 relVars <- unionMergeRelVars preference (relationVariables contextA) (relationVariables contextB)
457 relVars <- unionMergeRelVars preference (relationVariables contextA) (relationVariables contextB)
497− atomFuncs <- liftMergeE $ unionMergeAtomFunctions preference (atomFunctions contextA) (atomFunctions contextB)
458+ atomFuncs <- unionMergeAtomFunctions preference (atomFunctions contextA) (atomFunctions contextB)
498− notifs <- liftMergeE $ unionMergeMaps preference (notifications contextA) (notifications contextB)
459+ notifs <- unionMergeMaps preference (notifications contextA) (notifications contextB)
499− types <- liftMergeE $ unionMergeTypeConstructorMapping preference (typeConstructorMapping contextA) (typeConstructorMapping contextB)
460+ types <- unionMergeTypeConstructorMapping preference (typeConstructorMapping contextA) (typeConstructorMapping contextB)
500− dbcFuncs <- liftMergeE $ unionMergeDatabaseContextFunctions preference (dbcFunctions contextA) (dbcFunctions contextB)
461+ dbcFuncs <- unionMergeDatabaseContextFunctions preference (dbcFunctions contextA) (dbcFunctions contextB)
501 -- TODO: add merge of subschemas
462 -- TODO: add merge of subschemas
502 let newContext = DatabaseContext {
463 let newContext = DatabaseContext {
503 inclusionDependencies = incDeps,
464 inclusionDependencies = incDeps,
@@ -508,12 +469,7 @@ createUnionMergeTransaction stamp' newId strategy (t1,t2) = do
508 typeConstructorMapping = types
469 typeConstructorMapping = types
509 }
470 }
510 newSchemas = Schemas newContext (subschemas t1)
471 newSchemas = Schemas newContext (subschemas t1)
511− pure $ addMerkleHash graph $
472+ pure (Transaction newId (MergeTransactionInfo (transactionId t1) (transactionId t2) S.empty stamp) newSchemas)
512− Transaction newId (TransactionInfo {
513− parents = NE.fromList [transactionId t1,
514− transactionId t2],
515− stamp = stamp',
516− merkleHash = mempty }) newSchemas
517
473
518lookupTransaction :: TransactionGraph -> TransactionIdLookup -> Either RelationalError Transaction
474lookupTransaction :: TransactionGraph -> TransactionIdLookup -> Either RelationalError Transaction
519lookupTransaction graph (TransactionIdLookup tid) = transactionForId tid graph
475lookupTransaction graph (TransactionIdLookup tid) = transactionForId tid graph
@@ -530,57 +486,56 @@ backtrackGraph :: TransactionGraph -> TransactionId -> TransactionIdHeadBacktrac
530-- tilde, step back one parent link- if a choice must be made, choose the "first" link arbitrarily
486-- tilde, step back one parent link- if a choice must be made, choose the "first" link arbitrarily
531backtrackGraph graph currentTid (TransactionIdHeadParentBacktrack steps) = do
487backtrackGraph graph currentTid (TransactionIdHeadParentBacktrack steps) = do
532 trans <- transactionForId currentTid graph
488 trans <- transactionForId currentTid graph
533−
489+ let parents = S.toAscList (transactionParentIds trans)
534− let parentIds' = S.toAscList (parentIds trans)
490+ if length parents < 1 then
535− case parentIds' of
491+ Left RootTransactionTraversalError
536− [] -> Left RootTransactionTraversalError
492+ else do
537− firstParentId:_ -> do
493+ parentTrans <- transactionForId (head parents) graph
538− parentTrans <- transactionForId firstParentId graph
494+ if steps == 1 then
539− if steps == 1 then
495+ pure (transactionId parentTrans)
540− pure (transactionId parentTrans)
496+ else
541− else
497+ backtrackGraph graph (transactionId parentTrans) (TransactionIdHeadParentBacktrack (steps - 1))
542− backtrackGraph graph (transactionId parentTrans) (TransactionIdHeadParentBacktrack (steps - 1))
543
498
544backtrackGraph graph currentTid (TransactionIdHeadBranchBacktrack steps) = do
499backtrackGraph graph currentTid (TransactionIdHeadBranchBacktrack steps) = do
545 trans <- transactionForId currentTid graph
500 trans <- transactionForId currentTid graph
546− let parentIds' = parentIds trans
501+ let parents = transactionParentIds trans
547− if S.size parentIds' < 1 then
502+ if S.size parents < 1 then
548 Left RootTransactionTraversalError
503 Left RootTransactionTraversalError
549− else if S.size parentIds' < steps then
504+ else if S.size parents < steps then
550− Left (ParentCountTraversalError (S.size parentIds') steps)
505+ Left (ParentCountTraversalError (S.size parents) steps)
551 else
506 else
552− pure (S.elemAt (steps - 1) parentIds')
507+ pure (S.elemAt (steps - 1) parents)
553
508
554−backtrackGraph graph currentTid btrack@(TransactionStampHeadBacktrack stamp') = do
509+backtrackGraph graph currentTid btrack@(TransactionStampHeadBacktrack stamp) = do
555 trans <- transactionForId currentTid graph
510 trans <- transactionForId currentTid graph
556− let parentIds' = parentIds trans
511+ let parents = transactionParentIds trans
557− if timestamp trans <= stamp' then
512+ if transactionTimestamp trans < stamp then
558 pure currentTid
513 pure currentTid
559− else if S.null parentIds' then
514+ else if S.null parents then
560 Left RootTransactionTraversalError
515 Left RootTransactionTraversalError
561 else
516 else
562− let arbitraryParent = head (S.toList parentIds') in
517+ let arbitraryParent = head (S.toList parents) in
563 backtrackGraph graph arbitraryParent btrack
518 backtrackGraph graph arbitraryParent btrack
564
519
565-- | Create a temporary branch for commit, merge the result to head, delete the temporary branch. This is useful to atomically commit a transaction, avoiding a TransactionIsNotHeadError but trading it for a potential MergeError.
520-- | Create a temporary branch for commit, merge the result to head, delete the temporary branch. This is useful to atomically commit a transaction, avoiding a TransactionIsNotHeadError but trading it for a potential MergeError.
566--this is not a GraphOp because it combines multiple graph operations
521--this is not a GraphOp because it combines multiple graph operations
567autoMergeToHead :: UTCTime -> (TransactionId, TransactionId, TransactionId) -> DisconnectedTransaction -> HeadName -> MergeStrategy -> TransactionGraph -> Either RelationalError (DisconnectedTransaction, TransactionGraph)
522autoMergeToHead :: UTCTime -> (TransactionId, TransactionId, TransactionId) -> DisconnectedTransaction -> HeadName -> MergeStrategy -> TransactionGraph -> Either RelationalError (DisconnectedTransaction, TransactionGraph)
568−autoMergeToHead stamp' (tempBranchTransId, tempCommitTransId, mergeTransId) discon mergeToHeadName strat graph = do
523+autoMergeToHead stamp (tempBranchTransId, tempCommitTransId, mergeTransId) discon mergeToHeadName strat graph = do
569 let tempBranchName = "mergebranch_" <> U.toText tempBranchTransId
524 let tempBranchName = "mergebranch_" <> U.toText tempBranchTransId
570 --create the temp branch
525 --create the temp branch
571− (discon', graph') <- evalGraphOp stamp' tempBranchTransId discon graph (Branch tempBranchName)
526+ (discon', graph') <- evalGraphOp stamp tempBranchTransId discon graph (Branch tempBranchName)
572
527
573 --commit to the new branch- possible future optimization: don't require fsync for this- create a temp commit type
528 --commit to the new branch- possible future optimization: don't require fsync for this- create a temp commit type
574− (discon'', graph'') <- evalGraphOp stamp' tempCommitTransId discon' graph' Commit
529+ (discon'', graph'') <- evalGraphOp stamp tempCommitTransId discon' graph' Commit
575
530
576 --jump to merge head
531 --jump to merge head
577− (discon''', graph''') <- evalGraphOp stamp' tempBranchTransId discon'' graph'' (JumpToHead mergeToHeadName)
532+ (discon''', graph''') <- evalGraphOp stamp tempBranchTransId discon'' graph'' (JumpToHead mergeToHeadName)
578
533
579 --create the merge
534 --create the merge
580− (discon'''', graph'''') <- evalGraphOp stamp' mergeTransId discon''' graph''' (MergeTransactions strat tempBranchName mergeToHeadName)
535+ (discon'''', graph'''') <- evalGraphOp stamp mergeTransId discon''' graph''' (MergeTransactions strat tempBranchName mergeToHeadName)
581
536
582 --delete the temp branch
537 --delete the temp branch
583− (discon''''', graph''''') <- evalGraphOp stamp' tempBranchTransId discon'''' graph'''' (DeleteBranch tempBranchName)
538+ (discon''''', graph''''') <- evalGraphOp stamp tempBranchTransId discon'''' graph'''' (DeleteBranch tempBranchName)
584 {-
539 {-
585 let rel = runReader (evalRelationalExpr (RelationVariable "s" ())) (mkRelationalExprState $ D.concreteDatabaseContext discon'''')
540 let rel = runReader (evalRelationalExpr (RelationVariable "s" ())) (mkRelationalExprState $ D.concreteDatabaseContext discon'''')
586 traceShowM rel
541 traceShowM rel
@@ -588,48 +543,4 @@ autoMergeToHead stamp' (tempBranchTransId, tempCommitTransId, mergeTransId) disc
588
543
589 pure (discon''''', graph''''')
544 pure (discon''''', graph''''')
590
545
591−
592−addMerkleHash :: TransactionGraph -> Transaction -> Transaction
593−addMerkleHash graph trans = Transaction (transactionId trans) newInfo (schemas trans)
594− where
595− newInfo = (transactionInfo trans) { merkleHash = calculateMerkleHash trans graph }
596
546
597−-- the new hash includes the parents' ids, the current id, and the hash of the context, and the merkle hashes of the parent transactions
598−calculateMerkleHash :: Transaction -> TransactionGraph -> MerkleHash
599−calculateMerkleHash trans graph = MerkleHash $ hashlazy (BL.fromChunks [transIds,
600− schemasBytes
601− ] <> dbcBytes <> parentMerkleHashes)
602− where
603− parentMerkleHashes = BL.fromChunks $ map (_unMerkleHash . getMerkleHash) parentTranses
604− parentTranses =
605− case transactionsForIds (parentIds trans) graph of
606− Left RootTransactionTraversalError -> []
607− Left e -> error ("failed to find transaction in Merkle hash construction: " ++ show e)
608− Right t -> S.toList t
609− getMerkleHash t = merkleHash (transactionInfo t)
610− transIds = serialise (transactionId trans : S.toList (parentIds trans))
611− dbcBytes = DBC.hashBytes (concreteDatabaseContext trans)
612− schemasBytes = serialise (subschemas trans)
613−
614−validateMerkleHash :: Transaction -> TransactionGraph -> Either MerkleValidationError ()
615−validateMerkleHash trans graph =
616− if expectedHash /= actualHash then
617− Left (MerkleValidationError (transactionId trans) expectedHash actualHash)
618− else
619− pure ()
620− where
621− expectedHash = merkleHash (transactionInfo trans)
622− actualHash = calculateMerkleHash trans graph
623−
624−data MerkleValidationError = MerkleValidationError TransactionId MerkleHash MerkleHash
625− deriving (Show, Eq, Generic)
626−
627−validateMerkleHashes :: TransactionGraph -> Either [MerkleValidationError] ()
628−validateMerkleHashes graph =
629− if null errs then pure () else Left errs
630− where
631− errs = S.foldr validateTrans [] (transactionsForGraph graph)
632− validateTrans trans acc =
633− case validateMerkleHash trans graph of
634− Left err -> err : acc
635− _ -> acc
src/lib/ProjectM36/TransactionGraph/Merge.hs+12−16
@@ -2,11 +2,10 @@
2module ProjectM36.TransactionGraph.Merge where
2module ProjectM36.TransactionGraph.Merge where
3import ProjectM36.Base
3import ProjectM36.Base
4import ProjectM36.Error
4import ProjectM36.Error
5−import ProjectM36.RelationalExpression
6−import Control.Monad.Except hiding (join)
7import qualified Data.Set as S
5import qualified Data.Set as S
8import qualified Data.Map as M
6import qualified Data.Map as M
9import qualified ProjectM36.TypeConstructorDef as TCD
7import qualified ProjectM36.TypeConstructorDef as TCD
8+import ProjectM36.Relation
10import Control.Monad (foldM)
9import Control.Monad (foldM)
11import qualified Data.HashSet as HS
10import qualified Data.HashSet as HS
12
11
@@ -23,22 +22,19 @@ unionMergeMaps prefer mapA mapB = case prefer of
23 Left StrategyViolatesComponentMergeError
22 Left StrategyViolatesComponentMergeError
24
23
25-- perform the merge even if the attributes are different- is this what we want? Obviously, we need finer-grained merge options.
24-- perform the merge even if the attributes are different- is this what we want? Obviously, we need finer-grained merge options.
26−unionMergeRelation :: MergePreference -> GraphRefRelationalExpr -> GraphRefRelationalExpr -> GraphRefRelationalExprM GraphRefRelationalExpr
25+unionMergeRelation :: MergePreference -> Relation -> Relation -> Either MergeError Relation
27−unionMergeRelation prefer relA relB = do
26+unionMergeRelation prefer relA relB = case relA `union` relB of
28− let unioned = Union relA relB
27+ Right unionRel -> pure unionRel
29− mergeErr = MergeTransactionError StrategyViolatesRelationVariableMergeError
28+ Left (AttributeNamesMismatchError _) -> preferredRelVar
30− preferredRelVar =
29+ Left _ -> Left StrategyViolatesRelationVariableMergeError
31− case prefer of
30+ where
32− PreferFirst -> pure relA
31+ preferredRelVar = case prefer of
33− PreferSecond -> pure relB
32+ PreferFirst -> Right relA
34− PreferNeither -> throwError mergeErr
33+ PreferSecond -> Right relB
35− handler AttributeNamesMismatchError{} = preferredRelVar
34+ PreferNeither -> Left StrategyViolatesRelationVariableMergeError
36− handler _err' = throwError mergeErr
37− --typecheck first?
38− (evalGraphRefRelationalExpr unioned >> pure (Union relA relB)) `catchError` handler
39
35
40--try to execute unions against the relvars contents -- if a relvar only appears in one context, include it
36--try to execute unions against the relvars contents -- if a relvar only appears in one context, include it
41−unionMergeRelVars :: MergePreference -> RelationVariables -> RelationVariables -> GraphRefRelationalExprM RelationVariables
37+unionMergeRelVars :: MergePreference -> RelationVariables -> RelationVariables -> Either MergeError RelationVariables
42unionMergeRelVars prefer relvarsA relvarsB = do
38unionMergeRelVars prefer relvarsA relvarsB = do
43 let allNames = S.toList (S.union (M.keysSet relvarsA) (M.keysSet relvarsB))
39 let allNames = S.toList (S.union (M.keysSet relvarsA) (M.keysSet relvarsB))
44 foldM (\acc name -> do
40 foldM (\acc name -> do
src/lib/ProjectM36/TransactionGraph/Persist.hs+15−26
@@ -1,8 +1,8 @@
1module ProjectM36.TransactionGraph.Persist where
1module ProjectM36.TransactionGraph.Persist where
2import ProjectM36.Error
2import ProjectM36.Error
3+import ProjectM36.TransactionGraph
3import ProjectM36.Transaction
4import ProjectM36.Transaction
4import ProjectM36.Transaction.Persist
5import ProjectM36.Transaction.Persist
5−import ProjectM36.RelationalExpression
6import ProjectM36.Base
6import ProjectM36.Base
7import ProjectM36.ScriptSession
7import ProjectM36.ScriptSession
8import ProjectM36.Persist (writeFileSync, renameSync, DiskSync)
8import ProjectM36.Persist (writeFileSync, renameSync, DiskSync)
@@ -21,12 +21,9 @@ import Data.Either (isRight)
21import Data.Maybe (fromMaybe)
21import Data.Maybe (fromMaybe)
22import qualified Data.List as L
22import qualified Data.List as L
23import Control.Exception.Base
23import Control.Exception.Base
24−import qualified Data.ByteString as BS
24+import qualified Data.Text.IO as TIO
25−import qualified Data.Text.Encoding as TE
26import Data.ByteString (ByteString)
25import Data.ByteString (ByteString)
27−#if __GLASGOW_HASKELL__ < 804
28import Data.Monoid
26import Data.Monoid
29−#endif
30import qualified Crypto.Hash.SHA256 as SHA256
27import qualified Crypto.Hash.SHA256 as SHA256
31import Control.Arrow
28import Control.Arrow
32import Data.Time.Clock
29import Data.Time.Clock
@@ -86,12 +83,13 @@ setupDatabaseDir sync dbdir bootstrapGraph = do
86 locker <- openLockFile (lockFilePath dbdir)
83 locker <- openLockFile (lockFilePath dbdir)
87 gDigest <- bracket_ (lockFile locker WriteLock) (unlockFile locker) (readGraphTransactionIdFileDigest dbdir)
84 gDigest <- bracket_ (lockFile locker WriteLock) (unlockFile locker) (readGraphTransactionIdFileDigest dbdir)
88 pure (Right (locker, gDigest))
85 pure (Right (locker, gDigest))
89− else if not m36exists then
86+ else if not m36exists then do
90− Right <$> bootstrapDatabaseDir sync dbdir bootstrapGraph
87+ locks <- bootstrapDatabaseDir sync dbdir bootstrapGraph
88+ pure (Right locks)
91 else
89 else
92 pure (Left (InvalidDirectoryError dbdir))
90 pure (Left (InvalidDirectoryError dbdir))
93{-
91{-
94−initialize a database directory with the graph from which to bootstrap- return lock file handle which must be closed by the caller
92+initialize a database directory with the graph from which to bootstrap- return lock file handle
95-}
93-}
96bootstrapDatabaseDir :: DiskSync -> FilePath -> TransactionGraph -> IO (LockFile, LockFileHash)
94bootstrapDatabaseDir :: DiskSync -> FilePath -> TransactionGraph -> IO (LockFile, LockFileHash)
97bootstrapDatabaseDir sync dbdir bootstrapGraph = do
95bootstrapDatabaseDir sync dbdir bootstrapGraph = do
@@ -194,35 +192,26 @@ writeGraphTransactionIdFile sync destDirectory (TransactionGraph _ transSet) = w
194 uuidInfo = T.intercalate "\n" graphLines
192 uuidInfo = T.intercalate "\n" graphLines
195 digest = SHA256.hash (encodeUtf8 uuidInfo)
193 digest = SHA256.hash (encodeUtf8 uuidInfo)
196 graphLines = S.toList $ S.map graphLine transSet
194 graphLines = S.toList $ S.map graphLine transSet
197− epochTime = realToFrac . utcTimeToPOSIXSeconds . timestamp :: Transaction -> Double
195+ epochTime = realToFrac . utcTimeToPOSIXSeconds . transactionTimestamp :: Transaction -> Double
198 graphLine trans = U.toText (transactionId trans)
196 graphLine trans = U.toText (transactionId trans)
199 <> " "
197 <> " "
200 <> T.pack (show (epochTime trans))
198 <> T.pack (show (epochTime trans))
201 <> " "
199 <> " "
202− <> T.intercalate " " (S.toList (S.map U.toText $ parentIds trans))
200+ <> T.intercalate " " (S.toList (S.map U.toText $ transactionParentIds trans))
203
201
204readGraphTransactionIdFileDigest :: FilePath -> IO LockFileHash
202readGraphTransactionIdFileDigest :: FilePath -> IO LockFileHash
205readGraphTransactionIdFileDigest dbdir = do
203readGraphTransactionIdFileDigest dbdir = do
206− let graphTransactionIdData = readUTF8FileOrError (transactionLogPath dbdir)
204+ graphTransactionIdData <- TIO.readFile (transactionLogPath dbdir)
207− SHA256.hash . encodeUtf8 <$> graphTransactionIdData
205+ pure (SHA256.hash (encodeUtf8 graphTransactionIdData))
208
206
209readGraphTransactionIdFile :: FilePath -> IO (Either PersistenceError [(TransactionId, UTCTime, [TransactionId])])
207readGraphTransactionIdFile :: FilePath -> IO (Either PersistenceError [(TransactionId, UTCTime, [TransactionId])])
210readGraphTransactionIdFile dbdir = do
208readGraphTransactionIdFile dbdir = do
211 --read in all transactions' uuids
209 --read in all transactions' uuids
212− let grapher line = let tid:epochText:parentIds' = T.words line in
210+ let grapher line = let tid:epochText:parentIds = T.words line in
213− (readUUID tid, readEpoch epochText, map readUUID parentIds')
211+ (readUUID tid, readEpoch epochText, map readUUID parentIds)
214 readUUID uuidText = fromMaybe (error "failed to read uuid") (U.fromText uuidText)
212 readUUID uuidText = fromMaybe (error "failed to read uuid") (U.fromText uuidText)
215 readEpoch t = posixSecondsToUTCTime (realToFrac (either (error "failed to read epoch") fst (double t)))
213 readEpoch t = posixSecondsToUTCTime (realToFrac (either (error "failed to read epoch") fst (double t)))
216− Right . map grapher . T.lines <$> readUTF8FileOrError (transactionLogPath dbdir)
214+ --warning: uses lazy IO
217−
215+ graphTransactionIdData <- TIO.readFile (transactionLogPath dbdir)
218−--rationale- reading essential database files must fail hard
216+ return $ Right (map grapher $ T.lines graphTransactionIdData)
219−readUTF8FileOrError :: FilePath -> IO T.Text
220−readUTF8FileOrError pathIn = do
221− eFileBytes <- try (BS.readFile pathIn) :: IO (Either IOError BS.ByteString)
222− case eFileBytes of
223− Left err -> error (show err)
224− Right fileBytes ->
225− case TE.decodeUtf8' fileBytes of
226− Left err -> error (show err)
227− Right utf8Bytes -> pure utf8Bytes
228
217
src/lib/ProjectM36/TransactionGraph/Show.hs+4−3
@@ -1,16 +1,17 @@
1module ProjectM36.TransactionGraph.Show where
1module ProjectM36.TransactionGraph.Show where
2import ProjectM36.Base
2import ProjectM36.Base
3import ProjectM36.TransactionGraph
3import ProjectM36.TransactionGraph
4+import ProjectM36.Transaction
4import qualified Data.Set as S
5import qualified Data.Set as S
5
6
6showTransactionStructure :: Transaction -> TransactionGraph -> String
7showTransactionStructure :: Transaction -> TransactionGraph -> String
7−showTransactionStructure trans graph = headInfo ++ " " ++ show (transactionId trans) ++ " p" ++ parentTransactionsInfo
8+showTransactionStructure trans graph = headInfo ++ " " ++ show (transactionId trans) ++ " p" ++ parentTransactionsInfo ++ " c" ++ childTransactionsInfo
8 where
9 where
9 headInfo = maybe "" show (headNameForTransaction trans graph)
10 headInfo = maybe "" show (headNameForTransaction trans graph)
10− parentTransactionsInfo = if isRootTransaction trans then "root" else case parentTransactions trans graph of
11+ parentTransactionsInfo = if isRootTransaction trans graph then "root" else case parentTransactions trans graph of
11 Left err -> show err
12 Left err -> show err
12 Right parentTransSet -> concat $ S.toList $ S.map (show . transactionId) parentTransSet
13 Right parentTransSet -> concat $ S.toList $ S.map (show . transactionId) parentTransSet
13−
14+ childTransactionsInfo = show (S.toList (transactionChildIds trans))
14
15
15showGraphStructure :: TransactionGraph -> String
16showGraphStructure :: TransactionGraph -> String
16showGraphStructure graph@(TransactionGraph _ transSet) = S.foldr folder "" transSet
17showGraphStructure graph@(TransactionGraph _ transSet) = S.foldr folder "" transSet
src/lib/ProjectM36/TransactionGraph/Types.hsdeleted−12
@@ -1,12 +0,0 @@
1−module ProjectM36.TransactionGraph.Types where
2−import ProjectM36.Base
3−
4−transactions :: TransactionGraph -> S.Set Transaction
5−transactions (TransactionGraph _ t) = t
6−
7−transactionHeads :: TransactionGraph -> TransactionHeads
8−transactionHeads (TransactionGraph heads _) = heads
9−
10−transactionInfoDiffs :: TransactionInfo -> TransactionDiffs
11−transactionInfoDiffs (TransactionInfo _ d _) = d
12−transactionInfoDiffs (MergeTransactionInfo _ _ d _ ) = d
src/lib/ProjectM36/TransactionInfo.hsdeleted−12
@@ -1,12 +0,0 @@
1−module ProjectM36.TransactionInfo where
2−import ProjectM36.Base
3−import Data.Time.Clock
4−import qualified Data.List.NonEmpty as NE
5−
6−-- | Create a TransactionInfo with just one parent transaction ID.
7−singleParent :: TransactionId -> UTCTime -> TransactionInfo
8−singleParent tid stamp' = TransactionInfo {
9− parents = tid NE.:| [],
10− stamp = stamp',
11− merkleHash = mempty }
12−
src/lib/ProjectM36/Tuple.hs+43−49
@@ -1,7 +1,7 @@
1module ProjectM36.Tuple where
1module ProjectM36.Tuple where
2import ProjectM36.Base
2import ProjectM36.Base
3import ProjectM36.Error
3import ProjectM36.Error
4−import ProjectM36.Attribute as A
4+import ProjectM36.Attribute
5import ProjectM36.Atom
5import ProjectM36.Atom
6import ProjectM36.AtomType
6import ProjectM36.AtomType
7import ProjectM36.DataTypes.Primitive
7import ProjectM36.DataTypes.Primitive
@@ -15,19 +15,19 @@ import Control.Arrow
15import Data.Maybe
15import Data.Maybe
16
16
17emptyTuple :: RelationTuple
17emptyTuple :: RelationTuple
18−emptyTuple = RelationTuple mempty mempty
18+emptyTuple = RelationTuple V.empty V.empty
19
19
20tupleSize :: RelationTuple -> Int
20tupleSize :: RelationTuple -> Int
21−tupleSize (RelationTuple tupAttrs _) = arity tupAttrs
21+tupleSize (RelationTuple tupAttrs _) = V.length tupAttrs
22
22
23tupleAttributeNameSet :: RelationTuple -> S.Set AttributeName
23tupleAttributeNameSet :: RelationTuple -> S.Set AttributeName
24−tupleAttributeNameSet (RelationTuple tupAttrs _) = attributeNameSet tupAttrs
24+tupleAttributeNameSet (RelationTuple tupAttrs _) = S.fromList $ V.toList $ V.map attributeName tupAttrs
25
25
26tupleAttributes :: RelationTuple -> Attributes
26tupleAttributes :: RelationTuple -> Attributes
27tupleAttributes (RelationTuple tupAttrs _) = tupAttrs
27tupleAttributes (RelationTuple tupAttrs _) = tupAttrs
28
28
29tupleAssocs :: RelationTuple -> [(AttributeName, Atom)]
29tupleAssocs :: RelationTuple -> [(AttributeName, Atom)]
30−tupleAssocs (RelationTuple attrs tupVec) = V.toList $ V.map (first attributeName) (V.zip (attributesVec attrs) tupVec)
30+tupleAssocs (RelationTuple attrVec tupVec) = V.toList $ V.map (first attributeName) (V.zip attrVec tupVec)
31
31
32orderedTupleAssocs :: RelationTuple -> [(AttributeName, Atom)]
32orderedTupleAssocs :: RelationTuple -> [(AttributeName, Atom)]
33orderedTupleAssocs tup@(RelationTuple attrVec _) = map (\attr -> (attributeName attr, atomForAttr (attributeName attr))) oAttrs
33orderedTupleAssocs tup@(RelationTuple attrVec _) = map (\attr -> (attributeName attr, atomForAttr (attributeName attr))) oAttrs
@@ -42,15 +42,23 @@ tupleAtoms :: RelationTuple -> V.Vector Atom
42tupleAtoms (RelationTuple _ tupVec) = tupVec
42tupleAtoms (RelationTuple _ tupVec) = tupVec
43
43
44atomForAttributeName :: AttributeName -> RelationTuple -> Either RelationalError Atom
44atomForAttributeName :: AttributeName -> RelationTuple -> Either RelationalError Atom
45−atomForAttributeName attrName (RelationTuple tupAttrs tupVec) = case V.findIndex (\attr -> attributeName attr == attrName) (attributesVec tupAttrs) of
45+atomForAttributeName attrName (RelationTuple tupAttrs tupVec) = case V.findIndex (\attr -> attributeName attr == attrName) tupAttrs of
46 Nothing -> Left (NoSuchAttributeNamesError (S.singleton attrName))
46 Nothing -> Left (NoSuchAttributeNamesError (S.singleton attrName))
47 Just index -> case tupVec V.!? index of
47 Just index -> case tupVec V.!? index of
48 Nothing -> Left (NoSuchAttributeNamesError (S.singleton attrName))
48 Nothing -> Left (NoSuchAttributeNamesError (S.singleton attrName))
49 Just atom -> Right atom
49 Just atom -> Right atom
50
50
51+{- -- resolve naming clash with Attribute and Relation later
52+atomTypeForAttributeName :: AttributeName -> RelationTuple -> Either RelationalError Atom
53+atomTypeForAttributeName attrName tup = do
54+ atom <- atomForAttributeName attrName tup
55+ return $ atomTypeForAtom atom
56+-}
57+
51atomsForAttributeNames :: V.Vector AttributeName -> RelationTuple -> Either RelationalError (V.Vector Atom)
58atomsForAttributeNames :: V.Vector AttributeName -> RelationTuple -> Either RelationalError (V.Vector Atom)
52−atomsForAttributeNames attrNames tuple =
59+atomsForAttributeNames attrNames tuple = do
53− V.map (\index -> tupleAtoms tuple V.! index) <$> vectorIndicesForAttributeNames attrNames (tupleAttributes tuple)
60+ vindices <- vectorIndicesForAttributeNames attrNames (tupleAttributes tuple)
61+ return $ V.map (\index -> tupleAtoms tuple V.! index) vindices
54
62
55vectorIndicesForAttributeNames :: V.Vector AttributeName -> Attributes -> Either RelationalError (V.Vector Int)
63vectorIndicesForAttributeNames :: V.Vector AttributeName -> Attributes -> Either RelationalError (V.Vector Int)
56vectorIndicesForAttributeNames attrNameVec attrs = if not $ V.null unknownAttrNames then
64vectorIndicesForAttributeNames attrNameVec attrs = if not $ V.null unknownAttrNames then
@@ -59,7 +67,7 @@ vectorIndicesForAttributeNames attrNameVec attrs = if not $ V.null unknownAttrNa
59 Right $ V.map mapper attrNameVec
67 Right $ V.map mapper attrNameVec
60 where
68 where
61 unknownAttrNames = V.filter (`V.notElem` attributeNames attrs) attrNameVec
69 unknownAttrNames = V.filter (`V.notElem` attributeNames attrs) attrNameVec
62− mapper attrName = fromMaybe (error "logic failure in vectorIndicesForAttributeNames") (V.elemIndex attrName (attributeNames attrs))
70+ mapper attrName = fromMaybe (error "logic failure in vectorIndicesForAttributeNames") (V.elemIndex attrName (V.map attributeName attrs))
63
71
64
72
65relationForAttributeName :: AttributeName -> RelationTuple -> Either RelationalError Relation
73relationForAttributeName :: AttributeName -> RelationTuple -> Either RelationalError Relation
@@ -86,10 +94,10 @@ mkRelationTuples attrs = map mapper
86 mapper = mkRelationTuple attrs
94 mapper = mkRelationTuple attrs
87
95
88mkRelationTupleFromMap :: M.Map AttributeName Atom -> RelationTuple
96mkRelationTupleFromMap :: M.Map AttributeName Atom -> RelationTuple
89−mkRelationTupleFromMap attrMap = RelationTuple (attributesFromList attrs) (V.map (attrMap M.!) (V.fromList attrNames))
97+mkRelationTupleFromMap attrMap = RelationTuple attrs (V.map (\attrName -> attrMap M.! attrName) attrNames)
90 where
98 where
91− attrNames = M.keys attrMap
99+ attrNames = V.fromList (M.keys attrMap)
92− attrs = map (\attrName -> Attribute attrName (atomTypeForAtom (attrMap M.! attrName))) attrNames
100+ attrs = V.map (\attrName -> Attribute attrName (atomTypeForAtom (attrMap M.! attrName))) attrNames
93
101
94--return error if attribute names match but their types do not
102--return error if attribute names match but their types do not
95singleTupleSetJoin :: Attributes -> RelationTuple -> RelationTupleSet -> Either RelationalError [RelationTuple]
103singleTupleSetJoin :: Attributes -> RelationTuple -> RelationTupleSet -> Either RelationalError [RelationTuple]
@@ -120,8 +128,8 @@ singleTupleJoin joinedAttrs tup1@(RelationTuple tupAttrs1 _) tup2@(RelationTuple
120 return $ Just $ RelationTuple joinedAttrs newVec
128 return $ Just $ RelationTuple joinedAttrs newVec
121 where
129 where
122 keysIntersection = V.map attributeName attrsIntersection
130 keysIntersection = V.map attributeName attrsIntersection
123− attrsIntersection = V.filter (`V.elem` attributesVec tupAttrs1) (attributesVec tupAttrs2)
131+ attrsIntersection = V.filter (`V.elem` tupAttrs1) tupAttrs2
124− newVec = V.map (findAtomForAttributeName . attributeName) (attributesVec joinedAttrs)
132+ newVec = V.map (findAtomForAttributeName . attributeName) joinedAttrs
125 --search both tuples for the attribute
133 --search both tuples for the attribute
126 findAtomForAttributeName attrName = head $ rights $ fmap (atomForAttributeName attrName) [tup1, tup2]
134 findAtomForAttributeName attrName = head $ rights $ fmap (atomForAttributeName attrName) [tup1, tup2]
127
135
@@ -138,31 +146,23 @@ vectorUnion v1 v2 = V.foldr folder v1 v2
138tupleExtend :: RelationTuple -> RelationTuple -> RelationTuple
146tupleExtend :: RelationTuple -> RelationTuple -> RelationTuple
139tupleExtend (RelationTuple tupAttrs1 tupVec1) (RelationTuple tupAttrs2 tupVec2) = RelationTuple newAttrs newVec
147tupleExtend (RelationTuple tupAttrs1 tupVec1) (RelationTuple tupAttrs2 tupVec2) = RelationTuple newAttrs newVec
140 where
148 where
141− newAttrs = tupAttrs1 <> tupAttrs2
149+ newAttrs = tupAttrs1 V.++ tupAttrs2
142− newVec = tupVec1 <> tupVec2
150+ newVec = tupVec1 V.++ tupVec2
143
151
144tupleAtomExtend :: AttributeName -> Atom -> RelationTuple -> RelationTuple
152tupleAtomExtend :: AttributeName -> Atom -> RelationTuple -> RelationTuple
145tupleAtomExtend newAttrName atom tupIn = tupleExtend tupIn newTup
153tupleAtomExtend newAttrName atom tupIn = tupleExtend tupIn newTup
146 where
154 where
147− newTup = RelationTuple (A.singleton $ Attribute newAttrName (atomTypeForAtom atom)) (V.singleton atom)
155+ newTup = RelationTuple (V.singleton $ Attribute newAttrName (atomTypeForAtom atom)) (V.singleton atom)
148
156
149−{-tupleProject :: S.Set AttributeName -> RelationTuple -> RelationTuple
157+--this could be cheaper- it may not be wortwhile to update all the tuples for projection, but then the attribute management must be slightly different- perhaps the attributes should be a vector of association tuples [(name, index)]
158+tupleProject :: S.Set AttributeName -> RelationTuple -> RelationTuple
150tupleProject projectAttrs (RelationTuple attrs tupVec) = RelationTuple newAttrs newTupVec
159tupleProject projectAttrs (RelationTuple attrs tupVec) = RelationTuple newAttrs newTupVec
151 where
160 where
152− deleteIndices = V.findIndices (\attr -> S.notMember (attributeName attr) projectAttrs) (attributesVec attrs)
161+ deleteIndices = V.findIndices (\attr -> S.notMember (attributeName attr) projectAttrs) attrs
153 indexDeleter = V.ifilter (\index _ -> V.notElem index deleteIndices)
162 indexDeleter = V.ifilter (\index _ -> V.notElem index deleteIndices)
154− newAttrs = case A.projectionAttributesForNames projectAttrs attrs of
163+ newAttrs = indexDeleter attrs
155− Left err -> error (show (err, projectAttrs, attrs))
156− Right attrs' -> attrs'
157 newTupVec = indexDeleter tupVec
164 newTupVec = indexDeleter tupVec
158−-}
165+
159−-- remember that the attributes order matters
160−tupleProject :: Attributes -> RelationTuple -> Either RelationalError RelationTuple
161−tupleProject projectAttrs tup = do
162− newTupVec <- foldM (\acc attr ->
163− V.snoc acc <$> atomForAttributeName (attributeName attr) tup
164− ) V.empty (attributesVec projectAttrs)
165− pure $ reorderTuple projectAttrs (RelationTuple projectAttrs newTupVec)
166--return the attributes and atoms which are equal in both vectors
166--return the attributes and atoms which are equal in both vectors
167--semi-join
167--semi-join
168tupleIntersection :: RelationTuple -> RelationTuple -> RelationTuple
168tupleIntersection :: RelationTuple -> RelationTuple -> RelationTuple
@@ -170,14 +170,12 @@ tupleIntersection tuple1 tuple2 = RelationTuple newAttrs newTupVec
170 where
170 where
171 attrs1 = tupleAttributes tuple1
171 attrs1 = tupleAttributes tuple1
172 attrs2 = tupleAttributes tuple2
172 attrs2 = tupleAttributes tuple2
173− intersectAttrs = A.intersection attrs1 attrs2
173+ matchingIndices = V.findIndices (\attr -> V.elem attr attrs2 &&
174− matchingIndices = V.findIndices (\attr -> A.member attr intersectAttrs &&
174+ atomForAttributeName (attributeName attr) tuple1 ==
175− atomForAttributeName (attributeName attr) tuple1 ==
175+ atomForAttributeName (attributeName attr) tuple2
176− atomForAttributeName (attributeName attr) tuple2) (attributesVec attrs1)
176+ ) attrs1
177 indexFilter = V.ifilter (\index _ -> V.elem index matchingIndices)
177 indexFilter = V.ifilter (\index _ -> V.elem index matchingIndices)
178− newAttrs = case A.projectionAttributesForNames (A.attributeNameSet intersectAttrs) attrs1 of
178+ newAttrs = indexFilter attrs1
179− Left _ -> mempty
180− Right attrs' -> attrs'
181 newTupVec = indexFilter (tupleAtoms tuple1)
179 newTupVec = indexFilter (tupleAtoms tuple1)
182
180
183-- | An optimized form of tuple update which updates vectors efficiently.
181-- | An optimized form of tuple update which updates vectors efficiently.
@@ -185,20 +183,19 @@ updateTupleWithAtoms :: M.Map AttributeName Atom -> RelationTuple -> RelationTup
185updateTupleWithAtoms updateMap (RelationTuple attrs tupVec) = RelationTuple attrs newVec
183updateTupleWithAtoms updateMap (RelationTuple attrs tupVec) = RelationTuple attrs newVec
186 where
184 where
187 updateKeysSet = M.keysSet updateMap
185 updateKeysSet = M.keysSet updateMap
188− updateKeysIVec = V.filter (\(_,attr) -> S.member (attributeName attr) updateKeysSet) (V.indexed (attributesVec attrs))
186+ updateKeysIVec = V.filter (\(_,attr) -> S.member (attributeName attr) updateKeysSet) (V.indexed attrs)
189 newVec = V.update tupVec updateVec
187 newVec = V.update tupVec updateVec
190 updateVec = V.map (\(index, attr) -> (index, updateMap M.! attributeName attr)) updateKeysIVec
188 updateVec = V.map (\(index, attr) -> (index, updateMap M.! attributeName attr)) updateKeysIVec
191
189
192tupleToMap :: RelationTuple -> M.Map AttributeName Atom
190tupleToMap :: RelationTuple -> M.Map AttributeName Atom
193tupleToMap (RelationTuple attrs tupVec) = M.fromList assocList
191tupleToMap (RelationTuple attrs tupVec) = M.fromList assocList
194 where
192 where
195− assocList = V.toList $ V.map (\(index, attr) -> (attributeName attr, tupVec V.! index)) (V.indexed (attributesVec attrs))
193+ assocList = V.toList $ V.map (\(index, attr) -> (attributeName attr, tupVec V.! index)) (V.indexed attrs)
196
194
197−-- | Validate that the tuple has the correct attributes in the correct order
198verifyTuple :: Attributes -> RelationTuple -> Either RelationalError RelationTuple
195verifyTuple :: Attributes -> RelationTuple -> Either RelationalError RelationTuple
199−verifyTuple attrs tuple = let attrsTypes = A.atomTypes attrs
196+verifyTuple attrs tuple = let attrsTypes = V.map atomType attrs
200 tupleTypes = V.map atomTypeForAtom (tupleAtoms tuple) in
197 tupleTypes = V.map atomTypeForAtom (tupleAtoms tuple) in
201− if A.arity attrs /= V.length tupleTypes then
198+ if V.length attrs /= V.length tupleTypes then
202 Left $ TupleAttributeCountMismatchError 0
199 Left $ TupleAttributeCountMismatchError 0
203 else do
200 else do
204 mapM_ (uncurry atomTypeVerify) (V.zip attrsTypes tupleTypes)
201 mapM_ (uncurry atomTypeVerify) (V.zip attrsTypes tupleTypes)
@@ -207,18 +204,15 @@ verifyTuple attrs tuple = let attrsTypes = A.atomTypes attrs
207--two tuples can be equal but the vectors of attributes could be out-of-order
204--two tuples can be equal but the vectors of attributes could be out-of-order
208--reorder if necessary- this is useful during relMogrify so that all the relation's tuples have identical atom/attribute ordering
205--reorder if necessary- this is useful during relMogrify so that all the relation's tuples have identical atom/attribute ordering
209reorderTuple :: Attributes -> RelationTuple -> RelationTuple
206reorderTuple :: Attributes -> RelationTuple -> RelationTuple
210−reorderTuple attrs tupIn = if attributesAndOrderEqual (tupleAttributes tupIn) attrs then
207+reorderTuple attrs tupIn = if tupleAttributes tupIn == attrs then
211 tupIn
208 tupIn
212 else
209 else
213− RelationTuple attrs (V.map mapper (attributesVec attrs))
210+ RelationTuple attrs (V.map mapper attrs)
214 where
211 where
215 mapper attr = case atomForAttributeName (attributeName attr) tupIn of
212 mapper attr = case atomForAttributeName (attributeName attr) tupIn of
216− Left err -> error ("logic bug in reorderTuple: " ++ show err <> show tupIn)
213+ Left _ -> error "logic failure in reorderTuple"
217 Right atom -> atom
214 Right atom -> atom
218
215
219--used in Generics derivation for ADTs without named attributes
216--used in Generics derivation for ADTs without named attributes
220trimTuple :: Int -> RelationTuple -> RelationTuple
217trimTuple :: Int -> RelationTuple -> RelationTuple
221−trimTuple index (RelationTuple attrs vals) =
218+trimTuple index (RelationTuple attrs vals) = RelationTuple (V.drop index attrs) (V.drop index vals)
222− RelationTuple newAttrs (V.drop index vals)
223− where
224− newAttrs = A.drop index attrs
src/lib/ProjectM36/TupleSet.hs−7
@@ -31,10 +31,3 @@ mkTupleSet attrs tuples = verifyTupleSet attrs (RelationTupleSet tuples)
31
31
32mkTupleSetFromList :: Attributes -> [[Atom]] -> Either RelationalError RelationTupleSet
32mkTupleSetFromList :: Attributes -> [[Atom]] -> Either RelationalError RelationTupleSet
33mkTupleSetFromList attrs atomMatrix = mkTupleSet attrs $ map (mkRelationTuple attrs . V.fromList) atomMatrix
33mkTupleSetFromList attrs atomMatrix = mkTupleSet attrs $ map (mkRelationTuple attrs . V.fromList) atomMatrix
34−
35−
36−-- | Union two tuplesets while reordering their attribute/atom mapping properly.
37−tupleSetUnion :: Attributes -> RelationTupleSet -> RelationTupleSet -> RelationTupleSet
38−tupleSetUnion targetAttrs tupSet1 tupSet2 = RelationTupleSet $ HS.toList . HS.fromList $ reorder (asList tupSet1) ++ reorder (asList tupSet2)
39− where
40− reorder = map (reorderTuple targetAttrs)
src/lib/ProjectM36/Tupleable.hs+66−214
@@ -1,50 +1,18 @@
1−{-# LANGUAGE DefaultSignatures #-}
1+{-# LANGUAGE FlexibleInstances, FlexibleContexts, TypeOperators, UndecidableInstances, ScopedTypeVariables, DefaultSignatures #-}
2−{-# LANGUAGE FlexibleContexts #-}
2+module ProjectM36.Tupleable where
3−{-# LANGUAGE FlexibleInstances #-}
3+import ProjectM36.Base
4−{-# LANGUAGE ScopedTypeVariables #-}
4+import ProjectM36.Error
5−{-# LANGUAGE TypeOperators #-}
5+import ProjectM36.TupleSet
6−{-# LANGUAGE UndecidableInstances #-}
6+import ProjectM36.Tuple
7−{-# LANGUAGE CPP #-}
7+import ProjectM36.Atomable
8−
8+import ProjectM36.DataTypes.Primitive
9−module ProjectM36.Tupleable
9+import ProjectM36.Attribute hiding (null)
10− ( toInsertExpr
10+import GHC.Generics
11− , toDefineExpr
11+import qualified Data.Vector as V
12− , tupleAssocsEqualityPredicate
12+import qualified Data.Text as T
13− , partitionByAttributes
13+import Data.Monoid
14− , toUpdateExpr
14+import Data.Proxy
15− , toDeleteExpr
15+import Data.Foldable
16− , validateAttributes
17− , Tupleable(..)
18−
19− -- * Generics
20− , genericToTuple
21− , genericFromTuple
22− , genericToAttributes
23− , TupleableG(..)
24− -- ** Options
25− , defaultTupleableOptions
26− , TupleableOptions()
27− , fieldModifier
28− ) where
29−
30−import Data.Foldable
31−import Data.List (partition)
32−import qualified Data.Map as Map
33−#if __GLASGOW_HASKELL__ < 804
34−import Data.Monoid
35−#endif
36−import Data.Proxy
37−import qualified Data.Text as T
38−import qualified Data.Vector as V
39−import GHC.Generics
40−import ProjectM36.Atomable
41−import ProjectM36.Attribute as A hiding (null, toList)
42−import ProjectM36.Base
43−import ProjectM36.DataTypes.Primitive
44−import ProjectM36.Error
45−import ProjectM36.Tuple
46−import ProjectM36.TupleSet
47−import qualified Data.Set as S
48
16
49{-import Data.Binary
17{-import Data.Binary
50import Control.DeepSeq
18import Control.DeepSeq
@@ -53,27 +21,27 @@ data Test1T = Test1C {
53 attrA :: Int
21 attrA :: Int
54 }
22 }
55 deriving (Generic, Show)
23 deriving (Generic, Show)
56−
24+
57data Test2T a b = Test2C {
25data Test2T a b = Test2C {
58 attrB :: a,
26 attrB :: a,
59 attrC :: b
27 attrC :: b
60 }
28 }
61 deriving (Generic, Show)
29 deriving (Generic, Show)
62−
30+
63instance (Atomable a, Atomable b, Show a, Show b) => Tupleable (Test2T a b)
31instance (Atomable a, Atomable b, Show a, Show b) => Tupleable (Test2T a b)
64
32
65instance Tupleable Test1T
33instance Tupleable Test1T
66
34
67data TestUnnamed1 = TestUnnamed1 Int Double T.Text
35data TestUnnamed1 = TestUnnamed1 Int Double T.Text
68 deriving (Show,Eq, Generic)
36 deriving (Show,Eq, Generic)
69−
37+
70−instance Tupleable TestUnnamed1
38+instance Tupleable TestUnnamed1
71
39
72data Test7A = Test7AC Integer
40data Test7A = Test7AC Integer
73 deriving (Generic, Show, Eq, Atomable, NFData, Binary)
41 deriving (Generic, Show, Eq, Atomable, NFData, Binary)
74−
42+
75−
43+
76−data Test7T = Test7C Test7A
44+data Test7T = Test7C Test7A
77 deriving (Generic, Show, Eq)
45 deriving (Generic, Show, Eq)
78
46
79instance Tupleable Test7T
47instance Tupleable Test7T
@@ -84,204 +52,88 @@ toInsertExpr :: forall a t. (Tupleable a, Traversable t) => t a -> RelVarName ->
84toInsertExpr vals rvName = do
52toInsertExpr vals rvName = do
85 let attrs = toAttributes (Proxy :: Proxy a)
53 let attrs = toAttributes (Proxy :: Proxy a)
86 tuples <- mkTupleSet attrs $ toList (fmap toTuple vals)
54 tuples <- mkTupleSet attrs $ toList (fmap toTuple vals)
87− let rel = MakeStaticRelation attrs tuples
55+ let rel = MakeStaticRelation attrs tuples
88 pure (Insert rvName rel)
56 pure (Insert rvName rel)
89−
57+
90-- | Convert a 'Tupleable' to a create a 'Define' expression which can be used to create an empty relation variable. Use 'toInsertExpr' to insert the actual tuple data. This function is typically used with 'Data.Proxy'.
58-- | Convert a 'Tupleable' to a create a 'Define' expression which can be used to create an empty relation variable. Use 'toInsertExpr' to insert the actual tuple data. This function is typically used with 'Data.Proxy'.
91toDefineExpr :: forall a proxy. Tupleable a => proxy a -> RelVarName -> DatabaseContextExpr
59toDefineExpr :: forall a proxy. Tupleable a => proxy a -> RelVarName -> DatabaseContextExpr
92−toDefineExpr _ rvName = Define rvName (map NakedAttributeExpr (V.toList (attributesVec attrs)))
60+toDefineExpr _ rvName = Define rvName (map NakedAttributeExpr (V.toList attrs))
93− where
61+ where
94 attrs = toAttributes (Proxy :: Proxy a)
62 attrs = toAttributes (Proxy :: Proxy a)
95
63
96−tupleAssocsEqualityPredicate :: [(AttributeName, Atom)] -> RestrictionPredicateExpr
97−tupleAssocsEqualityPredicate [] = TruePredicate
98−tupleAssocsEqualityPredicate pairs =
99− foldr1 AndPredicate $
100− map
101− (\(name, atom) -> AttributeEqualityPredicate name (NakedAtomExpr atom))
102− pairs
103−
104−partitionByAttributes ::
105− Tupleable a
106− => [AttributeName]
107− -> a
108− -> ([(AttributeName, Atom)], [(AttributeName, Atom)])
109−partitionByAttributes attrs =
110− partition ((`elem` attrs) . fst) . tupleAssocs . toTuple
111−
112−-- | Convert a list of key attributes and a 'Tupleable' value to an 'Update'
113−-- expression. This expression flushes the non-key attributes of the value to
114−-- a tuple with the matching key attributes.
115−toUpdateExpr ::
116− forall a. Tupleable a => RelVarName -> [AttributeName] -> a -> Either RelationalError DatabaseContextExpr
117−toUpdateExpr rvName keyAttrs a = validateAttributes (S.fromList keyAttrs) expectedAttrSet (Update rvName updateMap keyRestriction)
118− where
119− (keyPairs, updatePairs) = partitionByAttributes keyAttrs a
120− updateMap = Map.fromList $ fmap NakedAtomExpr <$> updatePairs
121− keyRestriction = tupleAssocsEqualityPredicate keyPairs
122− expectedAttrSet = attributeNameSet (toAttributes (Proxy :: Proxy a))
123−
124−-- | Convert a list of key attributes and a 'Tupleable' value to a 'Delete'
125−-- expression. This expression deletes tuples matching the key attributes from
126−-- the value.
127−toDeleteExpr ::
128− forall a. Tupleable a => RelVarName -> [AttributeName] -> a -> Either RelationalError DatabaseContextExpr
129−toDeleteExpr rvName keyAttrs val = validateAttributes (S.fromList keyAttrs) expectedAttrSet (Delete rvName keyRestriction)
130− where
131− keyPairs = fst $ partitionByAttributes keyAttrs val
132− keyRestriction = tupleAssocsEqualityPredicate keyPairs
133− expectedAttrSet = attributeNameSet (toAttributes (Proxy :: Proxy a))
134−
135−validateAttributes :: S.Set AttributeName -> S.Set AttributeName -> a -> Either RelationalError a
136−validateAttributes actualAttrs expectedAttrs val
137− | S.null actualAttrs = Left EmptyAttributesError
138− | not (S.null nonMatchingAttrs) = Left (NoSuchAttributeNamesError nonMatchingAttrs)
139− | otherwise = Right val
140− where
141− nonMatchingAttrs = attributeNamesNotContained actualAttrs expectedAttrs
142−
143−-- | Types that can be converted to and from 'RelationTuple'.
144−--
145−-- deriving without customization:
146−--
147−-- > data Example = Example
148−-- > { foo :: Integer
149−-- > , bar :: Text
150−-- > }
151−-- > deriving (Generic)
152−-- >
153−-- > instance Tupleable Example
154−--
155−-- deriving with customization using "ProjectM36.Tupleable.Deriving":
156−--
157−-- > data Example = Example
158−-- > { exampleFoo :: Integer
159−-- > , exampleBar :: Text
160−-- > }
161−-- > deriving stock (Generic)
162−-- > deriving (Tupleable)
163−-- > via Codec (Field (DropPrefix "example" >>> CamelCase)) Example
164class Tupleable a where
64class Tupleable a where
165 toTuple :: a -> RelationTuple
65 toTuple :: a -> RelationTuple
166−
66+
167 fromTuple :: RelationTuple -> Either RelationalError a
67 fromTuple :: RelationTuple -> Either RelationalError a
168−
68+
169− toAttributes :: Proxy a -> Attributes
69+ toAttributes :: proxy a -> Attributes
170
70
171 default toTuple :: (Generic a, TupleableG (Rep a)) => a -> RelationTuple
71 default toTuple :: (Generic a, TupleableG (Rep a)) => a -> RelationTuple
172− toTuple = genericToTuple defaultTupleableOptions
72+ toTuple v = toTupleG (from v)
173−
73+
174 default fromTuple :: (Generic a, TupleableG (Rep a)) => RelationTuple -> Either RelationalError a
74 default fromTuple :: (Generic a, TupleableG (Rep a)) => RelationTuple -> Either RelationalError a
175− fromTuple = genericFromTuple defaultTupleableOptions
75+ fromTuple tup = to <$> fromTupleG tup
176−
76+
177− default toAttributes :: (Generic a, TupleableG (Rep a)) => Proxy a -> Attributes
77+ default toAttributes :: (Generic a, TupleableG (Rep a)) => proxy a -> Attributes
178− toAttributes = genericToAttributes defaultTupleableOptions
78+ toAttributes _ = toAttributesG (from (undefined :: a))
179−
79+
180−-- | Options that influence deriving behavior.
80+class TupleableG g where
181−newtype TupleableOptions = TupleableOptions {
81+ toTupleG :: g a -> RelationTuple
182− -- | A function that translates record field names into attribute names.
82+ toAttributesG :: g a -> Attributes
183− fieldModifier :: T.Text -> T.Text
83+ fromTupleG :: RelationTuple -> Either RelationalError (g a)
184− }
84+
185−
186−-- | The default options for deriving Tupleable instances.
187−--
188−-- These options can be customized by using record update syntax. For example,
189−--
190−-- > defaultTupleableOptions
191−-- > { fieldModifier = \fieldName ->
192−-- > case Data.Text.stripPrefix "example" fieldName of
193−-- > Nothing -> fieldName
194−-- > Just attributeName -> attributeName
195−-- > }
196−--
197−-- will result in record field names being translated into attribute names by
198−-- removing the prefix "example" from the field names.
199−defaultTupleableOptions :: TupleableOptions
200−defaultTupleableOptions = TupleableOptions {
201− fieldModifier = id
202− }
203−
204−genericToTuple :: (Generic a, TupleableG (Rep a)) => TupleableOptions -> a -> RelationTuple
205−genericToTuple opts v = toTupleG opts (from v)
206−
207−genericFromTuple :: (Generic a, TupleableG (Rep a)) => TupleableOptions -> RelationTuple -> Either RelationalError a
208−genericFromTuple opts tup = to <$> fromTupleG opts tup
209−
210−genericToAttributes :: forall a. (Generic a, TupleableG (Rep a)) => TupleableOptions -> Proxy a -> Attributes
211−genericToAttributes opts _ = toAttributesG opts (from (undefined :: a))
212−
213−class TupleableG g where
214− toTupleG :: TupleableOptions -> g a -> RelationTuple
215− toAttributesG :: TupleableOptions -> g a -> Attributes
216− fromTupleG :: TupleableOptions -> RelationTuple -> Either RelationalError (g a)
217− isRecordTypeG :: g a -> Bool
218−
219--data type metadata
85--data type metadata
220instance (Datatype c, TupleableG a) => TupleableG (M1 D c a) where
86instance (Datatype c, TupleableG a) => TupleableG (M1 D c a) where
221− toTupleG opts (M1 v) = toTupleG opts v
87+ toTupleG (M1 v) = toTupleG v
222− toAttributesG opts (M1 v) = toAttributesG opts v
88+ toAttributesG (M1 v) = toAttributesG v
223− fromTupleG opts v = M1 <$> fromTupleG opts v
89+ fromTupleG v = M1 <$> fromTupleG v
224− isRecordTypeG (M1 v) = isRecordTypeG v
225
90
226--constructor metadata
91--constructor metadata
227instance (Constructor c, TupleableG a, AtomableG a) => TupleableG (M1 C c a) where
92instance (Constructor c, TupleableG a, AtomableG a) => TupleableG (M1 C c a) where
228− toTupleG opts (M1 v) = RelationTuple attrs atoms
93+ toTupleG (M1 v) = RelationTuple attrs atoms
229 where
94 where
230− attrsToCheck = toAttributesG opts v
95+ attrsToCheck = toAttributesG v
231− counter = V.generate (arity attrsToCheck) id
96+ counter = V.generate (V.length attrsToCheck) id
232− attrs = attributesFromList (V.toList attrsV)
97+ attrs = V.zipWith (\num attr@(Attribute name typ) -> if T.null name then
233− attrsV = V.zipWith (\num attr@(Attribute name typ) -> if T.null name then
98+ Attribute ("attr" <> T.pack (show (num + 1))) typ
234− Attribute ("attr" <> T.pack (show (num + 1))) typ
235 else
99 else
236− attr) counter (attributesVec attrsToCheck)
100+ attr) counter attrsToCheck
237 atoms = V.fromList (toAtomsG v)
101 atoms = V.fromList (toAtomsG v)
238− toAttributesG opts (M1 v) = toAttributesG opts v
102+ toAttributesG (M1 v) = toAttributesG v
239− fromTupleG opts tup = M1 <$> fromTupleG opts tup
103+ fromTupleG tup = M1 <$> fromTupleG tup
240− isRecordTypeG (M1 v) = isRecordTypeG v
104+
241−
242-- product types
105-- product types
243instance (TupleableG a, TupleableG b) => TupleableG (a :*: b) where
106instance (TupleableG a, TupleableG b) => TupleableG (a :*: b) where
244 toTupleG = error "toTupleG"
107 toTupleG = error "toTupleG"
245− toAttributesG opts ~(x :*: y) = toAttributesG opts x <> toAttributesG opts y --a bit of extra laziness prevents whnf so that we can use toAttributes (undefined :: Test2T Int Int) without throwing an exception
108+ toAttributesG ~(x :*: y) = toAttributesG x V.++ toAttributesG y --a bit of extra laziness prevents whnf so that we can use toAttributes (undefined :: Test2T Int Int) without throwing an exception
246− fromTupleG opts tup = (:*:) <$> fromTupleG opts tup <*> fromTupleG opts processedTuple
109+ fromTupleG tup = (:*:) <$> fromTupleG tup <*> fromTupleG (trimTuple 1 tup)
247− where
248− processedTuple = if isRecordTypeG (undefined :: a x) then
249− tup
250− else
251− trimTuple 1 tup
252− isRecordTypeG ~(x :*: y) = isRecordTypeG x || isRecordTypeG y
253
110
254--selector/record
111--selector/record
255instance (Selector c, AtomableG a) => TupleableG (M1 S c a) where
112instance (Selector c, AtomableG a) => TupleableG (M1 S c a) where
256 toTupleG = error "toTupleG"
113 toTupleG = error "toTupleG"
257− toAttributesG opts m@(M1 v) = A.singleton (Attribute modifiedName aType)
114+ toAttributesG m@(M1 v) = V.singleton (Attribute name aType)
258 where
115 where
259 name = T.pack (selName m)
116 name = T.pack (selName m)
260− modifiedName = if T.null name then
261− name
262− else
263− fieldModifier opts name
264 aType = toAtomTypeG v
117 aType = toAtomTypeG v
265− fromTupleG opts tup = if null name then -- non-record type, just pull off the first tuple item
118+ fromTupleG tup = if null name then -- non-record type, just pull off the first tuple item
266 M1 <$> atomv (V.head (tupleAtoms tup))
119 M1 <$> atomv (V.head (tupleAtoms tup))
267 else do
120 else do
268− atom <- atomForAttributeName (fieldModifier opts (T.pack name)) tup
121+ atom <- atomForAttributeName (T.pack name) tup
269 val <- atomv atom
122 val <- atomv atom
270 pure (M1 val)
123 pure (M1 val)
271 where
124 where
272− expectedAtomType = atomType (V.head (attributesVec (toAttributesG opts (undefined :: M1 S c a x))))
125+ expectedAtomType = atomType (V.head (toAttributesG (undefined :: M1 S c a x)))
273− atomv atom = maybe (Left (AtomTypeMismatchError
126+ atomv atom = maybe (Left (AtomTypeMismatchError
274 expectedAtomType
127 expectedAtomType
275 (atomTypeForAtom atom)
128 (atomTypeForAtom atom)
276 )) Right (fromAtomG atom [atom])
129 )) Right (fromAtomG atom [atom])
277 name = selName (undefined :: M1 S c a x)
130 name = selName (undefined :: M1 S c a x)
278− isRecordTypeG _ = not (null (selName (undefined :: M1 S c a x)))
279
131
280−--constructors with no arguments
132+--constructors with no arguments
281--basically useless but orthoganal to relationTrue
133--basically useless but orthoganal to relationTrue
282instance TupleableG U1 where
134instance TupleableG U1 where
283− toTupleG _ _ = emptyTuple
135+ toTupleG _= emptyTuple
284− toAttributesG _ _ = emptyAttributes
136+ toAttributesG _ = emptyAttributes
285− fromTupleG _ _ = pure U1
137+ fromTupleG _ = pure U1
286− isRecordTypeG _ = False
138+
287−
139+
src/lib/ProjectM36/Tupleable/Deriving.hsdeleted−229
@@ -1,229 +0,0 @@
1−{-# LANGUAGE ScopedTypeVariables #-}
2−{-# LANGUAGE TypeOperators #-}
3−{-# LANGUAGE KindSignatures #-}
4−{-# LANGUAGE DataKinds #-}
5−{-# LANGUAGE FlexibleContexts #-}
6−{-# LANGUAGE UndecidableInstances #-}
7−
8−-- | Newtypes for deriving Tupleable instances with customization using
9−-- @DerivingVia@.
10−--
11−-- Inspired by
12−-- [Dhall.Deriving](https://hackage.haskell.org/package/dhall-1.33.1/docs/Dhall-Deriving.html)
13−-- which in turn was inspired by Matt Parson's blog post
14−-- [Mirror Mirror: Reflection and Encoding Via](https://www.parsonsmatt.org/2020/02/04/mirror_mirror.html).
15−--
16−-- required extensions:
17−--
18−-- * DerivingVia
19−-- * DeriveGenerics
20−-- * TypeOperators (for @('<<<')@ and @('>>>')@)
21−-- * DataKinds (for types that take a string argument)
22−
23−module ProjectM36.Tupleable.Deriving
24− ( -- * DerivingVia Newtype
25− Codec(..)
26−
27− -- * Type-level Options
28− , ModifyOptions(..)
29− , Field
30−
31− -- * Type-level 'T.Text' -> 'T.Text' Functions
32− , ModifyText(..)
33− , AddPrefix
34− , DropPrefix
35− , AddSuffix
36− , DropSuffix
37− , UpperCase
38− , LowerCase
39− , TitleCase
40− , CamelCase
41− , PascalCase
42− , SnakeCase
43− , SpinalCase
44− , TrainCase
45−
46− -- * Composition
47− , AsIs
48− , type (<<<)
49− , type (>>>)
50−
51− -- * Re-Exports
52− , Generic
53− , module ProjectM36.Tupleable
54− ) where
55−import Data.Maybe (fromMaybe)
56−import Data.Proxy
57−import qualified Data.Text as T
58−import Data.Text.Manipulate
59−import GHC.TypeLits
60−import GHC.Generics (Generic, Rep)
61−import ProjectM36.Tupleable
62−
63−
64−-- | A newtype wrapper to allow for easier deriving of 'Tupleable' instances
65−-- with customization.
66−--
67−-- The @tag@ type variable can be used to specify options for converting the
68−-- datatype to and from a 'RelationTuple'. For example,
69−--
70−-- > data Example = Example
71−-- > { exampleFoo :: Int
72−-- > , exampleBar :: Int
73−-- > }
74−-- > deriving stock (Generic)
75−-- > deriving (Tupleable)
76−-- > via Codec (Field (DropPrefix "example" >>> CamelCase)) Example
77−--
78−-- will derive an instance of 'Tupleable' where field names are translated into
79−-- attribute names by dropping the prefix @"example"@ and then converting the
80−-- result to camelCase. So @"exampleFoo"@ becomes @"foo"@ and @"exampleBar"@
81−-- becomes @"bar"@.
82−--
83−-- Requires the @DerivingGeneric@ and @DerivingVia@ extensions to be enabled.
84−newtype Codec tag a = Codec { unCodec :: a }
85−
86−instance (ModifyOptions tag, Generic a, TupleableG (Rep a)) => Tupleable (Codec tag a) where
87− toTuple v = genericToTuple opts (unCodec v)
88− where
89− opts = modifyOptions (Proxy :: Proxy tag) defaultTupleableOptions
90−
91− fromTuple tup = Codec <$> genericFromTuple opts tup
92− where
93− opts = modifyOptions (Proxy :: Proxy tag) defaultTupleableOptions
94−
95− toAttributes _ = genericToAttributes opts (Proxy :: Proxy a)
96− where
97− opts = modifyOptions (Proxy :: Proxy tag) defaultTupleableOptions
98−
99−-- | Types that can be used as tags for 'Codec'.
100−class ModifyOptions a where
101− modifyOptions :: proxy a -> TupleableOptions -> TupleableOptions
102−
103−-- | Change how record field names are translated into attribute names. For
104−-- example,
105−--
106−-- > Field SnakeCase
107−--
108−-- will translate the field name @fooBar@ into the attribute name @foo_bar@.
109−data Field a
110−
111−instance ModifyText a => ModifyOptions (Field a) where
112− modifyOptions _ opts = opts { fieldModifier = newFieldModifier }
113− where
114− newFieldModifier = modifyText (Proxy :: Proxy a) . fieldModifier opts
115−
116−-- | Types that can be used in options that modify 'T.Text' such as in 'Field'.
117−class ModifyText a where
118− modifyText :: proxy a -> T.Text -> T.Text
119−
120−-- | Add a prefix. @AddPrefix "foo"@ will transform @"bar"@ into @"foobar"@.
121−data AddPrefix (prefix :: Symbol)
122−
123−instance KnownSymbol prefix => ModifyText (AddPrefix prefix) where
124− modifyText _ oldText = prefixText <> oldText
125− where
126− prefixText = T.pack (symbolVal (Proxy :: Proxy prefix))
127−
128−-- | Drop a prefix. @DropPrefix "bar"@ will transform @"foobar"@ into @"foo"@.
129−data DropPrefix (prefix :: Symbol)
130−
131−instance KnownSymbol prefix => ModifyText (DropPrefix prefix) where
132− modifyText _ oldText = fromMaybe oldText (T.stripPrefix prefixText oldText)
133− where
134− prefixText = T.pack (symbolVal (Proxy :: Proxy prefix))
135−
136−-- | Add a suffix. @AddSuffix "bar"@ will transform @"foo"@ into @"foobar"@.
137−data AddSuffix (suffix :: Symbol)
138−
139−instance KnownSymbol suffix => ModifyText (AddSuffix suffix) where
140− modifyText _ oldText = oldText <> suffixText
141− where
142− suffixText = T.pack (symbolVal (Proxy :: Proxy suffix))
143−
144−-- | Drop a suffix. @DropSuffix "bar"@ will transform @"foobar"@ into @"foo"@.
145−data DropSuffix (suffix :: Symbol)
146−
147−instance KnownSymbol suffix => ModifyText (DropSuffix suffix) where
148− modifyText _ oldText = fromMaybe oldText (T.stripSuffix suffixText oldText)
149− where
150− suffixText = T.pack (symbolVal (Proxy :: Proxy suffix))
151−
152−-- | Convert to UPPERCASE. Will transform @"foobar"@ into @\"FOOBAR\"@.
153−data UpperCase
154−
155−instance ModifyText UpperCase where
156− modifyText _ = T.toUpper
157−
158−-- | Convert to lowercase. Will transform @\"FOOBAR\"@ into @"foobar"@.
159−data LowerCase
160−
161−instance ModifyText LowerCase where
162− modifyText _ = T.toLower
163−
164−-- | Convert to Title Case. Will transform @"fooBar"@ into @\"Foo Bar\"@.
165−data TitleCase
166−
167−instance ModifyText TitleCase where
168− modifyText _ = toTitle
169−
170−-- | Convert to camelCase. Will transform @"foo_bar"@ into @"fooBar"@.
171−data CamelCase
172−
173−instance ModifyText CamelCase where
174− modifyText _ = toCamel
175−
176−-- | Convert to PascalCase. Will transform @"foo_bar"@ into @\"FooBar\"@.
177−data PascalCase
178−
179−instance ModifyText PascalCase where
180− modifyText _ = toPascal
181−
182−-- | Convert to snake_case. Will transform @"fooBar"@ into @"foo_bar"@.
183−data SnakeCase
184−
185−instance ModifyText SnakeCase where
186− modifyText _ = toSnake
187−
188−-- | Convert to spinal-case. will transform @"fooBar"@ into @"foo-bar"@.
189−data SpinalCase
190−
191−instance ModifyText SpinalCase where
192− modifyText _ = toSpinal
193−
194−-- | Convert to Train-Case. Will transform @"fooBar"@ into @\"Foo-Bar\"@.
195−data TrainCase
196−
197−instance ModifyText TrainCase where
198− modifyText _ = toTrain
199−
200−-- | Identity option.
201−type AsIs = ()
202−
203−instance ModifyOptions () where
204− modifyOptions _ = id
205−
206−instance ModifyText () where
207− modifyText _ = id
208−
209−-- | Right to left composition.
210−--
211−-- Requires the @TypeOperators@ extension to be enabled.
212−data a <<< b
213−
214−instance (ModifyOptions a, ModifyOptions b) => ModifyOptions (a <<< b) where
215− modifyOptions _ = modifyOptions (Proxy :: Proxy a) . modifyOptions (Proxy :: Proxy b)
216−
217−instance (ModifyText a, ModifyText b) => ModifyText (a <<< b) where
218− modifyText _ = modifyText (Proxy :: Proxy a) . modifyText (Proxy :: Proxy b)
219−
220−-- | Left to right composition.
221−--
222−-- Requires the @TypeOperators@ extension to be enabled.
223−data a >>> b
224−
225−instance (ModifyOptions a, ModifyOptions b) => ModifyOptions (a >>> b) where
226− modifyOptions _ = modifyOptions (Proxy :: Proxy b) . modifyOptions (Proxy :: Proxy a)
227−
228−instance (ModifyText a, ModifyText b) => ModifyText (a >>> b) where
229− modifyText _ = modifyText (Proxy :: Proxy b) . modifyText (Proxy :: Proxy a)
src/lib/ProjectM36/TypeConstructor.hs+6−4
@@ -1,17 +1,19 @@
1module ProjectM36.TypeConstructor where
1module ProjectM36.TypeConstructor where
2import ProjectM36.Base
2import ProjectM36.Base
3+import qualified Data.Set as S
3
4
4name :: TypeConstructor -> TypeConstructorName
5name :: TypeConstructor -> TypeConstructorName
5name (ADTypeConstructor name' _) = name'
6name (ADTypeConstructor name' _) = name'
6name (PrimitiveTypeConstructor name' _) = name'
7name (PrimitiveTypeConstructor name' _) = name'
7−name (RelationAtomTypeConstructor _) = error "name called on RelationAtomTypeConstructor"
8+name (TypeVariable _) = error "spam" --v --not really the name, but this is used for display only
8−name (TypeVariable _) = error "name called on TypeVariable" --v --not really the name, but this is used for display only
9
9
10arguments :: TypeConstructor -> [TypeConstructor]
10arguments :: TypeConstructor -> [TypeConstructor]
11arguments (ADTypeConstructor _ args) = args
11arguments (ADTypeConstructor _ args) = args
12arguments (PrimitiveTypeConstructor _ _) = []
12arguments (PrimitiveTypeConstructor _ _) = []
13−arguments (RelationAtomTypeConstructor _) = []
14arguments (TypeVariable _) = []
13arguments (TypeVariable _) = []
15
14
16−
15+typeVars :: TypeConstructor -> S.Set TypeVarName
16+typeVars (PrimitiveTypeConstructor _ _) = S.empty
17+typeVars (ADTypeConstructor _ args) = S.unions (map typeVars args)
18+typeVars (TypeVariable v) = S.singleton v
17
19
src/lib/ProjectM36/WCWidth.hsdeleted−425
@@ -1,425 +0,0 @@
1−module ProjectM36.WCWidth where
2−import Data.Set.Range
3−import Data.Char
4−
5−wIDEEASTASIAN :: RangeSet Int
6−wIDEEASTASIAN = foldr insertRange empty [
7− (0x1100, 0x115f), -- Hangul Choseong Kiyeok ..Hangul Choseong Filler
8− (0x231a, 0x231b), -- Watch ..Hourglass
9− (0x2329, 0x232a), -- Left-pointing Angle Brac..Right-pointing Angle Bra
10− (0x23e9, 0x23ec), -- Black Right-pointing Dou..Black Down-pointing Doub
11− (0x23f0, 0x23f0), -- Alarm Clock ..Alarm Clock
12− (0x23f3, 0x23f3), -- Hourglass With Flowing S..Hourglass With Flowing S
13− (0x25fd, 0x25fe), -- White Medium Small Squar..Black Medium Small Squar
14− (0x2614, 0x2615), -- Umbrella With Rain Drops..Hot Beverage
15− (0x2648, 0x2653), -- Aries ..Pisces
16− (0x267f, 0x267f), -- Wheelchair Symbol ..Wheelchair Symbol
17− (0x2693, 0x2693), -- Anchor ..Anchor
18− (0x26a1, 0x26a1), -- High Voltage Sign ..High Voltage Sign
19− (0x26aa, 0x26ab), -- Medium White Circle ..Medium Black Circle
20− (0x26bd, 0x26be), -- Soccer Ball ..Baseball
21− (0x26c4, 0x26c5), -- Snowman Without Snow ..Sun Behind Cloud
22− (0x26ce, 0x26ce), -- Ophiuchus ..Ophiuchus
23− (0x26d4, 0x26d4), -- No Entry ..No Entry
24− (0x26ea, 0x26ea), -- Church ..Church
25− (0x26f2, 0x26f3), -- Fountain ..Flag In Hole
26− (0x26f5, 0x26f5), -- Sailboat ..Sailboat
27− (0x26fa, 0x26fa), -- Tent ..Tent
28− (0x26fd, 0x26fd), -- Fuel Pump ..Fuel Pump
29− (0x2705, 0x2705), -- White Heavy Check Mark ..White Heavy Check Mark
30− (0x270a, 0x270b), -- Raised Fist ..Raised Hand
31− (0x2728, 0x2728), -- Sparkles ..Sparkles
32− (0x274c, 0x274c), -- Cross Mark ..Cross Mark
33− (0x274e, 0x274e), -- Negative Squared Cross M..Negative Squared Cross M
34− (0x2753, 0x2755), -- Black Question Mark Orna..White Exclamation Mark O
35− (0x2757, 0x2757), -- Heavy Exclamation Mark S..Heavy Exclamation Mark S
36− (0x2795, 0x2797), -- Heavy Plus Sign ..Heavy Division Sign
37− (0x27b0, 0x27b0), -- Curly Loop ..Curly Loop
38− (0x27bf, 0x27bf), -- Double Curly Loop ..Double Curly Loop
39− (0x2b1b, 0x2b1c), -- Black Large Square ..White Large Square
40− (0x2b50, 0x2b50), -- White Medium Star ..White Medium Star
41− (0x2b55, 0x2b55), -- Heavy Large Circle ..Heavy Large Circle
42− (0x2e80, 0x2e99), -- Cjk Radical Repeat ..Cjk Radical Rap
43− (0x2e9b, 0x2ef3), -- Cjk Radical Choke ..Cjk Radical C-simplified
44− (0x2f00, 0x2fd5), -- Kangxi Radical One ..Kangxi Radical Flute
45− (0x2ff0, 0x2ffb), -- Ideographic Description ..Ideographic Description
46− (0x3000, 0x303e), -- Ideographic Space ..Ideographic Variation In
47− (0x3041, 0x3096), -- Hiragana Letter Small A ..Hiragana Letter Small Ke
48− (0x3099, 0x30ff), -- Combining Katakana-hirag..Katakana Digraph Koto
49− (0x3105, 0x312d), -- Bopomofo Letter B ..Bopomofo Letter Ih
50− (0x3131, 0x318e), -- Hangul Letter Kiyeok ..Hangul Letter Araeae
51− (0x3190, 0x31ba), -- Ideographic Annotation L..Bopomofo Letter Zy
52− (0x31c0, 0x31e3), -- Cjk Stroke T ..Cjk Stroke Q
53− (0x31f0, 0x321e), -- Katakana Letter Small Ku..Parenthesized Korean Cha
54− (0x3220, 0x3247), -- Parenthesized Ideograph ..Circled Ideograph Koto
55− (0x3250, 0x32fe), -- Partnership Sign ..Circled Katakana Wo
56− (0x3300, 0x4dbf), -- Square Apaato ..
57− (0x4e00, 0xa48c), -- Cjk Unified Ideograph-4e..Yi Syllable Yyr
58− (0xa490, 0xa4c6), -- Yi Radical Qot ..Yi Radical Ke
59− (0xa960, 0xa97c), -- Hangul Choseong Tikeut-m..Hangul Choseong Ssangyeo
60− (0xac00, 0xd7a3), -- Hangul Syllable Ga ..Hangul Syllable Hih
61− (0xf900, 0xfaff), -- Cjk Compatibility Ideogr..
62− (0xfe10, 0xfe19), -- Presentation Form For Ve..Presentation Form For Ve
63− (0xfe30, 0xfe52), -- Presentation Form For Ve..Small Full Stop
64− (0xfe54, 0xfe66), -- Small Semicolon ..Small Equals Sign
65− (0xfe68, 0xfe6b), -- Small Reverse Solidus ..Small Commercial At
66− (0xff01, 0xff60), -- Fullwidth Exclamation Ma..Fullwidth Right White Pa
67− (0xffe0, 0xffe6), -- Fullwidth Cent Sign ..Fullwidth Won Sign
68− (0x16fe0, 0x16fe0), -- (nil) ..
69− (0x17000, 0x187ec), -- (nil) ..
70− (0x18800, 0x18af2), -- (nil) ..
71− (0x1b000, 0x1b001), -- Katakana Letter Archaic ..Hiragana Letter Archaic
72− (0x1f004, 0x1f004), -- Mahjong Tile Red Dragon ..Mahjong Tile Red Dragon
73− (0x1f0cf, 0x1f0cf), -- Playing Card Black Joker..Playing Card Black Joker
74− (0x1f18e, 0x1f18e), -- Negative Squared Ab ..Negative Squared Ab
75− (0x1f191, 0x1f19a), -- Squared Cl ..Squared Vs
76− (0x1f200, 0x1f202), -- Square Hiragana Hoka ..Squared Katakana Sa
77− (0x1f210, 0x1f23b), -- Squared Cjk Unified Ideo..
78− (0x1f240, 0x1f248), -- Tortoise Shell Bracketed..Tortoise Shell Bracketed
79− (0x1f250, 0x1f251), -- Circled Ideograph Advant..Circled Ideograph Accept
80− (0x1f300, 0x1f320), -- Cyclone ..Shooting Star
81− (0x1f32d, 0x1f335), -- Hot Dog ..Cactus
82− (0x1f337, 0x1f37c), -- Tulip ..Baby Bottle
83− (0x1f37e, 0x1f393), -- Bottle With Popping Cork..Graduation Cap
84− (0x1f3a0, 0x1f3ca), -- Carousel Horse ..Swimmer
85− (0x1f3cf, 0x1f3d3), -- Cricket Bat And Ball ..Table Tennis Paddle And
86− (0x1f3e0, 0x1f3f0), -- House Building ..European Castle
87− (0x1f3f4, 0x1f3f4), -- Waving Black Flag ..Waving Black Flag
88− (0x1f3f8, 0x1f43e), -- Badminton Racquet And Sh..Paw Prints
89− (0x1f440, 0x1f440), -- Eyes ..Eyes
90− (0x1f442, 0x1f4fc), -- Ear ..Videocassette
91− (0x1f4ff, 0x1f53d), -- Prayer Beads ..Down-pointing Small Red
92− (0x1f54b, 0x1f54e), -- Kaaba ..Menorah With Nine Branch
93− (0x1f550, 0x1f567), -- Clock Face One Oclock ..Clock Face Twelve-thirty
94− (0x1f57a, 0x1f57a), -- (nil) ..
95− (0x1f595, 0x1f596), -- Reversed Hand With Middl..Raised Hand With Part Be
96− (0x1f5a4, 0x1f5a4), -- (nil) ..
97− (0x1f5fb, 0x1f64f), -- Mount Fuji ..Person With Folded Hands
98− (0x1f680, 0x1f6c5), -- Rocket ..Left Luggage
99− (0x1f6cc, 0x1f6cc), -- Sleeping Accommodation ..Sleeping Accommodation
100− (0x1f6d0, 0x1f6d2), -- Place Of Worship ..
101− (0x1f6eb, 0x1f6ec), -- Airplane Departure ..Airplane Arriving
102− (0x1f6f4, 0x1f6f6), -- (nil) ..
103− (0x1f910, 0x1f91e), -- Zipper-mouth Face ..
104− (0x1f920, 0x1f927), -- (nil) ..
105− (0x1f930, 0x1f930), -- (nil) ..
106− (0x1f933, 0x1f93e), -- (nil) ..
107− (0x1f940, 0x1f94b), -- (nil) ..
108− (0x1f950, 0x1f95e), -- (nil) ..
109− (0x1f980, 0x1f991), -- Crab ..
110− (0x1f9c0, 0x1f9c0), -- Cheese Wedge ..Cheese Wedge
111− (0x20000, 0x2fffd), -- Cjk Unified Ideograph-20..
112− (0x30000, 0x3fffd) -- (nil) ..
113− ]
114−
115−zEROWIDTH :: RangeSet Int
116−zEROWIDTH = foldr insertRange empty [
117− (0x0300, 0x036f), -- Combining Grave Accent ..Combining Latin Small Le
118− (0x0483, 0x0489), -- Combining Cyrillic Titlo..Combining Cyrillic Milli
119− (0x0591, 0x05bd), -- Hebrew Accent Etnahta ..Hebrew Point Meteg
120− (0x05bf, 0x05bf), -- Hebrew Point Rafe ..Hebrew Point Rafe
121− (0x05c1, 0x05c2), -- Hebrew Point Shin Dot ..Hebrew Point Sin Dot
122− (0x05c4, 0x05c5), -- Hebrew Mark Upper Dot ..Hebrew Mark Lower Dot
123− (0x05c7, 0x05c7), -- Hebrew Point Qamats Qata..Hebrew Point Qamats Qata
124− (0x0610, 0x061a), -- Arabic Sign Sallallahou ..Arabic Small Kasra
125− (0x064b, 0x065f), -- Arabic Fathatan ..Arabic Wavy Hamza Below
126− (0x0670, 0x0670), -- Arabic Letter Superscrip..Arabic Letter Superscrip
127− (0x06d6, 0x06dc), -- Arabic Small High Ligatu..Arabic Small High Seen
128− (0x06df, 0x06e4), -- Arabic Small High Rounde..Arabic Small High Madda
129− (0x06e7, 0x06e8), -- Arabic Small High Yeh ..Arabic Small High Noon
130− (0x06ea, 0x06ed), -- Arabic Empty Centre Low ..Arabic Small Low Meem
131− (0x0711, 0x0711), -- Syriac Letter Superscrip..Syriac Letter Superscrip
132− (0x0730, 0x074a), -- Syriac Pthaha Above ..Syriac Barrekh
133− (0x07a6, 0x07b0), -- Thaana Abafili ..Thaana Sukun
134− (0x07eb, 0x07f3), -- Nko Combining Short High..Nko Combining Double Dot
135− (0x0816, 0x0819), -- Samaritan Mark In ..Samaritan Mark Dagesh
136− (0x081b, 0x0823), -- Samaritan Mark Epentheti..Samaritan Vowel Sign A
137− (0x0825, 0x0827), -- Samaritan Vowel Sign Sho..Samaritan Vowel Sign U
138− (0x0829, 0x082d), -- Samaritan Vowel Sign Lon..Samaritan Mark Nequdaa
139− (0x0859, 0x085b), -- Mandaic Affrication Mark..Mandaic Gemination Mark
140− (0x08d4, 0x08e1), -- (nil) ..
141− (0x08e3, 0x0902), -- Arabic Turned Damma Belo..Devanagari Sign Anusvara
142− (0x093a, 0x093a), -- Devanagari Vowel Sign Oe..Devanagari Vowel Sign Oe
143− (0x093c, 0x093c), -- Devanagari Sign Nukta ..Devanagari Sign Nukta
144− (0x0941, 0x0948), -- Devanagari Vowel Sign U ..Devanagari Vowel Sign Ai
145− (0x094d, 0x094d), -- Devanagari Sign Virama ..Devanagari Sign Virama
146− (0x0951, 0x0957), -- Devanagari Stress Sign U..Devanagari Vowel Sign Uu
147− (0x0962, 0x0963), -- Devanagari Vowel Sign Vo..Devanagari Vowel Sign Vo
148− (0x0981, 0x0981), -- Bengali Sign Candrabindu..Bengali Sign Candrabindu
149− (0x09bc, 0x09bc), -- Bengali Sign Nukta ..Bengali Sign Nukta
150− (0x09c1, 0x09c4), -- Bengali Vowel Sign U ..Bengali Vowel Sign Vocal
151− (0x09cd, 0x09cd), -- Bengali Sign Virama ..Bengali Sign Virama
152− (0x09e2, 0x09e3), -- Bengali Vowel Sign Vocal..Bengali Vowel Sign Vocal
153− (0x0a01, 0x0a02), -- Gurmukhi Sign Adak Bindi..Gurmukhi Sign Bindi
154− (0x0a3c, 0x0a3c), -- Gurmukhi Sign Nukta ..Gurmukhi Sign Nukta
155− (0x0a41, 0x0a42), -- Gurmukhi Vowel Sign U ..Gurmukhi Vowel Sign Uu
156− (0x0a47, 0x0a48), -- Gurmukhi Vowel Sign Ee ..Gurmukhi Vowel Sign Ai
157− (0x0a4b, 0x0a4d), -- Gurmukhi Vowel Sign Oo ..Gurmukhi Sign Virama
158− (0x0a51, 0x0a51), -- Gurmukhi Sign Udaat ..Gurmukhi Sign Udaat
159− (0x0a70, 0x0a71), -- Gurmukhi Tippi ..Gurmukhi Addak
160− (0x0a75, 0x0a75), -- Gurmukhi Sign Yakash ..Gurmukhi Sign Yakash
161− (0x0a81, 0x0a82), -- Gujarati Sign Candrabind..Gujarati Sign Anusvara
162− (0x0abc, 0x0abc), -- Gujarati Sign Nukta ..Gujarati Sign Nukta
163− (0x0ac1, 0x0ac5), -- Gujarati Vowel Sign U ..Gujarati Vowel Sign Cand
164− (0x0ac7, 0x0ac8), -- Gujarati Vowel Sign E ..Gujarati Vowel Sign Ai
165− (0x0acd, 0x0acd), -- Gujarati Sign Virama ..Gujarati Sign Virama
166− (0x0ae2, 0x0ae3), -- Gujarati Vowel Sign Voca..Gujarati Vowel Sign Voca
167− (0x0b01, 0x0b01), -- Oriya Sign Candrabindu ..Oriya Sign Candrabindu
168− (0x0b3c, 0x0b3c), -- Oriya Sign Nukta ..Oriya Sign Nukta
169− (0x0b3f, 0x0b3f), -- Oriya Vowel Sign I ..Oriya Vowel Sign I
170− (0x0b41, 0x0b44), -- Oriya Vowel Sign U ..Oriya Vowel Sign Vocalic
171− (0x0b4d, 0x0b4d), -- Oriya Sign Virama ..Oriya Sign Virama
172− (0x0b56, 0x0b56), -- Oriya Ai Length Mark ..Oriya Ai Length Mark
173− (0x0b62, 0x0b63), -- Oriya Vowel Sign Vocalic..Oriya Vowel Sign Vocalic
174− (0x0b82, 0x0b82), -- Tamil Sign Anusvara ..Tamil Sign Anusvara
175− (0x0bc0, 0x0bc0), -- Tamil Vowel Sign Ii ..Tamil Vowel Sign Ii
176− (0x0bcd, 0x0bcd), -- Tamil Sign Virama ..Tamil Sign Virama
177− (0x0c00, 0x0c00), -- Telugu Sign Combining Ca..Telugu Sign Combining Ca
178− (0x0c3e, 0x0c40), -- Telugu Vowel Sign Aa ..Telugu Vowel Sign Ii
179− (0x0c46, 0x0c48), -- Telugu Vowel Sign E ..Telugu Vowel Sign Ai
180− (0x0c4a, 0x0c4d), -- Telugu Vowel Sign O ..Telugu Sign Virama
181− (0x0c55, 0x0c56), -- Telugu Length Mark ..Telugu Ai Length Mark
182− (0x0c62, 0x0c63), -- Telugu Vowel Sign Vocali..Telugu Vowel Sign Vocali
183− (0x0c81, 0x0c81), -- Kannada Sign Candrabindu..Kannada Sign Candrabindu
184− (0x0cbc, 0x0cbc), -- Kannada Sign Nukta ..Kannada Sign Nukta
185− (0x0cbf, 0x0cbf), -- Kannada Vowel Sign I ..Kannada Vowel Sign I
186− (0x0cc6, 0x0cc6), -- Kannada Vowel Sign E ..Kannada Vowel Sign E
187− (0x0ccc, 0x0ccd), -- Kannada Vowel Sign Au ..Kannada Sign Virama
188− (0x0ce2, 0x0ce3), -- Kannada Vowel Sign Vocal..Kannada Vowel Sign Vocal
189− (0x0d01, 0x0d01), -- Malayalam Sign Candrabin..Malayalam Sign Candrabin
190− (0x0d41, 0x0d44), -- Malayalam Vowel Sign U ..Malayalam Vowel Sign Voc
191− (0x0d4d, 0x0d4d), -- Malayalam Sign Virama ..Malayalam Sign Virama
192− (0x0d62, 0x0d63), -- Malayalam Vowel Sign Voc..Malayalam Vowel Sign Voc
193− (0x0dca, 0x0dca), -- Sinhala Sign Al-lakuna ..Sinhala Sign Al-lakuna
194− (0x0dd2, 0x0dd4), -- Sinhala Vowel Sign Ketti..Sinhala Vowel Sign Ketti
195− (0x0dd6, 0x0dd6), -- Sinhala Vowel Sign Diga ..Sinhala Vowel Sign Diga
196− (0x0e31, 0x0e31), -- Thai Character Mai Han-a..Thai Character Mai Han-a
197− (0x0e34, 0x0e3a), -- Thai Character Sara I ..Thai Character Phinthu
198− (0x0e47, 0x0e4e), -- Thai Character Maitaikhu..Thai Character Yamakkan
199− (0x0eb1, 0x0eb1), -- Lao Vowel Sign Mai Kan ..Lao Vowel Sign Mai Kan
200− (0x0eb4, 0x0eb9), -- Lao Vowel Sign I ..Lao Vowel Sign Uu
201− (0x0ebb, 0x0ebc), -- Lao Vowel Sign Mai Kon ..Lao Semivowel Sign Lo
202− (0x0ec8, 0x0ecd), -- Lao Tone Mai Ek ..Lao Niggahita
203− (0x0f18, 0x0f19), -- Tibetan Astrological Sig..Tibetan Astrological Sig
204− (0x0f35, 0x0f35), -- Tibetan Mark Ngas Bzung ..Tibetan Mark Ngas Bzung
205− (0x0f37, 0x0f37), -- Tibetan Mark Ngas Bzung ..Tibetan Mark Ngas Bzung
206− (0x0f39, 0x0f39), -- Tibetan Mark Tsa -phru ..Tibetan Mark Tsa -phru
207− (0x0f71, 0x0f7e), -- Tibetan Vowel Sign Aa ..Tibetan Sign Rjes Su Nga
208− (0x0f80, 0x0f84), -- Tibetan Vowel Sign Rever..Tibetan Mark Halanta
209− (0x0f86, 0x0f87), -- Tibetan Sign Lci Rtags ..Tibetan Sign Yang Rtags
210− (0x0f8d, 0x0f97), -- Tibetan Subjoined Sign L..Tibetan Subjoined Letter
211− (0x0f99, 0x0fbc), -- Tibetan Subjoined Letter..Tibetan Subjoined Letter
212− (0x0fc6, 0x0fc6), -- Tibetan Symbol Padma Gda..Tibetan Symbol Padma Gda
213− (0x102d, 0x1030), -- Myanmar Vowel Sign I ..Myanmar Vowel Sign Uu
214− (0x1032, 0x1037), -- Myanmar Vowel Sign Ai ..Myanmar Sign Dot Below
215− (0x1039, 0x103a), -- Myanmar Sign Virama ..Myanmar Sign Asat
216− (0x103d, 0x103e), -- Myanmar Consonant Sign M..Myanmar Consonant Sign M
217− (0x1058, 0x1059), -- Myanmar Vowel Sign Vocal..Myanmar Vowel Sign Vocal
218− (0x105e, 0x1060), -- Myanmar Consonant Sign M..Myanmar Consonant Sign M
219− (0x1071, 0x1074), -- Myanmar Vowel Sign Geba ..Myanmar Vowel Sign Kayah
220− (0x1082, 0x1082), -- Myanmar Consonant Sign S..Myanmar Consonant Sign S
221− (0x1085, 0x1086), -- Myanmar Vowel Sign Shan ..Myanmar Vowel Sign Shan
222− (0x108d, 0x108d), -- Myanmar Sign Shan Counci..Myanmar Sign Shan Counci
223− (0x109d, 0x109d), -- Myanmar Vowel Sign Aiton..Myanmar Vowel Sign Aiton
224− (0x135d, 0x135f), -- Ethiopic Combining Gemin..Ethiopic Combining Gemin
225− (0x1712, 0x1714), -- Tagalog Vowel Sign I ..Tagalog Sign Virama
226− (0x1732, 0x1734), -- Hanunoo Vowel Sign I ..Hanunoo Sign Pamudpod
227− (0x1752, 0x1753), -- Buhid Vowel Sign I ..Buhid Vowel Sign U
228− (0x1772, 0x1773), -- Tagbanwa Vowel Sign I ..Tagbanwa Vowel Sign U
229− (0x17b4, 0x17b5), -- Khmer Vowel Inherent Aq ..Khmer Vowel Inherent Aa
230− (0x17b7, 0x17bd), -- Khmer Vowel Sign I ..Khmer Vowel Sign Ua
231− (0x17c6, 0x17c6), -- Khmer Sign Nikahit ..Khmer Sign Nikahit
232− (0x17c9, 0x17d3), -- Khmer Sign Muusikatoan ..Khmer Sign Bathamasat
233− (0x17dd, 0x17dd), -- Khmer Sign Atthacan ..Khmer Sign Atthacan
234− (0x180b, 0x180d), -- Mongolian Free Variation..Mongolian Free Variation
235− (0x1885, 0x1886), -- Mongolian Letter Ali Gal..Mongolian Letter Ali Gal
236− (0x18a9, 0x18a9), -- Mongolian Letter Ali Gal..Mongolian Letter Ali Gal
237− (0x1920, 0x1922), -- Limbu Vowel Sign A ..Limbu Vowel Sign U
238− (0x1927, 0x1928), -- Limbu Vowel Sign E ..Limbu Vowel Sign O
239− (0x1932, 0x1932), -- Limbu Small Letter Anusv..Limbu Small Letter Anusv
240− (0x1939, 0x193b), -- Limbu Sign Mukphreng ..Limbu Sign Sa-i
241− (0x1a17, 0x1a18), -- Buginese Vowel Sign I ..Buginese Vowel Sign U
242− (0x1a1b, 0x1a1b), -- Buginese Vowel Sign Ae ..Buginese Vowel Sign Ae
243− (0x1a56, 0x1a56), -- Tai Tham Consonant Sign ..Tai Tham Consonant Sign
244− (0x1a58, 0x1a5e), -- Tai Tham Sign Mai Kang L..Tai Tham Consonant Sign
245− (0x1a60, 0x1a60), -- Tai Tham Sign Sakot ..Tai Tham Sign Sakot
246− (0x1a62, 0x1a62), -- Tai Tham Vowel Sign Mai ..Tai Tham Vowel Sign Mai
247− (0x1a65, 0x1a6c), -- Tai Tham Vowel Sign I ..Tai Tham Vowel Sign Oa B
248− (0x1a73, 0x1a7c), -- Tai Tham Vowel Sign Oa A..Tai Tham Sign Khuen-lue
249− (0x1a7f, 0x1a7f), -- Tai Tham Combining Crypt..Tai Tham Combining Crypt
250− (0x1ab0, 0x1abe), -- Combining Doubled Circum..Combining Parentheses Ov
251− (0x1b00, 0x1b03), -- Balinese Sign Ulu Ricem ..Balinese Sign Surang
252− (0x1b34, 0x1b34), -- Balinese Sign Rerekan ..Balinese Sign Rerekan
253− (0x1b36, 0x1b3a), -- Balinese Vowel Sign Ulu ..Balinese Vowel Sign Ra R
254− (0x1b3c, 0x1b3c), -- Balinese Vowel Sign La L..Balinese Vowel Sign La L
255− (0x1b42, 0x1b42), -- Balinese Vowel Sign Pepe..Balinese Vowel Sign Pepe
256− (0x1b6b, 0x1b73), -- Balinese Musical Symbol ..Balinese Musical Symbol
257− (0x1b80, 0x1b81), -- Sundanese Sign Panyecek ..Sundanese Sign Panglayar
258− (0x1ba2, 0x1ba5), -- Sundanese Consonant Sign..Sundanese Vowel Sign Pan
259− (0x1ba8, 0x1ba9), -- Sundanese Vowel Sign Pam..Sundanese Vowel Sign Pan
260− (0x1bab, 0x1bad), -- Sundanese Sign Virama ..Sundanese Consonant Sign
261− (0x1be6, 0x1be6), -- Batak Sign Tompi ..Batak Sign Tompi
262− (0x1be8, 0x1be9), -- Batak Vowel Sign Pakpak ..Batak Vowel Sign Ee
263− (0x1bed, 0x1bed), -- Batak Vowel Sign Karo O ..Batak Vowel Sign Karo O
264− (0x1bef, 0x1bf1), -- Batak Vowel Sign U For S..Batak Consonant Sign H
265− (0x1c2c, 0x1c33), -- Lepcha Vowel Sign E ..Lepcha Consonant Sign T
266− (0x1c36, 0x1c37), -- Lepcha Sign Ran ..Lepcha Sign Nukta
267− (0x1cd0, 0x1cd2), -- Vedic Tone Karshana ..Vedic Tone Prenkha
268− (0x1cd4, 0x1ce0), -- Vedic Sign Yajurvedic Mi..Vedic Tone Rigvedic Kash
269− (0x1ce2, 0x1ce8), -- Vedic Sign Visarga Svari..Vedic Sign Visarga Anuda
270− (0x1ced, 0x1ced), -- Vedic Sign Tiryak ..Vedic Sign Tiryak
271− (0x1cf4, 0x1cf4), -- Vedic Tone Candra Above ..Vedic Tone Candra Above
272− (0x1cf8, 0x1cf9), -- Vedic Tone Ring Above ..Vedic Tone Double Ring A
273− (0x1dc0, 0x1df5), -- Combining Dotted Grave A..Combining Up Tack Above
274− (0x1dfb, 0x1dff), -- (nil) ..Combining Right Arrowhea
275− (0x20d0, 0x20f0), -- Combining Left Harpoon A..Combining Asterisk Above
276− (0x2cef, 0x2cf1), -- Coptic Combining Ni Abov..Coptic Combining Spiritu
277− (0x2d7f, 0x2d7f), -- Tifinagh Consonant Joine..Tifinagh Consonant Joine
278− (0x2de0, 0x2dff), -- Combining Cyrillic Lette..Combining Cyrillic Lette
279− (0x302a, 0x302d), -- Ideographic Level Tone M..Ideographic Entering Ton
280− (0x3099, 0x309a), -- Combining Katakana-hirag..Combining Katakana-hirag
281− (0xa66f, 0xa672), -- Combining Cyrillic Vzmet..Combining Cyrillic Thous
282− (0xa674, 0xa67d), -- Combining Cyrillic Lette..Combining Cyrillic Payer
283− (0xa69e, 0xa69f), -- Combining Cyrillic Lette..Combining Cyrillic Lette
284− (0xa6f0, 0xa6f1), -- Bamum Combining Mark Koq..Bamum Combining Mark Tuk
285− (0xa802, 0xa802), -- Syloti Nagri Sign Dvisva..Syloti Nagri Sign Dvisva
286− (0xa806, 0xa806), -- Syloti Nagri Sign Hasant..Syloti Nagri Sign Hasant
287− (0xa80b, 0xa80b), -- Syloti Nagri Sign Anusva..Syloti Nagri Sign Anusva
288− (0xa825, 0xa826), -- Syloti Nagri Vowel Sign ..Syloti Nagri Vowel Sign
289− (0xa8c4, 0xa8c5), -- Saurashtra Sign Virama ..
290− (0xa8e0, 0xa8f1), -- Combining Devanagari Dig..Combining Devanagari Sig
291− (0xa926, 0xa92d), -- Kayah Li Vowel Ue ..Kayah Li Tone Calya Plop
292− (0xa947, 0xa951), -- Rejang Vowel Sign I ..Rejang Consonant Sign R
293− (0xa980, 0xa982), -- Javanese Sign Panyangga ..Javanese Sign Layar
294− (0xa9b3, 0xa9b3), -- Javanese Sign Cecak Telu..Javanese Sign Cecak Telu
295− (0xa9b6, 0xa9b9), -- Javanese Vowel Sign Wulu..Javanese Vowel Sign Suku
296− (0xa9bc, 0xa9bc), -- Javanese Vowel Sign Pepe..Javanese Vowel Sign Pepe
297− (0xa9e5, 0xa9e5), -- Myanmar Sign Shan Saw ..Myanmar Sign Shan Saw
298− (0xaa29, 0xaa2e), -- Cham Vowel Sign Aa ..Cham Vowel Sign Oe
299− (0xaa31, 0xaa32), -- Cham Vowel Sign Au ..Cham Vowel Sign Ue
300− (0xaa35, 0xaa36), -- Cham Consonant Sign La ..Cham Consonant Sign Wa
301− (0xaa43, 0xaa43), -- Cham Consonant Sign Fina..Cham Consonant Sign Fina
302− (0xaa4c, 0xaa4c), -- Cham Consonant Sign Fina..Cham Consonant Sign Fina
303− (0xaa7c, 0xaa7c), -- Myanmar Sign Tai Laing T..Myanmar Sign Tai Laing T
304− (0xaab0, 0xaab0), -- Tai Viet Mai Kang ..Tai Viet Mai Kang
305− (0xaab2, 0xaab4), -- Tai Viet Vowel I ..Tai Viet Vowel U
306− (0xaab7, 0xaab8), -- Tai Viet Mai Khit ..Tai Viet Vowel Ia
307− (0xaabe, 0xaabf), -- Tai Viet Vowel Am ..Tai Viet Tone Mai Ek
308− (0xaac1, 0xaac1), -- Tai Viet Tone Mai Tho ..Tai Viet Tone Mai Tho
309− (0xaaec, 0xaaed), -- Meetei Mayek Vowel Sign ..Meetei Mayek Vowel Sign
310− (0xaaf6, 0xaaf6), -- Meetei Mayek Virama ..Meetei Mayek Virama
311− (0xabe5, 0xabe5), -- Meetei Mayek Vowel Sign ..Meetei Mayek Vowel Sign
312− (0xabe8, 0xabe8), -- Meetei Mayek Vowel Sign ..Meetei Mayek Vowel Sign
313− (0xabed, 0xabed), -- Meetei Mayek Apun Iyek ..Meetei Mayek Apun Iyek
314− (0xfb1e, 0xfb1e), -- Hebrew Point Judeo-spani..Hebrew Point Judeo-spani
315− (0xfe00, 0xfe0f), -- Variation Selector-1 ..Variation Selector-16
316− (0xfe20, 0xfe2f), -- Combining Ligature Left ..Combining Cyrillic Titlo
317− (0x101fd, 0x101fd), -- Phaistos Disc Sign Combi..Phaistos Disc Sign Combi
318− (0x102e0, 0x102e0), -- Coptic Epact Thousands M..Coptic Epact Thousands M
319− (0x10376, 0x1037a), -- Combining Old Permic Let..Combining Old Permic Let
320− (0x10a01, 0x10a03), -- Kharoshthi Vowel Sign I ..Kharoshthi Vowel Sign Vo
321− (0x10a05, 0x10a06), -- Kharoshthi Vowel Sign E ..Kharoshthi Vowel Sign O
322− (0x10a0c, 0x10a0f), -- Kharoshthi Vowel Length ..Kharoshthi Sign Visarga
323− (0x10a38, 0x10a3a), -- Kharoshthi Sign Bar Abov..Kharoshthi Sign Dot Belo
324− (0x10a3f, 0x10a3f), -- Kharoshthi Virama ..Kharoshthi Virama
325− (0x10ae5, 0x10ae6), -- Manichaean Abbreviation ..Manichaean Abbreviation
326− (0x11001, 0x11001), -- Brahmi Sign Anusvara ..Brahmi Sign Anusvara
327− (0x11038, 0x11046), -- Brahmi Vowel Sign Aa ..Brahmi Virama
328− (0x1107f, 0x11081), -- Brahmi Number Joiner ..Kaithi Sign Anusvara
329− (0x110b3, 0x110b6), -- Kaithi Vowel Sign U ..Kaithi Vowel Sign Ai
330− (0x110b9, 0x110ba), -- Kaithi Sign Virama ..Kaithi Sign Nukta
331− (0x11100, 0x11102), -- Chakma Sign Candrabindu ..Chakma Sign Visarga
332− (0x11127, 0x1112b), -- Chakma Vowel Sign A ..Chakma Vowel Sign Uu
333− (0x1112d, 0x11134), -- Chakma Vowel Sign Ai ..Chakma Maayyaa
334− (0x11173, 0x11173), -- Mahajani Sign Nukta ..Mahajani Sign Nukta
335− (0x11180, 0x11181), -- Sharada Sign Candrabindu..Sharada Sign Anusvara
336− (0x111b6, 0x111be), -- Sharada Vowel Sign U ..Sharada Vowel Sign O
337− (0x111ca, 0x111cc), -- Sharada Sign Nukta ..Sharada Extra Short Vowe
338− (0x1122f, 0x11231), -- Khojki Vowel Sign U ..Khojki Vowel Sign Ai
339− (0x11234, 0x11234), -- Khojki Sign Anusvara ..Khojki Sign Anusvara
340− (0x11236, 0x11237), -- Khojki Sign Nukta ..Khojki Sign Shadda
341− (0x1123e, 0x1123e), -- (nil) ..
342− (0x112df, 0x112df), -- Khudawadi Sign Anusvara ..Khudawadi Sign Anusvara
343− (0x112e3, 0x112ea), -- Khudawadi Vowel Sign U ..Khudawadi Sign Virama
344− (0x11300, 0x11301), -- Grantha Sign Combining A..Grantha Sign Candrabindu
345− (0x1133c, 0x1133c), -- Grantha Sign Nukta ..Grantha Sign Nukta
346− (0x11340, 0x11340), -- Grantha Vowel Sign Ii ..Grantha Vowel Sign Ii
347− (0x11366, 0x1136c), -- Combining Grantha Digit ..Combining Grantha Digit
348− (0x11370, 0x11374), -- Combining Grantha Letter..Combining Grantha Letter
349− (0x11438, 0x1143f), -- (nil) ..
350− (0x11442, 0x11444), -- (nil) ..
351− (0x11446, 0x11446), -- (nil) ..
352− (0x114b3, 0x114b8), -- Tirhuta Vowel Sign U ..Tirhuta Vowel Sign Vocal
353− (0x114ba, 0x114ba), -- Tirhuta Vowel Sign Short..Tirhuta Vowel Sign Short
354− (0x114bf, 0x114c0), -- Tirhuta Sign Candrabindu..Tirhuta Sign Anusvara
355− (0x114c2, 0x114c3), -- Tirhuta Sign Virama ..Tirhuta Sign Nukta
356− (0x115b2, 0x115b5), -- Siddham Vowel Sign U ..Siddham Vowel Sign Vocal
357− (0x115bc, 0x115bd), -- Siddham Sign Candrabindu..Siddham Sign Anusvara
358− (0x115bf, 0x115c0), -- Siddham Sign Virama ..Siddham Sign Nukta
359− (0x115dc, 0x115dd), -- Siddham Vowel Sign Alter..Siddham Vowel Sign Alter
360− (0x11633, 0x1163a), -- Modi Vowel Sign U ..Modi Vowel Sign Ai
361− (0x1163d, 0x1163d), -- Modi Sign Anusvara ..Modi Sign Anusvara
362− (0x1163f, 0x11640), -- Modi Sign Virama ..Modi Sign Ardhacandra
363− (0x116ab, 0x116ab), -- Takri Sign Anusvara ..Takri Sign Anusvara
364− (0x116ad, 0x116ad), -- Takri Vowel Sign Aa ..Takri Vowel Sign Aa
365− (0x116b0, 0x116b5), -- Takri Vowel Sign U ..Takri Vowel Sign Au
366− (0x116b7, 0x116b7), -- Takri Sign Nukta ..Takri Sign Nukta
367− (0x1171d, 0x1171f), -- Ahom Consonant Sign Medi..Ahom Consonant Sign Medi
368− (0x11722, 0x11725), -- Ahom Vowel Sign I ..Ahom Vowel Sign Uu
369− (0x11727, 0x1172b), -- Ahom Vowel Sign Aw ..Ahom Sign Killer
370− (0x11c30, 0x11c36), -- (nil) ..
371− (0x11c38, 0x11c3d), -- (nil) ..
372− (0x11c3f, 0x11c3f), -- (nil) ..
373− (0x11c92, 0x11ca7), -- (nil) ..
374− (0x11caa, 0x11cb0), -- (nil) ..
375− (0x11cb2, 0x11cb3), -- (nil) ..
376− (0x11cb5, 0x11cb6), -- (nil) ..
377− (0x16af0, 0x16af4), -- Bassa Vah Combining High..Bassa Vah Combining High
378− (0x16b30, 0x16b36), -- Pahawh Hmong Mark Cim Tu..Pahawh Hmong Mark Cim Ta
379− (0x16f8f, 0x16f92), -- Miao Tone Right ..Miao Tone Below
380− (0x1bc9d, 0x1bc9e), -- Duployan Thick Letter Se..Duployan Double Mark
381− (0x1d167, 0x1d169), -- Musical Symbol Combining..Musical Symbol Combining
382− (0x1d17b, 0x1d182), -- Musical Symbol Combining..Musical Symbol Combining
383− (0x1d185, 0x1d18b), -- Musical Symbol Combining..Musical Symbol Combining
384− (0x1d1aa, 0x1d1ad), -- Musical Symbol Combining..Musical Symbol Combining
385− (0x1d242, 0x1d244), -- Combining Greek Musical ..Combining Greek Musical
386− (0x1da00, 0x1da36), -- Signwriting Head Rim ..Signwriting Air Sucking
387− (0x1da3b, 0x1da6c), -- Signwriting Mouth Closed..Signwriting Excitement
388− (0x1da75, 0x1da75), -- Signwriting Upper Body T..Signwriting Upper Body T
389− (0x1da84, 0x1da84), -- Signwriting Location Hea..Signwriting Location Hea
390− (0x1da9b, 0x1da9f), -- Signwriting Fill Modifie..Signwriting Fill Modifie
391− (0x1daa1, 0x1daaf), -- Signwriting Rotation Mod..Signwriting Rotation Mod
392− (0x1e000, 0x1e006), -- (nil) ..
393− (0x1e008, 0x1e018), -- (nil) ..
394− (0x1e01b, 0x1e021), -- (nil) ..
395− (0x1e023, 0x1e024), -- (nil) ..
396− (0x1e026, 0x1e02a), -- (nil) ..
397− (0x1e8d0, 0x1e8d6), -- Mende Kikakui Combining ..Mende Kikakui Combining
398− (0x1e944, 0x1e94a), -- (nil) ..
399− (0xe0100, 0xe01ef) -- Variation Selector-17 ..Variation Selector-256
400− ]
401−
402−
403−basicZero :: RangeSet Int
404−basicZero = foldr insertRange empty [
405− (0, 0),
406− (0x034f, 0x034f),
407− (0x200b, 0x200f),
408− (0x2028, 0x2029),
409− (0x202a, 0x202e),
410− (0x2060, 0x2063)
411− ]
412−
413−ctrlChars :: RangeSet Int
414−ctrlChars = foldr insertRange empty [
415− (1, 32),
416− (0x07f, 0x09F)
417− ]
418−
419−wcwidth :: Char -> Int
420−wcwidth c | queryPoint v basicZero = 0
421− | queryPoint v ctrlChars = -1
422− | queryPoint v wIDEEASTASIAN = 2
423− | queryPoint v zEROWIDTH = 0
424− | otherwise = 1
425− where v = ord c
src/lib/ProjectM36/Win32Handle.hs+1−4
@@ -53,8 +53,5 @@ withHandleToHANDLE haskell_handle action =
53 -- Do what the user originally wanted
53 -- Do what the user originally wanted
54 action windows_handle
54 action windows_handle
55
55
56−#if MIN_VERSION_Win32(2,5,1)
57−#else
58withStablePtr :: a -> (StablePtr a -> IO b) -> IO b
56withStablePtr :: a -> (StablePtr a -> IO b) -> IO b
59−withStablePtr value = bracket (newStablePtr value) freeStablePtr
57+withStablePtr value = bracket (newStablePtr value) freeStablePtr
60−#endif
src/lib/ProjectM36/WithNameExpr.hsdeleted−86
@@ -1,86 +0,0 @@
1−module ProjectM36.WithNameExpr where
2−import ProjectM36.Base
3−
4−-- substitute all instances of With-based macros to remove macro context
5−-- ideally, we would use a different relational expr type to "prove" that the with macros can no longer exist
6−type WithNameAssocs = [(GraphRefWithNameExpr, GraphRefRelationalExpr)]
7−-- | Drop macros into the relational expression wherever they are referenced.
8−substituteWithNameMacros ::
9− WithNameAssocs ->
10− GraphRefRelationalExpr ->
11− GraphRefRelationalExpr
12−substituteWithNameMacros _ e@MakeRelationFromExprs{} = e
13−substituteWithNameMacros _ e@MakeStaticRelation{} = e
14−substituteWithNameMacros _ e@ExistingRelation{} = e
15−substituteWithNameMacros macros e@(RelationVariable rvname tid) =
16− let
17− macroFilt (WithNameExpr macroName macroTid, _) = rvname == macroName && tid== macroTid in
18− case filter macroFilt macros of
19− [] -> e
20− [(_,replacement)] -> replacement
21− _ -> error "more than one macro matched!"
22−substituteWithNameMacros macros (Project attrs expr) =
23− Project attrs (substituteWithNameMacros macros expr)
24−substituteWithNameMacros macros (Union exprA exprB) =
25− Union (substituteWithNameMacros macros exprA) (substituteWithNameMacros macros exprB)
26−substituteWithNameMacros macros (Join exprA exprB) =
27− Join (substituteWithNameMacros macros exprA) (substituteWithNameMacros macros exprB)
28−substituteWithNameMacros macros (Rename attrA attrB expr) =
29− Rename attrA attrB (substituteWithNameMacros macros expr)
30−substituteWithNameMacros macros (Difference exprA exprB) =
31− Difference (substituteWithNameMacros macros exprA) (substituteWithNameMacros macros exprB)
32−substituteWithNameMacros macros (Group attrs attr expr) =
33− Group attrs attr (substituteWithNameMacros macros expr)
34−substituteWithNameMacros macros (Ungroup attr expr) =
35− Ungroup attr (substituteWithNameMacros macros expr)
36−substituteWithNameMacros macros (Restrict pred' expr) =
37− Restrict (substituteWithNameMacrosRestrictionPredicate macros pred') (substituteWithNameMacros macros expr)
38−substituteWithNameMacros macros (Equals exprA exprB) =
39− Equals (substituteWithNameMacros macros exprA) (substituteWithNameMacros macros exprB)
40−substituteWithNameMacros macros (NotEquals exprA exprB) =
41− NotEquals (substituteWithNameMacros macros exprA) (substituteWithNameMacros macros exprB)
42−substituteWithNameMacros macros (Extend extendTup expr) =
43− Extend (substituteWitNameMacrosExtendTupleExpr macros extendTup) (substituteWithNameMacros macros expr)
44−substituteWithNameMacros macros (With moreMacros expr) =
45− --collect and update nested with exprs
46− let newMacros = foldr macroFolder macros moreMacros
47− macroFolder (wnexpr, mexpr) acc =
48− let subExpr = substituteWithNameMacros macros mexpr in
49− filter (\(w,_) -> w /= wnexpr) acc ++ [(wnexpr, subExpr)] in
50− --scan for a match- if it exists, replace it (representing a with clause at a lower level
51− substituteWithNameMacros newMacros expr
52−
53−
54−substituteWithNameMacrosRestrictionPredicate :: WithNameAssocs -> GraphRefRestrictionPredicateExpr -> GraphRefRestrictionPredicateExpr
55−substituteWithNameMacrosRestrictionPredicate macros pred' =
56− let sub = substituteWithNameMacrosRestrictionPredicate macros in
57− case pred' of
58− TruePredicate -> pred'
59− AndPredicate exprA exprB ->
60− AndPredicate (sub exprA) (sub exprB)
61− OrPredicate exprA exprB ->
62− OrPredicate (sub exprA) (sub exprB)
63− NotPredicate expr ->
64− NotPredicate (sub expr)
65− RelationalExprPredicate reexpr ->
66− RelationalExprPredicate (substituteWithNameMacros macros reexpr)
67− AtomExprPredicate atomExpr ->
68− AtomExprPredicate (substituteWithNameMacrosAtomExpr macros atomExpr)
69− AttributeEqualityPredicate attrName atomExpr ->
70− AttributeEqualityPredicate attrName (substituteWithNameMacrosAtomExpr macros atomExpr)
71−
72−substituteWitNameMacrosExtendTupleExpr :: WithNameAssocs -> GraphRefExtendTupleExpr -> GraphRefExtendTupleExpr
73−substituteWitNameMacrosExtendTupleExpr macros (AttributeExtendTupleExpr attrName atomExpr) =
74− AttributeExtendTupleExpr attrName (substituteWithNameMacrosAtomExpr macros atomExpr)
75−
76−substituteWithNameMacrosAtomExpr :: WithNameAssocs -> GraphRefAtomExpr -> GraphRefAtomExpr
77−substituteWithNameMacrosAtomExpr macros atomExpr =
78− case atomExpr of
79− e@AttributeAtomExpr{} -> e
80− e@NakedAtomExpr{} -> e
81− FunctionAtomExpr fname atomExprs tid ->
82− FunctionAtomExpr fname (map (substituteWithNameMacrosAtomExpr macros) atomExprs) tid
83− RelationAtomExpr reExpr ->
84− RelationAtomExpr (substituteWithNameMacros macros reExpr)
85− ConstructedAtomExpr dconsName atomExprs tid ->
86− ConstructedAtomExpr dconsName (map (substituteWithNameMacrosAtomExpr macros) atomExprs) tid
stack.ghc8.10.yamldeleted−19
@@ -1,19 +0,0 @@
1−resolver: lts-17.13
2−packages:
3− - "."
4−
5−extra-deps:
6− - git: https://github.com/agentm/curryer.git
7− commit: 74ecaac619ad1165a4517d5c0f4e530493bda130
8− - git: https://github.com/composewell/streamly.git
9− commit: ac3af8749194f1788704dda8667d0b3807075cc2
10− - fast-builder-0.1.2.1
11− - rset-1.0.0
12− - winery-1.3.2
13− - barbies-th-0.1.8
14− - base16-bytestring-1.0.1.0
15−
16−flags:
17− project-m36:
18− stack: true
19−# allow-newer: true
stack.ghc8.6.yamldeleted−62
@@ -1,62 +0,0 @@
1−# This file was automatically generated by stack init
2−# For more information, see: http://docs.haskellstack.org/en/stable/yaml_configuration/
3−
4−# Specifies the GHC version and set of packages available (e.g., lts-3.5, nightly-2015-09-21, ghc-7.10.2)
5−resolver: lts-14.27
6−
7−# Local packages, usually specified by relative directory name
8−packages:
9− - "."
10−# Packages to be pulled from upstream that are not in the resolver (e.g., acme-missiles-0.3)
11−extra-deps:
12− - git: https://github.com/agentm/curryer.git
13− commit: 74ecaac619ad1165a4517d5c0f4e530493bda130
14− - git: https://github.com/composewell/streamly.git
15− commit: ac3af8749194f1788704dda8667d0b3807075cc2
16− - fast-builder-0.1.2.1
17− - winery-1.3.2
18− - barbies-2.0.2.0
19− - barbies-th-0.1.7
20− - extended-reals-0.2.3.0
21− - data-interval-2.0.1
22− - stm-containers-1.1.0.4
23− - stm-hamt-1.2.0.4
24− - rset-1.0.0
25− - hashable-time-0.2.0.2
26− - network-transport-tcp-0.6.0
27− - megaparsec-7.0.5
28− - prettyprinter-1.7.0
29− - prettyprinter-ansi-terminal-1.1.2
30− - fusion-plugin-types-0.1.0
31− - base16-bytestring-1.0.1.0
32− - modern-uri-0.3.4.0
33− - cryptohash-sha256-0.11.102.0
34− - http-types-0.12.3
35−
36−# Override default flag values for local packages and extra-deps
37−flags:
38− project-m36:
39− stack: true
40−
41−# Extra package databases containing global packages
42−extra-package-dbs: []
43−
44−# Control whether we use the GHC we find on the path
45−# system-ghc: true
46−
47−# Require a specific version of stack, using version ranges
48−# require-stack-version: -any # Default
49−# require-stack-version: >= 1.0.0
50−
51−# Override the architecture used by stack, especially useful on Windows
52−# arch: i386
53−# arch: x86_64
54−
55−# Extra directories used by stack for building
56−# extra-include-dirs: [/path/to/dir]
57−# extra-lib-dirs: [/path/to/dir]
58−
59−# Allow a newer minor version of GHC than the snapshot specifies
60−# compiler-check: newer-minor
61−
62−allow-newer: true
stack.ghc8.8.yaml → stack.yamlrenamed+14−28
@@ -2,41 +2,26 @@
2# For more information, see: http://docs.haskellstack.org/en/stable/yaml_configuration/
2# For more information, see: http://docs.haskellstack.org/en/stable/yaml_configuration/
3
3
4# Specifies the GHC version and set of packages available (e.g., lts-3.5, nightly-2015-09-21, ghc-7.10.2)
4# Specifies the GHC version and set of packages available (e.g., lts-3.5, nightly-2015-09-21, ghc-7.10.2)
5−resolver: lts-16.4
5+resolver: lts-8.5
6
6
7# Local packages, usually specified by relative directory name
7# Local packages, usually specified by relative directory name
8packages:
8packages:
9− - "."
9+- '.'
10# Packages to be pulled from upstream that are not in the resolver (e.g., acme-missiles-0.3)
10# Packages to be pulled from upstream that are not in the resolver (e.g., acme-missiles-0.3)
11extra-deps:
11extra-deps:
12− - git: https://github.com/agentm/curryer.git
12+- data-accessor-transformers-0.2.1.7
13− commit: 74ecaac619ad1165a4517d5c0f4e530493bda130
13+- data-interval-1.2.0
14− - git: https://github.com/composewell/streamly.git
14+- extended-reals-0.2.1.0
15− commit: ac3af8749194f1788704dda8667d0b3807075cc2
15+- gnuplot-0.5.4.1
16− - fast-builder-0.1.2.1
16+- text-1.2.2.1
17− - winery-1.3.2
17+- aeson-1.2.1.00
18− - barbies-2.0.2.0
18+- distributed-process-0.6.6
19− - barbies-th-0.1.7
19+- distributed-process-async-0.2.4
20− - extended-reals-0.2.3.0
20+- distributed-process-client-server-0.2.3
21− - data-interval-2.0.1
21+- distributed-process-extras-0.3.2
22− - stm-containers-1.1.0.4
23− - stm-hamt-1.2.0.4
24− - rset-1.0.0
25− - hashable-time-0.2.0.2
26− - network-transport-tcp-0.7.0
27− - megaparsec-7.0.5
28− - network-2.8.0.1
29− - primitive-extras-0.8
30− - primitive-unlifted-0.1.3.0
31− - prettyprinter-1.7.0
32− - prettyprinter-ansi-terminal-1.1.2
33− - base16-bytestring-1.0.1.0
34− - modern-uri-0.3.4.0
35
22
36# Override default flag values for local packages and extra-deps
23# Override default flag values for local packages and extra-deps
37−flags:
24+flags: {}
38− project-m36:
39− stack: true
40
25
41# Extra package databases containing global packages
26# Extra package databases containing global packages
42extra-package-dbs: []
27extra-package-dbs: []
@@ -60,3 +45,4 @@ extra-package-dbs: []
60# compiler-check: newer-minor
45# compiler-check: newer-minor
61
46
62allow-newer: true
47allow-newer: true
48+
test/Client/Simple.hs+10−15
@@ -3,13 +3,11 @@ import Test.HUnit
3import System.Exit
3import System.Exit
4import ProjectM36.Relation
4import ProjectM36.Relation
5import qualified ProjectM36.Client as C
5import qualified ProjectM36.Client as C
6−import ProjectM36.DateExamples
7−import ProjectM36.DatabaseContext
8import System.IO.Temp
6import System.IO.Temp
9import System.FilePath
7import System.FilePath
10import ProjectM36.TupleSet
8import ProjectM36.TupleSet
11import ProjectM36.Attribute
9import ProjectM36.Attribute
12−import qualified Data.Map as M
10+import qualified Data.Vector as V
13
11
14main :: IO ()
12main :: IO ()
15main = do
13main = do
@@ -17,7 +15,7 @@ main = do
17 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
15 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
18
16
19testList :: Test
17testList :: Test
20−testList = TestList [testSimpleCommitSuccess, testSimpleCommitFailure, testSimpleUpdate]
18+testList = TestList [testSimpleCommitSuccess, testSimpleCommitFailure]
21
19
22assertEither :: (Show a) => IO (Either a b) -> IO b
20assertEither :: (Show a) => IO (Either a b) -> IO b
23assertEither x = do
21assertEither x = do
@@ -47,7 +45,6 @@ testSimpleCommitSuccess = TestCase $
47 eRes <- C.executeRelationalExpr sess conn relExpr
45 eRes <- C.executeRelationalExpr sess conn relExpr
48 assertEqual "x and y" (Right relationTrue) eRes
46 assertEqual "x and y" (Right relationTrue) eRes
49
47
50−
51testSimpleCommitFailure :: Test
48testSimpleCommitFailure :: Test
52testSimpleCommitFailure = TestCase $ do
49testSimpleCommitFailure = TestCase $ do
53 let failAttrs = attributesFromList [Attribute "fail" IntAtomType]
50 let failAttrs = attributesFromList [Attribute "fail" IntAtomType]
@@ -58,15 +55,13 @@ testSimpleCommitFailure = TestCase $ do
58 execute $ Assign "x" (ExistingRelation relationTrue)
55 execute $ Assign "x" (ExistingRelation relationTrue)
59 --cause error
56 --cause error
60 execute $ Assign "x" (MakeStaticRelation failAttrs emptyTupleSet)
57 execute $ Assign "x" (MakeStaticRelation failAttrs emptyTupleSet)
61− let expectedErr = Left (RelError (RelationTypeMismatchError mempty failAttrs))
58+ let expectedErr = Left (RelError (RelVarAssignmentTypeMismatchError V.empty failAttrs))
62 assertEqual "dbc error" expectedErr err
59 assertEqual "dbc error" expectedErr err
60+
61+
62+
63
63
64−-- #176 default merge couldn't handle Update
64+
65−testSimpleUpdate :: Test
65+
66−testSimpleUpdate = TestCase $ do
66+
67− let connInfo = InProcessConnectionInfo NoPersistence emptyNotificationCallback []
67+
68− dbconn <- assertEither (simpleConnectProjectM36 connInfo)
69− assertEither $ withTransaction dbconn $
70− execute $ databaseContextAsDatabaseContextExpr dateExamples
71− assertEither $ withTransaction dbconn $
72− execute $ Update "s" (M.singleton "sname" (C.NakedAtomExpr (C.TextAtom "Blakey"))) (C.AttributeEqualityPredicate "sname" (C.NakedAtomExpr (C.TextAtom "Blake")))
test/DataFrame.hsdeleted−61
@@ -1,61 +0,0 @@
1−import ProjectM36.Client
2−import ProjectM36.DataFrame
3−import TutorialD.Interpreter.TestBase
4−
5−import Test.HUnit
6−import System.Exit
7−import qualified Data.Set as S
8−
9−testList :: Test
10−testList = TestList [testOrderBy, testLimit, testOffset]
11−
12−main :: IO ()
13−main = do
14− tcounts <- runTestTT testList
15− if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
16−
17−testOrderBy :: Test
18−testOrderBy = TestCase $ do
19− (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
20− Right df <- executeDataFrameExpr sessionId dbconn (
21− DataFrameExpr {
22− convertExpr = Project (AttributeNames (S.singleton "status")) (RelationVariable "s" ()),
23− orderExprs = [AttributeOrderExpr "status" AscendingOrder],
24− offset = Nothing,
25− limit = Nothing
26− })
27− let vals = map (\tup -> case atomForAttributeName "status" tup of
28− Left err -> error (show err)
29− Right atom -> atom) (tuples df)
30− assertEqual "sort order of s" [IntegerAtom 10, IntegerAtom 20, IntegerAtom 30] vals
31−
32−testOffset :: Test
33−testOffset = TestCase $ do
34− (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
35− Right df <- executeDataFrameExpr sessionId dbconn (
36− DataFrameExpr {
37− convertExpr = Project (AttributeNames (S.singleton "status")) (RelationVariable "s" ()),
38− orderExprs = [AttributeOrderExpr "status" AscendingOrder],
39− offset = Just 1,
40− limit = Nothing
41− })
42− let vals = map (\tup -> case atomForAttributeName "status" tup of
43− Left err -> error (show err)
44− Right atom -> atom) (tuples df)
45− assertEqual "sort + offset" [IntegerAtom 20, IntegerAtom 30] vals
46−
47−testLimit :: Test
48−testLimit = TestCase $ do
49− (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
50− Right df <- executeDataFrameExpr sessionId dbconn (
51− DataFrameExpr {
52− convertExpr = Project (AttributeNames (S.singleton "status")) (RelationVariable "s" ()),
53− orderExprs = [AttributeOrderExpr "status" DescendingOrder],
54− offset = Nothing,
55− limit = Just 1
56− })
57− let vals = map (\tup -> case atomForAttributeName "status" tup of
58− Left err -> error (show err)
59− Right atom -> atom) (tuples df)
60− assertEqual "sort + limit" [IntegerAtom 30] vals
61−
test/IsomorphicSchema.hs+33−43
@@ -4,13 +4,13 @@ import ProjectM36.Error
4import ProjectM36.IsomorphicSchema
4import ProjectM36.IsomorphicSchema
5import ProjectM36.Relation
5import ProjectM36.Relation
6import ProjectM36.RelationalExpression
6import ProjectM36.RelationalExpression
7−import ProjectM36.TransactionGraph
8−import ProjectM36.StaticOptimizer
9import qualified ProjectM36.DatabaseContext as DBC
7import qualified ProjectM36.DatabaseContext as DBC
10import qualified ProjectM36.Attribute as A
8import qualified ProjectM36.Attribute as A
11import System.Exit
9import System.Exit
12import qualified Data.Map as M
10import qualified Data.Map as M
13import qualified Data.Set as S
11import qualified Data.Set as S
12+import Control.Monad.State
13+import Control.Monad.Trans.Reader
14
14
15testList :: Test
15testList :: Test
16testList = TestList [testIsoRename, testIsoRestrict, testIsoUnion, testSchemaValidation]
16testList = TestList [testIsoRename, testIsoRestrict, testIsoUnion, testSchemaValidation]
@@ -36,7 +36,7 @@ assertMaybe x msg = case x of
36testSchemaValidation :: Test
36testSchemaValidation :: Test
37testSchemaValidation = TestCase $ do
37testSchemaValidation = TestCase $ do
38 let potentialSchema = DBC.basicDatabaseContext {
38 let potentialSchema = DBC.basicDatabaseContext {
39− relationVariables = M.singleton "anotherRel" (ExistingRelation relationTrue)
39+ relationVariables = M.singleton "anotherRel" relationTrue
40 }
40 }
41 -- missing relvars failure
41 -- missing relvars failure
42 morphs = [IsoRename "true" "true", IsoRename "false" "false"]
42 morphs = [IsoRename "true" "true", IsoRename "false" "false"]
@@ -50,17 +50,15 @@ testSchemaValidation = TestCase $ do
50testIsoRename :: Test
50testIsoRename :: Test
51testIsoRename = TestCase $ do
51testIsoRename = TestCase $ do
52 -- create a schema with two relvars and rename one while the other remains the same in the isomorphic schema
52 -- create a schema with two relvars and rename one while the other remains the same in the isomorphic schema
53− let ctx = DBC.empty {
53+ let schemaA = mkRelationalExprState DBC.empty {
54− relationVariables = M.fromList [("employee", ExistingRelation relationTrue),
54+ relationVariables = M.fromList [("employee", relationTrue),
55− ("department", ExistingRelation relationFalse)]
55+ ("department", relationFalse)]
56 }
56 }
57− (graph, _) <- freshTransactionGraph ctx
57+ isomorphsAtoB = [IsoRename "emp" "employee",
58− let isomorphsAtoB = [IsoRename "emp" "employee",
59 IsoRename "department" "department"]
58 IsoRename "department" "department"]
60− unionExpr = Union (RelationVariable "emp" ()) (RelationVariable "department" ())
59+ unionExpr = Union (RelationVariable "emp" ()) (RelationVariable "department" ())
61− env = mkRelationalExprEnv ctx graph
62 relExpr <- assertEither (applyRelationalExprSchemaIsomorphs isomorphsAtoB unionExpr)
60 relExpr <- assertEither (applyRelationalExprSchemaIsomorphs isomorphsAtoB unionExpr)
63− let relResult = optimizeAndEvalRelationalExpr env relExpr
61+ let relResult = runReader (evalRelationalExpr relExpr) schemaA
64 assertEqual "employee relation morph" (Right relationTrue) relResult
62 assertEqual "employee relation morph" (Right relationTrue) relResult
65
63
66testIsoRestrict :: Test
64testIsoRestrict :: Test
@@ -69,70 +67,62 @@ testIsoRestrict = TestCase $ do
69 -- the virtual schema has an employee
67 -- the virtual schema has an employee
70 let empattrs = A.attributesFromList [Attribute "name" TextAtomType,
68 let empattrs = A.attributesFromList [Attribute "name" TextAtomType,
71 Attribute "boss" TextAtomType]
69 Attribute "boss" TextAtomType]
72− (graph, transId) <- freshTransactionGraph DBC.empty
73 emprel <- assertEither $ mkRelationFromList empattrs
70 emprel <- assertEither $ mkRelationFromList empattrs
74 [[TextAtom "Steve", TextAtom ""],
71 [[TextAtom "Steve", TextAtom ""],
75 [TextAtom "Cindy", TextAtom "Steve"],
72 [TextAtom "Cindy", TextAtom "Steve"],
76 [TextAtom "Sam", TextAtom "Steve"]]
73 [TextAtom "Sam", TextAtom "Steve"]]
77 let predicate = AttributeEqualityPredicate "boss" (NakedAtomExpr (TextAtom ""))
74 let predicate = AttributeEqualityPredicate "boss" (NakedAtomExpr (TextAtom ""))
78− reenv = mkRelationalExprEnv DBC.empty graph
75+ bossRel <- assertEither $ runReader (evalRelationalExpr (Restrict predicate (ExistingRelation emprel))) (mkRelationalExprState DBC.empty)
79− bossRel <- assertEither $ runRelationalExprM reenv (evalRelationalExpr (Restrict predicate (ExistingRelation emprel)))
76+ nonBossRel <- assertEither $ runReader (evalRelationalExpr (Restrict (NotPredicate predicate) (ExistingRelation emprel))) (mkRelationalExprState DBC.empty)
80− nonBossRel <- assertEither $ runRelationalExprM reenv (evalRelationalExpr (Restrict (NotPredicate predicate) (ExistingRelation emprel)))
81
77
82− let schemaA = mkRelationalExprEnv baseContext graph
78+ let schemaA = mkRelationalExprState DBC.empty {
83− baseContext = DBC.empty {
79+ relationVariables = M.fromList [("nonboss", nonBossRel),
84− relationVariables = M.fromList [("nonboss", ExistingRelation nonBossRel),
80+ ("boss", bossRel)]
85− ("boss", ExistingRelation bossRel)]
86 }
81 }
82+
87 isomorphsAtoB = [IsoRestrict "employee" predicate ("boss", "nonboss")]
83 isomorphsAtoB = [IsoRestrict "employee" predicate ("boss", "nonboss")]
88 bossq = RelationVariable "boss" ()
84 bossq = RelationVariable "boss" ()
89 nonbossq = RelationVariable "nonboss" ()
85 nonbossq = RelationVariable "nonboss" ()
90 employeeq = RelationVariable "employee" ()
86 employeeq = RelationVariable "employee" ()
91 unionq = Union bossq nonbossq
87 unionq = Union bossq nonbossq
92 empExpr <- assertEither (applyRelationalExprSchemaIsomorphs isomorphsAtoB employeeq)
88 empExpr <- assertEither (applyRelationalExprSchemaIsomorphs isomorphsAtoB employeeq)
93− let empResult = evalRelExpr (evalRelationalExpr empExpr)
89+ let empResult = runReader (evalRelationalExpr empExpr) schemaA
94− unionResult = evalRelExpr (evalRelationalExpr unionq)
90+ unionResult = runReader (evalRelationalExpr unionq) schemaA
95− evalRelExpr = runRelationalExprM schemaA
96 assertEqual "boss/nonboss isorestrict" unionResult empResult
91 assertEqual "boss/nonboss isorestrict" unionResult empResult
97 --execute database context expr
92 --execute database context expr
98 bobRel <- assertEither (mkRelationFromList empattrs [[TextAtom "Bob", TextAtom ""]])
93 bobRel <- assertEither (mkRelationFromList empattrs [[TextAtom "Bob", TextAtom ""]])
99 let schemaBInsertExpr = Insert "employee" (ExistingRelation bobRel)
94 let schemaBInsertExpr = Insert "employee" (ExistingRelation bobRel)
100 schemaBInsertExpr' <- assertEither (processDatabaseContextExprInSchema (Schema isomorphsAtoB) schemaBInsertExpr)
95 schemaBInsertExpr' <- assertEither (processDatabaseContextExprInSchema (Schema isomorphsAtoB) schemaBInsertExpr)
101− let Right dbcState = evalDBCExpr schemaBInsertExpr'
96+ let (postInsertContext,_,_) = execState (evalDatabaseContextExpr schemaBInsertExpr') (freshDatabaseState (stateElemsContext schemaA))
102− postInsertContext = dbc_context dbcState
97+ expectedRel = runReader (evalRelationalExpr (Union (RelationVariable "boss" ()) (RelationVariable "nonboss" ()))) (mkRelationalExprState postInsertContext)
103− evalDBCExpr expr' = runDatabaseContextEvalMonad baseContext dbcenv (optimizeAndEvalDatabaseContextExpr False expr')
104− dbcenv = mkDatabaseContextEvalEnv transId graph
105− expectedRel = runRelationalExprM postInsertEnv (evalRelationalExpr (Union (RelationVariable "boss" ()) (RelationVariable "nonboss" ())))
106− postInsertEnv = mkRelationalExprEnv postInsertContext graph
107 --execute the expression against the schema and compare against the base context
98 --execute the expression against the schema and compare against the base context
108 processedExpr <- assertEither (processRelationalExprInSchema (Schema isomorphsAtoB) (RelationVariable "employee" ()))
99 processedExpr <- assertEither (processRelationalExprInSchema (Schema isomorphsAtoB) (RelationVariable "employee" ()))
109− let processedRel = runRelationalExprM postInsertEnv (evalRelationalExpr processedExpr)
100+ let processedRel = runReader (evalRelationalExpr processedExpr) (mkRelationalExprState postInsertContext)
110 assertEqual "insert bob boss" expectedRel processedRel
101 assertEqual "insert bob boss" expectedRel processedRel
111
102
112testIsoUnion :: Test
103testIsoUnion :: Test
113testIsoUnion = TestCase $ do
104testIsoUnion = TestCase $ do
114 --create motors relation which is split into low-power (<50 horsepower) and high-power (>=50 horsepower) motors
105 --create motors relation which is split into low-power (<50 horsepower) and high-power (>=50 horsepower) motors
115 --the schema is contains the split relvars
106 --the schema is contains the split relvars
116− (graph, _) <- freshTransactionGraph DBC.empty
117 motorsRel <- assertEither $ mkRelationFromList (A.attributesFromList [Attribute "name" TextAtomType,
107 motorsRel <- assertEither $ mkRelationFromList (A.attributesFromList [Attribute "name" TextAtomType,
118− Attribute "power" IntegerAtomType])
108+ Attribute "power" IntAtomType])
119− [[TextAtom "Puny", IntegerAtom 10],
109+ [[TextAtom "Puny", IntAtom 10],
120− [TextAtom "Scooter", IntegerAtom 49],
110+ [TextAtom "Scooter", IntAtom 49],
121− [TextAtom "Auto", IntegerAtom 200],
111+ [TextAtom "Auto", IntAtom 200],
122− [TextAtom "Tractor", IntegerAtom 500]]
112+ [TextAtom "Tractor", IntAtom 500]]
123− let env = mkRelationalExprEnv DBC.basicDatabaseContext {
113+ let baseSchema = mkRelationalExprState DBC.basicDatabaseContext {
124− relationVariables = M.singleton "motor" (ExistingRelation motorsRel)
114+ relationVariables = M.singleton "motor" motorsRel
125− } graph
115+ }
126− splitPredicate = AtomExprPredicate (FunctionAtomExpr "lt" [AttributeAtomExpr "power", NakedAtomExpr (IntegerAtom 50)] ())
116+ splitPredicate = AtomExprPredicate (FunctionAtomExpr "lt" [AttributeAtomExpr "power", NakedAtomExpr (IntAtom 50)] ())
127 splitIsomorphs = [IsoUnion ("lowpower", "highpower") splitPredicate "motor",
117 splitIsomorphs = [IsoUnion ("lowpower", "highpower") splitPredicate "motor",
128 IsoRename "true" "true",
118 IsoRename "true" "true",
129 IsoRename "false" "false"]
119 IsoRename "false" "false"]
130− lowmotors = runRelationalExprM env (evalRelationalExpr (Restrict splitPredicate (RelationVariable "motor" ())))
120+ lowmotors = runReader (evalRelationalExpr (Restrict splitPredicate (RelationVariable "motor" ()))) baseSchema
131− highmotors = runRelationalExprM env (evalRelationalExpr (Restrict (NotPredicate splitPredicate) (RelationVariable "motor" ())))
121+ highmotors = runReader (evalRelationalExpr (Restrict (NotPredicate splitPredicate) (RelationVariable "motor" ()))) baseSchema
132− relResult expr = runRelationalExprM env (evalRelationalExpr expr)
122+ relResult expr = runReader (evalRelationalExpr expr) baseSchema
133 lowpowerExpr <- assertEither (processRelationalExprInSchema (Schema splitIsomorphs) (RelationVariable "lowpower" ()))
123 lowpowerExpr <- assertEither (processRelationalExprInSchema (Schema splitIsomorphs) (RelationVariable "lowpower" ()))
134 lowpowerRel <- assertEither (relResult lowpowerExpr)
124 lowpowerRel <- assertEither (relResult lowpowerExpr)
135 highpowerExpr <- assertEither (processRelationalExprInSchema (Schema splitIsomorphs) (RelationVariable "highpower" ()))
125 highpowerExpr <- assertEither (processRelationalExprInSchema (Schema splitIsomorphs) (RelationVariable "highpower" ()))
136 highpowerRel <- assertEither (relResult highpowerExpr)
126 highpowerRel <- assertEither (relResult highpowerExpr)
137 assertEqual "lowpower relation difference" (Right lowpowerRel) lowmotors
127 assertEqual "lowpower relation difference" (Right lowpowerRel) lowmotors
138− assertEqual "highpower relation difference" (Right highpowerRel) highmotors
128+ assertEqual "highpower relation difference" (Right highpowerRel) highmotors
test/Relation/Atomable.hs+14−89
@@ -1,7 +1,8 @@
1--Test Atomable typeclass which allows users to use existing Haskell datatypes to marshal them to and from the database as ConstructedAtoms.
1--Test Atomable typeclass which allows users to use existing Haskell datatypes to marshal them to and from the database as ConstructedAtoms.
2−{-# LANGUAGE DeriveGeneric, DeriveAnyClass, OverloadedStrings, TypeApplications, DerivingVia #-}
2+{-# LANGUAGE DeriveGeneric, DeriveAnyClass, OverloadedStrings #-}
3import Test.HUnit
3import Test.HUnit
4import ProjectM36.Client
4import ProjectM36.Client
5+import Data.Binary
5import Control.DeepSeq
6import Control.DeepSeq
6import System.Exit
7import System.Exit
7import TutorialD.Interpreter.TestBase
8import TutorialD.Interpreter.TestBase
@@ -12,83 +13,42 @@ import Data.Time.Calendar (fromGregorian)
12import Data.Text
13import Data.Text
13import qualified Data.Map as M
14import qualified Data.Map as M
14import Data.Proxy
15import Data.Proxy
15−import Codec.Winery
16
16
17{-# ANN module ("Hlint: ignore Use newtype instead of data" :: String) #-}
17{-# ANN module ("Hlint: ignore Use newtype instead of data" :: String) #-}
18data Test1T = Test1C Integer
18data Test1T = Test1C Integer
19− deriving (Generic, Show, Eq, NFData, Atomable)
19+ deriving (Generic, Show, Eq, Binary, NFData, Atomable)
20− deriving Serialise via WineryVariant Test1T
21
20
22data Test2T x = Test2C x
21data Test2T x = Test2C x
23− deriving (Show, Generic, Eq, NFData, Atomable)
22+ deriving (Show, Generic, Eq, Binary, NFData, Atomable)
24− deriving Serialise via WineryVariant (Test2T x)
25
23
26data Test3T = Test3C Integer Integer
24data Test3T = Test3C Integer Integer
27− deriving (Show, Generic, Eq, NFData, Atomable)
25+ deriving (Show, Generic, Eq, Binary, NFData, Atomable)
28− deriving Serialise via WineryVariant Test3T
29
26
30data Test4T = Test4Ca Integer |
27data Test4T = Test4Ca Integer |
31 Test4Cb Integer
28 Test4Cb Integer
32− deriving (Show, Generic, Eq, NFData, Atomable)
29+ deriving (Show, Generic, Eq, Binary, NFData, Atomable)
33− deriving Serialise via WineryVariant Test4T
34
30
35data TestListT = TestListC [Integer]
31data TestListT = TestListC [Integer]
36− deriving (Show, Generic, Eq, NFData, Atomable)
32+ deriving (Show, Generic, Eq, Binary, NFData, Atomable)
37− deriving Serialise via WineryVariant TestListT
38
33
39−data TestNonEmptyT = TestNonEmptyC [Integer]
40− deriving (Show, Generic, Eq, NFData, Atomable)
41− deriving Serialise via WineryVariant TestNonEmptyT
42−
43data Test5T = Test5C {
34data Test5T = Test5C {
44 con1 :: Integer,
35 con1 :: Integer,
45 con2 :: Integer
36 con2 :: Integer
46− } deriving (Show, Generic, Eq, NFData, Atomable)
37+ } deriving (Show, Generic, Eq, Binary, NFData, Atomable)
47− deriving Serialise via WineryRecord Test5T
48
38
49data Test6T = Test6C (Maybe Integer)
39data Test6T = Test6C (Maybe Integer)
50− deriving (Show, Generic, Eq, NFData, Atomable)
40+ deriving (Show, Generic, Eq, Binary, NFData, Atomable)
51− deriving Serialise via WineryVariant Test6T
52
41
53data Test7T = Test7C (Either Integer Integer)
42data Test7T = Test7C (Either Integer Integer)
54− deriving (Show, Generic, Eq, NFData, Atomable)
43+ deriving (Show, Generic, Eq, Binary, NFData, Atomable)
55− deriving Serialise via WineryVariant Test7T
44+
56−
57−data Test8T = Test8C Test1T
58− deriving (Show, Generic, Eq, NFData, Atomable)
59− deriving Serialise via WineryVariant Test8T
60−
61−data User = User
62− { userFirstName :: Text
63− , userLastName :: Text
64− } deriving (Eq, Ord, Show, Generic, NFData, Atomable)
65− deriving Serialise via WineryRecord User
66−
67−data Test9_4T = Test9_4C {
68− f9_41 :: Int,
69− f9_42 :: Int,
70− f9_43 :: Int,
71− f9_44 :: Int }
72− deriving (Show, Generic, Eq, NFData, Atomable)
73− deriving Serialise via WineryRecord Test9_4T
74−
75−data Test9_5T = Test9_5C {
76− f9_51 :: Int,
77− f9_52 :: Int,
78− f9_53 :: Int,
79− f9_54 :: Int,
80− f9_55 :: Int
81− }
82− deriving (Show, Generic, Eq, NFData, Atomable)
83− deriving Serialise via WineryRecord Test9_5T
84−
85main :: IO ()
45main :: IO ()
86main = do
46main = do
87 tcounts <- runTestTT testList
47 tcounts <- runTestTT testList
88 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
48 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
89
49
90testList :: Test
50testList :: Test
91−testList = TestList [testHaskell2DB, testADT1, testADT2, testADT3, testADT4, testADT5, testBasicMarshaling, testSimpleList, testListInstance, testNonEmptyInstance, testADT6Maybe, testADT7Either, testNonPrimitiveValues, testRecordType, testManyFields]
51+testList = TestList [testHaskell2DB, testADT1, testADT2, testADT3, testADT4, testADT5, testBasicMarshaling, testListInstance, testADT6Maybe, testADT7Either]
92
52
93-- test some basic data types like int, day, etc.
53-- test some basic data types like int, day, etc.
94testBasicMarshaling :: Test
54testBasicMarshaling :: Test
@@ -117,7 +77,7 @@ testHaskell2DB = TestCase $ do
117 let createRelExpr = Assign "x" rel
77 let createRelExpr = Assign "x" rel
118
78
119 rel = MakeRelationFromExprs Nothing
79 rel = MakeRelationFromExprs Nothing
120− (TupleExprs () [TupleExpr (M.singleton "a1" (NakedAtomExpr atomVal))])
80+ [TupleExpr (M.singleton "a1" (NakedAtomExpr atomVal))]
121 atomVal = toAtom exampleVal
81 atomVal = toAtom exampleVal
122 exampleVal = Test1C 10
82 exampleVal = Test1C 10
123 checkExecuteDatabaseContextExpr sessionId dbconn createRelExpr
83 checkExecuteDatabaseContextExpr sessionId dbconn createRelExpr
@@ -171,39 +131,4 @@ checkExecuteDatabaseContextExpr sessionId dbconn expr = executeDatabaseContextEx
171testListInstance :: Test
131testListInstance :: Test
172testListInstance = TestCase $ do
132testListInstance = TestCase $ do
173 let example = TestListC [3,4,5]
133 let example = TestListC [3,4,5]
174− assertEqual "List instance" example (fromAtom (toAtom example))
134+ assertEqual "List instance" example (fromAtom (toAtom example))
175−
176−testSimpleList :: Test
177−testSimpleList = TestCase $ do
178− let example = toAtom @[Integer] [1,2,3]
179− expected = ConstructedAtom "Cons" (ConstructedAtomType "List" (M.fromList [("a",IntegerAtomType)])) [IntegerAtom 1,ConstructedAtom "Cons" (ConstructedAtomType "List" (M.fromList [("a",IntegerAtomType)])) [IntegerAtom 2,ConstructedAtom "Cons" (ConstructedAtomType "List" (M.fromList [("a",IntegerAtomType)])) [IntegerAtom 3,ConstructedAtom "Empty" (ConstructedAtomType "List" (M.fromList [("a",IntegerAtomType)])) []]]]
180− assertEqual "simple list" expected example
181−
182−testNonEmptyInstance :: Test
183−testNonEmptyInstance = TestCase $ do
184− let example = TestNonEmptyC [3,4,5]
185− assertEqual "NonEmpty instance" example (fromAtom (toAtom example))
186−
187−testNonPrimitiveValues :: Test
188−testNonPrimitiveValues = TestCase $ do
189− let example = Test8C (Test1C 3)
190− assertEqual "non-primitive values" example (fromAtom (toAtom example))
191−
192−testRecordType :: Test
193−testRecordType = TestCase $ do
194− let example = User { userFirstName = "Bob"
195− ,userLastName = "Smith"
196− }
197− assertEqual "User record" example (fromAtom (toAtom example))
198− let expected = AddTypeConstructor (ADTypeConstructorDef "User" []) [DataConstructorDef "User" [DataConstructorDefTypeConstructorArg (PrimitiveTypeConstructor "Text" TextAtomType),DataConstructorDefTypeConstructorArg (PrimitiveTypeConstructor "Text" TextAtomType)]]
199−
200− assertEqual "User record to database context expr" expected (toAddTypeExpr (Proxy :: Proxy User))
201−
202−--test both odd and even product types with more than 2 fields
203−testManyFields :: Test
204−testManyFields = TestCase $ do
205− let example4 = Test9_4C 1 2 3 4
206− assertEqual "four fields product type" example4 (fromAtom (toAtom example4))
207−
208− let example5 = Test9_5C 1 2 3 4 5
209− assertEqual "five fields product type" example5 (fromAtom (toAtom example5))
test/Relation/Basic.hs+14−27
@@ -3,11 +3,13 @@ import ProjectM36.Base
3import ProjectM36.Relation
3import ProjectM36.Relation
4import ProjectM36.Error
4import ProjectM36.Error
5import ProjectM36.DateExamples
5import ProjectM36.DateExamples
6+import ProjectM36.TupleSet
7+import ProjectM36.Attribute hiding (null, attributeNames)
6import ProjectM36.DataTypes.Primitive
8import ProjectM36.DataTypes.Primitive
7import ProjectM36.RelationalExpression
9import ProjectM36.RelationalExpression
8−import ProjectM36.TransactionGraph
9import ProjectM36.Tuple
10import ProjectM36.Tuple
10import qualified ProjectM36.DatabaseContext as DBC
11import qualified ProjectM36.DatabaseContext as DBC
12+import Control.Monad.Trans.Reader
11import qualified ProjectM36.Attribute as A
13import qualified ProjectM36.Attribute as A
12import qualified Data.Map as M
14import qualified Data.Map as M
13import qualified Data.Vector as V
15import qualified Data.Vector as V
@@ -23,8 +25,7 @@ testList = TestList [testRelation "relationTrue" relationTrue, testRelation "rel
23 testRelation "products" productsRel,
25 testRelation "products" productsRel,
24 testRelation "supplierProducts" supplierProductsRel,
26 testRelation "supplierProducts" supplierProductsRel,
25 testMkRelationFromExprsBadAttrs,
27 testMkRelationFromExprsBadAttrs,
26− testExistingRelationType,
28+ testDuplicateAttributes
27− testReorderTuple
28 ]
29 ]
29
30
30main :: IO ()
31main :: IO ()
@@ -62,8 +63,8 @@ validateAttrTypesMatchTupleAttrTypes rel@(Relation attrs tupSet) = foldr (\tuple
62 tupleAtomCheck tuple = V.all (== True) (attrChecks tuple)
63 tupleAtomCheck tuple = V.all (== True) (attrChecks tuple)
63 attrChecks tuple = V.map (\attr -> case atomForAttributeName (A.attributeName attr) tuple of
64 attrChecks tuple = V.map (\attr -> case atomForAttributeName (A.attributeName attr) tuple of
64 Left _ -> False
65 Left _ -> False
65− Right atom -> Right (atomTypeForAtom atom) ==
66+ Right atom -> (Right $ atomTypeForAtom atom) ==
66− A.atomTypeForAttributeName (A.attributeName attr) attrs) (attributesVec (attributes rel))
67+ A.atomTypeForAttributeName (A.attributeName attr) attrs) (attributes rel)
67
68
68simpleRel :: Relation
69simpleRel :: Relation
69simpleRel = case mkRelation attrs tupleSet of
70simpleRel = case mkRelation attrs tupleSet of
@@ -92,28 +93,14 @@ testMkRelation1 = TestCase $ assertEqual "key mismatch" expectedError (mkRelatio
92
93
93testMkRelationFromExprsBadAttrs :: Test
94testMkRelationFromExprsBadAttrs :: Test
94testMkRelationFromExprsBadAttrs = TestCase $ do
95testMkRelationFromExprsBadAttrs = TestCase $ do
95− let context = DBC.empty
96+ let context = DBC.empty
96− (graph,_) <- freshTransactionGraph context
97+ case runReader (evalRelationalExpr (MakeRelationFromExprs (Just [AttributeAndTypeNameExpr "badAttr1" (PrimitiveTypeConstructor "Int" IntAtomType) ()]) [TupleExpr (M.singleton "badAttr2" (NakedAtomExpr (IntAtom 1)))])) (mkRelationalExprState context) of
97− let reenv = mkRelationalExprEnv context graph
98− reExpr = MakeRelationFromExprs (Just [AttributeAndTypeNameExpr "badAttr1" (PrimitiveTypeConstructor "Int" IntAtomType) ()]) (TupleExprs () [TupleExpr (M.singleton "badAttr2" (NakedAtomExpr (IntAtom 1)))])
99− evald = runRelationalExprM reenv (evalRelationalExpr reExpr)
100− case evald of
101 Left err -> assertEqual "tuple type mismatch" (TupleAttributeTypeMismatchError (A.attributesFromList [Attribute "badAttr2" IntAtomType])) err
98 Left err -> assertEqual "tuple type mismatch" (TupleAttributeTypeMismatchError (A.attributesFromList [Attribute "badAttr2" IntAtomType])) err
102 Right _ -> assertFailure "expected tuple type mismatch"
99 Right _ -> assertFailure "expected tuple type mismatch"
103
100
104−testExistingRelationType :: Test
101+--creating an empty relation with duplicate attribute names should fail
105−testExistingRelationType = TestCase $ do
102+testDuplicateAttributes :: Test
106− (graph, _) <- freshTransactionGraph dateExamples
103+testDuplicateAttributes = TestCase $ do
107− let typeResult = runRelationalExprM reenv (typeForRelationalExpr (ExistingRelation relationTrue))
104+ let eRel = mkRelation attrs emptyTupleSet
108− reenv = mkRelationalExprEnv dateExamples graph
105+ attrs = attributesFromList [Attribute "a" IntAtomType, Attribute "a" TextAtomType]
109− assertEqual "ExistingRelation with tuples type" (Right relationFalse) typeResult
106+ assertEqual "duplicate attribute names" (Left (DuplicateAttributeNamesError (S.singleton "a"))) eRel
110−
111−-- | Ensure that tuple reordering honors the
112−testReorderTuple :: Test
113−testReorderTuple = TestCase $ do
114− let tup1 = mkRelationTuple attrs1 (V.fromList [IntAtom 4, TextAtom "test"])
115− attrs1 = A.attributesFromList [Attribute "a" IntAtomType, Attribute "b" TextAtomType]
116− attrs2 = A.attributesFromList [Attribute "b" TextAtomType, Attribute "a" IntAtomType]
117− actual = reorderTuple attrs2 tup1
118− expected = mkRelationTuple attrs2 (V.fromList [TextAtom "test", IntAtom 4])
119− assertEqual "reorderTuple" expected actual
test/Relation/Export/CSV.hs+20−25
@@ -1,5 +1,3 @@
1−{-# LANGUAGE CPP #-}
2−
3import ProjectM36.Base
1import ProjectM36.Base
4import ProjectM36.Relation.Show.CSV
2import ProjectM36.Relation.Show.CSV
5import ProjectM36.Relation.Parse.CSV
3import ProjectM36.Relation.Parse.CSV
@@ -13,11 +11,7 @@ import System.Exit
13import Test.HUnit
11import Test.HUnit
14import Data.Time.Calendar
12import Data.Time.Calendar
15import Data.Time.Clock
13import Data.Time.Clock
16−
17−#if __GLASGOW_HASKELL__ < 804
18import Data.Monoid
14import Data.Monoid
19−#endif
20−
21{-
15{-
22import qualified Data.Text.Lazy as TL
16import qualified Data.Text.Lazy as TL
23import qualified Data.Text.Lazy.Encoding as TE
17import qualified Data.Text.Lazy.Encoding as TE
@@ -25,9 +19,9 @@ import ProjectM36.Relation.Show.Term
25import qualified Data.ByteString.Lazy as BS
19import qualified Data.ByteString.Lazy as BS
26-}
20-}
27
21
28−main :: IO ()
22+main :: IO ()
29−main = do
23+main = do
30− tcounts <- runTestTT $ TestList [testCSVExport,
24+ tcounts <- runTestTT $ TestList [testCSVExport,
31 testADTExport]
25 testADTExport]
32 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
26 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
33
27
@@ -37,8 +31,8 @@ assertEither x = do
37 case res of
31 case res of
38 Left err -> assertFailure (show err) >> undefined
32 Left err -> assertFailure (show err) >> undefined
39 Right val -> pure val
33 Right val -> pure val
40−
34+
41−testADTExport :: Test
35+testADTExport :: Test
42testADTExport = TestCase $ do
36testADTExport = TestCase $ do
43 let adtCSV = "a\nCons 4 (Cons 5 Empty)\n"
37 let adtCSV = "a\nCons 4 (Cons 5 Empty)\n"
44 attrs = A.attributesFromList [Attribute "a" (listAtomType IntegerAtomType)]
38 attrs = A.attributesFromList [Attribute "a" (listAtomType IntegerAtomType)]
@@ -46,29 +40,29 @@ testADTExport = TestCase $ do
46 case csvAsRelation attrs basicTypeConstructorMapping adtCSV of
40 case csvAsRelation attrs basicTypeConstructorMapping adtCSV of
47 Left err -> assertFailure ("import failure: " <> show err)
41 Left err -> assertFailure ("import failure: " <> show err)
48 Right rel -> assertEqual "import cons list" expectedRel (Right rel)
42 Right rel -> assertEqual "import cons list" expectedRel (Right rel)
49−
43+
50--round-trip various atom types through CSV export/import
44--round-trip various atom types through CSV export/import
51testCSVExport :: Test
45testCSVExport :: Test
52testCSVExport = TestCase $ do
46testCSVExport = TestCase $ do
53 now <- getCurrentTime
47 now <- getCurrentTime
54− testInterval <- assertEither $ pure (createInterval
48+ testInterval <- assertEither $ pure (createInterval
55− (DateTimeAtom now)
49+ (DateTimeAtom now)
56 (DateTimeAtom (addUTCTime 86400 now))
50 (DateTimeAtom (addUTCTime 86400 now))
57 True
51 True
58 False)
52 False)
59− let attrs = A.attributesFromList [Attribute "textattr" TextAtomType,
53+ let attrs = A.attributesFromList [Attribute "textattr" TextAtomType,
60 Attribute "integerattr" IntegerAtomType,
54 Attribute "integerattr" IntegerAtomType,
61 Attribute "dayattr" DayAtomType,
55 Attribute "dayattr" DayAtomType,
62 Attribute "datetimeattr" DateTimeAtomType,
56 Attribute "datetimeattr" DateTimeAtomType,
63 Attribute "bytestringattr" ByteStringAtomType,
57 Attribute "bytestringattr" ByteStringAtomType,
64 Attribute "listintegerattr" (listAtomType IntegerAtomType),
58 Attribute "listintegerattr" (listAtomType IntegerAtomType),
65 Attribute "listtextattr" (listAtomType TextAtomType),
59 Attribute "listtextattr" (listAtomType TextAtomType),
66− Attribute "intervalattr" (intervalAtomType DateTimeAtomType)
60+ Attribute "intervalattr" (IntervalAtomType DateTimeAtomType)
67 ]
61 ]
68 sampleByteString = "\1\0\244\34\150"
62 sampleByteString = "\1\0\244\34\150"
69 relOrErr = mkRelationFromList attrs [
63 relOrErr = mkRelationFromList attrs [
70− [TextAtom "text atom with \"quote\"",
64+ [TextAtom "text atom with \"quote\"",
71− IntegerAtom 123,
65+ IntegerAtom 123,
72 DayAtom (fromGregorian 2017 4 10),
66 DayAtom (fromGregorian 2017 4 10),
73 DateTimeAtom now,
67 DateTimeAtom now,
74 ByteStringAtom sampleByteString,
68 ByteStringAtom sampleByteString,
@@ -76,24 +70,25 @@ testCSVExport = TestCase $ do
76 listCons TextAtomType [TextAtom "text1", TextAtom "text2"],
70 listCons TextAtomType [TextAtom "text1", TextAtom "text2"],
77 testInterval
71 testInterval
78 ],
72 ],
79− [TextAtom "second text atom with 漢字",
73+ [TextAtom "second text atom",
80− IntegerAtom 314,
74+ IntegerAtom 314,
81 DayAtom (fromGregorian 1001 6 28),
75 DayAtom (fromGregorian 1001 6 28),
82 DateTimeAtom (addUTCTime 360 now),
76 DateTimeAtom (addUTCTime 360 now),
83− ByteStringAtom sampleByteString,
77+ ByteStringAtom sampleByteString,
84 listCons IntegerAtomType [IntegerAtom 10, IntegerAtom 11, IntegerAtom 12],
78 listCons IntegerAtomType [IntegerAtom 10, IntegerAtom 11, IntegerAtom 12],
85 listCons TextAtomType [TextAtom "text5\"", TextAtom "text6\r\n"],
79 listCons TextAtomType [TextAtom "text5\"", TextAtom "text6\r\n"],
86 testInterval
80 testInterval
87 ]]
81 ]]
88−
82+
89− case relOrErr of
83+ case relOrErr of
90 Left err -> assertFailure $ "export relation creation failure: " ++ show err
84 Left err -> assertFailure $ "export relation creation failure: " ++ show err
91− Right rel ->
85+ Right rel ->
92 case relationAsCSV rel of
86 case relationAsCSV rel of
93 Left err -> assertFailure $ "export failed: " ++ show err
87 Left err -> assertFailure $ "export failed: " ++ show err
94− Right csvData ->
88+ Right csvData ->
95 --BS.writeFile "/tmp/csv" csvData
89 --BS.writeFile "/tmp/csv" csvData
96 --putStrLn (TL.unpack (TE.decodeUtf8 csvData))
90 --putStrLn (TL.unpack (TE.decodeUtf8 csvData))
97 case csvAsRelation attrs basicTypeConstructorMapping csvData of -- import csv data back to relation
91 case csvAsRelation attrs basicTypeConstructorMapping csvData of -- import csv data back to relation
98 Left err -> assertFailure $ "re-import failed: " ++ show err
92 Left err -> assertFailure $ "re-import failed: " ++ show err
99 Right rel' -> assertEqual "relation CSV comparison" rel rel'
93 Right rel' -> assertEqual "relation CSV comparison" rel rel'
94+
test/Relation/StaticOptimizer.hs+60−84
@@ -1,12 +1,13 @@
1import ProjectM36.Base
1import ProjectM36.Base
2import ProjectM36.Relation
2import ProjectM36.Relation
3−import ProjectM36.TransactionGraph
3+import ProjectM36.RelationalExpression
4import ProjectM36.DateExamples
4import ProjectM36.DateExamples
5+import ProjectM36.Error
5import ProjectM36.TupleSet
6import ProjectM36.TupleSet
6import ProjectM36.StaticOptimizer
7import ProjectM36.StaticOptimizer
7−import ProjectM36.DatabaseContext as DBC
8import System.Exit
8import System.Exit
9import Control.Monad.State
9import Control.Monad.State
10+import Control.Monad.Trans.Reader
10import Test.HUnit
11import Test.HUnit
11import qualified Data.Set as S
12import qualified Data.Set as S
12
13
@@ -15,126 +16,100 @@ main = do
15 tcounts <- runTestTT (TestList tests)
16 tcounts <- runTestTT (TestList tests)
16 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
17 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
17 where
18 where
18− tests = [testTransitiveOptimization,
19+ tests = relationOptTests ++ databaseOptTests ++ [testTransitiveOptimization,
19− testImpossiblePredicates,
20+ testImpossiblePredicates,
20− testJoinElimination,
21+ testJoinElimination,
21− testRestrictionPredicateCollapse,
22+ testRestrictionPredicateCollapse,
22− testPushDownRestrictionPredicate,
23+ testPushDownRestrictionPredicate]
23− testOptimizeRelationalExpr,
24+ optDBCTest = map (\(name, expr, unopt) -> TestCase $ assertEqual name expr (evalState (applyStaticDatabaseOptimization unopt) (freshDatabaseState dateExamples)))
24− testOptimizeDatabaseContextExpr]
25+ relvar nam = RelationVariable nam ()
25−
26+ startState = mkRelationalExprState dateExamples
26−testOptimizeDatabaseContextExpr :: Test
27+ optRelTest = map (\(name, expr, unopt) -> TestCase $ assertEqual name expr (runReader (applyStaticRelationalOptimization unopt) startState))
27−testOptimizeDatabaseContextExpr = TestCase $ do
28+ relationOptTests = optRelTest [
28− (graph, transId) <- freshTransactionGraph DBC.empty
29+ ("StaticProject", Right $ relvar "s", Project (AttributeNames (attributeNames suppliersRel)) (relvar "s")),
29− let relvar nam = RelationVariable nam ()
30+ ("StaticUnion", Right $ relvar "s", Union (relvar "s") (relvar "s")),
30− relvarId nam = RelationVariable nam UncommittedContextMarker
31+ ("StaticJoin", Right $ relvar "s", Join (relvar "s") (relvar "s"))
31− testInfos = [
32+ ]
32− ("StaticAssign",
33+ databaseOptTests = optDBCTest [
33− Right $ Assign "z" (relvarId "s"),
34+ ("StaticAssign",
34− Assign "z" (Restrict TruePredicate (relvar "s"))
35+ Right $ Assign "z" (relvar "s"),
35− ),
36+ Assign "z" (Restrict TruePredicate (relvar "s"))
36− ("StaticMultipleExpr",
37+ ),
37− Right $ MultipleExpr [Assign "z" (relvarId "s"),
38+ ("StaticMultipleExpr",
38− Assign "z" (relvarId "s")],
39+ Right $ MultipleExpr [Assign "z" (relvar "s"),
39− MultipleExpr [Assign "z" (Restrict TruePredicate (relvar "s")),
40+ Assign "z" (relvar "s")],
40− Assign "z" (Restrict TruePredicate (relvar "s"))])
41+ MultipleExpr [Assign "z" (Restrict TruePredicate (relvar "s")),
41− ]
42+ Assign "z" (Restrict TruePredicate (relvar "s"))])
42− forM_ testInfos $ \(name, expectedExpr, unoptExpr) -> do
43+ ]
43− let optExpr = runGraphRefSOptDatabaseContextExprM transId dateExamples graph (optimizeDatabaseContextExpr unoptExpr)
44− assertEqual name expectedExpr optExpr
45
44
46testTransitiveOptimization :: Test
45testTransitiveOptimization :: Test
47testTransitiveOptimization = TestCase $ do
46testTransitiveOptimization = TestCase $ do
48− (graph, _) <- freshTransactionGraph dateExamples
49 let expr atomexpr = AndPredicate (AttributeEqualityPredicate "a" (NakedAtomExpr (IntegerAtom 300))) (AttributeEqualityPredicate "b" atomexpr)
47 let expr atomexpr = AndPredicate (AttributeEqualityPredicate "a" (NakedAtomExpr (IntegerAtom 300))) (AttributeEqualityPredicate "b" atomexpr)
50 exprIn = expr (AttributeAtomExpr "a")
48 exprIn = expr (AttributeAtomExpr "a")
51 exprOut = expr (NakedAtomExpr (IntegerAtom 300))
49 exprOut = expr (NakedAtomExpr (IntegerAtom 300))
52− optExpr = runGraphRefSOptRelationalExprM Nothing graph (applyStaticPredicateOptimization exprIn)
50+ assertEqual "transitive property" (Right exprOut) (runReader (applyStaticPredicateOptimization exprIn) (RelationalExprStateElems dateExamples))
53− assertEqual "transitive property" (Right exprOut) optExpr
51+
54−
52+optRelExpr :: RelationalExpr -> Either RelationalError RelationalExpr
55−
53+optRelExpr expr = runReader (applyStaticRelationalOptimization expr) (RelationalExprStateElems dateExamples)
56−testOptimizeRelationalExpr :: Test
57−testOptimizeRelationalExpr = TestCase $ do
58− (graph, _) <- freshTransactionGraph dateExamples
59− let relvarId nam = RelationVariable nam UncommittedContextMarker
60− relationOptTests = [
61− ("StaticProject",
62− Right $ relvarId "s",
63− Project (AttributeNames (attributeNames suppliersRel)) (relvarId "s")),
64− ("StaticUnion",
65− Right $ relvarId "s",
66− Union (relvarId "s") (relvarId "s")),
67− ("StaticJoin",
68− Right $ relvarId "s",
69− Join (relvarId "s") (relvarId "s"))
70− ]
71− forM_ relationOptTests $ \(name, expr, unoptExpr) -> do
72− let optExpr = runGraphRefSOptRelationalExprM (Just dateExamples) graph (optimizeGraphRefRelationalExpr unoptExpr)
73− assertEqual name expr optExpr
74
54
75testImpossiblePredicates :: Test
55testImpossiblePredicates :: Test
76testImpossiblePredicates = TestCase $ do
56testImpossiblePredicates = TestCase $ do
77− (graph, _) <- freshTransactionGraph dateExamples
78 let tautTrue = Restrict (AtomExprPredicate (NakedAtomExpr (BoolAtom True))) rel
57 let tautTrue = Restrict (AtomExprPredicate (NakedAtomExpr (BoolAtom True))) rel
79 tautTrue2 = Restrict TruePredicate rel
58 tautTrue2 = Restrict TruePredicate rel
80 tautFalse = Restrict (AtomExprPredicate (NakedAtomExpr (BoolAtom False))) rel
59 tautFalse = Restrict (AtomExprPredicate (NakedAtomExpr (BoolAtom False))) rel
81 tautFalse2 = Restrict (NotPredicate TruePredicate) rel
60 tautFalse2 = Restrict (NotPredicate TruePredicate) rel
82 emptyRel = MakeStaticRelation (attributes suppliersRel) emptyTupleSet
61 emptyRel = MakeStaticRelation (attributes suppliersRel) emptyTupleSet
83− rel = RelationVariable "s" UncommittedContextMarker
62+ rel = RelationVariable "s" ()
84− optRelExpr expr = optimizeGraphRefRelationalExpr' (Just dateExamples) graph expr
85 assertEqual "remove tautology where true" (Right rel) (optRelExpr tautTrue)
63 assertEqual "remove tautology where true" (Right rel) (optRelExpr tautTrue)
86 assertEqual "remove tautology where true2" (Right rel) (optRelExpr tautTrue2)
64 assertEqual "remove tautology where true2" (Right rel) (optRelExpr tautTrue2)
87 assertEqual "remove tautology where false" (Right emptyRel) (optRelExpr tautFalse)
65 assertEqual "remove tautology where false" (Right emptyRel) (optRelExpr tautFalse)
88 assertEqual "remove tautology where false2" (Right emptyRel) (optRelExpr tautFalse2)
66 assertEqual "remove tautology where false2" (Right emptyRel) (optRelExpr tautFalse2)
67+
68+optJoinExpr :: RelationalExpr -> Either RelationalError RelationalExpr
69+optJoinExpr expr = runReader (applyStaticJoinElimination expr) (RelationalExprStateElems dateExamples)
89
70
90testJoinElimination :: Test
71testJoinElimination :: Test
91testJoinElimination = TestCase $ do
72testJoinElimination = TestCase $ do
92− (graph, _) <- freshTransactionGraph dateExamples
93− let marker = UncommittedContextMarker
94− optJoinExpr expr = runGraphRefSOptRelationalExprM (Just dateExamples) graph (applyStaticJoinElimination expr)
95− relvar rv = RelationVariable rv marker
96−
97 -- (s join sp){s#,qty,p#} == sp
73 -- (s join sp){s#,qty,p#} == sp
98− let unoptExpr = Project (AttributeNames (S.fromList ["p#", "qty", "s#"])) (Join (relvar "sp") (relvar "s"))
74+ let unoptExpr = Project (AttributeNames (S.fromList ["p#", "qty", "s#"])) (Join (RelationVariable "sp" ()) (RelationVariable "s" ()))
99− assertEqual "remove extraneous join" (Right (relvar "sp")) (optJoinExpr unoptExpr)
75+ assertEqual "remove extraneous join" (Right (RelationVariable "sp" ())) (optJoinExpr unoptExpr)
100
76
101-- (sp join s){s#,qty,p#} == sp --flip relvar names
77-- (sp join s){s#,qty,p#} == sp --flip relvar names
102− let unoptExpr2 = Project (AttributeNames (S.fromList ["p#", "qty", "s#"])) (Join (relvar "s") (relvar "sp"))
78+ let unoptExpr2 = Project (AttributeNames (S.fromList ["p#", "qty", "s#"])) (Join (RelationVariable "s" ()) (RelationVariable "sp" ()))
103− assertEqual "remove extraneous join2" (Right (relvar "sp")) (optJoinExpr unoptExpr2)
79+ assertEqual "remove extraneous join2" (Right (RelationVariable "sp" ())) (optJoinExpr unoptExpr2)
104
80
105-- (sp join s){s#,qty,sname} != sp - attribute from s included
81-- (sp join s){s#,qty,sname} != sp - attribute from s included
106− let expr3 = Project (AttributeNames (S.fromList ["p#", "qty", "sname"])) (Join (relvar "sp") (relvar "s"))
82+ let expr3 = Project (AttributeNames (S.fromList ["p#", "qty", "sname"])) (Join (RelationVariable "sp" ()) (RelationVariable "s" ()))
107 assertEqual "retain join" (Right expr3) (optJoinExpr expr3)
83 assertEqual "retain join" (Right expr3) (optJoinExpr expr3)
108
84
109 -- (sp join s){qty} != sp --projection does not include foreign key attribute
85 -- (sp join s){qty} != sp --projection does not include foreign key attribute
110− let expr4 = Project (AttributeNames (S.singleton "qty")) (Join (relvar "sp") (relvar "s"))
86+ let expr4 = Project (AttributeNames (S.singleton "qty")) (Join (RelationVariable "sp" ()) (RelationVariable "s" ()))
111 assertEqual "retain join2" (Right expr4) (optJoinExpr expr4)
87 assertEqual "retain join2" (Right expr4) (optJoinExpr expr4)
112
88
113 -- (sp join s){s#,qty} == sp - a subset of attributes in the projection are in the foreign key
89 -- (sp join s){s#,qty} == sp - a subset of attributes in the projection are in the foreign key
114− let expr5 = Project (AttributeNames (S.fromList ["s#", "qty"])) (Join (relvar "sp") (relvar "s"))
90+ let expr5 = Project (AttributeNames (S.fromList ["s#", "qty"])) (Join (RelationVariable "sp" ()) (RelationVariable "s" ()))
115− let expect5 = Project (AttributeNames (S.fromList ["s#", "qty"])) (relvar "sp")
91+ let expect5 = Project (AttributeNames (S.fromList ["s#", "qty"])) (RelationVariable "sp" ())
116 assertEqual "remove extraneous join (attribute subset)" (Right expect5) (optJoinExpr expr5)
92 assertEqual "remove extraneous join (attribute subset)" (Right expect5) (optJoinExpr expr5)
117
93
118 -- (s join p){s#,p#} != sp -- no foreign key
94 -- (s join p){s#,p#} != sp -- no foreign key
119− let expr6 = Project (AttributeNames (S.fromList ["s#", "p#"])) (Join (relvar "s") (relvar "p"))
95+ let expr6 = Project (AttributeNames (S.fromList ["s#", "p#"])) (Join (RelationVariable "s" ()) (RelationVariable "p" ()))
120 assertEqual "retain join- no foreign key" (Right expr6) (optJoinExpr expr6)
96 assertEqual "retain join- no foreign key" (Right expr6) (optJoinExpr expr6)
121
97
122 -- (s join p){s#,qty,p#,sname} != sp -- all sp attributes plus one s attributes
98 -- (s join p){s#,qty,p#,sname} != sp -- all sp attributes plus one s attributes
123− let expr7 = Project (AttributeNames (S.fromList ["s#", "p#", "qty", "sname"])) (Join (relvar "s") (relvar "sp"))
99+ let expr7 = Project (AttributeNames (S.fromList ["s#", "p#", "qty", "sname"])) (Join (RelationVariable "s" ()) (RelationVariable "sp" ()))
124 assertEqual "retain join- attributes from both relvars" (Right expr7) (optJoinExpr expr7)
100 assertEqual "retain join- attributes from both relvars" (Right expr7) (optJoinExpr expr7)
125
101
126testRestrictionPredicateCollapse :: Test
102testRestrictionPredicateCollapse :: Test
127testRestrictionPredicateCollapse = TestCase $ do
103testRestrictionPredicateCollapse = TestCase $ do
128 let expr1 = Restrict (NotPredicate TruePredicate) rv
104 let expr1 = Restrict (NotPredicate TruePredicate) rv
129− rv = RelationVariable "a" UncommittedContextMarker
105+ rv = RelationVariable "a" ()
130− relvar name = RelationVariable name UncommittedContextMarker
131 assertEqual "one restriction" expr1 (applyStaticRestrictionCollapse expr1)
106 assertEqual "one restriction" expr1 (applyStaticRestrictionCollapse expr1)
132
107
133 let attrEqualsPred = AttributeEqualityPredicate "x" (NakedAtomExpr (IntAtom 3))
108 let attrEqualsPred = AttributeEqualityPredicate "x" (NakedAtomExpr (IntAtom 3))
134− expr2 = Restrict TruePredicate (Restrict attrEqualsPred (relvar "a"))
109+ expr2 = Restrict TruePredicate (Restrict attrEqualsPred (RelationVariable "a" ()))
135− assertEqual "two restrictions" (Restrict (AndPredicate TruePredicate attrEqualsPred) (relvar "a")) (applyStaticRestrictionCollapse expr2)
110+ assertEqual "two restrictions" (Restrict (AndPredicate TruePredicate attrEqualsPred) (RelationVariable "a" ())) (applyStaticRestrictionCollapse expr2)
136
111
137− let expr3 = Restrict pred1 (Restrict pred2 (Restrict pred3 (relvar "a")))
112+ let expr3 = Restrict pred1 (Restrict pred2 (Restrict pred3 (RelationVariable "a" ())))
138 pred1 = NotPredicate TruePredicate
113 pred1 = NotPredicate TruePredicate
139 pred2 = attrEqualsPred
114 pred2 = attrEqualsPred
140 pred3 = AtomExprPredicate (NakedAtomExpr (BoolAtom True))
115 pred3 = AtomExprPredicate (NakedAtomExpr (BoolAtom True))
@@ -148,15 +123,16 @@ testRestrictionPredicateCollapse = TestCase $ do
148testPushDownRestrictionPredicate :: Test
123testPushDownRestrictionPredicate :: Test
149testPushDownRestrictionPredicate = TestCase $ do
124testPushDownRestrictionPredicate = TestCase $ do
150 -- (s union relation{tuple{city "Boston", s# "S6", sname "Stevens", status 50}}) where status = 30 == (s where status=30) union (relation{tuple{city "Boston", s# "S6", sname "Stevens", status 50}} where status=30)
125 -- (s union relation{tuple{city "Boston", s# "S6", sname "Stevens", status 50}}) where status = 30 == (s where status=30) union (relation{tuple{city "Boston", s# "S6", sname "Stevens", status 50}} where status=30)
151− let rvs = RelationVariable "s" UncommittedContextMarker
126+ let rvs = RelationVariable "s" ()
152− let status30 = AttributeEqualityPredicate "status" (NakedAtomExpr (IntAtom 30))
127+ stevens <- case mkRelationFromList (attributes suppliersRel) [
153− relationsOrError = do
128+ [TextAtom "S6", TextAtom "Stevens", IntegerAtom 50, TextAtom "Boston"]] of
154− stevens <- mkRelationFromList (attributes suppliersRel) [[TextAtom "S6", TextAtom "Stevens", IntegerAtom 50, TextAtom "Boston"]]
129+ Left err -> assertFailure ("stevens relation: " ++ show err) >> pure relationTrue
155− let expectedExpr1 = Union (Restrict status30 rvs) (Restrict status30 (ExistingRelation stevens))
130+ Right rel -> pure rel
156− expr1 = Restrict status30 (Union rvs (ExistingRelation stevens))
131+ let expr1 = Restrict status30 (Union rvs (ExistingRelation stevens))
132+ status30 = AttributeEqualityPredicate "status" (NakedAtomExpr (IntAtom 30))
157
133
158− pure (expectedExpr1, applyStaticRestrictionPushdown expr1)
134+ expectedExpr1 = Union (Restrict status30 rvs) (Restrict status30 (ExistingRelation stevens))
159− either (assertFailure . (++) "stevens relation: " . show) (uncurry $ assertEqual "union restriction pushdown") relationsOrError
135+ assertEqual "union restriction pushdown" expectedExpr1 (applyStaticRestrictionPushdown expr1)
160
136
161 -- s{sname,city} where city="London" == (s where city="London"){sname,city}
137 -- s{sname,city} where city="London" == (s where city="London"){sname,city}
162 let expr2 = Restrict whereLondon (Project projAttrs2 rvs)
138 let expr2 = Restrict whereLondon (Project projAttrs2 rvs)
@@ -168,4 +144,4 @@ testPushDownRestrictionPredicate = TestCase $ do
168 -- (s where city="London"){sname} != s{sname} where city="London" (no "city" attribute at projection time)
144 -- (s where city="London"){sname} != s{sname} where city="London" (no "city" attribute at projection time)
169 let expr3 = Project projAttrs3 (Restrict whereLondon rvs)
145 let expr3 = Project projAttrs3 (Restrict whereLondon rvs)
170 projAttrs3 = AttributeNames (S.singleton "sname")
146 projAttrs3 = AttributeNames (S.singleton "sname")
171− assertEqual "projection restriction no-pushdown" expr3 (applyStaticRestrictionPushdown expr3)
147+ assertEqual "projection restriction no-pushdown" expr3 (applyStaticRestrictionPushdown expr3)
test/Relation/Tupleable.hs+10−271
@@ -1,29 +1,17 @@
1−{-# LANGUAGE
1+{-# LANGUAGE DeriveGeneric, FlexibleInstances, FlexibleContexts, TypeOperators, DeriveAnyClass #-}
2− DeriveGeneric
3− , FlexibleInstances
4− , FlexibleContexts
5− , DeriveAnyClass
6− , ScopedTypeVariables
7− , TypeApplications
8− , DataKinds
9− , TypeOperators
10− , AllowAmbiguousTypes
11− , DerivingVia
12− #-}
13import Test.HUnit
2import Test.HUnit
14−import ProjectM36.Tupleable.Deriving
3+import ProjectM36.Tupleable
15import ProjectM36.Atomable
4import ProjectM36.Atomable
16−import ProjectM36.Attribute as A
5+import ProjectM36.Attribute
17−import ProjectM36.Error
6+import Data.Binary
18import ProjectM36.Base
7import ProjectM36.Base
19import Control.DeepSeq (NFData)
8import Control.DeepSeq (NFData)
9+import GHC.Generics
20import qualified Data.Vector as V
10import qualified Data.Vector as V
21import qualified Data.Map as M
11import qualified Data.Map as M
22import qualified Data.Text as T
12import qualified Data.Text as T
23−import qualified Data.Set as S
24import System.Exit
13import System.Exit
25import Data.Proxy
14import Data.Proxy
26−import Codec.Winery
27
15
28{-# ANN module ("Hlint: ignore Use newtype instead of data" :: String) #-}
16{-# ANN module ("Hlint: ignore Use newtype instead of data" :: String) #-}
29
17
@@ -31,60 +19,35 @@ data Test1T = Test1C {
31 attrA :: Integer
19 attrA :: Integer
32 }
20 }
33 deriving (Generic, Eq, Show)
21 deriving (Generic, Eq, Show)
34− deriving Serialise via WineryRecord Test1T
35
22
36data Test2T = Test2C {
23data Test2T = Test2C {
37 attrB :: Integer,
24 attrB :: Integer,
38 attrC :: Integer
25 attrC :: Integer
39 }
26 }
40 deriving (Generic, Eq, Show)
27 deriving (Generic, Eq, Show)
41− deriving Serialise via WineryRecord Test2T
42
28
43data Test3T = Test3C Integer
29data Test3T = Test3C Integer
44 deriving (Generic, Eq, Show)
30 deriving (Generic, Eq, Show)
45− deriving Serialise via WineryVariant Test3T
46
31
47data Test4T = Test4C
32data Test4T = Test4C
48 deriving (Generic, Eq, Show)
33 deriving (Generic, Eq, Show)
49− deriving Serialise via WineryVariant Test4T
50
34
51data Test5T = Test5C1 Integer |
35data Test5T = Test5C1 Integer |
52 Test5C2 Integer
36 Test5C2 Integer
53 deriving (Generic, Eq, Show)
37 deriving (Generic, Eq, Show)
54− deriving Serialise via WineryVariant Test5T
55
38
56data Test6T = Test6C T.Text Integer Double
39data Test6T = Test6C T.Text Integer Double
57 deriving (Generic, Eq, Show)
40 deriving (Generic, Eq, Show)
58
41
59data Test7A = Test7AC Integer
42data Test7A = Test7AC Integer
60− deriving (Generic, Show, Eq, NFData, Atomable)
43+ deriving (Generic, Show, Eq, Binary, NFData, Atomable)
61− deriving Serialise via WineryVariant Test7A
62
44
63
45
64data Test7T = Test7C Test7A
46data Test7T = Test7C Test7A
65 deriving (Generic, Show, Eq)
47 deriving (Generic, Show, Eq)
66− deriving Serialise via WineryVariant Test7T
67
48
68data Test8T = Test8C
49data Test8T = Test8C
69 deriving (Generic, Show, Eq)
50 deriving (Generic, Show, Eq)
70− deriving Serialise via WineryVariant Test8T
71−
72−data Test9T = Test9C
73− {
74− attr9A :: Integer,
75− attr9B :: T.Text,
76− attr9C :: Double
77− }
78− deriving (Generic, Show, Eq)
79− deriving Serialise via WineryRecord Test9T
80−
81−data Test10T = Test10C {
82− longAttrNameA10 :: Integer,
83− long_attr_name_b10 :: Integer,
84− longMixed_attr_NameC10 :: Integer
85− }
86− deriving (Generic, Show, Eq)
87− deriving Serialise via WineryRecord Test10T
88
51
89instance Tupleable Test1T
52instance Tupleable Test1T
90
53
@@ -102,21 +65,20 @@ instance Tupleable Test7T
102
65
103instance Tupleable Test8T
66instance Tupleable Test8T
104
67
105−instance Tupleable Test9T
106−
107main :: IO ()
68main :: IO ()
108main = do
69main = do
109 tcounts <- runTestTT testList
70 tcounts <- runTestTT testList
110 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
71 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
111
72
112testList :: Test
73testList :: Test
113−testList = TestList [testADT1, testADT2, testADT3, testADT4, testADT6, testADT7, testADT8 ,testInsertExpr, testDefineExpr, testUpdateExpr, testUpdateExprEmptyAttrs, testDeleteExpr, testUpdateExprWrongAttr, testReorderedTuple, testAddPrefixField, testDropPrefixField, testAddSuffixField, testDropSuffixField, testUpperCaseField, testLowerCaseField, testTitleCaseField, testCamelCaseField, testPascalCaseField, testSnakeCaseField, testSpinalCaseField, testTrainCaseField, testAsIsCodec, testAsIsField, testComposeRLCodec, testComposeRLField, testComposeLRCodec, testComposeLRField]
74+testList = TestList [testADT1, testADT2, testADT3, testADT4, testADT6, testADT7, testADT8]
114
75
115testADT1 :: Test
76testADT1 :: Test
116testADT1 = TestCase $ assertEqual "one record constructor" (Right example) (fromTuple (toTuple example))
77testADT1 = TestCase $ assertEqual "one record constructor" (Right example) (fromTuple (toTuple example))
117 where
78 where
118 example = Test1C {attrA = 3}
79 example = Test1C {attrA = 3}
119
80
81+
120testADT2 :: Test
82testADT2 :: Test
121testADT2 = TestCase $ do
83testADT2 = TestCase $ do
122 let example = Test2C { attrB = 4, attrC = 6 }
84 let example = Test2C { attrB = 4, attrC = 6 }
@@ -148,233 +110,10 @@ testADT7 :: Test
148testADT7 = TestCase $ do
110testADT7 = TestCase $ do
149 let example = Test7C (Test7AC 3)
111 let example = Test7C (Test7AC 3)
150 assertEqual "atom type" (Right example) (fromTuple (toTuple example))
112 assertEqual "atom type" (Right example) (fromTuple (toTuple example))
151− let expectedAttrs = A.singleton (Attribute "" (ConstructedAtomType "Test7A" M.empty))
113+ let expectedAttrs = V.singleton (Attribute "" (ConstructedAtomType "Test7A" M.empty))
152 assertEqual "adt atomtype" expectedAttrs (toAttributes (Proxy :: Proxy Test7T))
114 assertEqual "adt atomtype" expectedAttrs (toAttributes (Proxy :: Proxy Test7T))
153
115
154testADT8 :: Test
116testADT8 :: Test
155testADT8 = TestCase $ assertEqual "single value" (Right example) (fromTuple (toTuple example))
117testADT8 = TestCase $ assertEqual "single value" (Right example) (fromTuple (toTuple example))
156 where
118 where
157− example = Test8C
119+ example = Test8C
158−
159−testInsertExpr :: Test
160−testInsertExpr = TestCase $ assertEqual "insert expr" expected (toInsertExpr [Test9C {
161− attr9A = 4,
162− attr9B = "a",
163− attr9C = 3.4}] "rv")
164− where expected = Right (Insert "rv" (MakeStaticRelation attrs tuples))
165− attrs = attributesFromList [Attribute "attr9A" IntegerAtomType,
166− Attribute "attr9B" TextAtomType,
167− Attribute "attr9C" DoubleAtomType]
168− tuples = RelationTupleSet [RelationTuple attrs (V.fromList [IntegerAtom 4,
169− TextAtom "a",
170− DoubleAtom 3.4])]
171−
172−testDefineExpr :: Test
173−testDefineExpr = TestCase $ assertEqual "define expr" expected actual
174− where
175− expected = Define "rv" (map NakedAttributeExpr attrs)
176− attrs = [Attribute "attr9A" IntegerAtomType,
177− Attribute "attr9B" TextAtomType,
178− Attribute "attr9C" DoubleAtomType]
179− actual = toDefineExpr (Proxy :: Proxy Test9T) "rv"
180−
181−testUpdateExpr :: Test
182−testUpdateExpr = TestCase $ do
183− let expected = Right (Update "rv" updateMap restriction)
184− updateMap = M.fromList [("attr9B", NakedAtomExpr (TextAtom "b")),
185− ("attr9C", NakedAtomExpr (DoubleAtom 5.5))]
186− restriction = AttributeEqualityPredicate "attr9A" (NakedAtomExpr (IntegerAtom 5))
187− actual = toUpdateExpr "rv" ["attr9A"] Test9C {attr9A = 5,
188− attr9B = "b",
189− attr9C = 5.5}
190−
191− assertEqual "update expr1" expected actual
192−
193−testUpdateExprEmptyAttrs :: Test
194−testUpdateExprEmptyAttrs = TestCase $ do
195− let expected = Left EmptyAttributesError
196− actual = toUpdateExpr "rv" [] Test9C {attr9A = 5,
197− attr9B = "b",
198− attr9C = 5.5}
199− assertEqual "update with empty attrs" expected actual
200−
201−testUpdateExprWrongAttr :: Test
202−testUpdateExprWrongAttr = TestCase $ do
203− --currently, passing in the wrong attribute replaces the whole relvar with a single tuple- is this what we want?
204− let expected = Left (NoSuchAttributeNamesError (S.singleton "nonexistentattr"))
205− actual = toUpdateExpr "rv" ["nonexistentattr"] Test9C {attr9A = 5,
206− attr9B = "b",
207− attr9C = 5.5}
208− assertEqual "update with wrong attr" expected actual
209−
210−testDeleteExpr :: Test
211−testDeleteExpr = TestCase $ do
212− let expected = Right (Delete "rv" (AndPredicate (AttributeEqualityPredicate "attr9A"
213− (NakedAtomExpr (IntegerAtom 5)))
214− (AttributeEqualityPredicate "attr9B"
215− (NakedAtomExpr (TextAtom "b")))))
216− actual = toDeleteExpr "rv" ["attr9A", "attr9B"] Test9C {attr9A = 5,
217− attr9B = "b",
218− attr9C = 5.5}
219− assertEqual "delete expr" expected actual
220−
221−--discovered in #184 by ruhatch
222−testReorderedTuple :: Test
223−testReorderedTuple = TestCase $ do
224− let tupleRev :: RelationTuple -> RelationTuple
225− tupleRev (RelationTuple v1 v2) = RelationTuple (revAttrs v1) (V.reverse v2)
226− revAttrs attrs = A.attributesFromList (reverse (A.toList attrs))
227− expected = Test2C {attrB = 3,
228− attrC = 4}
229− actual = fromTuple . tupleRev . toTuple $ expected
230− assertEqual "reordered tuple" (Right expected) actual
231−
232−testCodec :: forall tag. ModifyOptions tag => String -> [AttributeName] -> Test
233−testCodec msg expected = TestCase $
234− assertEqual msg (S.fromList expected) actual
235− where
236− actual = attributeNameSet $ toAttributes (Proxy :: Proxy (Codec tag Test10T))
237−
238−testAddPrefixField :: Test
239−testAddPrefixField = testCodec
240− @(Field (AddPrefix "prefix_"))
241− "codec field add prefix attributes"
242− ["prefix_longAttrNameA10",
243− "prefix_long_attr_name_b10",
244− "prefix_longMixed_attr_NameC10"]
245−
246−testDropPrefixField :: Test
247−testDropPrefixField = testCodec
248− @(Field (DropPrefix "long"))
249− "codec field drop prefix"
250− ["AttrNameA10",
251− "_attr_name_b10",
252− "Mixed_attr_NameC10"]
253−
254−testAddSuffixField :: Test
255−testAddSuffixField = testCodec
256− @(Field (AddSuffix "_suffix"))
257− "codec field add suffix"
258− ["longAttrNameA10_suffix",
259− "long_attr_name_b10_suffix",
260− "longMixed_attr_NameC10_suffix"]
261−
262−testDropSuffixField :: Test
263−testDropSuffixField = testCodec
264− @(Field (DropSuffix "10"))
265− "codec field drop suffix"
266− ["longAttrNameA",
267− "long_attr_name_b",
268− "longMixed_attr_NameC"]
269−
270−testUpperCaseField :: Test
271−testUpperCaseField = testCodec
272− @(Field UpperCase)
273− "codec field uppercase"
274− ["LONGATTRNAMEA10",
275− "LONG_ATTR_NAME_B10",
276− "LONGMIXED_ATTR_NAMEC10"]
277−
278−testLowerCaseField :: Test
279−testLowerCaseField = testCodec
280− @(Field LowerCase)
281− "codec field lowercase"
282− ["longattrnamea10",
283− "long_attr_name_b10",
284− "longmixed_attr_namec10"]
285−
286−testTitleCaseField :: Test
287−testTitleCaseField = testCodec
288− @(Field TitleCase)
289− "codec field title case"
290− ["Long Attr Name A10",
291− "Long Attr Name B10",
292− "Long Mixed Attr Name C10"]
293−
294−testCamelCaseField :: Test
295−testCamelCaseField = testCodec
296− @(Field CamelCase)
297− "codec field camel case"
298− ["longAttrNameA10",
299− "longAttrNameB10",
300− "longMixedAttrNameC10"]
301−
302−testPascalCaseField :: Test
303−testPascalCaseField = testCodec
304− @(Field PascalCase)
305− "codec field pascal case"
306− ["LongAttrNameA10",
307− "LongAttrNameB10",
308− "LongMixedAttrNameC10"]
309−
310−testSnakeCaseField :: Test
311−testSnakeCaseField = testCodec
312− @(Field SnakeCase)
313− "codec field snake case"
314− ["long_attr_name_a10",
315− "long_attr_name_b10",
316− "long_mixed_attr_name_c10"]
317−
318−testSpinalCaseField :: Test
319−testSpinalCaseField = testCodec
320− @(Field SpinalCase)
321− "codec field spinal case"
322− ["long-attr-name-a10",
323− "long-attr-name-b10",
324− "long-mixed-attr-name-c10"]
325−
326−testTrainCaseField :: Test
327−testTrainCaseField = testCodec
328− @(Field TrainCase)
329− "codec field train case"
330− ["Long-Attr-Name-A10",
331− "Long-Attr-Name-B10",
332− "Long-Mixed-Attr-Name-C10"]
333−
334−testAsIsCodec :: Test
335−testAsIsCodec = testCodec
336− @AsIs
337− "codec as is"
338− ["longAttrNameA10",
339− "long_attr_name_b10",
340− "longMixed_attr_NameC10"]
341−
342−testAsIsField :: Test
343−testAsIsField = testCodec
344− @(Field AsIs)
345− "codec field as is"
346− ["longAttrNameA10",
347− "long_attr_name_b10",
348− "longMixed_attr_NameC10"]
349−
350−testComposeRLCodec :: Test
351−testComposeRLCodec = testCodec
352− @(Field UpperCase <<< Field (DropPrefix "long"))
353− "codec (<<<)"
354− ["ATTRNAMEA10",
355− "_ATTR_NAME_B10",
356− "MIXED_ATTR_NAMEC10"]
357−
358−testComposeRLField :: Test
359−testComposeRLField = testCodec
360− @(Field (UpperCase <<< DropPrefix "long"))
361− "codec field (<<<)"
362− ["ATTRNAMEA10",
363− "_ATTR_NAME_B10",
364− "MIXED_ATTR_NAMEC10"]
365−
366−testComposeLRCodec :: Test
367−testComposeLRCodec = testCodec
368− @(Field (DropPrefix "long") >>> Field UpperCase)
369− "codec (>>>)"
370− ["ATTRNAMEA10",
371− "_ATTR_NAME_B10",
372− "MIXED_ATTR_NAMEC10"]
373−
374−testComposeLRField :: Test
375−testComposeLRField = testCodec
376− @(Field (DropPrefix "long" >>> UpperCase))
377− "codec field (>>>)"
378− ["ATTRNAMEA10",
379− "_ATTR_NAME_B10",
380− "MIXED_ATTR_NAMEC10"]
test/Server/Main.hs+29−46
@@ -5,6 +5,7 @@ test client/server interaction
5import Test.HUnit
5import Test.HUnit
6import ProjectM36.Client
6import ProjectM36.Client
7import qualified ProjectM36.Client as C
7import qualified ProjectM36.Client as C
8+import ProjectM36.Server.EntryPoints
8import ProjectM36.Server
9import ProjectM36.Server
9import ProjectM36.Server.Config
10import ProjectM36.Server.Config
10import ProjectM36.Relation
11import ProjectM36.Relation
@@ -13,18 +14,17 @@ import ProjectM36.IsomorphicSchema
13import ProjectM36.Base
14import ProjectM36.Base
14
15
15import System.Exit
16import System.Exit
16−import Network.Socket (SockAddr(..))
17+
17import Control.Concurrent
18import Control.Concurrent
19+import Network.Transport (EndPointAddress)
20+import Network.Transport.TCP (encodeEndPointAddress, decodeEndPointAddress)
18import Data.Either (isRight)
21import Data.Either (isRight)
19import Control.Exception
22import Control.Exception
20−import System.IO.Temp
23+--import Control.Monad.IO.Class
21−import System.FilePath
22#if defined(linux_HOST_OS)
24#if defined(linux_HOST_OS)
23import System.Directory
25import System.Directory
24#endif
26#endif
25
27
26−type Timeout = Int
27−
28testList :: SessionId -> Connection -> MVar () -> Test
28testList :: SessionId -> Connection -> MVar () -> Test
29testList sessionId conn notificationTestMVar = TestList $ serverTests ++ sessionTests
29testList sessionId conn notificationTestMVar = TestList $ serverTests ++ sessionTests
30 where
30 where
@@ -42,8 +42,8 @@ testList sessionId conn notificationTestMVar = TestList $ serverTests ++ session
42 testRelationVariableSummary,
42 testRelationVariableSummary,
43 testNotification notificationTestMVar
43 testNotification notificationTestMVar
44 ]
44 ]
45− serverTests = [testRequestTimeout, testFileDescriptorCount, testClientConnectFail]
45+ serverTests = [testRequestTimeout, testFileDescriptorCount]
46−
46+
47main :: IO ()
47main :: IO ()
48main = do
48main = do
49 (serverAddress, _) <- launchTestServer 0
49 (serverAddress, _) <- launchTestServer 0
@@ -62,9 +62,11 @@ main = do
62testDatabaseName :: DatabaseName
62testDatabaseName :: DatabaseName
63testDatabaseName = "test"
63testDatabaseName = "test"
64
64
65−testConnection :: Port -> MVar () -> IO (Either ConnectionError (SessionId, Connection))
65+testConnection :: EndPointAddress -> MVar () -> IO (Either ConnectionError (SessionId, Connection))
66−testConnection serverPort mvar = do
66+testConnection serverAddress mvar = do
67− let connInfo = RemoteConnectionInfo testDatabaseName "127.0.0.1" (show serverPort) (testNotificationCallback mvar)
67+ let Just (host, service, _) = decodeEndPointAddress serverAddress
68+ serverAddress' = encodeEndPointAddress host service 1
69+ let connInfo = RemoteProcessConnectionInfo testDatabaseName (NodeId serverAddress') (testNotificationCallback mvar)
68 --putStrLn ("testConnection: " ++ show serverAddress)
70 --putStrLn ("testConnection: " ++ show serverAddress)
69 eConn <- connectProjectM36 connInfo
71 eConn <- connectProjectM36 connInfo
70 case eConn of
72 case eConn of
@@ -76,23 +78,18 @@ testConnection serverPort mvar = do
76 Right sessionId -> pure $ Right (sessionId, conn)
78 Right sessionId -> pure $ Right (sessionId, conn)
77
79
78-- | A version of 'launchServer' which returns the port on which the server is listening on a secondary thread
80-- | A version of 'launchServer' which returns the port on which the server is listening on a secondary thread
79−launchTestServer :: Timeout -> IO (Port, ThreadId)
81+launchTestServer :: Timeout -> IO (EndPointAddress, ThreadId)
80launchTestServer ti = do
82launchTestServer ti = do
83+ let config = defaultServerConfig { databaseName = testDatabaseName,
84+ perRequestTimeout = ti,
85+ testMode = True,
86+ bindPort = 0
87+ }
81 addressMVar <- newEmptyMVar
88 addressMVar <- newEmptyMVar
82− tid <- forkIO $
89+ tid <- forkIO $ launchServer config (Just addressMVar) >> pure ()
83− withSystemTempDirectory "projectm36test" $ \tempdir -> do
90+ endPointAddress <- takeMVar addressMVar
84− let config = defaultServerConfig { databaseName = testDatabaseName,
85− persistenceStrategy = CrashSafePersistence (tempdir </> "db"),
86− perRequestTimeout = ti,
87− testMode = True,
88− bindPort = 0,
89− checkFS = False --not stricly needed for these tests
90− }
91−
92− launchServer config (Just addressMVar) >> pure ()
93− (SockAddrInet port _) <- takeMVar addressMVar
94 --liftIO $ putStrLn ("launched server on " ++ show endPointAddress)
91 --liftIO $ putStrLn ("launched server on " ++ show endPointAddress)
95− pure (fromIntegral port, tid)
92+ pure (endPointAddress, tid)
96
93
97testRelationalExpr :: SessionId -> Connection -> Test
94testRelationalExpr :: SessionId -> Connection -> Test
98testRelationalExpr sessionId conn = TestCase $ do
95testRelationalExpr sessionId conn = TestCase $ do
@@ -138,11 +135,10 @@ testPlanForDatabaseContextExpr sessionId conn = TestCase $ do
138 let attrExprs = [AttributeAndTypeNameExpr "x" (PrimitiveTypeConstructor "Int" IntAtomType) ()]
135 let attrExprs = [AttributeAndTypeNameExpr "x" (PrimitiveTypeConstructor "Int" IntAtomType) ()]
139 testrv = "testrv"
136 testrv = "testrv"
140 dbExpr = Define testrv attrExprs
137 dbExpr = Define testrv attrExprs
141− expected = Define testrv [AttributeAndTypeNameExpr "x" (PrimitiveTypeConstructor "Int" IntAtomType) UncommittedContextMarker]
142 planResult <- planForDatabaseContextExpr sessionId conn dbExpr
138 planResult <- planForDatabaseContextExpr sessionId conn dbExpr
143 case planResult of
139 case planResult of
144 Left err -> assertFailure (show err)
140 Left err -> assertFailure (show err)
145− Right plan -> assertEqual "planForDatabaseContextExpr failure" expected plan
141+ Right plan -> assertEqual "planForDatabaseContextExpr failure" dbExpr plan
146
142
147testTransactionGraphAsRelation :: SessionId -> Connection -> Test
143testTransactionGraphAsRelation :: SessionId -> Connection -> Test
148testTransactionGraphAsRelation sessionId conn = TestCase $ do
144testTransactionGraphAsRelation sessionId conn = TestCase $ do
@@ -208,41 +204,28 @@ testRequestTimeout = TestCase $ do
208 Left err -> putStrLn ("failed to connect: " ++ show err) >> exitFailure
204 Left err -> putStrLn ("failed to connect: " ++ show err) >> exitFailure
209 Right (session, testConn) -> do
205 Right (session, testConn) -> do
210 res <- catchJust (\exc -> if exc == RequestTimeoutException then Just exc else Nothing) (callTestTimeout_ session testConn) (const (pure False))
206 res <- catchJust (\exc -> if exc == RequestTimeoutException then Just exc else Nothing) (callTestTimeout_ session testConn) (const (pure False))
211− assertBool "timeout exception was not thrown" (not res)
207+ assertBool "exception was not thrown" (not res)
212 killThread serverTid
208 killThread serverTid
213
209
214testFileDescriptorCount :: Test
210testFileDescriptorCount :: Test
215#if defined(linux_HOST_OS)
211#if defined(linux_HOST_OS)
216--validate that creating a server, connecting a client, and then disconnecting doesn't leak file descriptors
212--validate that creating a server, connecting a client, and then disconnecting doesn't leak file descriptors
217testFileDescriptorCount = TestCase $ do
213testFileDescriptorCount = TestCase $ do
218− (serverAddress, serverTid) <- launchTestServer 0
214+ (serverAddress, serverTid) <- launchTestServer 1000
215+ startCount <- fdCount
219 unusedMVar <- newEmptyMVar
216 unusedMVar <- newEmptyMVar
220− startCount <- fdCount
217+ Right (_, testConn) <- testConnection serverAddress unusedMVar
221− Right (sess, testConn) <- testConnection serverAddress unusedMVar
222− --add a test commit to trigger the fsync machinery
223− executeDatabaseContextExpr sess testConn (Assign "x" (ExistingRelation relationFalse)) >>= eitherFail
224− commit sess testConn >>= eitherFail
225 close testConn
218 close testConn
226 endCount <- fdCount
219 endCount <- fdCount
227− let fd_diff = endCount - startCount
220+ assertEqual "fd leak" startCount endCount
228− assertBool ("fd leak: " ++ show fd_diff) (fd_diff <= 0)
229 killThread serverTid
221 killThread serverTid
230−
231
222
232-- returns the number of open file descriptors -- linux only /proc usage
223-- returns the number of open file descriptors -- linux only /proc usage
233fdCount :: IO Int
224fdCount :: IO Int
234fdCount = do
225fdCount = do
235 fds <- getDirectoryContents "/proc/self/fd"
226 fds <- getDirectoryContents "/proc/self/fd"
236− pure (length fds)
227+ pure ((length fds) - 2)
237#else
228#else
238--pass on non-linux platforms
229--pass on non-linux platforms
239testFileDescriptorCount = TestCase (pure ())
230testFileDescriptorCount = TestCase (pure ())
240−#endif
231+#endif
241−
242−testClientConnectFail :: Test
243−testClientConnectFail = TestCase $ do
244− let connInfo = RemoteConnectionInfo "nonexistentdb" "127.0.0.1" "7777" emptyNotificationCallback
245− eConn <- connectProjectM36 connInfo
246− case eConn of
247− Left (IOExceptionError _) -> pure ()
248− _ -> assertFailure "connection failure failed"
test/Server/WebSocket.hs+7−9
@@ -1,4 +1,3 @@
1−{-# LANGUAGE CPP #-}
2-- test the websocket server
1-- test the websocket server
3import Test.HUnit
2import Test.HUnit
4import qualified Network.WebSockets as WS
3import qualified Network.WebSockets as WS
@@ -18,6 +17,7 @@ import Data.Aeson
18import qualified Data.Map as M
17import qualified Data.Map as M
19import qualified Data.ByteString.Lazy as BS
18import qualified Data.ByteString.Lazy as BS
20import ProjectM36.Relation
19import ProjectM36.Relation
20+import Network.Transport.TCP (decodeEndPointAddress)
21
21
22--start the websocket server
22--start the websocket server
23-- run some tutoriald against it
23-- run some tutoriald against it
@@ -26,17 +26,16 @@ launchTestServer :: IO (PortNumber, DatabaseName)
26launchTestServer = do
26launchTestServer = do
27 addressMVar <- newEmptyMVar
27 addressMVar <- newEmptyMVar
28 let config = defaultServerConfig { databaseName = testDatabaseName,
28 let config = defaultServerConfig { databaseName = testDatabaseName,
29− bindPort = 0,
29+ bindPort = 0 }
30− checkFS = False}
31 testDatabaseName = "test"
30 testDatabaseName = "test"
32 -- start normal server
31 -- start normal server
33 _ <- forkIO (launchServer config (Just addressMVar) >> pure ())
32 _ <- forkIO (launchServer config (Just addressMVar) >> pure ())
34− (SockAddrInet dbPort _) <- takeMVar addressMVar
33+ serverAddress <- takeMVar addressMVar
35 let wsServerHost = "127.0.0.1"
34 let wsServerHost = "127.0.0.1"
36 wsServerPort = 8889
35 wsServerPort = 8889
37− dbHost = "127.0.0.1"
36+ Just (dbHost, dbPort, _) = decodeEndPointAddress serverAddress
38 -- start websocket server proxy -- runServer doesn't support returning an arbitrary socket
37 -- start websocket server proxy -- runServer doesn't support returning an arbitrary socket
39− _ <- forkIO (WS.runServer wsServerHost wsServerPort (websocketProxyServer (fromIntegral dbPort) dbHost))
38+ _ <- forkIO (WS.runServer wsServerHost wsServerPort (websocketProxyServer (read dbPort) dbHost))
40 --wait for socket to be listening
39 --wait for socket to be listening
41 waitForListenSocket 5 (fromIntegral wsServerPort)
40 waitForListenSocket 5 (fromIntegral wsServerPort)
42 pure (fromIntegral wsServerPort, testDatabaseName)
41 pure (fromIntegral wsServerPort, testDatabaseName)
@@ -51,14 +50,13 @@ waitForListenSocket secondsToTry port =
51 if secondsToTry <= 0 then
50 if secondsToTry <= 0 then
52 throw WaitForSocketListenException
51 throw WaitForSocketListenException
53 else do
52 else do
54− --hostaddr <- inet_addr "127.0.0.1"
53+ hostaddr <- inet_addr "127.0.0.1"
55− hostaddr:_ <- getAddrInfo Nothing (Just "127.0.0.1") (Just (show port))
56 sock <- socket AF_INET Stream defaultProtocol
54 sock <- socket AF_INET Stream defaultProtocol
57 let handler :: IOException -> IO ()
55 let handler :: IOException -> IO ()
58 handler _ = do
56 handler _ = do
59 threadDelay 1000000
57 threadDelay 1000000
60 waitForListenSocket (secondsToTry - 1) port
58 waitForListenSocket (secondsToTry - 1) port
61− catch (connect sock (addrAddress hostaddr)) handler
59+ catch (connect sock (SockAddrInet port hostaddr)) handler
62
60
63main :: IO ()
61main :: IO ()
64main = do
62main = do
test/TransactionGraph/Merge.hs+39−70
@@ -4,28 +4,15 @@ import ProjectM36.Base
4import ProjectM36.Attribute
4import ProjectM36.Attribute
5import ProjectM36.Relation
5import ProjectM36.Relation
6import ProjectM36.Transaction
6import ProjectM36.Transaction
7−import ProjectM36.TransactionInfo as TI
8import ProjectM36.TransactionGraph
7import ProjectM36.TransactionGraph
9import ProjectM36.Error
8import ProjectM36.Error
10import ProjectM36.Key
9import ProjectM36.Key
11import qualified ProjectM36.DisconnectedTransaction as Discon
10import qualified ProjectM36.DisconnectedTransaction as Discon
12import qualified ProjectM36.DatabaseContext as DBC
11import qualified ProjectM36.DatabaseContext as DBC
13import ProjectM36.RelationalExpression
12import ProjectM36.RelationalExpression
14−import ProjectM36.StaticOptimizer
15
13
16import qualified Data.ByteString.Lazy as BS
14import qualified Data.ByteString.Lazy as BS
17import System.Exit
15import System.Exit
18−
19−
20−
21−
22−
23−
24−
25−
26−
27−
28−
29import Data.Word
16import Data.Word
30import qualified Data.UUID as U
17import qualified Data.UUID as U
31import qualified Data.Set as S
18import qualified Data.Set as S
@@ -34,6 +21,8 @@ import Data.Maybe
34import Data.Time.Clock
21import Data.Time.Clock
35import Data.Time.Calendar
22import Data.Time.Calendar
36
23
24+import Control.Monad.State
25+
37{-# ANN module ("HLint: ignore Reduce duplication" :: String) #-}
26{-# ANN module ("HLint: ignore Reduce duplication" :: String) #-}
38
27
39testTime :: UTCTime
28testTime :: UTCTime
@@ -73,8 +62,8 @@ basicTransactionGraph = do
73 uuidB = fakeUUID 11
62 uuidB = fakeUUID 11
74 uuidRoot = fakeUUID 1
63 uuidRoot = fakeUUID 1
75 rootContext = concreteDatabaseContext rootTrans
64 rootContext = concreteDatabaseContext rootTrans
76− (_, bsGraph') <- addTransaction "branchA" (createTrans uuidA (TI.singleParent uuidRoot testTime) rootContext) bsGraph
65+ (_, bsGraph') <- addTransaction "branchA" (createTrans uuidA (TransactionInfo uuidRoot S.empty testTime) rootContext) bsGraph
77− (_, bsGraph'') <- addTransaction "branchB" (createTrans uuidB (TI.singleParent uuidRoot testTime) rootContext) bsGraph'
66+ (_, bsGraph'') <- addTransaction "branchB" (createTrans uuidB (TransactionInfo uuidRoot S.empty testTime) rootContext) bsGraph'
78 pure bsGraph''
67 pure bsGraph''
79
68
80addTransaction :: HeadName -> Transaction -> TransactionGraph -> IO (Transaction, TransactionGraph)
69addTransaction :: HeadName -> Transaction -> TransactionGraph -> IO (Transaction, TransactionGraph)
@@ -118,7 +107,7 @@ testSubGraphToFirstAncestorSnipBranch = TestCase $ do
118 baseGraph <- basicTransactionGraph
107 baseGraph <- basicTransactionGraph
119 transA <- assertMaybe (transactionForHead "branchA" baseGraph) "failed to get branchA"
108 transA <- assertMaybe (transactionForHead "branchA" baseGraph) "failed to get branchA"
120 transB <- assertMaybe (transactionForHead "branchB" baseGraph) "failed to get branchB"
109 transB <- assertMaybe (transactionForHead "branchB" baseGraph) "failed to get branchB"
121− (_, graph) <- addTransaction "branchC" (createTrans (fakeUUID 12) (TI.singleParent (fakeUUID 1) testTime) (concreteDatabaseContext transA)) baseGraph
110+ (_, graph) <- addTransaction "branchC" (createTrans (fakeUUID 12) (TransactionInfo (fakeUUID 1) S.empty testTime) (concreteDatabaseContext transA)) baseGraph
122 subgraph <- assertEither $ subGraphOfFirstCommonAncestor graph (transactionHeadsForGraph baseGraph) transA transB S.empty
111 subgraph <- assertEither $ subGraphOfFirstCommonAncestor graph (transactionHeadsForGraph baseGraph) transA transB S.empty
123 assertGraph subgraph
112 assertGraph subgraph
124 let graphEq graphArg = S.map transactionId (transactionsForGraph graphArg)
113 let graphEq graphArg = S.map transactionId (transactionsForGraph graphArg)
@@ -132,18 +121,16 @@ testSubGraphToFirstAncestorMoreTransactions = TestCase $ do
132
121
133-- add another relvar to branchB
122-- add another relvar to branchB
134 branchBTrans <- assertMaybe (transactionForHead "branchB" graph) "failed to get branchB head"
123 branchBTrans <- assertMaybe (transactionForHead "branchB" graph) "failed to get branchB head"
135− let env = mkDatabaseContextEvalEnv (transactionId branchBTrans) graph
124+ (updatedBranchBContext,_,_) <- case runState (evalDatabaseContextExpr (Assign "branchBOnlyRelvar" (ExistingRelation relationTrue))) (freshDatabaseState (concreteDatabaseContext branchBTrans)) of
136− branchBContext = concreteDatabaseContext branchBTrans
125+ (Left err, _) -> assertFailure (show err) >> undefined
137− updatedBranchBContext <- case runDatabaseContextEvalMonad branchBContext env (optimizeAndEvalDatabaseContextExpr True (Assign "branchBOnlyRelvar" (ExistingRelation relationTrue))) of
126+ (Right (), context) -> pure context
138− Left err -> assertFailure (show err) >> undefined
127+ (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TransactionInfo (transactionId branchBTrans) S.empty testTime) updatedBranchBContext) graph
139− Right st -> pure $ dbc_context st
140− (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TI.singleParent (transactionId branchBTrans) testTime) updatedBranchBContext) graph
141 branchBTrans' <- assertMaybe (transactionForHead "branchB" graph') "failed to get branchB head"
128 branchBTrans' <- assertMaybe (transactionForHead "branchB" graph') "failed to get branchB head"
142 assertEqual "branchB id 3" (fakeUUID 3) (transactionId branchBTrans')
129 assertEqual "branchB id 3" (fakeUUID 3) (transactionId branchBTrans')
143
130
144 -- add another transaction to branchA
131 -- add another transaction to branchA
145 branchATrans <- assertMaybe (transactionForHead "branchA" graph) "failed to get branchA head"
132 branchATrans <- assertMaybe (transactionForHead "branchA" graph) "failed to get branchA head"
146− (_, graph'') <- addTransaction "branchA" (createTrans (fakeUUID 4) (TI.singleParent (transactionId branchATrans) testTime) (concreteDatabaseContext branchATrans)) graph'
133+ (_, graph'') <- addTransaction "branchA" (createTrans (fakeUUID 4) (TransactionInfo (transactionId branchATrans) S.empty testTime) (concreteDatabaseContext branchATrans)) graph'
147 branchATrans' <- assertMaybe (transactionForHead "branchA" graph'') "failed to get branchA head"
134 branchATrans' <- assertMaybe (transactionForHead "branchA" graph'') "failed to get branchA head"
148 assertEqual "branchA id 4" (fakeUUID 4) (transactionId branchATrans')
135 assertEqual "branchA id 4" (fakeUUID 4) (transactionId branchATrans')
149
136
@@ -161,15 +148,12 @@ testSelectedBranchMerge = TestCase $ do
161
148
162 -- add another relvar to branchB
149 -- add another relvar to branchB
163 branchBTrans <- assertMaybe (transactionForHead "branchB" graph) "failed to get branchB head"
150 branchBTrans <- assertMaybe (transactionForHead "branchB" graph) "failed to get branchB head"
164− let env = mkDatabaseContextEvalEnv (transactionId branchBTrans) graph
151+ (updatedBranchBContext,_,_) <- case runState (evalDatabaseContextExpr (Assign "branchBOnlyRelvar" (ExistingRelation relationTrue))) (freshDatabaseState (concreteDatabaseContext branchBTrans)) of
165− branchBContext = concreteDatabaseContext branchBTrans
152+ (Left err, _) -> assertFailure (show err) >> undefined
166− updatedBranchBContext <- case runDatabaseContextEvalMonad branchBContext env (optimizeAndEvalDatabaseContextExpr True (Assign "branchBOnlyRelvar" (ExistingRelation relationTrue))) of
153+ (Right (), context) -> pure context
167− Left err -> assertFailure (show err) >> undefined
154+ (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TransactionInfo (transactionId branchBTrans) S.empty testTime) updatedBranchBContext) graph
168− Right st -> pure (dbc_context st)
169− (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TI.singleParent (transactionId branchBTrans) testTime) updatedBranchBContext) graph
170 --create the merge transaction in the graph
155 --create the merge transaction in the graph
171− let eGraph' = runGraphRefRelationalExprM gfEnv $ mergeTransactions testTime (fakeUUID 4) (fakeUUID 10) (SelectedBranchMergeStrategy "branchA") ("branchA", "branchB")
156+ let eGraph' = mergeTransactions testTime (fakeUUID 4) (fakeUUID 10) (SelectedBranchMergeStrategy "branchA") ("branchA", "branchB") graph'
172− gfEnv = freshGraphRefRelationalExprEnv Nothing graph'
173
157
174 (_, graph'') <- assertEither eGraph'
158 (_, graph'') <- assertEither eGraph'
175
159
@@ -191,22 +175,18 @@ testUnionPreferMergeStrategy = TestCase $ do
191 branchBTrans <- assertMaybe (transactionForHead "branchB" graph) "branchBTrans"
175 branchBTrans <- assertMaybe (transactionForHead "branchB" graph) "branchBTrans"
192 branchBRelVar <- assertEither $ mkRelationFromList (attributesFromList [Attribute "conflict" IntAtomType]) []
176 branchBRelVar <- assertEither $ mkRelationFromList (attributesFromList [Attribute "conflict" IntAtomType]) []
193 let branchAContext = (concreteDatabaseContext branchATrans) {relationVariables = M.insert conflictRelVarName branchARelVar (relationVariables (concreteDatabaseContext branchATrans))}
177 let branchAContext = (concreteDatabaseContext branchATrans) {relationVariables = M.insert conflictRelVarName branchARelVar (relationVariables (concreteDatabaseContext branchATrans))}
194− branchARelVar = ExistingRelation relationTrue
178+ branchARelVar = relationTrue
195− branchBContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.insert conflictRelVarName (ExistingRelation branchBRelVar) (relationVariables (concreteDatabaseContext branchBTrans))}
179+ branchBContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.insert conflictRelVarName branchBRelVar (relationVariables (concreteDatabaseContext branchBTrans))}
196− conflictRelVarName = "conflictRelVar"
180+ conflictRelVarName = "conflictRelVar"
197
181
198− (_, graph') <- addTransaction "branchA" (createTrans (fakeUUID 3) (TI.singleParent (transactionId branchATrans) testTime) branchAContext) graph
182+ (_, graph') <- addTransaction "branchA" (createTrans (fakeUUID 3) (TransactionInfo (transactionId branchATrans) S.empty testTime) branchAContext) graph
199− (_, graph'') <- addTransaction "branchB" (createTrans (fakeUUID 4) (TI.singleParent (transactionId branchBTrans) testTime) branchBContext) graph'
183+ (_, graph'') <- addTransaction "branchB" (createTrans (fakeUUID 4) (TransactionInfo (transactionId branchBTrans) S.empty testTime) branchBContext) graph'
200 -- validate that the conflict is hidden because we preferred a branch
184 -- validate that the conflict is hidden because we preferred a branch
201− let merged = runGraphRefRelationalExprM env $ mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) (UnionPreferMergeStrategy "branchB") ("branchA", "branchB")
185+ let merged = mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) (UnionPreferMergeStrategy "branchB") ("branchA", "branchB") graph''
202− env = freshGraphRefRelationalExprEnv Nothing graph''
203 case merged of
186 case merged of
204 Left err -> assertFailure ("expected merge success: " ++ show err)
187 Left err -> assertFailure ("expected merge success: " ++ show err)
205− Right (discon, _) -> do
188+ Right (discon, _) ->
206− let Just rvExpr = M.lookup conflictRelVarName (relationVariables (Discon.concreteDatabaseContext discon))
189+ assertEqual "branchB relvar preferred in conflict" (Just branchBRelVar) (M.lookup conflictRelVarName (relationVariables (Discon.concreteDatabaseContext discon)))
207− reEnv = freshGraphRefRelationalExprEnv (Just (Discon.concreteDatabaseContext discon)) graph
208− let eRvRel = runGraphRefRelationalExprM reEnv (evalGraphRefRelationalExpr rvExpr)
209− assertEqual "branchB relvar preferred in conflict" (Right branchBRelVar) eRvRel
210
190
211-- try various individual component conflicts and check for merge failure
191-- try various individual component conflicts and check for merge failure
212testUnionMergeStrategy :: Test
192testUnionMergeStrategy :: Test
@@ -221,41 +201,31 @@ testUnionMergeStrategy = TestCase $ do
221
201
222 let updatedBranchBContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.insert branchBOnlyRelVarName branchBOnlyRelVar (relationVariables (concreteDatabaseContext branchBTrans)) }
202 let updatedBranchBContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.insert branchBOnlyRelVarName branchBOnlyRelVar (relationVariables (concreteDatabaseContext branchBTrans)) }
223 updatedBranchAContext = (concreteDatabaseContext branchATrans) {inclusionDependencies = M.insert branchAOnlyIncDepName branchAOnlyIncDep (inclusionDependencies (concreteDatabaseContext branchATrans)) }
203 updatedBranchAContext = (concreteDatabaseContext branchATrans) {inclusionDependencies = M.insert branchAOnlyIncDepName branchAOnlyIncDep (inclusionDependencies (concreteDatabaseContext branchATrans)) }
224− branchBOnlyRelVar = ExistingRelation relationTrue
204+ branchBOnlyRelVar = relationTrue
225 branchAOnlyIncDepName = "branchAOnlyIncDep"
205 branchAOnlyIncDepName = "branchAOnlyIncDep"
226 branchBOnlyRelVarName = "branchBOnlyRelVar"
206 branchBOnlyRelVarName = "branchBOnlyRelVar"
227 branchAOnlyIncDep = InclusionDependency (ExistingRelation relationTrue) (ExistingRelation relationTrue)
207 branchAOnlyIncDep = InclusionDependency (ExistingRelation relationTrue) (ExistingRelation relationTrue)
228− (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TI.singleParent (transactionId branchBTrans) testTime) updatedBranchBContext) graph
208+ (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TransactionInfo (transactionId branchBTrans) S.empty testTime) updatedBranchBContext) graph
229− let env = freshGraphRefRelationalExprEnv Nothing graph'
209+ (discon, _) <- assertEither $ mergeTransactions testTime (fakeUUID 5) (fakeUUID 10) UnionMergeStrategy ("branchA", "branchB") graph'
230− (discon, _) <- assertEither $ runGraphRefRelationalExprM env $ mergeTransactions testTime (fakeUUID 5) (fakeUUID 10) UnionMergeStrategy ("branchA", "branchB")
210+ assertEqual "branchBOnlyRelVar should appear in the merge" (M.lookup branchBOnlyRelVarName (relationVariables (Discon.concreteDatabaseContext discon))) (Just relationTrue)
231− let Just rvExpr = M.lookup branchBOnlyRelVarName (relationVariables (Discon.concreteDatabaseContext discon))
211+ (_, graph'') <- addTransaction "branchA" (createTrans (fakeUUID 4) (TransactionInfo (transactionId branchATrans) S.empty testTime) updatedBranchAContext) graph'
232− Right rvRel = runGraphRefRelationalExprM reEnv (evalGraphRefRelationalExpr rvExpr)
212+ let eMergeGraph = mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) UnionMergeStrategy ("branchA", "branchB") graph''
233− reEnv = freshGraphRefRelationalExprEnv (Just (Discon.concreteDatabaseContext discon)) graph
234−
235− assertEqual "branchBOnlyRelVar should appear in the merge" relationTrue rvRel
236− (_, graph'') <- addTransaction "branchA" (createTrans (fakeUUID 4) (TI.singleParent (transactionId branchATrans) testTime) updatedBranchAContext) graph'
237− let eMergeGraph = runGraphRefRelationalExprM gfEnv $ mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) UnionMergeStrategy ("branchA", "branchB")
238− gfEnv = freshGraphRefRelationalExprEnv Nothing graph''
239 case eMergeGraph of
213 case eMergeGraph of
240 Left err -> assertFailure ("expected merge success: " ++ show err)
214 Left err -> assertFailure ("expected merge success: " ++ show err)
241 Right (_, mergeGraph) -> do
215 Right (_, mergeGraph) -> do
242 -- check that the new merge transaction has the correct parents
216 -- check that the new merge transaction has the correct parents
243 mergeTrans <- assertEither $ transactionForId (fakeUUID 5) mergeGraph
217 mergeTrans <- assertEither $ transactionForId (fakeUUID 5) mergeGraph
244 let mergeContext = concreteDatabaseContext mergeTrans
218 let mergeContext = concreteDatabaseContext mergeTrans
245− assertEqual "merge transaction parents" (parentIds mergeTrans) (S.fromList [fakeUUID 3, fakeUUID 4])
219+ assertEqual "merge transaction parents" (transactionParentIds mergeTrans) (S.fromList [fakeUUID 3, fakeUUID 4])
246 -- check that the new merge tranasction has elements from both A and B branches
220 -- check that the new merge tranasction has elements from both A and B branches
247− let Just rvExpr' = M.lookup branchBOnlyRelVarName (relationVariables mergeContext)
221+ assertEqual "merge transaction relvars" (Just relationTrue) (M.lookup branchBOnlyRelVarName (relationVariables mergeContext))
248− Right rvRel' = runGraphRefRelationalExprM reEnv' (evalGraphRefRelationalExpr rvExpr')
249− reEnv' = freshGraphRefRelationalExprEnv (Just mergeContext) graph
250− assertEqual "merge transaction relvars" relationTrue rvRel'
251 assertEqual "merge transaction incdeps" (Just branchAOnlyIncDep) (M.lookup branchAOnlyIncDepName (inclusionDependencies mergeContext))
222 assertEqual "merge transaction incdeps" (Just branchAOnlyIncDep) (M.lookup branchAOnlyIncDepName (inclusionDependencies mergeContext))
252 -- test an expected conflict- add branchBOnlyRelVar with same name but different attributes
223 -- test an expected conflict- add branchBOnlyRelVar with same name but different attributes
253 conflictRelVar <- assertEither $ mkRelationFromList (attributesFromList [Attribute "conflict" IntAtomType]) []
224 conflictRelVar <- assertEither $ mkRelationFromList (attributesFromList [Attribute "conflict" IntAtomType]) []
254− let conflictContextA = updatedBranchAContext {relationVariables = M.insert branchBOnlyRelVarName (ExistingRelation conflictRelVar) (relationVariables updatedBranchAContext) }
225+ let conflictContextA = updatedBranchAContext {relationVariables = M.insert branchBOnlyRelVarName conflictRelVar (relationVariables updatedBranchAContext) }
255 conflictBranchATrans <- assertMaybe (transactionForHead "branchA" graph'') "retrieving head transaction for expected conflict"
226 conflictBranchATrans <- assertMaybe (transactionForHead "branchA" graph'') "retrieving head transaction for expected conflict"
256− (_, graph''') <- addTransaction "branchA" (createTrans (fakeUUID 6) (TI.singleParent (transactionId conflictBranchATrans) testTime) conflictContextA) graph''
227+ (_, graph''') <- addTransaction "branchA" (createTrans (fakeUUID 6) (TransactionInfo (transactionId conflictBranchATrans) S.empty testTime) conflictContextA) graph''
257− let failingMerge = runGraphRefRelationalExprM gfEnv' $ mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) UnionMergeStrategy ("branchA", "branchB")
228+ let failingMerge = mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) UnionMergeStrategy ("branchA", "branchB") graph'''
258− gfEnv' = freshGraphRefRelationalExprEnv Nothing graph'''
259 case failingMerge of
229 case failingMerge of
260 Right _ -> assertFailure "expected merge failure"
230 Right _ -> assertFailure "expected merge failure"
261 Left err -> assertEqual "merge failure" err (MergeTransactionError StrategyViolatesRelationVariableMergeError)
231 Left err -> assertEqual "merge failure" err (MergeTransactionError StrategyViolatesRelationVariableMergeError)
@@ -274,21 +244,20 @@ testUnionMergeIncDepViolation = TestCase $ do
274 rvName = "x"
244 rvName = "x"
275 Right branchArv = eRel 2
245 Right branchArv = eRel 2
276 Right branchBrv = eRel 3
246 Right branchBrv = eRel 3
277− branchAContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.singleton rvName (ExistingRelation branchArv)}
247+ branchAContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.singleton rvName branchArv}
278− branchBContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.singleton rvName (ExistingRelation branchBrv),
248+ branchBContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.singleton rvName branchBrv,
279 inclusionDependencies = M.singleton incDepName incDep}
249 inclusionDependencies = M.singleton incDepName incDep}
280 incDepName = "x_key"
250 incDepName = "x_key"
281 incDep = inclusionDependencyForKey (AttributeNames (S.singleton "x")) (RelationVariable "x" ())
251 incDep = inclusionDependencyForKey (AttributeNames (S.singleton "x")) (RelationVariable "x" ())
282
252
283
253
284 --add the rv in new commits to both branches
254 --add the rv in new commits to both branches
285− (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TI.singleParent (transactionId branchBTrans) testTime) branchBContext) graph
255+ (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TransactionInfo (transactionId branchBTrans) S.empty testTime) branchBContext) graph
286
256
287− (_, graph'') <- addTransaction "branchA" (createTrans (fakeUUID 4) (TI.singleParent (transactionId branchATrans) testTime) branchAContext) graph'
257+ (_, graph'') <- addTransaction "branchA" (createTrans (fakeUUID 4) (TransactionInfo (transactionId branchATrans) S.empty testTime) branchAContext) graph'
288
258
289 --check that the union merge fails due to a violated constraint
259 --check that the union merge fails due to a violated constraint
290− let eMerge = runGraphRefRelationalExprM env $ mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) UnionMergeStrategy ("branchA", "branchB")
260+ let eMerge = mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) UnionMergeStrategy ("branchA", "branchB") graph''
291− env = freshGraphRefRelationalExprEnv Nothing graph''
292 case eMerge of
261 case eMerge of
293 Left (InclusionDependencyCheckError incDepName') -> assertEqual "incdep violation name" incDepName incDepName'
262 Left (InclusionDependencyCheckError incDepName') -> assertEqual "incdep violation name" incDepName incDepName'
294 Left err -> assertFailure ("other error: " ++ show err)
263 Left err -> assertFailure ("other error: " ++ show err)
test/TransactionGraph/Persist.hs+18−83
@@ -1,14 +1,14 @@
1−{-# LANGUAGE CPP #-}
2import Test.HUnit
1import Test.HUnit
3import ProjectM36.Base
2import ProjectM36.Base
4import ProjectM36.Persist (DiskSync(NoDiskSync))
3import ProjectM36.Persist (DiskSync(NoDiskSync))
5import ProjectM36.TransactionGraph.Persist
4import ProjectM36.TransactionGraph.Persist
6−import ProjectM36.TransactionGraph as TG
5+import ProjectM36.TransactionGraph
7import ProjectM36.Transaction
6import ProjectM36.Transaction
8import ProjectM36.DateExamples
7import ProjectM36.DateExamples
8+import ProjectM36.Client
9+import ProjectM36.Relation
9import System.IO.Temp
10import System.IO.Temp
10import System.Exit
11import System.Exit
11−import System.Directory
12import Data.Either
12import Data.Either
13import Data.UUID.V4 (nextRandom)
13import Data.UUID.V4 (nextRandom)
14import System.FilePath
14import System.FilePath
@@ -17,9 +17,6 @@ import qualified Data.Map as M
17import qualified Data.Set as S
17import qualified Data.Set as S
18import Data.Time.Clock
18import Data.Time.Clock
19import Data.Time.Calendar
19import Data.Time.Calendar
20−import ProjectM36.Client as C
21−import ProjectM36.Relation
22−import ProjectM36.Transaction.Persist
23
20
24main :: IO ()
21main :: IO ()
25main = do
22main = do
@@ -28,13 +25,11 @@ main = do
28
25
29testList :: Test
26testList :: Test
30testList = TestList [testBootstrapDB,
27testList = TestList [testBootstrapDB,
31− testDBSimplePersistence,
28+ testDBSimplePersistence,
32− testFunctionPersistence,
29+ testFunctionPersistence]
33− testMerkleHashValidation]
34−
35
30
36−stamp' :: UTCTime
31+stamp :: UTCTime
37−stamp' = UTCTime (fromGregorian 1980 01 01) (secondsToDiffTime 1000)
32+stamp = UTCTime (fromGregorian 1980 01 01) (secondsToDiffTime 1000)
38
33
39{- bootstrap a database, ensure that it can be read -}
34{- bootstrap a database, ensure that it can be read -}
40testBootstrapDB :: Test
35testBootstrapDB :: Test
@@ -42,7 +37,7 @@ testBootstrapDB = TestCase $ withSystemTempDirectory "m36testdb" $ \tempdir -> d
42 let dbdir = tempdir </> "dbdir"
37 let dbdir = tempdir </> "dbdir"
43 freshId <- nextRandom
38 freshId <- nextRandom
44
39
45− _ <- bootstrapDatabaseDir NoDiskSync dbdir (bootstrapTransactionGraph stamp' freshId dateExamples)
40+ _ <- bootstrapDatabaseDir NoDiskSync dbdir (bootstrapTransactionGraph stamp freshId dateExamples)
46 loadedGraph <- transactionGraphLoad dbdir emptyTransactionGraph Nothing
41 loadedGraph <- transactionGraphLoad dbdir emptyTransactionGraph Nothing
47 assertBool "transactionGraphLoad" $ isRight loadedGraph
42 assertBool "transactionGraphLoad" $ isRight loadedGraph
48
43
@@ -52,17 +47,17 @@ testDBSimplePersistence = TestCase $ withSystemTempDirectory "m36testdb" $ \temp
52 let dbdir = tempdir </> "dbdir"
47 let dbdir = tempdir </> "dbdir"
53 freshId <- nextRandom
48 freshId <- nextRandom
54
49
55− let graph = bootstrapTransactionGraph stamp' freshId dateExamples
50+ let graph = bootstrapTransactionGraph stamp freshId dateExamples
56 _ <- bootstrapDatabaseDir NoDiskSync dbdir graph
51 _ <- bootstrapDatabaseDir NoDiskSync dbdir graph
57 case transactionForHead "master" graph of
52 case transactionForHead "master" graph of
58 Nothing -> assertFailure "Failed to retrieve head transaction for master branch."
53 Nothing -> assertFailure "Failed to retrieve head transaction for master branch."
59 Just headTrans ->
54 Just headTrans ->
60− case interpretDatabaseContextExpr (concreteDatabaseContext headTrans) (transactionId headTrans) graph "x:=s" of
55+ case interpretDatabaseContextExpr (concreteDatabaseContext headTrans) "x:=s" of
61 Left err -> assertFailure (show err)
56 Left err -> assertFailure (show err)
62 Right context' -> do
57 Right context' -> do
63 freshId' <- nextRandom
58 freshId' <- nextRandom
64− let newdiscon = DisconnectedTransaction (transactionId headTrans) (Schemas context' M.empty) False
59+ let newdiscon = DisconnectedTransaction (transactionId headTrans) (Schemas context' M.empty) True
65− addTrans = addDisconnectedTransaction stamp' freshId' "master" newdiscon graph
60+ addTrans = addDisconnectedTransaction stamp freshId' "master" newdiscon graph
66 --add a transaction to the graph
61 --add a transaction to the graph
67 case addTrans of
62 case addTrans of
68 Left err -> assertFailure (show err)
63 Left err -> assertFailure (show err)
@@ -75,70 +70,11 @@ testDBSimplePersistence = TestCase $ withSystemTempDirectory "m36testdb" $ \temp
75 case graphErr of
70 case graphErr of
76 Left err -> assertFailure (show err)
71 Left err -> assertFailure (show err)
77 Right graph'' -> assertBool "graph equality" (mapEq graph'' == mapEq graph')
72 Right graph'' -> assertBool "graph equality" (mapEq graph'' == mapEq graph')
78−
73+
79−testMerkleHashValidation :: Test
80−testMerkleHashValidation = TestCase $
81− -- add a commit and validate the hashes successfully
82− withSystemTempDirectory "m36testdb" $ \tempdir -> do
83− let dbdir = tempdir </> "dbdir"
84− connInfo = InProcessConnectionInfo (MinimalPersistence dbdir) emptyNotificationCallback []
85− conn <- assertIOEither $ connectProjectM36 connInfo
86− sess <- assertIOEither $ createSessionAtHead conn "master"
87− Right _ <- executeDatabaseContextExpr sess conn (Assign "x" (ExistingRelation relationTrue))
88− Right _ <- commit sess conn
89− val <- C.validateMerkleHashes sess conn
90− assertEqual "merkle success" (Right ()) val
91−
92− --read graph from disk
93− conn' <- assertIOEither $ connectProjectM36 connInfo
94− sess' <- assertIOEither $ createSessionAtHead conn' "master"
95−
96− val' <- C.validateMerkleHashes sess' conn'
97− assertEqual "merkle read again success" (Right ()) val'
98−
99− --alter the on-disk representation and check that the hash validation fails
100− eGraph <- transactionGraphLoad dbdir emptyTransactionGraph Nothing
101− case eGraph of
102− Left err -> assertFailure $ "failed to load graph" ++ show err
103− Right graph -> do
104− let trans = transactionHeadsForGraph graph M.! "master"
105− updatedTrans = Transaction (transactionId trans) (transactionInfo trans) updatedSchemas
106− transactionDir' = dbdir </> show (transactionId trans)
107− updatedSchemas =
108− case schemas trans of
109− Schemas ctx sschemas ->
110− let updatedContext = ctx {
111− relationVariables = M.insert "malicious" (ExistingRelation relationFalse) (relationVariables ctx)
112− } in
113− Schemas updatedContext sschemas
114− maliciousGraph = TransactionGraph malHeads malTransSet
115− malHeads = M.insert "master" updatedTrans (transactionHeadsForGraph graph)
116− malTransSet = S.insert updatedTrans (transactionsForGraph graph)
117− malMerkleHash = calculateMerkleHash updatedTrans maliciousGraph
118− regMerkleHash = merkleHash (transactionInfo trans)
119− --validate and fail
120− let val'' = TG.validateMerkleHashes maliciousGraph
121− assertEqual "loaded graph merkle hashes" (Left [MerkleValidationError (transactionId trans) regMerkleHash malMerkleHash]) val''
122− --delete existing transaction directory
123− removeDirectoryRecursive transactionDir'
124− writeTransaction NoDiskSync dbdir updatedTrans
125−
126− --read graph from disk
127− eConnFail <- connectProjectM36 connInfo
128− case eConnFail of
129− Left err ->
130− assertEqual "open connection merkle validation" (DatabaseValidationError [MerkleValidationError (transactionId trans) regMerkleHash malMerkleHash]) err
131− Right _ -> assertFailure "open connection validation"
132−
133−
134
74
135--only Haskell-scripted dbc and atom functions can be serialized
75--only Haskell-scripted dbc and atom functions can be serialized
136testFunctionPersistence :: Test
76testFunctionPersistence :: Test
137−#if !defined(PM36_HASKELL_SCRIPTING)
77+testFunctionPersistence = TestCase $ withSystemTempDirectory "m36testdb" $ \tempdir -> do
138−testFunctionPersistence = TestCase $ pure ()
139−#else
140−testFunctionPersistence = TestCase $
141− withSystemTempDirectory "m36testdb" $ \tempdir -> do
142 let dbdir = tempdir </> "dbdir"
78 let dbdir = tempdir </> "dbdir"
143 connInfo = InProcessConnectionInfo (MinimalPersistence dbdir) emptyNotificationCallback []
79 connInfo = InProcessConnectionInfo (MinimalPersistence dbdir) emptyNotificationCallback []
144 conn <- assertIOEither $ connectProjectM36 connInfo
80 conn <- assertIOEither $ connectProjectM36 connInfo
@@ -149,18 +85,17 @@ testFunctionPersistence = TestCase $
149 ADTypeConstructor "Either" [ADTypeConstructor "AtomFunctionError" [],
85 ADTypeConstructor "Either" [ADTypeConstructor "AtomFunctionError" [],
150 intTCons]] "(\\(x:_) -> pure x) :: [Atom] -> Either AtomFunctionError Atom"
86 intTCons]] "(\\(x:_) -> pure x) :: [Atom] -> Either AtomFunctionError Atom"
151 _ <- assertIOEither $ executeDatabaseContextIOExpr sess conn addfunc
87 _ <- assertIOEither $ executeDatabaseContextIOExpr sess conn addfunc
88+
152 _ <- assertIOEither $ commit sess conn
89 _ <- assertIOEither $ commit sess conn
153− --close conn - pauses indefinitely on Windows
90+ close conn
154 --re-open the connection to reload the graph
91 --re-open the connection to reload the graph
155 conn2 <- assertIOEither $ connectProjectM36 connInfo
92 conn2 <- assertIOEither $ connectProjectM36 connInfo
156 sess2 <- assertIOEither $ createSessionAtHead conn2 "master"
93 sess2 <- assertIOEither $ createSessionAtHead conn2 "master"
157
94
158− res <- executeRelationalExpr sess2 conn2 (MakeRelationFromExprs Nothing (TupleExprs () [TupleExpr (M.singleton "a" (FunctionAtomExpr "testdisk" [NakedAtomExpr (IntAtom 3)] ()))]))
95+ res <- executeRelationalExpr sess2 conn2 (MakeRelationFromExprs Nothing [TupleExpr (M.singleton "a" (FunctionAtomExpr "testdisk" [NakedAtomExpr (IntAtom 3)] ()))])
159 let expectedRel = mkRelationFromList (attributesFromList [Attribute "a" IntAtomType]) [[IntAtom 3]]
96 let expectedRel = mkRelationFromList (attributesFromList [Attribute "a" IntAtomType]) [[IntAtom 3]]
160 assertEqual "testdisk dbc function run" expectedRel res
97 assertEqual "testdisk dbc function run" expectedRel res
161−
98+
162−#endif
163−
164assertIOEither :: (Show a) => IO (Either a b) -> IO b
99assertIOEither :: (Show a) => IO (Either a b) -> IO b
165assertIOEither x = do
100assertIOEither x = do
166 ret <- x
101 ret <- x
test/TutorialD/InterpreterTest.hs → test/TutorialD/Interpreter.hsrenamed+39−232

This diff is too big to show here.

test/TutorialD/Interpreter/AtomFunctionScript.hs+17−25

This diff is too big to show here.

test/TutorialD/Interpreter/DatabaseContextFunctionScript.hs+17−16

This diff is too big to show here.

test/TutorialD/Interpreter/Import/ImportTest.hsdeleted−47

This diff is too big to show here.

test/TutorialD/Interpreter/Import/TutorialD.hsnew file+21

This diff is too big to show here.

test/TutorialD/Interpreter/Import/httpimporttest.tutddeleted−2

This diff is too big to show here.

test/TutorialD/Interpreter/TestBase.hs+8−7

This diff is too big to show here.

test/TutorialD/PrinterTest.hsdeleted−47

This diff is too big to show here.

test/scripts.hs+2−5

This diff is too big to show here.