on master help sign in
.appveyor.yml+4−2
since splitsnapshots
unifiedsplit
@@ -16,6 +16,8 @@ clone_depth: 2
16environment:
16environment:
17 global:
17 global:
18 STACK_ROOT: "c:\\sr"
18 STACK_ROOT: "c:\\sr"
19+ matrix:
20+ - YAML: "stack.ghc8.6.yaml"
19
21
20platform:
22platform:
21 - x64
23 - x64
@@ -29,9 +31,9 @@ test_script:
29 - stack setup > nul
31 - stack setup > nul
30# The ugly echo "" hack is to avoid complaints about 0 being an invalid file
32# The ugly echo "" hack is to avoid complaints about 0 being an invalid file
31# descriptor
33# descriptor
32− - echo "" | stack --no-terminal test
34+ - echo "" | stack --stack-yaml %YAML% --no-terminal test
33# - 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
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
34
36
35#artifacts:
37#artifacts:
36# - path: project-m36.7z
38# - path: project-m36.7z
37−# name: project-m36.7z
39+# name: project-m36.7z
.github/workflows/ci.yamlnew file+69
@@ -0,0 +1,69 @@
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+3−1
@@ -18,4 +18,6 @@ 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.ymldeleted−60
@@ -1,60 +0,0 @@
1−# For more information, see https://github.com/ChrisPenner/haskell-stack-travis-ci
2−language: c
3−sudo: false
4−
5−git:
6− submodules: false # whether to recursively clone submodules
7−
8−cache:
9− directories:
10− - $HOME/.ghc
11− - $HOME/.cabal
12− - $HOME/.stack
13− - .stack-work
14− timeout: 1000
15−
16−matrix:
17− fast_finish: true
18− include:
19− - env: CACHE_NAME=7.10.3 STACK_YAML=stack.ghc7.10.yaml
20− compiler: ": #stack 7.10.3"
21−
22− - env: CACHE_NAME=8.0.2 STACK_YAML=stack.yaml
23− compiler: ": #stack 8.0.2"
24−
25− - env: CACHE_NAME=osx-8.0.2 STACK_YAML=stack.yaml
26− os: osx
27− os_image: xcode7.3
28− compiler: ": #stack 8.0.2"
29−
30−before_script:
31− - unset CC
32− - export PATH=$HOME/.local/bin:/opt/ghc/$GHC_VERSION/bin:$PATH
33− - ./.travis/install-ghr.sh
34− - ./.travis/install-stack.sh
35−
36−# Here starts the actual work to be performed for the package under test;
37−# any command which exits with a non-zero exit code causes the build to fail.
38−script:
39− - |
40− # Run tests
41− set -e
42− ./.travis/install-dependencies.sh
43− stack --no-terminal --jobs=2 --system-ghc test
44− - |
45− #Run HLint
46− if [[ "$(uname)" = "Linux" ]]; then
47− curl -sL https://raw.github.com/ndmitchell/hlint/master/misc/travis.sh | sh -s lint src test examples --cpp-define VERSION_project_m36=HLINT
48− fi
49− - |
50− #Run Haddock
51− if [[ "$(uname)" = "Linux" ]]; then
52− stack --no-install-ghc --system-ghc --no-haddock-deps haddock
53− fi
54−
55−after_success:
56− - |
57− # Build and ship binary
58− #./.travis/attach-binary.sh
59−
60−# EOF
.travis/attach-binary.shdeleted−25
@@ -1,25 +0,0 @@
1−#!/bin/sh
2−set -o errexit -o verbose
3−
4−if test ! "$BUILD_BINARY" || test ! "$TRAVIS_TAG"
5−then
6− echo 'This is not a release build.'
7−elif test ! "$GITHUB_TOKEN"
8−then
9− echo 'The GITHUB_TOKEN environment variable is not set!'
10− exit 1
11−else
12− echo "Building binary for $TRAVIS_OS_NAME to $TRAVIS_TAG..."
13− stack build --ghc-options -O2 --pedantic
14− echo "Attaching binary for $TRAVIS_OS_NAME to $TRAVIS_TAG..."
15− OWNER="$(echo "$TRAVIS_REPO_SLUG" | cut -f1 -d/)"
16− REPO="$(echo "$TRAVIS_REPO_SLUG" | cut -f2 -d/)"
17− BIN="$(stack path --local-install-root)/bin/$REPO"
18− BUNDLE_NAME="$REPO-$TRAVIS_TAG-$TRAVIS_OS_NAME.tar.gz"
19− cp "$BIN" "./$REPO"
20− chmod +x "./$REPO"
21− tar -czf "$BUNDLE_NAME" "$REPO"
22− echo "SHA256:"
23− shasum -a 256 "$BUNDLE_NAME"
24− ghr -t "$GITHUB_TOKEN" -u "$OWNER" -r "$REPO" --replace "$(git describe --tags)" "$BUNDLE_NAME"
25−fi
.travis/install-dependencies.shdeleted−22
@@ -1,22 +0,0 @@
1−# Run tests
2−if [[ "$(uname)" = "Darwin" ]]; then
3− timeout_cmd="gtimeout"
4−else
5− timeout_cmd="timeout"
6−fi
7−$timeout_cmd 15m stack --no-terminal --jobs=2 --install-ghc --system-ghc build --only-dependencies --fast
8−ret=$?
9−case "$ret" in
10− 0)
11− # continue
12− ;;
13− 124)
14− echo "Timed out while installing dependencies."
15− echo "Try building again by pushing a new commit."
16− exit 1
17− ;;
18− *)
19− echo "Failed to install dependencies; stack exited with $ret"
20− exit "$ret"
21− ;;
22−esac
.travis/install-ghc.shdeleted−16
@@ -1,16 +0,0 @@
1−#!/bin/sh
2−set -eux
3−#assume stack is installed
4−STACK=~/.local/bin/stack
5−
6−fetch_ghc_osx() {
7− echo "Using stack to install GHC $GHC_VERSION"
8− $STACK setup $GHC_VERSION
9−}
10−
11−if [ "$(uname)" = "Darwin" ]; then
12− fetch_ghc_osx
13−else
14− #installed by apt
15− echo "Linux GHC $GHC_VERSION via APT already installed."
16−fi
.travis/install-ghr.shdeleted−21
@@ -1,21 +0,0 @@
1−#!/bin/sh
2−set -o errexit -o verbose
3−
4−if test ! "$BUILD_BINARY" || test ! "$TRAVIS_TAG"
5−then
6− echo 'This is not a release build.'
7−else
8− if [ "$TRAVIS_OS_NAME" = "linux" ]
9− then
10− ARCH="linux"
11− else
12− ARCH="darwin"
13− fi
14− echo "Installing ghr"
15− URL="https://github.com/tcnksm/ghr/releases/download/v0.5.4/ghr_v0.5.4_${ARCH}_386.zip"
16− curl -L ${URL} > ghr.zip
17− mkdir -p "$HOME/bin"
18− export PATH="$HOME/bin:$PATH"
19− unzip ghr.zip -d "$HOME/bin"
20− rm ghr.zip
21−fi
.travis/install-stack.shdeleted−27
@@ -1,27 +0,0 @@
1−#!/bin/sh
2−
3−# Adapted from https://github.com/commercialhaskell/stack
4−
5−set -eux
6−
7−travis_retry() {
8− cmd=$*
9− $cmd || (sleep 2 && $cmd) || (sleep 10 && $cmd)
10−}
11−
12−fetch_stack_osx() {
13− curl -skL https://www.stackage.org/stack/osx-x86_64 | tar xz --strip-components=1 --include '*/stack' -C ~/.local/bin;
14−}
15−
16−fetch_stack_linux() {
17− curl -sL https://www.stackage.org/stack/linux-x86_64 | tar xz --wildcards --strip-components=1 -C ~/.local/bin '*/stack';
18−}
19−
20−# We need stack to generate cabal files with precise bounds, even for cabal
21−# builds.
22−mkdir -p ~/.local/bin;
23−if [ "$(uname)" = "Darwin" ]; then
24− travis_retry fetch_stack_osx
25−else
26− travis_retry fetch_stack_linux
27−fi
Changelog.markdown+65
@@ -1,3 +1,68 @@
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+
1# 2017-11-14
66# 2017-11-14
2
67
3* alter websocket server API to allow for multiple representations (JSON, text, or HTML) to be selected and returned simultaneously
68* alter websocket server API to allow for multiple representations (JSON, text, or HTML) to be selected and returned simultaneously
README.markdown+15−7
@@ -4,8 +4,8 @@
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−[![Build status](https://travis-ci.org/agentm/project-m36.svg?branch=master)](https://travis-ci.org/agentm/project-m36)
8[![Windows Build status](https://ci.appveyor.com/api/projects/status/q7jyddd6dy1ibqdo/branch/master?svg=true)](https://ci.appveyor.com/project/agentm/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)
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
9
10
10
11*Software can always be made faster, but rarely can it be made more correct.*
11*Software can always be made faster, but rarely can it be made more correct.*
@@ -14,6 +14,12 @@
14
14
15Project:M36 implements a relational algebra engine as inspired by the writings of Chris Date.
15Project:M36 implements a relational algebra engine as inspired by the writings of Chris Date.
16
16
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+
17## Description
23## Description
18
24
19Unlike 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.
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.
@@ -26,10 +32,6 @@ Project:M36 is written entirely in the [Haskell programming language](https://ww
26
32
27[![asciicast](https://asciinema.org/a/3syu35c8cydm403292a74l1n5.png)](https://asciinema.org/a/3syu35c8cydm403292a74l1n5)
33[![asciicast](https://asciinema.org/a/3syu35c8cydm403292a74l1n5.png)](https://asciinema.org/a/3syu35c8cydm403292a74l1n5)
28
34
29−## Try It!
30−
31−You can experiment instantly with Project:M36 straight from your browser at [try.project-m36.io](https://try.project-m36.io)!
32−
33## Use-Cases
35## Use-Cases
34
36
35Project:M36 supports multiple frontends which target different audiences.
37Project:M36 supports multiple frontends which target different audiences.
@@ -42,7 +44,7 @@ Project:M36 supports multiple frontends which target different audiences.
42
44
43* [Developer's Blog](https://agentm.github.io/project-m36/)
45* [Developer's Blog](https://agentm.github.io/project-m36/)
44* [Mailing List/Discussion Group](https://groups.google.com/d/forum/project-m36)
46* [Mailing List/Discussion Group](https://groups.google.com/d/forum/project-m36)
45−* IRC Channel: chat.freenode.net #project-m36
47+* IRC Channel: irc.libera.chat #project-m36 -- [Chat via Web Client](http://kiwiirc.com/nextclient/irc.libera.chat:+6697/#project-m36)
46* [Hackage](https://hackage.haskell.org/package/project-m36)
48* [Hackage](https://hackage.haskell.org/package/project-m36)
47* [Diogo Biazus' Project:M36 Video Tutorial](https://www.youtube.com/watch?v=_GC_lxlVEnE)
49* [Diogo Biazus' Project:M36 Video Tutorial](https://www.youtube.com/watch?v=_GC_lxlVEnE)
48
50
@@ -52,22 +54,26 @@ Project:M36 supports multiple frontends which target different audiences.
52
54
531. [Installation and Introduction to Project:M36](docs/introduction_to_projectm36.markdown)
551. [Installation and Introduction to Project:M36](docs/introduction_to_projectm36.markdown)
541. [Introduction to the Relational Algebra](docs/introduction_to_the_relational_algebra.markdown)
561. [Introduction to the Relational Algebra](docs/introduction_to_the_relational_algebra.markdown)
57+1. [TutorialD Cheatsheet](docs/tutd_cheatsheet.markdown)
551. [TutorialD via Jupyter Notebook Walkthrough](jupyter/TutorialD%20Notebook%20Walkthrough.ipynb)
581. [TutorialD via Jupyter Notebook Walkthrough](jupyter/TutorialD%20Notebook%20Walkthrough.ipynb)
561. [TutorialD Tutorial](docs/tutd_tutorial.markdown)
591. [TutorialD Tutorial](docs/tutd_tutorial.markdown)
571. [15 Minute Tutorial](docs/15_minute_tutorial.markdown)
601. [15 Minute Tutorial](docs/15_minute_tutorial.markdown)
581. [Developer's Change Log](Changelog.markdown)
611. [Developer's Change Log](Changelog.markdown)
591. [Simple Client API](docs/simple_api.markdown)
621. [Simple Client API](docs/simple_api.markdown)
63+1. [CSV Import/Export](docs/import_export_csv.markdown)
60
64
61### Database Comparisons
65### Database Comparisons
62
66
631. [ACID Database Properties](docs/acid_assessment.markdown)
671. [ACID Database Properties](docs/acid_assessment.markdown)
641. [On NULL (in SQL)](docs/on_null.markdown)
681. [On NULL (in SQL)](docs/on_null.markdown)
651. [Reaching "Out of the Tarpit" with Project:M36](docs/reaching_out_of_the_tarpit.markdown)
691. [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)
66
71
67### Advanced Features
72### Advanced Features
68
73
691. [Transaction Graph Operators](docs/transaction_graph_operators.markdown)
741. [Transaction Graph Operators](docs/transaction_graph_operators.markdown)
701. [ProjectM36.Client Library](docs/projectm36_client_library.markdown)
751. [ProjectM36.Client Library](docs/projectm36_client_library.markdown)
76+1. [Data Frames for Sorting](docs/dataframes.markdown)
711. [Adding New Data Types](docs/new_datatypes.markdown)
771. [Adding New Data Types](docs/new_datatypes.markdown)
721. [Database-Manipulating Functions](docs/database_context_functions.markdown)
781. [Database-Manipulating Functions](docs/database_context_functions.markdown)
731. [Serving Remote ProjectM36 Databases](docs/server_mode.markdown)
791. [Serving Remote ProjectM36 Databases](docs/server_mode.markdown)
@@ -78,15 +84,17 @@ Project:M36 supports multiple frontends which target different audiences.
781. [Isomorphic Schemas](docs/isomorphic_schemas.markdown)
841. [Isomorphic Schemas](docs/isomorphic_schemas.markdown)
791. [Replication](docs/replication.markdown)
851. [Replication](docs/replication.markdown)
801. [Basic Operator Benchmarks](https://rawgit.com/agentm/project-m36/master/docs/basic_benchmarks.html)
861. [Basic Operator Benchmarks](https://rawgit.com/agentm/project-m36/master/docs/basic_benchmarks.html)
87+1. [Merkle Transaction Hashes](docs/merkle_transaction_graph.markdown)
81
88
82### Integrations
89### Integrations
83
90
841. [WebSocket Server](docs/websocket_server.markdown)
911. [WebSocket Server](docs/websocket_server.markdown)
851. [Jupyter Notebook Kernel](docs/jupyter_kernel.markdown)
921. [Jupyter Notebook Kernel](docs/jupyter_kernel.markdown)
93+1. [Persistent Driver](https://github.com/YuMingLiao/persistent-project-m36)
86
94
87## Development
95## Development
88
96
89−Project:M36 is developed in Haskell and compiled with GHC 7.10 or GHC 8.0.2 or later.
97+Project:M36 is developed in Haskell and compiled with GHC 8.6 or later.
90
98
91## Related Projects
99## Related Projects
92
100
cabal.project+9−2
@@ -1,3 +1,10 @@
1−-- this is needed for GHC8 until distributed-process-extras is updated on Hackage with increased upper bounds
2packages: project-m36.cabal
1packages: project-m36.cabal
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
2+
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
default.nixnew file+1
@@ -0,0 +1 @@
1+(import ./release.nix { }).project
docker.nixnew file+18
@@ -0,0 +1,18 @@
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+65−68
@@ -4,40 +4,34 @@ Thank you for evaluating Project:M36, a new relational algebra engine written in
4
4
5## Prerequisites
5## Prerequisites
6
6
7−* any Linux
7+* any Linux, MacOS, or Windows computer with Docker installed
8−* GHC 7.10 or later version (Haskell compiler)
9−* cabal (package downloader) installed
10
8
11## Download and Install
9## Download and Install
12
10
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+
13```bash
17```bash
14git clone https://github.com/agentm/project-m36.git
18git clone https://github.com/agentm/project-m36.git
15−cabal sandbox init
16−cabal install --dependencies-only
17−cabal run tutd
19+cabal new-run tutd
18```
20```
19
21
20## Some Basic TutorialD
22## Some Basic TutorialD
21
23
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.
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.
23
25
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.
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.
25
27
26### Load the Canonical Chris Date Example
28### Load the Canonical Chris Date Example
27
29
28```
30```
29−TutorialD (master/main): :importexample date
31+TutorialD (master/main): :importexample cjdate
30−```
31−
32−or
33−
34−```
35−TutorialD (master/main): :importtud "scripts/DateExamples.tutd"
36```
32```
37
33
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.
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.
39−
40−```:importexample date``` loads the date example directly without any file I/O, so it is safe to use with the websocket server.
41
35
42### Execute Relational Expressions
36### Execute Relational Expressions
43
37
@@ -164,7 +158,7 @@ Database context expressions change the state of the database, much like "CREATE
164#### Create a Relation Variable
158#### Create a Relation Variable
165
159
166```
160```
167−TutorialD (master/main): x:=relation{name Text, age Int}{tuple{name "Steve", age 40},tuple{name "Mike", age 31}}
161+TutorialD (master/main): x:=relation{name Text, age Integer}{tuple{name "Steve", age 40},tuple{name "Mike", age 31}}
168TutorialD (master/main): :showexpr x
162TutorialD (master/main): :showexpr x
169┌────────┬──────────┐
163┌────────┬──────────┐
170│age::Int│name::Text│
164│age::Int│name::Text│
@@ -179,23 +173,25 @@ This is similar to SQL's "CREATE TABLE" operator.
179#### Insert Additional Tuples
173#### Insert Additional Tuples
180
174
181```
175```
182−TutorialD (master/main): x:=relation{name Text, age Int}{tuple{name "Steve", age 40},tuple{name "Mike", age 31}}
176+TutorialD (master/main): x:=relation{name Text, age Integer}{tuple{name "Steve", age 40},tuple{name "Mike", age 31}}
183TutorialD (master/main): :showexpr x
177TutorialD (master/main): :showexpr x
184−┌────────┬──────────┐
178+┌────────────┬──────────┐
185−│age::Int│name::Text│
179+│age::Integer│name::Text│
186−├────────┼──────────┤
180+├────────────┼──────────┤
181+│31 │"Mike" │
187−│40 │"Steve" │
182+│40 │"Steve" │
188−│31 │"Mike" │
189−└────────┴──────────┘
183+└────────────┴──────────┘
184+
190TutorialD (master/main): insert x relation{tuple{name "Bob", age 24}}
185TutorialD (master/main): insert x relation{tuple{name "Bob", age 24}}
191TutorialD (master/main): :showexpr x
186TutorialD (master/main): :showexpr x
192−┌────────┬──────────┐
187+┌────────────┬──────────┐
193−│age::Int│name::Text│
188+│age::Integer│name::Text│
194−├────────┼──────────┤
189+├────────────┼──────────┤
190+│31 │"Mike" │
195−│40 │"Steve" │
191+│40 │"Steve" │
196−│24 │"Bob" │
192+│24 │"Bob" │
197−│31 │"Mike" │
198−└────────┴──────────┘
193+└────────────┴──────────┘
194+
199```
195```
200
196
201Note that the relational insertion is identical to "x:=x union relation{...}".
197Note that the relational insertion is identical to "x:=x union relation{...}".
@@ -204,50 +200,51 @@ Note that the relational insertion is identical to "x:=x union relation{...}".
204
200
205```
201```
206TutorialD (master/main): :showexpr s
202TutorialD (master/main): :showexpr s
207−┌──────────┬────────┬───────────┬───────────┐
203+┌──────────┬────────┬───────────┬───────────────┐
208−│city::Text│s#::Text│sname::Text│status::Int│
204+│city::Text│s#::Text│sname::Text│status::Integer│
209−├──────────┼────────┼───────────┼───────────┤
205+├──────────┼────────┼───────────┼───────────────┤
210−│"Paris" │"S2" │"Jones" │10 │
211−│"Paris" │"S3" │"Blake" │30 │
212−│"London" │"S1" │"Smith" │20 │
206+│"London" │"S1" │"Smith" │20 │
213−│"London" │"S4" │"Clark" │20 │
214−│"Athens" │"S5" │"Adams" │30 │
207+│"Athens" │"S5" │"Adams" │30 │
208+│"Paris" │"S3" │"Blake" │30 │
209+│"London" │"S4" │"Clark" │20 │
210+│"Paris" │"S2" │"Jones" │10 │
215−└──────────┴────────┴───────────┴───────────┘
211+└──────────┴────────┴───────────┴───────────────┘
216TutorialD (master/main): update s where city="London" (status:=35)
212TutorialD (master/main): update s where city="London" (status:=35)
217TutorialD (master/main): :showexpr s
213TutorialD (master/main): :showexpr s
218−┌──────────┬────────┬───────────┬───────────┐
214+┌──────────┬────────┬───────────┬───────────────┐
219−│city::Text│s#::Text│sname::Text│status::Int│
215+│city::Text│s#::Text│sname::Text│status::Integer│
220−├──────────┼────────┼───────────┼───────────┤
216+├──────────┼────────┼───────────┼───────────────┤
217+│"Athens" │"S5" │"Adams" │30 │
218+│"London" │"S1" │"Smith" │35 │
221−│"London" │"S4" │"Clark" │35 │
219+│"London" │"S4" │"Clark" │35 │
222−│"London" │"S1" │"Smith" │35 │
220+│"Paris" │"S3" │"Blake" │30 │
223−│"Paris" │"S2" │"Jones" │10 │
221+│"Paris" │"S2" │"Jones" │10 │
224−│"Paris" │"S3" │"Blake" │30 │
225−│"Athens" │"S5" │"Adams" │30 │
226−└──────────┴────────┴───────────┴───────────┘
222+└──────────┴────────┴───────────┴───────────────┘
223+
227```
224```
228#### Deleting Tuples from a Relation Variable
225#### Deleting Tuples from a Relation Variable
229
226
230```
227```
231TutorialD (master/main): :showexpr s
228TutorialD (master/main): :showexpr s
232−┌──────────┬────────┬───────────┬───────────┐
229+┌──────────┬────────┬───────────┬───────────────┐
233−│city::Text│s#::Text│sname::Text│status::Int│
230+│city::Text│s#::Text│sname::Text│status::Integer│
234−├──────────┼────────┼───────────┼───────────┤
231+├──────────┼────────┼───────────┼───────────────┤
235−│"Paris" │"S2" │"Jones" │10 │
232+│"Paris" │"S2" │"Jones" │10 │
236−│"Paris" │"S3" │"Blake" │30 │
233+│"Paris" │"S3" │"Blake" │30 │
237−│"London" │"S1" │"Smith" │20 │
234+│"London" │"S1" │"Smith" │20 │
238−│"London" │"S4" │"Clark" │20 │
239−│"Athens" │"S5" │"Adams" │30 │
235+│"Athens" │"S5" │"Adams" │30 │
236+│"London" │"S4" │"Clark" │20 │
240−└──────────┴────────┴───────────┴───────────┘
237+└──────────┴────────┴───────────┴───────────────┘
241TutorialD (master/main): delete s where sname="Adams"
238TutorialD (master/main): delete s where sname="Adams"
242TutorialD (master/main): :showexpr s
239TutorialD (master/main): :showexpr s
243−┌──────────┬────────┬───────────┬───────────┐
240+┌──────────┬────────┬───────────┬───────────────┐
244−│city::Text│s#::Text│sname::Text│status::Int│
241+│city::Text│s#::Text│sname::Text│status::Integer│
245−├──────────┼────────┼───────────┼───────────┤
242+├──────────┼────────┼───────────┼───────────────┤
246−│"Paris" │"S2" │"Jones" │10 │
243+│"Paris" │"S2" │"Jones" │10 │
244+│"London" │"S4" │"Clark" │20 │
247−│"Paris" │"S3" │"Blake" │30 │
245+│"Paris" │"S3" │"Blake" │30 │
248−│"London" │"S1" │"Smith" │20 │
246+│"London" │"S1" │"Smith" │20 │
249−│"London" │"S4" │"Clark" │20 │
250−└──────────┴────────┴───────────┴───────────┘
247+└──────────┴────────┴───────────┴───────────────┘
251```
248```
252
249
253### Execute Transaction Graph Expressions
250### Execute Transaction Graph Expressions
@@ -270,7 +267,7 @@ TutorialD (master/main): :rollback
270
267
271```
268```
272TutorialD (master/main): :branch experimental
269TutorialD (master/main): :branch experimental
273−TutorialD (experimental): employee:=relation{name Text, salary Int}
270+TutorialD (experimental): employee:=relation{name Text, salary Integer}
274TutorialD (experimental): :commit
271TutorialD (experimental): :commit
275```
272```
276
273
docs/atomfunctions.markdown+31−2
@@ -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.
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.
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,6 +41,35 @@ 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+
44## Differences when compared to other DBMSes
73## Differences when compared to other DBMSes
45
74
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.
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.
docs/commits_in_constant_time.markdownnew file+134
@@ -0,0 +1,134 @@
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.markdownnew file+109
@@ -0,0 +1,109 @@
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+51−1
@@ -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 this feature in Project:M36, be sure to build your own Project:M36 library so that the optional scripting is enabled.
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.
10
10
11## Database Context Function Types
11## Database Context Function Types
12
12
@@ -112,6 +112,56 @@ 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+
115## Future Improvements
165## Future Improvements
116
166
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.
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.
docs/dataframes.markdownnew file+53
@@ -0,0 +1,53 @@
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
1+# Project-M36 Filesystem Persistence (Change Proposal)
2
2
3## Introduction
3## Introduction
4
4
docs/import_export_csv.markdownnew file+65
@@ -0,0 +1,65 @@
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+33−12
@@ -15,38 +15,59 @@ The relational algebra is the mathematical model underpinning Project:M36. When
15
15
16## Binary Releases
16## Binary Releases
17
17
18−### Windows
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.
19−Project:M36 now provides binary installations for Windows. Check the (releases page)[https://github.com/agentm/project-m36/releases] for downloads.
20
19
21−### MacOS X
20+### Install Docker:
22
21
23−Binary releases are not yet available for MacOS X, but compiling from source is easy.
22+* [Windows 10 Docker Installation](https://docs.docker.com/docker-for-windows/wsl/)
23+* [MacOS Docker Installation](https://docs.docker.com/docker-for-mac/install/)
24+* [Linux Docker Installation](https://docs.docker.com/engine/install/#server)
24
25
25−### Linux
26+### Run TutorialD from Docker Image
26
27
27−The currently-preferred method of installation is from source. A future enhancement would be installation from deb or rpm.
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.
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+```
28
47
29## Source Installation
48## Source Installation
30
49
31Requirements:
50Requirements:
32
51
52+To build with stack:
53+
33−* [GHC 7.10 or greater](https://www.haskell.org/downloads)
54+* [GHC 8.6.5 or greater](https://www.haskell.org/downloads)
34* [Haskell stack](https://docs.haskellstack.org/en/stable/README/)
55* [Haskell stack](https://docs.haskellstack.org/en/stable/README/)
35−* Linux, MacOS X, or Windows OS
56+* Linux, macOS, or Microsoft Windows
36
57
37Compilation steps:
58Compilation steps:
38
59
39* ```git clone https://github.com/agentm/project-m36```
60* ```git clone https://github.com/agentm/project-m36```
40* ```cd project-m36```
61* ```cd project-m36```
41−* ```stack build```
62+* ```stack --stack-yaml stack.ghc8.6.yaml build```
42
63
43At this point, the TutorialD interactive interpreter can be run using ```stack exec tutd```.
64At this point, the TutorialD interactive interpreter can be run using ```stack exec tutd```.
44
65
45−Alternative building with GHC 8.0.x:
66+Alternative building with GHC 8.6.5 or greater:
46
67
47* ```cabal new-build```
68* ```cabal new-build```
48
69
49−The resultant binaries can be found in ```./dist-newstyle/build/project-m36-0.1/build```.
70+The resultant binaries can be found in ```./dist-newstyle/build/project-m36-<version>/build```.
50
71
51## Accessing Project:M36 Databases
72## Accessing Project:M36 Databases
52
73
@@ -87,7 +108,7 @@ Decreasing a transaction's durability can reduce IO contention at the cost of re
87
108
88### Native Haskell Compatibility
109### Native Haskell Compatibility
89
110
90−Any Haskell data type which implements the ```Atom``` typeclass can be manipulated as a value in the database.
111+Any Haskell data type which implements the ```Atomable``` typeclass can be manipulated as a value in the database.
91
112
92Haskell functions which operate on those values can also be added to the database.
113Haskell functions which operate on those values can also be added to the database.
93
114
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, Instructor Name Type)|(Course Room Number, Room Number Type)|
205+|(Course Name, Course Name Type)|(Instructor Name, 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 whic the aggregate was derived.
381+In the relational algebra, The aggregate value can be placed alongside the relation value from which the aggregate was derived.
382
382
383Example:
383Example:
384
384
docs/merkle_transaction_graph.markdownnew file+33
@@ -0,0 +1,33 @@
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 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.
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.
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 date
60+TutorialD (master/main): :importexample cjdate
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 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```.
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```.
12
12
13## Connecting an Interactive Client
13## Connecting an Interactive Client
14
14
docs/transaction_graph_operators.markdown+8−18
@@ -10,23 +10,11 @@ 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?
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})
14−digraph G {
15− base[label="base transaction",shape=rectangle];
16− new[label="mutable database context"];
17− new -> base;
18−})
19
14
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.
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.
21
16
22−![Freshly committed transaction](http://g.gravizo.com/g?
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})
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−})
30
18
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.
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.
32
20
@@ -55,15 +43,17 @@ TutorialD (master/main): :rollback
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.
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.
56
44
57```
45```
58−TutorialD (master/main): :showgraph
59−┌─────────────┬──────────┬──────────────────────────────────────┬────────────────────────────┬──────────────────────────────┐
46+┌─────────────┬────────────────────────────────────────────┬──────────┬──────────────────────────────────────┬────────────────────────────────────────┬─────────────────────────────────┐
60−│current::Bool│head::Text│id::Text │parents::relation {id::Text}│stamp::DateTime │
47+│current::Bool│hash::ByteString │head::Text│id::Text │parents::relation {id::Text} │stamp::DateTime │
61−├─────────────┼──────────┼──────────────────────────────────────┼────────────────────────────┼──────────────────────────────┤
48+├─────────────┼────────────────────────────────────────────┼──────────┼──────────────────────────────────────┼────────────────────────────────────────┼─────────────────────────────────┤
49+
62
50
63<big result elided>
51<big result elided>
64```
52```
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.
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.
66
54
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+
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.
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.
68
58
69The "id" attribute is the UUID needed in order to navigate the graph.
59The "id" attribute is the UUID needed in order to navigate the graph.
docs/tupleable.markdown+19
@@ -23,6 +23,25 @@ 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+
26## Usage
45## Usage
27
46
28The ```Tupleable``` module includes the following functions:
47The ```Tupleable``` module includes the following functions:
docs/tutd_cheatsheet.markdownnew file+99
@@ -0,0 +1,99 @@
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+268−186
@@ -14,20 +14,55 @@ 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+
17### Types
51### Types
18
52
19TutorialD is strongly-typed. The basic built-in types are:
53TutorialD is strongly-typed. The basic built-in types are:
20
54
21|Type Name|Explanation|Example|
55|Type Name|Explanation|Example|
22|---------|-----------|-------|
56|---------|-----------|-------|
23−|text|arbitrary text|"The Old Man and the Sea"|
57+|Text|arbitrary text|"The Old Man and the Sea"|
24−|int|any integer|-4|
58+|Integer|arbitarily-sized integer|-4|
59+|Int|machine word integer|int(10)|
25−|datetime|timestamp UTC|dateTimeFromEpochSeconds(1502304846)|
60+|DateTime|timestamp UTC|dateTimeFromEpochSeconds(1502304846)|
26−|date|calendar date|fromGregorian(2017,05,30)|
61+|Date|calendar date|fromGregorian(2017,05,30)|
27−|double|floating point number|3.1459|
62+|Double|floating point number|3.1459|
28−|bool|boolean value|t|
63+|Bool|boolean value|t|
29−|bytestring|arbitrary-length string of bytes- input is base64-encoded|bytestring("dGVzdGRhdGE=")|
64+|Bytestring|arbitrary-length string of bytes- input is base64-encoded|bytestring("dGVzdGRhdGE=")|
30−|interval x|interval/range type for ints, doubles, datetimes, and dates|interval(3,5,f,f)|
65+|Interval x|interval/range type for ints, doubles, datetimes, and dates|interval(3,5,f,f)|
31
66
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.
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.
33
68
@@ -36,7 +71,7 @@ The ```interval``` function last two arguments are boolean values indicating whe
36Project:M36 will complain loudly if the expected types do not match. Automatic type coercion does not exist.
71Project:M36 will complain loudly if the expected types do not match. Automatic type coercion does not exist.
37
72
38```
73```
39−TutorialD (master/main): :showexpr S:{more:=add(10,@sname)}
74+TutorialD (master/main): :showexpr s:{more:=add(10,@sname)}
40ERR: AtomFunctionTypeError "add" 2 IntAtomType StringAtomType
75ERR: AtomFunctionTypeError "add" 2 IntAtomType StringAtomType
41```
76```
42
77
@@ -48,7 +83,7 @@ Relation Variables are named cells which reference relations within a transactio
48
83
49Definition of a relation variable:
84Definition of a relation variable:
50```
85```
51−products :: {name char, age int}
86+products :: {name Text, age Integer}
52```
87```
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.
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.
54
89
@@ -67,22 +102,6 @@ Chris Date refers to these relations as "TABLE_DUM" and "TABLE_DEE" but such arb
67products{}
102products{}
68```
103```
69
104
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−
86### Relational Expressions
105### Relational Expressions
87
106
88A relational expression combines relational operators to create a new relation. ```tutd``` can display the result of executing a relational expression with ":showexpr".
107A relational expression combines relational operators to create a new relation. ```tutd``` can display the result of executing a relational expression with ":showexpr".
@@ -151,15 +170,15 @@ The unary rename operator outputs a new relation with chosen attributes renamed.
151
170
152```
171```
153TutorialD (master/main): :showexpr s rename {city as town}
172TutorialD (master/main): :showexpr s rename {city as town}
154−┌──┬─────┬──────┬──────┐
173+┌────────┬───────────┬───────────────┬──────────┐
155−│s#│sname│status│town │
174+│s#::Text│sname::Text│status::Integer│town::Text│
156−├──┼─────┼──────┼──────┤
175+├────────┼───────────┼───────────────┼──────────┤
157−│S3│Blake│30 │Paris │
176+│"S3" │"Blake" │30 │"Paris" │
158−│S4│Clark│20 │London│
177+│"S4" │"Clark" │20 │"London" │
159−│S5│Adams│30 │Athens│
178+│"S5" │"Adams" │30 │"Athens" │
160−│S1│Smith│20 │London│
179+│"S1" │"Smith" │20 │"London" │
161−│S2│Jones│10 │Paris │
180+│"S2" │"Jones" │10 │"Paris" │
162−└──┴─────┴──────┴──────┘
181+└────────┴───────────┴───────────────┴──────────┘
163```
182```
164
183
165#### Projection
184#### Projection
@@ -170,14 +189,15 @@ For example:
170
189
171```
190```
172TutorialD (master/main): :showexpr p{color,city}
191TutorialD (master/main): :showexpr p{color,city}
173−┌──────┬─────┐
192+┌──────────┬───────────┐
174−│city │color│
193+│city::Text│color::Text│
175−├──────┼─────┤
194+├──────────┼───────────┤
176−│London│Red │
195+│"London" │"Red" │
177−│Paris │Blue │
196+│"Paris" │"Green" │
178−│Oslo │Blue │
197+│"Oslo" │"Blue" │
179−│Paris │Green│
198+│"Paris" │"Blue" │
180−└──────┴─────┘
199+└──────────┴───────────┘
200+
181```
201```
182
202
183Projection attributes can also be inverted using `all but`:
203Projection attributes can also be inverted using `all but`:
@@ -195,7 +215,7 @@ TutorialD (master/main): :showexpr s{all but city}
195└────────┴───────────┴───────────────┘
215└────────┴───────────┴───────────────┘
196```
216```
197
217
198−Projection attributes can also be derived from a relational expression using `all from`:
218+Projection attributes can be derived from a relational expression using `all from`:
199
219
200```
220```
201TutorialD (master/main): :showexpr (s join sp){all from s}
221TutorialD (master/main): :showexpr (s join sp){all from s}
@@ -211,28 +231,64 @@ TutorialD (master/main): :showexpr (s join sp){all from s}
211
231
212Above, we join `s` and `sp` but project the result back onto the attributes of `s`.
232Above, we join `s` and `sp` but project the result back onto the attributes of `s`.
213
233
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+
214#### Restriction
270#### Restriction
215
271
216Restriction is applied using a "where" clause, much like in SQL.
272Restriction is applied using a "where" clause, much like in SQL.
217
273
218```
274```
219TutorialD (master/main): :showexpr p where color="Blue" and city="Paris"
275TutorialD (master/main): :showexpr p where color="Blue" and city="Paris"
220−┌─────┬─────┬──┬─────┬──────┐
276+┌──────────┬───────────┬────────┬───────────┬───────────────┐
221−│city │color│p#│pname│weight│
277+│city::Text│color::Text│p#::Text│pname::Text│weight::Integer│
222−├─────┼─────┼──┼─────┼──────┤
278+├──────────┼───────────┼────────┼───────────┼───────────────┤
223−│Paris│Blue │P5│Cam │12 │
279+│"Paris" │"Blue" │"P5" │"Cam" │12 │
224−└─────┴─────┴──┴─────┴──────┘
280+└──────────┴───────────┴────────┴───────────┴───────────────┘
225```
281```
226
282
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:
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:
228
284
229```
285```
230TutorialD (master/main): :showexpr s where ^lt(@status,20)
286TutorialD (master/main): :showexpr s where ^lt(@status,20)
231−┌─────┬──┬─────┬──────┐
287+┌──────────┬────────┬───────────┬───────────────┐
232−│city │s#│sname│status│
288+│city::Text│s#::Text│sname::Text│status::Integer│
233−├─────┼──┼─────┼──────┤
289+├──────────┼────────┼───────────┼───────────────┤
234−│Paris│S2│Jones│10 │
290+│"Paris" │"S2" │"Jones" │10 │
235−└─────┴──┴─────┴──────┘
291+└──────────┴────────┴───────────┴───────────────┘
236```
292```
237
293
238#### Join
294#### Join
@@ -241,21 +297,22 @@ Joins are binary operators and are applied with the "join" keyword. The equivale
241
297
242```
298```
243TutorialD (master/main): :showexpr s join sp
299TutorialD (master/main): :showexpr s join sp
244−┌──────┬──┬───┬──┬─────┬──────┐
300+┌──────────┬────────┬────────────┬────────┬───────────┬───────────────┐
245−│city │p#│QTY│s#│sname│status│
301+│city::Text│p#::Text│qty::Integer│s#::Text│sname::Text│status::Integer│
246−├──────┼──┼───┼──┼─────┼──────┤
302+├──────────┼────────┼────────────┼────────┼───────────┼───────────────┤
303+│"London" │"P2" │200 │"S1" │"Smith" │20 │
247−│London│P6│100│S1│Smith│20 │
304+│"London" │"P6" │100 │"S1" │"Smith" │20 │
248−│London│P3│400│S1│Smith│20 │
305+│"London" │"P3" │400 │"S1" │"Smith" │20 │
306+│"Paris" │"P2" │400 │"S2" │"Jones" │10 │
249−│London│P5│400│S4│Clark│20 │
307+│"London" │"P5" │400 │"S4" │"Clark" │20 │
308+│"Paris" │"P1" │300 │"S2" │"Jones" │10 │
250−│London│P1│300│S1│Smith│20 │
309+│"London" │"P1" │300 │"S1" │"Smith" │20 │
251−│Paris │P2│200│S3│Blake│30 │
310+│"Paris" │"P2" │200 │"S3" │"Blake" │30 │
252−│Paris │P1│300│S2│Jones│10 │
311+│"London" │"P4" │300 │"S4" │"Clark" │20 │
253−│London│P5│100│S1│Smith│20 │
254−│London│P4│300│S4│Clark│20 │
312+│"London" │"P2" │200 │"S4" │"Clark" │20 │
255−│Paris │P2│400│S2│Jones│10 │
256−│London│P2│200│S1│Smith│20 │
313+│"London" │"P4" │200 │"S1" │"Smith" │20 │
257−│London│P4│200│S1│Smith│20 │
314+│"London" │"P5" │100 │"S1" │"Smith" │20 │
258−└──────┴──┴───┴──┴─────┴──────┘
315+└──────────┴────────┴────────────┴────────┴───────────┴───────────────┘
259```
316```
260
317
261As a convenience, `tutd` also supports semijoin (`matching`) and antijoin (`not matching`) syntax.
318As a convenience, `tutd` also supports semijoin (`matching`) and antijoin (`not matching`) syntax.
@@ -269,16 +326,16 @@ As a convenience, `tutd` also supports semijoin (`matching`) and antijoin (`not
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.
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.
270
327
271```
328```
272−TutorialD (master/main): :showexpr S union S
329+TutorialD (master/main): :showexpr s union s
273−┌──────┬──┬─────┬──────┐
330+┌──────────┬────────┬───────────┬───────────────┐
274−│city │s#│sname│status│
331+│city::Text│s#::Text│sname::Text│status::Integer│
275−├──────┼──┼─────┼──────┤
332+├──────────┼────────┼───────────┼───────────────┤
276−│Paris │S3│Blake│30 │
333+│"Paris" │"S3" │"Blake" │30 │
277−│London│S4│Clark│20 │
278−│Athens│S5│Adams│30 │
334+│"Athens" │"S5" │"Adams" │30 │
279−│London│S1│Smith│20 │
335+│"London" │"S1" │"Smith" │20 │
280−│Paris │S2│Jones│10 │
336+│"Paris" │"S2" │"Jones" │10 │
337+│"London" │"S4" │"Clark" │20 │
281−└──────┴──┴─────┴──────┘
338+└──────────┴────────┴───────────┴───────────────┘
282```
339```
283
340
284The union of any relation with itself is itself.
341The union of any relation with itself is itself.
@@ -289,15 +346,15 @@ The extend unary operator adds an attribute to a relation's header and body and
289
346
290```
347```
291TutorialD (master/main): :showexpr s:{status2:=add(10,@status)}
348TutorialD (master/main): :showexpr s:{status2:=add(10,@status)}
292−┌──────┬──┬─────┬──────┬───────┐
349+┌──────────┬────────┬───────────┬───────────────┬────────────────┐
293−│city │s#│sname│status│status2│
350+│city::Text│s#::Text│sname::Text│status::Integer│status2::Integer│
294−├──────┼──┼─────┼──────┼───────┤
351+├──────────┼────────┼───────────┼───────────────┼────────────────┤
295−│Paris │S2│Jones│10 │20 │
352+│"Paris" │"S2" │"Jones" │10 │20 │
296−│Athens│S5│Adams│30 │40 │
353+│"Athens" │"S5" │"Adams" │30 │40 │
354+│"London" │"S4" │"Clark" │20 │30 │
297−│Paris │S3│Blake│30 │40 │
355+│"Paris" │"S3" │"Blake" │30 │40 │
298−│London│S1│Smith│20 │30 │
356+│"London" │"S1" │"Smith" │20 │30 │
299−│London│S4│Clark│20 │30 │
300−└──────┴──┴─────┴──────┴───────┘
357+└──────────┴────────┴───────────┴───────────────┴────────────────┘
301```
358```
302
359
303The "@" is required in the above query in order to distinguish the attribute's name from a relation's name.
360The "@" is required in the above query in order to distinguish the attribute's name from a relation's name.
@@ -323,27 +380,27 @@ The group operator can also be used to emulate functionality similar to SQL's OU
323
380
324```
381```
325TutorialD (master/main): :showexpr s group ({sname,status,s#} as subrel)
382TutorialD (master/main): :showexpr s group ({sname,status,s#} as subrel)
326−┌──────┬─────────────────┐
383+┌──────────┬───────────────────────────────────────────────────────┐
327−│city │subrel │
384+│city::Text│subrel::relation {s#::Text,sname::Text,status::Integer}│
328−├──────┼─────────────────┤
385+├──────────┼───────────────────────────────────────────────────────┤
329−│Athens│┌──┬─────┬──────┐│
386+│"Athens" │┌────────┬───────────┬───────────────┐ │
330−│ ││s#│sname│status││
387+│ ││s#::Text│sname::Text│status::Integer│ │
331−│ │├──┼─────┼──────┤│
388+│ │├────────┼───────────┼───────────────┤ │
332−│ ││S5│Adams│30 ││
389+│ ││"S5" │"Adams" │30 │ │
333−│ │└──┴─────┴──────┘│
334−│London│┌──┬─────┬──────┐│
335−│ ││s#│sname│status││
336−│ │├──┼─────┼──────┤│
337−│ ││S1│Smith│20 ││
338−│ ││S4│Clark│20 ││
339−│ │└──┴─────┴──────┘│
390+│ │└────────┴───────────┴───────────────┘ │
340−│Paris │┌──┬─────┬──────┐│
391+│"Paris" │┌────────┬───────────┬───────────────┐ │
341−│ ││s#│sname│status││
392+│ ││s#::Text│sname::Text│status::Integer│ │
342−│ │├──┼─────┼──────┤│
393+│ │├────────┼───────────┼───────────────┤ │
343−│ ││S3│Blake│30 ││
344−│ ││S2│Jones│10 ││
394+│ ││"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 │ │
345−│ │└──┴─────┴──────┘│
402+│ │└────────┴───────────┴───────────────┘ │
346−└──────┴─────────────────┘
403+└──────────┴───────────────────────────────────────────────────────┘
347```
404```
348
405
349#### Ungroup
406#### Ungroup
@@ -352,15 +409,15 @@ The unary ungroup operator "unwraps" subrelations in a relation-valued attribute
352
409
353```
410```
354TutorialD (master/main): :showexpr (s group ({sname,status,s#} as subrel)) ungroup subrel
411TutorialD (master/main): :showexpr (s group ({sname,status,s#} as subrel)) ungroup subrel
355−┌──────┬──┬─────┬──────┐
412+┌──────────┬────────┬───────────┬───────────────┐
356−│city │s#│sname│status│
413+│city::Text│s#::Text│sname::Text│status::Integer│
357−├──────┼──┼─────┼──────┤
414+├──────────┼────────┼───────────┼───────────────┤
415+│"Paris" │"S2" │"Jones" │10 │
358−│Paris │S3│Blake│30 │
416+│"Paris" │"S3" │"Blake" │30 │
359−│London│S4│Clark│20 │
417+│"London" │"S4" │"Clark" │20 │
418+│"London" │"S1" │"Smith" │20 │
360−│Athens│S5│Adams│30 │
419+│"Athens" │"S5" │"Adams" │30 │
361−│London│S1│Smith│20 │
362−│Paris │S2│Jones│10 │
363−└──────┴──┴─────┴──────┘
420+└──────────┴────────┴───────────┴───────────────┘
364```
421```
365
422
366#### Minus
423#### Minus
@@ -393,11 +450,11 @@ The relation variable assignment mentioned above certainly changes the state of
393```
450```
394TutorialD (master/main): newrelvar:=relation{tuple{age 3}}
451TutorialD (master/main): newrelvar:=relation{tuple{age 3}}
395TutorialD (master/main): :showexpr newrelvar
452TutorialD (master/main): :showexpr newrelvar
396−┌───┐
453+┌────────────┐
397−│age│
454+│age::Integer│
398−├───┤
455+├────────────┤
399−│3 │
456+│3 │
400−└───┘
457+└────────────┘
401```
458```
402
459
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.
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.
@@ -419,16 +476,16 @@ The insert operators accepts a relation variable and a relation of the same type
419```
476```
420TutorialD (master/main): insert s relation{tuple{city "Boston",s# "S10",sname "Gonzalez",status 10}}
477TutorialD (master/main): insert s relation{tuple{city "Boston",s# "S10",sname "Gonzalez",status 10}}
421TutorialD (master/main): :showexpr s
478TutorialD (master/main): :showexpr s
422−┌──────┬───┬────────┬──────┐
479+┌──────────┬────────┬───────────┬───────────────┐
423−│city │s# │sname │status│
480+│city::Text│s#::Text│sname::Text│status::Integer│
424−├──────┼───┼────────┼──────┤
481+├──────────┼────────┼───────────┼───────────────┤
425−│Paris │S3 │Blake │30 │
426−│London│S4 │Clark │20 │
427−│Athens│S5 │Adams │30 │
482+│"Athens" │"S5" │"Adams" │30 │
428−│London│S1 │Smith │20 │
429−│Paris │S2 │Jones │10 │
483+│"Paris" │"S2" │"Jones" │10 │
430−│Boston│S10│Gonzalez│10 │
484+│"Boston" │"S10" │"Gonzalez" │10 │
485+│"London" │"S4" │"Clark" │20 │
486+│"London" │"S1" │"Smith" │20 │
487+│"Paris" │"S3" │"Blake" │30 │
431−└──────┴───┴────────┴──────┘
488+└──────────┴────────┴───────────┴───────────────┘
432```
489```
433
490
434This insertion operation is equivalent to:
491This insertion operation is equivalent to:
@@ -443,15 +500,15 @@ The update operator accepts a relation argument and a predicate, optionally filt
443```
500```
444TutorialD (master/main): update s where status=20 (sname:="Mr. Twenty")
501TutorialD (master/main): update s where status=20 (sname:="Mr. Twenty")
445TutorialD (master/main): :showexpr s
502TutorialD (master/main): :showexpr s
446−┌──────┬──┬──────────┬──────┐
503+┌──────────┬────────┬────────────┬───────────────┐
447−│city │s#│sname │status│
504+│city::Text│s#::Text│sname::Text │status::Integer│
448−├──────┼──┼──────────┼──────┤
505+├──────────┼────────┼────────────┼───────────────┤
506+│"Paris" │"S2" │"Jones" │10 │
507+│"London" │"S1" │"Mr. Twenty"│20 │
449−│Paris │S3│Blake │30 │
508+│"Paris" │"S3" │"Blake" │30 │
450−│London│S1│Mr. Twenty│20 │
509+│"London" │"S4" │"Mr. Twenty"│20 │
451−│Athens│S5│Adams │30 │
510+│"Athens" │"S5" │"Adams" │30 │
452−│Paris │S2│Jones │10 │
453−│London│S4│Mr. Twenty│20 │
454−└──────┴──┴──────────┴──────┘
511+└──────────┴────────┴────────────┴───────────────┘
455```
512```
456
513
457This is logically equivalent to:
514This is logically equivalent to:
@@ -459,15 +516,15 @@ This is logically equivalent to:
459```
516```
460TutorialD (master/main): s:=(((s where status=20){city,s#,status}):{sname:="Mr. Twenty"}) union (s where not status=20)
517TutorialD (master/main): s:=(((s where status=20){city,s#,status}):{sname:="Mr. Twenty"}) union (s where not status=20)
461TutorialD (master/main): :showexpr s
518TutorialD (master/main): :showexpr s
462−┌──────┬──┬──────────┬──────┐
519+┌──────────┬────────┬────────────┬───────────────┐
463−│city │s#│sname │status│
520+│city::Text│s#::Text│sname::Text │status::Integer│
464−├──────┼──┼──────────┼──────┤
521+├──────────┼────────┼────────────┼───────────────┤
522+│"Paris" │"S2" │"Jones" │10 │
523+│"London" │"S1" │"Mr. Twenty"│20 │
465−│Paris │S3│Blake │30 │
524+│"Paris" │"S3" │"Blake" │30 │
466−│London│S1│Mr. Twenty│20 │
525+│"London" │"S4" │"Mr. Twenty"│20 │
467−│Athens│S5│Adams │30 │
526+│"Athens" │"S5" │"Adams" │30 │
468−│Paris │S2│Jones │10 │
469−│London│S4│Mr. Twenty│20 │
470−└──────┴──┴──────────┴──────┘
527+└──────────┴────────┴────────────┴───────────────┘
471```
528```
472
529
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."
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."
@@ -479,19 +536,19 @@ The delete operator accepts a relation argument and a filtering predicate, creat
479```
536```
480TutorialD (master/main): delete sp where s#="S4"
537TutorialD (master/main): delete sp where s#="S4"
481TutorialD (master/main): :showexpr sp
538TutorialD (master/main): :showexpr sp
482−┌──┬───┬──┐
539+┌────────┬────────────┬────────┐
483−│p#│QTY│s#│
540+│p#::Text│qty::Integer│s#::Text│
484−├──┼───┼──┤
541+├────────┼────────────┼────────┤
485−│P3│400│S1│
486−│P4│200│S1│
487−│P2│400│S2│
488−│P2│200│S1│
489−│P6│100│S1│
490−│P1│300│S1│
491−│P2│200│S3│
542+│"P2" │200 │"S3" │
543+│"P2" │400 │"S2" │
492−│P1│300│S2│
544+│"P1" │300 │"S1" │
493−│P5│100│S1│
545+│"P5" │100 │"S1" │
546+│"P4" │200 │"S1" │
547+│"P1" │300 │"S2" │
548+│"P3" │400 │"S1" │
549+│"P2" │200 │"S1" │
550+│"P6" │100 │"S1" │
494−└──┴───┴──┘
551+└────────┴────────────┴────────┘
495```
552```
496
553
497This is logically equivalent to:
554This is logically equivalent to:
@@ -526,7 +583,7 @@ Foreign keys are constraints which require that certain values appearing in one
526TutorialD (master/main): foreign key s#_in_sp sp{s#} in s{s#}
583TutorialD (master/main): foreign key s#_in_sp sp{s#} in s{s#}
527```
584```
528
585
529−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.
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.
530
587
531#### Functional dependencies
588#### Functional dependencies
532
589
@@ -560,27 +617,27 @@ SQL supports aggregate queries using aggregate functions (SUM(), COUNT(), AVERAG
560
617
561```
618```
562TutorialD (master/main): :showexpr s group ({s#,sname,status} as subrel):{citycount:=count(@subrel)}
619TutorialD (master/main): :showexpr s group ({s#,sname,status} as subrel):{citycount:=count(@subrel)}
563−┌──────┬─────────┬─────────────────┐
620+┌──────────┬──────────────────┬───────────────────────────────────────────────────────┐
564−│city │citycount│subrel │
621+│city::Text│citycount::Integer│subrel::relation {s#::Text,sname::Text,status::Integer}│
622+├──────────┼──────────────────┼───────────────────────────────────────────────────────┤
623+│"Athens" │1 │┌────────┬───────────┬───────────────┐ │
624+│ │ ││s#::Text│sname::Text│status::Integer│ │
565−├──────┼─────────┼─────────────────┤
625+│ │ │├────────┼───────────┼───────────────┤ │
626+│ │ ││"S5" │"Adams" │30 │ │
627+│ │ │└────────┴───────────┴───────────────┘ │
566−│Paris │2 │┌──┬─────┬──────┐│
628+│"Paris" │2 │┌────────┬───────────┬───────────────┐ │
567−│ │ ││s#│sname│status││
629+│ │ ││s#::Text│sname::Text│status::Integer│ │
568−│ │ │├──┼─────┼──────┤│
630+│ │ │├────────┼───────────┼───────────────┤ │
569−│ │ ││S3│Blake│30 ││
570−│ │ ││S2│Jones│10 ││
631+│ │ ││"S2" │"Jones" │10 │ │
632+│ │ ││"S3" │"Blake" │30 │ │
571−│ │ │└──┴─────┴──────┘│
633+│ │ │└────────┴───────────┴───────────────┘ │
572−│London│2 │┌──┬─────┬──────┐│
634+│"London" │2 │┌────────┬───────────┬───────────────┐ │
573−│ │ ││s#│sname│status││
635+│ │ ││s#::Text│sname::Text│status::Integer│ │
574−│ │ │├──┼─────┼──────┤│
636+│ │ │├────────┼───────────┼───────────────┤ │
637+│ │ ││"S4" │"Clark" │20 │ │
575−│ │ ││S1│Smith│20 ││
638+│ │ ││"S1" │"Smith" │20 │ │
576−│ │ ││S4│Clark│20 ││
577−│ │ │└──┴─────┴──────┘│
639+│ │ │└────────┴───────────┴───────────────┘ │
578−│Athens│1 │┌──┬─────┬──────┐│
579−│ │ ││s#│sname│status││
580−│ │ │├──┼─────┼──────┤│
581−│ │ ││S5│Adams│30 ││
582−│ │ │└──┴─────┴──────┘│
583−└──────┴─────────┴─────────────────┘
640+└──────────┴──────────────────┴───────────────────────────────────────────────────────┘
584```
641```
585
642
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.
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.
@@ -591,3 +648,28 @@ In this query result, we can simultaneously answer how many suppliers are locate
591|sum(relation{int})|return the int sum of the relation's values|
648|sum(relation{int})|return the int sum of the relation's values|
592|max(relation{int})|return the maximum int from all the relation's values|
649|max(relation{int})|return the maximum int from all the relation's values|
593|min(relation{int})|return the minimum int from all the relation's values|
650|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](docs/server_mode.markdown):
9+The websocket server is started with the same arguments as the normal [Project:M36 server](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](/ProjectM36/Server/WebSocket/project-m36.js) to manage the WebSocket connection is available.
19+A [simple JavaScript library](/src/bin/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](/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](/src/bin/ProjectM36/Server/WebSocket/websocket-client.html) can be used to learn TutorialD and for remote database access from the web browser.
examples/DerivingCustomTupleable.hsnew file+54
@@ -0,0 +1,54 @@
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.hsnew file+12
@@ -0,0 +1,12 @@
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.hsnew file+26
@@ -0,0 +1,26 @@
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.hsnew file+446
@@ -0,0 +1,446 @@
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+1−1
@@ -6,7 +6,7 @@ import Data.Text.IO as TIO
6main :: IO ()
6main :: IO ()
7main = do
7main = do
8 -- 1. create a ConnectionInfo
8 -- 1. create a ConnectionInfo
9− let connInfo = RemoteProcessConnectionInfo "mytestdb" (createNodeId "127.0.0.1" defaultServerPort) emptyNotificationCallback
9+ let connInfo = RemoteConnectionInfo "mytestdb" "127.0.0.1" (show defaultServerPort) emptyNotificationCallback
10 -- 2. conncted to the remote database
10 -- 2. conncted to the remote database
11 eConn <- connectProjectM36 connInfo
11 eConn <- connectProjectM36 connInfo
12 case eConn of
12 case eConn of
examples/blog.hs+11−8
@@ -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 #-}
2+{-# LANGUAGE DeriveAnyClass, DeriveGeneric, OverloadedStrings, CPP, DerivingVia #-}
3
3
4import ProjectM36.Client
4import ProjectM36.Client
5import ProjectM36.Base
5import ProjectM36.Base
@@ -10,16 +10,18 @@ import ProjectM36.Tuple (atomForAttributeName)
10
10
11import Data.Either
11import Data.Either
12import GHC.Generics
12import GHC.Generics
13−import Data.Binary
14import qualified Data.Text as T
13import qualified Data.Text as T
15import qualified Data.Text.Lazy as TL
14import qualified Data.Text.Lazy as TL
16import Data.Time.Clock
15import Data.Time.Clock
17import Data.Time.Calendar
16import Data.Time.Calendar
18import Control.DeepSeq
17import Control.DeepSeq
19import Data.Proxy
18import Data.Proxy
19+#if __GLASGOW_HASKELL__ < 804
20import Data.Monoid
20import Data.Monoid
21+#endif
21import Data.List
22import Data.List
22import Control.Monad (when, forM_)
23import Control.Monad (when, forM_)
24+import Codec.Winery
23
25
24import Web.Scotty as S
26import Web.Scotty as S
25import Text.Blaze.Html5 (h1, h2, h3, p, form, input, (!), toHtml, Html, a, toValue, hr, textarea)
27import Text.Blaze.Html5 (h1, h2, h3, p, form, input, (!), toHtml, Html, a, toValue, hr, textarea)
@@ -33,7 +35,7 @@ import Data.Time.Format
33data Blog = Blog {
35data Blog = Blog {
34 title :: T.Text,
36 title :: T.Text,
35 entry :: T.Text,
37 entry :: T.Text,
36− stamp :: UTCTime,
38+ tstamp :: UTCTime,
37 category :: Category --note that this type is an algebraic data type
39 category :: Category --note that this type is an algebraic data type
38 }
40 }
39 deriving (Generic, Show) --derive Generic so that Tupleable can use default instances
41 deriving (Generic, Show) --derive Generic so that Tupleable can use default instances
@@ -50,7 +52,8 @@ data Comment = Comment {
50instance Tupleable Comment
52instance Tupleable Comment
51
53
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
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
53− deriving (Atomable, Eq, Show, NFData, Binary, Generic) -- derive Atomable so that values of this type can be stored as a database value
55+ deriving (Atomable, Eq, Show, NFData, 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
54
57
55-- add some short-hand error handling- your application should have proper handling
58-- add some short-hand error handling- your application should have proper handling
56handleIOError :: Show e => IO (Either e a) -> IO a
59handleIOError :: Show e => IO (Either e a) -> IO a
@@ -103,11 +106,11 @@ insertSampleData :: SessionId -> Connection -> IO ()
103insertSampleData sessionId conn = do
106insertSampleData sessionId conn = do
104 let blogs = [Blog { title = "Haskell Lenses",
107 let blogs = [Blog { title = "Haskell Lenses",
105 entry = "I wear Haskell rose-colored lenses.",
108 entry = "I wear Haskell rose-colored lenses.",
106− stamp = UTCTime (fromGregorian 2017 5 8) (secondsToDiffTime 1000),
109+ tstamp = UTCTime (fromGregorian 2017 5 8) (secondsToDiffTime 1000),
107 category = Food },
110 category = Food },
108 Blog { title = "Haskell Monad Analogy",
111 Blog { title = "Haskell Monad Analogy",
109 entry = "Monads are like burritos going through intestines.",
112 entry = "Monads are like burritos going through intestines.",
110− stamp = UTCTime (fromGregorian 2017 6 10) (secondsToDiffTime 2000),
113+ tstamp = UTCTime (fromGregorian 2017 6 10) (secondsToDiffTime 2000),
111 category = Cats }
114 category = Cats }
112 ]
115 ]
113 comments = [Comment { blogTitle = "Haskell Lenses",
116 comments = [Comment { blogTitle = "Haskell Lenses",
@@ -136,7 +139,7 @@ listBlogs sessionId conn = do
136 Left err -> render500 (toHtml (show err))
139 Left err -> render500 (toHtml (show err))
137 Right blogRel -> do
140 Right blogRel -> do
138 blogs <- liftIO (toList blogRel) >>= mapM (handleWebError . fromTuple) :: ActionM [Blog]
141 blogs <- liftIO (toList blogRel) >>= mapM (handleWebError . fromTuple) :: ActionM [Blog]
139− let sortedBlogs = sortBy (\b1 b2 -> stamp b1 `compare` stamp b2) blogs
142+ let sortedBlogs = sortBy (\b1 b2 -> tstamp b1 `compare` tstamp b2) blogs
140 html . renderHtml $ do
143 html . renderHtml $ do
141 h1 "Blog Posts"
144 h1 "Blog Posts"
142 forM_ sortedBlogs $ \blog -> a ! href (toValue $ "/blog/" <> title blog) $ h2 (toHtml (title blog))
145 forM_ sortedBlogs $ \blog -> a ! href (toValue $ "/blog/" <> title blog) $ h2 (toHtml (title blog))
@@ -182,7 +185,7 @@ showBlogEntry sessionId conn = do
182 render $ do
185 render $ do
183 --show blog details
186 --show blog details
184 h1 (toHtml (title blog))
187 h1 (toHtml (title blog))
185− p (toHtml ("Posted at " <> formatStamp (stamp blog) <> " under " <> show (category blog)))
188+ p (toHtml ("Posted at " <> formatStamp (tstamp blog) <> " under " <> show (category blog)))
186 p (toHtml (entry blog))
189 p (toHtml (entry blog))
187 hr
190 hr
188 h3 "Comments"
191 h3 "Comments"
examples/hair.hs+9−6
@@ -1,16 +1,17 @@
1−{-# LANGUAGE DeriveGeneric, DeriveAnyClass, OverloadedStrings #-}
1+{-# LANGUAGE DeriveGeneric, DeriveAnyClass, OverloadedStrings, DerivingVia #-}
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
7import Control.DeepSeq
6import Control.DeepSeq
8import qualified Data.Map as M
7import qualified Data.Map as M
9import qualified Data.Text.IO as TIO
8import qualified Data.Text.IO as TIO
10import Data.Proxy
9import 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, Binary, NFData, Atomable)
13+ deriving (Generic, Show, Eq, NFData, Atomable)
14+ deriving Serialise via WineryVariant Hair
14
15
15main :: IO ()
16main :: IO ()
16main = do
17main = do
@@ -31,11 +32,13 @@ main = do
31
32
32 --create a relation with the new Hair AtomType
33 --create a relation with the new Hair AtomType
33 let blond = NakedAtomExpr (toAtom Blond)
34 let blond = NakedAtomExpr (toAtom Blond)
34− eCheck $ executeDatabaseContextExpr sessionId conn (Assign "people" (MakeRelationFromExprs Nothing [
35+ eCheck $ executeDatabaseContextExpr sessionId conn
36+ (Assign "people"
37+ (MakeRelationFromExprs Nothing $ TupleExprs () [
35− TupleExpr (M.fromList [("hair", blond), ("name", NakedAtomExpr (TextAtom "Colin"))])]))
38+ TupleExpr (M.fromList [("hair", blond), ("name", NakedAtomExpr (TextAtom "Colin"))])]))
36
39
37 let restrictionPredicate = AttributeEqualityPredicate "hair" blond
40 let restrictionPredicate = AttributeEqualityPredicate "hair" blond
38 peopleRel <- eCheck $ executeRelationalExpr sessionId conn (Restrict restrictionPredicate (RelationVariable "people" ()))
41 peopleRel <- eCheck $ executeRelationalExpr sessionId conn (Restrict restrictionPredicate (RelationVariable "people" ()))
39
42
40 TIO.putStrLn (showRelation peopleRel)
43 TIO.putStrLn (showRelation peopleRel)
41−
44+
examples/out_of_the_tarpit.hs+11−7
@@ -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 #-}
2+{-# LANGUAGE DeriveAnyClass, DeriveGeneric, OverloadedStrings, DerivingVia #-}
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
11import Control.DeepSeq
10import Control.DeepSeq
12import qualified Data.Text as T
11import qualified Data.Text as T
13import Data.Time.Calendar
12import Data.Time.Calendar
14import Data.Proxy
13import 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,16 +21,20 @@ 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, Binary, NFData)
24+ deriving (Generic, Atomable, Eq, Show, NFData)
25+ deriving Serialise via WineryVariant RoomType
25
26
26data PriceBand = Low | Medium | High | Premium
27data PriceBand = Low | Medium | High | Premium
27− deriving (Generic, Atomable, Eq, Show, Binary, NFData)
28+ deriving (Generic, Atomable, Eq, Show, NFData)
29+ deriving Serialise via WineryVariant PriceBand
28
30
29data AreaCode = City | Suburban | Rural
31data AreaCode = City | Suburban | Rural
30− deriving (Generic, Atomable, Eq, Show, Binary, NFData)
32+ deriving (Generic, Atomable, Eq, Show, NFData)
33+ deriving Serialise via WineryVariant AreaCode
31
34
32data SpeedBand = VeryFastBand | FastBand | MediumBand | SlowBand
35data SpeedBand = VeryFastBand | FastBand | MediumBand | SlowBand
33− deriving (Generic, Atomable, Eq, Show, Binary, NFData)
36+ deriving (Generic, Atomable, Eq, Show, NFData)
37+ deriving Serialise via WineryVariant SpeedBand
34
38
35main :: IO ()
39main :: IO ()
36main = do
40main = do
@@ -257,4 +261,4 @@ handleIOErrors m = do
257 [] -> pure (rights eErrs)
261 [] -> pure (rights eErrs)
258 errs -> handleError (Left (someErrors errs))
262 errs -> handleError (Left (someErrors errs))
259
263
260−
264+
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 Double
6+data Price = Price Integer --dollars
7data RoomType = Kitchen | Bathroom | LivingRoom
7data RoomType = Kitchen | Bathroom | LivingRoom
8−data PriceBand = Low | Medium | High | Premium
8+data PriceBand = Low | Med | 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(offerPrice,2000.0)) 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(@price,Price 2000)) 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 date"
41+ ":importexample cjdate"
42 ]
42 ]
43 },
43 },
44 {
44 {
nix/sources.jsonnew file+50
@@ -0,0 +1,50 @@
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.nixnew file+171
@@ -0,0 +1,171 @@
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+184−224
@@ -1,6 +1,8 @@
1+Cabal-Version: 2.2
1Name: project-m36
2Name: project-m36
2−Version: 0.3
3+Version: 0.9.3
3−License: PublicDomain
4+License: MIT
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
4Build-Type: Simple
6Build-Type: Simple
5Homepage: https://github.com/agentm/project-m36
7Homepage: https://github.com/agentm/project-m36
6Bug-Reports: https://github.com/agentm/project-m36/issues
8Bug-Reports: https://github.com/agentm/project-m36/issues
@@ -8,7 +10,6 @@ Author: AgentM
8Stability: experimental
10Stability: experimental
9Category: Relational Algebra
11Category: Relational Algebra
10Maintainer: agentm@themactionfaction.com
12Maintainer: agentm@themactionfaction.com
11−Cabal-Version: >= 1.10
12Synopsis: Relational Algebra Engine
13Synopsis: Relational Algebra Engine
13Description: A relational algebra engine which can be used to persist and query Haskell data types.
14Description: A relational algebra engine which can be used to persist and query Haskell data types.
14Extra-Source-Files: Changelog.markdown README.markdown
15Extra-Source-Files: Changelog.markdown README.markdown
@@ -22,69 +23,27 @@ Flag profiler
22 Default: False
23 Default: False
23 Manual: True
24 Manual: True
24
25
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+
25Library
37Library
26− Build-Depends: base>=4.8 && < 6.0
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
27− ,ghc >= 7.8 && < 8.3
39+ if flag(haskell-scripting)
28− ,ghc-paths
40+ Build-Depends: ghc >= 8.2 && < 8.11
29− ,ghci
41+ CPP-Options: -DPM36_HASKELL_SCRIPTING
30− ,mtl
42+ if impl(ghc>= 8) && flag(haskell-scripting)
31− ,containers
43+ build-depends:
32− ,unordered-containers
44+ ghc-boot, ghci
33− ,hashable
45+ if impl(ghc>= 8.6)
34− ,haskeline
46+ Build-Depends: deferred-folds
35− ,directory
36− ,MonadRandom
37− ,random-shuffle
38− --critical uuid bug in lesser versions https://www.reddit.com/r/haskell/comments/4myot5/psa_make_sure_to_use_uuid_1312/
39− ,uuid >= 1.3.12
40− ,cassava >= 0.4.5.1 && < 0.6
41− ,text
42− ,bytestring
43− ,deepseq
44− ,deepseq-generics
45− ,vector
46− ,parallel
47− ,monad-parallel
48− ,exceptions
49− ,transformers
50− ,gnuplot
51− ,binary
52− ,filepath
53− ,zlib
54− ,directory
55− ,vector-binary-instances
56− ,temporary
57− ,stm
58− ,time
59− ,hashable-time
60− ,old-locale
61− ,rset
62− --used for CSV parsing
63− ,attoparsec
64− ,either
65− ,base64-bytestring
66− ,data-interval
67− ,extended-reals
68− ,network-transport
69− -- aeson 1.1 and above includes instances for UUID types
70− ,aeson >= 1.1
71− ,path-pieces
72− ,conduit
73− ,resourcet
74− ,http-api-data
75−--needed for remote access
76− ,distributed-process-client-server >= 0.2.3
77− ,distributed-process >= 0.6.6
78− ,distributed-process-extras >= 0.3.2
79− ,distributed-process-async >= 0.2.4
80− ,network-transport-tcp
81− ,network-transport
82− ,list-t
83− ,stm-containers >= 0.2.15
84− ,optparse-applicative
85− ,Glob
86−--used for hashing the transaction graph file to check for differences
87− ,cryptohash-sha256
88 Exposed-Modules: ProjectM36.Error,
47 Exposed-Modules: ProjectM36.Error,
89 ProjectM36.Transaction,
48 ProjectM36.Transaction,
90 ProjectM36.TransactionGraph,
49 ProjectM36.TransactionGraph,
@@ -93,6 +52,9 @@ Library
93 ProjectM36.TransactionGraph.Merge,
52 ProjectM36.TransactionGraph.Merge,
94 ProjectM36.TransGraphRelationalExpression,
53 ProjectM36.TransGraphRelationalExpression,
95 ProjectM36.Base,
54 ProjectM36.Base,
55+ ProjectM36.Serialise.Base,
56+ ProjectM36.Serialise.Error,
57+ ProjectM36.DataFrame,
96 ProjectM36.Attribute,
58 ProjectM36.Attribute,
97 ProjectM36.AttributeNames,
59 ProjectM36.AttributeNames,
98 ProjectM36.Tuple,
60 ProjectM36.Tuple,
@@ -101,6 +63,7 @@ Library
101 ProjectM36.AtomFunction,
63 ProjectM36.AtomFunction,
102 ProjectM36.AtomFunctionError,
64 ProjectM36.AtomFunctionError,
103 ProjectM36.ScriptSession,
65 ProjectM36.ScriptSession,
66+ ProjectM36.Shortcuts,
104 ProjectM36.DatabaseContextFunction,
67 ProjectM36.DatabaseContextFunction,
105 ProjectM36.DatabaseContextFunctionError,
68 ProjectM36.DatabaseContextFunctionError,
106 ProjectM36.DatabaseContextFunctionUtils,
69 ProjectM36.DatabaseContextFunctionUtils,
@@ -120,21 +83,26 @@ Library
120 ProjectM36.Relation.Parse.CSV,
83 ProjectM36.Relation.Parse.CSV,
121 ProjectM36.IsomorphicSchema,
84 ProjectM36.IsomorphicSchema,
122 ProjectM36.InclusionDependency,
85 ProjectM36.InclusionDependency,
86+ ProjectM36.MerkleHash,
123 ProjectM36.Client,
87 ProjectM36.Client,
124 ProjectM36.Client.Simple,
88 ProjectM36.Client.Simple,
125 ProjectM36.Persist,
89 ProjectM36.Persist,
126 ProjectM36.AtomType,
90 ProjectM36.AtomType,
91+ ProjectM36.AttributeExpr,
127 ProjectM36.AtomFunctions.Basic,
92 ProjectM36.AtomFunctions.Basic,
128 ProjectM36.AtomFunctions.Primitive,
93 ProjectM36.AtomFunctions.Primitive,
129 ProjectM36.Atomable,
94 ProjectM36.Atomable,
130 ProjectM36.Tupleable,
95 ProjectM36.Tupleable,
96+ ProjectM36.Tupleable.Deriving,
131 ProjectM36.DataConstructorDef,
97 ProjectM36.DataConstructorDef,
132 ProjectM36.DataTypes.Basic,
98 ProjectM36.DataTypes.Basic,
99+ ProjectM36.DataTypes.Sorting,
133 ProjectM36.DataTypes.Day,
100 ProjectM36.DataTypes.Day,
134 ProjectM36.DataTypes.DateTime,
101 ProjectM36.DataTypes.DateTime,
135 ProjectM36.DataTypes.Either,
102 ProjectM36.DataTypes.Either,
136 ProjectM36.DataTypes.Maybe,
103 ProjectM36.DataTypes.Maybe,
137 ProjectM36.DataTypes.List,
104 ProjectM36.DataTypes.List,
105+ ProjectM36.DataTypes.NonEmptyList,
138 ProjectM36.DataTypes.Primitive,
106 ProjectM36.DataTypes.Primitive,
139 ProjectM36.DataTypes.Interval,
107 ProjectM36.DataTypes.Interval,
140 ProjectM36.DataTypes.ByteString,
108 ProjectM36.DataTypes.ByteString,
@@ -146,31 +114,42 @@ Library
146 ProjectM36.Server.EntryPoints,
114 ProjectM36.Server.EntryPoints,
147 ProjectM36.Server.ParseArgs,
115 ProjectM36.Server.ParseArgs,
148 ProjectM36.Server.RemoteCallTypes,
116 ProjectM36.Server.RemoteCallTypes,
117+ ProjectM36.Serialise.AtomFunctionError,
118+ ProjectM36.Serialise.DataFrame,
119+ ProjectM36.Serialise.DatabaseContextFunctionError,
120+ ProjectM36.Serialise.IsomorphicSchema,
149 ProjectM36.Session,
121 ProjectM36.Session,
150 ProjectM36.Sessions,
122 ProjectM36.Sessions,
151 ProjectM36.Transaction.Persist,
123 ProjectM36.Transaction.Persist,
152 ProjectM36.TypeConstructor,
124 ProjectM36.TypeConstructor,
153 ProjectM36.TypeConstructorDef,
125 ProjectM36.TypeConstructorDef,
154 ProjectM36.FileLock,
126 ProjectM36.FileLock,
155− ProjectM36.FSType
127+ ProjectM36.FSType,
128+ ProjectM36.Arbitrary,
129+ ProjectM36.GraphRefRelationalExpr,
130+ ProjectM36.NormalizeExpr,
131+ ProjectM36.TransactionInfo,
132+ ProjectM36.WithNameExpr
156 GHC-Options: -Wall -rdynamic
133 GHC-Options: -Wall -rdynamic
157 if os(windows)
134 if os(windows)
158− Build-Depends: Win32 >= 2.3
135+ Build-Depends: Win32 >= 2.5.4.1
159 Other-Modules: ProjectM36.Win32Handle
136 Other-Modules: ProjectM36.Win32Handle
160 else
137 else
138+ --219- too many exported symbols under Windows and GHC 8.4
139+ GHC-Options: -rdynamic -fexternal-interpreter
161 C-sources: cbits/DirectoryFsync.c, cbits/darwin_statfs.c
140 C-sources: cbits/DirectoryFsync.c, cbits/darwin_statfs.c
162 Build-Depends: unix
141 Build-Depends: unix
163− CC-Options: -fPIC
142+ CC-Options: -fPIC
164 Hs-Source-Dirs: ./src/lib
143 Hs-Source-Dirs: ./src/lib
165 Default-Language: Haskell2010
144 Default-Language: Haskell2010
166 Default-Extensions: OverloadedStrings, CPP
145 Default-Extensions: OverloadedStrings, CPP
167− if impl(ghc>= 8)
146+ if !flag(stack)
168− build-depends:
147+ Build-Depends: deferred-folds
169− ghc-boot
170
148
171Executable tutd
149Executable tutd
150+ if flag(haskell-scripting)
151+ Build-Depends: ghc >= 8.2 && < 8.11
172 Build-Depends: base >=4.8 && <5.0,
152 Build-Depends: base >=4.8 && <5.0,
173− ghc >= 7.8 && < 8.3,
174 ghc-paths,
153 ghc-paths,
175 project-m36,
154 project-m36,
176 containers,
155 containers,
@@ -184,13 +163,11 @@ Executable tutd
184 MonadRandom, MonadRandom,
163 MonadRandom, MonadRandom,
185 vector,
164 vector,
186 text,
165 text,
187− vector-binary-instances,
188 time,
166 time,
189 hashable-time,
167 hashable-time,
190 bytestring,
168 bytestring,
191 stm,
169 stm,
192 deepseq,
170 deepseq,
193− binary,
194 data-interval,
171 data-interval,
195 parallel,
172 parallel,
196 cassava,
173 cassava,
@@ -198,14 +175,23 @@ Executable tutd
198 directory,
175 directory,
199 filepath,
176 filepath,
200 temporary,
177 temporary,
201− megaparsec >= 5.2.0 && < 5.4,
178+ megaparsec >= 5.2.0 && < 10,
202 haskeline,
179 haskeline,
203 random, MonadRandom,
180 random, MonadRandom,
204 base64-bytestring,
181 base64-bytestring,
205 optparse-applicative,
182 optparse-applicative,
206 attoparsec,
183 attoparsec,
207− stm-containers,
184+ stm-containers >= 1.0.0,
208− list-t
185+ 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
209 Other-Modules: TutorialD.Interpreter,
195 Other-Modules: TutorialD.Interpreter,
210 TutorialD.Interpreter.Base,
196 TutorialD.Interpreter.Base,
211 TutorialD.Interpreter.DatabaseContextExpr,
197 TutorialD.Interpreter.DatabaseContextExpr,
@@ -224,20 +210,21 @@ Executable tutd
224 TutorialD.Interpreter.SchemaOperator,
210 TutorialD.Interpreter.SchemaOperator,
225 TutorialD.Interpreter.TransGraphRelationalOperator,
211 TutorialD.Interpreter.TransGraphRelationalOperator,
226 TutorialD.Interpreter.SchemaOperator
212 TutorialD.Interpreter.SchemaOperator
213+ TutorialD.Printer
227 main-is: TutorialD/tutd.hs
214 main-is: TutorialD/tutd.hs
228 CC-Options: -fPIC
215 CC-Options: -fPIC
229− GHC-Options: -Wall -rdynamic
216+ GHC-Options: -Wall -threaded
230 Hs-Source-Dirs: ./src/bin
217 Hs-Source-Dirs: ./src/bin
231 Default-Language: Haskell2010
218 Default-Language: Haskell2010
232 Default-Extensions: OverloadedStrings
219 Default-Extensions: OverloadedStrings
233
220
234Executable project-m36-server
221Executable project-m36-server
222+ if flag(haskell-scripting)
223+ Build-Depends: ghc >= 8.2 && < 8.11
235 Build-Depends: base,
224 Build-Depends: base,
236− ghc >= 7.8 && < 8.3,
237 ghc-paths,
225 ghc-paths,
238− project-m36,
239− binary,
240 transformers,
226 transformers,
227+ project-m36,
241 temporary,
228 temporary,
242 data-interval,
229 data-interval,
243 deepseq,
230 deepseq,
@@ -250,7 +237,6 @@ Executable project-m36-server
250 optparse-applicative,
237 optparse-applicative,
251 hashable-time,
238 hashable-time,
252 time,
239 time,
253− vector-binary-instances,
254 text,
240 text,
255 deepseq-generics,
241 deepseq-generics,
256 mtl,
242 mtl,
@@ -272,7 +258,7 @@ Executable project-m36-server
272Executable bigrel
258Executable bigrel
273 Default-Language: Haskell2010
259 Default-Language: Haskell2010
274 Default-Extensions: OverloadedStrings
260 Default-Extensions: OverloadedStrings
275− 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
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
276 Other-Modules: TutorialD.Interpreter.Base,
262 Other-Modules: TutorialD.Interpreter.Base,
277 TutorialD.Interpreter.DatabaseContextExpr,
263 TutorialD.Interpreter.DatabaseContextExpr,
278 TutorialD.Interpreter.RelationalExpr,
264 TutorialD.Interpreter.RelationalExpr,
@@ -283,6 +269,13 @@ Executable bigrel
283 if flag(profiler)
269 if flag(profiler)
284 GHC-Prof-Options: -fprof-auto -rtsopts -threaded -Wall
270 GHC-Prof-Options: -fprof-auto -rtsopts -threaded -Wall
285
271
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+
286Benchmark basic-benchmark
279Benchmark basic-benchmark
287 Default-Language: Haskell2010
280 Default-Language: Haskell2010
288 Default-Extensions: OverloadedStrings
281 Default-Extensions: OverloadedStrings
@@ -294,240 +287,202 @@ Benchmark basic-benchmark
294 if flag(profiler)
287 if flag(profiler)
295 GHC-Prof-Options: -fprof-auto -rtsopts -threaded -Wall
288 GHC-Prof-Options: -fprof-auto -rtsopts -threaded -Wall
296
289
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+
297Test-Suite test-tutoriald
302Test-Suite test-tutoriald
298− Default-Language: Haskell2010
303+ import: commontest
299− Default-Extensions: OverloadedStrings
300 type: exitcode-stdio-1.0
304 type: exitcode-stdio-1.0
301− main-is: test/TutorialD/Interpreter.hs
305+ main-is: TutorialD/InterpreterTest.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
302− 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
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
303− 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
304− GHC-Options: -Wall
305− Hs-Source-Dirs: ./src/bin, ., test
306
308
307Test-Suite test-tutoriald-atomfunctionscript
309Test-Suite test-tutoriald-atomfunctionscript
308− Default-Language: Haskell2010
310+ import: commontest
309− Default-Extensions: OverloadedStrings
310 type: exitcode-stdio-1.0
311 type: exitcode-stdio-1.0
311− 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
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
312− main-is: test/TutorialD/Interpreter/AtomFunctionScript.hs
313+ main-is: TutorialD/Interpreter/AtomFunctionScript.hs
313− Build-Depends: base, HUnit, project-m36, uuid, containers, megaparsec, text, vector, directory, bytestring, mtl, haskeline, random, MonadRandom, semigroups, time
314− GHC-Options: -Wall
315− Hs-Source-Dirs: ./src/bin, ./test, .
316
314
317Test-Suite test-tutoriald-databasecontextfunctionscript
315Test-Suite test-tutoriald-databasecontextfunctionscript
318− Default-Language: Haskell2010
316+ import: commontest
319− Default-Extensions: OverloadedStrings
320 type: exitcode-stdio-1.0
317 type: exitcode-stdio-1.0
321− 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
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
322− main-is: test/TutorialD/Interpreter/DatabaseContextFunctionScript.hs
319+ main-is: TutorialD/Interpreter/DatabaseContextFunctionScript.hs
323− Build-Depends: base, HUnit, project-m36, uuid, containers, megaparsec, text, vector, directory, bytestring, mtl, haskeline, random, MonadRandom, semigroups, time
324− GHC-Options: -Wall
325− Hs-Source-Dirs: ./src/bin, ./test, .
326
320
327Test-Suite test-relation
321Test-Suite test-relation
328− Default-Language: Haskell2010
322+ import: commontest
329− Default-Extensions: OverloadedStrings
330 type: exitcode-stdio-1.0
323 type: exitcode-stdio-1.0
331− main-is: test/Relation/Basic.hs
324+ main-is: Relation/Basic.hs
332− 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
333− GHC-Options: -Wall
334
325
335Test-Suite test-static-optimizer
326Test-Suite test-static-optimizer
336− Default-Language: Haskell2010
327+ import: commontest
337− Default-Extensions: OverloadedStrings
338 type: exitcode-stdio-1.0
328 type: exitcode-stdio-1.0
339− main-is: test/Relation/StaticOptimizer.hs
329+ main-is: Relation/StaticOptimizer.hs
340− 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
341− GHC-Options: -Wall
342
330
343Test-Suite test-transactiongraph-persist
331Test-Suite test-transactiongraph-persist
344− Default-Language: Haskell2010
332+ import: commontest
345− Default-Extensions: OverloadedStrings
346 type: exitcode-stdio-1.0
333 type: exitcode-stdio-1.0
347− main-is: test/TransactionGraph/Persist.hs
334+ main-is: TransactionGraph/Persist.hs
348− 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
349− Other-Modules: TutorialD.Interpreter.Base, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.Types, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.Import.BasicExamples
335+ Other-Modules: TutorialD.Interpreter.Base, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.Types, TutorialD.Interpreter.DatabaseContextExpr, TutorialD.Interpreter.Import.BasicExamples, TutorialD.Printer
350− Hs-Source-Dirs: ., ./src/bin
351− GHC-Options: -Wall
352
336
353Test-Suite test-relation-import-csv
337Test-Suite test-relation-import-csv
354− Default-Language: Haskell2010
338+ import: commontest
355− Default-Extensions: OverloadedStrings
356 type: exitcode-stdio-1.0
339 type: exitcode-stdio-1.0
357− main-is: test/Relation/Import/CSV.hs
340+ main-is: Relation/Import/CSV.hs
358− 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
359− GHC-Options: -Wall
360
341
361Test-Suite test-tutoriald-import-tutoriald
342Test-Suite test-tutoriald-import-tutoriald
362− Default-Language: Haskell2010
343+ import: commontest
363− Default-Extensions: OverloadedStrings
364 type: exitcode-stdio-1.0
344 type: exitcode-stdio-1.0
365− main-is: test/TutorialD/Interpreter/Import/TutorialD.hs
345+ main-is: TutorialD/Interpreter/Import/ImportTest.hs
366− 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
367− 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
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
368− GHC-Options: -Wall
369− Hs-Source-Dirs: ., ./src/bin
370
347
371Test-Suite test-relation-export-csv
348Test-Suite test-relation-export-csv
372− Default-Language: Haskell2010
349+ import: commontest
373− Default-Extensions: OverloadedStrings
374 type: exitcode-stdio-1.0
350 type: exitcode-stdio-1.0
375− main-is: test/Relation/Export/CSV.hs
351+ main-is: Relation/Export/CSV.hs
376− 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
377− GHC-Options: -Wall
378
352
379Test-Suite test-transactiongraph-merge
353Test-Suite test-transactiongraph-merge
380− Default-Language: Haskell2010
354+ import: commontest
381− Default-Extensions: OverloadedStrings
382 type: exitcode-stdio-1.0
355 type: exitcode-stdio-1.0
383− main-is: test/TransactionGraph/Merge.hs
356+ main-is: TransactionGraph/Merge.hs
384− 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
357+
385− GHC-Options: -Wall
358+
359+Test-Suite test-prettyprinter
360+ import: commontest
361+ type: exitcode-stdio-1.0
362+ main-is: TutorialD/PrinterTest.hs
363+ Other-Modules: TutorialD.Printer, TutorialD.Interpreter.Base, TutorialD.Interpreter.RelationalExpr, TutorialD.Interpreter.Types
386
364
387benchmark bench
365benchmark bench
388− Default-Language: Haskell2010
366+ import: commontest
389− Default-Extensions: OverloadedStrings
390 type: exitcode-stdio-1.0
367 type: exitcode-stdio-1.0
391 main-is: benchmark/Relation.hs
368 main-is: benchmark/Relation.hs
392− 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
393− GHC-Options: -Wall -rtsopts
394− Hs-Source-Dirs: ./src/bin
395
369
396Test-Suite test-server
370Test-Suite test-server
397− Default-Language: Haskell2010
371+ import: commontest
398− Default-Extensions: OverloadedStrings
399 type: exitcode-stdio-1.0
372 type: exitcode-stdio-1.0
400− main-is: test/Server/Main.hs
373+ main-is: Server/Main.hs
401− 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
374+
402− HS-Source-Dirs: ., ./src/bin
403− GHC-Options: -Wall
404
375
405Executable Example-SimpleClient
376Executable Example-SimpleClient
406 Default-Language: Haskell2010
377 Default-Language: Haskell2010
407 Default-Extensions: OverloadedStrings
378 Default-Extensions: OverloadedStrings
408− 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
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
409 Main-Is: examples/SimpleClient.hs
380 Main-Is: examples/SimpleClient.hs
410− GHC-Options: -Wall
381+ GHC-Options: -Wall -threaded
411
382
412Executable Example-OutOfTheTarpit
383Executable Example-OutOfTheTarpit
413 Default-Language: Haskell2010
384 Default-Language: Haskell2010
414 Default-Extensions: OverloadedStrings
385 Default-Extensions: OverloadedStrings
415− 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
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
416 Main-Is: examples/out_of_the_tarpit.hs
387 Main-Is: examples/out_of_the_tarpit.hs
417− GHC-Options: -Wall
388+ GHC-Options: -Wall -threaded
418
389
419Executable Example-Blog
390Executable Example-Blog
420 Default-Language: Haskell2010
391 Default-Language: Haskell2010
421 Default-Extensions: OverloadedStrings
392 Default-Extensions: OverloadedStrings
422− 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
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
423 Main-Is: examples/blog.hs
394 Main-Is: examples/blog.hs
424− GHC-Options: -Wall
395+ GHC-Options: -Wall -threaded
425−
426
396
427Executable Example-Hair
397Executable Example-Hair
428 Default-Language: Haskell2010
398 Default-Language: Haskell2010
429 Default-Extensions: OverloadedStrings
399 Default-Extensions: OverloadedStrings
430− 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
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
431 Main-Is: examples/hair.hs
401 Main-Is: examples/hair.hs
432− GHC-Options: -Wall
402+ GHC-Options: -Wall -threaded
403+
404+Executable Example-Plantfarm
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
433
410
434Executable Example-CustomTupleable
411Executable Example-CustomTupleable
435 Default-Language: Haskell2010
412 Default-Language: Haskell2010
436 Default-Extensions: OverloadedStrings
413 Default-Extensions: OverloadedStrings
437− 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
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
438 Main-Is: examples/CustomTupleable.hs
415 Main-Is: examples/CustomTupleable.hs
439− GHC-Options: -Wall
416+ GHC-Options: -Wall -threaded
440−
417+
441−Test-Suite test-scripts
418+Executable Example-DerivingCustomTupleable
419+ if impl(ghc>=8.6)
420+ Buildable: True
421+ else
422+ Buildable: False
442 Default-Language: Haskell2010
423 Default-Language: Haskell2010
443− Default-Extensions: OverloadedStrings
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
444 type: exitcode-stdio-1.0
430 type: exitcode-stdio-1.0
445− main-is: test/scripts.hs
431+ main-is: scripts.hs
446− 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
447− 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
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
448− GHC-Options: -Wall
449− Hs-Source-Dirs: ., ./src/bin
450
433
451Executable project-m36-websocket-server
434Executable project-m36-websocket-server
452 Default-Language: Haskell2010
435 Default-Language: Haskell2010
453− 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
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
454 Main-Is: ProjectM36/Server/WebSocket/websocket-server.hs
437 Main-Is: ProjectM36/Server/WebSocket/websocket-server.hs
455− 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
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
456− GHC-Options: -Wall
439+ GHC-Options: -Wall -threaded
457 Hs-Source-Dirs: ./src/bin
440 Hs-Source-Dirs: ./src/bin
458 Default-Extensions: OverloadedStrings
441 Default-Extensions: OverloadedStrings
459
442
460Test-Suite test-websocket-server
443Test-Suite test-websocket-server
461− Default-Language: Haskell2010
444+ import: commontest
462 type: exitcode-stdio-1.0
445 type: exitcode-stdio-1.0
463− main-is: test/Server/WebSocket.hs
446+ main-is: Server/WebSocket.hs
464− 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
465− 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
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
466− Default-Extensions: OverloadedStrings
467− GHC-Options: -Wall
468− Hs-Source-Dirs: ./src/bin, .
469
448
470Test-Suite test-isomorphic-schemas
449Test-Suite test-isomorphic-schemas
471− Default-Language: Haskell2010
450+ import: commontest
472 type: exitcode-stdio-1.0
451 type: exitcode-stdio-1.0
473− main-is: test/IsomorphicSchema.hs
452+ main-is: IsomorphicSchema.hs
474− 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
475− Default-Extensions: OverloadedStrings
476− GHC-Options: -Wall
477− Hs-Source-Dirs: ./src/bin, .
478
453
479Test-Suite test-atomable
454Test-Suite test-atomable
480− Default-Language: Haskell2010
455+ import: commontest
481 type: exitcode-stdio-1.0
456 type: exitcode-stdio-1.0
482− main-is: test/Relation/Atomable.hs
457+ main-is: Relation/Atomable.hs
483− 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
484− 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
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
485− Default-Extensions: OverloadedStrings
486− GHC-Options: -Wall
487− Hs-Source-Dirs: ./src/bin, ., test/
488
459
489Test-Suite test-multiprocess-access
460Test-Suite test-multiprocess-access
490− Default-Language: Haskell2010
461+ import: commontest
491 type: exitcode-stdio-1.0
462 type: exitcode-stdio-1.0
492− main-is: test/MultiProcessDatabaseAccess.hs
463+ main-is: MultiProcessDatabaseAccess.hs
493− 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
494− Default-Extensions: OverloadedStrings
495− GHC-Options: -Wall
496− Hs-Source-Dirs: ./src/bin, ., test/
497
464
498Test-Suite test-transactiongraph-automerge
465Test-Suite test-transactiongraph-automerge
499− Default-Language: Haskell2010
466+ import: commontest
500 type: exitcode-stdio-1.0
467 type: exitcode-stdio-1.0
501− main-is: test/TransactionGraph/Automerge.hs
468+ main-is: TransactionGraph/Automerge.hs
502− 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
503− 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
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
504− Default-Extensions: OverloadedStrings
505− GHC-Options: -Wall
506− Hs-Source-Dirs: ./src/bin, ., test/
507
470
508Test-Suite test-tupleable
471Test-Suite test-tupleable
509− Default-Language: Haskell2010
472+ import: commontest
510 type: exitcode-stdio-1.0
473 type: exitcode-stdio-1.0
511− main-is: test/Relation/Tupleable.hs
474+ main-is: Relation/Tupleable.hs
512− 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
513− Default-Extensions: OverloadedStrings
514− GHC-Options: -Wall
515− Hs-Source-Dirs: ./src/bin, ., test/
516
475
517Test-Suite test-client-simple
476Test-Suite test-client-simple
518− Default-Language: Haskell2010
477+ import: commontest
519− Main-Is: test/Client/Simple.hs
478+ Main-Is: Client/Simple.hs
520 type: exitcode-stdio-1.0
479 type: exitcode-stdio-1.0
521− 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
522− Default-Extensions: OverloadedStrings
523− GHC-Options: -Wall
524− Hs-Source-Dirs: ./src/bin, ., test/
525
480
526-- test for file handle leaks
481-- test for file handle leaks
527Executable handles
482Executable handles
528 Default-Language: Haskell2010
483 Default-Language: Haskell2010
529 Default-Extensions: OverloadedStrings
484 Default-Extensions: OverloadedStrings
530− 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
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
531 main-is: benchmark/Handles.hs
486 main-is: benchmark/Handles.hs
532 Other-Modules: TutorialD.Interpreter,
487 Other-Modules: TutorialD.Interpreter,
533 TutorialD.Interpreter.Base,
488 TutorialD.Interpreter.Base,
@@ -546,9 +501,14 @@ Executable handles
546 TutorialD.Interpreter.TransGraphRelationalOperator,
501 TutorialD.Interpreter.TransGraphRelationalOperator,
547 TutorialD.Interpreter.TransactionGraphOperator,
502 TutorialD.Interpreter.TransactionGraphOperator,
548 TutorialD.Interpreter.Types
503 TutorialD.Interpreter.Types
504+ TutorialD.Printer
549 GHC-Options: -Wall -threaded -rtsopts
505 GHC-Options: -Wall -threaded -rtsopts
550 HS-Source-Dirs: ./src/bin
506 HS-Source-Dirs: ./src/bin
551 if flag(profiler)
507 if flag(profiler)
552 GHC-Prof-Options: -fprof-auto -rtsopts -threaded -Wall
508 GHC-Prof-Options: -fprof-auto -rtsopts -threaded -Wall
553−
509+
554−
510+Test-Suite test-dataframe
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.nixnew file+36
@@ -0,0 +1,36 @@
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-sandbox/bin/ghcid --command="cabal repl $1"
2+~/.cabal/bin/ghcid --command="cabal new-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.tutdnew file+2
@@ -0,0 +1,2 @@
1+x:=relation{
2+tuple{ x 2}} -- nice
shell.nixnew file+1
@@ -0,0 +1 @@
1+(import ./release.nix { }).shell
src/bin/ProjectM36/Client/Json.hs+4−1
@@ -3,6 +3,7 @@ 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
6import Control.Exception (IOException)
7import Control.Exception (IOException)
7
8
8instance ToJSON EvaluatedNotification
9instance ToJSON EvaluatedNotification
@@ -11,4 +12,6 @@ instance FromJSON EvaluatedNotification
11instance ToJSON ConnectionError
12instance ToJSON ConnectionError
12
13
13instance ToJSON IOException where
14instance ToJSON IOException where
14− toJSON err = object ["IOException" .= show err]
15+ toJSON err = object ["IOException" .= show err]
16+
17+instance ToJSON MerkleValidationError
src/bin/ProjectM36/Server/RemoteCallTypes/Json.hs+50−18
@@ -1,14 +1,17 @@
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, TypeSynonymInstances #-}
2+{-# LANGUAGE FlexibleInstances #-}
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
7import ProjectM36.DatabaseContextFunctionError
8import ProjectM36.DatabaseContextFunctionError
8import ProjectM36.DataTypes.Primitive
9import ProjectM36.DataTypes.Primitive
9import ProjectM36.Error
10import ProjectM36.Error
10import ProjectM36.IsomorphicSchema
11import ProjectM36.IsomorphicSchema
11import ProjectM36.Server.RemoteCallTypes
12import ProjectM36.Server.RemoteCallTypes
13+import ProjectM36.MerkleHash
14+import ProjectM36.Attribute as A
12
15
13import Data.Aeson
16import Data.Aeson
14import Data.ByteString.Base64 as B64
17import Data.ByteString.Base64 as B64
@@ -21,6 +24,9 @@ instance FromJSON RelationalExpr
21instance ToJSON TupleExpr
24instance ToJSON TupleExpr
22instance FromJSON TupleExpr
25instance FromJSON TupleExpr
23
26
27+instance ToJSON TupleExprs
28+instance FromJSON TupleExprs
29+
24instance ToJSON RestrictionPredicateExpr
30instance ToJSON RestrictionPredicateExpr
25instance FromJSON RestrictionPredicateExpr
31instance FromJSON RestrictionPredicateExpr
26
32
@@ -39,8 +45,11 @@ instance FromJSON ExecuteRelationalExpr
39instance ToJSON Relation
45instance ToJSON Relation
40instance FromJSON Relation
46instance FromJSON Relation
41
47
42−instance ToJSON Attribute
48+instance ToJSON Attribute where
49+ toJSON (Attribute attrName aType) = object [ "name" .= attrName
50+ , "type" .= toJSON aType ]
43−instance FromJSON Attribute
51+instance FromJSON Attribute where
52+ parseJSON = withObject "Attribute" $ \v -> Attribute <$> v .: "name" <*> v .: "type"
44
53
45instance ToJSON ExtendTupleExpr
54instance ToJSON ExtendTupleExpr
46instance FromJSON ExtendTupleExpr
55instance FromJSON ExtendTupleExpr
@@ -63,6 +72,18 @@ instance FromJSON SchemaExpr
63instance ToJSON SchemaIsomorph
72instance ToJSON SchemaIsomorph
64instance FromJSON SchemaIsomorph
73instance FromJSON SchemaIsomorph
65
74
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+
66instance ToJSON Atom where
87instance ToJSON Atom where
67 toJSON atom@(IntegerAtom i) = object [ "type" .= atomTypeForAtom atom,
88 toJSON atom@(IntegerAtom i) = object [ "type" .= atomTypeForAtom atom,
68 "val" .= i ]
89 "val" .= i ]
@@ -80,17 +101,10 @@ instance ToJSON Atom where
80 "val" .= decodeUtf8 (B64.encode i) ]
101 "val" .= decodeUtf8 (B64.encode i) ]
81 toJSON atom@(BoolAtom i) = object [ "type" .= atomTypeForAtom atom,
102 toJSON atom@(BoolAtom i) = object [ "type" .= atomTypeForAtom atom,
82 "val" .= i ]
103 "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− ]
92 toJSON atom@(RelationAtom i) = object [ "type" .= atomTypeForAtom atom,
104 toJSON atom@(RelationAtom i) = object [ "type" .= atomTypeForAtom atom,
93 "val" .= i ]
105 "val" .= i ]
106+ toJSON atom@(RelationalExprAtom i) = object [ "type" .= atomTypeForAtom atom,
107+ "val" .= i ]
94 toJSON (ConstructedAtom dConsName atomtype atomlist) = object [
108 toJSON (ConstructedAtom dConsName atomtype atomlist) = object [
95 "dataconstructorname" .= dConsName,
109 "dataconstructorname" .= dConsName,
96 "type" .= toJSON atomtype,
110 "type" .= toJSON atomtype,
@@ -118,12 +132,7 @@ instance FromJSON Atom where
118 Left err -> fail ("Failed to parse base64-encoded ByteString: " ++ err)
132 Left err -> fail ("Failed to parse base64-encoded ByteString: " ++ err)
119 Right bs -> pure (ByteStringAtom bs)
133 Right bs -> pure (ByteStringAtom bs)
120 BoolAtomType -> BoolAtom <$> o .: "val"
134 BoolAtomType -> BoolAtom <$> o .: "val"
121− IntervalAtomType _ -> IntervalAtom <$>
135+ RelationalExprAtomType -> RelationalExprAtom <$> o .: "val"
122− ((o .: "val") >>= (.: "begin")) <*>
123− ((o .: "val") >>= (.: "end")) <*>
124− ((o .: "val") >>= (.: "beginopen")) <*>
125− ((o .: "val") >>= (.: "endopen"))
126−
127
136
128instance ToJSON Notification
137instance ToJSON Notification
129instance FromJSON Notification
138instance FromJSON Notification
@@ -131,6 +140,21 @@ instance FromJSON Notification
131instance ToJSON ScriptCompilationError
140instance ToJSON ScriptCompilationError
132instance FromJSON ScriptCompilationError
141instance FromJSON ScriptCompilationError
133
142
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+
134instance ToJSON RelationalError
158instance ToJSON RelationalError
135instance FromJSON RelationalError
159instance FromJSON RelationalError
136
160
@@ -140,6 +164,9 @@ instance FromJSON SchemaError
140instance ToJSON MergeError
164instance ToJSON MergeError
141instance FromJSON MergeError
165instance FromJSON MergeError
142
166
167+instance ToJSON ImportError'
168+instance FromJSON ImportError'
169+
143instance ToJSON DatabaseContextFunctionError
170instance ToJSON DatabaseContextFunctionError
144instance FromJSON DatabaseContextFunctionError
171instance FromJSON DatabaseContextFunctionError
145
172
@@ -151,3 +178,8 @@ instance FromJSON PersistenceError
151
178
152instance ToJSON AtomFunctionError
179instance ToJSON AtomFunctionError
153instance FromJSON AtomFunctionError
180instance FromJSON AtomFunctionError
181+
182+instance ToJSON WithNameExpr
183+instance FromJSON WithNameExpr
184+
185+
src/bin/ProjectM36/Server/WebSocket.hs+41−22
@@ -1,4 +1,4 @@
1−{-# LANGUAGE LambdaCase #-}
1+{-# LANGUAGE LambdaCase, CPP #-}
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,20 +10,26 @@ 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
13import ProjectM36.Relation.Show.Term
14import ProjectM36.Relation.Show.Term
14import ProjectM36.Relation.Show.HTML
15import ProjectM36.Relation.Show.HTML
15import Data.Aeson
16import Data.Aeson
16import TutorialD.Interpreter
17import TutorialD.Interpreter
17−import TutorialD.Interpreter.Base
18+import TutorialD.Interpreter.Base (TutorialDOperatorResult(..))
18import ProjectM36.Client
19import ProjectM36.Client
19import Control.Exception
20import Control.Exception
20import Data.Attoparsec.Text
21import Data.Attoparsec.Text
21import Control.Applicative
22import Control.Applicative
22import Text.Megaparsec.Error
23import Text.Megaparsec.Error
23import Data.Functor
24import 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
24
30
25websocketProxyServer :: Port -> Hostname -> WS.ServerApp
31websocketProxyServer :: Port -> Hostname -> WS.ServerApp
26−websocketProxyServer port host pending = do
32+websocketProxyServer port host pending = do
27 conn <- WS.acceptRequest pending
33 conn <- WS.acceptRequest pending
28 let unexpectedMsg = WS.sendTextData conn ("messagenotexpected" :: T.Text)
34 let unexpectedMsg = WS.sendTextData conn ("messagenotexpected" :: T.Text)
29 --phase 1- accept database name for connection
35 --phase 1- accept database name for connection
@@ -32,10 +38,10 @@ websocketProxyServer port host pending = do
32 if not (connectdbmsg `T.isPrefixOf` dbmsg) then unexpectedMsg >> WS.sendClose conn ("" :: T.Text)
38 if not (connectdbmsg `T.isPrefixOf` dbmsg) then unexpectedMsg >> WS.sendClose conn ("" :: T.Text)
33 else do
39 else do
34 let dbname = T.unpack $ T.drop (T.length connectdbmsg) dbmsg
40 let dbname = T.unpack $ T.drop (T.length connectdbmsg) dbmsg
35− bracket (createConnection conn dbname port host)
41+ bracket (createConnection conn dbname port host)
36 (\case
42 (\case
37 Right dbconn -> close dbconn
43 Right dbconn -> close dbconn
38− Left _ -> pure ()) $ \case
44+ Left _ -> pure ()) $ \case
39 Left err -> sendError conn err
45 Left err -> sendError conn err
40 Right dbconn -> do
46 Right dbconn -> do
41 eSessionId <- createSessionAtHead dbconn "master"
47 eSessionId <- createSessionAtHead dbconn "master"
@@ -46,34 +52,41 @@ websocketProxyServer port host pending = do
46 _ <- forever $ do
52 _ <- forever $ do
47 pInfo <- promptInfo sessionId dbconn
53 pInfo <- promptInfo sessionId dbconn
48 --figure out why sending three times during startup is necessary
54 --figure out why sending three times during startup is necessary
49− sendPromptInfo pInfo conn
55+ sendPromptInfo pInfo conn
50 sendPromptInfo pInfo conn
56 sendPromptInfo pInfo conn
51 msg <- WS.receiveData conn :: IO T.Text
57 msg <- WS.receiveData conn :: IO T.Text
52 case parseOnly parseExecuteMessage msg of
58 case parseOnly parseExecuteMessage msg of
53 Left _ -> unexpectedMsg
59 Left _ -> unexpectedMsg
54 Right (presentation, tutdString) ->
60 Right (presentation, tutdString) ->
55 case parseTutorialD tutdString of
61 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
56− Left err -> handleOpResult conn dbconn presentation (DisplayErrorResult ("parse error: " `T.append` T.pack (parseErrorPretty err)))
68+ (DisplayErrorResult ("parse error: " `T.append` T.pack (parseErrorPretty err)))
69+#endif
57 Right parsed -> do
70 Right parsed -> do
58− let timeoutFilter exc = if exc == RequestTimeoutException
71+ let timeoutFilter exc = if exc == RequestTimeoutException
59− then Just exc
72+ then Just exc
60 else Nothing
73 else Nothing
61 responseHandler = do
74 responseHandler = do
62 result <- evalTutorialD sessionId dbconn SafeEvaluation parsed
75 result <- evalTutorialD sessionId dbconn SafeEvaluation parsed
63 pInfo' <- promptInfo sessionId dbconn
76 pInfo' <- promptInfo sessionId dbconn
64− sendPromptInfo pInfo' conn
77+ sendPromptInfo pInfo' conn
65 handleOpResult conn dbconn presentation result
78 handleOpResult conn dbconn presentation result
66 catchJust timeoutFilter responseHandler (\_ -> handleOpResult conn dbconn presentation (DisplayErrorResult "Request Timed Out."))
79 catchJust timeoutFilter responseHandler (\_ -> handleOpResult conn dbconn presentation (DisplayErrorResult "Request Timed Out."))
67 pure ()
80 pure ()
68−
81+
69−notificationCallback :: WS.Connection -> NotificationCallback
82+notificationCallback :: WS.Connection -> NotificationCallback
70notificationCallback conn notifName evaldNotif = WS.sendTextData conn (encode (object ["notificationname" .= notifName,
83notificationCallback conn notifName evaldNotif = WS.sendTextData conn (encode (object ["notificationname" .= notifName,
71 "evaldnotification" .= evaldNotif
84 "evaldnotification" .= evaldNotif
72 ]))
85 ]))
73−
86+
74--this creates a new database for each connection- perhaps not what we want (?)
87--this creates a new database for each connection- perhaps not what we want (?)
75createConnection :: WS.Connection -> DatabaseName -> Port -> Hostname -> IO (Either ConnectionError Connection)
88createConnection :: WS.Connection -> DatabaseName -> Port -> Hostname -> IO (Either ConnectionError Connection)
76−createConnection wsconn dbname port host = connectProjectM36 (RemoteProcessConnectionInfo dbname (createNodeId host port) (notificationCallback wsconn))
89+createConnection wsconn dbname port host = connectProjectM36 (RemoteConnectionInfo dbname host (show port) (notificationCallback wsconn))
77
90
78sendError :: (ToJSON a) => WS.Connection -> a -> IO ()
91sendError :: (ToJSON a) => WS.Connection -> a -> IO ()
79sendError conn err = WS.sendTextData conn (encode (object ["displayerror" .= err]))
92sendError conn err = WS.sendTextData conn (encode (object ["displayerror" .= err]))
@@ -94,34 +107,40 @@ handleOpResult conn _ presentation (DisplayRelationResult rel) = do
94 texto = ["text" .= showRelation rel | textPresentation presentation]
107 texto = ["text" .= showRelation rel | textPresentation presentation]
95 htmlo = ["html" .= relationAsHTML rel | htmlPresentation presentation]
108 htmlo = ["html" .= relationAsHTML rel | htmlPresentation presentation]
96 WS.sendTextData conn (encode (object ["displayrelation" .= object (jsono ++ texto ++ htmlo)]))
109 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+
97-- get current schema and head name for client
116-- get current schema and head name for client
98promptInfo :: SessionId -> Connection -> IO (HeadName, SchemaName)
117promptInfo :: SessionId -> Connection -> IO (HeadName, SchemaName)
99promptInfo sessionId conn = do
118promptInfo sessionId conn = do
100− eHeadName <- headName sessionId conn
119+ eHeadName <- headName sessionId conn
101 eSchemaName <- currentSchemaName sessionId conn
120 eSchemaName <- currentSchemaName sessionId conn
102− pure (either (const "<unknown>") id eHeadName, either (const "<no schema>") id eSchemaName)
121+ pure (fromRight "<unknown>" eHeadName, fromRight "<no schema>" eSchemaName)
103−
122+
104sendPromptInfo :: (HeadName, SchemaName) -> WS.Connection -> IO ()
123sendPromptInfo :: (HeadName, SchemaName) -> WS.Connection -> IO ()
105sendPromptInfo (hName, sName) conn = WS.sendTextData conn (encode (object ["promptInfo" .= object ["headname" .= hName, "schemaname" .= sName]]))
124sendPromptInfo (hName, sName) conn = WS.sendTextData conn (encode (object ["promptInfo" .= object ["headname" .= hName, "schemaname" .= sName]]))
106
125
107--a returning relation can be returned as JSON, Text (for consoles), or HTML
126--a returning relation can be returned as JSON, Text (for consoles), or HTML
108data Presentation = Presentation {
127data Presentation = Presentation {
109− jsonPresentation :: Bool,
128+ jsonPresentation :: Bool,
110 textPresentation :: Bool,
129 textPresentation :: Bool,
111 htmlPresentation :: Bool }
130 htmlPresentation :: Bool }
112−
131+
113data PresentationFlag = JSONFlag | TextFlag | HTMLFlag
132data PresentationFlag = JSONFlag | TextFlag | HTMLFlag
114−
133+
115parseExecuteMessage :: Parser (Presentation, T.Text)
134parseExecuteMessage :: Parser (Presentation, T.Text)
116parseExecuteMessage = do
135parseExecuteMessage = do
117 _ <- string "executetutd/"
136 _ <- string "executetutd/"
118 flags <- sepBy ((string "json" $> JSONFlag) <|>
137 flags <- sepBy ((string "json" $> JSONFlag) <|>
119 (string "text" $> TextFlag) <|>
138 (string "text" $> TextFlag) <|>
120 (string "html" $> HTMLFlag)) "+"
139 (string "html" $> HTMLFlag)) "+"
121− let presentation = foldr (\flag acc -> case flag of
140+ let presentation = foldr (\flag acc -> case flag of
122 JSONFlag -> acc {jsonPresentation = True}
141 JSONFlag -> acc {jsonPresentation = True}
123 TextFlag -> acc {textPresentation = True}
142 TextFlag -> acc {textPresentation = True}
124 HTMLFlag -> acc {htmlPresentation = True}) (Presentation False False False) flags
143 HTMLFlag -> acc {htmlPresentation = True}) (Presentation False False False) flags
125 _ <- char ':'
144 _ <- char ':'
126 tutd <- T.pack <$> manyTill anyChar endOfInput
145 tutd <- T.pack <$> manyTill anyChar endOfInput
127− pure (presentation, tutd)
146+ pure (presentation, tutd)
src/bin/ProjectM36/Server/WebSocket/project-m36.js+45−6
@@ -55,9 +55,10 @@ 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, acknowledgementResult, errorResult)
58+var ProjectM36Status = function (relationResult, dataFrameResult, acknowledgementResult, errorResult)
59{
59{
60 this.relation = relationResult;
60 this.relation = relationResult;
61+ this.dataframe = dataFrameResult;
61 this.acknowledgement = acknowledgementResult;
62 this.acknowledgement = acknowledgementResult;
62 this.error = errorResult;
63 this.error = errorResult;
63}
64}
@@ -75,6 +76,7 @@ ProjectM36Connection.prototype.readyState = function()
75ProjectM36Connection.prototype.handleResponse = function(message)
76ProjectM36Connection.prototype.handleResponse = function(message)
76{
77{
77 var relation = message["displayrelation"];
78 var relation = message["displayrelation"];
79+ var dataframe = message["displaydataframe"];
78 var acknowledged = message["acknowledged"];
80 var acknowledged = message["acknowledged"];
79 var error = message["displayerror"];
81 var error = message["displayerror"];
80 var prompt = message["promptInfo"];
82 var prompt = message["promptInfo"];
@@ -82,12 +84,17 @@ ProjectM36Connection.prototype.handleResponse = function(message)
82
84
83 if(relation)
85 if(relation)
84 {
86 {
85− this.statuscallback(new ProjectM36Status(relation['json'], null, null));
87+ this.statuscallback(new ProjectM36Status(relation['json'], null, null, null));
88+ }
89+
90+ if(dataframe)
91+ {
92+ this.statuscallback(new ProjectM36Status(null, dataframe['json'], null, null));
86 }
93 }
87
94
88 if(acknowledged)
95 if(acknowledged)
89 {
96 {
90− this.statuscallback(new ProjectM36Status(null, true, null));
97+ this.statuscallback(new ProjectM36Status(null, null, true, null));
91 }
98 }
92
99
93 if(error)
100 if(error)
@@ -96,7 +103,7 @@ ProjectM36Connection.prototype.handleResponse = function(message)
96 {
103 {
97 error=error.tag; // for error objects
104 error=error.tag; // for error objects
98 }
105 }
99− this.statuscallback(new ProjectM36Status(null, null, error['json']));
106+ this.statuscallback(new ProjectM36Status(null, null, null, error['json']));
100 }
107 }
101
108
102 if(prompt)
109 if(prompt)
@@ -161,6 +168,7 @@ ProjectM36Connection.prototype.generateAtomType = function(attr)
161{
168{
162 var atomType = attr[1]["tag"];
169 var atomType = attr[1]["tag"];
163 var attrName = attr[0];
170 var attrName = attr[0];
171+ var accessory = attr[2];
164 var element = document.createElement("span");
172 var element = document.createElement("span");
165 element.textContent = attrName + "::";
173 element.textContent = attrName + "::";
166 if (atomType == "RelationAtomType")
174 if (atomType == "RelationAtomType")
@@ -185,7 +193,11 @@ ProjectM36Connection.prototype.generateAtomType = function(attr)
185 var readableType = atomType.slice(0,-8);
193 var readableType = atomType.slice(0,-8);
186 element.textContent += readableType;
194 element.textContent += readableType;
187 }
195 }
196+ if(accessory)
197+ {
198+ element.textContent += accessory;
199+ }
188− return element
200+ return element;
189}
201}
190
202
191ProjectM36Connection.prototype.generateRelationBody = function (body)
203ProjectM36Connection.prototype.generateRelationBody = function (body)
@@ -230,6 +242,33 @@ ProjectM36Connection.prototype.generateAtom = function(atom)
230 return element;
242 return element;
231}
243}
232
244
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+
233//special case to make sure that a table appears for "true" and "false"
272//special case to make sure that a table appears for "true" and "false"
234function mungeEmptyRows()
273function mungeEmptyRows()
235{
274{
@@ -249,4 +288,4 @@ function mungeEmptyRows()
249 empty.appendChild(dudHeader);
288 empty.appendChild(dudHeader);
250 }
289 }
251 }
290 }
252−}
291+}
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 date</li>
129+ <li>:importexample cjdate</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+7−1
@@ -30,6 +30,12 @@ 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+ }
33 if(status.acknowledgement)
39 if(status.acknowledgement)
34 {
40 {
35 var ok = document.createElement("span");
41 var ok = document.createElement("span");
@@ -253,4 +259,4 @@ function pageload()
253{
259{
254 installSampleHandlers();
260 installSampleHandlers();
255 setupDefaultConfig();
261 setupDefaultConfig();
256−}
262+}
src/bin/ProjectM36/Server/WebSocket/websocket-server.hs+49−12
@@ -1,26 +1,63 @@
1−import ProjectM36.Server.WebSocket
1+{-# LANGUAGE CPP #-}
2−import ProjectM36.Server.Config
2+
3−import ProjectM36.Server.ParseArgs
4−import ProjectM36.Server
5import Control.Concurrent
3import Control.Concurrent
6−import qualified Network.WebSockets as WS
7−import Network.Transport.TCP (decodeEndPointAddress)
8import Control.Exception
4import 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
16+import ProjectM36.Server.Config
17+import ProjectM36.Server.ParseArgs
18+import ProjectM36.Server.WebSocket
9
19
10main :: IO ()
20main :: IO ()
11main = do
21main = do
12 -- launch normal project-m36-server
22 -- launch normal project-m36-server
13 addressMVar <- newEmptyMVar
23 addressMVar <- newEmptyMVar
14− serverConfig <- parseConfigWithDefaults (defaultServerConfig { bindPort = 8000, bindHost = "127.0.0.1" })
24+ wsConfig <- parseWSConfigWithDefaults (defaultServerConfig {bindPort = 8000, bindHost = "127.0.0.1"})
25+
15 --usurp the serverConfig for our websocket server and make the proxied server run locally
26 --usurp the serverConfig for our websocket server and make the proxied server run locally
27+ let serverConfig = wsServerConfig wsConfig
16− let wsHost = bindHost serverConfig
28+ wsHost = bindHost serverConfig
17 wsPort = bindPort serverConfig
29 wsPort = bindPort serverConfig
18 serverHost = "127.0.0.1"
30 serverHost = "127.0.0.1"
19 serverConfig' = serverConfig {bindPort = 0, bindHost = serverHost}
31 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+
20 _ <- forkFinally (launchServer serverConfig' (Just addressMVar) >> pure ()) (either throwIO pure)
38 _ <- forkFinally (launchServer serverConfig' (Just addressMVar) >> pure ()) (either throwIO pure)
21 --wait for server to be listening
39 --wait for server to be listening
22− address <- takeMVar addressMVar
40+ addr <- takeMVar addressMVar
23− let Just (_, serverPort, _) = decodeEndPointAddress address
41+ let port =
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
42+ case addr of
25− WS.runServer wsHost (fromIntegral wsPort) (websocketProxyServer (read serverPort) serverHost)
43+ SockAddrInet port' _ -> fromIntegral port'
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"
26
55
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+34−32
@@ -1,4 +1,4 @@
1−{-# LANGUAGE GADTs, LambdaCase #-}
1+{-# LANGUAGE GADTs, LambdaCase, CPP #-}
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,16 +24,17 @@ 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
29import System.Console.Haskeline
27import System.Console.Haskeline
30import System.Directory (getHomeDirectory)
28import System.Directory (getHomeDirectory)
31import qualified Data.Text as T
29import qualified Data.Text as T
32import System.IO (hPutStrLn, stderr)
30import System.IO (hPutStrLn, stderr)
31+#if __GLASGOW_HASKELL__ < 804
33import Data.Monoid
32import 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)
37
38
38{-
39{-
39context ops are read-only operations which only operate on the database context (relvars and constraints)
40context ops are read-only operations which only operate on the database context (relvars and constraints)
@@ -61,7 +62,7 @@ interpreterParserP = safeInterpreterParserP <|>
61 fmap ImportDBContextOp (tutdImportP <* eof) <|>
62 fmap ImportDBContextOp (tutdImportP <* eof) <|>
62 fmap RelVarExportOp (exportCSVP <* eof) <|>
63 fmap RelVarExportOp (exportCSVP <* eof) <|>
63 fmap DatabaseContextIOExprOp (dbContextIOExprP <* eof)
64 fmap DatabaseContextIOExprOp (dbContextIOExprP <* eof)
64−
65+
65-- the safe interpreter never reads or writes the file system
66-- the safe interpreter never reads or writes the file system
66safeInterpreterParserP :: Parser ParsedOperation
67safeInterpreterParserP :: Parser ParsedOperation
67safeInterpreterParserP = fmap RODatabaseContextOp (roDatabaseContextOperatorP <* eof) <|>
68safeInterpreterParserP = fmap RODatabaseContextOp (roDatabaseContextOperatorP <* eof) <|>
@@ -77,13 +78,13 @@ safeInterpreterParserP = fmap RODatabaseContextOp (roDatabaseContextOperatorP <*
77promptText :: Either RelationalError HeadName -> Either RelationalError SchemaName -> StringType
78promptText :: Either RelationalError HeadName -> Either RelationalError SchemaName -> StringType
78promptText eHeadName eSchemaName = "TutorialD (" <> transInfo <> "): "
79promptText eHeadName eSchemaName = "TutorialD (" <> transInfo <> "): "
79 where
80 where
80− transInfo = either (const "<unknown>") id eHeadName <> "/" <> either (const "<no schema>") id eSchemaName
81+ transInfo = fromRight "<unknown>" eHeadName <> "/" <> fromRight "<no schema>" eSchemaName
81−
82+
82−parseTutorialD :: T.Text -> Either (ParseError Char Dec) ParsedOperation
83+parseTutorialD :: T.Text -> Either ParserError ParsedOperation
83parseTutorialD = parse interpreterParserP ""
84parseTutorialD = parse interpreterParserP ""
84
85
85--only parse tutoriald which doesn't result in file I/O
86--only parse tutoriald which doesn't result in file I/O
86−safeParseTutorialD :: T.Text -> Either (ParseError Char Dec) ParsedOperation
87+safeParseTutorialD :: T.Text -> Either ParserError ParsedOperation
87safeParseTutorialD = parse safeInterpreterParserP ""
88safeParseTutorialD = parse safeInterpreterParserP ""
88
89
89data SafeEvaluationFlag = SafeEvaluation | UnsafeEvaluation deriving (Eq)
90data SafeEvaluationFlag = SafeEvaluation | UnsafeEvaluation deriving (Eq)
@@ -106,20 +107,20 @@ evalTutorialDInteractive sessionId conn safe interactive expr = case expr of
106 else
107 else
107 pure res
108 pure res
108 _ -> pure res
109 _ -> pure res
109−
110+
110− (DatabaseContextExprOp execOp) ->
111+ (DatabaseContextExprOp execOp) ->
111− eHandler $ C.executeDatabaseContextExpr sessionId conn execOp
112+ eHandler $ C.executeDatabaseContextExpr sessionId conn execOp
112−
113+
113− (DatabaseContextIOExprOp execOp) ->
114+ (DatabaseContextIOExprOp execOp) ->
114 if needsSafe then
115 if needsSafe then
115 unsafeError
116 unsafeError
116 else
117 else
117 eHandler $ C.executeDatabaseContextIOExpr sessionId conn execOp
118 eHandler $ C.executeDatabaseContextIOExpr sessionId conn execOp
118−
119+
119 (GraphOp execOp) -> do
120 (GraphOp execOp) -> do
120 -- warn if the graph op could cause uncommited changes to be discarded
121 -- warn if the graph op could cause uncommited changes to be discarded
121 eIsDirty <- C.disconnectedTransactionIsDirty sessionId conn
122 eIsDirty <- C.disconnectedTransactionIsDirty sessionId conn
122− let runGraphOp = eHandler $ C.executeGraphExpr sessionId conn execOp
123+ let runGraphOp = eHandler $ C.executeGraphExpr sessionId conn execOp
123 settings = Settings {complete = noCompletion,
124 settings = Settings {complete = noCompletion,
124 historyFile = Nothing,
125 historyFile = Nothing,
125 autoAddHistory = False}
126 autoAddHistory = False}
@@ -143,20 +144,20 @@ evalTutorialDInteractive sessionId conn safe interactive expr = case expr of
143 pure (DisplayErrorResult "Graph operation cancelled.")
144 pure (DisplayErrorResult "Graph operation cancelled.")
144 else
145 else
145 runGraphOp
146 runGraphOp
146−
147+
147 (ConvenienceGraphOp execOp) ->
148 (ConvenienceGraphOp execOp) ->
148 eHandler $ evalConvenienceGraphOp sessionId conn execOp
149 eHandler $ evalConvenienceGraphOp sessionId conn execOp
149
150
150 (ROGraphOp execOp) -> do
151 (ROGraphOp execOp) -> do
151 opResult <- evalROGraphOp sessionId conn execOp
152 opResult <- evalROGraphOp sessionId conn execOp
152− case opResult of
153+ case opResult of
153 Left err -> barf err
154 Left err -> barf err
154 Right rel -> pure (DisplayRelationResult rel)
155 Right rel -> pure (DisplayRelationResult rel)
155−
156+
156 (SchemaOp execOp) ->
157 (SchemaOp execOp) ->
157 eHandler $ evalSchemaOperator sessionId conn execOp
158 eHandler $ evalSchemaOperator sessionId conn execOp
158−
159+
159− (ImportRelVarOp execOp@(RelVarDataImportOperator relVarName _ _)) ->
160+ (ImportRelVarOp execOp@(RelVarDataImportOperator relVarName _ _)) ->
160 if needsSafe then
161 if needsSafe then
161 unsafeError
162 unsafeError
162 else do
163 else do
@@ -174,8 +175,8 @@ evalTutorialDInteractive sessionId conn safe interactive expr = case expr of
174 case exprErr of
175 case exprErr of
175 Left err -> barf err
176 Left err -> barf err
176 Right dbexpr -> evalTutorialD sessionId conn safe (DatabaseContextExprOp dbexpr)
177 Right dbexpr -> evalTutorialD sessionId conn safe (DatabaseContextExprOp dbexpr)
177−
178+
178− (ImportDBContextOp execOp) ->
179+ (ImportDBContextOp execOp) ->
179 if needsSafe then
180 if needsSafe then
180 unsafeError
181 unsafeError
181 else do
182 else do
@@ -183,15 +184,15 @@ evalTutorialDInteractive sessionId conn safe interactive expr = case expr of
183 case eErr of
184 case eErr of
184 Left err -> barf err
185 Left err -> barf err
185 Right dbexprs -> evalTutorialD sessionId conn safe (DatabaseContextExprOp dbexprs)
186 Right dbexprs -> evalTutorialD sessionId conn safe (DatabaseContextExprOp dbexprs)
186−
187+
187− (InfoOp execOp) ->
188+ (InfoOp execOp) ->
188 if needsSafe then
189 if needsSafe then
189 unsafeError
190 unsafeError
190 else
191 else
191 case evalInformationOperator execOp of
192 case evalInformationOperator execOp of
192 Left err -> pure (DisplayErrorResult err)
193 Left err -> pure (DisplayErrorResult err)
193 Right info -> pure (DisplayResult info)
194 Right info -> pure (DisplayResult info)
194−
195+
195 (RelVarExportOp execOp@(RelVarDataExportOperator relExpr _ _)) ->
196 (RelVarExportOp execOp@(RelVarDataExportOperator relExpr _ _)) ->
196 --eval relexpr to relation and pass to export function
197 --eval relexpr to relation and pass to export function
197 if needsSafe then
198 if needsSafe then
@@ -215,19 +216,20 @@ evalTutorialDInteractive sessionId conn safe interactive expr = case expr of
215 unsafeError = pure $ DisplayErrorResult "File I/O operation prohibited."
216 unsafeError = pure $ DisplayErrorResult "File I/O operation prohibited."
216 barf :: RelationalError -> IO TutorialDOperatorResult
217 barf :: RelationalError -> IO TutorialDOperatorResult
217 barf (ScriptError (OtherScriptCompilationError errStr)) = pure (DisplayErrorResult (T.pack errStr))
218 barf (ScriptError (OtherScriptCompilationError errStr)) = pure (DisplayErrorResult (T.pack errStr))
219+ barf (ParseError err) = pure (DisplayErrorResult err)
218 barf err = return $ DisplayErrorResult (T.pack (show err))
220 barf err = return $ DisplayErrorResult (T.pack (show err))
219 eHandler io = do
221 eHandler io = do
220 eErr <- io
222 eErr <- io
221 case eErr of
223 case eErr of
222 Left err -> barf err
224 Left err -> barf err
223 Right () -> return QuietSuccessResult
225 Right () -> return QuietSuccessResult
224−
226+
225−type GhcPkgPath = String
227+type GhcPkgPath = String
226type TutorialDExec = String
228type TutorialDExec = String
227type CheckFS = Bool
229type CheckFS = Bool
228−
230+
229data InterpreterConfig = LocalInterpreterConfig PersistenceStrategy HeadName (Maybe TutorialDExec) [GhcPkgPath] CheckFS |
231data InterpreterConfig = LocalInterpreterConfig PersistenceStrategy HeadName (Maybe TutorialDExec) [GhcPkgPath] CheckFS |
230− RemoteInterpreterConfig C.NodeId C.DatabaseName HeadName (Maybe TutorialDExec) CheckFS
232+ RemoteInterpreterConfig C.Hostname C.Port C.DatabaseName HeadName (Maybe TutorialDExec) CheckFS
231
233
232outputNotificationCallback :: C.NotificationCallback
234outputNotificationCallback :: C.NotificationCallback
233outputNotificationCallback notName evaldNot = hPutStrLn stderr $ "Notification received " ++ show notName ++ ":\n" ++ "\n" ++ prettyEvaluatedNotification evaldNot
235outputNotificationCallback notName evaldNot = hPutStrLn stderr $ "Notification received " ++ show notName ++ ":\n" ++ "\n" ++ prettyEvaluatedNotification evaldNot
@@ -256,12 +258,12 @@ reprLoop config sessionId conn = do
256 Just line -> do
258 Just line -> do
257 runTutorialD sessionId conn (Just (T.length prompt)) (T.pack line)
259 runTutorialD sessionId conn (Just (T.length prompt)) (T.pack line)
258 reprLoop config sessionId conn
260 reprLoop config sessionId conn
259−
261+
260
262
261runTutorialD :: C.SessionId -> C.Connection -> Maybe PromptLength -> T.Text -> IO ()
263runTutorialD :: C.SessionId -> C.Connection -> Maybe PromptLength -> T.Text -> IO ()
262−runTutorialD sessionId conn mPromptLength tutd =
264+runTutorialD sessionId conn mPromptLength tutd =
263 case parseTutorialD tutd of
265 case parseTutorialD tutd of
264− Left err ->
266+ Left err ->
265 displayOpResult $ DisplayParseErrorResult mPromptLength err
267 displayOpResult $ DisplayParseErrorResult mPromptLength err
266 Right parsed ->
268 Right parsed ->
267 catchJust (\exc -> if exc == C.RequestTimeoutException then Just exc else Nothing) (do
269 catchJust (\exc -> if exc == C.RequestTimeoutException then Just exc else Nothing) (do
src/bin/TutorialD/Interpreter/Base.hs+114−40
@@ -1,34 +1,61 @@
1{-# LANGUAGE DeriveGeneric, CPP #-}
1{-# LANGUAGE DeriveGeneric, CPP #-}
2−module TutorialD.Interpreter.Base where
2+module TutorialD.Interpreter.Base (
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
3import ProjectM36.Base
13import ProjectM36.Base
4import ProjectM36.AtomType
14import ProjectM36.AtomType
15+import ProjectM36.Attribute as A
5import ProjectM36.Relation
16import ProjectM36.Relation
17+import ProjectM36.DataFrame
6
18
19+#if MIN_VERSION_megaparsec(6,0,0)
20+import Text.Megaparsec.Char
21+import qualified Text.Megaparsec.Char.Lexer as Lex
7import Text.Megaparsec
22import Text.Megaparsec
23+import Data.Void
24+import Control.Applicative hiding (many, some)
25+#else
8import Text.Megaparsec.Text
26import Text.Megaparsec.Text
9import qualified Text.Megaparsec.Lexer as Lex
27import qualified Text.Megaparsec.Lexer as Lex
28+#endif
29+
10import Data.Text hiding (count)
30import Data.Text hiding (count)
11import System.Random
31import System.Random
12import qualified Data.Text as T
32import qualified Data.Text as T
13import qualified Data.List as L
33import qualified Data.List as L
14−import qualified Data.Vector as V
15import qualified Data.Text.IO as TIO
34import qualified Data.Text.IO as TIO
16import System.IO
35import System.IO
17import ProjectM36.Relation.Show.Term
36import ProjectM36.Relation.Show.Term
18import GHC.Generics
37import GHC.Generics
38+#if __GLASGOW_HASKELL__ < 804
19import Data.Monoid
39import Data.Monoid
40+#endif
20import qualified Data.UUID as U
41import qualified Data.UUID as U
21import Control.Monad.Random
42import Control.Monad.Random
22import Data.List.NonEmpty as NE
43import Data.List.NonEmpty as NE
23import Data.Time.Clock
44import Data.Time.Clock
24import Data.Time.Format
45import Data.Time.Format
25import Control.Monad (void)
46import 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
26
53
27displayOpResult :: TutorialDOperatorResult -> IO ()
54displayOpResult :: TutorialDOperatorResult -> IO ()
28displayOpResult QuitResult = return ()
55displayOpResult QuitResult = return ()
29displayOpResult (DisplayResult out) = TIO.putStrLn out
56displayOpResult (DisplayResult out) = TIO.putStrLn out
30displayOpResult (DisplayIOResult ioout) = ioout
57displayOpResult (DisplayIOResult ioout) = ioout
31−displayOpResult (DisplayErrorResult err) = let outputf = if T.length err > 0 && T.last err /= '\n' then TIO.hPutStrLn else TIO.hPutStr in
58+displayOpResult (DisplayErrorResult err) = let outputf = if T.length err > 0 && T.last err /= '\n' then TIO.hPutStrLn else TIO.hPutStr in
32 outputf stderr ("ERR: " <> err)
59 outputf stderr ("ERR: " <> err)
33displayOpResult QuietSuccessResult = return ()
60displayOpResult QuietSuccessResult = return ()
34displayOpResult (DisplayRelationResult rel) = do
61displayOpResult (DisplayRelationResult rel) = do
@@ -36,22 +63,36 @@ displayOpResult (DisplayRelationResult rel) = do
36 let randomlySortedRel = evalRand (randomizeTupleOrder rel) gen
63 let randomlySortedRel = evalRand (randomizeTupleOrder rel) gen
37 TIO.putStrLn (showRelation randomlySortedRel)
64 TIO.putStrLn (showRelation randomlySortedRel)
38displayOpResult (DisplayParseErrorResult mPromptLength err) = do
65displayOpResult (DisplayParseErrorResult mPromptLength err) = do
66+#if MIN_VERSION_megaparsec(7,0,0)
67+ let errorIndent = errorOffset . NE.head . bundleErrors $ err
39− let errString = T.pack (parseErrorPretty err)
68+ errString = T.pack (parseErrorPretty . NE.head . bundleErrors $ err)
69+#else
40− errorIndent = unPos (sourceColumn (NE.head (errorPos err)))
70+ let errorIndent = unPos (sourceColumn (NE.head (errorPos err)))
71+ errString = T.pack (parseErrorPretty err)
72+#endif
41 pointyString len = T.justifyRight (len + fromIntegral errorIndent) '_' "^"
73 pointyString len = T.justifyRight (len + fromIntegral errorIndent) '_' "^"
42 maybe (pure ()) (TIO.putStrLn . pointyString) mPromptLength
74 maybe (pure ()) (TIO.putStrLn . pointyString) mPromptLength
43 TIO.putStr ("ERR:" <> errString)
75 TIO.putStr ("ERR:" <> errString)
76+displayOpResult (DisplayDataFrameResult dFrame) = TIO.putStrLn (showDataFrame dFrame)
44
77
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
45spaceConsumer :: Parser ()
86spaceConsumer :: Parser ()
46−spaceConsumer = Lex.space (void spaceChar) (Lex.skipLineComment "--") (Lex.skipBlockComment "{-" "-}")
87+spaceConsumer = Lex.space space1 (Lex.skipLineComment "--") (Lex.skipBlockComment "{-" "-}")
47−
88+
48opChar :: Parser Char
89opChar :: Parser Char
49opChar = oneOf (":!#$%&*+./<=>?\\^|-~" :: String)-- remove "@" so it can be used as attribute marker without spaces
90opChar = oneOf (":!#$%&*+./<=>?\\^|-~" :: String)-- remove "@" so it can be used as attribute marker without spaces
50
91
51−reserved :: String -> Parser ()
92+reserved :: ParseStr -> Parser ()
52reserved word = try (string word *> notFollowedBy opChar *> spaceConsumer)
93reserved word = try (string word *> notFollowedBy opChar *> spaceConsumer)
53
94
54−reservedOp :: String -> Parser ()
95+reservedOp :: ParseStr -> Parser ()
55reservedOp op = try (spaceConsumer *> string op *> notFollowedBy opChar *> spaceConsumer)
96reservedOp op = try (spaceConsumer *> string op *> notFollowedBy opChar *> spaceConsumer)
56
97
57parens :: Parser a -> Parser a
98parens :: Parser a -> Parser a
@@ -63,12 +104,20 @@ braces = between (symbol "{") (symbol "}")
63identifier :: Parser Text
104identifier :: Parser Text
64identifier = do
105identifier = do
65 istart <- letterChar <|> char '_'
106 istart <- letterChar <|> char '_'
107+ identifierRemainder istart
108+
109+identifierRemainder :: Char -> Parser Text
110+identifierRemainder c = do
66− irest <- many (alphaNumChar <|> char '_' <|> char '#')
111+ rest <- many (alphaNumChar <|> char '_' <|> char '#')
67 spaceConsumer
112 spaceConsumer
68− pure (pack (istart:irest))
113+ pure (pack (c:rest))
69
114
70−symbol :: String -> Parser Text
115+symbol :: ParseStr -> Parser Text
116+#if MIN_VERSION_megaparsec(6,0,0)
117+symbol sym = Lex.symbol spaceConsumer sym
118+#else
71symbol sym = pack <$> Lex.symbol spaceConsumer sym
119symbol sym = pack <$> Lex.symbol spaceConsumer sym
120+#endif
72
121
73comma :: Parser Text
122comma :: Parser Text
74comma = symbol ","
123comma = symbol ","
@@ -88,67 +137,80 @@ arrow = symbol "->"
88semi :: Parser Text
137semi :: Parser Text
89semi = symbol ";"
138semi = symbol ";"
90
139
91−{-
140+nline :: Parser Text
92−whiteSpace :: Parser ()
141+nline = (T.singleton <$> newline) <|> crlf
93−whiteSpace = Token.whiteSpace lexer
94−-}
95
142
96integer :: Parser Integer
143integer :: Parser Integer
144+#if MIN_VERSION_megaparsec(6,0,0)
145+integer = Lex.signed (pure ()) Lex.decimal <* spaceConsumer
146+#else
97−integer = Lex.integer
147+integer = Lex.signed (pure ()) Lex.integer <* spaceConsumer
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
98
156
99float :: Parser Double
157float :: Parser Double
100−float = Lex.float
158+float = Lex.float <* spaceConsumer
101
159
102capitalizedIdentifier :: Parser Text
160capitalizedIdentifier :: Parser Text
103−capitalizedIdentifier = do
161+capitalizedIdentifier =
104− fletter <- upperChar
162+ upperChar >>= identifierRemainder
105− restOfIdentifier_ fletter
163+
106−
107−restOfIdentifier_ :: Char -> Parser Text
108−restOfIdentifier_ fletter = do
109− rest <- option "" identifier
110− spaceConsumer
111− pure (T.cons fletter rest)
112−
113uncapitalizedIdentifier :: Parser Text
164uncapitalizedIdentifier :: Parser Text
114−uncapitalizedIdentifier = do
165+uncapitalizedIdentifier =
115− fletter <- lowerChar
166+ lowerChar >>= identifierRemainder
116− restOfIdentifier_ fletter
117
167
118showRelationAttributes :: Attributes -> Text
168showRelationAttributes :: Attributes -> Text
119showRelationAttributes attrs = "{" <> T.concat (L.intersperse ", " $ L.map showAttribute attrsL) <> "}"
169showRelationAttributes attrs = "{" <> T.concat (L.intersperse ", " $ L.map showAttribute attrsL) <> "}"
120 where
170 where
121− showAttribute (Attribute name atomType) = name <> " " <> prettyAtomType atomType
171+ showAttribute (Attribute name atomType') = name <> " " <> prettyAtomType atomType'
122− attrsL = V.toList attrs
172+ attrsL = A.toList attrs
173+
174+type PromptLength = Int
123
175
124−type PromptLength = Int
176+#if MIN_VERSION_megaparsec(7,0,0)
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
125
183
126data TutorialDOperatorResult = QuitResult |
184data TutorialDOperatorResult = QuitResult |
127 DisplayResult StringType |
185 DisplayResult StringType |
128 DisplayIOResult (IO ()) |
186 DisplayIOResult (IO ()) |
129 DisplayRelationResult Relation |
187 DisplayRelationResult Relation |
188+ DisplayDataFrameResult DataFrame |
130 DisplayErrorResult StringType |
189 DisplayErrorResult StringType |
131− DisplayParseErrorResult (Maybe PromptLength) (ParseError Char Dec) | -- Int refers to length of prompt text
190+ DisplayParseErrorResult (Maybe PromptLength) ParserError | -- PromptLength refers to length of prompt text
132 QuietSuccessResult
191 QuietSuccessResult
133 deriving (Generic)
192 deriving (Generic)
134−
193+
135type TransactionGraphWasUpdated = Bool
194type TransactionGraphWasUpdated = Bool
136
195
137--allow for python-style triple quoting because guessing the correct amount of escapes in different contexts is annoying
196--allow for python-style triple quoting because guessing the correct amount of escapes in different contexts is annoying
138tripleQuotedString :: Parser Text
197tripleQuotedString :: Parser Text
139tripleQuotedString = do
198tripleQuotedString = do
140 _ <- tripleQuote
199 _ <- tripleQuote
141− pack <$> manyTill anyChar (try (tripleQuote >> notFollowedBy quote))
200+ pack <$> manyTill anySingle (try (tripleQuote >> notFollowedBy quote))
142−
201+
143normalQuotedString :: Parser Text
202normalQuotedString :: Parser Text
144normalQuotedString = quote *> (T.pack <$> manyTill Lex.charLiteral quote)
203normalQuotedString = quote *> (T.pack <$> manyTill Lex.charLiteral quote)
145
204
146quotedString :: Parser Text
205quotedString :: Parser Text
147quotedString = try tripleQuotedString <|> normalQuotedString
206quotedString = try tripleQuotedString <|> normalQuotedString
148
207
208+quoted :: Parser a -> Parser a
209+quoted = between quote quote
210+
149uuidP :: Parser U.UUID
211uuidP :: Parser U.UUID
150uuidP = do
212uuidP = do
151− uuidStart <- count 8 hexDigitChar
213+ uuidStart <- count 8 hexDigitChar
152 _ <- char '-' -- min 28 with no dashes, maximum 4 dashes
214 _ <- char '-' -- min 28 with no dashes, maximum 4 dashes
153 uuidMid1 <- count 4 hexDigitChar
215 uuidMid1 <- count 4 hexDigitChar
154 _ <- char '-'
216 _ <- char '-'
@@ -167,5 +229,17 @@ utcTimeP = do
167 timeStr <- quotedString
229 timeStr <- quotedString
168 case parseTimeM True defaultTimeLocale "%Y-%m-%d %H:%M:%S" (T.unpack timeStr) of
230 case parseTimeM True defaultTimeLocale "%Y-%m-%d %H:%M:%S" (T.unpack timeStr) of
169 Nothing -> fail "invalid datetime input, use \"YYYY-MM-DD HH:MM:SS\""
231 Nothing -> fail "invalid datetime input, use \"YYYY-MM-DD HH:MM:SS\""
170− Just stamp -> pure stamp
232+ 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'))
171
245
src/bin/TutorialD/Interpreter/DatabaseContextExpr.hs+32−31
@@ -1,20 +1,20 @@
1+{-# LANGUAGE CPP #-}
1module TutorialD.Interpreter.DatabaseContextExpr where
2module TutorialD.Interpreter.DatabaseContextExpr where
2−import Text.Megaparsec
3−import Text.Megaparsec.Text
4import ProjectM36.Base
3import ProjectM36.Base
5import TutorialD.Interpreter.Base
4import TutorialD.Interpreter.Base
6import qualified Data.Text as T
5import qualified Data.Text as T
7import TutorialD.Interpreter.RelationalExpr
6import TutorialD.Interpreter.RelationalExpr
8import TutorialD.Interpreter.Types
7import TutorialD.Interpreter.Types
9import qualified Data.Map as M
8import qualified Data.Map as M
10−import Control.Monad.State
11import ProjectM36.StaticOptimizer
9import ProjectM36.StaticOptimizer
12import qualified ProjectM36.Error as PM36E
10import qualified ProjectM36.Error as PM36E
13import ProjectM36.Error
11import ProjectM36.Error
14import qualified ProjectM36.RelationalExpression as RE
12import qualified ProjectM36.RelationalExpression as RE
15import ProjectM36.Key
13import ProjectM36.Key
16import ProjectM36.FunctionalDependency
14import ProjectM36.FunctionalDependency
15+#if __GLASGOW_HASKELL__ < 804
17import Data.Monoid
16import 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,49 +44,47 @@ nothingP = spaceConsumer >> pure NoOperation
44assignP :: Parser DatabaseContextExpr
44assignP :: Parser DatabaseContextExpr
45assignP = do
45assignP = do
46 relVarName <- try $ do
46 relVarName <- try $ do
47− relVarName <- identifier
47+ relVarName <- relVarNameP
48 reservedOp ":="
48 reservedOp ":="
49 return relVarName
49 return relVarName
50− expr <- relExprP
51− pure $ Assign relVarName expr
50+ Assign relVarName <$> relExprP
52
51
53multilineSep :: Parser T.Text
52multilineSep :: Parser T.Text
54multilineSep = newline >> pure "\n"
53multilineSep = newline >> pure "\n"
55
54
56multipleDatabaseContextExprP :: Parser DatabaseContextExpr
55multipleDatabaseContextExprP :: Parser DatabaseContextExpr
57−multipleDatabaseContextExprP =
56+multipleDatabaseContextExprP = do
58− MultipleExpr <$> sepBy1 databaseContextExprP semi
57+ exprs <- filter (/= NoOperation) <$> sepBy1 databaseContextExprP semi
58+ pure (MultipleExpr exprs)
59
59
60insertP :: Parser DatabaseContextExpr
60insertP :: Parser DatabaseContextExpr
61insertP = do
61insertP = do
62 reservedOp "insert"
62 reservedOp "insert"
63− relvar <- identifier
63+ relvar <- relVarNameP
64− expr <- relExprP
65− pure $ Insert relvar expr
64+ Insert relvar <$> relExprP
66
65
67defineP :: Parser DatabaseContextExpr
66defineP :: Parser DatabaseContextExpr
68defineP = do
67defineP = do
69 relVarName <- try $ do
68 relVarName <- try $ do
70− relVarName <- identifier
69+ relVarName <- relVarNameP
71 reservedOp "::"
70 reservedOp "::"
72 return relVarName
71 return relVarName
73− attributeSet <- makeAttributeExprsP
74− pure $ Define relVarName attributeSet
72+ Define relVarName <$> makeAttributeExprsP
75
73
76undefineP :: Parser DatabaseContextExpr
74undefineP :: Parser DatabaseContextExpr
77undefineP = do
75undefineP = do
78 reservedOp "undefine"
76 reservedOp "undefine"
79− Undefine <$> identifier
77+ Undefine <$> relVarNameP
80
78
81deleteP :: Parser DatabaseContextExpr
79deleteP :: Parser DatabaseContextExpr
82deleteP = do
80deleteP = do
83 reservedOp "delete"
81 reservedOp "delete"
84− Delete <$> identifier <*> option TruePredicate (reservedOp "where" *> restrictionPredicateP)
82+ Delete <$> relVarNameP <*> option TruePredicate (reservedOp "where" *> restrictionPredicateP)
85
83
86updateP :: Parser DatabaseContextExpr
84updateP :: Parser DatabaseContextExpr
87updateP = do
85updateP = do
88 reservedOp "update"
86 reservedOp "update"
89− relVarName <- identifier
87+ relVarName <- relVarNameP
90 predicate <- option TruePredicate (reservedOp "where" *> restrictionPredicateP <* spaceConsumer)
88 predicate <- option TruePredicate (reservedOp "where" *> restrictionPredicateP <* spaceConsumer)
91 attributeAssignments <- M.fromList <$> parens (sepBy attributeAssignmentP comma)
89 attributeAssignments <- M.fromList <$> parens (sepBy attributeAssignmentP comma)
92 return $ Update relVarName attributeAssignments predicate
90 return $ Update relVarName attributeAssignments predicate
@@ -110,8 +108,7 @@ addConstraintP = do
110deleteConstraintP :: Parser DatabaseContextExpr
108deleteConstraintP :: Parser DatabaseContextExpr
111deleteConstraintP = do
109deleteConstraintP = do
112 reserved "deleteconstraint"
110 reserved "deleteconstraint"
113− constraintName <- identifier
111+ RemoveInclusionDependency <$> identifier
114− pure $ RemoveInclusionDependency constraintName
115
112
116-- key <constraint name> {<uniqueness attributes>} <uniqueness relexpr>
113-- key <constraint name> {<uniqueness attributes>} <uniqueness relexpr>
117keyP :: Parser DatabaseContextExpr
114keyP :: Parser DatabaseContextExpr
@@ -151,14 +148,12 @@ addNotificationP = do
151 notName <- identifier
148 notName <- identifier
152 triggerExpr <- relExprP
149 triggerExpr <- relExprP
153 resultOldExpr <- relExprP
150 resultOldExpr <- relExprP
154− resultNewExpr <- relExprP
155− pure $ AddNotification notName triggerExpr resultOldExpr resultNewExpr
151+ AddNotification notName triggerExpr resultOldExpr <$> relExprP
156
152
157removeNotificationP :: Parser DatabaseContextExpr
153removeNotificationP :: Parser DatabaseContextExpr
158removeNotificationP = do
154removeNotificationP = do
159 reserved "unnotify"
155 reserved "unnotify"
160− notName <- identifier
156+ RemoveNotification <$> identifier
161− pure $ RemoveNotification notName
162
157
163-- | data Hair = Bald | Color Text
158-- | data Hair = Bald | Color Text
164addTypeConstructorP :: Parser DatabaseContextExpr
159addTypeConstructorP :: Parser DatabaseContextExpr
@@ -172,7 +167,7 @@ addTypeConstructorP = do
172removeTypeConstructorP :: Parser DatabaseContextExpr
167removeTypeConstructorP :: Parser DatabaseContextExpr
173removeTypeConstructorP = do
168removeTypeConstructorP = do
174 reserved "undata"
169 reserved "undata"
175− RemoveTypeConstructor <$> identifier
170+ RemoveTypeConstructor <$> typeConstructorNameP
176
171
177removeAtomFunctionP :: Parser DatabaseContextExpr
172removeAtomFunctionP :: Parser DatabaseContextExpr
178removeAtomFunctionP = do
173removeAtomFunctionP = do
@@ -184,29 +179,35 @@ removeDatabaseContextFunctionP = do
184 reserved "removedatabasecontextfunction"
179 reserved "removedatabasecontextfunction"
185 RemoveDatabaseContextFunction <$> quotedString
180 RemoveDatabaseContextFunction <$> quotedString
186
181
182+functionNameP :: Parser AtomFunctionName
183+functionNameP = uncapitalizedIdentifier
184+
187executeDatabaseContextFunctionP :: Parser DatabaseContextExpr
185executeDatabaseContextFunctionP :: Parser DatabaseContextExpr
188executeDatabaseContextFunctionP = do
186executeDatabaseContextFunctionP = do
189 reserved "execute"
187 reserved "execute"
190− funcName <- identifier
188+ funcName <- functionNameP
191 args <- parens (sepBy atomExprP comma)
189 args <- parens (sepBy atomExprP comma)
192 pure (ExecuteDatabaseContextFunction funcName args)
190 pure (ExecuteDatabaseContextFunction funcName args)
193
191
194databaseExprOpP :: Parser DatabaseContextExpr
192databaseExprOpP :: Parser DatabaseContextExpr
195databaseExprOpP = multipleDatabaseContextExprP
193databaseExprOpP = multipleDatabaseContextExprP
196
194
195+{-
197evalDatabaseContextExpr :: Bool -> DatabaseContext -> DatabaseContextExpr -> Either RelationalError DatabaseContext
196evalDatabaseContextExpr :: Bool -> DatabaseContext -> DatabaseContextExpr -> Either RelationalError DatabaseContext
198evalDatabaseContextExpr useOptimizer context expr = do
197evalDatabaseContextExpr useOptimizer context expr = do
199 optimizedExpr <- evalState (applyStaticDatabaseOptimization expr) (RE.freshDatabaseState context)
198 optimizedExpr <- evalState (applyStaticDatabaseOptimization expr) (RE.freshDatabaseState context)
200 case runState (RE.evalDatabaseContextExpr (if useOptimizer then optimizedExpr else expr)) (RE.freshDatabaseState context) of
199 case runState (RE.evalDatabaseContextExpr (if useOptimizer then optimizedExpr else expr)) (RE.freshDatabaseState context) of
201 (Right (), (context',_, _)) -> Right context'
200 (Right (), (context',_, _)) -> Right context'
202 (Left err, _) -> Left err
201 (Left err, _) -> Left err
202+-}
203
203
204−
205−interpretDatabaseContextExpr :: DatabaseContext -> T.Text -> Either RelationalError DatabaseContext
204+interpretDatabaseContextExpr :: DatabaseContext -> TransactionId -> TransactionGraph -> T.Text -> Either RelationalError DatabaseContext
206−interpretDatabaseContextExpr context tutdstring = case parse databaseExprOpP "" tutdstring of
205+interpretDatabaseContextExpr context transId graph tutdstring =
206+ case parse databaseExprOpP "" tutdstring of
207− Left err -> Left $ PM36E.ParseError (T.pack (show err))
207+ Left err -> Left $ PM36E.ParseError (T.pack (show err))
208− Right parsed ->
208+ Right parsed -> do
209− evalDatabaseContextExpr True context parsed
209+ let env = RE.mkDatabaseContextEvalEnv transId graph
210+ RE.dbc_context <$> RE.runDatabaseContextEvalMonad context env (optimizeAndEvalDatabaseContextExpr True parsed)
210
211
211{-
212{-
212--no optimization
213--no optimization
src/bin/TutorialD/Interpreter/DatabaseContextIOOperator.hs+17−7
@@ -1,11 +1,8 @@
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−
5import TutorialD.Interpreter.Base
4import TutorialD.Interpreter.Base
6import TutorialD.Interpreter.Types
5import TutorialD.Interpreter.Types
7−import Text.Megaparsec
8−import Text.Megaparsec.Text
9import Data.Text
6import Data.Text
10
7
11addAtomFunctionExprP :: Parser DatabaseContextIOExpr
8addAtomFunctionExprP :: Parser DatabaseContextIOExpr
@@ -13,20 +10,33 @@ addAtomFunctionExprP = dbioexprP "addatomfunction" AddAtomFunction
13
10
14addDatabaseContextFunctionExprP :: Parser DatabaseContextIOExpr
11addDatabaseContextFunctionExprP :: Parser DatabaseContextIOExpr
15addDatabaseContextFunctionExprP = dbioexprP "adddatabasecontextfunction" AddDatabaseContextFunction
12addDatabaseContextFunctionExprP = 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')
16
23
17−dbioexprP :: String -> (Text -> [TypeConstructor] -> Text -> DatabaseContextIOExpr) -> Parser DatabaseContextIOExpr
24+dbioexprP :: ParseStr -> (Text -> [TypeConstructor] -> Text -> DatabaseContextIOExpr) -> Parser DatabaseContextIOExpr
18dbioexprP res adt = do
25dbioexprP res adt = do
19 reserved res
26 reserved res
20 funcName <- quotedString
27 funcName <- quotedString
21 funcType <- atomTypeSignatureP
28 funcType <- atomTypeSignatureP
22− funcScript <- quotedString
23− pure $ adt funcName funcType funcScript
29+ adt funcName funcType <$> quotedString
24
30
25atomTypeSignatureP :: Parser [TypeConstructor]
31atomTypeSignatureP :: Parser [TypeConstructor]
26atomTypeSignatureP = sepBy typeConstructorP arrow
32atomTypeSignatureP = sepBy typeConstructorP arrow
27
33
28dbContextIOExprP :: Parser DatabaseContextIOExpr
34dbContextIOExprP :: Parser DatabaseContextIOExpr
29−dbContextIOExprP = addAtomFunctionExprP <|> addDatabaseContextFunctionExprP <|> loadAtomFunctionsP
35+dbContextIOExprP = addAtomFunctionExprP <|>
36+ addDatabaseContextFunctionExprP <|>
37+ loadAtomFunctionsP <|>
38+ loadDatabaseContextFunctionsP <|>
39+ createArbitraryRelationP
30
40
31loadAtomFunctionsP :: Parser DatabaseContextIOExpr
41loadAtomFunctionsP :: Parser DatabaseContextIOExpr
32loadAtomFunctionsP = do
42loadAtomFunctionsP = do
src/bin/TutorialD/Interpreter/Export/Base.hs+3
@@ -1,7 +1,10 @@
1+{-# LANGUAGE CPP #-}
1module TutorialD.Interpreter.Export.Base where
2module TutorialD.Interpreter.Export.Base where
2import ProjectM36.Base
3import ProjectM36.Base
3import ProjectM36.Error
4import ProjectM36.Error
5+#if __GLASGOW_HASKELL__ < 804
4import Data.Monoid
6import Data.Monoid
7+#endif
5
8
6data RelVarDataExportOperator = RelVarDataExportOperator RelationalExpr FilePath (RelVarDataExportOperator -> Relation -> IO (Maybe RelationalError))
9data RelVarDataExportOperator = RelVarDataExportOperator RelationalExpr FilePath (RelVarDataExportOperator -> Relation -> IO (Maybe RelationalError))
7
10
src/bin/TutorialD/Interpreter/Export/CSV.hs+1−2
@@ -2,10 +2,9 @@ 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
5+import TutorialD.Interpreter.Base hiding (try)
6import ProjectM36.Base
6import ProjectM36.Base
7import ProjectM36.Error
7import ProjectM36.Error
8−import Text.Megaparsec.Text
9import qualified Data.ByteString.Lazy as BS
8import qualified Data.ByteString.Lazy as BS
10import Control.Exception (try)
9import Control.Exception (try)
11import qualified Data.Text as T
10import qualified Data.Text as T
src/bin/TutorialD/Interpreter/Import/Base.hs+11−3
@@ -1,7 +1,12 @@
1+{-# LANGUAGE CPP #-}
1module TutorialD.Interpreter.Import.Base where
2module TutorialD.Interpreter.Import.Base where
2import ProjectM36.Base
3import ProjectM36.Base
3import ProjectM36.Error
4import ProjectM36.Error
5+import Text.URI (URI)
6+import Data.Text (Text)
7+#if __GLASGOW_HASKELL__ < 804
4import Data.Monoid
8import Data.Monoid
9+#endif
5
10
6-- | import data into a relation variable
11-- | import data into a relation variable
7data RelVarDataImportOperator = RelVarDataImportOperator RelVarName FilePath (RelVarName -> TypeConstructorMapping -> Attributes -> FilePath -> IO (Either RelationalError DatabaseContextExpr))
12data RelVarDataImportOperator = RelVarDataImportOperator RelVarName FilePath (RelVarName -> TypeConstructorMapping -> Attributes -> FilePath -> IO (Either RelationalError DatabaseContextExpr))
@@ -9,11 +14,14 @@ data RelVarDataImportOperator = RelVarDataImportOperator RelVarName FilePath (Re
9instance Show RelVarDataImportOperator where
14instance Show RelVarDataImportOperator where
10 show (RelVarDataImportOperator rv path _) = "RelVarDataImportOperator " <> show rv <> " " <> path
15 show (RelVarDataImportOperator rv path _) = "RelVarDataImportOperator " <> show rv <> " " <> path
11
16
17+type HashVerification = Maybe Text
18+
12-- | import data into a database context
19-- | import data into a database context
13−data DatabaseContextDataImportOperator = DatabaseContextDataImportOperator FilePath (FilePath -> IO (Either RelationalError DatabaseContextExpr))
20+data DatabaseContextDataImportOperator = DatabaseContextDataImportOperator URI HashVerification (URI -> HashVerification -> IO (Either RelationalError DatabaseContextExpr))
14
21
15instance Show DatabaseContextDataImportOperator where
22instance Show DatabaseContextDataImportOperator where
16− show (DatabaseContextDataImportOperator path _) = "DatabaseContextDataImportOperator " <> path
23+ show (DatabaseContextDataImportOperator uri hash _) =
24+ "DatabaseContextDataImportOperator " <> show uri <> " " <> show hash
17
25
18-- perhaps create a structure to import a whole transaction graph section in the future
26-- perhaps create a structure to import a whole transaction graph section in the future
19
27
@@ -21,4 +29,4 @@ evalRelVarDataImportOperator :: RelVarDataImportOperator -> TypeConstructorMappi
21evalRelVarDataImportOperator (RelVarDataImportOperator relVarName path importFunc) tConsMap attrs = importFunc relVarName tConsMap attrs path
29evalRelVarDataImportOperator (RelVarDataImportOperator relVarName path importFunc) tConsMap attrs = importFunc relVarName tConsMap attrs path
22
30
23evalDatabaseContextDataImportOperator :: DatabaseContextDataImportOperator -> IO (Either RelationalError DatabaseContextExpr)
31evalDatabaseContextDataImportOperator :: DatabaseContextDataImportOperator -> IO (Either RelationalError DatabaseContextExpr)
24−evalDatabaseContextDataImportOperator (DatabaseContextDataImportOperator path importFunc) = importFunc path
32+evalDatabaseContextDataImportOperator (DatabaseContextDataImportOperator uri hash importFunc) = importFunc uri hash
src/bin/TutorialD/Interpreter/Import/BasicExamples.hs+6−2
@@ -1,10 +1,14 @@
1+{-# LANGUAGE CPP #-}
1--includes some hardcoded examples which can be imported even during safe evaluation (no file I/O)
2--includes some hardcoded examples which can be imported even during safe evaluation (no file I/O)
2module TutorialD.Interpreter.Import.BasicExamples where
3module TutorialD.Interpreter.Import.BasicExamples where
3import ProjectM36.DateExamples
4import ProjectM36.DateExamples
4import ProjectM36.Base
5import ProjectM36.Base
5import ProjectM36.DatabaseContext
6import ProjectM36.DatabaseContext
6import TutorialD.Interpreter.Base
7import TutorialD.Interpreter.Base
8+
9+#if !MIN_VERSION_megaparsec(6,0,0)
7import Text.Megaparsec.Text
10import Text.Megaparsec.Text
11+#endif
8
12
9data ImportBasicExampleOperator = ImportBasicDateExampleOperator
13data ImportBasicExampleOperator = ImportBasicDateExampleOperator
10 deriving (Show)
14 deriving (Show)
@@ -16,8 +20,8 @@ importBasicExampleOperatorP :: Parser ImportBasicExampleOperator
16importBasicExampleOperatorP = do
20importBasicExampleOperatorP = do
17 reservedOp ":importexample"
21 reservedOp ":importexample"
18 example <- identifier
22 example <- identifier
19− if example == "date" then
23+ if example == "cjdate" then
20 pure ImportBasicDateExampleOperator
24 pure ImportBasicDateExampleOperator
21 else
25 else
22 fail "Unknown example name"
26 fail "Unknown example name"
23−
27+
src/bin/TutorialD/Interpreter/Import/CSV.hs+5−5
@@ -1,3 +1,4 @@
1+{-# LANGUAGE CPP #-}
1module TutorialD.Interpreter.Import.CSV where
2module TutorialD.Interpreter.Import.CSV where
2import TutorialD.Interpreter.Import.Base
3import TutorialD.Interpreter.Import.Base
3import ProjectM36.Base
4import ProjectM36.Base
@@ -5,8 +6,7 @@ import ProjectM36.Error
5import ProjectM36.Relation.Parse.CSV hiding (quotedString)
6import ProjectM36.Relation.Parse.CSV hiding (quotedString)
6import qualified Data.ByteString.Lazy as BS
7import qualified Data.ByteString.Lazy as BS
7import qualified Data.Text as T
8import qualified Data.Text as T
8−import Text.Megaparsec.Text
9−import TutorialD.Interpreter.Base
9+import TutorialD.Interpreter.Base hiding (try)
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 -> return $ Left (ImportError $ T.pack (show err))
17+ Left err -> pure $ Left (ImportError (ImportFileError (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 -> return $ Left (ParseError $ T.pack (show err))
19+ Left err -> pure $ Left (ParseError $ T.pack (show err))
20− Right csvRel -> return $ Right (Insert relVarName (ExistingRelation csvRel))
20+ Right csvRel -> pure $ Right (Insert relVarName (ExistingRelation csvRel))
21
21
22importCSVP :: Parser RelVarDataImportOperator
22importCSVP :: Parser RelVarDataImportOperator
23importCSVP = do
23importCSVP = do
src/bin/TutorialD/Interpreter/Import/TutorialD.hs+71−20
@@ -1,35 +1,86 @@
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
4+import TutorialD.Interpreter.Base hiding (try)
5import TutorialD.Interpreter.DatabaseContextExpr
5import TutorialD.Interpreter.DatabaseContextExpr
6−import Text.Megaparsec.Text
7−import Text.Megaparsec hiding (try)
8import ProjectM36.Error
6import ProjectM36.Error
9import qualified ProjectM36.Error as PM36E
7import qualified ProjectM36.Error as PM36E
10import qualified Data.Text as T
8import qualified Data.Text as T
11import Control.Exception
9import Control.Exception
12import qualified Data.ByteString as BS
10import qualified Data.ByteString as BS
13import qualified Data.Text.Encoding as TE
11import 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
14−--import a file containing TutorialD database context expressions
18+--import a file containing TutorialD database context expressions via local files or HTTP/HTTPS
15
19
16−importTutorialD :: FilePath -> IO (Either RelationalError DatabaseContextExpr)
20+importTutorialDFromFile :: URI -> HashVerification -> IO (Either RelationalError DatabaseContextExpr)
17−importTutorialD pathIn = do
21+importTutorialDFromFile fileURI mHash = do
22+ case URI.uriPath fileURI of
23+ Just (False, _) -> do
18− eTutdBytes <- try (BS.readFile pathIn) :: IO (Either IOError BS.ByteString)
24+ eTutdBytes <- try (BS.readFile filePath) :: IO (Either IOError BS.ByteString)
19− case eTutdBytes of
25+ case eTutdBytes of
20− Left err -> return $ Left (ImportError $ T.pack (show err))
26+ Left err -> pure $ Left (ImportError (ImportFileError (T.pack (show err))))
27+ Right tutdBytes ->
28+ case validateBytes tutdBytes mHash of
29+ Left err -> pure (Left err)
21− Right tutdBytes ->
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 =
22− case TE.decodeUtf8' tutdBytes of
38+ case TE.decodeUtf8' tutdBytes of
23− Left err -> pure (Left (ImportError $ T.pack (show err)))
39+ Left err -> pure (Left (ImportError (ImportFileDecodeError (T.pack (show err)))))
24− Right tutdUtf8 ->
40+ Right tutdUtf8 ->
25− case parse multipleDatabaseContextExprP "import" tutdUtf8 of
41+ case parse (multipleDatabaseContextExprP <* eof) "import" tutdUtf8 of
26− --parseErrorPretty is new in megaparsec 5
42+ --parseErrorPretty is new in megaparsec 5
27− Left err -> pure (Left (PM36E.ParseError (T.pack (show err))))
43+ Left err -> pure (Left (PM36E.ParseError (T.pack (errorBundlePretty err))))
28− Right expr -> pure (Right expr)
44+ Right expr -> pure (Right expr)
29−
45+
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+
30tutdImportP :: Parser DatabaseContextDataImportOperator
75tutdImportP :: Parser DatabaseContextDataImportOperator
31tutdImportP = do
76tutdImportP = do
32 reserved ":importtutd"
77 reserved ":importtutd"
33− path <- quotedString
78+ uri <- quoted URI.parser
34 spaceConsumer
79 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)
35− return $ DatabaseContextDataImportOperator (T.unpack path) importTutorialD
86+ pure $ DatabaseContextDataImportOperator uri mhash handler
src/bin/TutorialD/Interpreter/InformationOperator.hs−1
@@ -2,7 +2,6 @@
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
6import TutorialD.Interpreter.Base
5import TutorialD.Interpreter.Base
7-- older versions of stack fail to
6-- older versions of stack fail to
8#if !defined(VERSION_project_m36)
7#if !defined(VERSION_project_m36)
src/bin/TutorialD/Interpreter/RODatabaseContextOperator.hs+70−18
@@ -1,14 +1,16 @@
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
4import ProjectM36.Error
6import ProjectM36.Error
7+import ProjectM36.Tuple
5import ProjectM36.InclusionDependency
8import ProjectM36.InclusionDependency
6import qualified ProjectM36.Client as C
9import qualified ProjectM36.Client as C
7−import Text.Megaparsec
8−import Text.Megaparsec.Text
9import TutorialD.Interpreter.Base
10import TutorialD.Interpreter.Base
10import TutorialD.Interpreter.RelationalExpr
11import TutorialD.Interpreter.RelationalExpr
11import TutorialD.Interpreter.DatabaseContextExpr
12import TutorialD.Interpreter.DatabaseContextExpr
13+import TutorialD.Printer
12import Control.Monad.State
14import Control.Monad.State
13import qualified Data.Text as T
15import qualified Data.Text as T
14import ProjectM36.Relation.Show.Gnuplot
16import ProjectM36.Relation.Show.Gnuplot
@@ -20,55 +22,56 @@ data RODatabaseContextOperator where
20 ShowRelation :: RelationalExpr -> RODatabaseContextOperator
22 ShowRelation :: RelationalExpr -> RODatabaseContextOperator
21 PlotRelation :: RelationalExpr -> RODatabaseContextOperator
23 PlotRelation :: RelationalExpr -> RODatabaseContextOperator
22 ShowRelationType :: RelationalExpr -> RODatabaseContextOperator
24 ShowRelationType :: RelationalExpr -> RODatabaseContextOperator
23− ShowConstraint :: StringType -> RODatabaseContextOperator
25+ ShowConstraints :: StringType -> RODatabaseContextOperator
24 ShowPlan :: DatabaseContextExpr -> RODatabaseContextOperator
26 ShowPlan :: DatabaseContextExpr -> RODatabaseContextOperator
25 ShowTypes :: RODatabaseContextOperator
27 ShowTypes :: RODatabaseContextOperator
26 ShowRelationVariables :: RODatabaseContextOperator
28 ShowRelationVariables :: RODatabaseContextOperator
27 ShowAtomFunctions :: RODatabaseContextOperator
29 ShowAtomFunctions :: RODatabaseContextOperator
28 ShowDatabaseContextFunctions :: RODatabaseContextOperator
30 ShowDatabaseContextFunctions :: RODatabaseContextOperator
31+ ShowDataFrame :: DF.DataFrameExpr -> RODatabaseContextOperator
29 Quit :: RODatabaseContextOperator
32 Quit :: RODatabaseContextOperator
30 deriving (Show)
33 deriving (Show)
31
34
32typeP :: Parser RODatabaseContextOperator
35typeP :: Parser RODatabaseContextOperator
33typeP = do
36typeP = do
34− reservedOp ":type"
37+ colonOp ":type"
35 ShowRelationType <$> relExprP
38 ShowRelationType <$> relExprP
36
39
37showRelP :: Parser RODatabaseContextOperator
40showRelP :: Parser RODatabaseContextOperator
38showRelP = do
41showRelP = do
39− reservedOp ":showexpr"
42+ colonOp ":showexpr"
40 ShowRelation <$> relExprP
43 ShowRelation <$> relExprP
41
44
42showPlanP :: Parser RODatabaseContextOperator
45showPlanP :: Parser RODatabaseContextOperator
43showPlanP = do
46showPlanP = do
44− reservedOp ":showplan"
47+ colonOp ":showplan"
45 ShowPlan <$> databaseContextExprP
48 ShowPlan <$> databaseContextExprP
46
49
47showTypesP :: Parser RODatabaseContextOperator
50showTypesP :: Parser RODatabaseContextOperator
48−showTypesP = reserved ":showtypes" >> pure ShowTypes
51+showTypesP = colonOp ":showtypes" >> pure ShowTypes
49
52
50showRelationVariables :: Parser RODatabaseContextOperator
53showRelationVariables :: Parser RODatabaseContextOperator
51−showRelationVariables = reserved ":showrelvars" >> pure ShowRelationVariables
54+showRelationVariables = colonOp ":showrelvars" >> pure ShowRelationVariables
52
55
53showAtomFunctionsP :: Parser RODatabaseContextOperator
56showAtomFunctionsP :: Parser RODatabaseContextOperator
54−showAtomFunctionsP = reserved ":showatomfunctions" >> pure ShowAtomFunctions
57+showAtomFunctionsP = colonOp ":showatomfunctions" >> pure ShowAtomFunctions
55
58
56showDatabaseContextFunctionsP :: Parser RODatabaseContextOperator
59showDatabaseContextFunctionsP :: Parser RODatabaseContextOperator
57−showDatabaseContextFunctionsP = reserved ":showdatabasecontextfunctions" >> pure ShowDatabaseContextFunctions
60+showDatabaseContextFunctionsP = colonOp ":showdatabasecontextfunctions" >> pure ShowDatabaseContextFunctions
58
61
59quitP :: Parser RODatabaseContextOperator
62quitP :: Parser RODatabaseContextOperator
60quitP = do
63quitP = do
61− reservedOp ":quit"
64+ colonOp ":quit"
62 return Quit
65 return Quit
63
66
64showConstraintsP :: Parser RODatabaseContextOperator
67showConstraintsP :: Parser RODatabaseContextOperator
65showConstraintsP = do
68showConstraintsP = do
66− reservedOp ":constraints"
69+ colonOp ":constraints"
67− ShowConstraint <$> option "" identifier
70+ ShowConstraints <$> option "" identifier
68
71
69plotRelExprP :: Parser RODatabaseContextOperator
72plotRelExprP :: Parser RODatabaseContextOperator
70plotRelExprP = do
73plotRelExprP = do
71− reserved ":plotexpr"
74+ colonOp ":plotexpr"
72 PlotRelation <$> relExprP
75 PlotRelation <$> relExprP
73
76
74roDatabaseContextOperatorP :: Parser RODatabaseContextOperator
77roDatabaseContextOperatorP :: Parser RODatabaseContextOperator
@@ -81,6 +84,7 @@ roDatabaseContextOperatorP = typeP
81 <|> showTypesP
84 <|> showTypesP
82 <|> showAtomFunctionsP
85 <|> showAtomFunctionsP
83 <|> showDatabaseContextFunctionsP
86 <|> showDatabaseContextFunctionsP
87+ <|> showDataFrameP
84 <|> quitP
88 <|> quitP
85
89
86--logically, these read-only operations could happen purely, but not if a remote call is required
90--logically, these read-only operations could happen purely, but not if a remote call is required
@@ -105,15 +109,16 @@ evalRODatabaseContextOp sessionId conn (PlotRelation expr) = do
105 err <- plotRelation rel
109 err <- plotRelation rel
106 when (isJust err) $ print err
110 when (isJust err) $ print err
107
111
108−evalRODatabaseContextOp sessionId conn (ShowConstraint name) = do
112+evalRODatabaseContextOp sessionId conn (ShowConstraints name) = do
109 eIncDeps <- C.inclusionDependencies sessionId conn
113 eIncDeps <- C.inclusionDependencies sessionId conn
110 let val = case eIncDeps of
114 let val = case eIncDeps of
111 Left err -> Left err
115 Left err -> Left err
112 Right incDeps -> case name of
116 Right incDeps -> case name of
113− "" -> inclusionDependenciesAsRelation incDeps
117+ "" -> inclusionDependenciesAsRelation incDeps >>= renderRelExprsInIncDeps
114 depName -> case M.lookup depName incDeps of
118 depName -> case M.lookup depName incDeps of
115 Nothing -> Left (InclusionDependencyNameNotInUseError depName)
119 Nothing -> Left (InclusionDependencyNameNotInUseError depName)
120+ Just dep ->
116− Just dep -> inclusionDependenciesAsRelation (M.singleton depName dep)
121+ inclusionDependenciesAsRelation (M.singleton depName dep) >>= renderRelExprsInIncDeps
117 pure $ case val of
122 pure $ case val of
118 Left err -> DisplayErrorResult (T.pack (show err))
123 Left err -> DisplayErrorResult (T.pack (show err))
119 Right rel -> DisplayRelationResult rel
124 Right rel -> DisplayRelationResult rel
@@ -148,6 +153,12 @@ evalRODatabaseContextOp sessionId conn ShowDatabaseContextFunctions = do
148 Left err -> pure $ DisplayErrorResult (T.pack (show err))
153 Left err -> pure $ DisplayErrorResult (T.pack (show err))
149 Right rel -> evalRODatabaseContextOp sessionId conn (ShowRelation (ExistingRelation rel))
154 Right rel -> evalRODatabaseContextOp sessionId conn (ShowRelation (ExistingRelation rel))
150
155
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+
151evalRODatabaseContextOp _ _ Quit = pure QuitResult
162evalRODatabaseContextOp _ _ Quit = pure QuitResult
152
163
153interpretRODatabaseContextOp :: C.SessionId -> C.Connection -> T.Text -> IO TutorialDOperatorResult
164interpretRODatabaseContextOp :: C.SessionId -> C.Connection -> T.Text -> IO TutorialDOperatorResult
@@ -155,4 +166,45 @@ interpretRODatabaseContextOp sessionId conn tutdstring = case parse roDatabaseCo
155 Left err -> pure $ DisplayErrorResult (T.pack (show err))
166 Left err -> pure $ DisplayErrorResult (T.pack (show err))
156 Right parsed -> evalRODatabaseContextOp sessionId conn parsed
167 Right parsed -> evalRODatabaseContextOp sessionId conn parsed
157
168
158−
169+showDataFrameP :: Parser RODatabaseContextOperator
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+90−57
@@ -1,8 +1,12 @@
1+{-# LANGUAGE CPP #-}
1module TutorialD.Interpreter.RelationalExpr where
2module TutorialD.Interpreter.RelationalExpr where
2import Text.Megaparsec
3import Text.Megaparsec
4+#if MIN_VERSION_megaparsec(7,0,0)
5+import Control.Monad.Combinators.Expr
6+#else
3import Text.Megaparsec.Expr
7import Text.Megaparsec.Expr
8+#endif
4import ProjectM36.Base
9import ProjectM36.Base
5−import Text.Megaparsec.Text
6import TutorialD.Interpreter.Base
10import TutorialD.Interpreter.Base
7import TutorialD.Interpreter.Types
11import TutorialD.Interpreter.Types
8import qualified Data.Text as T
12import qualified Data.Text as T
@@ -11,40 +15,38 @@ import qualified Data.Map as M
11import Data.List (sort)
15import Data.List (sort)
12import ProjectM36.MiscUtils
16import ProjectM36.MiscUtils
13
17
14−class RelationalMarkerExpr a where
15− parseMarkerP :: Parser a
16−
17−instance RelationalMarkerExpr () where
18− parseMarkerP = pure ()
19−
20--used in projection
18--used in projection
21attributeListP :: RelationalMarkerExpr a => Parser (AttributeNamesBase a)
19attributeListP :: RelationalMarkerExpr a => Parser (AttributeNamesBase a)
22−attributeListP =
20+attributeListP =
23 (reservedOp "all but" >>
21 (reservedOp "all but" >>
24− InvertedAttributeNames . S.fromList <$> sepBy identifier comma) <|>
22+ InvertedAttributeNames . S.fromList <$> sepBy attributeNameP comma) <|>
23+
25 (reservedOp "all from" >>
24 (reservedOp "all from" >>
26 RelationalExprAttributeNames <$> relExprP) <|>
25 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+
27− (AttributeNames . S.fromList <$> sepBy identifier comma)
33+ (AttributeNames . S.fromList <$> sepBy attributeNameP comma)
34+
28
35
29makeRelationP :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
36makeRelationP :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
30makeRelationP = do
37makeRelationP = do
31 reserved "relation"
38 reserved "relation"
32 attrExprs <- try (fmap Just makeAttributeExprsP) <|> pure Nothing
39 attrExprs <- try (fmap Just makeAttributeExprsP) <|> pure Nothing
33 tupleExprs <- braces (sepBy tupleExprP comma) <|> pure []
40 tupleExprs <- braces (sepBy tupleExprP comma) <|> pure []
41+ marker <- parseMarkerP
34− pure $ MakeRelationFromExprs attrExprs tupleExprs
42+ pure $ MakeRelationFromExprs attrExprs (TupleExprs marker tupleExprs)
35
43
36−--used in relation creation
37−makeAttributeExprsP :: RelationalMarkerExpr a => Parser [AttributeExprBase a]
38−makeAttributeExprsP = braces (sepBy attributeAndTypeNameP comma)
39
44
40−attributeAndTypeNameP :: RelationalMarkerExpr a => Parser (AttributeExprBase a)
41−attributeAndTypeNameP = AttributeAndTypeNameExpr <$> identifier <*> typeConstructorP <*> parseMarkerP
42−
43--abstract data type parser- in this context, the type constructor must not include any type arguments
45--abstract data type parser- in this context, the type constructor must not include any type arguments
44--Either Text Int
46--Either Text Int
45adTypeConstructorP :: Parser TypeConstructor
47adTypeConstructorP :: Parser TypeConstructor
46adTypeConstructorP = do
48adTypeConstructorP = do
47− tConsName <- capitalizedIdentifier
49+ tConsName <- typeConstructorNameP
48 tConsArgs <- many typeConstructorP
50 tConsArgs <- many typeConstructorP
49 pure $ ADTypeConstructor tConsName tConsArgs
51 pure $ ADTypeConstructor tConsName tConsArgs
50
52
@@ -54,25 +56,25 @@ tupleExprP = do
54 attrAssocs <- braces (sepBy tupleAtomExprP comma)
56 attrAssocs <- braces (sepBy tupleAtomExprP comma)
55 --detect duplicate attribute names
57 --detect duplicate attribute names
56 let dupAttrNames = dupes (sort (map fst attrAssocs))
58 let dupAttrNames = dupes (sort (map fst attrAssocs))
57− if not (null dupAttrNames) then
59+ if not (null dupAttrNames) then
58 fail ("Attribute names duplicated: " ++ show dupAttrNames)
60 fail ("Attribute names duplicated: " ++ show dupAttrNames)
59 else
61 else
60 pure (TupleExpr (M.fromList attrAssocs))
62 pure (TupleExpr (M.fromList attrAssocs))
61
63
62tupleAtomExprP :: RelationalMarkerExpr a => Parser (AttributeName, AtomExprBase a)
64tupleAtomExprP :: RelationalMarkerExpr a => Parser (AttributeName, AtomExprBase a)
63tupleAtomExprP = do
65tupleAtomExprP = do
64− attributeName <- identifier
66+ attributeName <- attributeNameP
65 atomExpr <- atomExprP
67 atomExpr <- atomExprP
66 pure (attributeName, atomExpr)
68 pure (attributeName, atomExpr)
67−
69+
68projectP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
70projectP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
69projectP = Project <$> braces attributeListP
71projectP = Project <$> braces attributeListP
70
72
71renameClauseP :: Parser (T.Text, T.Text)
73renameClauseP :: Parser (T.Text, T.Text)
72renameClauseP = do
74renameClauseP = do
73− oldAttr <- identifier
75+ oldAttr <- attributeNameP
74 reservedOp "as"
76 reservedOp "as"
75− newAttr <- identifier
77+ newAttr <- attributeNameP
76 pure (oldAttr, newAttr)
78 pure (oldAttr, newAttr)
77
79
78renameP :: Parser (RelationalExprBase a -> RelationalExprBase a)
80renameP :: Parser (RelationalExprBase a -> RelationalExprBase a)
@@ -81,7 +83,7 @@ renameP = do
81 renameList <- braces (sepBy renameClauseP comma)
83 renameList <- braces (sepBy renameClauseP comma)
82 case renameList of
84 case renameList of
83 [] -> pure (Restrict TruePredicate) --no-op when rename list is empty
85 [] -> pure (Restrict TruePredicate) --no-op when rename list is empty
84− renames ->
86+ renames ->
85 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
86
88
87whereClauseP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
89whereClauseP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
@@ -91,7 +93,7 @@ groupClauseP :: RelationalMarkerExpr a => Parser (AttributeNamesBase a, T.Text)
91groupClauseP = do
93groupClauseP = do
92 attrs <- braces attributeListP
94 attrs <- braces attributeListP
93 reservedOp "as"
95 reservedOp "as"
94− newAttrName <- identifier
96+ newAttrName <- attributeNameP
95 pure (attrs, newAttrName)
97 pure (attrs, newAttrName)
96
98
97groupP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
99groupP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
@@ -104,27 +106,30 @@ groupP = do
104ungroupP :: Parser (RelationalExprBase a -> RelationalExprBase a)
106ungroupP :: Parser (RelationalExprBase a -> RelationalExprBase a)
105ungroupP = do
107ungroupP = do
106 reservedOp "ungroup"
108 reservedOp "ungroup"
107− rvaAttrName <- identifier
109+ Ungroup <$> attributeNameP
108− pure $ Ungroup rvaAttrName
109
110
110extendP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
111extendP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a)
111extendP = do
112extendP = do
112 reservedOp ":"
113 reservedOp ":"
113− Extend <$> braces extendTupleExpressionP
114+ extends <- braces (sepBy extendTupleExpressionP comma)
114−
115+ case extends of
116+ [] -> pure (Restrict TruePredicate)
117+ extends' ->
118+ pure $ \expr -> foldl (flip Extend) expr extends'
119+
115semijoinP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a -> RelationalExprBase a)
120semijoinP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a -> RelationalExprBase a)
116semijoinP = do
121semijoinP = do
117 reservedOp "semijoin" <|> reservedOp "matching"
122 reservedOp "semijoin" <|> reservedOp "matching"
118− pure (\exprA exprB ->
123+ pure (\exprA exprB ->
119 Project (RelationalExprAttributeNames exprA) (Join exprA exprB))
124 Project (RelationalExprAttributeNames exprA) (Join exprA exprB))
120−
125+
121−antijoinP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a -> RelationalExprBase a)
126+antijoinP :: RelationalMarkerExpr a => Parser (RelationalExprBase a -> RelationalExprBase a -> RelationalExprBase a)
122antijoinP = do
127antijoinP = do
123 reservedOp "not matching" <|> reservedOp "antijoin"
128 reservedOp "not matching" <|> reservedOp "antijoin"
124 pure (\exprA exprB ->
129 pure (\exprA exprB ->
125 Difference exprA (
130 Difference exprA (
126 Project (RelationalExprAttributeNames exprA) (Join exprA exprB)))
131 Project (RelationalExprAttributeNames exprA) (Join exprA exprB)))
127−
132+
128relOperators :: RelationalMarkerExpr a => [[Operator Parser (RelationalExprBase a)]]
133relOperators :: RelationalMarkerExpr a => [[Operator Parser (RelationalExprBase a)]]
129relOperators = [
134relOperators = [
130 [Postfix projectP],
135 [Postfix projectP],
@@ -137,15 +142,23 @@ relOperators = [
137 [InfixL antijoinP],
142 [InfixL antijoinP],
138 [InfixL (reservedOp "union" >> return Union)],
143 [InfixL (reservedOp "union" >> return Union)],
139 [InfixL (reservedOp "minus" >> return Difference)],
144 [InfixL (reservedOp "minus" >> return Difference)],
140− [InfixN (reservedOp "=" >> return Equals)],
145+ [InfixN (reservedOp "=" >> return Equals),
146+ InfixN (reservedOp "/=" >> return NotEquals)],
141 [Postfix extendP]
147 [Postfix extendP]
142 ]
148 ]
143
149
144relExprP :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
150relExprP :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
145−relExprP = makeExprParser relTerm relOperators
151+relExprP = try withMacroExprP <|> makeExprParser relTerm relOperators
152+
153+--allow for additional characters
154+attributeNameP :: Parser AttributeName
155+attributeNameP = uncapitalizedIdentifier
156+
157+relVarNameP :: Parser RelVarName
158+relVarNameP = uncapitalizedIdentifier
146
159
147relVarP :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
160relVarP :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
148−relVarP = RelationVariable <$> identifier <*> parseMarkerP
161+relVarP = RelationVariable <$> relVarNameP <*> parseMarkerP
149
162
150relTerm :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
163relTerm :: RelationalMarkerExpr a => Parser (RelationalExprBase a)
151relTerm = parens relExprP
164relTerm = parens relExprP
@@ -166,13 +179,13 @@ restrictionPredicateP = makeExprParser predicateTerm predicateOperators
166 <|> relationalBooleanExprP
179 <|> relationalBooleanExprP
167
180
168relationalBooleanExprP :: RelationalMarkerExpr a => Parser (RestrictionPredicateExprBase a)
181relationalBooleanExprP :: RelationalMarkerExpr a => Parser (RestrictionPredicateExprBase a)
169−relationalBooleanExprP =
182+relationalBooleanExprP =
170 --we can't actually detect if the type is relational boolean, so we just pass it to the next phase
183 --we can't actually detect if the type is relational boolean, so we just pass it to the next phase
171 RelationalExprPredicate <$> (parens relExprP <|> relTerm)
184 RelationalExprPredicate <$> (parens relExprP <|> relTerm)
172−
185+
173restrictionAttributeEqualityP :: RelationalMarkerExpr a => Parser (RestrictionPredicateExprBase a)
186restrictionAttributeEqualityP :: RelationalMarkerExpr a => Parser (RestrictionPredicateExprBase a)
174restrictionAttributeEqualityP = do
187restrictionAttributeEqualityP = do
175− attributeName <- identifier
188+ attributeName <- attributeNameP
176 reservedOp "="
189 reservedOp "="
177 AttributeEqualityPredicate attributeName <$> atomExprP
190 AttributeEqualityPredicate attributeName <$> atomExprP
178
191
@@ -189,7 +202,7 @@ extendTupleExpressionP = attributeExtendTupleExpressionP
189
202
190attributeExtendTupleExpressionP :: RelationalMarkerExpr a => Parser (ExtendTupleExprBase a)
203attributeExtendTupleExpressionP :: RelationalMarkerExpr a => Parser (ExtendTupleExprBase a)
191attributeExtendTupleExpressionP = do
204attributeExtendTupleExpressionP = do
192− newAttr <- identifier
205+ newAttr <- attributeNameP
193 reservedOp ":="
206 reservedOp ":="
194 AttributeExtendTupleExpr newAttr <$> atomExprP
207 AttributeExtendTupleExpr newAttr <$> atomExprP
195
208
@@ -201,34 +214,34 @@ consumeAtomExprP consume = try functionAtomExprP <|>
201 try (parens (constructedAtomExprP True)) <|>
214 try (parens (constructedAtomExprP True)) <|>
202 constructedAtomExprP consume <|>
215 constructedAtomExprP consume <|>
203 attributeAtomExprP <|>
216 attributeAtomExprP <|>
204− nakedAtomExprP <|>
217+ try nakedAtomExprP <|>
205 relationalAtomExprP
218 relationalAtomExprP
219+
206
220
207attributeAtomExprP :: Parser (AtomExprBase a)
221attributeAtomExprP :: Parser (AtomExprBase a)
208attributeAtomExprP = do
222attributeAtomExprP = do
209 _ <- string "@"
223 _ <- string "@"
210− AttributeAtomExpr <$> identifier
224+ AttributeAtomExpr <$> attributeNameP
211
225
212nakedAtomExprP :: Parser (AtomExprBase a)
226nakedAtomExprP :: Parser (AtomExprBase a)
213nakedAtomExprP = NakedAtomExpr <$> atomP
227nakedAtomExprP = NakedAtomExpr <$> atomP
214
228
215constructedAtomExprP :: RelationalMarkerExpr a => Bool -> Parser (AtomExprBase a)
229constructedAtomExprP :: RelationalMarkerExpr a => Bool -> Parser (AtomExprBase a)
216constructedAtomExprP consume = do
230constructedAtomExprP consume = do
217− dConsName <- capitalizedIdentifier
231+ dConsName <- dataConstructorNameP
218 dConsArgs <- if consume then sepBy (consumeAtomExprP False) spaceConsumer else pure []
232 dConsArgs <- if consume then sepBy (consumeAtomExprP False) spaceConsumer else pure []
219− marker <- parseMarkerP
220− pure $ ConstructedAtomExpr dConsName dConsArgs marker
233+ ConstructedAtomExpr dConsName dConsArgs <$> parseMarkerP
221−
234+
222-- used only for primitive type parsing ?
235-- used only for primitive type parsing ?
223atomP :: Parser Atom
236atomP :: Parser Atom
224−atomP = stringAtomP <|>
237+atomP = stringAtomP <|>
225− doubleAtomP <|>
238+ try doubleAtomP <|>
226− integerAtomP <|>
239+ integerAtomP <|>
227 boolAtomP
240 boolAtomP
228−
241+
229functionAtomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
242functionAtomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
230−functionAtomExprP =
243+functionAtomExprP =
231− FunctionAtomExpr <$> identifier <*> parens (sepBy atomExprP comma) <*> parseMarkerP
244+ FunctionAtomExpr <$> uncapitalizedIdentifier <*> parens (sepBy atomExprP comma) <*> parseMarkerP
232
245
233relationalAtomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
246relationalAtomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
234relationalAtomExprP = RelationAtomExpr <$> relExprP
247relationalAtomExprP = RelationAtomExpr <$> relExprP
@@ -236,16 +249,36 @@ relationalAtomExprP = RelationAtomExpr <$> relExprP
236stringAtomP :: Parser Atom
249stringAtomP :: Parser Atom
237stringAtomP = TextAtom <$> quotedString
250stringAtomP = TextAtom <$> quotedString
238
251
239−doubleAtomP :: Parser Atom
252+doubleAtomP :: Parser Atom
240−doubleAtomP = DoubleAtom <$> try float
253+doubleAtomP = DoubleAtom <$> float
241
254
242integerAtomP :: Parser Atom
255integerAtomP :: Parser Atom
243integerAtomP = IntegerAtom <$> integer
256integerAtomP = IntegerAtom <$> integer
244
257
245boolAtomP :: Parser Atom
258boolAtomP :: Parser Atom
246boolAtomP = do
259boolAtomP = do
247− val <- char 't' <|> char 'f'
260+ v <- identifier
261+ if v == "t" || v == "f" then
248− return $ BoolAtom (val == 't')
262+ pure $ BoolAtom (v == "t")
249−
263+ else
264+ fail "invalid boolAtom"
265+
266+
250relationAtomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
267relationAtomExprP :: RelationalMarkerExpr a => Parser (AtomExprBase a)
251relationAtomExprP = RelationAtomExpr <$> makeRelationP
268relationAtomExprP = 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+3−5
@@ -1,7 +1,5 @@
1module TutorialD.Interpreter.SchemaOperator where
1module TutorialD.Interpreter.SchemaOperator where
2import Text.Megaparsec
2import Text.Megaparsec
3−import Text.Megaparsec.Text
4−
5import ProjectM36.Base
3import ProjectM36.Base
6import ProjectM36.IsomorphicSchema
4import ProjectM36.IsomorphicSchema
7import ProjectM36.Session
5import ProjectM36.Session
@@ -44,7 +42,7 @@ isoRestrictP = do
44 reserved "isorestrict"
42 reserved "isorestrict"
45 relVarIn <- qrelVarP
43 relVarIn <- qrelVarP
46 relvarsOut <- isoRestrictOutRelVarsP
44 relvarsOut <- isoRestrictOutRelVarsP
47− IsoRestrict <$> pure relVarIn <*> restrictionPredicateP <*> pure relvarsOut
45+ IsoRestrict relVarIn <$> restrictionPredicateP <*> pure relvarsOut
48
46
49isoRestrictOutRelVarsP :: Parser (RelVarName, RelVarName)
47isoRestrictOutRelVarsP :: Parser (RelVarName, RelVarName)
50isoRestrictOutRelVarsP = (,) <$> qrelVarP <*> qrelVarP
48isoRestrictOutRelVarsP = (,) <$> qrelVarP <*> qrelVarP
@@ -57,7 +55,7 @@ isoUnionP = do
57 reserved "isounion"
55 reserved "isounion"
58 relVarsIn <- isoUnionInRelVarsP
56 relVarsIn <- isoUnionInRelVarsP
59 relVarsOut <- qrelVarP
57 relVarsOut <- qrelVarP
60− IsoUnion <$> pure relVarsIn <*> restrictionPredicateP <*> pure relVarsOut
58+ IsoUnion relVarsIn <$> restrictionPredicateP <*> pure relVarsOut
61
59
62isoRenameP :: Parser SchemaIsomorph
60isoRenameP :: Parser SchemaIsomorph
63isoRenameP = do
61isoRenameP = do
@@ -76,4 +74,4 @@ isoUnionInRelVarsP = (,) <$> qrelVarP <*> qrelVarP
76evalSchemaOperator :: SessionId -> Connection -> SchemaOperator -> IO (Either RelationalError ())
74evalSchemaOperator :: SessionId -> Connection -> SchemaOperator -> IO (Either RelationalError ())
77evalSchemaOperator sessionId conn (ModifySchemaExpr expr) = executeSchemaExpr sessionId conn expr
75evalSchemaOperator sessionId conn (ModifySchemaExpr expr) = executeSchemaExpr sessionId conn expr
78evalSchemaOperator sessionId conn (SetCurrentSchema sname) = setCurrentSchemaName sessionId conn sname
76evalSchemaOperator sessionId conn (SetCurrentSchema sname) = setCurrentSchemaName sessionId conn sname
79−
77+
src/bin/TutorialD/Interpreter/TransGraphRelationalOperator.hs+4−6
@@ -1,21 +1,19 @@
1−{-# LANGUAGE TypeSynonymInstances, FlexibleInstances #-}
1+{-# LANGUAGE 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
6import qualified ProjectM36.Client as C
7import qualified ProjectM36.Client as C
7
8
8import TutorialD.Interpreter.Base
9import TutorialD.Interpreter.Base
9import TutorialD.Interpreter.RelationalExpr
10import TutorialD.Interpreter.RelationalExpr
10
11
11−import Text.Megaparsec
12−import Text.Megaparsec.Text
13−
14import qualified Data.Text as T
12import qualified Data.Text as T
15
13
16instance RelationalMarkerExpr TransactionIdLookup where
14instance RelationalMarkerExpr TransactionIdLookup where
17 parseMarkerP = string "@" *> transactionIdLookupP
15 parseMarkerP = string "@" *> transactionIdLookupP
18−
16+
19newtype TransGraphRelationalOperator = ShowTransGraphRelation TransGraphRelationalExpr
17newtype TransGraphRelationalOperator = ShowTransGraphRelation TransGraphRelationalExpr
20 deriving Show
18 deriving Show
21
19
@@ -45,4 +43,4 @@ evalTransGraphRelationalOp sessionId conn (ShowTransGraphRelation expr) = do
45 case res of
43 case res of
46 Left err -> pure $ DisplayErrorResult $ T.pack (show err)
44 Left err -> pure $ DisplayErrorResult $ T.pack (show err)
47 Right rel -> pure $ DisplayRelationResult rel
45 Right rel -> pure $ DisplayRelationResult rel
48−
46+
src/bin/TutorialD/Interpreter/TransactionGraphOperator.hs+15−13
@@ -1,11 +1,10 @@
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
6import ProjectM36.TransactionGraph hiding (autoMergeToHead)
4import ProjectM36.TransactionGraph hiding (autoMergeToHead)
7−import ProjectM36.Client
5+import ProjectM36.Client as C
8import ProjectM36.Base
6import ProjectM36.Base
7+import ProjectM36.Relation (relationTrue)
9import Data.Functor
8import Data.Functor
10
9
11data ConvenienceTransactionGraphOperator = AutoMergeToHead MergeStrategy HeadName
10data ConvenienceTransactionGraphOperator = AutoMergeToHead MergeStrategy HeadName
@@ -63,20 +62,18 @@ mergeTransactionStrategyP :: Parser MergeStrategy
63mergeTransactionStrategyP = (reserved "union" $> UnionMergeStrategy) <|>
62mergeTransactionStrategyP = (reserved "union" $> UnionMergeStrategy) <|>
64 (do
63 (do
65 reserved "selectedbranch"
64 reserved "selectedbranch"
66− branch <- identifier
67− pure (SelectedBranchMergeStrategy branch)) <|>
65+ SelectedBranchMergeStrategy <$> identifier) <|>
68 (do
66 (do
69 reserved "unionpreferbranch"
67 reserved "unionpreferbranch"
70− branch <- identifier
71− pure (UnionPreferMergeStrategy branch))
68+ UnionPreferMergeStrategy <$> identifier)
72
69
73mergeTransactionsP :: Parser TransactionGraphOperator
70mergeTransactionsP :: Parser TransactionGraphOperator
74mergeTransactionsP = do
71mergeTransactionsP = do
75 reservedOp ":mergetrans"
72 reservedOp ":mergetrans"
76− strategy <- mergeTransactionStrategyP
73+ MergeTransactions <$> mergeTransactionStrategyP <*> identifier <*> identifier
77− headA <- identifier
74+
78− headB <- identifier
75+validateMerkleHashesP :: Parser ROTransactionGraphOperator
79− pure (MergeTransactions strategy headA headB)
76+validateMerkleHashesP = reservedOp ":validatemerklehashes" $> ValidateMerkleHashes
80
77
81transactionGraphOpP :: Parser TransactionGraphOperator
78transactionGraphOpP :: Parser TransactionGraphOperator
82transactionGraphOpP =
79transactionGraphOpP =
@@ -90,7 +87,7 @@ transactionGraphOpP =
90 <|> mergeTransactionsP
87 <|> mergeTransactionsP
91
88
92roTransactionGraphOpP :: Parser ROTransactionGraphOperator
89roTransactionGraphOpP :: Parser ROTransactionGraphOperator
93−roTransactionGraphOpP = showGraphP
90+roTransactionGraphOpP = showGraphP <|> validateMerkleHashesP
94
91
95
92
96
93
@@ -108,6 +105,11 @@ interpretOps newUUID trans@(DisconnectedTransaction _ context) transGraph instri
108
105
109evalROGraphOp :: SessionId -> Connection -> ROTransactionGraphOperator -> IO (Either RelationalError Relation)
106evalROGraphOp :: SessionId -> Connection -> ROTransactionGraphOperator -> IO (Either RelationalError Relation)
110evalROGraphOp sessionId conn ShowGraph = transactionGraphAsRelation sessionId conn
107evalROGraphOp 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)
111
113
112evalConvenienceGraphOp :: SessionId -> Connection -> ConvenienceTransactionGraphOperator -> IO (Either RelationalError ())
114evalConvenienceGraphOp :: SessionId -> Connection -> ConvenienceTransactionGraphOperator -> IO (Either RelationalError ())
113−evalConvenienceGraphOp sessionId conn (AutoMergeToHead strat head') = autoMergeToHead sessionId conn strat head'
115+evalConvenienceGraphOp sessionId conn (AutoMergeToHead strat head') = autoMergeToHead sessionId conn strat head'
src/bin/TutorialD/Interpreter/Types.hs+32−21
@@ -1,49 +1,60 @@
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
5import Text.Megaparsec
4import Text.Megaparsec
6import TutorialD.Interpreter.Base
5import TutorialD.Interpreter.Base
7−import ProjectM36.DataTypes.Primitive
6+
8−import qualified Data.Text as T
7+class RelationalMarkerExpr a where
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
9
18
10-- | Upper case names are type names while lower case names are polymorphic typeconstructor arguments.
19-- | Upper case names are type names while lower case names are polymorphic typeconstructor arguments.
11-- data *Either a b* = Left a | Right b
20-- data *Either a b* = Left a | Right b
12typeConstructorDefP :: Parser TypeConstructorDef
21typeConstructorDefP :: Parser TypeConstructorDef
13−typeConstructorDefP = ADTypeConstructorDef <$> capitalizedIdentifier <*> typeVarNamesP
22+typeConstructorDefP = ADTypeConstructorDef <$> typeConstructorNameP <*> typeVarNamesP
14
23
15typeVarNamesP :: Parser [TypeVarName]
24typeVarNamesP :: Parser [TypeVarName]
16typeVarNamesP = many uncapitalizedIdentifier
25typeVarNamesP = many uncapitalizedIdentifier
17
26
18-- data Either a b = *Left a* | *Right b*
27-- data Either a b = *Left a* | *Right b*
19dataConstructorDefP :: Parser DataConstructorDef
28dataConstructorDefP :: Parser DataConstructorDef
20−dataConstructorDefP = DataConstructorDef <$> capitalizedIdentifier <*> many dataConstructorDefArgP
29+dataConstructorDefP = DataConstructorDef <$> typeConstructorNameP <*> many dataConstructorDefArgP
21
30
22-- data *Either a b* = Left *a* | Right *b*
31-- data *Either a b* = Left *a* | Right *b*
23dataConstructorDefArgP :: Parser DataConstructorDefArg
32dataConstructorDefArgP :: Parser DataConstructorDefArg
24−dataConstructorDefArgP = parens (DataConstructorDefTypeConstructorArg <$> typeConstructorP) <|>
33+dataConstructorDefArgP = DataConstructorDefTypeConstructorArg <$> (monoTypeConstructorP <|> parens typeConstructorP) <|>
25− DataConstructorDefTypeConstructorArg <$> typeConstructorP <|>
26 DataConstructorDefTypeVarNameArg <$> uncapitalizedIdentifier
34 DataConstructorDefTypeVarNameArg <$> uncapitalizedIdentifier
27
35
28−--built-in, nullary type constructors
36+-- relation{a Int} in type construction (no tuples parsed)
29−-- Int, Text, etc.
30−primitiveTypeConstructorP :: Parser TypeConstructor
37+relationTypeConstructorP :: Parser TypeConstructor
31−primitiveTypeConstructorP = choice (map (\(PrimitiveTypeConstructorDef name typ, _) -> do
38+relationTypeConstructorP = do
32− tName <- try $ symbol (T.unpack name)
39+ reserved "relation"
33− pure $ PrimitiveTypeConstructor tName typ)
40+ RelationAtomTypeConstructor <$> makeAttributeExprsP
34− primitiveTypeConstructorMapping)
41+
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
35
48
36-- *Either Int Text*, *Int*
49-- *Either Int Text*, *Int*
37typeConstructorP :: Parser TypeConstructor
50typeConstructorP :: Parser TypeConstructor
38−typeConstructorP = primitiveTypeConstructorP <|>
51+typeConstructorP = relationTypeConstructorP <|>
39− TypeVariable <$> uncapitalizedIdentifier <|>
40− ADTypeConstructor <$> capitalizedIdentifier <*> many (parens typeConstructorP <|>
52+ ADTypeConstructor <$> capitalizedIdentifier <*> many (monoTypeConstructorP <|> parens typeConstructorP) <|>
41− monoTypeConstructorP)
53+ monoTypeConstructorP
42
54
43monoTypeConstructorP :: Parser TypeConstructor
55monoTypeConstructorP :: Parser TypeConstructor
44−monoTypeConstructorP = primitiveTypeConstructorP <|>
45− ADTypeConstructor <$> capitalizedIdentifier <*> pure [] <|>
56+monoTypeConstructorP = ADTypeConstructor <$> typeConstructorNameP <*> pure [] <|>
46− TypeVariable <$> uncapitalizedIdentifier
57+ TypeVariable <$> uncapitalizedIdentifier
47
58
48
59
49
60
src/bin/TutorialD/Printer.hsnew file+165
@@ -0,0 +1,165 @@
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+19−17
@@ -5,9 +5,13 @@ 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
8import Options.Applicative
9import Options.Applicative
9import System.Exit
10import System.Exit
11+import Control.Monad
12+#if __GLASGOW_HASKELL__ < 804
10import Data.Monoid
13import Data.Monoid
14+#endif
11import Data.Maybe
15import Data.Maybe
12import qualified Data.Text as T
16import qualified Data.Text as T
13
17
@@ -18,50 +22,41 @@ import qualified Data.Text as T
18
22
19parseArgs :: Parser InterpreterConfig
23parseArgs :: Parser InterpreterConfig
20parseArgs = LocalInterpreterConfig <$> parsePersistenceStrategy <*> parseHeadName <*> parseTutDExec <*> many parseGhcPkgPath <*> parseCheckFS <|>
24parseArgs = LocalInterpreterConfig <$> parsePersistenceStrategy <*> parseHeadName <*> parseTutDExec <*> many parseGhcPkgPath <*> parseCheckFS <|>
21− RemoteInterpreterConfig <$> parseNodeId <*> parseDatabaseName <*> parseHeadName <*> parseTutDExec <*> parseCheckFS
25+ RemoteInterpreterConfig <$> parseHostname "127.0.0.1" <*> parsePort defaultServerPort <*> parseDatabaseName <*> parseHeadName <*> parseTutDExec <*> parseCheckFS
22
26
23parseHeadName :: Parser HeadName
27parseHeadName :: Parser HeadName
24parseHeadName = option auto (long "head" <>
28parseHeadName = option auto (long "head" <>
25 help "Start session at head name." <>
29 help "Start session at head name." <>
30+ metavar "GRAPH HEAD NAME" <>
26 value "master"
31 value "master"
27 )
32 )
28
33
29−parseNodeId :: Parser NodeId
30−parseNodeId = createNodeId <$>
31− strOption (long "host" <>
32− short 'h' <>
33− help "Remote host name" <>
34− value "127.0.0.1") <*>
35− option auto (long "port" <>
36− short 'p' <>
37− help "Remote port" <>
38− value defaultServerPort)
39−
40--just execute some tutd and exit
34--just execute some tutd and exit
41parseTutDExec :: Parser (Maybe TutorialDExec)
35parseTutDExec :: Parser (Maybe TutorialDExec)
42parseTutDExec = optional $ strOption (long "exec-tutd" <>
36parseTutDExec = optional $ strOption (long "exec-tutd" <>
43 short 'e' <>
37 short 'e' <>
38+ metavar "TUTORIALD" <>
44 help "Execute TutorialD expression and exit"
39 help "Execute TutorialD expression and exit"
45 )
40 )
46
41
47opts :: ParserInfo InterpreterConfig
42opts :: ParserInfo InterpreterConfig
48−opts = info parseArgs idm
43+opts = info (parseArgs <**> helpOption) idm
49
44
50connectionInfoForConfig :: InterpreterConfig -> ConnectionInfo
45connectionInfoForConfig :: InterpreterConfig -> ConnectionInfo
51connectionInfoForConfig (LocalInterpreterConfig pStrategy _ _ ghcPkgPaths _) = InProcessConnectionInfo pStrategy outputNotificationCallback ghcPkgPaths
46connectionInfoForConfig (LocalInterpreterConfig pStrategy _ _ ghcPkgPaths _) = InProcessConnectionInfo pStrategy outputNotificationCallback ghcPkgPaths
52−connectionInfoForConfig (RemoteInterpreterConfig remoteNodeId remoteDBName _ _ _) = RemoteProcessConnectionInfo remoteDBName remoteNodeId outputNotificationCallback
47+connectionInfoForConfig (RemoteInterpreterConfig remoteHost remotePort remoteDBName _ _ _) = RemoteConnectionInfo remoteDBName remoteHost (show remotePort) outputNotificationCallback
53
48
54headNameForConfig :: InterpreterConfig -> HeadName
49headNameForConfig :: InterpreterConfig -> HeadName
55headNameForConfig (LocalInterpreterConfig _ headn _ _ _) = headn
50headNameForConfig (LocalInterpreterConfig _ headn _ _ _) = headn
56−headNameForConfig (RemoteInterpreterConfig _ _ headn _ _) = headn
51+headNameForConfig (RemoteInterpreterConfig _ _ _ headn _ _) = headn
57
52
58execTutDForConfig :: InterpreterConfig -> Maybe String
53execTutDForConfig :: InterpreterConfig -> Maybe String
59execTutDForConfig (LocalInterpreterConfig _ _ t _ _) = t
54execTutDForConfig (LocalInterpreterConfig _ _ t _ _) = t
60−execTutDForConfig (RemoteInterpreterConfig _ _ _ t _) = t
55+execTutDForConfig (RemoteInterpreterConfig _ _ _ _ t _) = t
61
56
62checkFSForConfig :: InterpreterConfig -> Bool
57checkFSForConfig :: InterpreterConfig -> Bool
63checkFSForConfig (LocalInterpreterConfig _ _ _ _ c) = c
58checkFSForConfig (LocalInterpreterConfig _ _ _ _ c) = c
64−checkFSForConfig (RemoteInterpreterConfig _ _ _ _ c) = c
59+checkFSForConfig (RemoteInterpreterConfig _ _ _ _ _ c) = c
65
60
66persistenceStrategyForConfig :: InterpreterConfig -> Maybe PersistenceStrategy
61persistenceStrategyForConfig :: InterpreterConfig -> Maybe PersistenceStrategy
67persistenceStrategyForConfig (LocalInterpreterConfig strat _ _ _ _) = Just strat
62persistenceStrategyForConfig (LocalInterpreterConfig strat _ _ _ _) = Just strat
@@ -80,8 +75,15 @@ printWelcome = do
80 putStrLn "A full tutorial is available at:"
75 putStrLn "A full tutorial is available at:"
81 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"
82
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+
83main :: IO ()
84main :: IO ()
84main = do
85main = do
86+ setLocaleIfNecessary
85 interpreterConfig <- execParser opts
87 interpreterConfig <- execParser opts
86 let connInfo = connectionInfoForConfig interpreterConfig
88 let connInfo = connectionInfoForConfig interpreterConfig
87 fscheck <- checkFSType (checkFSForConfig interpreterConfig) (fromMaybe NoPersistence (persistenceStrategyForConfig interpreterConfig))
89 fscheck <- checkFSType (checkFSForConfig interpreterConfig) (fromMaybe NoPersistence (persistenceStrategyForConfig interpreterConfig))
src/bin/benchmark/Handles.hs+26−16
@@ -4,16 +4,17 @@ 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
7+import TutorialD.Interpreter.Base hiding (Parser, option)
8import qualified Data.Text as T
8import qualified Data.Text as T
9−import Text.Megaparsec hiding (option)
9+#if __GLASGOW_HASKELL__ < 804
10import Data.Monoid
10import Data.Monoid
11+#endif
11import Control.Monad
12import Control.Monad
12
13
13data HandlesArgs = HandlesArgs {
14data HandlesArgs = HandlesArgs {
14 openCloseCount :: Int,
15 openCloseCount :: Int,
15 transactionCount :: Int,
16 transactionCount :: Int,
16− dbdir :: FilePath,
17+ dbdir :: FilePath,
17 tutdSetup :: String,
18 tutdSetup :: String,
18 tutdIterate :: String
19 tutdIterate :: String
19 }
20 }
@@ -39,13 +40,13 @@ parseTutdIterate = strOption (short 'i' <> long "iterate-tutd" <> value "update
39main :: IO ()
40main :: IO ()
40main = do
41main = do
41 args <- execParser $ info (helper <*> parseArgs) fullDesc
42 args <- execParser $ info (helper <*> parseArgs) fullDesc
42− replicateM_ (openCloseCount args) (runOpenClose
43+ replicateM_ (openCloseCount args) (runOpenClose
43 (T.pack (tutdSetup args))
44 (T.pack (tutdSetup args))
44 (T.pack (tutdIterate args))
45 (T.pack (tutdIterate args))
45− (transactionCount args)
46+ (transactionCount args)
46 (dbdir args))
47 (dbdir args))
47−
48+
48−runOpenClose :: T.Text -> T.Text -> Int -> FilePath -> IO ()
49+runOpenClose :: T.Text -> T.Text -> Int -> FilePath -> IO ()
49runOpenClose tutdSetup' tutdIterate' tCount dbdir' = do
50runOpenClose tutdSetup' tutdIterate' tCount dbdir' = do
50 let connInfo = InProcessConnectionInfo (MinimalPersistence dbdir') emptyNotificationCallback []
51 let connInfo = InProcessConnectionInfo (MinimalPersistence dbdir') emptyNotificationCallback []
51 eConn <- connectProjectM36 connInfo
52 eConn <- connectProjectM36 connInfo
@@ -55,7 +56,7 @@ runOpenClose tutdSetup' tutdIterate' tCount dbdir' = do
55 eSess <- createSessionAtHead conn "master"
56 eSess <- createSessionAtHead conn "master"
56 case eSess of
57 case eSess of
57 Left err -> error (show err)
58 Left err -> error (show err)
58− Right session ->
59+ Right session ->
59 --database setup
60 --database setup
60 case parseTutorialD tutdSetup' of
61 case parseTutorialD tutdSetup' of
61 Left err -> error (show err)
62 Left err -> error (show err)
@@ -63,14 +64,19 @@ runOpenClose tutdSetup' tutdIterate' tCount dbdir' = do
63 res <- evalTutorialD session conn UnsafeEvaluation parsed
64 res <- evalTutorialD session conn UnsafeEvaluation parsed
64 case res of
65 case res of
65 DisplayErrorResult err -> error (T.unpack err)
66 DisplayErrorResult err -> error (T.unpack err)
66− DisplayParseErrorResult _ err -> error (parseErrorPretty err)
67+ DisplayParseErrorResult _ err ->
68+#if MIN_VERSION_megaparsec(7,0,0)
69+ error (errorBundlePretty err)
70+#else
71+ error (parseErrorPretty err)
72+#endif
67− _ -> do
73+ _ -> do
68 replicateM_ tCount (runTransaction tutdIterate' session conn)
74 replicateM_ tCount (runTransaction tutdIterate' session conn)
69 close conn
75 close conn
70 printFdCount
76 printFdCount
71−
77+
72runTransaction :: T.Text -> SessionId -> Connection -> IO ()
78runTransaction :: T.Text -> SessionId -> Connection -> IO ()
73−runTransaction tutdIterate' sess conn =
79+runTransaction tutdIterate' sess conn =
74 --run tutd on every iteration
80 --run tutd on every iteration
75 case parseTutorialD tutdIterate' of
81 case parseTutorialD tutdIterate' of
76 Left err -> error (show err)
82 Left err -> error (show err)
@@ -78,10 +84,14 @@ runTransaction tutdIterate' sess conn =
78 res <- evalTutorialD sess conn UnsafeEvaluation parsed
84 res <- evalTutorialD sess conn UnsafeEvaluation parsed
79 case res of
85 case res of
80 DisplayErrorResult err -> error (T.unpack err)
86 DisplayErrorResult err -> error (T.unpack err)
81− DisplayParseErrorResult _ err -> error (parseErrorPretty err)
87+ DisplayParseErrorResult _ err ->
88+#if MIN_VERSION_megaparsec(7,0,0)
89+ error (errorBundlePretty err)
90+#else
91+ error (parseErrorPretty err)
92+#endif
82− _ -> do
93+ _ -> do
83− eErr <- commit sess conn
94+ eErr <- commit sess conn
84 case eErr of
95 case eErr of
85 Left err -> error (show err)
96 Left err -> error (show err)
86 Right _ -> printFdCount
97 Right _ -> printFdCount
87−
src/bin/benchmark/bigrel.hs+42−19
@@ -1,33 +1,39 @@
1−{-# LANGUAGE FlexibleInstances #-}
1+{-# LANGUAGE FlexibleInstances, CPP #-}
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
7import qualified ProjectM36.Attribute as A
8import qualified ProjectM36.Attribute as A
8import qualified Data.Text as T
9import qualified Data.Text as T
9−import ProjectM36.Relation.Show.CSV
10+--import ProjectM36.Relation.Show.CSV
10import ProjectM36.Relation.Show.HTML
11import ProjectM36.Relation.Show.HTML
11−import TutorialD.Interpreter.DatabaseContextExpr (interpretDatabaseContextExpr)
12import ProjectM36.RelationalExpression
12import ProjectM36.RelationalExpression
13+import ProjectM36.TransactionGraph
13−import qualified Data.HashSet as HS
14+--import qualified Data.HashSet as HS
14−import qualified Data.ByteString.Lazy.Char8 as BS
15+--import qualified Data.ByteString.Lazy.Char8 as BS
15−import qualified Data.IntMap as IM
16+--import qualified Data.IntMap as IM
16−import qualified Data.Hashable as Hash
17+--import qualified Data.Hashable as Hash
17import qualified Data.Vector as V
18import qualified Data.Vector as V
18import Options.Applicative
19import 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
23import Control.DeepSeq
22import Control.DeepSeq
24import Data.Text hiding (map)
23import Data.Text hiding (map)
24+import Data.Time.Clock
25+import Data.UUID.V4
26+#if __GLASGOW_HASKELL__ < 804
25import Data.Monoid
27import Data.Monoid
28+#endif
26
29
30+
31+{-
27dumpcsv :: Relation -> IO ()
32dumpcsv :: Relation -> IO ()
28dumpcsv rel = case relationAsCSV rel of
33dumpcsv rel = case relationAsCSV rel of
29 Left err -> hPrint stderr err
34 Left err -> hPrint stderr err
30 Right bsData -> BS.putStrLn bsData
35 Right bsData -> BS.putStrLn bsData
36+-}
31
37
32data BigrelArgs = BigrelArgs Int Int Text
38data BigrelArgs = BigrelArgs Int Int Text
33
39
@@ -58,46 +64,63 @@ matrixRun (BigrelArgs attributeCount tupleCount tutd) =
58 Right rel -> if tutd == "" then
64 Right rel -> if tutd == "" then
59 putStrLn "Done."
65 putStrLn "Done."
60 else do
66 else do
67+ now <- getCurrentTime
68+ tid <- nextRandom
61 let setx = Assign "x" (ExistingRelation (force rel))
69 let setx = Assign "x" (ExistingRelation (force rel))
62− (context,_,_) = execState (evalDatabaseContextExpr setx) (freshDatabaseState dateExamples)
70+ graph = bootstrapTransactionGraph now tid dateExamples
63− interpreted = interpretDatabaseContextExpr context tutd
71+ env = mkDatabaseContextEvalEnv tid graph
72+ eNewState = runDatabaseContextEvalMonad dateExamples env (optimizeAndEvalDatabaseContextExpr True setx)
64 --plan = interpretRODatabaseContextOp context $ ":showplan " ++ tutd
73 --plan = interpretRODatabaseContextOp context $ ":showplan " ++ tutd
65 --displayOpResult plan
74 --displayOpResult plan
66− case interpreted of
75+ case eNewState of
76+ Right newState -> do
77+ let ctx = dbc_context newState
78+ Right x = optimizeAndEvalRelationalExpr env' (RelationVariable "x" ())
79+ env' = RelationalExprEnv ctx graph Nothing
67− Right context' -> TIO.putStrLn $ relationAsHTML (relationVariables context' M.! "x")
80+ TIO.putStrLn $ relationAsHTML x
68 Left err -> hPrint stderr err
81 Left err -> hPrint stderr err
69
82
70−
83+{-
71intmapMatrixRun :: IO ()
84intmapMatrixRun :: IO ()
72intmapMatrixRun = do
85intmapMatrixRun = do
73 let matrix = intmapMatrixRelation 100 100000
86 let matrix = intmapMatrixRelation 100 100000
74 print matrix
87 print matrix
88+-}
75
89
76--compare IntMap speed and size
90--compare IntMap speed and size
77--this is about 3 times faster (9 minutes) for 10x100000 and uses 800 MB
91--this is about 3 times faster (9 minutes) for 10x100000 and uses 800 MB
92+{-
78intmapMatrixRelation :: Int -> Int -> HS.HashSet (IM.IntMap Atom)
93intmapMatrixRelation :: Int -> Int -> HS.HashSet (IM.IntMap Atom)
79intmapMatrixRelation attributeCount tupleCount = HS.fromList $ map mapper [0..tupleCount]
94intmapMatrixRelation attributeCount tupleCount = HS.fromList $ map mapper [0..tupleCount]
80 where
95 where
81 mapper tupCount = IM.fromList $ map (\c-> (c, IntAtom (fromIntegral tupCount))) [0..attributeCount]
96 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)
82
100
83−instance Hash.Hashable (IM.IntMap Atom) where
101+{-
84− hashWithSalt salt tupMap = Hash.hashWithSalt salt (show tupMap)
85−
86vectorMatrixRun :: IO ()
102vectorMatrixRun :: IO ()
87vectorMatrixRun = do
103vectorMatrixRun = do
88 let matrix = vectorMatrixRelation 100 100000
104 let matrix = vectorMatrixRelation 100 100000
89 print matrix
105 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+
90
111
91-- 20 s 90 MBs- a clear win- ideal size is 10 * 100000 * 8 bytes = 80 MB! without IntAtom wrapper
112-- 20 s 90 MBs- a clear win- ideal size is 10 * 100000 * 8 bytes = 80 MB! without IntAtom wrapper
92--with IntAtom wrapper: 1m12s 90 MB
113--with IntAtom wrapper: 1m12s 90 MB
114+{-
115+
93vectorMatrixRelation :: Int -> Int -> HS.HashSet (V.Vector Atom)
116vectorMatrixRelation :: Int -> Int -> HS.HashSet (V.Vector Atom)
94vectorMatrixRelation attributeCount tupleCount = HS.fromList $ map mapper [0..tupleCount]
117vectorMatrixRelation attributeCount tupleCount = HS.fromList $ map mapper [0..tupleCount]
95 where
118 where
96 mapper tupCount = V.replicate attributeCount (IntAtom (fromIntegral tupCount))
119 mapper tupCount = V.replicate attributeCount (IntAtom (fromIntegral tupCount))
97−
120+-}
98instance Hash.Hashable (V.Vector Atom) where
121instance Hash.Hashable (V.Vector Atom) where
99 hashWithSalt salt vec = Hash.hashWithSalt salt (show vec)
122 hashWithSalt salt vec = Hash.hashWithSalt salt (show vec)
100−
123+-}
101-- returns a relation with tupleCount tuples with a set of integer attributes attributesCount long
124-- returns a relation with tupleCount tuples with a set of integer attributes attributesCount long
102-- this is useful for performance and resource usage testing
125-- this is useful for performance and resource usage testing
103matrixRelation :: Int -> Int -> Either RelationalError Relation
126matrixRelation :: Int -> Int -> Either RelationalError Relation
src/lib/ProjectM36/Arbitrary.hsnew file+127
@@ -0,0 +1,127 @@
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+14−9
@@ -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
4import qualified Data.Text as T
5import qualified Data.Text as T
5−--import Data.Time.Calendar
6+#if __GLASGOW_HASKELL__ < 804
6−--import Data.Time.Clock
7−--import Data.ByteString (ByteString)
8import Data.Monoid
7import 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
@@ -20,14 +20,19 @@ atomToText (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 (IntervalAtom b e bo be) = beginp <> begin <> "," <> end <> endp
23+atomToText (RelationalExprAtom re) = (T.pack . show) re
24− where beginp = if bo then "(" else "["
25− begin = atomToText b
26− end = atomToText e
27− endp = if be then ")" else "]"
28
24
29atomToText (RelationAtom i) = (T.pack . show) i
25atomToText (RelationAtom i) = (T.pack . show) i
30−atomToText (ConstructedAtom dConsName _ atoms) = dConsName <> dConsArgs
26+atomToText (ConstructedAtom dConsName typ atoms)
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
31 where
36 where
32 parensAtomToText a@(ConstructedAtom _ _ []) = atomToText a
37 parensAtomToText a@(ConstructedAtom _ _ []) = atomToText a
33 parensAtomToText a@ConstructedAtom{} = "(" <> atomToText a <> ")"
38 parensAtomToText a@ConstructedAtom{} = "(" <> atomToText a <> ")"
src/lib/ProjectM36/AtomFunction.hs+20−4
@@ -1,5 +1,7 @@
1+{-# LANGUAGE CPP #-}
1module ProjectM36.AtomFunction where
2module ProjectM36.AtomFunction where
2import ProjectM36.Base
3import ProjectM36.Base
4+import ProjectM36.Serialise.Base ()
3import ProjectM36.Error
5import ProjectM36.Error
4import ProjectM36.Relation
6import ProjectM36.Relation
5import ProjectM36.AtomType
7import ProjectM36.AtomType
@@ -8,7 +10,8 @@ import ProjectM36.ScriptSession
8import qualified ProjectM36.Attribute as A
10import qualified ProjectM36.Attribute as A
9import qualified Data.HashSet as HS
11import qualified Data.HashSet as HS
10import qualified Data.Text as T
12import qualified Data.Text as T
11−
13+import qualified Data.ByteString.Lazy as BL
14+import Codec.Winery
12
15
13foldAtomFuncType :: AtomType -> AtomType -> [AtomType]
16foldAtomFuncType :: AtomType -> AtomType -> [AtomType]
14--the underscore in the attribute name means that any attributes are acceptable
17--the underscore in the attribute name means that any attributes are acceptable
@@ -72,8 +75,11 @@ createScriptedAtomFunction funcName argsType retType = AddAtomFunction funcName
72 retType]])
75 retType]])
73
76
74loadAtomFunctions :: ModName -> FuncName -> FilePath -> IO (Either LoadSymbolError [AtomFunction])
77loadAtomFunctions :: ModName -> FuncName -> FilePath -> IO (Either LoadSymbolError [AtomFunction])
75−loadAtomFunctions modName funcName objPath = do
78+#ifdef PM36_HASKELL_SCRIPTING
76− loadFunction modName funcName objPath
79+loadAtomFunctions = loadFunction
80+#else
81+loadAtomFunctions _ _ _ = pure (Left LoadSymbolError)
82+#endif
77
83
78atomFunctionsAsRelation :: AtomFunctions -> Either RelationalError Relation
84atomFunctionsAsRelation :: AtomFunctions -> Either RelationalError Relation
79atomFunctionsAsRelation funcs = mkRelationFromList attrs tups
85atomFunctionsAsRelation funcs = mkRelationFromList attrs tups
@@ -82,4 +88,14 @@ atomFunctionsAsRelation funcs = mkRelationFromList attrs tups
82 Attribute "arguments" TextAtomType]
88 Attribute "arguments" TextAtomType]
83 atomFuncToTuple aFunc = [TextAtom (atomFuncName aFunc),
89 atomFuncToTuple aFunc = [TextAtom (atomFuncName aFunc),
84 TextAtom (atomFuncTypeToText aFunc)]
90 TextAtom (atomFuncTypeToText aFunc)]
85− atomFuncTypeToText aFunc = T.intercalate " -> " (map prettyAtomType (atomFuncType 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,6 +1,5 @@
1{-# LANGUAGE DeriveGeneric, DeriveAnyClass #-}
1{-# LANGUAGE DeriveGeneric, DeriveAnyClass #-}
2module ProjectM36.AtomFunctionError where
2module ProjectM36.AtomFunctionError where
3−import Data.Binary
4import GHC.Generics
3import GHC.Generics
5import Control.DeepSeq
4import Control.DeepSeq
6import Data.Text
5import Data.Text
@@ -9,9 +8,10 @@ data AtomFunctionError = AtomFunctionUserError String |
9 AtomFunctionTypeMismatchError |
8 AtomFunctionTypeMismatchError |
10 InvalidIntervalOrderingError |
9 InvalidIntervalOrderingError |
11 InvalidIntervalBoundariesError |
10 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, Binary, NFData)
16+ deriving(Generic, Eq, Show, NFData)
17
17
src/lib/ProjectM36/AtomFunctions/Basic.hs+2
@@ -6,6 +6,7 @@ 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
9import ProjectM36.AtomFunctions.Primitive
10import ProjectM36.AtomFunctions.Primitive
10import ProjectM36.AtomFunction
11import ProjectM36.AtomFunction
11import ProjectM36.DataTypes.List
12import ProjectM36.DataTypes.List
@@ -19,6 +20,7 @@ basicAtomFunctions = HS.unions [primitiveAtomFunctions,
19 eitherAtomFunctions,
20 eitherAtomFunctions,
20 maybeAtomFunctions,
21 maybeAtomFunctions,
21 listAtomFunctions,
22 listAtomFunctions,
23+ nonEmptyListAtomFunctions,
22 bytestringAtomFunctions,
24 bytestringAtomFunctions,
23 intervalAtomFunctions]
25 intervalAtomFunctions]
24
26
src/lib/ProjectM36/AtomFunctions/Primitive.hs+9−1
@@ -43,7 +43,15 @@ 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+
47 ]
55 ]
48 where
56 where
49 body = AtomFunctionBody Nothing
57 body = AtomFunctionBody Nothing
src/lib/ProjectM36/AtomType.hs+208−61
@@ -6,6 +6,7 @@ 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
9import qualified ProjectM36.Attribute as A
10import qualified ProjectM36.Attribute as A
10import qualified Data.Vector as V
11import qualified Data.Vector as V
11import qualified Data.Set as S
12import qualified Data.Set as S
@@ -30,6 +31,7 @@ findDataConstructor dName = foldr tConsFolder Nothing
30 [dCons] -> Just dCons
31 [dCons] -> Just dCons
31 _ -> error "More than one data constructor with the same name found"
32 _ -> error "More than one data constructor with the same name found"
32
33
34+{-
33-- | Scan the atom types and return the resultant ConstructedAtomType or error.
35-- | Scan the atom types and return the resultant ConstructedAtomType or error.
34-- Used in typeFromAtomExpr to validate argument types.
36-- Used in typeFromAtomExpr to validate argument types.
35atomTypeForDataConstructorName :: DataConstructorName -> [AtomType] -> TypeConstructorMapping -> Either RelationalError AtomType
37atomTypeForDataConstructorName :: DataConstructorName -> [AtomType] -> TypeConstructorMapping -> Either RelationalError AtomType
@@ -37,36 +39,35 @@ atomTypeForDataConstructorName :: DataConstructorName -> [AtomType] -> TypeConst
37atomTypeForDataConstructorName dConsName atomTypesIn tConsList =
39atomTypeForDataConstructorName dConsName atomTypesIn tConsList =
38 case findDataConstructor dConsName tConsList of
40 case findDataConstructor dConsName tConsList of
39 Nothing -> Left (NoSuchDataConstructorError dConsName)
41 Nothing -> Left (NoSuchDataConstructorError dConsName)
40− Just (tCons, dCons) ->
42+ Just (tCons, dCons) -> do
43+ dConsVars <- resolveDataConstructorTypeVars dCons atomTypesIn tConsList
44+ let tConsVars = M.fromList (map TypeVariableType (TCD.typeVars tCons))
45+ allVars = M.union dConsVars tConsVars
41− ConstructedAtomType (TCD.name tCons) <$> resolveDataConstructorTypeVars dCons atomTypesIn tConsList
46+ ConstructedAtomType (TCD.name tCons) <$> allVars
47+-}
42
48
43atomTypeForDataConstructorDefArg :: DataConstructorDefArg -> AtomType -> TypeConstructorMapping -> Either RelationalError AtomType
49atomTypeForDataConstructorDefArg :: DataConstructorDefArg -> AtomType -> TypeConstructorMapping -> Either RelationalError AtomType
44−atomTypeForDataConstructorDefArg (DataConstructorDefTypeConstructorArg tCons) aType tConss =
50+atomTypeForDataConstructorDefArg (DataConstructorDefTypeConstructorArg tCons) aType tConss = do
45− case isValidAtomTypeForTypeConstructor aType tCons tConss of
51+ isValidAtomTypeForTypeConstructor aType tCons tConss
46− Just err -> Left err
52+ pure aType
47− Nothing -> Right aType
48
53
49atomTypeForDataConstructorDefArg (DataConstructorDefTypeVarNameArg _) aType _ = Right aType --any type is OK
54atomTypeForDataConstructorDefArg (DataConstructorDefTypeVarNameArg _) aType _ = Right aType --any type is OK
50
55
51−--reconcile the atom-in types with the type constructors
52−isValidAtomTypeForTypeConstructor :: AtomType -> TypeConstructor -> TypeConstructorMapping -> Maybe RelationalError
53−isValidAtomTypeForTypeConstructor aType (PrimitiveTypeConstructor _ expectedAType) _ = if expectedAType /= aType then Just (AtomTypeMismatchError expectedAType aType) else Nothing
54−
55−--lookup constructor name and check if the incoming atom types are valid
56−isValidAtomTypeForTypeConstructor (ConstructedAtomType tConsName _) (ADTypeConstructor expectedTConsName _) _ = if tConsName /= expectedTConsName then Just (TypeConstructorNameMismatch expectedTConsName tConsName) else Nothing
57−
58−isValidAtomTypeForTypeConstructor aType tCons _ = Just (AtomTypeTypeConstructorReconciliationError aType (TC.name tCons))
59−
60-- | Used to determine if the atom arguments can be used with the data constructor.
56-- | Used to determine if the atom arguments can be used with the data constructor.
61−-- | This is the entry point for type-checking from RelationalExpression.hs.
57+-- | This is the entry point for type-checking from RelationalExpression.hs
62atomTypeForDataConstructor :: TypeConstructorMapping -> DataConstructorName -> [AtomType] -> Either RelationalError AtomType
58atomTypeForDataConstructor :: TypeConstructorMapping -> DataConstructorName -> [AtomType] -> Either RelationalError AtomType
63atomTypeForDataConstructor tConss dConsName atomArgTypes =
59atomTypeForDataConstructor tConss dConsName atomArgTypes =
64 --lookup the data constructor
60 --lookup the data constructor
65 case findDataConstructor dConsName tConss of
61 case findDataConstructor dConsName tConss of
66 Nothing -> Left (NoSuchDataConstructorError dConsName)
62 Nothing -> Left (NoSuchDataConstructorError dConsName)
67− Just (tCons, dCons) ->
63+ Just (tCons, dCons) -> do
68 --validate that the type constructor arguments are fulfilled in the data constructor
64 --validate that the type constructor arguments are fulfilled in the data constructor
69− ConstructedAtomType (TCD.name tCons) <$> resolveDataConstructorTypeVars dCons atomArgTypes tConss
65+ dConsVars <- 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
69+ --validateAtomType unresolvedType tConss -- do not validate here because the type may not be fully resolved at this point
70+ pure unresolvedType
70
71
71-- | Walks the data and type constructors to extract the type variable map.
72-- | Walks the data and type constructors to extract the type variable map.
72resolveDataConstructorTypeVars :: DataConstructorDef -> [AtomType] -> TypeConstructorMapping -> Either RelationalError TypeVarMap
73resolveDataConstructorTypeVars :: DataConstructorDef -> [AtomType] -> TypeConstructorMapping -> Either RelationalError TypeVarMap
@@ -80,10 +81,11 @@ resolveDataConstructorTypeVars dCons@(DataConstructorDef _ defArgs) aTypeArgs tC
80 --if any two maps have the same key and different values, this indicates a type arg mismatch
81 --if any two maps have the same key and different values, this indicates a type arg mismatch
81 let typeVarMapFolder valMap acc = case acc of
82 let typeVarMapFolder valMap acc = case acc of
82 Left err -> Left err
83 Left err -> Left err
83− Right accMap -> if accMap `M.isSubmapOf` valMap then
84+ Right accMap ->
84− Right (M.union accMap valMap)
85+ case resolveAtomTypesInTypeVarMap valMap accMap of
85− else
86− Left (DataConstructorTypeVarsMismatch (DCD.name dCons) accMap valMap)
86+ Left (TypeConstructorTypeVarMissing _) -> Left (DataConstructorTypeVarsMismatch (DCD.name dCons) accMap valMap)
87+ Left err -> Left err
88+ Right ok -> pure ok
87 case foldr typeVarMapFolder (Right M.empty) maps of
89 case foldr typeVarMapFolder (Right M.empty) maps of
88 Left err -> Left err
90 Left err -> Left err
89 Right typeVarMaps -> pure typeVarMaps
91 Right typeVarMaps -> pure typeVarMaps
@@ -114,36 +116,103 @@ resolveTypeConstructorTypeVars (ADTypeConstructor tConsName _) (ConstructedAtomT
114 Right pVarMap'
116 Right pVarMap'
115 else
117 else
116 Left (TypeConstructorTypeVarsMismatch expectedPVarNames (M.keysSet pVarMap'))
118 Left (TypeConstructorTypeVarsMismatch expectedPVarNames (M.keysSet pVarMap'))
117−resolveTypeConstructorTypeVars (TypeVariable tvName) typ _ = Right (M.singleton tvName typ)
119+resolveTypeConstructorTypeVars (TypeVariable tvName) typ _ = case typ of
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+
118resolveTypeConstructorTypeVars (ADTypeConstructor tConsName _) typ _ = Left (TypeConstructorAtomTypeMismatch tConsName typ)
126resolveTypeConstructorTypeVars (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
119
139
120-- check that type vars on the right also appear on the left
140-- check that type vars on the right also appear on the left
121-- check that the data constructor names are unique
141-- check that the data constructor names are unique
122−validateTypeConstructorDef :: TypeConstructorDef -> [DataConstructorDef] -> [RelationalError]
142+validateTypeConstructorDef :: TypeConstructorDef -> [DataConstructorDef] -> TypeConstructorMapping -> Either RelationalError ()
123−validateTypeConstructorDef tConsDef dConsList = execWriter $ do
143+validateTypeConstructorDef tConsDef dConsList tConsMap = do
124 let duplicateDConsNames = dupes (L.sort (map DCD.name dConsList))
144 let duplicateDConsNames = dupes (L.sort (map DCD.name dConsList))
125− mapM_ tell [map DataConstructorNameInUseError duplicateDConsNames]
145+ unless (null duplicateDConsNames) (Left (someErrors (map DataConstructorNameInUseError duplicateDConsNames)))
126 let leftSideVars = S.fromList (TCD.typeVars tConsDef)
146 let leftSideVars = S.fromList (TCD.typeVars tConsDef)
127 rightSideVars = S.unions (map DCD.typeVars dConsList)
147 rightSideVars = S.unions (map DCD.typeVars dConsList)
128 varsDiff = S.difference leftSideVars rightSideVars
148 varsDiff = S.difference leftSideVars rightSideVars
129− mapM_ tell [map DataConstructorUsesUndeclaredTypeVariable (S.toList varsDiff)]
149+ when (S.size varsDiff > 0) (Left (someErrors (map DataConstructorUsesUndeclaredTypeVariable (S.toList varsDiff))))
130− pure ()
150+ mapM_ (\dConsDef -> validateDataConstructorDef dConsDef tConsDef tConsMap) dConsList
131−
151+
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
132
176
133-- | Create an atom type iff all type variables are provided.
177-- | Create an atom type iff all type variables are provided.
134-- Either Int Text -> ConstructedAtomType "Either" {Int , Text}
178-- Either Int Text -> ConstructedAtomType "Either" {Int , Text}
135−atomTypeForTypeConstructor :: TypeConstructor -> TypeConstructorMapping -> TypeVarMap -> Either RelationalError AtomType
179+atomTypeForTypeConstructorValidate :: Bool -> TypeConstructor -> TypeConstructorMapping -> TypeVarMap -> Either RelationalError AtomType
136−atomTypeForTypeConstructor (PrimitiveTypeConstructor _ aType) _ _ = Right aType
180+atomTypeForTypeConstructorValidate _ (PrimitiveTypeConstructor _ aType) _ _ = Right aType
137−atomTypeForTypeConstructor (TypeVariable tvname) _ tvMap = case M.lookup tvname tvMap of
181+atomTypeForTypeConstructorValidate validate (TypeVariable tvname) _ tvMap = case M.lookup tvname tvMap of
182+ Nothing -> if validate then
183+ Left (TypeConstructorTypeVarMissing tvname)
184+ else
138− Nothing -> Right (TypeVariableType tvname)
185+ pure (TypeVariableType tvname)
139 Just typ -> Right typ
186 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))
140−atomTypeForTypeConstructor tCons tConss tvMap = case findTypeConstructor (TC.name tCons) tConss of
191+atomTypeForTypeConstructorValidate val tCons tConss tvMap = case findTypeConstructor (TC.name tCons) tConss of
141 Nothing -> Left (NoSuchTypeConstructorError (TC.name tCons))
192 Nothing -> Left (NoSuchTypeConstructorError (TC.name tCons))
193+ Just (PrimitiveTypeConstructorDef _ aType, _) -> Right aType
142 Just (tConsDef, _) -> do
194 Just (tConsDef, _) -> do
143− tConsArgTypes <- mapM (\tConsArg -> atomTypeForTypeConstructor tConsArg tConss tvMap) (TC.arguments tCons)
195+ tConsArgTypes <- mapM (\tConsArg -> atomTypeForTypeConstructorValidate val tConsArg tConss tvMap) (TC.arguments tCons)
144− let pVarNames = TCD.typeVars tConsDef
196+ let pVarNames = TCD.typeVars tConsDef
145− tConsArgs = M.fromList (zip pVarNames tConsArgTypes)
197+ tConsArgs = M.fromList (zip pVarNames tConsArgTypes)
146− Right (ConstructedAtomType (TC.name tCons) tConsArgs)
198+ 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))
147
216
148findTypeConstructor :: TypeConstructorName -> TypeConstructorMapping -> Maybe (TypeConstructorDef, [DataConstructorDef])
217findTypeConstructor :: TypeConstructorName -> TypeConstructorMapping -> Maybe (TypeConstructorDef, [DataConstructorDef])
149findTypeConstructor name = foldr tConsFolder Nothing
218findTypeConstructor name = foldr tConsFolder Nothing
@@ -152,16 +221,30 @@ findTypeConstructor name = foldr tConsFolder Nothing
152 Just (tCons, dConsList)
221 Just (tCons, dConsList)
153 else
222 else
154 accum
223 accum
155−
224+
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
156resolveAtomType :: AtomType -> AtomType -> Either RelationalError AtomType
233resolveAtomType :: AtomType -> AtomType -> Either RelationalError AtomType
157resolveAtomType (ConstructedAtomType tConsName resolvedTypeVarMap) (ConstructedAtomType _ unresolvedTypeVarMap) =
234resolveAtomType (ConstructedAtomType tConsName resolvedTypeVarMap) (ConstructedAtomType _ unresolvedTypeVarMap) =
158− ConstructedAtomType tConsName <$> resolveAtomTypesInTypeVarMap resolvedTypeVarMap unresolvedTypeVarMap
235+ ConstructedAtomType tConsName <$> resolveAtomTypesInTypeVarMap resolvedTypeVarMap unresolvedTypeVarMap
159resolveAtomType typeFromRelation unresolvedType = if typeFromRelation == unresolvedType then
236resolveAtomType typeFromRelation unresolvedType = if typeFromRelation == unresolvedType then
160 Right typeFromRelation
237 Right typeFromRelation
161 else
238 else
162 Left (AtomTypeMismatchError typeFromRelation unresolvedType)
239 Left (AtomTypeMismatchError typeFromRelation unresolvedType)
163
240
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+-}
164−-- this could be optimized to reduce new tuple creation- if anyatomtype does not appear, just return the original typevarmap
247+-- this could be optimized to reduce new tuple creation
165resolveAtomTypesInTypeVarMap :: TypeVarMap -> TypeVarMap -> Either RelationalError TypeVarMap
248resolveAtomTypesInTypeVarMap :: TypeVarMap -> TypeVarMap -> Either RelationalError TypeVarMap
166resolveAtomTypesInTypeVarMap resolvedTypeMap unresolvedTypeMap = do
249resolveAtomTypesInTypeVarMap resolvedTypeMap unresolvedTypeMap = do
167 {-
250 {-
@@ -177,29 +260,42 @@ resolveAtomTypesInTypeVarMap resolvedTypeMap unresolvedTypeMap = do
177 let resolveTypePair resKey resType =
260 let resolveTypePair resKey resType =
178 -- if the key is missing in the unresolved type map, then fill it in with the value from the resolved map
261 -- if the key is missing in the unresolved type map, then fill it in with the value from the resolved map
179 case M.lookup resKey unresolvedTypeMap of
262 case M.lookup resKey unresolvedTypeMap of
180− Just unresType -> case unresType of
263+ Just unresType -> case unresType of
181 --do we need to recurse for RelationAtomType?
264 --do we need to recurse for RelationAtomType?
182 subType@(ConstructedAtomType _ _) -> do
265 subType@(ConstructedAtomType _ _) -> do
183 resSubType <- resolveAtomType resType subType
266 resSubType <- resolveAtomType resType subType
184 pure (resKey, resSubType)
267 pure (resKey, resSubType)
185− otherType -> pure (resKey, otherType)
268+ TypeVariableType _ -> pure (resKey, resType)
269+ typ -> if typ == resType then
270+ pure (resKey, resType)
271+ else
272+ Left $ AtomTypeMismatchError typ resType
186 Nothing ->
273 Nothing ->
187 pure (resKey, resType) --swipe the missing type var from the expected map
274 pure (resKey, resType) --swipe the missing type var from the expected map
188 tVarList <- mapM (uncurry resolveTypePair) (M.toList resolvedTypeMap)
275 tVarList <- mapM (uncurry resolveTypePair) (M.toList resolvedTypeMap)
189 pure (M.fromList tVarList)
276 pure (M.fromList tVarList)
190
277
191-- | See notes at `resolveTypesInTuple`. The typeFromRelation must not include any wildcards.
278-- | See notes at `resolveTypesInTuple`. The typeFromRelation must not include any wildcards.
192−resolveTypeInAtom :: AtomType -> Atom -> Either RelationalError Atom
279+resolveTypeInAtom :: AtomType -> Atom -> TypeConstructorMapping -> Either RelationalError Atom
193−resolveTypeInAtom typeFromRelation atomIn@(ConstructedAtom dConsName _ args) = do
280+resolveTypeInAtom typeFromRelation@(ConstructedAtomType _ tvMap) atomIn@(ConstructedAtom dConsName _ args) tConss = do
194 newType <- resolveAtomType typeFromRelation (atomTypeForAtom atomIn)
281 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)
195− pure (ConstructedAtom dConsName newType args)
288+ pure (ConstructedAtom dConsName newType newArgs)
289+resolveTypeInAtom (RelationAtomType attrs) (RelationAtom (Relation _ tupSet)) tConss = do
290+ let newTups = mapM (resolveTypesInTuple attrs tConss) (asList tupSet)
291+ RelationAtom . Relation attrs . RelationTupleSet <$> newTups
196−resolveTypeInAtom _ atom = Right atom
292+resolveTypeInAtom _ atom _ = Right atom
197
293
198-- | 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.
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.
199-- 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.
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.
200−resolveTypesInTuple :: Attributes -> RelationTuple -> Either RelationalError RelationTuple
296+resolveTypesInTuple :: Attributes -> TypeConstructorMapping -> RelationTuple -> Either RelationalError RelationTuple
201−resolveTypesInTuple resolvedAttrs (RelationTuple _ tupAtoms) = do
297+resolveTypesInTuple resolvedAttrs tConss (RelationTuple _ tupAtoms) = do
202− newAtoms <- mapM (\(atom, resolvedType) -> resolveTypeInAtom resolvedType atom) (zip (V.toList tupAtoms) $ map A.atomType (V.toList resolvedAttrs))
298+ newAtoms <- mapM (\(atom, resolvedType) -> resolveTypeInAtom resolvedType atom tConss) (zip (V.toList tupAtoms) $ A.atomTypesList resolvedAttrs)
203 Right (RelationTuple resolvedAttrs (V.fromList newAtoms))
299 Right (RelationTuple resolvedAttrs (V.fromList newAtoms))
204
300
205-- | Validate that the type is provided with complete type variables for type constructors.
301-- | Validate that the type is provided with complete type variables for type constructors.
@@ -214,12 +310,38 @@ validateAtomType typ@(ConstructedAtomType tConsName tVarMap) tConss =
214 if not (S.null diff) then
310 if not (S.null diff) then
215 Left $ TypeConstructorTypeVarsMismatch expectedTyVarNames actualTyVarNames
311 Left $ TypeConstructorTypeVarsMismatch expectedTyVarNames actualTyVarNames
216 else
312 else
217− Right ()
313+ validateTypeVarMap tVarMap tConss
218− _ -> Right ()
314+ _ -> Right ()
219−validateAtomType _ _ = Right ()
315+validateAtomType (RelationAtomType attrs) tConss =
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
220
333
221validateTuple :: RelationTuple -> TypeConstructorMapping -> Either RelationalError ()
334validateTuple :: RelationTuple -> TypeConstructorMapping -> Either RelationalError ()
222−validateTuple (RelationTuple _ atoms) tConss = mapM_ (\a -> validateAtomType (atomTypeForAtom a) tConss) atoms
335+validateTuple (RelationTuple _ atoms) tConss = mapM_ (`validateAtom` 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+
223
345
224-- | Determine if two types are equal or compatible (including special handling for TypeVar x).
346-- | Determine if two types are equal or compatible (including special handling for TypeVar x).
225atomTypeVerify :: AtomType -> AtomType -> Either RelationalError AtomType
347atomTypeVerify :: AtomType -> AtomType -> Either RelationalError AtomType
@@ -236,9 +358,8 @@ atomTypeVerify x@(RelationAtomType attrs1) y@(RelationAtomType attrs2) = do
236 if notElem "_" [name1, name2] && name1 /= name2 then
358 if notElem "_" [name1, name2] && name1 /= name2 then
237 Left $ AtomTypeMismatchError x y
359 Left $ AtomTypeMismatchError x y
238 else
360 else
239− atomTypeVerify (A.atomType attr1) (A.atomType attr2)) $ V.toList (V.zip attrs1 attrs2)
361+ atomTypeVerify (A.atomType attr1) (A.atomType attr2)) $ V.toList (V.zip (attributesVec attrs1) (attributesVec attrs2))
240 return x
362 return x
241−atomTypeVerify (IntervalAtomType typA) (IntervalAtomType typB) = atomTypeVerify typA typB
242atomTypeVerify x y = if x == y then
363atomTypeVerify x y = if x == y then
243 Right x
364 Right x
244 else
365 else
@@ -246,17 +367,21 @@ atomTypeVerify x y = if x == y then
246
367
247-- | Determine if two typeVars are logically compatible.
368-- | Determine if two typeVars are logically compatible.
248typeVarMapsVerify :: TypeVarMap -> TypeVarMap -> Bool
369typeVarMapsVerify :: TypeVarMap -> TypeVarMap -> Bool
249−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
370+typeVarMapsVerify a b = M.keysSet a == M.keysSet b && (length . rights) zipped == M.size a
371+ where
372+ zipped = zipWith
373+ (curry (\ ((_, v1), (_, v2)) -> atomTypeVerify v1 v2))
374+ (M.toAscList a)
375+ (M.toAscList b)
250
376
251prettyAtomType :: AtomType -> T.Text
377prettyAtomType :: AtomType -> T.Text
252−prettyAtomType (RelationAtomType attrs) = "relation {" `T.append` T.intercalate "," (map prettyAttribute (V.toList attrs)) `T.append` "}"
378+prettyAtomType (RelationAtomType attrs) = "relation {" `T.append` T.intercalate "," (map prettyAttribute (V.toList (attributesVec attrs))) `T.append` "}"
253prettyAtomType (ConstructedAtomType tConsName typeVarMap) = tConsName `T.append` T.concat (map showTypeVars (M.toList typeVarMap))
379prettyAtomType (ConstructedAtomType tConsName typeVarMap) = tConsName `T.append` T.concat (map showTypeVars (M.toList typeVarMap))
254 where
380 where
255 showTypeVars (_, TypeVariableType x) = " " <> x
381 showTypeVars (_, TypeVariableType x) = " " <> x
256 showTypeVars (tyVarName, aType) = " (" `T.append` tyVarName `T.append` "::" `T.append` prettyAtomType aType `T.append` ")"
382 showTypeVars (tyVarName, aType) = " (" `T.append` tyVarName `T.append` "::" `T.append` prettyAtomType aType `T.append` ")"
257-- 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?)
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?)
258prettyAtomType (TypeVariableType x) = x
384prettyAtomType (TypeVariableType x) = x
259−prettyAtomType (IntervalAtomType tv) = "Interval " <> prettyAtomType tv
260prettyAtomType aType = T.take (T.length fullName - T.length "AtomType") fullName
385prettyAtomType aType = T.take (T.length fullName - T.length "AtomType") fullName
261 where fullName = (T.pack . show) aType
386 where fullName = (T.pack . show) aType
262
387
@@ -281,7 +406,6 @@ resolveTypeVariables expectedArgTypes actualArgTypes = do
281
406
282resolveTypeVariable :: AtomType -> AtomType -> TypeVarMap
407resolveTypeVariable :: AtomType -> AtomType -> TypeVarMap
283resolveTypeVariable (TypeVariableType tv) typ = M.singleton tv typ
408resolveTypeVariable (TypeVariableType tv) typ = M.singleton tv typ
284−resolveTypeVariable (IntervalAtomType ityp) typ = resolveTypeVariable ityp typ
285resolveTypeVariable (ConstructedAtomType _ _) (ConstructedAtomType _ actualTvMap) = actualTvMap
409resolveTypeVariable (ConstructedAtomType _ _) (ConstructedAtomType _ actualTvMap) = actualTvMap
286resolveTypeVariable _ _ = M.empty
410resolveTypeVariable _ _ = M.empty
287
411
@@ -292,7 +416,6 @@ resolveFunctionReturnValue funcName tvMap (ConstructedAtomType tCons retMap) = d
292 pure (ConstructedAtomType tCons (M.intersection tvMap retMap))
416 pure (ConstructedAtomType tCons (M.intersection tvMap retMap))
293 else
417 else
294 Left (AtomFunctionTypeVariableResolutionError funcName (fst (head (M.toList diff))))
418 Left (AtomFunctionTypeVariableResolutionError funcName (fst (head (M.toList diff))))
295−resolveFunctionReturnValue funcName tvMap (IntervalAtomType tv) = IntervalAtomType <$> resolveFunctionReturnValue funcName tvMap tv
296resolveFunctionReturnValue funcName tvMap (TypeVariableType tvName) = case M.lookup tvName tvMap of
419resolveFunctionReturnValue funcName tvMap (TypeVariableType tvName) = case M.lookup tvName tvMap of
297 Nothing -> Left (AtomFunctionTypeVariableResolutionError funcName tvName)
420 Nothing -> Left (AtomFunctionTypeVariableResolutionError funcName tvName)
298 Just typ -> pure typ
421 Just typ -> pure typ
@@ -307,3 +430,27 @@ resolvedAtomTypeForDataConstructorDefArg tConsMap tvMap (DataConstructorDefTypeC
307resolvedAtomTypeForDataConstructorDefArg _ tvMap (DataConstructorDefTypeVarNameArg tvName) = case M.lookup tvName tvMap of
430resolvedAtomTypeForDataConstructorDefArg _ tvMap (DataConstructorDefTypeVarNameArg tvName) = case M.lookup tvName tvMap of
308 Nothing -> Left (DataConstructorUsesUndeclaredTypeVariable tvName)
431 Nothing -> Left (DataConstructorUsesUndeclaredTypeVariable tvName)
309 Just typ -> Right typ
432 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+68−56
@@ -1,39 +1,28 @@
1{-# LANGUAGE DefaultSignatures, TypeFamilies, TypeOperators, PolyKinds, FlexibleInstances, ScopedTypeVariables, FlexibleContexts #-}
1{-# LANGUAGE DefaultSignatures, TypeFamilies, TypeOperators, PolyKinds, FlexibleInstances, ScopedTypeVariables, FlexibleContexts #-}
2+{-# OPTIONS_GHC -fno-warn-orphans #-}
2module ProjectM36.Atomable where
3module ProjectM36.Atomable where
3--http://stackoverflow.com/questions/13448361/type-families-with-ghc-generics-or-data-data
4--http://stackoverflow.com/questions/13448361/type-families-with-ghc-generics-or-data-data
4--instances to marshal Haskell ADTs to ConstructedAtoms and back
5--instances to marshal Haskell ADTs to ConstructedAtoms and back
5import ProjectM36.Base
6import ProjectM36.Base
6−import ProjectM36.DataTypes.Primitive
7import ProjectM36.DataTypes.List
7import ProjectM36.DataTypes.List
8+import ProjectM36.DataTypes.NonEmptyList
8import ProjectM36.DataTypes.Maybe
9import ProjectM36.DataTypes.Maybe
9import ProjectM36.DataTypes.Either
10import ProjectM36.DataTypes.Either
10import GHC.Generics
11import GHC.Generics
11import qualified Data.Map as M
12import qualified Data.Map as M
12import qualified Data.Text as T
13import qualified Data.Text as T
14+import qualified Data.Vector as V
13import Control.DeepSeq (NFData)
15import Control.DeepSeq (NFData)
14−import Data.Binary
15import Control.Applicative
16import Control.Applicative
16import Data.Time.Calendar
17import Data.Time.Calendar
17import Data.ByteString (ByteString)
18import Data.ByteString (ByteString)
18import Data.Time.Clock
19import 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
21
23
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−-}
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.
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.
36−class (Eq a, NFData a, Binary a, Show a) => Atomable a where
25+class (Eq a, NFData a, Serialise a, Show a) => Atomable a where
37 toAtom :: a -> Atom
26 toAtom :: a -> Atom
38 default toAtom :: (Generic a, AtomableG (Rep a)) => a -> Atom
27 default toAtom :: (Generic a, AtomableG (Rep a)) => a -> Atom
39 toAtom v = toAtomG (from v) (toAtomTypeG (from v))
28 toAtom v = toAtomG (from v) (toAtomTypeG (from v))
@@ -52,9 +41,9 @@ class (Eq a, NFData a, Binary a, Show a) => Atomable a where
52 toAtomType _ = toAtomTypeG (from (undefined :: a))
41 toAtomType _ = toAtomTypeG (from (undefined :: a))
53
42
54 -- | Creates DatabaseContextExpr necessary to load the type constructor and data constructor into the database.
43 -- | Creates DatabaseContextExpr necessary to load the type constructor and data constructor into the database.
55− toAddTypeExpr :: Proxy a -> DatabaseContextExpr
44+ toAddTypeExpr :: proxy a -> DatabaseContextExpr
56 default toAddTypeExpr :: (Generic a, AtomableG (Rep a)) => proxy a -> DatabaseContextExpr
45 default toAddTypeExpr :: (Generic a, AtomableG (Rep a)) => proxy a -> DatabaseContextExpr
57− toAddTypeExpr _ = toAddTypeExprG (from (undefined :: a)) (toAtomType (Proxy :: Proxy a))
46+ toAddTypeExpr _ = toAddTypeExprG (from (error "insufficient laziness" :: a)) (toAtomType (Proxy :: Proxy a))
58
47
59instance Atomable Integer where
48instance Atomable Integer where
60 toAtom = IntegerAtom
49 toAtom = IntegerAtom
@@ -146,15 +135,23 @@ instance (Atomable a, Atomable b) => Atomable (Either a b) where
146--convert to ADT list
135--convert to ADT list
147instance Atomable a => Atomable [a] where
136instance Atomable a => Atomable [a] where
148 toAtom [] = ConstructedAtom "Empty" (listAtomType (toAtomType (Proxy :: Proxy a))) []
137 toAtom [] = ConstructedAtom "Empty" (listAtomType (toAtomType (Proxy :: Proxy a))) []
149− toAtom (x:xs) = ConstructedAtom "Cons" (listAtomType (toAtomType (Proxy :: Proxy a))) (map toAtom (x:xs))
138+ toAtom (x:xs) = ConstructedAtom "Cons" (listAtomType (toAtomType (Proxy :: Proxy a))) (toAtom x: [toAtom xs])
150
139
151 fromAtom (ConstructedAtom "Empty" _ _) = []
140 fromAtom (ConstructedAtom "Empty" _ _) = []
152− fromAtom (ConstructedAtom "Cons" _ (x:xs)) = fromAtom x:map fromAtom xs
141+ fromAtom (ConstructedAtom "Cons" _ [x,y]) = fromAtom x:fromAtom y
153 fromAtom _ = error "improper fromAtom [a]"
142 fromAtom _ = error "improper fromAtom [a]"
154
143
155 toAtomType _ = ConstructedAtomType "List" (M.singleton "a" (toAtomType (Proxy :: Proxy a)))
144 toAtomType _ = ConstructedAtomType "List" (M.singleton "a" (toAtomType (Proxy :: Proxy a)))
156 toAddTypeExpr _ = NoOperation
145 toAddTypeExpr _ = NoOperation
157
146
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+
158-- Generics
155-- Generics
159class AtomableG g where
156class AtomableG g where
160 --type AtomTG g
157 --type AtomTG g
@@ -170,17 +167,17 @@ class AtomableG g where
170instance (Datatype c, AtomableG a) => AtomableG (M1 D c a) where
167instance (Datatype c, AtomableG a) => AtomableG (M1 D c a) where
171 toAtomG (M1 v) = toAtomG v
168 toAtomG (M1 v) = toAtomG v
172 fromAtomG atom args = M1 <$> fromAtomG atom args
169 fromAtomG atom args = M1 <$> fromAtomG atom args
173− toAtomsG = undefined
170+ toAtomsG = error "invalid toAtomsG in M1 D"
174 toAtomTypeG _ = ConstructedAtomType (T.pack typeName) M.empty -- generics don't allow us to get the type constructor variables- alternatives?
171 toAtomTypeG _ = ConstructedAtomType (T.pack typeName) M.empty -- generics don't allow us to get the type constructor variables- alternatives?
175 where
172 where
176 typeName = datatypeName (undefined :: M1 D c a x)
173 typeName = datatypeName (undefined :: M1 D c a x)
177− toAddTypeExprG (M1 v) (ConstructedAtomType tcName _) = AddTypeConstructor tcDef dataConstructors
174+ toAddTypeExprG ~(M1 v) (ConstructedAtomType tcName _) = AddTypeConstructor tcDef dataConstructors
178 where
175 where
179 tcDef = ADTypeConstructorDef tcName []
176 tcDef = ADTypeConstructorDef tcName []
180 dataConstructors = getConstructorsG v
177 dataConstructors = getConstructorsG v
181 toAddTypeExprG _ _ = NoOperation
178 toAddTypeExprG _ _ = NoOperation
182− getConstructorsG (M1 v) = getConstructorsG v
179+ getConstructorsG ~(M1 v) = getConstructorsG v
183− getConstructorArgsG = undefined
180+ getConstructorArgsG = error "invalid getConstructorArgsG in M1 D"
184
181
185--constructor metadata
182--constructor metadata
186instance (Constructor c, AtomableG a) => AtomableG (M1 C c a) where
183instance (Constructor c, AtomableG a) => AtomableG (M1 C c a) where
@@ -195,11 +192,11 @@ instance (Constructor c, AtomableG a) => AtomableG (M1 C c a) where
195 Nothing
192 Nothing
196 where
193 where
197 dName = T.pack (conName (undefined :: M1 C c a x))
194 dName = T.pack (conName (undefined :: M1 C c a x))
198− fromAtomG _ _ = error "unsupported generic traversal"
195+ fromAtomG _ _ = error "invalid fromAtomG in M1 C"
199− toAtomsG = undefined
196+ toAtomsG = error "invalid toAtomsG in M1 C"
200− toAtomTypeG = undefined
197+ toAtomTypeG = error "invalid toAtomTypeG in M1 C"
201− toAddTypeExprG = undefined
198+ toAddTypeExprG = error "invalid toAddTypeExprG in M1 C"
202− getConstructorsG (M1 v) = [DataConstructorDef (T.pack dName) dArgs]
199+ getConstructorsG ~(M1 v) = [DataConstructorDef (T.pack dName) dArgs]
203 where
200 where
204 dName = conName (undefined :: M1 C c a x)
201 dName = conName (undefined :: M1 C c a x)
205 dArgs = getConstructorArgsG v
202 dArgs = getConstructorArgsG v
@@ -211,9 +208,9 @@ instance (Selector c, AtomableG a) => AtomableG (M1 S c a) where
211 fromAtomG atom args = M1 <$> fromAtomG atom args
208 fromAtomG atom args = M1 <$> fromAtomG atom args
212 toAtomsG (M1 v) = toAtomsG v
209 toAtomsG (M1 v) = toAtomsG v
213 toAtomTypeG (M1 v) = toAtomTypeG v
210 toAtomTypeG (M1 v) = toAtomTypeG v
214− toAddTypeExprG _ _ = undefined
211+ toAddTypeExprG = error "invalid toAddTypeExprG in M1 S"
215− getConstructorsG = undefined
212+ getConstructorsG = error "invalid getConstructorsG in M1 S"
216− getConstructorArgsG (M1 v) = getConstructorArgsG v
213+ getConstructorArgsG ~(M1 v) = getConstructorArgsG v
217
214
218-- field data metadata
215-- field data metadata
219instance (Atomable a) => AtomableG (K1 c a) where
216instance (Atomable a) => AtomableG (K1 c a) where
@@ -223,48 +220,63 @@ instance (Atomable a) => AtomableG (K1 c a) where
223 headatom [] = error "no more atoms for constructor!"
220 headatom [] = error "no more atoms for constructor!"
224 toAtomsG (K1 v) = [toAtom v]
221 toAtomsG (K1 v) = [toAtom v]
225 toAtomTypeG _ = toAtomType (Proxy :: Proxy a)
222 toAtomTypeG _ = toAtomType (Proxy :: Proxy a)
226− toAddTypeExprG _ _ = undefined
223+ toAddTypeExprG = error "invalid toAddTypeExprG in K1"
227− getConstructorsG = undefined
224+ getConstructorsG = error "invalid getConstructorsG in K1"
228− getConstructorArgsG (K1 _) = [DataConstructorDefTypeConstructorArg tCons]
225+ getConstructorArgsG ~(K1 _) = [DataConstructorDefTypeConstructorArg tCons]
229 where
226 where
230− tCons = PrimitiveTypeConstructor primitiveATypeName primitiveAType
231− primitiveAType = toAtomType (Proxy :: Proxy a)
227+ tCons = typeToTypeConstructor $ toAtomType (Proxy :: Proxy a)
232− primitiveATypeName = fromMaybe (error ("primitive type missing: " ++ show primitiveAType)) (foldr (\(PrimitiveTypeConstructorDef name typ, _) acc -> if typ == primitiveAType then Just name else acc) Nothing primitiveTypeConstructorMapping)
228+
233−
229+typeToTypeConstructor :: AtomType -> TypeConstructor
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+
234instance AtomableG U1 where
247instance AtomableG U1 where
235− toAtomG = undefined
248+ toAtomG = error "invalid toAtomG in U1"
236 fromAtomG _ _ = pure U1
249 fromAtomG _ _ = pure U1
237 toAtomsG _ = []
250 toAtomsG _ = []
238− toAtomTypeG = undefined
251+ toAtomTypeG = error "invalid toAtomTypeG in U1"
239− toAddTypeExprG = undefined
252+ toAddTypeExprG = error "invalid toAddTypeExprG in U1"
240− getConstructorsG = undefined
253+ getConstructorsG = error "invalid getConstructorsG in U1"
241 getConstructorArgsG _ = []
254 getConstructorArgsG _ = []
242
255
243-- product types
256-- product types
244instance (AtomableG a, AtomableG b) => AtomableG (a :*: b) where
257instance (AtomableG a, AtomableG b) => AtomableG (a :*: b) where
245 toAtomG = undefined
258 toAtomG = undefined
246− fromAtomG atom args = (:*:) <$> fromAtomG atom [headatom args] <*> fromAtomG atom (tailatoms args)
259+ fromAtomG atom args = (:*:) <$> fromAtomG atom splitargs1 <*> fromAtomG atom splitargs2
247− where headatom (x:_) = x
260+ where splitargs1 = take splitpoint args
248− headatom [] = error "no more atoms in head for product!"
261+ splitargs2 = drop splitpoint args
249− tailatoms (_:xs) = xs
262+ splitpoint = length args `div` 2
250− tailatoms [] = error "no more atoms in tail for product!"
263+ toAtomTypeG = error "invalid toAtomTypeG in :*:"
251− toAtomTypeG = undefined
252 toAtomsG (x :*: y) = toAtomsG x ++ toAtomsG y
264 toAtomsG (x :*: y) = toAtomsG x ++ toAtomsG y
253− toAddTypeExprG _ _ = undefined
265+ toAddTypeExprG = error "invalid toAddTypeExprG in :*:"
254− getConstructorsG = undefined
266+ getConstructorsG = error "invalid getConstructorsG in :*:"
255− getConstructorArgsG (x :*: y) = getConstructorArgsG x ++ getConstructorArgsG y
267+ getConstructorArgsG ~(x :*: y) = getConstructorArgsG x ++ getConstructorArgsG y
256
268
257-- sum types
269-- sum types
258instance (AtomableG a, AtomableG b) => AtomableG (a :+: b) where
270instance (AtomableG a, AtomableG b) => AtomableG (a :+: b) where
259 toAtomG (L1 x) = toAtomG x
271 toAtomG (L1 x) = toAtomG x
260 toAtomG (R1 x) = toAtomG x
272 toAtomG (R1 x) = toAtomG x
261 fromAtomG atom args = (L1 <$> fromAtomG atom args) <|> (R1 <$> fromAtomG atom args)
273 fromAtomG atom args = (L1 <$> fromAtomG atom args) <|> (R1 <$> fromAtomG atom args)
262− toAtomTypeG = undefined
274+ toAtomTypeG = error "invalid toAtomTypeG in :+:"
263 toAtomsG (L1 x) = toAtomsG x
275 toAtomsG (L1 x) = toAtomsG x
264 toAtomsG (R1 x) = toAtomsG x
276 toAtomsG (R1 x) = toAtomsG x
265− toAddTypeExprG _ _ = undefined
277+ toAddTypeExprG = error "invalid toAddTypeExprG in :+:"
266 getConstructorsG _ = getConstructorsG (undefined :: a x) ++ getConstructorsG (undefined :: b x)
278 getConstructorsG _ = getConstructorsG (undefined :: a x) ++ getConstructorsG (undefined :: b x)
267− getConstructorArgsG = undefined
279+ getConstructorArgsG = error "invalid getConstructorArgsG in :+:"
268
280
269--this represents the unimplemented generics traversals which should never be called
281--this represents the unimplemented generics traversals which should never be called
270{-
282{-
src/lib/ProjectM36/Attribute.hs+155−29
@@ -1,3 +1,4 @@
1+{-# OPTIONS_GHC -fno-warn-orphans #-}
1module ProjectM36.Attribute where
2module ProjectM36.Attribute where
2import ProjectM36.Base
3import ProjectM36.Base
3import ProjectM36.Error
4import ProjectM36.Error
@@ -7,18 +8,57 @@ import qualified Data.Vector as V
7import qualified Data.Hashable as Hash
8import qualified Data.Hashable as Hash
8import qualified Data.HashSet as HS
9import qualified Data.HashSet as HS
9import qualified Data.Map as M
10import qualified Data.Map as M
11+import Data.Either
10
12
11arity :: Attributes -> Int
13arity :: Attributes -> Int
12−arity = V.length
14+arity a = V.length (attributesVec a)
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+ }
13
27
14emptyAttributes :: Attributes
28emptyAttributes :: Attributes
15−emptyAttributes = V.empty
29+emptyAttributes = mempty
16
30
17null :: Attributes -> Bool
31null :: Attributes -> Bool
18−null = V.null
32+null a = V.null (attributesVec a)
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)
19
42
20attributesFromList :: [Attribute] -> Attributes
43attributesFromList :: [Attribute] -> Attributes
21−attributesFromList = V.fromList -- . L.nub --too expensive
44+attributesFromList attrsL = Attributes {
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
22
62
23attributeName :: Attribute -> AttributeName
63attributeName :: Attribute -> AttributeName
24attributeName (Attribute name _) = name
64attributeName (Attribute name _) = name
@@ -27,14 +67,16 @@ atomType :: Attribute -> AtomType
27atomType (Attribute _ atype) = atype
67atomType (Attribute _ atype) = atype
28
68
29atomTypes :: Attributes -> V.Vector AtomType
69atomTypes :: Attributes -> V.Vector AtomType
30−atomTypes = V.map atomType
70+atomTypes attrs = V.map atomType (attributesVec attrs)
71+
72+atomTypesList :: Attributes -> [AtomType]
73+atomTypesList = V.toList . atomTypes
31
74
32−--hm- no error-checking here
33addAttribute :: Attribute -> Attributes -> Attributes
75addAttribute :: Attribute -> Attributes -> Attributes
34−addAttribute attr attrs = attrs `V.snoc` attr
76+addAttribute attr attrs = attrs <> singleton attr
35
77
36--if some attribute names overlap but the types do not, then spit back an error
78--if some attribute names overlap but the types do not, then spit back an error
37−joinAttributes :: Attributes -> Attributes -> Either RelationalError Attributes
79+{-joinAttributes :: Attributes -> Attributes -> Either RelationalError Attributes
38joinAttributes attrs1 attrs2 | V.length uniqueOverlappingAttributes /= V.length overlappingAttributes = Left (TupleAttributeTypeMismatchError overlappingAttributes)
80joinAttributes attrs1 attrs2 | V.length uniqueOverlappingAttributes /= V.length overlappingAttributes = Left (TupleAttributeTypeMismatchError overlappingAttributes)
39 | V.length overlappingAttrsDifferentTypes > 0 = Left (TupleAttributeTypeMismatchError overlappingAttrsDifferentTypes)
81 | V.length overlappingAttrsDifferentTypes > 0 = Left (TupleAttributeTypeMismatchError overlappingAttrsDifferentTypes)
40 | otherwise = Right $ vectorUniqueify (attrs1 V.++ attrs2)
82 | otherwise = Right $ vectorUniqueify (attrs1 V.++ attrs2)
@@ -43,20 +85,52 @@ joinAttributes attrs1 attrs2 | V.length uniqueOverlappingAttributes /= V.length
43 attrNames2 = V.map attributeName attrs2
85 attrNames2 = V.map attributeName attrs2
44 uniqueOverlappingAttributes = vectorUniqueify overlappingAttributes
86 uniqueOverlappingAttributes = vectorUniqueify overlappingAttributes
45 overlappingAttributes = V.filter (`V.elem` attrs2) attrs1
87 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+ }
46
106
47addAttributes :: Attributes -> Attributes -> Attributes
107addAttributes :: Attributes -> Attributes -> Attributes
48−addAttributes = (V.++)
108+addAttributes = (<>)
109+
110+member :: Attribute -> Attributes -> Bool
111+member attr attrs = HS.member attr (attributesSet attrs)
49
112
50deleteAttributeName :: AttributeName -> Attributes -> Attributes
113deleteAttributeName :: AttributeName -> Attributes -> Attributes
51−deleteAttributeName attrName = V.filter (\attr -> attributeName attr /= attrName)
114+deleteAttributeName attrName = deleteAttributeNames (S.singleton 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
52
123
53renameAttribute :: AttributeName -> Attribute -> Attribute
124renameAttribute :: AttributeName -> Attribute -> Attribute
54renameAttribute newAttrName (Attribute _ typeo) = Attribute newAttrName typeo
125renameAttribute newAttrName (Attribute _ typeo) = Attribute newAttrName typeo
55
126
56renameAttributes :: AttributeName -> AttributeName -> Attributes -> Attributes
127renameAttributes :: AttributeName -> AttributeName -> Attributes -> Attributes
57−renameAttributes oldAttrName newAttrName = V.map renamer
128+renameAttributes oldAttrName newAttrName attrs = Attributes {
129+ attributesVec = vec
130+ }
58 where
131 where
132+ vec = V.map renamer (attributesVec attrs)
59− renamer attr = if attributeName attr == oldAttrName then
133+ renamer attr = if attributeName attr == oldAttrName then
60 renameAttribute newAttrName attr
134 renameAttribute newAttrName attr
61 else
135 else
62 attr
136 attr
@@ -67,10 +141,13 @@ atomTypeForAttributeName attrName attrs = do
67 return atype
141 return atype
68
142
69attributeForName :: AttributeName -> Attributes -> Either RelationalError Attribute
143attributeForName :: AttributeName -> Attributes -> Either RelationalError Attribute
70−attributeForName attrName attrs = case V.find (\attr -> attributeName attr == attrName) attrs of
144+attributeForName attrName attrs = case V.find (\attr -> attributeName attr == attrName) (attributesVec attrs) of
71 Nothing -> Left (NoSuchAttributeNamesError (S.singleton attrName))
145 Nothing -> Left (NoSuchAttributeNamesError (S.singleton attrName))
72 Just attr -> Right attr
146 Just attr -> Right attr
73
147
148+isAttributeNameContained :: AttributeName -> Attributes -> Bool
149+isAttributeNameContained nam attrs = isRight (attributeForName nam attrs)
150+
74--similar to attributesForNames, but returns error if some names are missing
151--similar to attributesForNames, but returns error if some names are missing
75projectionAttributesForNames :: S.Set AttributeName -> Attributes -> Either RelationalError Attributes
152projectionAttributesForNames :: S.Set AttributeName -> Attributes -> Either RelationalError Attributes
76projectionAttributesForNames names attrsIn =
153projectionAttributesForNames names attrsIn =
@@ -82,15 +159,18 @@ projectionAttributesForNames names attrsIn =
82 missingNames = attributeNamesNotContained names (S.fromList (V.toList (attributeNames attrsIn)))
159 missingNames = attributeNamesNotContained names (S.fromList (V.toList (attributeNames attrsIn)))
83
160
84attributesForNames :: S.Set AttributeName -> Attributes -> Attributes
161attributesForNames :: S.Set AttributeName -> Attributes -> Attributes
85−attributesForNames attrNameSet = V.filter filt
162+attributesForNames attrNameSet attrs = Attributes {
163+ attributesVec = vec
164+ }
86 where
165 where
166+ vec = V.filter filt (attributesVec attrs)
87 filt attr = S.member (attributeName attr) attrNameSet
167 filt attr = S.member (attributeName attr) attrNameSet
88
168
89attributeNameSet :: Attributes -> S.Set AttributeName
169attributeNameSet :: Attributes -> S.Set AttributeName
90−attributeNameSet attrVec = S.fromList $ V.toList $ V.map (\(Attribute name _) -> name) attrVec
170+attributeNameSet attrs = S.fromList $ V.toList $ V.map (\(Attribute name _) -> name) (attributesVec attrs)
91
171
92attributeNames :: Attributes -> V.Vector AttributeName
172attributeNames :: Attributes -> V.Vector AttributeName
93−attributeNames = V.map attributeName
173+attributeNames attrs = V.map attributeName (attributesVec attrs)
94
174
95--checks if set s1 is wholly contained in the set s2
175--checks if set s1 is wholly contained in the set s2
96attributesContained :: Attributes -> Attributes -> Bool
176attributesContained :: Attributes -> Attributes -> Bool
@@ -111,42 +191,88 @@ attributeNamesNotContained subset superset = S.filter (`S.notMember` superset) s
111
191
112-- useful for display
192-- useful for display
113orderedAttributes :: Attributes -> [Attribute]
193orderedAttributes :: Attributes -> [Attribute]
114−orderedAttributes attrs = L.sortBy (\a b -> attributeName a `compare` attributeName b) (V.toList attrs)
194+orderedAttributes attrs = L.sortBy (\a b -> attributeName a `compare` attributeName b) (V.toList (attributesVec attrs))
115
195
116orderedAttributeNames :: Attributes -> [AttributeName]
196orderedAttributeNames :: Attributes -> [AttributeName]
117orderedAttributeNames attrs = map attributeName (orderedAttributes attrs)
197orderedAttributeNames attrs = map attributeName (orderedAttributes attrs)
118
198
119-- take two attribute sets and return an attribute set with the attributes which do not match
199-- 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
120attributesDifference :: Attributes -> Attributes -> Attributes
201attributesDifference :: Attributes -> Attributes -> Attributes
121−attributesDifference attrsA attrsB = V.fromList $ diff (V.toList attrsA) (V.toList attrsB)
202+{-attributesDifference attrsA attrsB = V.fromList $ diff (V.toList attrsA) (V.toList attrsB)
122 where
203 where
123 diff a b = (a L.\\ b) ++ (b L.\\ a)
204 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)
124
219
125vectorUniqueify :: (Hash.Hashable a, Eq a) => V.Vector a -> V.Vector a
220vectorUniqueify :: (Hash.Hashable a, Eq a) => V.Vector a -> V.Vector a
126vectorUniqueify vecIn = V.fromList $ HS.toList $ HS.fromList $ V.toList vecIn
221vectorUniqueify vecIn = V.fromList $ HS.toList $ HS.fromList $ V.toList vecIn
127
222
128--check that each attribute only appears once
223--check that each attribute only appears once
129verifyAttributes :: Attributes -> Either RelationalError Attributes
224verifyAttributes :: Attributes -> Either RelationalError Attributes
130−verifyAttributes attrs = if collapsedAttrs /= attrs then
225+verifyAttributes attrs =
226+ if vecSet == attributesSet attrs then
227+ pure attrs
228+ else
131− Left (TupleAttributeTypeMismatchError (attributesDifference collapsedAttrs attrs))
229+ Left (TupleAttributeTypeMismatchError diffAttrs)
132− else
230+ where
133− Right attrs
231+ vecSet = V.foldr' HS.insert HS.empty (attributesVec 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+ }
134 where
243 where
135− collapsedAttrs = vectorUniqueify attrs
244+ vec = V.drop c (attributesVec attrs)
136
245
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)
137attributesEqual :: Attributes -> Attributes -> Bool
252attributesEqual :: Attributes -> Attributes -> Bool
138−attributesEqual attrs1 attrs2 = V.null (attributesDifference attrs1 attrs2)
253+attributesEqual attrsA attrsB =
254+ attributesVec attrsA == attributesVec attrsB ||
255+ attributesSet attrsA == attributesSet attrsB
139
256
140attributesAsMap :: Attributes -> M.Map AttributeName Attribute
257attributesAsMap :: Attributes -> M.Map AttributeName Attribute
141−attributesAsMap attrs = (M.fromList . V.toList) (V.map (\attr -> (attributeName attr, attr)) attrs)
258+attributesAsMap attrs = V.foldr' (\attr acc -> M.insert (attributeName attr) attr acc) mempty (attributesVec attrs)
259+
142
260
143-- | Left-biased union of attributes.
261-- | Left-biased union of attributes.
144union :: Attributes -> Attributes -> Attributes
262union :: Attributes -> Attributes -> Attributes
145−union attrsA attrsB = V.fromList (M.elems unioned)
263+union attrsA attrsB = Attributes {
264+ attributesVec = vec
265+ --,attributesSet = hset
266+ }
146 where
267 where
147− unioned = M.union (attributesAsMap attrsA) (attributesAsMap attrsB)
268+ hset = HS.union (attributesSet attrsA) (attributesSet attrsB)
269+ vec = HS.foldr (flip V.snoc) mempty hset
148
270
149intersection :: Attributes -> Attributes -> Attributes
271intersection :: Attributes -> Attributes -> Attributes
150−intersection attrsA attrsB = V.fromList (M.elems intersected)
272+intersection attrsA attrsB = Attributes {
273+ attributesVec = vec
274+ --,attributesSet = hset
275+ }
151 where
276 where
152− intersected = M.intersection (attributesAsMap attrsA) (attributesAsMap attrsB)
277+ hset = HS.intersection (attributesSet attrsA) (attributesSet attrsB)
278+ vec = HS.foldr (flip V.snoc) mempty hset
src/lib/ProjectM36/AttributeExpr.hsnew file+7
@@ -0,0 +1,7 @@
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+3−2
@@ -3,8 +3,9 @@ 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 :: AttributeNames
6+empty :: AttributeNamesBase a
7empty = AttributeNames S.empty
7empty = AttributeNames S.empty
8
8
9−all :: AttributeNames
9+all :: AttributeNamesBase a
10all = InvertedAttributeNames S.empty
10all = InvertedAttributeNames S.empty
11+
src/lib/ProjectM36/Base.hs+234−117
@@ -1,9 +1,12 @@
1−{-# LANGUAGE ExistentialQuantification,DeriveGeneric,DeriveAnyClass, TypeSynonymInstances, FlexibleInstances #-}
1+{-# LANGUAGE ExistentialQuantification,DeriveGeneric,DeriveAnyClass,FlexibleInstances,OverloadedStrings, DeriveTraversable, DerivingVia, TemplateHaskell, TypeFamilies #-}
2{-# OPTIONS_GHC -fno-warn-orphans #-}
2{-# OPTIONS_GHC -fno-warn-orphans #-}
3+
3module ProjectM36.Base where
4module ProjectM36.Base where
4import ProjectM36.DatabaseContextFunctionError
5import ProjectM36.DatabaseContextFunctionError
5import ProjectM36.AtomFunctionError
6import ProjectM36.AtomFunctionError
7+import ProjectM36.MerkleHash
6
8
9+import Data.Functor.Foldable.TH
7import qualified Data.Map as M
10import qualified Data.Map as M
8import qualified Data.HashSet as HS
11import qualified Data.HashSet as HS
9import Data.Hashable (Hashable, hashWithSalt)
12import Data.Hashable (Hashable, hashWithSalt)
@@ -12,19 +15,21 @@ import Data.UUID (UUID)
12import Control.DeepSeq (NFData, rnf)
15import Control.DeepSeq (NFData, rnf)
13import Control.DeepSeq.Generics (genericRnf)
16import Control.DeepSeq.Generics (genericRnf)
14import GHC.Generics (Generic)
17import GHC.Generics (Generic)
18+import GHC.Stack
15import qualified Data.Vector as V
19import qualified Data.Vector as V
16import qualified Data.List as L
20import qualified Data.List as L
17import Data.Text (Text,unpack)
21import Data.Text (Text,unpack)
18−import Data.Binary
19−import Data.Vector.Binary()
20import Data.Time.Clock
22import 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)
24import Data.Typeable
25import Data.Typeable
25import Data.ByteString (ByteString)
26import Data.ByteString (ByteString)
27+import qualified Data.List.NonEmpty as NE
28+import Data.Vector.Instances ()
26
29
27type StringType = Text
30type StringType = Text
31+
32+type DatabaseName = String
28
33
29-- | Database atoms are the smallest, undecomposable units of a tuple. Common examples are integers, text, or unique identity keys.
34-- | Database atoms are the smallest, undecomposable units of a tuple. Common examples are integers, text, or unique identity keys.
30data Atom = IntegerAtom Integer |
35data Atom = IntegerAtom Integer |
@@ -35,12 +40,10 @@ data Atom = IntegerAtom Integer |
35 DateTimeAtom UTCTime |
40 DateTimeAtom UTCTime |
36 ByteStringAtom ByteString |
41 ByteStringAtom ByteString |
37 BoolAtom Bool |
42 BoolAtom Bool |
38− IntervalAtom Atom Atom OpenInterval OpenInterval |
39 RelationAtom Relation |
43 RelationAtom Relation |
44+ RelationalExprAtom RelationalExpr | --used for returning inc deps
40 ConstructedAtom DataConstructorName AtomType [Atom]
45 ConstructedAtom DataConstructorName AtomType [Atom]
41− deriving (Eq, Show, Binary, Typeable, NFData, Generic)
46+ deriving (Eq, Show, Typeable, NFData, Generic, Read)
42−
43−type OpenInterval = Bool
44
47
45instance Hashable Atom where
48instance Hashable Atom where
46 hashWithSalt salt (ConstructedAtom dConsName _ atoms) = salt `hashWithSalt` atoms
49 hashWithSalt salt (ConstructedAtom dConsName _ atoms) = salt `hashWithSalt` atoms
@@ -53,18 +56,8 @@ instance Hashable Atom where
53 hashWithSalt salt (DateTimeAtom dt) = salt `hashWithSalt` dt
56 hashWithSalt salt (DateTimeAtom dt) = salt `hashWithSalt` dt
54 hashWithSalt salt (ByteStringAtom bs) = salt `hashWithSalt` bs
57 hashWithSalt salt (ByteStringAtom bs) = salt `hashWithSalt` bs
55 hashWithSalt salt (BoolAtom b) = salt `hashWithSalt` b
58 hashWithSalt salt (BoolAtom b) = salt `hashWithSalt` b
56− hashWithSalt salt (IntervalAtom a1 a2 bo be) = salt `hashWithSalt` a1 `hashWithSalt` a2 `hashWithSalt` bo `hashWithSalt` be
57 hashWithSalt salt (RelationAtom r) = salt `hashWithSalt` r
59 hashWithSalt salt (RelationAtom r) = salt `hashWithSalt` r
58−
60+ hashWithSalt salt (RelationalExprAtom re) = salt `hashWithSalt` re
59−instance Binary UTCTime where
60− put utc = put $ toRational (utcTimeToPOSIXSeconds utc)
61− get = posixSecondsToUTCTime . fromRational <$> (get :: Get Rational)
62−
63−instance Binary Day where
64− put day = put $ toGregorian day
65− get = do
66− (y,m,d) <- get :: Get (Integer, Int, Int)
67− return (fromGregorian y m d)
68
61
69-- 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.
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.
70-- | The AtomType uniquely identifies the type of a atom.
63-- | The AtomType uniquely identifies the type of a atom.
@@ -76,13 +69,17 @@ data AtomType = IntAtomType |
76 DateTimeAtomType |
69 DateTimeAtomType |
77 ByteStringAtomType |
70 ByteStringAtomType |
78 BoolAtomType |
71 BoolAtomType |
79− IntervalAtomType AtomType |
80 RelationAtomType Attributes |
72 RelationAtomType Attributes |
81 ConstructedAtomType TypeConstructorName TypeVarMap |
73 ConstructedAtomType TypeConstructorName TypeVarMap |
74+ RelationalExprAtomType |
82 TypeVariableType TypeVarName
75 TypeVariableType TypeVarName
83 --wildcard used in Atom Functions and tuples for data constructors which don't provide all arguments to the type constructor
76 --wildcard used in Atom Functions and tuples for data constructors which don't provide all arguments to the type constructor
84− deriving (Eq, NFData, Generic, Binary, Show)
77+ deriving (Eq, NFData, Generic, Show, Read, Hashable)
85−
78+
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
86type TypeVarMap = M.Map TypeVarName AtomType
83type TypeVarMap = M.Map TypeVarName AtomType
87
84
88instance Hashable TypeVarMap where
85instance Hashable TypeVarMap where
@@ -97,25 +94,37 @@ isRelationAtomType _ = False
97type AttributeName = StringType
94type AttributeName = StringType
98
95
99-- | A relation's type is composed of attribute names and types.
96-- | A relation's type is composed of attribute names and types.
100−data Attribute = Attribute AttributeName AtomType deriving (Eq, Show, Generic, NFData, Binary)
97+data Attribute = Attribute AttributeName AtomType deriving (Eq, Show, Read, Generic, NFData)
101
98
102instance Hashable Attribute where
99instance Hashable Attribute where
103 hashWithSalt salt (Attribute attrName _) = hashWithSalt salt attrName
100 hashWithSalt salt (Attribute attrName _) = hashWithSalt salt attrName
104
101
102+type AttributesHash = Int
103+
105-- | 'Attributes' represent the head of a relation.
104-- | 'Attributes' represent the head of a relation.
105+newtype Attributes = Attributes {
106−type Attributes = V.Vector Attribute
106+ attributesVec :: 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
107
122
108−-- | Equality function for a set of attributes.
109−attributesEqual :: Attributes -> Attributes -> Bool
110−attributesEqual attrs1 attrs2 = attrsAsSet attrs1 == attrsAsSet attrs2
111− where
112− attrsAsSet = HS.fromList . V.toList
113−
114sortedAttributesIndices :: Attributes -> [(Int, Attribute)]
123sortedAttributesIndices :: Attributes -> [(Int, Attribute)]
115−sortedAttributesIndices attrs = L.sortBy (\(_, Attribute name1 _) (_,Attribute name2 _) -> compare name1 name2) $ V.toList (V.indexed attrs)
124+sortedAttributesIndices attrs = L.sortBy (\(_, Attribute name1 _) (_,Attribute name2 _) -> compare name1 name2) $ V.toList (V.indexed (attributesVec attrs))
116
125
117-- | The relation's tuple set is the body of the relation.
126-- | The relation's tuple set is the body of the relation.
118−newtype RelationTupleSet = RelationTupleSet { asList :: [RelationTuple] } deriving (Hashable, Show, Generic, Binary)
127+newtype RelationTupleSet = RelationTupleSet { asList :: [RelationTuple] } deriving (Hashable, Show, Generic, Read)
119
128
120instance Read Relation where
129instance Read Relation where
121 readsPrec = error "relation read not supported"
130 readsPrec = error "relation read not supported"
@@ -131,8 +140,8 @@ instance NFData RelationTupleSet where rnf = genericRnf
131instance Hashable RelationTuple where
140instance Hashable RelationTuple where
132 --sanity check the tuple for attribute and tuple counts
141 --sanity check the tuple for attribute and tuple counts
133 --this bit me when tuples were being hashed before being verified
142 --this bit me when tuples were being hashed before being verified
134− hashWithSalt salt (RelationTuple attrs tupVec) = if V.length attrs /= V.length tupVec then
143+ hashWithSalt salt (RelationTuple attrs tupVec) = if V.length (attributesVec attrs) /= V.length tupVec then
135− error "invalid tuple: attributes and tuple count mismatch"
144+ error ("invalid tuple: attributes and tuple count mismatch " <> show (attributesVec attrs, tupVec))
136 else
145 else
137 salt `hashWithSalt`
146 salt `hashWithSalt`
138 sortedAttrs `hashWithSalt`
147 sortedAttrs `hashWithSalt`
@@ -143,24 +152,23 @@ instance Hashable RelationTuple where
143 sortedTupVec = V.map (\(index, _) -> tupVec V.! index) $ V.fromList sortedAttrsIndices
152 sortedTupVec = V.map (\(index, _) -> tupVec V.! index) $ V.fromList sortedAttrsIndices
144
153
145-- | A tuple is a set of attributes mapped to their 'Atom' values.
154-- | A tuple is a set of attributes mapped to their 'Atom' values.
146−data RelationTuple = RelationTuple Attributes (V.Vector Atom) deriving (Show, Generic)
155+data RelationTuple = RelationTuple Attributes (V.Vector Atom) deriving (Show, Read, Generic)
147−
148−instance Binary RelationTuple
149
156
150instance Eq RelationTuple where
157instance Eq RelationTuple where
151− (==) tuple1@(RelationTuple attrs1 _) tuple2@(RelationTuple attrs2 _) = attributesEqual attrs1 attrs2 && atomsEqual
158+ tuple1@(RelationTuple attrs1 _) == tuple2@(RelationTuple attrs2 _) =
159+ attrs1 == attrs2 && atomsEqual
152 where
160 where
153− atomForAttribute attr (RelationTuple attrs tupVec) = case V.findIndex (== attr) attrs of
161+ atomForAttribute attr (RelationTuple attrs tupVec) = case V.findIndex (== attr) (attributesVec attrs) of
154− Nothing -> Nothing
162+ Nothing -> Nothing
155− Just index -> tupVec V.!? index
163+ Just index -> tupVec V.!? index
156− atomsEqual = V.all (== True) $ V.map (\attr -> atomForAttribute attr tuple1 == atomForAttribute attr tuple2) attrs1
164+ atomsEqual = V.all (== True) $ V.map (\attr -> atomForAttribute attr tuple1 == atomForAttribute attr tuple2) (attributesVec attrs1)
157
165
158instance NFData RelationTuple where rnf = genericRnf
166instance NFData RelationTuple where rnf = genericRnf
159
167
160data Relation = Relation Attributes RelationTupleSet deriving (Show, Generic,Typeable)
168data Relation = Relation Attributes RelationTupleSet deriving (Show, Generic,Typeable)
161
169
162instance Eq Relation where
170instance Eq Relation where
163− Relation attrs1 tupSet1 == Relation attrs2 tupSet2 = attributesEqual attrs1 attrs2 && tupSet1 == tupSet2
171+ Relation attrs1 tupSet1 == Relation attrs2 tupSet2 = attrs1 == attrs2 && tupSet1 == tupSet2
164
172
165instance NFData Relation where rnf = genericRnf
173instance NFData Relation where rnf = genericRnf
166
174
@@ -171,8 +179,6 @@ instance Hashable Relation where
171 where
179 where
172 sortedAttrs = map snd (sortedAttributesIndices attrs)
180 sortedAttrs = map snd (sortedAttributesIndices attrs)
173
181
174−instance Binary Relation
175−
176-- | Used to represent the number of tuples in a relation.
182-- | Used to represent the number of tuples in a relation.
177data RelationCardinality = Countable | Finite Int deriving (Eq, Show, Generic, Ord)
183data RelationCardinality = Countable | Finite Int deriving (Eq, Show, Generic, Ord)
178
184
@@ -184,7 +190,7 @@ type RelationalExpr = RelationalExprBase ()
184-- | A relational expression represents query (read) operations on a database.
190-- | A relational expression represents query (read) operations on a database.
185data RelationalExprBase a =
191data RelationalExprBase a =
186 --- | Create a relation from tuple expressions.
192 --- | Create a relation from tuple expressions.
187− MakeRelationFromExprs (Maybe [AttributeExprBase a]) [TupleExprBase a] |
193+ MakeRelationFromExprs (Maybe [AttributeExprBase a]) (TupleExprsBase a) |
188 --- | Create and reference a relation from attributes and a tuple set.
194 --- | Create and reference a relation from attributes and a tuple set.
189 MakeStaticRelation Attributes RelationTupleSet |
195 MakeStaticRelation Attributes RelationTupleSet |
190 --- | Reference an existing relation in Haskell-space.
196 --- | Reference an existing relation in Haskell-space.
@@ -193,7 +199,7 @@ data RelationalExprBase a =
193 --in Tutorial D, relational variables pick up the type of the first relation assigned to them
199 --in Tutorial D, relational variables pick up the type of the first relation assigned to them
194 --relational variables should also be able to be explicitly-typed like in Haskell
200 --relational variables should also be able to be explicitly-typed like in Haskell
195 --- | Reference a relation variable by its name.
201 --- | Reference a relation variable by its name.
196− RelationVariable RelVarName a |
202+ RelationVariable RelVarName a |
197 --- | Create a projection over attribute names. (Note that the 'AttributeNames' structure allows for the names to be inverted.)
203 --- | Create a projection over attribute names. (Note that the 'AttributeNames' structure allows for the names to be inverted.)
198 Project (AttributeNamesBase a) (RelationalExprBase a) |
204 Project (AttributeNamesBase a) (RelationalExprBase a) |
199 --- | Create a union of two relational expressions. The expressions should have identical attributes.
205 --- | Create a union of two relational expressions. The expressions should have identical attributes.
@@ -213,12 +219,21 @@ data RelationalExprBase a =
213 --- | Returns the true relation iff
219 --- | Returns the true relation iff
214 Equals (RelationalExprBase a) (RelationalExprBase a) |
220 Equals (RelationalExprBase a) (RelationalExprBase a) |
215 NotEquals (RelationalExprBase a) (RelationalExprBase a) |
221 NotEquals (RelationalExprBase a) (RelationalExprBase a) |
216− Extend (ExtendTupleExprBase a) (RelationalExprBase a)
222+ Extend (ExtendTupleExprBase a) (RelationalExprBase a) |
217 --Summarize :: AtomExpr -> AttributeName -> RelationalExpr -> RelationalExpr -> RelationalExpr -- a special case of Extend
223 --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)
218− deriving (Show, Eq, Generic, NFData)
226+ deriving (Show, Read, Eq, Generic, NFData, Foldable, Functor, Traversable)
219−
227+
220−instance Binary RelationalExpr
228+instance Hashable RelationalExpr
221−
229+
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+
222type NotificationName = StringType
237type NotificationName = StringType
223type Notifications = M.Map NotificationName Notification
238type Notifications = M.Map NotificationName Notification
224
239
@@ -228,20 +243,22 @@ data Notification = Notification {
228 reportOldExpr :: RelationalExpr, --run the expression in the pre-change context
243 reportOldExpr :: RelationalExpr, --run the expression in the pre-change context
229 reportNewExpr :: RelationalExpr --run the expression in the post-change context
244 reportNewExpr :: RelationalExpr --run the expression in the post-change context
230 }
245 }
231− deriving (Show, Eq, Binary, Generic, NFData)
246+ deriving (Show, Eq, Generic, NFData)
232
247
233type TypeVarName = StringType
248type TypeVarName = StringType
234
249
235-- | Metadata definition for type constructors such as @data Either a b@.
250-- | Metadata definition for type constructors such as @data Either a b@.
236data TypeConstructorDef = ADTypeConstructorDef TypeConstructorName [TypeVarName] |
251data TypeConstructorDef = ADTypeConstructorDef TypeConstructorName [TypeVarName] |
237 PrimitiveTypeConstructorDef TypeConstructorName AtomType
252 PrimitiveTypeConstructorDef TypeConstructorName AtomType
238− deriving (Show, Generic, Binary, Eq, NFData)
253+ deriving (Show, Generic, Eq, NFData, Hashable, Read)
239
254
240-- | Found in data constructors and type declarations: Left (Either Int Text) | Right Int
255-- | Found in data constructors and type declarations: Left (Either Int Text) | Right Int
256+type TypeConstructor = TypeConstructorBase ()
241−data TypeConstructor = ADTypeConstructor TypeConstructorName [TypeConstructor] |
257+data TypeConstructorBase a = ADTypeConstructor TypeConstructorName [TypeConstructor] |
242− PrimitiveTypeConstructor TypeConstructorName AtomType |
258+ PrimitiveTypeConstructor TypeConstructorName AtomType |
259+ RelationAtomTypeConstructor [AttributeExprBase a] |
243− TypeVariable TypeVarName
260+ TypeVariable TypeVarName
244− deriving (Show, Generic, Binary, Eq, NFData)
261+ deriving (Show, Generic, Eq, NFData, Hashable, Read)
245
262
246type TypeConstructorMapping = [(TypeConstructorDef, DataConstructorDefs)]
263type TypeConstructorMapping = [(TypeConstructorDef, DataConstructorDefs)]
247
264
@@ -251,16 +268,23 @@ type DataConstructorName = StringType
251type AtomTypeName = StringType
268type AtomTypeName = StringType
252
269
253-- | Used to define a data constructor in a type constructor context such as @Left a | Right b@
270-- | Used to define a data constructor in a type constructor context such as @Left a | Right b@
254−data DataConstructorDef = DataConstructorDef DataConstructorName [DataConstructorDefArg] deriving (Eq, Show, Binary, Generic, NFData)
271+data DataConstructorDef = DataConstructorDef DataConstructorName [DataConstructorDefArg] deriving (Eq, Show, Generic, NFData, Hashable, Read)
255
272
256type DataConstructorDefs = [DataConstructorDef]
273type DataConstructorDefs = [DataConstructorDef]
257
274
258data DataConstructorDefArg = DataConstructorDefTypeConstructorArg TypeConstructor |
275data DataConstructorDefArg = DataConstructorDefTypeConstructorArg TypeConstructor |
259 DataConstructorDefTypeVarNameArg TypeVarName
276 DataConstructorDefTypeVarNameArg TypeVarName
260− deriving (Show, Generic, Binary, Eq, NFData)
277+ deriving (Show, Generic, Eq, NFData, Hashable, Read)
261
278
262type InclusionDependencies = M.Map IncDepName InclusionDependency
279type InclusionDependencies = M.Map IncDepName InclusionDependency
263−type RelationVariables = M.Map RelVarName Relation
280+type RelationVariables = M.Map RelVarName GraphRefRelationalExpr
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
264
288
265type SchemaName = StringType
289type SchemaName = StringType
266
290
@@ -268,17 +292,18 @@ type Subschemas = M.Map SchemaName Schema
268
292
269-- | Every transaction has one concrete database context and any number of isomorphic subschemas.
293-- | Every transaction has one concrete database context and any number of isomorphic subschemas.
270data Schemas = Schemas DatabaseContext Subschemas
294data Schemas = Schemas DatabaseContext Subschemas
295+ deriving (Generic)
271
296
272-- | The DatabaseContext is a snapshot of a database's evolving state and contains everything a database client can change over time.
297-- | The DatabaseContext is a snapshot of a database's evolving state and contains everything a database client can change over time.
273-- 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.
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.
274newtype Schema = Schema SchemaIsomorphs
299newtype Schema = Schema SchemaIsomorphs
275− deriving (Generic, Binary)
300+ deriving (Generic)
276
301
277data SchemaIsomorph = IsoRestrict RelVarName RestrictionPredicateExpr (RelVarName, RelVarName) |
302data SchemaIsomorph = IsoRestrict RelVarName RestrictionPredicateExpr (RelVarName, RelVarName) |
278 IsoRename RelVarName RelVarName |
303 IsoRename RelVarName RelVarName |
279 IsoUnion (RelVarName, RelVarName) RestrictionPredicateExpr RelVarName --maps two relvars to one relvar
304 IsoUnion (RelVarName, RelVarName) RestrictionPredicateExpr RelVarName --maps two relvars to one relvar
280 -- IsoTypeConstructor in morphAttrExpr
305 -- IsoTypeConstructor in morphAttrExpr
281− deriving (Generic, Binary, Show)
306+ deriving (Generic, Show)
282
307
283type SchemaIsomorphs = [SchemaIsomorph]
308type SchemaIsomorphs = [SchemaIsomorph]
284
309
@@ -294,24 +319,28 @@ data DatabaseContext = DatabaseContext {
294type IncDepName = StringType
319type IncDepName = StringType
295
320
296-- | Inclusion dependencies represent every possible database constraint. Constraints enforce specific, arbitrarily-complex rules to which the database context's relation variables must adhere unconditionally.
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.
297−data InclusionDependency = InclusionDependency RelationalExpr RelationalExpr deriving (Show, Eq, Generic, NFData)
322+data InclusionDependency = InclusionDependency RelationalExpr RelationalExpr deriving (Show, Eq, Generic, NFData, Hashable, Read)
298−
299−instance Binary InclusionDependency
300
323
301type AttributeNameAtomExprMap = M.Map AttributeName AtomExpr
324type AttributeNameAtomExprMap = M.Map AttributeName AtomExpr
302
325
303--used for returning information about individual expressions
326--used for returning information about individual expressions
304type DatabaseContextExprName = StringType
327type DatabaseContextExprName = StringType
305
328
329+type DatabaseContextExpr = DatabaseContextExprBase ()
330+
331+instance Hashable DatabaseContextExpr
332+
333+type GraphRefDatabaseContextExpr = DatabaseContextExprBase GraphRefTransactionMarker
334+
306-- | Database context expressions modify the database context.
335-- | Database context expressions modify the database context.
307−data DatabaseContextExpr =
336+data DatabaseContextExprBase a =
308 NoOperation |
337 NoOperation |
309− Define RelVarName [AttributeExpr] |
338+ Define RelVarName [AttributeExprBase a] |
310 Undefine RelVarName | --forget existence of relvar X
339 Undefine RelVarName | --forget existence of relvar X
311− Assign RelVarName RelationalExpr |
340+ Assign RelVarName (RelationalExprBase a) |
312− Insert RelVarName RelationalExpr |
341+ Insert RelVarName (RelationalExprBase a) |
313− Delete RelVarName RestrictionPredicateExpr |
342+ Delete RelVarName (RestrictionPredicateExprBase a) |
314− Update RelVarName AttributeNameAtomExprMap RestrictionPredicateExpr |
343+ Update RelVarName AttributeNameAtomExprMap (RestrictionPredicateExprBase a) |
315
344
316 AddInclusionDependency IncDepName InclusionDependency |
345 AddInclusionDependency IncDepName InclusionDependency |
317 RemoveInclusionDependency IncDepName |
346 RemoveInclusionDependency IncDepName |
@@ -327,23 +356,36 @@ data DatabaseContextExpr =
327
356
328 RemoveDatabaseContextFunction DatabaseContextFunctionName |
357 RemoveDatabaseContextFunction DatabaseContextFunctionName |
329
358
330− ExecuteDatabaseContextFunction DatabaseContextFunctionName [AtomExpr] |
359+ ExecuteDatabaseContextFunction DatabaseContextFunctionName [AtomExprBase a] |
331
360
332− MultipleExpr [DatabaseContextExpr]
361+ MultipleExpr [DatabaseContextExprBase a]
333− deriving (Show, Eq, Binary, Generic)
362+ deriving (Show, Read, Eq, Generic, NFData)
363+
364+instance Hashable (M.Map AttributeName AtomExpr) where
365+ hashWithSalt salt m = salt `hashWithSalt` M.toList m
334
366
335type ObjModuleName = StringType
367type ObjModuleName = StringType
336type ObjFunctionName = StringType
368type ObjFunctionName = StringType
337−
369+type Range = (Int,Int)
338-- | Adding an atom function should be nominally a DatabaseExpr except for the fact that it cannot be performed purely. Thus, we create the DatabaseContextIOExpr.
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.
371+data DatabaseContextIOExprBase a =
339−data DatabaseContextIOExpr = AddAtomFunction AtomFunctionName [TypeConstructor] AtomFunctionBodyScript |
372+ AddAtomFunction AtomFunctionName [TypeConstructor] AtomFunctionBodyScript |
340− LoadAtomFunctions ObjModuleName ObjFunctionName FilePath |
373+ LoadAtomFunctions ObjModuleName ObjFunctionName FilePath |
341− AddDatabaseContextFunction DatabaseContextFunctionName [TypeConstructor] DatabaseContextFunctionBodyScript |
374+ AddDatabaseContextFunction DatabaseContextFunctionName [TypeConstructor] DatabaseContextFunctionBodyScript |
342− LoadDatabaseContextFunctions ObjModuleName ObjFunctionName FilePath
375+ LoadDatabaseContextFunctions ObjModuleName ObjFunctionName FilePath |
376+ CreateArbitraryRelation RelVarName [AttributeExprBase a] Range
343− deriving (Show, Eq, Generic, Binary)
377+ deriving (Show, Eq, Generic)
378+
379+type GraphRefDatabaseContextIOExpr = DatabaseContextIOExprBase GraphRefTransactionMarker
380+
381+type DatabaseContextIOExpr = DatabaseContextIOExprBase ()
344
382
345type RestrictionPredicateExpr = RestrictionPredicateExprBase ()
383type RestrictionPredicateExpr = RestrictionPredicateExprBase ()
346
384
385+instance Hashable RestrictionPredicateExpr
386+
387+type GraphRefRestrictionPredicateExpr = RestrictionPredicateExprBase GraphRefTransactionMarker
388+
347-- | Restriction predicates are boolean algebra components which, when composed, indicate whether or not a tuple should be retained during a restriction (filtering) operation.
389-- | Restriction predicates are boolean algebra components which, when composed, indicate whether or not a tuple should be retained during a restriction (filtering) operation.
348data RestrictionPredicateExprBase a =
390data RestrictionPredicateExprBase a =
349 TruePredicate |
391 TruePredicate |
@@ -353,9 +395,7 @@ data RestrictionPredicateExprBase a =
353 RelationalExprPredicate (RelationalExprBase a) | --type must be same as true and false relations (no attributes)
395 RelationalExprPredicate (RelationalExprBase a) | --type must be same as true and false relations (no attributes)
354 AtomExprPredicate (AtomExprBase a) | --atom must evaluate to boolean
396 AtomExprPredicate (AtomExprBase a) | --atom must evaluate to boolean
355 AttributeEqualityPredicate AttributeName (AtomExprBase a) -- relationalexpr must result in relation with single tuple
397 AttributeEqualityPredicate AttributeName (AtomExprBase a) -- relationalexpr must result in relation with single tuple
356− deriving (Show, Eq, Generic, NFData)
398+ deriving (Show, Read, Eq, Generic, NFData, Foldable, Functor, Traversable)
357−
358−instance Binary RestrictionPredicateExpr
359
399
360-- child + parent links
400-- child + parent links
361-- | 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.
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.
@@ -365,32 +405,42 @@ type TransactionHeads = M.Map HeadName Transaction
365
405
366-- | The transaction graph is the global database's state which references every committed transaction.
406-- | The transaction graph is the global database's state which references every committed transaction.
367data TransactionGraph = TransactionGraph TransactionHeads (S.Set Transaction)
407data TransactionGraph = TransactionGraph TransactionHeads (S.Set Transaction)
368−
408+ deriving Generic
369−transactionsForGraph :: TransactionGraph -> S.Set Transaction
370−transactionsForGraph (TransactionGraph _ t) = t
371
409
372transactionHeadsForGraph :: TransactionGraph -> TransactionHeads
410transactionHeadsForGraph :: TransactionGraph -> TransactionHeads
373−transactionHeadsForGraph (TransactionGraph heads _) = heads
411+transactionHeadsForGraph (TransactionGraph hs _) = hs
412+
413+transactionsForGraph :: TransactionGraph -> S.Set Transaction
414+transactionsForGraph (TransactionGraph _ ts) = ts
374
415
375-- | Every transaction has context-specific information attached to it.
416-- | 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).
376−data TransactionInfo = TransactionInfo TransactionId (S.Set TransactionId) UTCTime | -- 1 parent + n children
418+data TransactionInfo = TransactionInfo {
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
377− MergeTransactionInfo TransactionId TransactionId (S.Set TransactionId) UTCTime -- 2 parents, n children
427+ MergeTransactionInfo TransactionId TransactionId TransactionDiffs UTCTime -- 2 parents, n children
378− deriving(Show, Generic)
428+ deriving (Show, Generic)
379−
429+-}
380−instance Binary TransactionInfo
381
430
382-- | Every set of modifications made to the database are atomically committed to the transaction graph as a transaction.
431-- | Every set of modifications made to the database are atomically committed to the transaction graph as a transaction.
383type TransactionId = UUID
432type TransactionId = UUID
384
433
385data Transaction = Transaction TransactionId TransactionInfo Schemas
434data Transaction = Transaction TransactionId TransactionInfo Schemas
435+ deriving Generic
386
436
387−--instance Binary Transaction
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.
388−
438+data DisconnectedTransaction = DisconnectedTransaction TransactionId Schemas DirtyFlag
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+
389type DirtyFlag = Bool
441type DirtyFlag = Bool
390
442
391−-- | 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.
443+type TransactionDiffExpr = DatabaseContextExpr
392−data DisconnectedTransaction = DisconnectedTransaction TransactionId Schemas DirtyFlag --parentID, context- the context here represents the singular concrete context from the schema
393−--the dirty flag indicates that the database context has diverged from its parent's context
394
444
395transactionId :: Transaction -> TransactionId
445transactionId :: Transaction -> TransactionId
396transactionId (Transaction tid _ _) = tid
446transactionId (Transaction tid _ _) = tid
@@ -406,24 +456,28 @@ instance Ord Transaction where
406
456
407type AtomExpr = AtomExprBase ()
457type AtomExpr = AtomExprBase ()
408
458
459+instance Hashable AtomExpr
460+
461+type GraphRefAtomExpr = AtomExprBase GraphRefTransactionMarker
462+
409-- | An atom expression represents an action to take when extending a relation or when statically defining a relation or a new tuple.
463-- | An atom expression represents an action to take when extending a relation or when statically defining a relation or a new tuple.
410data AtomExprBase a = AttributeAtomExpr AttributeName |
464data AtomExprBase a = AttributeAtomExpr AttributeName |
411 NakedAtomExpr Atom |
465 NakedAtomExpr Atom |
412 FunctionAtomExpr AtomFunctionName [AtomExprBase a] a |
466 FunctionAtomExpr AtomFunctionName [AtomExprBase a] a |
413 RelationAtomExpr (RelationalExprBase a) |
467 RelationAtomExpr (RelationalExprBase a) |
414 ConstructedAtomExpr DataConstructorName [AtomExprBase a] a
468 ConstructedAtomExpr DataConstructorName [AtomExprBase a] a
415− deriving (Eq,Show,Generic, NFData)
469+ deriving (Eq, Show, Read, Generic, NFData, Foldable, Functor, Traversable)
416
470
417−instance Binary AtomExpr
418−
419-- | Used in tuple creation when creating a relation.
471-- | Used in tuple creation when creating a relation.
420data ExtendTupleExprBase a = AttributeExtendTupleExpr AttributeName (AtomExprBase a)
472data ExtendTupleExprBase a = AttributeExtendTupleExpr AttributeName (AtomExprBase a)
421− deriving (Show, Eq, Generic, NFData)
473+ deriving (Show, Read, Eq, Generic, NFData, Foldable, Functor, Traversable)
422
474
423−type ExtendTupleExpr = ExtendTupleExprBase ()
475+type ExtendTupleExpr = ExtendTupleExprBase ()
476+
477+instance Hashable ExtendTupleExpr
478+
479+type GraphRefExtendTupleExpr = ExtendTupleExprBase GraphRefTransactionMarker
424
480
425−instance Binary ExtendTupleExpr
426−
427--enumerates the list of functions available to be run as part of tuple expressions
481--enumerates the list of functions available to be run as part of tuple expressions
428type AtomFunctions = HS.HashSet AtomFunction
482type AtomFunctions = HS.HashSet AtomFunction
429
483
@@ -434,6 +488,7 @@ type AtomFunctionBodyScript = StringType
434type AtomFunctionBodyType = [Atom] -> Either AtomFunctionError Atom
488type AtomFunctionBodyType = [Atom] -> Either AtomFunctionError Atom
435
489
436data AtomFunctionBody = AtomFunctionBody (Maybe AtomFunctionBodyScript) AtomFunctionBodyType
490data AtomFunctionBody = AtomFunctionBody (Maybe AtomFunctionBodyScript) AtomFunctionBodyType
491+ deriving Generic
437
492
438instance NFData AtomFunctionBody where
493instance NFData AtomFunctionBody where
439 rnf (AtomFunctionBody mScript _) = rnf mScript
494 rnf (AtomFunctionBody mScript _) = rnf mScript
@@ -468,11 +523,17 @@ data AttributeNamesBase a = AttributeNames (S.Set AttributeName) |
468 UnionAttributeNames (AttributeNamesBase a) (AttributeNamesBase a) |
523 UnionAttributeNames (AttributeNamesBase a) (AttributeNamesBase a) |
469 IntersectAttributeNames (AttributeNamesBase a) (AttributeNamesBase a) |
524 IntersectAttributeNames (AttributeNamesBase a) (AttributeNamesBase a) |
470 RelationalExprAttributeNames (RelationalExprBase a) -- use attribute names from the relational expression's type
525 RelationalExprAttributeNames (RelationalExprBase a) -- use attribute names from the relational expression's type
471− deriving (Eq, Show, Generic, NFData)
526+ deriving (Eq, Show, Read, Generic, NFData, Foldable, Functor, Traversable)
527+
528+instance Hashable AttributeNames
529+
530+instance Hashable (S.Set AttributeName) where
531+ hashWithSalt salt s = salt `hashWithSalt` S.toList s
472
532
473−type AttributeNames = AttributeNamesBase ()
533+type AttributeNames = AttributeNamesBase ()
474−instance Binary AttributeNames
534+
475−
535+type GraphRefAttributeNames = AttributeNamesBase GraphRefTransactionMarker
536+
476-- | The persistence strategy is a global database option which represents how to persist the database in the filesystem, if at all.
537-- | The persistence strategy is a global database option which represents how to persist the database in the filesystem, if at all.
477data PersistenceStrategy = NoPersistence | -- ^ no filesystem persistence/memory-only database
538data PersistenceStrategy = NoPersistence | -- ^ no filesystem persistence/memory-only database
478 MinimalPersistence FilePath | -- ^ fsync off, not crash-safe
539 MinimalPersistence FilePath | -- ^ fsync off, not crash-safe
@@ -480,19 +541,31 @@ data PersistenceStrategy = NoPersistence | -- ^ no filesystem persistence/memory
480 deriving (Show, Read)
541 deriving (Show, Read)
481
542
482type AttributeExpr = AttributeExprBase ()
543type AttributeExpr = AttributeExprBase ()
544+type GraphRefAttributeExpr = AttributeExprBase GraphRefTransactionMarker
483
545
484-- | Create attributes dynamically.
546-- | Create attributes dynamically.
485data AttributeExprBase a = AttributeAndTypeNameExpr AttributeName TypeConstructor a |
547data AttributeExprBase a = AttributeAndTypeNameExpr AttributeName TypeConstructor a |
486 NakedAttributeExpr Attribute
548 NakedAttributeExpr Attribute
487− deriving (Eq, Show, Generic, Binary, NFData)
549+ deriving (Eq, Show, Read, Generic, NFData, Foldable, Functor, Traversable, Hashable)
488
550
489-- | Dynamically create a tuple from attribute names and 'AtomExpr's.
551-- | Dynamically create a tuple from attribute names and 'AtomExpr's.
490newtype TupleExprBase a = TupleExpr (M.Map AttributeName (AtomExprBase a))
552newtype TupleExprBase a = TupleExpr (M.Map AttributeName (AtomExprBase a))
491− deriving (Eq, Show, Generic, NFData)
553+ deriving (Eq, Show, Read, Generic, NFData, Foldable, Functor, Traversable)
492−
554+
493−instance Binary TupleExpr
555+instance Hashable TupleExpr
494−
556+
495−type TupleExpr = TupleExprBase ()
557+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 ()
496
569
497data MergeStrategy =
570data MergeStrategy =
498 -- | 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)
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)
@@ -501,7 +574,7 @@ data MergeStrategy =
501 UnionPreferMergeStrategy HeadName |
574 UnionPreferMergeStrategy HeadName |
502 -- | 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.
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.
503 SelectedBranchMergeStrategy HeadName
576 SelectedBranchMergeStrategy HeadName
504− deriving (Eq, Show, Binary, Generic, NFData)
577+ deriving (Eq, Show, Generic, NFData)
505
578
506type DatabaseContextFunctionName = StringType
579type DatabaseContextFunctionName = StringType
507
580
@@ -527,3 +600,47 @@ instance Hashable DatabaseContextFunction where
527
600
528instance Eq DatabaseContextFunction where
601instance Eq DatabaseContextFunction where
529 f1 == f2 = dbcFuncName f1 == dbcFuncName f2
602 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+338−362
@@ -1,4 +1,4 @@
1−{-# LANGUAGE DeriveAnyClass, DeriveGeneric, ScopedTypeVariables, BangPatterns #-}
1+{-# LANGUAGE DeriveGeneric, ScopedTypeVariables, MonoLocalBinds, DerivingVia #-}
2{-|
2{-|
3Module: ProjectM36.Client
3Module: ProjectM36.Client
4
4
@@ -9,6 +9,7 @@ module ProjectM36.Client
9 Connection(..),
9 Connection(..),
10 Port,
10 Port,
11 Hostname,
11 Hostname,
12+ ServiceName,
12 DatabaseName,
13 DatabaseName,
13 ConnectionError(..),
14 ConnectionError(..),
14 connectProjectM36,
15 connectProjectM36,
@@ -16,7 +17,8 @@ module ProjectM36.Client
16 closeRemote_,
17 closeRemote_,
17 executeRelationalExpr,
18 executeRelationalExpr,
18 executeDatabaseContextExpr,
19 executeDatabaseContextExpr,
19− executeDatabaseContextIOExpr,
20+ executeDatabaseContextIOExpr,
21+ executeDataFrameExpr,
20 executeGraphExpr,
22 executeGraphExpr,
21 executeSchemaExpr,
23 executeSchemaExpr,
22 executeTransGraphRelationalExpr,
24 executeTransGraphRelationalExpr,
@@ -42,19 +44,20 @@ module ProjectM36.Client
42 defaultDatabaseName,
44 defaultDatabaseName,
43 defaultRemoteConnectionInfo,
45 defaultRemoteConnectionInfo,
44 defaultHeadName,
46 defaultHeadName,
47+ addClientNode,
45 PersistenceStrategy(..),
48 PersistenceStrategy(..),
46 RelationalExpr,
49 RelationalExpr,
47 RelationalExprBase(..),
50 RelationalExprBase(..),
51+ DatabaseContextExprBase(..),
48− DatabaseContextExpr(..),
52+ DatabaseContextExpr,
53+ DatabaseContextIOExprBase(..),
49− DatabaseContextIOExpr(..),
54+ DatabaseContextIOExpr,
50 Attribute(..),
55 Attribute(..),
51 MergeStrategy(..),
56 MergeStrategy(..),
52 attributesFromList,
57 attributesFromList,
53− createNodeId,
54 createSessionAtCommit,
58 createSessionAtCommit,
55 createSessionAtHead,
59 createSessionAtHead,
56 closeSession,
60 closeSession,
57− addClientNode,
58 callTestTimeout_,
61 callTestTimeout_,
59 RelationCardinality(..),
62 RelationCardinality(..),
60 TransactionGraphOperator(..),
63 TransactionGraphOperator(..),
@@ -64,7 +67,6 @@ module ProjectM36.Client
64 TransGraphRelationalExpr,
67 TransGraphRelationalExpr,
65 TransactionIdLookup(..),
68 TransactionIdLookup(..),
66 TransactionIdHeadBacktrack(..),
69 TransactionIdHeadBacktrack(..),
67− NodeId(..),
68 Atom(..),
70 Atom(..),
69 Session,
71 Session,
70 SessionId,
72 SessionId,
@@ -77,8 +79,9 @@ module ProjectM36.Client
77 databaseContextExprForUniqueKey,
79 databaseContextExprForUniqueKey,
78 databaseContextExprForForeignKey,
80 databaseContextExprForForeignKey,
79 createScriptedAtomFunction,
81 createScriptedAtomFunction,
82+ ProjectM36.Client.validateMerkleHashes,
80 AttributeExprBase(..),
83 AttributeExprBase(..),
81− TypeConstructor(..),
84+ TypeConstructorBase(..),
82 TypeConstructorDef(..),
85 TypeConstructorDef(..),
83 DataConstructorDef(..),
86 DataConstructorDef(..),
84 AttributeNamesBase(..),
87 AttributeNamesBase(..),
@@ -86,78 +89,85 @@ module ProjectM36.Client
86 IncDepName,
89 IncDepName,
87 InclusionDependency(..),
90 InclusionDependency(..),
88 AttributeName,
91 AttributeName,
92+ DF.DataFrame,
93+ DF.DataFrameExpr,
94+ DF.AttributeOrderExpr,
95+ DF.Order(..),
89 RelationalError(..),
96 RelationalError(..),
90 RequestTimeoutException(..),
97 RequestTimeoutException(..),
91 RemoteProcessDiedException(..),
98 RemoteProcessDiedException(..),
92 AtomType(..),
99 AtomType(..),
93 Atomable(..),
100 Atomable(..),
94 TupleExprBase(..),
101 TupleExprBase(..),
102+ TupleExprsBase(..),
95 AtomExprBase(..),
103 AtomExprBase(..),
96 RestrictionPredicateExprBase(..),
104 RestrictionPredicateExprBase(..),
97 withTransaction
105 withTransaction
98 ) where
106 ) where
99import ProjectM36.Base hiding (inclusionDependencies) --defined in this module as well
107import ProjectM36.Base hiding (inclusionDependencies) --defined in this module as well
100import qualified ProjectM36.Base as B
108import qualified ProjectM36.Base as B
109+import ProjectM36.Serialise.Error ()
101import ProjectM36.Error
110import ProjectM36.Error
102import ProjectM36.Atomable
111import ProjectM36.Atomable
103import ProjectM36.AtomFunction as AF
112import ProjectM36.AtomFunction as AF
104import ProjectM36.StaticOptimizer
113import ProjectM36.StaticOptimizer
105import ProjectM36.Key
114import ProjectM36.Key
115+import qualified ProjectM36.DataFrame as DF
106import ProjectM36.DatabaseContextFunction as DCF
116import ProjectM36.DatabaseContextFunction as DCF
107import qualified ProjectM36.IsomorphicSchema as Schema
117import qualified ProjectM36.IsomorphicSchema as Schema
108import Control.Monad.State
118import Control.Monad.State
109−import Control.Monad.Trans.Reader
110import qualified ProjectM36.RelationalExpression as RE
119import qualified ProjectM36.RelationalExpression as RE
111import ProjectM36.DatabaseContext (basicDatabaseContext)
120import ProjectM36.DatabaseContext (basicDatabaseContext)
112import qualified ProjectM36.TransactionGraph as Graph
121import qualified ProjectM36.TransactionGraph as Graph
113−import ProjectM36.TransactionGraph
122+import ProjectM36.TransactionGraph as TG
114import qualified ProjectM36.Transaction as Trans
123import qualified ProjectM36.Transaction as Trans
115import ProjectM36.TransactionGraph.Persist
124import ProjectM36.TransactionGraph.Persist
116import ProjectM36.Attribute
125import ProjectM36.Attribute
117−import ProjectM36.TransGraphRelationalExpression (TransGraphRelationalExpr, evalTransGraphRelationalExpr)
126+import ProjectM36.TransGraphRelationalExpression as TGRE (TransGraphRelationalExpr)
118import ProjectM36.Persist (DiskSync(..))
127import ProjectM36.Persist (DiskSync(..))
119import ProjectM36.FileLock
128import ProjectM36.FileLock
129+import ProjectM36.NormalizeExpr
120import ProjectM36.Notifications
130import ProjectM36.Notifications
121import ProjectM36.Server.RemoteCallTypes
131import ProjectM36.Server.RemoteCallTypes
122import qualified ProjectM36.DisconnectedTransaction as Discon
132import qualified ProjectM36.DisconnectedTransaction as Discon
123import ProjectM36.Relation (typesAsRelation)
133import ProjectM36.Relation (typesAsRelation)
124import ProjectM36.ScriptSession (initScriptSession, ScriptSession)
134import ProjectM36.ScriptSession (initScriptSession, ScriptSession)
125import qualified ProjectM36.Relation as R
135import qualified ProjectM36.Relation as R
126−import qualified ProjectM36.DatabaseContext as DBC
127import Control.Exception.Base
136import Control.Exception.Base
128−import GHC.Conc.Sync
137+import Control.Concurrent.STM
138+import Control.Concurrent.Async
129
139
130−import Network.Transport (Transport(closeTransport))
131−import Network.Transport.TCP (createTransport, defaultTCPParameters, encodeEndPointAddress)
132−import Control.Distributed.Process.Node (newLocalNode, initRemoteTable, runProcess, LocalNode, forkProcess, closeLocalNode)
133−import Control.Distributed.Process.Extras.Internal.Types (whereisRemote)
134−import Control.Distributed.Process.ManagedProcess.Client (call, safeCall)
135import Data.Either (isRight)
140import Data.Either (isRight)
136import Data.UUID.V4 (nextRandom)
141import Data.UUID.V4 (nextRandom)
137import Data.Word
142import Data.Word
138−import Control.Distributed.Process (ProcessId, Process, receiveWait, send, match, NodeId(..), reconnect)
143+import Data.Hashable
139import Control.Exception (IOException, handle, AsyncException, throwIO, fromException, Exception)
144import Control.Exception (IOException, handle, AsyncException, throwIO, fromException, Exception)
140import Control.Concurrent.MVar
145import Control.Concurrent.MVar
146+import Codec.Winery hiding (Schema, schema)
141import qualified Data.Map as M
147import qualified Data.Map as M
142−import Control.Distributed.Process.Serializable (Serializable)
148+#if MIN_VERSION_stm_containers(1,0,0)
149+import qualified StmContainers.Map as StmMap
150+import qualified StmContainers.Set as StmSet
151+#else
143−import qualified STMContainers.Map as STMMap
152+import qualified STMContainers.Map as StmMap
144−import qualified STMContainers.Set as STMSet
153+import qualified STMContainers.Set as StmSet
154+#endif
145import qualified ProjectM36.Session as Sess
155import qualified ProjectM36.Session as Sess
146import ProjectM36.Session
156import ProjectM36.Session
147import ProjectM36.Sessions
157import ProjectM36.Sessions
148−import ListT
149−import Data.Binary (Binary)
150import GHC.Generics (Generic)
158import GHC.Generics (Generic)
151import Control.DeepSeq (force)
159import Control.DeepSeq (force)
152import System.IO
160import System.IO
153import Data.Time.Clock
161import 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)
154
166
155type Hostname = String
167type Hostname = String
156
168
157type Port = Word16
169type Port = Word16
158
170
159−type DatabaseName = String
160−
161-- | 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.
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.
162type NotificationCallback = NotificationName -> EvaluatedNotification -> IO ()
172type NotificationCallback = NotificationName -> EvaluatedNotification -> IO ()
163
173
@@ -177,15 +187,16 @@ data RequestTimeoutException = RequestTimeoutException
177
187
178instance Exception RequestTimeoutException
188instance Exception RequestTimeoutException
179
189
180−-- | 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.
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.
181−data ConnectionInfo = InProcessConnectionInfo PersistenceStrategy NotificationCallback [GhcPkgPath]|
191+data ConnectionInfo = InProcessConnectionInfo PersistenceStrategy NotificationCallback [GhcPkgPath] |
182− RemoteProcessConnectionInfo DatabaseName NodeId NotificationCallback
192+ RemoteConnectionInfo DatabaseName Hostname ServiceName NotificationCallback
183
193
184type EvaluatedNotifications = M.Map NotificationName EvaluatedNotification
194type EvaluatedNotifications = M.Map NotificationName EvaluatedNotification
185
195
186-- | Used for callbacks from the server when monitored changes have been made.
196-- | Used for callbacks from the server when monitored changes have been made.
187newtype NotificationMessage = NotificationMessage EvaluatedNotifications
197newtype NotificationMessage = NotificationMessage EvaluatedNotifications
188− deriving (Binary, Eq, Show, Generic)
198+ deriving (Eq, Show, Generic)
199+ deriving Serialise via WineryVariant NotificationMessage
189
200
190-- | 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.
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.
191data EvaluatedNotification = EvaluatedNotification {
202data EvaluatedNotification = EvaluatedNotification {
@@ -193,13 +204,10 @@ data EvaluatedNotification = EvaluatedNotification {
193 reportOldRelation :: Either RelationalError Relation,
204 reportOldRelation :: Either RelationalError Relation,
194 reportNewRelation :: Either RelationalError Relation
205 reportNewRelation :: Either RelationalError Relation
195 }
206 }
196− deriving(Binary, Eq, Show, Generic)
207+ deriving (Eq, Show, Generic)
208+ deriving Serialise via WineryRecord EvaluatedNotification
197
209
198
210
199−-- | Create a 'NodeId' for use in connecting to a remote server using distributed-process.
200−createNodeId :: Hostname -> Port -> NodeId
201−createNodeId host port = NodeId $ encodeEndPointAddress host (show port) 1
202−
203-- | Use this for connecting to remote servers on the default port.
211-- | Use this for connecting to remote servers on the default port.
204defaultServerPort :: Port
212defaultServerPort :: Port
205defaultServerPort = 6543
213defaultServerPort = 6543
@@ -214,126 +222,107 @@ defaultHeadName = "master"
214
222
215-- | 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.
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.
216defaultRemoteConnectionInfo :: ConnectionInfo
224defaultRemoteConnectionInfo :: ConnectionInfo
225+defaultRemoteConnectionInfo =
217−defaultRemoteConnectionInfo = RemoteProcessConnectionInfo defaultDatabaseName (createNodeId "127.0.0.1" defaultServerPort) emptyNotificationCallback
226+ RemoteConnectionInfo defaultDatabaseName defaultServerHostname (show defaultServerPort) emptyNotificationCallback
218
227
219−-- | The 'Connection' represents either local or remote access to a database. All operations flow through the connection.
228+defaultServerHostname :: Hostname
220−type ClientNodes = STMSet.Set ProcessId
229+defaultServerHostname = "localhost"
221
230
222−-- internal structure specific to in-process connections
231+newtype RemoteConnectionConf = RemoteConnectionConf RPC.Connection
223−data InProcessConnectionConf = InProcessConnectionConf {
224− ipPersistenceStrategy :: PersistenceStrategy,
225− ipClientNodes :: ClientNodes,
226− ipSessions :: Sessions,
227− ipTransactionGraph :: TVar TransactionGraph,
228− ipScriptSession :: Maybe ScriptSession,
229− ipLocalNode :: LocalNode,
230− ipTransport :: Transport, -- we hold onto this so that we can close it gracefully
231− ipLocks :: Maybe (LockFile, MVar LockFileHash) -- nothing when NoPersistence
232− }
233−
234−data RemoteProcessConnectionConf = RemoteProcessConnectionConf {
235− rLocalNode :: LocalNode,
236− rProcessId :: ProcessId, --remote processId
237− rTransport :: Transport --the TCP socket transport
238− }
239
232
240data Connection = InProcessConnection InProcessConnectionConf |
233data Connection = InProcessConnection InProcessConnectionConf |
241− RemoteProcessConnection RemoteProcessConnectionConf
234+ RemoteConnection RemoteConnectionConf
242
235
243-- | There are several reasons why a connection can fail.
236-- | There are several reasons why a connection can fail.
244data ConnectionError = SetupDatabaseDirectoryError PersistenceError |
237data ConnectionError = SetupDatabaseDirectoryError PersistenceError |
245 IOExceptionError IOException |
238 IOExceptionError IOException |
246 NoSuchDatabaseByNameError DatabaseName |
239 NoSuchDatabaseByNameError DatabaseName |
240+ DatabaseValidationError [MerkleValidationError] |
247 LoginError
241 LoginError
248 deriving (Show, Eq, Generic)
242 deriving (Show, Eq, Generic)
249
243
250remoteDBLookupName :: DatabaseName -> String
244remoteDBLookupName :: DatabaseName -> String
251remoteDBLookupName = (++) "db-"
245remoteDBLookupName = (++) "db-"
252
246
253−createLocalNode :: IO (LocalNode, Transport)
254−createLocalNode = do
255− eLocalTransport <- createTransport "127.0.0.1" "0" defaultTCPParameters
256− case eLocalTransport of
257− Left err -> error ("failed to create transport: " ++ show err)
258− Right localTransport -> do
259− localNode <- newLocalNode localTransport initRemoteTable
260− pure (localNode, localTransport)
261−
262−notificationListener :: NotificationCallback -> Process ()
263−notificationListener callback = do
264− --pid <- getSelfPid
265− --liftIO $ putStrLn $ "LISTENER THREAD START " ++ show pid
266− _ <- forever $
267− receiveWait [
268− match (\(NotificationMessage eNots) ->
269− --say $ "NOTIFICATION: " ++ show eNots
270− -- 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
271− liftIO $ mapM_ (uncurry callback) (M.toList eNots)
272− )
273− ]
274− --say "LISTENER THREAD EXIT"
275− pure ()
276−
277−startNotificationListener :: LocalNode -> NotificationCallback -> IO ProcessId
278−startNotificationListener localNode callback = forkProcess localNode (notificationListener callback)
279−
280createScriptSession :: [String] -> IO (Maybe ScriptSession)
247createScriptSession :: [String] -> IO (Maybe ScriptSession)
281createScriptSession ghcPkgPaths = do
248createScriptSession ghcPkgPaths = do
282 eScriptSession <- initScriptSession ghcPkgPaths
249 eScriptSession <- initScriptSession ghcPkgPaths
283 case eScriptSession of
250 case eScriptSession of
284− 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
251+ Left err -> hPutStrLn stderr ("Warning: Haskell scripting disabled: " ++ show err) >> pure Nothing --not a fatal error, but the scripting feature must be disabled
285 Right s -> pure (Just s)
252 Right s -> pure (Just s)
286
253
254+
287-- | To create a 'Connection' to a remote or local database, create a 'ConnectionInfo' and call 'connectProjectM36'.
255-- | To create a 'Connection' to a remote or local database, create a 'ConnectionInfo' and call 'connectProjectM36'.
288connectProjectM36 :: ConnectionInfo -> IO (Either ConnectionError Connection)
256connectProjectM36 :: ConnectionInfo -> IO (Either ConnectionError Connection)
289--create a new in-memory database/transaction graph
257--create a new in-memory database/transaction graph
290connectProjectM36 (InProcessConnectionInfo strat notificationCallback ghcPkgPaths) = do
258connectProjectM36 (InProcessConnectionInfo strat notificationCallback ghcPkgPaths) = do
291 freshId <- nextRandom
259 freshId <- nextRandom
292− stamp <- getCurrentTime
260+ tstamp <- getCurrentTime
293 let bootstrapContext = basicDatabaseContext
261 let bootstrapContext = basicDatabaseContext
294− freshGraph = bootstrapTransactionGraph stamp freshId bootstrapContext
262+ freshGraph = bootstrapTransactionGraph tstamp freshId bootstrapContext
295 case strat of
263 case strat of
296 --create date examples graph for now- probably should be empty context in the future
264 --create date examples graph for now- probably should be empty context in the future
297 NoPersistence -> do
265 NoPersistence -> do
298 graphTvar <- newTVarIO freshGraph
266 graphTvar <- newTVarIO freshGraph
299− clientNodes <- STMSet.newIO
267+ clientNodes <- StmSet.newIO
300− sessions <- STMMap.newIO
268+ sessions <- StmMap.newIO
301− (localNode, transport) <- createLocalNode
302− notificationPid <- startNotificationListener localNode notificationCallback
303 mScriptSession <- createScriptSession ghcPkgPaths
269 mScriptSession <- createScriptSession ghcPkgPaths
304−
270+ notifAsync <- startNotificationListener clientNodes notificationCallback
305 let conn = InProcessConnection InProcessConnectionConf {
271 let conn = InProcessConnection InProcessConnectionConf {
306 ipPersistenceStrategy = strat,
272 ipPersistenceStrategy = strat,
307 ipClientNodes = clientNodes,
273 ipClientNodes = clientNodes,
308 ipSessions = sessions,
274 ipSessions = sessions,
309 ipTransactionGraph = graphTvar,
275 ipTransactionGraph = graphTvar,
310 ipScriptSession = mScriptSession,
276 ipScriptSession = mScriptSession,
311− ipLocalNode = localNode,
312− ipTransport = transport,
313− ipLocks = Nothing}
277+ ipLocks = Nothing,
314− addClientNode conn notificationPid
278+ ipCallbackAsync = notifAsync
279+ }
315 pure (Right conn)
280 pure (Right conn)
316 MinimalPersistence dbdir -> connectPersistentProjectM36 strat NoDiskSync dbdir freshGraph notificationCallback ghcPkgPaths
281 MinimalPersistence dbdir -> connectPersistentProjectM36 strat NoDiskSync dbdir freshGraph notificationCallback ghcPkgPaths
317 CrashSafePersistence dbdir -> connectPersistentProjectM36 strat FsyncDiskSync dbdir freshGraph notificationCallback ghcPkgPaths
282 CrashSafePersistence dbdir -> connectPersistentProjectM36 strat FsyncDiskSync dbdir freshGraph notificationCallback ghcPkgPaths
318
283
319−connectProjectM36 (RemoteProcessConnectionInfo databaseName serverNodeId notificationCallback) = do
284+connectProjectM36 (RemoteConnectionInfo dbName hostName servicePort notificationCallback) = do
320− connStatus <- newEmptyMVar
285+ --TODO- add notification callback thread
321− (localNode, transport) <- createLocalNode
286+ let resolutionHints = defaultHints { addrFlags = [AI_NUMERICHOST, AI_NUMERICSERV],
322− let dbName = remoteDBLookupName databaseName
287+ addrSocketType = Stream
323− --putStrLn $ "Connecting to " ++ show serverNodeId ++ " " ++ dbName
288+ }
324− notificationListenerPid <- startNotificationListener localNode notificationCallback
289+ resolved <- getAddrInfo (Just resolutionHints) (Just hostName) (Just servicePort)
325− runProcess localNode $ do
290+ case resolved of
326− --even a failed connection retains an open socket!
291+ [] -> error ("DNS resolution failed for" <> hostName <> ":" <> servicePort)
327− mServerProcessId <- whereisRemote serverNodeId dbName
292+ addrInfo:_ -> do
328− case mServerProcessId of
293+ --supports IPv4 only for now
329− Nothing -> liftIO $ putMVar connStatus $ Left (NoSuchDatabaseByNameError databaseName)
294+ let (SockAddrInet port addr) = addrAddress addrInfo
330− Just serverProcessId -> do
295+ notificationHandlers =
331− loginConfirmation <- safeLogin (Login notificationListenerPid) serverProcessId
296+ [RPC.ClientAsyncRequestHandler $
332− if not loginConfirmation then
297+ \(NotificationMessage notifications') ->
333− liftIO $ putMVar connStatus (Left LoginError)
298+ forM_ (M.toList notifications') (uncurry notificationCallback)
334− else
299+ ]
335− liftIO $ putMVar connStatus (Right $ RemoteProcessConnection RemoteProcessConnectionConf {rLocalNode = localNode, rProcessId = serverProcessId, rTransport = transport})
300+ let connectExcHandler (e :: IOException) = pure $ Left (IOExceptionError e)
336− takeMVar connStatus
301+ eConn <- (Right <$> RPC.connect notificationHandlers (hostAddressToTuple addr) port) `catch` connectExcHandler
302+ case eConn of
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
337
326
338connectPersistentProjectM36 :: PersistenceStrategy ->
327connectPersistentProjectM36 :: PersistenceStrategy ->
339 DiskSync ->
328 DiskSync ->
@@ -352,49 +341,57 @@ connectPersistentProjectM36 strat sync dbdir freshGraph notificationCallback ghc
352 case graph of
341 case graph of
353 Left err' -> return $ Left (SetupDatabaseDirectoryError err')
342 Left err' -> return $ Left (SetupDatabaseDirectoryError err')
354 Right graph' -> do
343 Right graph' -> do
344+ case TG.validateMerkleHashes graph' of
345+ Left merkleErrs -> pure (Left (DatabaseValidationError merkleErrs))
346+ Right _ -> do
355− tvarGraph <- newTVarIO graph'
347+ tvarGraph <- newTVarIO graph'
356− sessions <- STMMap.newIO
348+ sessions <- StmMap.newIO
357− clientNodes <- STMSet.newIO
349+ clientNodes <- StmSet.newIO
358− (localNode, transport) <- createLocalNode
359− lockMVar <- newMVar digest
350+ lockMVar <- newMVar digest
351+ notifAsync <- startNotificationListener clientNodes notificationCallback
360− let conn = InProcessConnection InProcessConnectionConf {
352+ let conn = InProcessConnection InProcessConnectionConf {
361 ipPersistenceStrategy = strat,
353 ipPersistenceStrategy = strat,
362 ipClientNodes = clientNodes,
354 ipClientNodes = clientNodes,
363 ipSessions = sessions,
355 ipSessions = sessions,
364 ipTransactionGraph = tvarGraph,
356 ipTransactionGraph = tvarGraph,
365 ipScriptSession = mScriptSession,
357 ipScriptSession = mScriptSession,
366− ipLocalNode = localNode,
367− ipTransport = transport,
368− ipLocks = Just (lockFileH, lockMVar)
358+ ipLocks = Just (lockFileH, lockMVar),
359+ ipCallbackAsync = notifAsync
369 }
360 }
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
370
371
371− notificationPid <- startNotificationListener localNode notificationCallback
372− addClientNode conn notificationPid
373− pure (Right conn)
374−
375-- | Create a new session at the transaction id and return the session's Id.
372-- | Create a new session at the transaction id and return the session's Id.
376createSessionAtCommit :: Connection -> TransactionId -> IO (Either RelationalError SessionId)
373createSessionAtCommit :: Connection -> TransactionId -> IO (Either RelationalError SessionId)
377createSessionAtCommit conn@(InProcessConnection _) commitId = do
374createSessionAtCommit conn@(InProcessConnection _) commitId = do
378 newSessionId <- nextRandom
375 newSessionId <- nextRandom
379 atomically $ createSessionAtCommit_ commitId newSessionId conn
376 atomically $ createSessionAtCommit_ commitId newSessionId conn
380−createSessionAtCommit conn@(RemoteProcessConnection _) uuid = remoteCall conn (CreateSessionAtCommit uuid)
377+createSessionAtCommit conn@(RemoteConnection _) uuid = remoteCall conn (CreateSessionAtCommit uuid)
381
378
382createSessionAtCommit_ :: TransactionId -> SessionId -> Connection -> STM (Either RelationalError SessionId)
379createSessionAtCommit_ :: TransactionId -> SessionId -> Connection -> STM (Either RelationalError SessionId)
383createSessionAtCommit_ commitId newSessionId (InProcessConnection conf) = do
380createSessionAtCommit_ commitId newSessionId (InProcessConnection conf) = do
384 let sessions = ipSessions conf
381 let sessions = ipSessions conf
385 graphTvar = ipTransactionGraph conf
382 graphTvar = ipTransactionGraph conf
386 graph <- readTVar graphTvar
383 graph <- readTVar graphTvar
387− case transactionForId commitId graph of
384+ case RE.transactionForId commitId graph of
388 Left err -> pure (Left err)
385 Left err -> pure (Left err)
389 Right transaction -> do
386 Right transaction -> do
390 let freshDiscon = DisconnectedTransaction commitId (Trans.schemas transaction) False
387 let freshDiscon = DisconnectedTransaction commitId (Trans.schemas transaction) False
391− keyDuplication <- STMMap.lookup newSessionId sessions
388+ keyDuplication <- StmMap.lookup newSessionId sessions
392 case keyDuplication of
389 case keyDuplication of
393 Just _ -> pure $ Left (SessionIdInUseError newSessionId)
390 Just _ -> pure $ Left (SessionIdInUseError newSessionId)
394 Nothing -> do
391 Nothing -> do
395− STMMap.insert (Session freshDiscon defaultSchemaName) newSessionId sessions
392+ StmMap.insert (Session freshDiscon defaultSchemaName) newSessionId sessions
396 pure $ Right newSessionId
393 pure $ Right newSessionId
397−createSessionAtCommit_ _ _ (RemoteProcessConnection _) = error "createSessionAtCommit_ called on remote connection"
394+createSessionAtCommit_ _ _ (RemoteConnection _) = error "createSessionAtCommit_ called on remote connection"
398
395
399-- | 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.
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.
400createSessionAtHead :: Connection -> HeadName -> IO (Either RelationalError SessionId)
397createSessionAtHead :: Connection -> HeadName -> IO (Either RelationalError SessionId)
@@ -406,42 +403,38 @@ createSessionAtHead conn@(InProcessConnection conf) headn = do
406 case transactionForHead headn graph of
403 case transactionForHead headn graph of
407 Nothing -> pure $ Left (NoSuchHeadNameError headn)
404 Nothing -> pure $ Left (NoSuchHeadNameError headn)
408 Just trans -> createSessionAtCommit_ (transactionId trans) newSessionId conn
405 Just trans -> createSessionAtCommit_ (transactionId trans) newSessionId conn
409−createSessionAtHead conn@(RemoteProcessConnection _) headn = remoteCall conn (CreateSessionAtHead headn)
406+createSessionAtHead conn@(RemoteConnection _) headn = remoteCall conn (CreateSessionAtHead headn)
410−
411−-- | Used internally for server connections to keep track of remote nodes for the purpose of sending notifications later.
412−addClientNode :: Connection -> ProcessId -> IO ()
413−addClientNode (RemoteProcessConnection _) _ = error "addClientNode called on remote connection"
414−addClientNode (InProcessConnection conf) newProcessId = atomically (STMSet.insert newProcessId (ipClientNodes conf))
415
407
416-- | Discards a session, eliminating any uncommitted changes present in the session.
408-- | Discards a session, eliminating any uncommitted changes present in the session.
417closeSession :: SessionId -> Connection -> IO ()
409closeSession :: SessionId -> Connection -> IO ()
418closeSession sessionId (InProcessConnection conf) =
410closeSession sessionId (InProcessConnection conf) =
419− atomically $ STMMap.delete sessionId (ipSessions conf)
411+ atomically $ StmMap.delete sessionId (ipSessions conf)
420−closeSession sessionId conn@(RemoteProcessConnection _) = remoteCall conn (CloseSession sessionId)
412+closeSession sessionId conn@(RemoteConnection _) = remoteCall conn (CloseSession sessionId)
421
413
422-- | 'close' cleans up the database access connection and closes any relevant sockets.
414-- | 'close' cleans up the database access connection and closes any relevant sockets.
423close :: Connection -> IO ()
415close :: Connection -> IO ()
424close (InProcessConnection conf) = do
416close (InProcessConnection conf) = do
417+ cancel (ipCallbackAsync conf)
425 atomically $ do
418 atomically $ do
426 let sessions = ipSessions conf
419 let sessions = ipSessions conf
420+#if MIN_VERSION_stm_containers(1,0,0)
421+ StmMap.reset sessions
422+#else
427− STMMap.deleteAll sessions
423+ StmMap.deleteAll sessions
424+#endif
428 pure ()
425 pure ()
429− closeLocalNode (ipLocalNode conf)
430− closeTransport (ipTransport conf)
431 let mLocks = ipLocks conf
426 let mLocks = ipLocks conf
432 case mLocks of
427 case mLocks of
433 Nothing -> pure ()
428 Nothing -> pure ()
434 Just (lockFileH, _) -> closeLockFile lockFileH
429 Just (lockFileH, _) -> closeLockFile lockFileH
435
430
436−close conn@(RemoteProcessConnection conf) = do
431+close (RemoteConnection (RemoteConnectionConf conn)) =
437− _ <- remoteCall conn Logout :: IO Bool
432+ RPC.close conn
438− closeLocalNode (rLocalNode conf)
439− closeTransport (rTransport conf)
440
433
441--used only by the server EntryPoints
434--used only by the server EntryPoints
442closeRemote_ :: Connection -> IO ()
435closeRemote_ :: Connection -> IO ()
443closeRemote_ (InProcessConnection _) = error "invalid call of closeRemote_ on InProcessConnection"
436closeRemote_ (InProcessConnection _) = error "invalid call of closeRemote_ on InProcessConnection"
444−closeRemote_ (RemoteProcessConnection conf) = runProcess (rLocalNode conf) (reconnect (rProcessId conf))
437+closeRemote_ (RemoteConnection (RemoteConnectionConf conn)) = RPC.close conn
445
438
446 --we need to actually close the localNode's connection to the remote
439 --we need to actually close the localNode's connection to the remote
447--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
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
@@ -452,39 +445,19 @@ excEither = handle handler
452 where
445 where
453 handler exc | Just (_ :: AsyncException) <- fromException exc = throwIO exc
446 handler exc | Just (_ :: AsyncException) <- fromException exc = throwIO exc
454 | otherwise = pure (Left (UnhandledExceptionError (show exc)))
447 | otherwise = pure (Left (UnhandledExceptionError (show exc)))
455−
456−runProcessResult :: LocalNode -> Process a -> IO a
457−runProcessResult localNode proc = do
458− ret <- newEmptyMVar
459− runProcess localNode $ do
460− val <- proc
461− liftIO $ putMVar ret val
462− takeMVar ret
463−
464−safeLogin :: Login -> ProcessId -> Process Bool
465−safeLogin login procId = do
466− ret <- call procId login
467− case ret of
468− Left (_ :: ServerError) -> pure False
469− Right val -> pure val
470
448
449+
471−remoteCall :: (Serializable a, Serializable b) => Connection -> a -> IO b
450+remoteCall :: (Serialise a, Serialise b) => Connection -> a -> IO b
472remoteCall (InProcessConnection _ ) _ = error "remoteCall called on local connection"
451remoteCall (InProcessConnection _ ) _ = error "remoteCall called on local connection"
473−remoteCall (RemoteProcessConnection conf) arg = runProcessResult localNode $ do
452+remoteCall (RemoteConnection (RemoteConnectionConf rpcConn)) arg = do
474− ret <- safeCall serverProcessId arg
453+ eRet <- RPC.call rpcConn arg
475− case ret of
454+ case eRet of
476− Left err -> error ("server died: " ++ show err)
455+ Left err -> convertRPCErrors err
477− Right ret' -> case ret' of
478− Left RequestTimeoutError -> liftIO (throwIO RequestTimeoutException)
479− Left (ProcessDiedError _) -> liftIO (throwIO RemoteProcessDiedException)
480− Right val -> pure val
456+ Right val -> pure val
481− where
482− localNode = rLocalNode conf
483− serverProcessId = rProcessId conf
484
457
485sessionForSessionId :: SessionId -> Sessions -> STM (Either RelationalError Session)
458sessionForSessionId :: SessionId -> Sessions -> STM (Either RelationalError Session)
486sessionForSessionId sessionId sessions =
459sessionForSessionId sessionId sessions =
487− maybe (Left $ NoSuchSessionError sessionId) Right <$> STMMap.lookup sessionId sessions
460+ maybe (Left $ NoSuchSessionError sessionId) Right <$> StmMap.lookup sessionId sessions
488
461
489schemaForSessionId :: Session -> STM (Either RelationalError Schema)
462schemaForSessionId :: Session -> STM (Either RelationalError Schema)
490schemaForSessionId session = do
463schemaForSessionId session = do
@@ -515,7 +488,7 @@ currentSchemaName sessionId (InProcessConnection conf) = atomically $ do
515 case eSession of
488 case eSession of
516 Left err -> pure (Left err)
489 Left err -> pure (Left err)
517 Right session -> pure (Right (Sess.schemaName session))
490 Right session -> pure (Right (Sess.schemaName session))
518−currentSchemaName sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveCurrentSchemaName sessionId)
491+currentSchemaName sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveCurrentSchemaName sessionId)
519
492
520-- | Switch to the named isomorphic schema.
493-- | Switch to the named isomorphic schema.
521setCurrentSchemaName :: SessionId -> Connection -> SchemaName -> IO (Either RelationalError ())
494setCurrentSchemaName :: SessionId -> Connection -> SchemaName -> IO (Either RelationalError ())
@@ -526,8 +499,8 @@ setCurrentSchemaName sessionId (InProcessConnection conf) sname = atomically $ d
526 Left err -> pure (Left err)
499 Left err -> pure (Left err)
527 Right session -> case Sess.setSchemaName sname session of
500 Right session -> case Sess.setSchemaName sname session of
528 Left err -> pure (Left err)
501 Left err -> pure (Left err)
529− Right newSession -> STMMap.insert newSession sessionId sessions >> pure (Right ())
502+ Right newSession -> StmMap.insert newSession sessionId sessions >> pure (Right ())
530−setCurrentSchemaName sessionId conn@(RemoteProcessConnection _) sname = remoteCall conn (ExecuteSetCurrentSchema sessionId sname)
503+setCurrentSchemaName sessionId conn@(RemoteConnection _) sname = remoteCall conn (ExecuteSetCurrentSchema sessionId sname)
531
504
532-- | Execute a relational expression in the context of the session and connection. Relational expressions are queries and therefore cannot alter the database.
505-- | Execute a relational expression in the context of the session and connection. Relational expressions are queries and therefore cannot alter the database.
533executeRelationalExpr :: SessionId -> Connection -> RelationalExpr -> IO (Either RelationalError Relation)
506executeRelationalExpr :: SessionId -> Connection -> RelationalExpr -> IO (Either RelationalError Relation)
@@ -543,14 +516,15 @@ executeRelationalExpr sessionId (InProcessConnection conf) expr = excEither $ at
543 Right expr
516 Right expr
544 case expr' of
517 case expr' of
545 Left err -> pure (Left err)
518 Left err -> pure (Left err)
546− Right expr'' -> case optimizeRelationalExpr (Sess.concreteDatabaseContext session) expr'' of
519+ Right expr'' -> do
547− Left err -> pure (Left err)
520+ let graphTvar = ipTransactionGraph conf
548− Right optExpr -> do
521+ graph <- readTVar graphTvar
549− let evald = runReader (RE.evalRelationalExpr optExpr) (RE.mkRelationalExprState (Sess.concreteDatabaseContext session))
522+ let reEnv = RE.mkRelationalExprEnv (Sess.concreteDatabaseContext session) graph
550− case evald of
523+ case optimizeAndEvalRelationalExpr reEnv expr'' of
551− Left err -> pure (Left err)
552− Right rel -> pure (force (Right rel)) -- this is necessary so that any undefined/error exceptions are spit out here
524+ 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+
553−executeRelationalExpr sessionId conn@(RemoteProcessConnection _) relExpr = remoteCall conn (ExecuteRelationalExpr sessionId relExpr)
527+executeRelationalExpr sessionId conn@(RemoteConnection _) relExpr = remoteCall conn (ExecuteRelationalExpr sessionId relExpr)
554
528
555-- | 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.
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.
556executeDatabaseContextExpr :: SessionId -> Connection -> DatabaseContextExpr -> IO (Either RelationalError ())
530executeDatabaseContextExpr :: SessionId -> Connection -> DatabaseContextExpr -> IO (Either RelationalError ())
@@ -566,22 +540,25 @@ executeDatabaseContextExpr sessionId (InProcessConnection conf) expr = excEither
566 Schema.processDatabaseContextExprInSchema schema expr
540 Schema.processDatabaseContextExprInSchema schema expr
567 case expr' of
541 case expr' of
568 Left err -> pure (Left err)
542 Left err -> pure (Left err)
569− Right expr'' -> case runState (do
543+ Right expr'' -> do
570− eOptExpr <- applyStaticDatabaseOptimization expr''
544+ graph <- readTVar (ipTransactionGraph conf)
571− case eOptExpr of
572− Left err -> pure (Left err)
573− Right optExpr ->
574− RE.evalDatabaseContextExpr optExpr) (RE.freshDatabaseState (Sess.concreteDatabaseContext session)) of
545+ let ctx = Sess.concreteDatabaseContext session
575− (Left err,_) -> pure (Left err)
546+ env = RE.mkDatabaseContextEvalEnv transId graph
576− (Right (), (_,_,False)) -> pure (Right ()) --optimization- if nothing was dirtied, nothing to do
547+ transId = Sess.parentId session
577− (Right (), (!context',_,True)) -> do
548+ case RE.runDatabaseContextEvalMonad ctx env (optimizeAndEvalDatabaseContextExpr True expr'') of
549+ Left err -> pure (Left err)
550+ Right newState ->
551+ if not (RE.dbc_dirty newState) then --nothing dirtied, nothing to do
552+ pure (Right ())
553+ else do
578− let newDiscon = DisconnectedTransaction (Sess.parentId session) newSchemas True
554+ let newDiscon = DisconnectedTransaction (Sess.parentId session) newSchemas True
555+ context' = RE.dbc_context newState
579− newSubschemas = Schema.processDatabaseContextExprSchemasUpdate (Sess.subschemas session) expr
556+ newSubschemas = Schema.processDatabaseContextExprSchemasUpdate (Sess.subschemas session) expr
580− newSchemas = Schemas context' newSubschemas
557+ newSchemas = Schemas context' newSubschemas
581− newSession = Session newDiscon (Sess.schemaName session)
558+ newSession = Session newDiscon (Sess.schemaName session)
582− STMMap.insert newSession sessionId sessions
559+ StmMap.insert newSession sessionId sessions
583− pure (Right ())
560+ pure (Right ())
584−executeDatabaseContextExpr sessionId conn@(RemoteProcessConnection _) dbExpr = remoteCall conn (ExecuteDatabaseContextExpr sessionId dbExpr)
561+executeDatabaseContextExpr sessionId conn@(RemoteConnection _) dbExpr = remoteCall conn (ExecuteDatabaseContextExpr sessionId dbExpr)
585
562
586-- | 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.
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.
587autoMergeToHead :: SessionId -> Connection -> MergeStrategy -> HeadName -> IO (Either RelationalError ())
564autoMergeToHead :: SessionId -> Connection -> MergeStrategy -> HeadName -> IO (Either RelationalError ())
@@ -590,7 +567,7 @@ autoMergeToHead sessionId (InProcessConnection conf) strat headName' = do
590 id1 <- nextRandom
567 id1 <- nextRandom
591 id2 <- nextRandom
568 id2 <- nextRandom
592 id3 <- nextRandom
569 id3 <- nextRandom
593− stamp <- getCurrentTime
570+ tstamp <- getCurrentTime
594 commitLock_ sessionId conf $ \graph -> do
571 commitLock_ sessionId conf $ \graph -> do
595 eSession <- sessionForSessionId sessionId sessions
572 eSession <- sessionForSessionId sessionId sessions
596 case eSession of
573 case eSession of
@@ -601,16 +578,16 @@ autoMergeToHead sessionId (InProcessConnection conf) strat headName' = do
601 Just headTrans -> do
578 Just headTrans -> do
602 --attempt fast-forward commit, if possible
579 --attempt fast-forward commit, if possible
603 let graphInfo = if Sess.parentId session == transactionId headTrans then do
580 let graphInfo = if Sess.parentId session == transactionId headTrans then do
604− ret <- Graph.evalGraphOp stamp id1 (Sess.disconnectedTransaction session) graph Commit
581+ ret <- Graph.evalGraphOp tstamp id1 (Sess.disconnectedTransaction session) graph Commit
605 pure (ret, [id1])
582 pure (ret, [id1])
606 else do
583 else do
607− ret <- Graph.autoMergeToHead stamp (id1, id2, id3) (Sess.disconnectedTransaction session) headName' strat graph
584+ ret <- Graph.autoMergeToHead tstamp (id1, id2, id3) (Sess.disconnectedTransaction session) headName' strat graph
608 pure (ret, [id1,id2,id3])
585 pure (ret, [id1,id2,id3])
609 case graphInfo of
586 case graphInfo of
610 Left err -> pure (Left err)
587 Left err -> pure (Left err)
611 Right ((discon', graph'), transactionIdsAdded) ->
588 Right ((discon', graph'), transactionIdsAdded) ->
612 pure (Right (discon', graph', transactionIdsAdded))
589 pure (Right (discon', graph', transactionIdsAdded))
613−autoMergeToHead sessionId conn@(RemoteProcessConnection _) strat headName' = remoteCall conn (ExecuteAutoMergeToHead sessionId strat headName')
590+autoMergeToHead sessionId conn@(RemoteConnection _) strat headName' = remoteCall conn (ExecuteAutoMergeToHead sessionId strat headName')
614
591
615-- | Execute a database context IO-monad-based expression for the given session and connection. `DatabaseContextIOExpr`s modify the DatabaseContext but cannot be purely implemented.
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.
616--this is almost completely identical to executeDatabaseContextExpr above
593--this is almost completely identical to executeDatabaseContextExpr above
@@ -622,38 +599,35 @@ executeDatabaseContextIOExpr sessionId (InProcessConnection conf) expr = excEith
622 case eSession of
599 case eSession of
623 Left err -> pure (Left err)
600 Left err -> pure (Left err)
624 Right session -> do
601 Right session -> do
602+ graph <- readTVarIO (ipTransactionGraph conf)
603+ let env = RE.DatabaseContextIOEvalEnv transId graph scriptSession
604+ transId = Sess.parentId session
625− res <- RE.evalDatabaseContextIOExpr scriptSession (Sess.concreteDatabaseContext session) expr
605+ context = Sess.concreteDatabaseContext session
606+ res <- RE.runDatabaseContextIOEvalMonad env context (optimizeAndEvalDatabaseContextIOExpr expr)
626 case res of
607 case res of
627 Left err -> pure (Left err)
608 Left err -> pure (Left err)
628− Right context' -> do
609+ Right newState -> do
629− let newDiscon = DisconnectedTransaction (Sess.parentId session) newSchemas True
610+ let newDiscon = DisconnectedTransaction (Sess.parentId session) newSchemas False
630 newSchemas = Schemas context' (Sess.subschemas session)
611 newSchemas = Schemas context' (Sess.subschemas session)
631 newSession = Session newDiscon (Sess.schemaName session)
612 newSession = Session newDiscon (Sess.schemaName session)
613+ context' = RE.dbc_context newState
632− atomically $ STMMap.insert newSession sessionId sessions
614+ atomically $ StmMap.insert newSession sessionId sessions
633 pure (Right ())
615 pure (Right ())
634−executeDatabaseContextIOExpr sessionId conn@(RemoteProcessConnection _) dbExpr = remoteCall conn (ExecuteDatabaseContextIOExpr sessionId dbExpr)
616+executeDatabaseContextIOExpr sessionId conn@(RemoteConnection _) dbExpr = remoteCall conn (ExecuteDatabaseContextIOExpr sessionId dbExpr)
635
617
636−{-
637−executeGraphExprSTM_ :: TransactionId -> SessionId -> Session -> Sessions -> TransactionGraphOperator -> TransactionGraph -> TVar TransactionGraph -> STM (Either RelationalError (TransactionGraph, DisconnectedTransaction)
638−executeGraphExprSTM_ freshId sessionId session sessions graphExpr graph graphTVar= do
639− case evalGraphOp freshId (Sess.disconnectedTransaction session) graph graphExpr of
640− Left err -> do
641− when updateGraphOnError (writeTVar graphTVar graph)
642− pure $ Left err
643− Right (discon', graph') -> do
644− writeTVar graphTVar graph'
645− let newSession = Session discon' (Sess.schemaName session)
646− STMMap.insert newSession sessionId sessions
647− pure $ Right graph'
648−-}
649−
650-- process notifications for commits
618-- process notifications for commits
619+executeCommitExprSTM_
620+ :: TransactionGraph
621+ -> DatabaseContext
622+ -> DatabaseContext
623+ -> ClientNodes
651−executeCommitExprSTM_ :: DatabaseContext -> DatabaseContext -> ClientNodes -> STM (EvaluatedNotifications, ClientNodes)
624+ -> STM (EvaluatedNotifications, ClientNodes)
652−executeCommitExprSTM_ oldContext newContext nodes = do
625+executeCommitExprSTM_ graph oldContext newContext nodes = do
653 let nots = notifications oldContext
626 let nots = notifications oldContext
654− fireNots = notificationChanges nots oldContext newContext
627+ fireNots = notificationChanges nots graph oldContext newContext
655 evaldNots = M.map mkEvaldNot fireNots
628 evaldNots = M.map mkEvaldNot fireNots
656− evalInContext expr ctx = runReader (RE.evalRelationalExpr expr) (RE.mkRelationalExprState ctx)
629+ evalInContext expr ctx = optimizeAndEvalRelationalExpr (RE.mkRelationalExprEnv ctx graph) expr
630+
657 mkEvaldNot notif = EvaluatedNotification { notification = notif,
631 mkEvaldNot notif = EvaluatedNotification { notification = notif,
658 reportOldRelation = evalInContext (reportOldExpr notif) oldContext,
632 reportOldRelation = evalInContext (reportOldExpr notif) oldContext,
659 reportNewRelation = evalInContext (reportNewExpr notif) newContext}
633 reportNewRelation = evalInContext (reportNewExpr notif) newContext}
@@ -668,103 +642,29 @@ executeGraphExpr :: SessionId -> Connection -> TransactionGraphOperator -> IO (E
668executeGraphExpr sessionId (InProcessConnection conf) graphExpr = excEither $ do
642executeGraphExpr sessionId (InProcessConnection conf) graphExpr = excEither $ do
669 let sessions = ipSessions conf
643 let sessions = ipSessions conf
670 freshId <- nextRandom
644 freshId <- nextRandom
671− stamp <- getCurrentTime
645+ tstamp <- getCurrentTime
672 commitLock_ sessionId conf $ \updatedGraph -> do
646 commitLock_ sessionId conf $ \updatedGraph -> do
673 eSession <- sessionForSessionId sessionId sessions
647 eSession <- sessionForSessionId sessionId sessions
674 case eSession of
648 case eSession of
675 Left err -> pure (Left err)
649 Left err -> pure (Left err)
676 Right session -> do
650 Right session -> do
677 let discon = Sess.disconnectedTransaction session
651 let discon = Sess.disconnectedTransaction session
678− case evalGraphOp stamp freshId discon updatedGraph graphExpr of
652+ case evalGraphOp tstamp freshId discon updatedGraph graphExpr of
679 Left err -> pure (Left err)
653 Left err -> pure (Left err)
680 Right (discon', graph') -> do
654 Right (discon', graph') -> do
681 --if freshId appears in the graph, then we need to pass it on
655 --if freshId appears in the graph, then we need to pass it on
682− let transIds = [freshId | isRight (transactionForId freshId graph')]
656+ let transIds = [freshId | isRight (RE.transactionForId freshId graph')]
683 pure (Right (discon', graph', transIds))
657 pure (Right (discon', graph', transIds))
684−{-
658+
685−executeGraphExpr sessionId (InProcessConnection conf) graphExpr = excEither $ do
686− let strat = ipPersistenceStrategy conf
687− clientNodes = ipClientNodes conf
688− sessions = ipSessions conf
689− graphTvar = ipTransactionGraph conf
690− mLockFileH = ipLocks conf
691− lockHandler body = case graphExpr of
692− Commit -> case mLockFileH of
693− Nothing -> body False
694− Just (lockFileH, lockMVar) -> let acquireLocks = do
695− lastWrittenDigest <- takeMVar lockMVar
696− lockFile lockFileH WriteLock
697− latestDigest <- readGraphTransactionIdDigest strat
698− pure (latestDigest /= lastWrittenDigest)
699−
700− releaseLocks _ = do
701− --still holding the lock- get the latest digest
702− gDigest <- readGraphTransactionIdDigest strat
703− unlockFile lockFileH
704− putMVar lockMVar gDigest
705− in bracket acquireLocks releaseLocks body
706− _ -> body False
707− freshId <- nextRandom
708− lockHandler $ \dbWrittenByOtherProcess -> do
709− --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
710− --read transaction data and compare to existing graph
711− --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)
712− manip <- atomically $ do
713− eSession <- sessionForSessionId sessionId sessions
714− --handle graph update by other process
715− oldGraph <- readTVar graphTvar
716− case eSession of
717− Left err -> pure (Left err)
718− Right session -> do
719− let mScriptSession = ipScriptSession conf
720− dbdir = case strat of
721− MinimalPersistence x -> x
722− CrashSafePersistence x -> x
723− _ -> error "accessing dbdir on non-persisted connection"
724− eRefreshedGraph <- if dbWrittenByOtherProcess then
725− unsafeIOToSTM (transactionGraphLoad dbdir oldGraph mScriptSession)
726− else
727− pure (Right oldGraph)
728− case eRefreshedGraph of
729− Left err -> pure (Left (DatabaseLoadError err))
730− Right refreshedGraph -> do
731− --snip it
732− eGraph <- executeGraphExprSTM_ dbWrittenByOtherProcess freshId sessionId session sessions graphExpr refreshedGraph graphTvar
733− --snip it
734− case eGraph of
735− Left err -> pure (Left err)
736− Right newGraph -> do
737− --handle commit
738− if isCommit graphExpr then do
739− case transactionForId (Sess.parentId session) oldGraph of
740− Left err -> pure $ Left err
741− Right previousTrans -> do
742− (evaldNots, nodes) <- executeCommitExprSTM_ (Trans.concreteDatabaseContext previousTrans) (Sess.concreteDatabaseContext session) clientNodes
743− nodesToNotify <- toList (STMSet.stream nodes)
744− pure $ Right (evaldNots, nodesToNotify, newGraph)
745− else
746− pure $ Right (M.empty, [], newGraph)
747− case manip of
748− Left err -> return $ Just err
749− Right (notsToFire, nodesToNotify, newGraph) -> do
750− --update filesystem database, if necessary
751− processTransactionGraphPersistence strat newGraph
752− sendNotifications nodesToNotify (ipLocalNode conf) notsToFire
753− pure Nothing
754−-}
755−executeGraphExpr sessionId conn@(RemoteProcessConnection _) graphExpr = remoteCall conn (ExecuteGraphExpr sessionId graphExpr)
659+executeGraphExpr sessionId conn@(RemoteConnection _) graphExpr = remoteCall conn (ExecuteGraphExpr sessionId graphExpr)
756
660
757-- | A trans-graph expression is a relational query executed against the entirety of a transaction graph.
661-- | A trans-graph expression is a relational query executed against the entirety of a transaction graph.
758executeTransGraphRelationalExpr :: SessionId -> Connection -> TransGraphRelationalExpr -> IO (Either RelationalError Relation)
662executeTransGraphRelationalExpr :: SessionId -> Connection -> TransGraphRelationalExpr -> IO (Either RelationalError Relation)
759executeTransGraphRelationalExpr _ (InProcessConnection conf) tgraphExpr = excEither . atomically $ do
663executeTransGraphRelationalExpr _ (InProcessConnection conf) tgraphExpr = excEither . atomically $ do
760 let graphTvar = ipTransactionGraph conf
664 let graphTvar = ipTransactionGraph conf
761 graph <- readTVar graphTvar
665 graph <- readTVar graphTvar
762− case evalTransGraphRelationalExpr tgraphExpr graph of
666+ pure $ force $ optimizeAndEvalTransGraphRelationalExpr graph tgraphExpr
763− Left err -> pure (Left err)
764− Right relExpr -> case runReader (RE.evalRelationalExpr relExpr) (RE.mkRelationalExprState DBC.empty) of
765− Left err -> pure (Left err)
766− Right rel -> pure (force (Right rel))
767−executeTransGraphRelationalExpr sessionId conn@(RemoteProcessConnection _) tgraphExpr = remoteCall conn (ExecuteTransGraphRelationalExpr sessionId tgraphExpr)
667+executeTransGraphRelationalExpr sessionId conn@(RemoteConnection _) tgraphExpr = remoteCall conn (ExecuteTransGraphRelationalExpr sessionId tgraphExpr)
768
668
769-- | Schema expressions manipulate the isomorphic schemas for the current 'DatabaseContext'.
669-- | Schema expressions manipulate the isomorphic schemas for the current 'DatabaseContext'.
770executeSchemaExpr :: SessionId -> Connection -> Schema.SchemaExpr -> IO (Either RelationalError ())
670executeSchemaExpr :: SessionId -> Connection -> Schema.SchemaExpr -> IO (Either RelationalError ())
@@ -775,32 +675,36 @@ executeSchemaExpr sessionId (InProcessConnection conf) schemaExpr = atomically $
775 Left err -> pure (Left err)
675 Left err -> pure (Left err)
776 Right (session, _) -> do
676 Right (session, _) -> do
777 let subschemas' = subschemas session
677 let subschemas' = subschemas session
678+ transId = Sess.parentId session
679+ context = Sess.concreteDatabaseContext session
680+ graph <- readTVar (ipTransactionGraph conf)
778− case Schema.evalSchemaExpr schemaExpr (Sess.concreteDatabaseContext session) subschemas' of
681+ case Schema.evalSchemaExpr schemaExpr context transId graph subschemas' of
779 Left err -> pure (Left err)
682 Left err -> pure (Left err)
780 Right (newSubschemas, newContext) -> do
683 Right (newSubschemas, newContext) -> do
781 --hm- maybe we should start using lenses
684 --hm- maybe we should start using lenses
782 let discon = Sess.disconnectedTransaction session
685 let discon = Sess.disconnectedTransaction session
783 newSchemas = Schemas newContext newSubschemas
686 newSchemas = Schemas newContext newSubschemas
784− newSession = Session (DisconnectedTransaction (Discon.parentId discon) newSchemas True) (Sess.schemaName session)
687+ newSession = Session (DisconnectedTransaction (Discon.parentId discon) newSchemas False) (Sess.schemaName session)
785− STMMap.insert newSession sessionId sessions
688+ StmMap.insert newSession sessionId sessions
786 pure (Right ())
689 pure (Right ())
787−executeSchemaExpr sessionId conn@(RemoteProcessConnection _) schemaExpr = remoteCall conn (ExecuteSchemaExpr sessionId schemaExpr)
690+executeSchemaExpr sessionId conn@(RemoteConnection _) schemaExpr = remoteCall conn (ExecuteSchemaExpr sessionId schemaExpr)
788
691
789-- | 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.
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.
790commit :: SessionId -> Connection -> IO (Either RelationalError ())
693commit :: SessionId -> Connection -> IO (Either RelationalError ())
791commit sessionId conn@(InProcessConnection _) = executeGraphExpr sessionId conn Commit
694commit sessionId conn@(InProcessConnection _) = executeGraphExpr sessionId conn Commit
792−commit sessionId conn@(RemoteProcessConnection _) = remoteCall conn (ExecuteGraphExpr sessionId Commit)
695+commit sessionId conn@(RemoteConnection _) = remoteCall conn (ExecuteGraphExpr sessionId Commit)
793−
696+
794−sendNotifications :: [ProcessId] -> LocalNode -> EvaluatedNotifications -> IO ()
697+sendNotifications :: [ClientInfo] -> EvaluatedNotifications -> IO ()
795−sendNotifications pids localNode nots = mapM_ sendNots pids
698+sendNotifications clients notifs =
796− where
699+ unless (M.null notifs) $ forM_ clients sender
797− sendNots remoteClientPid =
700+ where
798− unless (M.null nots) $ runProcess localNode $ send remoteClientPid (NotificationMessage nots)
701+ sender (RemoteClientInfo sock) = RPC.sendMessage sock (NotificationMessage notifs)
799−
702+ sender (InProcessClientInfo tvar) = putMVar tvar notifs
703+
800-- | 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.
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.
801rollback :: SessionId -> Connection -> IO (Either RelationalError ())
705rollback :: SessionId -> Connection -> IO (Either RelationalError ())
802rollback sessionId conn@(InProcessConnection _) = executeGraphExpr sessionId conn Rollback
706rollback sessionId conn@(InProcessConnection _) = executeGraphExpr sessionId conn Rollback
803−rollback sessionId conn@(RemoteProcessConnection _) = remoteCall conn (ExecuteGraphExpr sessionId Rollback)
707+rollback sessionId conn@(RemoteConnection _) = remoteCall conn (ExecuteGraphExpr sessionId Rollback)
804
708
805-- | Write the transaction graph to disk. This function can be used to incrementally write new transactions to disk.
709-- | Write the transaction graph to disk. This function can be used to incrementally write new transactions to disk.
806processTransactionGraphPersistence :: PersistenceStrategy -> [TransactionId] -> TransactionGraph -> IO ()
710processTransactionGraphPersistence :: PersistenceStrategy -> [TransactionId] -> TransactionGraph -> IO ()
@@ -816,7 +720,7 @@ readGraphTransactionIdDigest (CrashSafePersistence dbdir) = readGraphTransaction
816-- | 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.
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.
817typeForRelationalExpr :: SessionId -> Connection -> RelationalExpr -> IO (Either RelationalError Relation)
721typeForRelationalExpr :: SessionId -> Connection -> RelationalExpr -> IO (Either RelationalError Relation)
818typeForRelationalExpr sessionId conn@(InProcessConnection _) relExpr = atomically $ typeForRelationalExprSTM sessionId conn relExpr
722typeForRelationalExpr sessionId conn@(InProcessConnection _) relExpr = atomically $ typeForRelationalExprSTM sessionId conn relExpr
819−typeForRelationalExpr sessionId conn@(RemoteProcessConnection _) relExpr = remoteCall conn (ExecuteTypeForRelationalExpr sessionId relExpr)
723+typeForRelationalExpr sessionId conn@(RemoteConnection _) relExpr = remoteCall conn (ExecuteTypeForRelationalExpr sessionId relExpr)
820
724
821typeForRelationalExprSTM :: SessionId -> Connection -> RelationalExpr -> STM (Either RelationalError Relation)
725typeForRelationalExprSTM :: SessionId -> Connection -> RelationalExpr -> STM (Either RelationalError Relation)
822typeForRelationalExprSTM sessionId (InProcessConnection conf) relExpr = do
726typeForRelationalExprSTM sessionId (InProcessConnection conf) relExpr = do
@@ -831,7 +735,10 @@ typeForRelationalExprSTM sessionId (InProcessConnection conf) relExpr = do
831 Schema.processRelationalExprInSchema schema relExpr
735 Schema.processRelationalExprInSchema schema relExpr
832 case processed of
736 case processed of
833 Left err -> pure (Left err)
737 Left err -> pure (Left err)
738+ Right relExpr' -> do
739+ graph <- readTVar (ipTransactionGraph conf)
834− Right relExpr' -> pure $ runReader (RE.typeForRelationalExpr relExpr') (RE.mkRelationalExprState (Sess.concreteDatabaseContext session))
740+ let reEnv = RE.mkRelationalExprEnv (Sess.concreteDatabaseContext session) graph
741+ pure $ RE.runRelationalExprM reEnv (RE.typeForRelationalExpr relExpr')
835
742
836typeForRelationalExprSTM _ _ _ = error "typeForRelationalExprSTM called on non-local connection"
743typeForRelationalExprSTM _ _ _ = error "typeForRelationalExprSTM called on non-local connection"
837
744
@@ -850,7 +757,7 @@ inclusionDependencies sessionId (InProcessConnection conf) = do
850 else
757 else
851 pure (Schema.inclusionDependenciesInSchema schema (B.inclusionDependencies context))
758 pure (Schema.inclusionDependenciesInSchema schema (B.inclusionDependencies context))
852
759
853−inclusionDependencies sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveInclusionDependencies sessionId)
760+inclusionDependencies sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveInclusionDependencies sessionId)
854
761
855typeConstructorMapping :: SessionId -> Connection -> IO (Either RelationalError TypeConstructorMapping)
762typeConstructorMapping :: SessionId -> Connection -> IO (Either RelationalError TypeConstructorMapping)
856typeConstructorMapping sessionId (InProcessConnection conf) = do
763typeConstructorMapping sessionId (InProcessConnection conf) = do
@@ -861,22 +768,27 @@ typeConstructorMapping sessionId (InProcessConnection conf) = do
861 Left err -> pure $ Left err
768 Left err -> pure $ Left err
862 Right (session, _) -> --warning, no schema support for typeconstructors
769 Right (session, _) -> --warning, no schema support for typeconstructors
863 pure (Right (B.typeConstructorMapping (Sess.concreteDatabaseContext session)))
770 pure (Right (B.typeConstructorMapping (Sess.concreteDatabaseContext session)))
864−typeConstructorMapping sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveTypeConstructorMapping sessionId)
771+typeConstructorMapping sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveTypeConstructorMapping sessionId)
865
772
866-- | 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.
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.
867−planForDatabaseContextExpr :: SessionId -> Connection -> DatabaseContextExpr -> IO (Either RelationalError DatabaseContextExpr)
774+planForDatabaseContextExpr :: SessionId -> Connection -> DatabaseContextExpr -> IO (Either RelationalError GraphRefDatabaseContextExpr)
868planForDatabaseContextExpr sessionId (InProcessConnection conf) dbExpr = do
775planForDatabaseContextExpr sessionId (InProcessConnection conf) dbExpr = do
869 let sessions = ipSessions conf
776 let sessions = ipSessions conf
870 atomically $ do
777 atomically $ do
778+ graph <- readTVar (ipTransactionGraph conf)
871 eSession <- sessionAndSchema sessionId sessions
779 eSession <- sessionAndSchema sessionId sessions
872 case eSession of
780 case eSession of
873 Left err -> pure $ Left err
781 Left err -> pure $ Left err
782+ Right (session, _) ->
874− Right (session, _) -> if schemaName session == defaultSchemaName then
783+ if schemaName session == defaultSchemaName then do
875− pure $ evalState (applyStaticDatabaseOptimization dbExpr) (RE.freshDatabaseState (Sess.concreteDatabaseContext session))
784+ let ctx = Sess.concreteDatabaseContext session
785+ transId = Sess.parentId session
786+ gfExpr = runProcessExprM UncommittedContextMarker (processDatabaseContextExpr dbExpr)
787+ pure $ runGraphRefSOptDatabaseContextExprM transId ctx graph (optimizeGraphRefDatabaseContextExpr gfExpr)
876− 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
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-}
877− pure (Right dbExpr)
789+ pure (Left NonConcreteSchemaPlanError)
878
790
879−planForDatabaseContextExpr sessionId conn@(RemoteProcessConnection _) dbExpr = remoteCall conn (RetrievePlanForDatabaseContextExpr sessionId dbExpr)
791+planForDatabaseContextExpr sessionId conn@(RemoteConnection _) dbExpr = remoteCall conn (RetrievePlanForDatabaseContextExpr sessionId dbExpr)
880
792
881-- | Return a relation which represents the current state of the global transaction graph. The attributes are
793-- | Return a relation which represents the current state of the global transaction graph. The attributes are
882-- * current- boolean attribute representing whether or not the current session references this transaction
794-- * current- boolean attribute representing whether or not the current session references this transaction
@@ -894,26 +806,29 @@ transactionGraphAsRelation sessionId (InProcessConnection conf) = do
894 Right session ->
806 Right session ->
895 graphAsRelation (Sess.disconnectedTransaction session) <$> readTVar tvar
807 graphAsRelation (Sess.disconnectedTransaction session) <$> readTVar tvar
896
808
897−transactionGraphAsRelation sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveTransactionGraph sessionId)
809+transactionGraphAsRelation sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveTransactionGraph sessionId)
898
810
899-- | Returns the names and types of the relation variables in the current 'Session'.
811-- | Returns the names and types of the relation variables in the current 'Session'.
900relationVariablesAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
812relationVariablesAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
901relationVariablesAsRelation sessionId (InProcessConnection conf) = do
813relationVariablesAsRelation sessionId (InProcessConnection conf) = do
902 let sessions = ipSessions conf
814 let sessions = ipSessions conf
903 atomically $ do
815 atomically $ do
816+ graph <- readTVar (ipTransactionGraph conf)
904 eSession <- sessionAndSchema sessionId sessions
817 eSession <- sessionAndSchema sessionId sessions
905 case eSession of
818 case eSession of
906 Left err -> pure (Left err)
819 Left err -> pure (Left err)
907 Right (session, schema) -> do
820 Right (session, schema) -> do
908 let context = Sess.concreteDatabaseContext session
821 let context = Sess.concreteDatabaseContext session
909 if Sess.schemaName session == defaultSchemaName then
822 if Sess.schemaName session == defaultSchemaName then
910− pure $ R.relationVariablesAsRelation (relationVariables context)
823+ pure $ RE.relationVariablesAsRelation context graph
911 else
824 else
912− case Schema.relationVariablesInSchema schema context of
825+ case Schema.relationVariablesInSchema schema of
913 Left err -> pure (Left err)
826 Left err -> pure (Left err)
827+ Right relvars -> do
828+ let schemaContext = context {relationVariables = relvars }
914− Right relvars -> pure $ R.relationVariablesAsRelation relvars
829+ pure $ RE.relationVariablesAsRelation schemaContext graph
915
830
916−relationVariablesAsRelation sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveRelationVariableSummary sessionId)
831+relationVariablesAsRelation sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveRelationVariableSummary sessionId)
917
832
918-- | Returns the names and types of the atom functions in the current 'Session'.
833-- | Returns the names and types of the atom functions in the current 'Session'.
919atomFunctionsAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
834atomFunctionsAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
@@ -923,10 +838,10 @@ atomFunctionsAsRelation sessionId (InProcessConnection conf) = do
923 eSession <- sessionAndSchema sessionId sessions
838 eSession <- sessionAndSchema sessionId sessions
924 case eSession of
839 case eSession of
925 Left err -> pure (Left err)
840 Left err -> pure (Left err)
926− Right (session, _) -> do
841+ Right (session, _) ->
927 pure (AF.atomFunctionsAsRelation (atomFunctions (concreteDatabaseContext session)))
842 pure (AF.atomFunctionsAsRelation (atomFunctions (concreteDatabaseContext session)))
928
843
929−atomFunctionsAsRelation sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveAtomFunctionSummary sessionId)
844+atomFunctionsAsRelation sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveAtomFunctionSummary sessionId)
930
845
931databaseContextFunctionsAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
846databaseContextFunctionsAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
932databaseContextFunctionsAsRelation sessionId (InProcessConnection conf) = do
847databaseContextFunctionsAsRelation sessionId (InProcessConnection conf) = do
@@ -935,10 +850,10 @@ databaseContextFunctionsAsRelation sessionId (InProcessConnection conf) = do
935 eSession <- sessionAndSchema sessionId sessions
850 eSession <- sessionAndSchema sessionId sessions
936 case eSession of
851 case eSession of
937 Left err -> pure (Left err)
852 Left err -> pure (Left err)
938− Right (session, _) -> do
853+ Right (session, _) ->
939 pure (DCF.databaseContextFunctionsAsRelation (dbcFunctions (concreteDatabaseContext session)))
854 pure (DCF.databaseContextFunctionsAsRelation (dbcFunctions (concreteDatabaseContext session)))
940
855
941−databaseContextFunctionsAsRelation sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveDatabaseContextFunctionSummary sessionId)
856+databaseContextFunctionsAsRelation sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveDatabaseContextFunctionSummary sessionId)
942
857
943-- | Returns the transaction id for the connection's disconnected transaction committed parent transaction.
858-- | Returns the transaction id for the connection's disconnected transaction committed parent transaction.
944headTransactionId :: SessionId -> Connection -> IO (Either RelationalError TransactionId)
859headTransactionId :: SessionId -> Connection -> IO (Either RelationalError TransactionId)
@@ -949,7 +864,7 @@ headTransactionId sessionId (InProcessConnection conf) = do
949 case eSession of
864 case eSession of
950 Left err -> pure (Left err)
865 Left err -> pure (Left err)
951 Right session -> pure $ Right (Sess.parentId session)
866 Right session -> pure $ Right (Sess.parentId session)
952−headTransactionId sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveHeadTransactionId sessionId)
867+headTransactionId sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveHeadTransactionId sessionId)
953
868
954headNameSTM_ :: SessionId -> Sessions -> TVar TransactionGraph -> STM (Either RelationalError HeadName)
869headNameSTM_ :: SessionId -> Sessions -> TVar TransactionGraph -> STM (Either RelationalError HeadName)
955headNameSTM_ sessionId sessions graphTvar = do
870headNameSTM_ sessionId sessions graphTvar = do
@@ -957,7 +872,7 @@ headNameSTM_ sessionId sessions graphTvar = do
957 eSession <- sessionForSessionId sessionId sessions
872 eSession <- sessionForSessionId sessionId sessions
958 case eSession of
873 case eSession of
959 Left err -> pure (Left err)
874 Left err -> pure (Left err)
960− Right session -> case transactionForId (Sess.parentId session) graph of
875+ Right session -> case RE.transactionForId (Sess.parentId session) graph of
961 Left err -> pure (Left err)
876 Left err -> pure (Left err)
962 Right parentTrans -> case headNameForTransaction parentTrans graph of
877 Right parentTrans -> case headNameForTransaction parentTrans graph of
963 Nothing -> pure (Left UnknownHeadError)
878 Nothing -> pure (Left UnknownHeadError)
@@ -969,7 +884,7 @@ headName sessionId (InProcessConnection conf) = do
969 let sessions = ipSessions conf
884 let sessions = ipSessions conf
970 graphTvar = ipTransactionGraph conf
885 graphTvar = ipTransactionGraph conf
971 atomically (headNameSTM_ sessionId sessions graphTvar)
886 atomically (headNameSTM_ sessionId sessions graphTvar)
972−headName sessionId conn@(RemoteProcessConnection _) = remoteCall conn (ExecuteHeadName sessionId)
887+headName sessionId conn@(RemoteConnection _) = remoteCall conn (ExecuteHeadName sessionId)
973
888
974-- | Returns a listing of all available atom types.
889-- | Returns a listing of all available atom types.
975atomTypesAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
890atomTypesAsRelation :: SessionId -> Connection -> IO (Either RelationalError Relation)
@@ -983,7 +898,7 @@ atomTypesAsRelation sessionId (InProcessConnection conf) = do
983 case typesAsRelation (B.typeConstructorMapping (Sess.concreteDatabaseContext session)) of
898 case typesAsRelation (B.typeConstructorMapping (Sess.concreteDatabaseContext session)) of
984 Left err -> pure (Left err)
899 Left err -> pure (Left err)
985 Right rel -> pure (Right rel)
900 Right rel -> pure (Right rel)
986−atomTypesAsRelation sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveAtomTypesAsRelation sessionId)
901+atomTypesAsRelation sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveAtomTypesAsRelation sessionId)
987
902
988disconnectedTransactionIsDirty :: SessionId -> Connection -> IO (Either RelationalError Bool)
903disconnectedTransactionIsDirty :: SessionId -> Connection -> IO (Either RelationalError Bool)
989disconnectedTransactionIsDirty sessionId (InProcessConnection conf) = do
904disconnectedTransactionIsDirty sessionId (InProcessConnection conf) = do
@@ -994,23 +909,23 @@ disconnectedTransactionIsDirty sessionId (InProcessConnection conf) = do
994 Left err -> pure (Left err)
909 Left err -> pure (Left err)
995 Right session ->
910 Right session ->
996 pure (Right (isDirty session))
911 pure (Right (isDirty session))
997−disconnectedTransactionIsDirty sessionId conn@(RemoteProcessConnection _) = remoteCall conn (RetrieveSessionIsDirty sessionId)
912+disconnectedTransactionIsDirty sessionId conn@(RemoteConnection _) = remoteCall conn (RetrieveSessionIsDirty sessionId)
998
913
999--used only for testing- we expect this to throw an exception
914--used only for testing- we expect this to throw an exception
1000callTestTimeout_ :: SessionId -> Connection -> IO Bool
915callTestTimeout_ :: SessionId -> Connection -> IO Bool
1001callTestTimeout_ _ (InProcessConnection _) = error "bad testing call"
916callTestTimeout_ _ (InProcessConnection _) = error "bad testing call"
1002−callTestTimeout_ sessionId conn@(RemoteProcessConnection _) = remoteCall conn (TestTimeout sessionId)
917+callTestTimeout_ sessionId conn@(RemoteConnection _) = remoteCall conn (TestTimeout sessionId)
1003
918
1004--used in tests only
919--used in tests only
1005transactionGraph_ :: Connection -> IO TransactionGraph
920transactionGraph_ :: Connection -> IO TransactionGraph
1006−transactionGraph_ (InProcessConnection conf) = atomically $ readTVar (ipTransactionGraph conf)
921+transactionGraph_ (InProcessConnection conf) = readTVarIO (ipTransactionGraph conf)
1007transactionGraph_ _ = error "remote connection used"
922transactionGraph_ _ = error "remote connection used"
1008
923
1009--used in tests only
924--used in tests only
1010disconnectedTransaction_ :: SessionId -> Connection -> IO DisconnectedTransaction
925disconnectedTransaction_ :: SessionId -> Connection -> IO DisconnectedTransaction
1011disconnectedTransaction_ sessionId (InProcessConnection conf) = do
926disconnectedTransaction_ sessionId (InProcessConnection conf) = do
1012 let sessions = ipSessions conf
927 let sessions = ipSessions conf
1013− mSession <- atomically $ STMMap.lookup sessionId sessions
928+ mSession <- atomically $ StmMap.lookup sessionId sessions
1014 case mSession of
929 case mSession of
1015 Nothing -> error "No such session"
930 Nothing -> error "No such session"
1016 Just (Sess.Session discon _) -> pure discon
931 Just (Sess.Session discon _) -> pure discon
@@ -1068,13 +983,13 @@ commitLock_ sessionId conf stmBlock = do
1068 Right (discon', graph', transactionIdsToPersist) -> do
983 Right (discon', graph', transactionIdsToPersist) -> do
1069 writeTVar graphTvar graph'
984 writeTVar graphTvar graph'
1070 let newSession = Session discon' (Sess.schemaName session)
985 let newSession = Session discon' (Sess.schemaName session)
1071− STMMap.insert newSession sessionId sessions
986+ StmMap.insert newSession sessionId sessions
1072− case transactionForId (Sess.parentId session) oldGraph of
987+ case RE.transactionForId (Sess.parentId session) oldGraph of
1073 Left err -> pure $ Left err
988 Left err -> pure $ Left err
1074 Right previousTrans ->
989 Right previousTrans ->
1075 if not (Prelude.null transactionIdsToPersist) then do
990 if not (Prelude.null transactionIdsToPersist) then do
1076− (evaldNots, nodes) <- executeCommitExprSTM_ (Trans.concreteDatabaseContext previousTrans) (Sess.concreteDatabaseContext session) clientNodes
991+ (evaldNots, nodes) <- executeCommitExprSTM_ graph' (Trans.concreteDatabaseContext previousTrans) (Sess.concreteDatabaseContext session) clientNodes
1077− nodesToNotify <- toList (STMSet.stream nodes)
992+ nodesToNotify <- stmSetToList nodes
1078 pure $ Right (evaldNots, nodesToNotify, graph', transactionIdsToPersist)
993 pure $ Right (evaldNots, nodesToNotify, graph', transactionIdsToPersist)
1079 else pure (Right (M.empty, [], graph', []))
994 else pure (Right (M.empty, [], graph', []))
1080
995
@@ -1084,15 +999,8 @@ commitLock_ sessionId conf stmBlock = do
1084 Right (notsToFire, nodesToNotify, newGraph, transactionIdsToPersist) -> do
999 Right (notsToFire, nodesToNotify, newGraph, transactionIdsToPersist) -> do
1085 --update filesystem database, if necessary
1000 --update filesystem database, if necessary
1086 processTransactionGraphPersistence strat transactionIdsToPersist newGraph
1001 processTransactionGraphPersistence strat transactionIdsToPersist newGraph
1087− sendNotifications nodesToNotify (ipLocalNode conf) notsToFire
1002+ sendNotifications nodesToNotify notsToFire
1088 pure (Right ())
1003 pure (Right ())
1089−{-
1090−writeDisconAndGraph_ :: TVar TransactionGraph -> SessionId -> Session -> Sessions -> DisconnectedTransaction -> TransactionGraph -> STM ()
1091−writeDisconAndGraph_ graphTvar sessionId session sessions discon graph = do
1092− writeTVar graphTvar graph
1093− let newSession = Session discon (Sess.schemaName session)
1094− STMMap.insert newSession sessionId sessions
1095−-}
1096
1004
1097-- | Runs an IO monad, commits the result when the monad returns no errors, otherwise, rolls back the changes and the error.
1005-- | Runs an IO monad, commits the result when the monad returns no errors, otherwise, rolls back the changes and the error.
1098withTransaction :: SessionId -> Connection -> IO (Either RelationalError a) -> IO (Either RelationalError ()) -> IO (Either RelationalError a)
1006withTransaction :: SessionId -> Connection -> IO (Either RelationalError a) -> IO (Either RelationalError ()) -> IO (Either RelationalError a)
@@ -1117,3 +1025,71 @@ withTransaction sessionId conn io successFunc = bracketOnError (pure ()) (const
1117 Right _ -> pure (Right val)
1025 Right _ -> pure (Right val)
1118 else -- no updates executed, so don't create a commit
1026 else -- no updates executed, so don't create a commit
1119 pure (Right val)
1027 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−1
@@ -25,7 +25,8 @@ module ProjectM36.Client.Simple (
25 C.PersistenceStrategy(..),
25 C.PersistenceStrategy(..),
26 C.NotificationCallback,
26 C.NotificationCallback,
27 C.emptyNotificationCallback,
27 C.emptyNotificationCallback,
28− C.DatabaseContextExpr(..),
28+ C.DatabaseContextExprBase(..),
29+ C.DatabaseContextExpr,
29 C.RelationalExprBase(..)
30 C.RelationalExprBase(..)
30 ) where
31 ) where
31
32
src/lib/ProjectM36/DataConstructorDef.hs+2−3
@@ -1,6 +1,5 @@
1module ProjectM36.DataConstructorDef where
1module ProjectM36.DataConstructorDef where
2−import ProjectM36.Base
2+import ProjectM36.Base as B
3−import qualified ProjectM36.TypeConstructor as TC
4import qualified Data.Set as S
3import qualified Data.Set as S
5
4
6emptyDataConstructor :: DataConstructorName -> DataConstructorDef
5emptyDataConstructor :: DataConstructorName -> DataConstructorDef
@@ -16,6 +15,6 @@ typeVars :: DataConstructorDef -> S.Set TypeVarName
16typeVars (DataConstructorDef _ tConsArgs) = S.unions $ map typeVarsInDefArg tConsArgs
15typeVars (DataConstructorDef _ tConsArgs) = S.unions $ map typeVarsInDefArg tConsArgs
17
16
18typeVarsInDefArg :: DataConstructorDefArg -> S.Set TypeVarName
17typeVarsInDefArg :: DataConstructorDefArg -> S.Set TypeVarName
19−typeVarsInDefArg (DataConstructorDefTypeConstructorArg tCons) = TC.typeVars tCons
18+typeVarsInDefArg (DataConstructorDefTypeConstructorArg tCons) = B.typeVars tCons
20typeVarsInDefArg (DataConstructorDefTypeVarNameArg pVarName) = S.singleton pVarName
19typeVarsInDefArg (DataConstructorDefTypeVarNameArg pVarName) = S.singleton pVarName
21
20
src/lib/ProjectM36/DataFrame.hsnew file+183
@@ -0,0 +1,183 @@
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+4−2
@@ -1,10 +1,11 @@
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
5import ProjectM36.DataTypes.Either
4import ProjectM36.DataTypes.Either
6import ProjectM36.DataTypes.Maybe
5import ProjectM36.DataTypes.Maybe
7import ProjectM36.DataTypes.List
6import ProjectM36.DataTypes.List
7+import ProjectM36.DataTypes.NonEmptyList
8+import ProjectM36.DataTypes.Interval
8import ProjectM36.Base
9import ProjectM36.Base
9
10
10basicTypeConstructorMapping :: TypeConstructorMapping
11basicTypeConstructorMapping :: TypeConstructorMapping
@@ -12,6 +13,7 @@ basicTypeConstructorMapping = primitiveTypeConstructorMapping ++
12 maybeTypeConstructorMapping ++
13 maybeTypeConstructorMapping ++
13 eitherTypeConstructorMapping ++
14 eitherTypeConstructorMapping ++
14 listTypeConstructorMapping ++
15 listTypeConstructorMapping ++
15− dayTypeConstructorMapping
16+ nonEmptyListTypeConstructorMapping ++
17+ intervalTypeConstructorMapping
16
18
17
19
src/lib/ProjectM36/DataTypes/Day.hs+2−5
@@ -7,14 +7,11 @@ import Data.Time.Calendar
7dayAtomFunctions :: AtomFunctions
7dayAtomFunctions :: AtomFunctions
8dayAtomFunctions = HS.fromList [
8dayAtomFunctions = HS.fromList [
9 AtomFunction { atomFuncName = "fromGregorian",
9 AtomFunction { atomFuncName = "fromGregorian",
10− atomFuncType = [IntAtomType, IntAtomType, IntAtomType, DayAtomType],
10+ atomFuncType = [IntegerAtomType, IntegerAtomType, IntegerAtomType, DayAtomType],
11− atomFuncBody = compiledAtomFunctionBody $ \(IntAtom year:IntAtom month:IntAtom day:_) -> pure $ DayAtom (fromGregorian (fromIntegral year) (fromIntegral month) (fromIntegral day))
11+ atomFuncBody = compiledAtomFunctionBody $ \(IntegerAtom year:IntegerAtom month:IntegerAtom 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+56−17
@@ -6,7 +6,24 @@ 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
9
12
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+
10-- in lieu of typeclass support, we just hard-code the types which can be part of an interval
27-- in lieu of typeclass support, we just hard-code the types which can be part of an interval
11supportsInterval :: AtomType -> Bool
28supportsInterval :: AtomType -> Bool
12supportsInterval typ = case typ of
29supportsInterval typ = case typ of
@@ -18,9 +35,9 @@ supportsInterval typ = case typ of
18 DateTimeAtomType -> True
35 DateTimeAtomType -> True
19 ByteStringAtomType -> False
36 ByteStringAtomType -> False
20 BoolAtomType -> False
37 BoolAtomType -> False
21− IntervalAtomType _ -> False
22 RelationAtomType _ -> False
38 RelationAtomType _ -> False
23 ConstructedAtomType _ _ -> False --once we support an interval-style typeclass, we might enable this
39 ConstructedAtomType _ _ -> False --once we support an interval-style typeclass, we might enable this
40+ RelationalExprAtomType -> False
24 TypeVariableType _ -> False
41 TypeVariableType _ -> False
25
42
26supportsOrdering :: AtomType -> Bool
43supportsOrdering :: AtomType -> Bool
@@ -33,8 +50,8 @@ supportsOrdering typ = case typ of
33 DateTimeAtomType -> True
50 DateTimeAtomType -> True
34 ByteStringAtomType -> False
51 ByteStringAtomType -> False
35 BoolAtomType -> False
52 BoolAtomType -> False
36− IntervalAtomType _ -> False
37 RelationAtomType _ -> False
53 RelationAtomType _ -> False
54+ RelationalExprAtomType -> False
38 ConstructedAtomType _ _ -> False --once we support an interval-style typeclass, we might enable this
55 ConstructedAtomType _ _ -> False --once we support an interval-style typeclass, we might enable this
39 TypeVariableType _ -> False
56 TypeVariableType _ -> False
40
57
@@ -67,7 +84,11 @@ createInterval atom1 atom2 bopen eopen = do
67 else
84 else
68 Right valid
85 Right valid
69 LT -> Right valid
86 LT -> Right valid
70− where valid = IntervalAtom atom1 atom2 bopen eopen
87+ where valid = ConstructedAtom "Interval" iType [atom1, atom2, BoolAtom bopen, BoolAtom eopen]
88+ iType = intervalAtomType (atomTypeForAtom atom1)
89+
90+intervalAtomType :: AtomType -> AtomType
91+intervalAtomType typ = ConstructedAtomType "Interval" (M.singleton "a" typ)
71
92
72intervalAtomFunctions :: AtomFunctions
93intervalAtomFunctions :: AtomFunctions
73intervalAtomFunctions = HS.fromList [
94intervalAtomFunctions = HS.fromList [
@@ -76,7 +97,7 @@ intervalAtomFunctions = HS.fromList [
76 TypeVariableType "a",
97 TypeVariableType "a",
77 BoolAtomType,
98 BoolAtomType,
78 BoolAtomType,
99 BoolAtomType,
79− IntervalAtomType (TypeVariableType "a")],
100+ intervalAtomType (TypeVariableType "a")],
80 atomFuncBody = compiledAtomFunctionBody $ \(atom1:atom2:BoolAtom bopen:BoolAtom eopen:_) -> do
101 atomFuncBody = compiledAtomFunctionBody $ \(atom1:atom2:BoolAtom bopen:BoolAtom eopen:_) -> do
81 let aType = atomTypeForAtom atom1
102 let aType = atomTypeForAtom atom1
82 if supportsInterval aType then
103 if supportsInterval aType then
@@ -86,22 +107,40 @@ intervalAtomFunctions = HS.fromList [
86 },
107 },
87 AtomFunction {
108 AtomFunction {
88 atomFuncName = "interval_overlaps",
109 atomFuncName = "interval_overlaps",
89− atomFuncType = [IntervalAtomType (TypeVariableType "a"),
110+ atomFuncType = [intervalAtomType (TypeVariableType "a"),
90− IntervalAtomType (TypeVariableType "a"),
111+ intervalAtomType (TypeVariableType "a"),
91 BoolAtomType],
112 BoolAtomType],
92− atomFuncBody = compiledAtomFunctionBody $ \(i1@IntervalAtom{}:i2@IntervalAtom{}:_) ->
113+ atomFuncBody = compiledAtomFunctionBody $ \(i1@ConstructedAtom{}:i2@ConstructedAtom{}:_) ->
93 BoolAtom <$> intervalOverlaps i1 i2
114 BoolAtom <$> intervalOverlaps i1 i2
94 }]
115 }]
95−
116+
96−
117+isIntervalAtomType :: AtomType -> Bool
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+
97intervalOverlaps :: Atom -> Atom -> Either AtomFunctionError Bool
124intervalOverlaps :: Atom -> Atom -> Either AtomFunctionError Bool
98−intervalOverlaps (IntervalAtom i1start i1end i1startopen i1endopen) (IntervalAtom i2start i2end i2startopen i2endopen) = do
125+intervalOverlaps (ConstructedAtom dCons1 typ1 [i1start,
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)
99− cmp1 <- atomCompare i1start i2end
134+ cmp1 <- atomCompare i1start i2end
100− cmp2 <- atomCompare i2start i1end
135+ cmp2 <- atomCompare i2start i1end
101− let startcmp = if i1startopen || i2endopen then oplt else oplte
136+ let startcmp = if i1startopen || i2endopen then oplt else oplte
102− endcmp = if i2startopen || i1endopen then oplt else oplte
137+ endcmp = if i2startopen || i1endopen then oplt else oplte
103− oplte op = op == LT || op == EQ
138+ oplte op = op == LT || op == EQ
104− oplt op = op == LT
139+ oplt op = op == LT
105− pure (startcmp cmp1 && endcmp cmp2)
140+ pure (startcmp cmp1 && endcmp cmp2)
106intervalOverlaps _ _ = Left AtomFunctionTypeMismatchError
141intervalOverlaps _ _ = Left AtomFunctionTypeMismatchError
107
142
143+intervalTypeConstructorMapping :: TypeConstructorMapping
144+intervalTypeConstructorMapping = [(ADTypeConstructorDef "Interval" ["a"], [])]
145+
146+
src/lib/ProjectM36/DataTypes/NonEmptyList.hsnew file+53
@@ -0,0 +1,53 @@
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+7−2
@@ -10,7 +10,9 @@ 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)
14 ]
16 ]
15
17
16intTypeConstructor :: TypeConstructor
18intTypeConstructor :: TypeConstructor
@@ -25,6 +27,9 @@ textTypeConstructor = PrimitiveTypeConstructor "Text" TextAtomType
25dayTypeConstructor :: TypeConstructor
27dayTypeConstructor :: TypeConstructor
26dayTypeConstructor = PrimitiveTypeConstructor "Day" DayAtomType
28dayTypeConstructor = PrimitiveTypeConstructor "Day" DayAtomType
27
29
30+dateTimeTypeConstructor :: TypeConstructor
31+dateTimeTypeConstructor = PrimitiveTypeConstructor "DateTime" DayAtomType
32+
28-- | Return the type of an 'Atom'.
33-- | Return the type of an 'Atom'.
29atomTypeForAtom :: Atom -> AtomType
34atomTypeForAtom :: Atom -> AtomType
30atomTypeForAtom (IntAtom _) = IntAtomType
35atomTypeForAtom (IntAtom _) = IntAtomType
@@ -35,6 +40,6 @@ atomTypeForAtom (DayAtom _) = DayAtomType
35atomTypeForAtom (DateTimeAtom _) = DateTimeAtomType
40atomTypeForAtom (DateTimeAtom _) = DateTimeAtomType
36atomTypeForAtom (ByteStringAtom _) = ByteStringAtomType
41atomTypeForAtom (ByteStringAtom _) = ByteStringAtomType
37atomTypeForAtom (BoolAtom _) = BoolAtomType
42atomTypeForAtom (BoolAtom _) = BoolAtomType
38−atomTypeForAtom (IntervalAtom a _ _ _) = IntervalAtomType (atomTypeForAtom a)
39atomTypeForAtom (RelationAtom (Relation attrs _)) = RelationAtomType attrs
43atomTypeForAtom (RelationAtom (Relation attrs _)) = RelationAtomType attrs
40atomTypeForAtom (ConstructedAtom _ aType _) = aType
44atomTypeForAtom (ConstructedAtom _ aType _) = aType
45+atomTypeForAtom (RelationalExprAtom _) = RelationalExprAtomType
src/lib/ProjectM36/DataTypes/Sorting.hsnew file+31
@@ -0,0 +1,31 @@
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+24−5
@@ -1,11 +1,15 @@
1module ProjectM36.DatabaseContext where
1module ProjectM36.DatabaseContext where
2import ProjectM36.Base
2import ProjectM36.Base
3+import Control.Monad (void)
3import qualified Data.Map as M
4import qualified Data.Map as M
4import qualified Data.HashSet as HS
5import qualified Data.HashSet as HS
5import ProjectM36.DataTypes.Basic
6import ProjectM36.DataTypes.Basic
6import ProjectM36.AtomFunctions.Basic
7import 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
9
13
10empty :: DatabaseContext
14empty :: DatabaseContext
11empty = DatabaseContext { inclusionDependencies = M.empty,
15empty = DatabaseContext { inclusionDependencies = M.empty,
@@ -14,22 +18,37 @@ empty = DatabaseContext { inclusionDependencies = M.empty,
14 atomFunctions = HS.empty,
18 atomFunctions = HS.empty,
15 dbcFunctions = HS.empty,
19 dbcFunctions = HS.empty,
16 typeConstructorMapping = [] }
20 typeConstructorMapping = [] }
21+
22+-- | Remove TransactionId markers on GraphRefRelationalExpr
23+stripGraphRefRelationalExpr :: GraphRefRelationalExpr -> RelationalExpr
24+stripGraphRefRelationalExpr = void
17
25
18-- | convert an existing database context into its constituent expression.
26-- | convert an existing database context into its constituent expression.
19databaseContextAsDatabaseContextExpr :: DatabaseContext -> DatabaseContextExpr
27databaseContextAsDatabaseContextExpr :: DatabaseContext -> DatabaseContextExpr
20databaseContextAsDatabaseContextExpr context = MultipleExpr $ relVarsExprs ++ incDepsExprs ++ funcsExprs
28databaseContextAsDatabaseContextExpr context = MultipleExpr $ relVarsExprs ++ incDepsExprs ++ funcsExprs
21 where
29 where
22− relVarsExprs = map (\(name, rel) -> Assign name (ExistingRelation rel)) (M.toList (relationVariables context))
30+ relVarsExprs = map (\(name, rel) -> Assign name (stripGraphRefRelationalExpr rel)) (M.toList (relationVariables context))
23 incDepsExprs :: [DatabaseContextExpr]
31 incDepsExprs :: [DatabaseContextExpr]
24 incDepsExprs = map (uncurry AddInclusionDependency) (M.toList (inclusionDependencies context))
32 incDepsExprs = map (uncurry AddInclusionDependency) (M.toList (inclusionDependencies context))
25− funcsExprs = [] -- map (\func -> ) (HS.toList funcs) -- there are no databaseExprs to add atom functions yet
33+ funcsExprs = [] -- map (\func -> ) (HS.toList funcs) -- there are no databaseExprs to add atom functions yet-}
26
34
27basicDatabaseContext :: DatabaseContext
35basicDatabaseContext :: DatabaseContext
28basicDatabaseContext = DatabaseContext { inclusionDependencies = M.empty,
36basicDatabaseContext = DatabaseContext { inclusionDependencies = M.empty,
29− relationVariables = M.fromList [("true", relationTrue),
37+ relationVariables = M.fromList [("true", ExistingRelation relationTrue),
30− ("false", relationFalse)],
38+ ("false", ExistingRelation relationFalse)],
31 atomFunctions = basicAtomFunctions,
39 atomFunctions = basicAtomFunctions,
32 dbcFunctions = basicDatabaseContextFunctions,
40 dbcFunctions = basicDatabaseContextFunctions,
33 notifications = M.empty,
41 notifications = M.empty,
34 typeConstructorMapping = basicTypeConstructorMapping
42 typeConstructorMapping = basicTypeConstructorMapping
35 }
43 }
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+19−4
@@ -1,7 +1,9 @@
1+{-# LANGUAGE CPP #-}
1module ProjectM36.DatabaseContextFunction where
2module ProjectM36.DatabaseContextFunction where
2--implements functions which operate as: [Atom] -> DatabaseContextExpr -> Either RelationalError DatabaseContextExpr
3--implements functions which operate as: [Atom] -> DatabaseContextExpr -> Either RelationalError DatabaseContextExpr
3import ProjectM36.Base
4import ProjectM36.Base
4import ProjectM36.Error
5import ProjectM36.Error
6+import ProjectM36.Serialise.Base ()
5import ProjectM36.Attribute as A
7import ProjectM36.Attribute as A
6import ProjectM36.Relation
8import ProjectM36.Relation
7import ProjectM36.AtomType
9import ProjectM36.AtomType
@@ -9,6 +11,8 @@ import qualified Data.HashSet as HS
9import qualified Data.Map as M
11import qualified Data.Map as M
10import ProjectM36.ScriptSession
12import ProjectM36.ScriptSession
11import qualified Data.Text as T
13import qualified Data.Text as T
14+import qualified Data.ByteString.Lazy as BL
15+import Codec.Winery
12
16
13emptyDatabaseContextFunction :: DatabaseContextFunctionName -> DatabaseContextFunction
17emptyDatabaseContextFunction :: DatabaseContextFunctionName -> DatabaseContextFunction
14emptyDatabaseContextFunction name = DatabaseContextFunction {
18emptyDatabaseContextFunction name = DatabaseContextFunction {
@@ -61,8 +65,11 @@ createScriptedDatabaseContextFunction :: DatabaseContextFunctionName -> [TypeCon
61createScriptedDatabaseContextFunction funcName argsIn retArg = AddDatabaseContextFunction funcName (argsIn ++ [databaseContextFunctionReturnType retArg])
65createScriptedDatabaseContextFunction funcName argsIn retArg = AddDatabaseContextFunction funcName (argsIn ++ [databaseContextFunctionReturnType retArg])
62
66
63loadDatabaseContextFunctions :: ModName -> FuncName -> FilePath -> IO (Either LoadSymbolError [DatabaseContextFunction])
67loadDatabaseContextFunctions :: ModName -> FuncName -> FilePath -> IO (Either LoadSymbolError [DatabaseContextFunction])
64−loadDatabaseContextFunctions modName funcName objPath = do
68+#ifdef PM36_HASKELL_SCRIPTING
65− loadFunction modName funcName objPath
69+loadDatabaseContextFunctions = loadFunction
70+#else
71+loadDatabaseContextFunctions _ _ _ = pure (Left LoadSymbolError)
72+#endif
66
73
67databaseContextFunctionsAsRelation :: DatabaseContextFunctions -> Either RelationalError Relation
74databaseContextFunctionsAsRelation :: DatabaseContextFunctions -> Either RelationalError Relation
68databaseContextFunctionsAsRelation dbcFuncs = mkRelationFromList attrs tups
75databaseContextFunctionsAsRelation dbcFuncs = mkRelationFromList attrs tups
@@ -72,5 +79,13 @@ databaseContextFunctionsAsRelation dbcFuncs = mkRelationFromList attrs tups
72 tups = map dbcFuncToTuple (HS.toList dbcFuncs)
79 tups = map dbcFuncToTuple (HS.toList dbcFuncs)
73 dbcFuncToTuple func = [TextAtom (dbcFuncName func),
80 dbcFuncToTuple func = [TextAtom (dbcFuncName func),
74 TextAtom (dbcTextType (dbcFuncType func))]
81 TextAtom (dbcTextType (dbcFuncType func))]
75− dbcTextType typ = T.intercalate " -> " ((map prettyAtomType typ) ++ ["DatabaseContext", "DatabaseContext"])
82+ dbcTextType typ = T.intercalate " -> " (map prettyAtomType typ ++ ["DatabaseContext", "DatabaseContext"])
76−
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+1−2
@@ -1,9 +1,8 @@
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
5import Control.DeepSeq
4import Control.DeepSeq
6
5
7{-# ANN module ("HLint: ignore Use newtype instead of data" :: String) #-}
6{-# ANN module ("HLint: ignore Use newtype instead of data" :: String) #-}
8data DatabaseContextFunctionError = DatabaseContextFunctionUserError String
7data DatabaseContextFunctionError = DatabaseContextFunctionUserError String
9− deriving (Generic, Eq, Show, Binary, NFData)
8+ deriving (Generic, Eq, Show, NFData)
src/lib/ProjectM36/DatabaseContextFunctionUtils.hs+15−8
@@ -3,13 +3,20 @@ import ProjectM36.RelationalExpression
3import ProjectM36.Base
3import ProjectM36.Base
4import ProjectM36.DatabaseContextFunctionError
4import ProjectM36.DatabaseContextFunctionError
5import ProjectM36.Error
5import ProjectM36.Error
6−import Control.Monad.State
6+import ProjectM36.StaticOptimizer
7−import Control.Monad.Trans.Reader
8
7
9−executeDatabaseContextExpr :: DatabaseContextExpr -> DatabaseContext -> Either DatabaseContextFunctionError DatabaseContext
8+executeDatabaseContextExpr :: DatabaseContextExpr -> TransactionId -> TransactionGraph -> DatabaseContext -> Either DatabaseContextFunctionError DatabaseContext
10−executeDatabaseContextExpr expr context = case runState (evalDatabaseContextExpr expr) (freshDatabaseState context) of
9+executeDatabaseContextExpr expr transId graph context' =
11− (Right (), (context', _, _)) -> pure context'
10+ case run of
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)
13
16
14−executeRelationalExpr :: RelationalExpr -> DatabaseContext -> Either RelationalError Relation
17+executeRelationalExpr :: RelationalExpr -> DatabaseContext -> TransactionGraph -> Either RelationalError Relation
15−executeRelationalExpr expr context = runReader (evalRelationalExpr expr) (mkRelationalExprState context)
18+executeRelationalExpr expr context graph =
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", suppliers),
19+ dateRelVars = M.fromList [("s", ExistingRelation suppliers),
20− ("p", products),
20+ ("p", ExistingRelation products),
21− ("sp", supplierProducts)]
21+ ("sp", ExistingRelation supplierProducts)]
22 suppliers = suppliersRel
22 suppliers = suppliersRel
23 products = productsRel
23 products = productsRel
24 supplierProducts = supplierProductsRel
24 supplierProducts = supplierProductsRel
src/lib/ProjectM36/DisconnectedTransaction.hs+7−1
@@ -8,4 +8,10 @@ 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+25−14
@@ -1,6 +1,7 @@
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
4import ProjectM36.DatabaseContextFunctionError
5import ProjectM36.DatabaseContextFunctionError
5import ProjectM36.AtomFunctionError
6import ProjectM36.AtomFunctionError
6import qualified Data.Set as S
7import qualified Data.Set as S
@@ -8,7 +9,6 @@ import Control.DeepSeq (NFData, rnf)
8import Control.DeepSeq.Generics (genericRnf)
9import Control.DeepSeq.Generics (genericRnf)
9import GHC.Generics (Generic)
10import GHC.Generics (Generic)
10import qualified Data.Text as T
11import qualified Data.Text as T
11−import Data.Binary
12import Data.Typeable
12import Data.Typeable
13import Control.Exception
13import Control.Exception
14
14
@@ -62,6 +62,7 @@ data RelationalError = NoSuchAttributeNamesError (S.Set AttributeName)
62 | AtomTypeNameInUseError AtomTypeName
62 | AtomTypeNameInUseError AtomTypeName
63 | IncompletelyDefinedAtomTypeWithConstructorError
63 | IncompletelyDefinedAtomTypeWithConstructorError
64 | AtomTypeNameNotInUseError AtomTypeName
64 | AtomTypeNameNotInUseError AtomTypeName
65+ | AttributeNotSortableError Attribute
65 | FunctionNameInUseError AtomFunctionName
66 | FunctionNameInUseError AtomFunctionName
66 | FunctionNameNotInUseError AtomFunctionName
67 | FunctionNameNotInUseError AtomFunctionName
67 | EmptyCommitError
68 | EmptyCommitError
@@ -80,7 +81,7 @@ data RelationalError = NoSuchAttributeNamesError (S.Set AttributeName)
80 | RelationValuedAttributesNotSupportedError [AttributeName]
81 | RelationValuedAttributesNotSupportedError [AttributeName]
81 | NotificationNameInUseError NotificationName
82 | NotificationNameInUseError NotificationName
82 | NotificationNameNotInUseError NotificationName
83 | NotificationNameNotInUseError NotificationName
83− | ImportError T.Text -- really? This should be broken out into some other error type- this has nothing to do with relational algebra
84+ | ImportError ImportError'
84 | ExportError T.Text
85 | ExportError T.Text
85 | UnhandledExceptionError String
86 | UnhandledExceptionError String
86 | MergeTransactionError MergeError
87 | MergeTransactionError MergeError
@@ -95,14 +96,21 @@ data RelationalError = NoSuchAttributeNamesError (S.Set AttributeName)
95 | SchemaCreationError SchemaError
96 | SchemaCreationError SchemaError
96
97
97 | ImproperDatabaseStateError
98 | ImproperDatabaseStateError
98−
99+
100+ | NonConcreteSchemaPlanError
101+
102+ | NoUncommittedContextInEvalError
103+ | TupleExprsReferenceMultipleMarkersError
104+
105+ | MerkleHashValidationError TransactionId MerkleHash MerkleHash
106+
99 | MultipleErrors [RelationalError]
107 | MultipleErrors [RelationalError]
100− deriving (Show,Eq,Generic,Binary,Typeable, NFData)
108+ deriving (Show,Eq,Generic,Typeable, NFData)
101
109
102data PersistenceError = InvalidDirectoryError FilePath |
110data PersistenceError = InvalidDirectoryError FilePath |
103 MissingTransactionError TransactionId |
111 MissingTransactionError TransactionId |
104 WrongDatabaseFormatVersionError String String
112 WrongDatabaseFormatVersionError String String
105− deriving (Show, Eq, Generic, Binary, NFData)
113+ deriving (Show, Eq, Generic, NFData)
106
114
107--collapse list of errors into normal error- if there is just one, just return one
115--collapse list of errors into normal error- if there is just one, just return one
108someErrors :: [RelationalError] -> RelationalError
116someErrors :: [RelationalError] -> RelationalError
@@ -120,7 +128,7 @@ data MergeError = SelectedHeadMismatchMergeError |
120 StrategyViolatesComponentMergeError | --failed merge in inc deps, relvars, etc.
128 StrategyViolatesComponentMergeError | --failed merge in inc deps, relvars, etc.
121 StrategyViolatesRelationVariableMergeError |
129 StrategyViolatesRelationVariableMergeError |
122 StrategyViolatesTypeConstructorMergeError
130 StrategyViolatesTypeConstructorMergeError
123− deriving (Show, Eq, Generic, Binary, Typeable)
131+ deriving (Show, Eq, Generic, Typeable)
124
132
125instance NFData MergeError where rnf = genericRnf
133instance NFData MergeError where rnf = genericRnf
126
134
@@ -128,17 +136,20 @@ data ScriptCompilationError = TypeCheckCompilationError String String | --expect
128 SyntaxErrorCompilationError String |
136 SyntaxErrorCompilationError String |
129 ScriptCompilationDisabledError |
137 ScriptCompilationDisabledError |
130 OtherScriptCompilationError String
138 OtherScriptCompilationError String
131− deriving (Show, Eq, Generic, Binary, Typeable, NFData)
139+ deriving (Show, Eq, Generic, Typeable, NFData)
132
140
133instance Exception ScriptCompilationError
141instance Exception ScriptCompilationError
134
142
135data SchemaError = RelVarReferencesMissing (S.Set RelVarName) |
143data SchemaError = RelVarReferencesMissing (S.Set RelVarName) |
136 RelVarInReferencedMoreThanOnce RelVarName |
144 RelVarInReferencedMoreThanOnce RelVarName |
137 RelVarOutReferencedMoreThanOnce RelVarName
145 RelVarOutReferencedMoreThanOnce RelVarName
138− deriving (Show, Eq, Generic, Binary, Typeable, NFData)
146+ deriving (Show, Eq, Generic, Typeable, NFData)
139−
147+
140−
148+
141−-- errors returned from the distributed-process call handlers
149+data ImportError' = InvalidSHA256Error T.Text
142−data ServerError = RequestTimeoutError |
150+ | SHA256MismatchError T.Text T.Text
143− ProcessDiedError String
151+ | InvalidFileURIError T.Text
152+ | ImportFileDecodeError T.Text
153+ | ImportFileError T.Text
154+ | ImportDownloadError T.Text
144− deriving (Generic, Binary, Eq)
155+ deriving (Show, Eq, Generic, Typeable, NFData)
src/lib/ProjectM36/FileLock.hs+1−1
@@ -1,4 +1,4 @@
1−{-# LANGUAGE CPP, NamedFieldPuns #-}
1+{-# LANGUAGE CPP #-}
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
src/lib/ProjectM36/GraphRefRelationalExpr.hsnew file+45
@@ -0,0 +1,45 @@
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+5−6
@@ -4,17 +4,16 @@ 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
8
7
9inclusionDependenciesAsRelation :: InclusionDependencies -> Either RelationalError Relation
8inclusionDependenciesAsRelation :: InclusionDependencies -> Either RelationalError Relation
10inclusionDependenciesAsRelation incDeps =
9inclusionDependenciesAsRelation incDeps =
11 mkRelationFromList attrs (map incDepAsAtoms (M.toList incDeps))
10 mkRelationFromList attrs (map incDepAsAtoms (M.toList incDeps))
12 where
11 where
13 attrs = attributesFromList [Attribute "name" TextAtomType,
12 attrs = attributesFromList [Attribute "name" TextAtomType,
14− Attribute "sub" TextAtomType,
13+ Attribute "sub" RelationalExprAtomType,
15− Attribute "super" TextAtomType
14+ Attribute "super" RelationalExprAtomType
16 ]
15 ]
17 incDepAsAtoms (name, InclusionDependency exprA exprB) = [TextAtom name,
16 incDepAsAtoms (name, InclusionDependency exprA exprB) = [TextAtom name,
18− TextAtom (T.pack (show exprA)),
17+ RelationalExprAtom exprA,
19− TextAtom (T.pack (show exprB))]
18+ RelationalExprAtom exprB]
20−
19+
src/lib/ProjectM36/IsomorphicSchema.hs+30−33
@@ -1,22 +1,20 @@
1−{-# LANGUAGE DeriveGeneric, DeriveAnyClass, LambdaCase #-}
1+{-# LANGUAGE DeriveGeneric, LambdaCase, DerivingVia #-}
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.RelationalExpression
7import ProjectM36.Relation
6import ProjectM36.Relation
7+import ProjectM36.NormalizeExpr
8+import ProjectM36.RelationalExpression
8import qualified ProjectM36.AttributeNames as AN
9import qualified ProjectM36.AttributeNames as AN
9import Control.Monad
10import Control.Monad
10−import Control.Monad.State
11−import Control.Monad.Trans.Reader
12import GHC.Generics
11import GHC.Generics
13−import Data.Binary
14import qualified Data.Map as M
12import qualified Data.Map as M
15import qualified Data.Set as S
13import qualified Data.Set as S
16import qualified Data.List as L
14import qualified Data.List as L
17−import qualified Data.Text as T
15+#if __GLASGOW_HASKELL__ < 804
18import Data.Monoid
16import Data.Monoid
19−--import Debug.Trace
17+#endif
20-- isomorphic schemas offer bi-directional functors between two schemas
18-- isomorphic schemas offer bi-directional functors between two schemas
21
19
22--TODO: note that renaming a relvar should alter any stored isomorphisms as well
20--TODO: note that renaming a relvar should alter any stored isomorphisms as well
@@ -29,8 +27,7 @@ import Data.Monoid
29
27
30data SchemaExpr = AddSubschema SchemaName SchemaIsomorphs |
28data SchemaExpr = AddSubschema SchemaName SchemaIsomorphs |
31 RemoveSubschema SchemaName
29 RemoveSubschema SchemaName
32− deriving (Generic, Binary, Show)
30+ deriving (Generic, Show)
33−
34
31
35isomorphs :: Schema -> SchemaIsomorphs
32isomorphs :: Schema -> SchemaIsomorphs
36isomorphs (Schema i) = i
33isomorphs (Schema i) = i
@@ -256,15 +253,15 @@ inclusionDependencyInSchema schema (InclusionDependency rexprA rexprB) = do
256inclusionDependenciesInSchema :: Schema -> InclusionDependencies -> Either RelationalError InclusionDependencies
253inclusionDependenciesInSchema :: Schema -> InclusionDependencies -> Either RelationalError InclusionDependencies
257inclusionDependenciesInSchema schema incDeps = M.fromList <$> mapM (\(depName, dep) -> inclusionDependencyInSchema schema dep >>= \newDep -> pure (depName, newDep)) (M.toList incDeps)
254inclusionDependenciesInSchema schema incDeps = M.fromList <$> mapM (\(depName, dep) -> inclusionDependencyInSchema schema dep >>= \newDep -> pure (depName, newDep)) (M.toList incDeps)
258
255
259−relationVariablesInSchema :: Schema -> DatabaseContext -> Either RelationalError RelationVariables
256+relationVariablesInSchema :: Schema -> Either RelationalError RelationVariables
260−relationVariablesInSchema schema@(Schema morphs) context = foldM transform M.empty morphs
257+relationVariablesInSchema schema@(Schema morphs) = foldM transform M.empty morphs
261 where
258 where
262 transform newRvMap morph = do
259 transform newRvMap morph = do
263 let rvNames = isomorphInRelVarNames morph
260 let rvNames = isomorphInRelVarNames morph
264 rvAssocs <- mapM (\rv -> do
261 rvAssocs <- mapM (\rv -> do
265 expr' <- processRelationalExprInSchema schema (RelationVariable rv ())
262 expr' <- processRelationalExprInSchema schema (RelationVariable rv ())
266− rel <- runReader (evalRelationalExpr expr') (RelationalExprStateElems context)
263+ let gfExpr = runProcessExprM UncommittedContextMarker (processRelationalExpr expr')
267− pure (rv, rel)) rvNames
264+ pure (rv, gfExpr)) rvNames
268 pure (M.union newRvMap (M.fromList rvAssocs))
265 pure (M.union newRvMap (M.fromList rvAssocs))
269
266
270
267
@@ -304,32 +301,32 @@ validate morph underlyingRvNames = if S.size invalidRvNames > 0 then
304
301
305-- | Create inclusion dependencies mainly for IsoRestrict because the predicate should hold in the base schema.
302-- | Create inclusion dependencies mainly for IsoRestrict because the predicate should hold in the base schema.
306createIncDepsForIsomorph :: SchemaName -> SchemaIsomorph -> InclusionDependencies
303createIncDepsForIsomorph :: SchemaName -> SchemaIsomorph -> InclusionDependencies
307−createIncDepsForIsomorph sname (IsoRestrict _ predi (rvTrue, rvFalse)) = let
304+createIncDepsForIsomorph sname (IsoRestrict origRv predi (rvTrue, rvFalse)) = let
308 newIncDep predicate rv = InclusionDependency (Project AN.empty (Restrict predicate (RelationVariable rv ()))) (ExistingRelation relationTrue)
305 newIncDep predicate rv = InclusionDependency (Project AN.empty (Restrict predicate (RelationVariable rv ()))) (ExistingRelation relationTrue)
309− incDepName b = "schema" <> "_" <> sname <> "_" <> T.pack (show b) in
306+ incDepName b = "schema" <> "_" <> sname <> "_" <> b in
310− M.fromList [(incDepName True, newIncDep predi rvTrue),
307+ M.fromList [(incDepName (origRv <> "_true"), newIncDep predi rvTrue),
311− (incDepName False, newIncDep (NotPredicate predi) rvFalse)]
308+ (incDepName (origRv <> "_false"), newIncDep (NotPredicate predi) rvFalse)]
312createIncDepsForIsomorph _ _ = M.empty
309createIncDepsForIsomorph _ _ = M.empty
313
310
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
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
315−evalSchemaExpr :: SchemaExpr -> DatabaseContext -> Subschemas -> Either RelationalError (Subschemas, DatabaseContext)
312+evalSchemaExpr :: SchemaExpr -> DatabaseContext -> TransactionId -> TransactionGraph -> Subschemas -> Either RelationalError (Subschemas, DatabaseContext)
316−evalSchemaExpr (AddSubschema sname morphs) context sschemas =
313+evalSchemaExpr (AddSubschema sname morphs) context transId graph sschemas =
317 if M.member sname sschemas then
314 if M.member sname sschemas then
318 Left (SubschemaNameInUseError sname)
315 Left (SubschemaNameInUseError sname)
319− else case valid of
316+ else
317+ case validateSchema (Schema morphs) context of
320− Just err -> Left (SchemaCreationError err)
318+ Just err -> Left (SchemaCreationError err)
321− Nothing ->
319+ Nothing -> do
322− let newSchemas = M.insert sname newSchema sschemas
320+ let newSchemas = M.insert sname newSchema sschemas
321+ newSchema = Schema morphs
323− moreIncDeps = foldr (\morph acc -> M.union acc (createIncDepsForIsomorph sname morph)) M.empty morphs
322+ moreIncDeps = foldr (\morph acc -> M.union acc (createIncDepsForIsomorph sname morph)) M.empty morphs
324− incDepExprs = MultipleExpr (map (uncurry AddInclusionDependency) (M.toList moreIncDeps))
323+ incDepExprs = MultipleExpr (map (uncurry AddInclusionDependency) (M.toList moreIncDeps))
325− in
324+ dbenv = mkDatabaseContextEvalEnv transId graph
326− case runState (evalDatabaseContextExpr incDepExprs) (context, M.empty, False) of
325+ dbstate <- runDatabaseContextEvalMonad context dbenv (evalGraphRefDatabaseContextExpr incDepExprs)
327− (Left err, _) -> Left err
326+ pure (newSchemas, dbc_context dbstate)
328− (Right (), (newContext,_,_)) -> pure (newSchemas, newContext) --need to propagate dirty flag here
327+--need to propagate dirty flag here
329− where
328+
330− newSchema = Schema morphs
331− valid = validateSchema newSchema context
332−evalSchemaExpr (RemoveSubschema sname) context sschemas = if M.member sname sschemas then
329+evalSchemaExpr (RemoveSubschema sname) context _ _ sschemas = if M.member sname sschemas then
333 pure (M.delete sname sschemas, context)
330 pure (M.delete sname sschemas, context)
334 else
331 else
335 Left (SubschemaNameNotInUseError sname)
332 Left (SubschemaNameNotInUseError sname)
src/lib/ProjectM36/Key.hs+2
@@ -2,7 +2,9 @@ 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
5import Data.Monoid
6import Data.Monoid
7+#endif
6
8
7{-
9{-
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
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
src/lib/ProjectM36/MerkleHash.hsnew file+9
@@ -0,0 +1,9 @@
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.hsnew file+132
@@ -0,0 +1,132 @@
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+12−7
@@ -1,17 +1,22 @@
1module ProjectM36.Notifications where
1module ProjectM36.Notifications where
2import ProjectM36.Base
2import ProjectM36.Base
3+import ProjectM36.Error
3import ProjectM36.RelationalExpression
4import ProjectM36.RelationalExpression
4−import Control.Monad.Trans.Reader
5+import ProjectM36.StaticOptimizer
5import qualified Data.Map as M
6import qualified Data.Map as M
6import Data.Either (isRight)
7import Data.Either (isRight)
7
8
8-- | Returns the notifications which should be triggered based on the transition from the first 'DatabaseContext' to the second 'DatabaseContext'.
9-- | Returns the notifications which should be triggered based on the transition from the first 'DatabaseContext' to the second 'DatabaseContext'.
9−notificationChanges :: Notifications -> DatabaseContext -> DatabaseContext -> Notifications
10+notificationChanges :: Notifications -> TransactionGraph -> DatabaseContext -> DatabaseContext -> Notifications
10−notificationChanges nots context1 context2 = M.filter notificationFilter nots
11+notificationChanges nots graph context1 context2 = M.filter notificationFilter nots
11 where
12 where
12− notificationFilter (Notification chExpr _ _) = let oldChangeEval = evalChangeExpr chExpr (RelationalExprStateElems context1)
13− newChangeEval = evalChangeExpr chExpr (RelationalExprStateElems context2) in
14− oldChangeEval /= newChangeEval && isRight oldChangeEval
13+ notificationFilter (Notification chExpr _ _) = oldChangeEval /= newChangeEval && isRight oldChangeEval
15− evalChangeExpr chExpr = runReader (evalRelationalExpr chExpr)
14+ where
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
16
21
17
22
src/lib/ProjectM36/Persist.hs+11−9
@@ -36,7 +36,6 @@ import Foreign.C
36#endif
36#endif
37
37
38import System.IO (withFile, IOMode(WriteMode), Handle)
38import System.IO (withFile, IOMode(WriteMode), Handle)
39−import qualified Data.ByteString.Lazy as BS
40import qualified Data.ByteString as BS'
39import qualified Data.ByteString as BS'
41import qualified Data.Text.Encoding as TE
40import qualified Data.Text.Encoding as TE
42
41
@@ -66,7 +65,13 @@ renameSync sync srcPath dstPath = do
66atomicRename :: FilePath -> FilePath -> IO ()
65atomicRename :: FilePath -> FilePath -> IO ()
67atomicRename srcPath dstPath =
66atomicRename srcPath dstPath =
68#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
69− Win32.moveFileEx srcPath dstPath Win32.mOVEFILE_REPLACE_EXISTING
74+ Win32.moveFileEx srcPath dst Win32.mOVEFILE_REPLACE_EXISTING
70#else
75#else
71 Posix.rename srcPath dstPath
76 Posix.rename srcPath dstPath
72#endif
77#endif
@@ -94,10 +99,10 @@ syncDirectory :: DiskSync -> FilePath -> IO ()
94syncDirectory FsyncDiskSync path = directoryFsync path
99syncDirectory FsyncDiskSync path = directoryFsync path
95syncDirectory NoDiskSync _ = pure ()
100syncDirectory NoDiskSync _ = pure ()
96
101
97−writeBSFileSync :: DiskSync -> FilePath -> BS.ByteString -> IO ()
102+writeBSFileSync :: DiskSync -> FilePath -> BS'.ByteString -> IO ()
98writeBSFileSync sync path bstring =
103writeBSFileSync sync path bstring =
99 withFile path WriteMode $ \handle -> do
104 withFile path WriteMode $ \handle -> do
100− BS.hPut handle bstring
105+ BS'.hPut handle bstring
101 syncHandle sync handle
106 syncHandle sync handle
102
107
103directoryFsync :: FilePath -> IO ()
108directoryFsync :: FilePath -> IO ()
@@ -119,13 +124,10 @@ printFdCount =
119 putStrLn "Fd count not supported on this OS."
124 putStrLn "Fd count not supported on this OS."
120#endif
125#endif
121
126
122−
123−fdCount :: IO Int
124#if FDCOUNTSUPPORTED
127#if FDCOUNTSUPPORTED
128+fdCount :: IO Int
125fdCount = do
129fdCount = do
126 fds <- getDirectoryContents FDDIR
130 fds <- getDirectoryContents FDDIR
127 pure ((length fds) - 2)
131 pure ((length fds) - 2)
128−#else
129--not supported on non-linux
132--not supported on non-linux
130−fdCount = pure 0
131−#endif
133+#endif
src/lib/ProjectM36/Relation.hs+23−40
@@ -4,14 +4,11 @@ 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
9import ProjectM36.Base
7import ProjectM36.Base
10import ProjectM36.Tuple
8import ProjectM36.Tuple
11import qualified ProjectM36.Attribute as A
9import qualified ProjectM36.Attribute as A
12import ProjectM36.TupleSet
10import ProjectM36.TupleSet
13import ProjectM36.Error
11import ProjectM36.Error
14−import ProjectM36.MiscUtils
15--import qualified Control.Parallel.Strategies as P
12--import qualified Control.Parallel.Strategies as P
16import qualified ProjectM36.TypeConstructorDef as TCD
13import qualified ProjectM36.TypeConstructorDef as TCD
17import qualified ProjectM36.DataConstructorDef as DCD
14import qualified ProjectM36.DataConstructorDef as DCD
@@ -19,7 +16,6 @@ import qualified Data.Text as T
19import Data.Either (isRight)
16import Data.Either (isRight)
20import System.Random.Shuffle
17import System.Random.Shuffle
21import Control.Monad.Random
18import Control.Monad.Random
22−import Data.List (sort)
23
19
24attributes :: Relation -> Attributes
20attributes :: Relation -> Attributes
25attributes (Relation attrs _ ) = attrs
21attributes (Relation attrs _ ) = attrs
@@ -37,7 +33,7 @@ atomTypeForName :: AttributeName -> Relation -> Either RelationalError AtomType
37atomTypeForName attrName (Relation attrs _) = A.atomTypeForAttributeName attrName attrs
33atomTypeForName attrName (Relation attrs _) = A.atomTypeForAttributeName attrName attrs
38
34
39mkRelationFromList :: Attributes -> [[Atom]] -> Either RelationalError Relation
35mkRelationFromList :: Attributes -> [[Atom]] -> Either RelationalError Relation
40−mkRelationFromList attrs atomMatrix =
36+mkRelationFromList attrs atomMatrix = do
41 Relation attrs <$> mkTupleSetFromList attrs atomMatrix
37 Relation attrs <$> mkTupleSetFromList attrs atomMatrix
42
38
43emptyRelationWithAttrs :: Attributes -> Relation
39emptyRelationWithAttrs :: Attributes -> Relation
@@ -45,11 +41,6 @@ emptyRelationWithAttrs attrs = Relation attrs emptyTupleSet
45
41
46mkRelation :: Attributes -> RelationTupleSet -> Either RelationalError Relation
42mkRelation :: Attributes -> RelationTupleSet -> Either RelationalError Relation
47mkRelation attrs tupleSet =
43mkRelation attrs tupleSet =
48− --check that all attributes are unique- this cannot be done when creating attributes because the check can become expensive
49− let duplicateAttrNames = dupes (sort (map A.attributeName (V.toList attrs))) in
50− if not (null duplicateAttrNames) then
51− Left (DuplicateAttributeNamesError (S.fromList duplicateAttrNames))
52− else
53 --check that all tuples have the same keys
44 --check that all tuples have the same keys
54 --check that all tuples have keys (1-N) where N is the attribute count
45 --check that all tuples have keys (1-N) where N is the attribute count
55 case verifyTupleSet attrs tupleSet of
46 case verifyTupleSet attrs tupleSet of
@@ -64,6 +55,10 @@ mkRelationDeferVerify :: Attributes -> RelationTupleSet -> Either RelationalErro
64mkRelationDeferVerify attrs tupleSet = return $ Relation attrs (RelationTupleSet (filter tupleFilter (asList tupleSet)))
55mkRelationDeferVerify attrs tupleSet = return $ Relation attrs (RelationTupleSet (filter tupleFilter (asList tupleSet)))
65 where
56 where
66 tupleFilter tuple = isRight (verifyTuple attrs tuple)
57 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
67
62
68mkRelationFromTuples :: Attributes -> [RelationTuple] -> Either RelationalError Relation
63mkRelationFromTuples :: Attributes -> [RelationTuple] -> Either RelationalError Relation
69mkRelationFromTuples attrs tupleSetList = do
64mkRelationFromTuples attrs tupleSetList = do
@@ -91,13 +86,12 @@ union (Relation attrs1 tupSet1) (Relation attrs2 tupSet2) =
91 else
86 else
92 Right $ Relation attrs1 newtuples
87 Right $ Relation attrs1 newtuples
93 where
88 where
94− newtuples = RelationTupleSet $ HS.toList . HS.fromList $ asList tupSet1 ++ map (reorderTuple attrs1) (asList tupSet2)
89+ newtuples = tupleSetUnion attrs1 tupSet1 tupSet2
95−
90+
96−project :: S.Set AttributeName -> Relation -> Either RelationalError Relation
91+project :: S.Set AttributeName -> Relation -> Either RelationalError Relation
97project attrNames rel@(Relation _ tupSet) = do
92project attrNames rel@(Relation _ tupSet) = do
98 newAttrs <- A.projectionAttributesForNames attrNames (attributes rel)
93 newAttrs <- A.projectionAttributesForNames attrNames (attributes rel)
99− let newAttrNameSet = A.attributeNameSet newAttrs
100− newTupleList = map (tupleProject newAttrNameSet) (asList tupSet)
94+ newTupleList <- mapM (tupleProject newAttrs) (asList tupSet)
101 pure (Relation newAttrs (RelationTupleSet (HS.toList (HS.fromList newTupleList))))
95 pure (Relation newAttrs (RelationTupleSet (HS.toList (HS.fromList newTupleList))))
102
96
103rename :: AttributeName -> AttributeName -> Relation -> Either RelationalError Relation
97rename :: AttributeName -> AttributeName -> Relation -> Either RelationalError Relation
@@ -152,7 +146,7 @@ group groupAttrNames newAttrName rel = do
152 groupProjectionAttributes <- A.projectionAttributesForNames groupAttrNames (attributes rel)
146 groupProjectionAttributes <- A.projectionAttributesForNames groupAttrNames (attributes rel)
153 let groupAttr = Attribute newAttrName (RelationAtomType groupProjectionAttributes)
147 let groupAttr = Attribute newAttrName (RelationAtomType groupProjectionAttributes)
154 matchingRelTuple tupIn = case imageRelationFor tupIn rel of
148 matchingRelTuple tupIn = case imageRelationFor tupIn rel of
155− Right rel2 -> RelationTuple (V.singleton groupAttr) (V.singleton (RelationAtom rel2))
149+ Right rel2 -> RelationTuple (A.singleton groupAttr) (V.singleton (RelationAtom rel2))
156 Left _ -> undefined
150 Left _ -> undefined
157 mogrifier tupIn = pure (tupleExtend tupIn (matchingRelTuple tupIn))
151 mogrifier tupIn = pure (tupleExtend tupIn (matchingRelTuple tupIn))
158 newAttrs = A.addAttribute groupAttr nonGroupProjectionAttributes
152 newAttrs = A.addAttribute groupAttr nonGroupProjectionAttributes
@@ -166,7 +160,8 @@ restrictEq :: RelationTuple -> Relation -> Either RelationalError Relation
166restrictEq tuple = restrict rfilter
160restrictEq tuple = restrict rfilter
167 where
161 where
168 rfilter :: RelationTuple -> Either RelationalError Bool
162 rfilter :: RelationTuple -> Either RelationalError Bool
163+ rfilter tupleIn = do
169− rfilter tupleIn = pure (tupleIntersection tuple tupleIn == tuple)
164+ pure (tupleIntersection tuple tupleIn == tuple)
170
165
171-- unwrap relation-valued attribute
166-- unwrap relation-valued attribute
172-- return error if relval attrs and nongroup attrs overlap
167-- return error if relval attrs and nongroup attrs overlap
@@ -188,13 +183,13 @@ ungroup relvalAttrName rel = case attributesForRelval relvalAttrName rel of
188tupleUngroup :: AttributeName -> Attributes -> RelationTuple -> Either RelationalError Relation
183tupleUngroup :: AttributeName -> Attributes -> RelationTuple -> Either RelationalError Relation
189tupleUngroup relvalAttrName newAttrs tuple = do
184tupleUngroup relvalAttrName newAttrs tuple = do
190 relvalRelation <- relationForAttributeName relvalAttrName tuple
185 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])
191 relFold folder (Right $ Relation newAttrs emptyTupleSet) relvalRelation
192 relFold folder (Right $ Relation newAttrs emptyTupleSet) relvalRelation
192− where
193− nonGroupTupleProjection = tupleProject nonGroupAttrNames tuple
194− nonGroupAttrNames = A.attributeNameSet newAttrs
195− folder tupleIn acc = case acc of
196− Left err -> Left err
197− Right accRel -> union accRel $ Relation newAttrs (RelationTupleSet [tupleExtend nonGroupTupleProjection tupleIn])
198
193
199attributesForRelval :: AttributeName -> Relation -> Either RelationalError Attributes
194attributesForRelval :: AttributeName -> Relation -> Either RelationalError Attributes
200attributesForRelval relvalAttrName (Relation attrs _) = do
195attributesForRelval relvalAttrName (Relation attrs _) = do
@@ -249,7 +244,8 @@ relMap mapper (Relation attrs tupleSet) =
249
244
250relMogrify :: (RelationTuple -> Either RelationalError RelationTuple) -> Attributes -> Relation -> Either RelationalError Relation
245relMogrify :: (RelationTuple -> Either RelationalError RelationTuple) -> Attributes -> Relation -> Either RelationalError Relation
251relMogrify mapper newAttributes (Relation _ tupSet) = do
246relMogrify mapper newAttributes (Relation _ tupSet) = do
252− newTuples <- mapM mapper (asList tupSet)
247+ newTuples <- mapM (fmap (reorderTuple newAttributes) . mapper) (asList tupSet)
248+
253 mkRelationFromTuples newAttributes newTuples
249 mkRelationFromTuples newAttributes newTuples
254
250
255relFold :: (RelationTuple -> a -> a) -> a -> Relation -> a
251relFold :: (RelationTuple -> a -> a) -> a -> Relation -> a
@@ -295,25 +291,12 @@ typesAsRelation types = mkRelationFromTuples attrs tuples
295 dConsType = RelationAtomType subAttrs
291 dConsType = RelationAtomType subAttrs
296 tuples = map mkTypeConsDescription types
292 tuples = map mkTypeConsDescription types
297
293
294+ mkTypeConsDescription (tCons, dConsList) =
298− mkTypeConsDescription (tCons, dConsList) = RelationTuple attrs (V.fromList [TextAtom (TCD.name tCons), mkDataConsRelation dConsList])
295+ RelationTuple attrs (V.fromList [TextAtom (TCD.name tCons), mkDataConsRelation dConsList])
299
296
300 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
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
301 Left err -> error ("mkRelationFromTuples pooped " ++ show err)
298 Left err -> error ("mkRelationFromTuples pooped " ++ show err)
302 Right rel -> RelationAtom rel
299 Right rel -> RelationAtom rel
303−
304−-- | Return a Relation describing the relation variables.
305−relationVariablesAsRelation :: M.Map RelVarName Relation -> Either RelationalError Relation
306−relationVariablesAsRelation relVarMap = mkRelationFromList attrs tups
307− where
308− subrelAttrs = A.attributesFromList [Attribute "attribute" TextAtomType, Attribute "type" TextAtomType]
309− attrs = A.attributesFromList [Attribute "name" TextAtomType,
310− Attribute "attributes" (RelationAtomType subrelAttrs)]
311− tups = map relVarToAtomList (M.toList relVarMap)
312− relVarToAtomList (rvName, rel) = [TextAtom rvName, attributesToRel (attributes rel)]
313− attributesToRel attrl = case mkRelationFromList subrelAttrs (map attrAtoms (V.toList attrl)) of
314− Left err -> error ("relationVariablesAsRelation pooped " ++ show err)
315− Right rel -> RelationAtom rel
316− attrAtoms a = [TextAtom (A.attributeName a), TextAtom (prettyAtomType (A.atomType a))]
317
300
318-- | 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.
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.
319randomizeTupleOrder :: MonadRandom m => Relation -> m Relation
302randomizeTupleOrder :: MonadRandom m => Relation -> m Relation
@@ -326,4 +309,4 @@ oneTuple (Relation _ (RelationTupleSet [])) = Nothing
326oneTuple (Relation _ (RelationTupleSet (x:_))) = Just x
309oneTuple (Relation _ (RelationTupleSet (x:_))) = Just x
327
310
328tuplesList :: Relation -> [RelationTuple]
311tuplesList :: Relation -> [RelationTuple]
329−tuplesList (Relation _ tupleSet) = asList tupleSet
312+tuplesList (Relation _ tupleSet) = asList tupleSet
src/lib/ProjectM36/Relation/Parse/CSV.hs+44−36
@@ -4,6 +4,7 @@ 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
7import qualified ProjectM36.Attribute as A
8import qualified ProjectM36.Attribute as A
8
9
9import Data.Csv.Parser
10import Data.Csv.Parser
@@ -37,8 +38,7 @@ csvAsRelation attrs tConsMap inString = case APBL.parse (csvWithHeader csvDecode
37 let strHeader = V.map decodeUtf8 headerRaw
38 let strHeader = V.map decodeUtf8 headerRaw
38 strMapRecords = V.map convertMap vecMapsRaw
39 strMapRecords = V.map convertMap vecMapsRaw
39 convertMap hmap = HM.fromList $ L.map (decodeUtf8 *** (T.unpack . decodeUtf8)) (HM.toList hmap)
40 convertMap hmap = HM.fromList $ L.map (decodeUtf8 *** (T.unpack . decodeUtf8)) (HM.toList hmap)
40− attrNames = V.map A.attributeName attrs
41+ attrNameSet = A.attributeNameSet 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)) attrs
49+ parseAtom (A.attributeName attr) (A.atomType attr) (T.pack $ tupMap HM.! A.attributeName attr)) (attributesVec 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
@@ -82,42 +82,50 @@ parseCSVAtomP _ _ BoolAtomType = do
82 case readMaybe bString of
82 case readMaybe bString of
83 Nothing -> fail ("invalid BoolAtom string: " ++ bString)
83 Nothing -> fail ("invalid BoolAtom string: " ++ bString)
84 Just b -> pure (Right (BoolAtom b))
84 Just b -> pure (Right (BoolAtom b))
85−parseCSVAtomP attrName tConsMap (IntervalAtomType iType) = do
85+parseCSVAtomP _ _ RelationalExprAtomType = do
86− begin <- (APT.char '[' >> pure False) <|> (APT.char '(' >> pure True)
86+ reString <- T.unpack <$> takeToEndOfData
87− eBeginv <- parseCSVAtomP attrName tConsMap iType
87+ case readMaybe reString of
88− case eBeginv of
88+ Nothing -> fail ("invalid RelationalExprAtom string: " ++ reString)
89− Left err -> pure (Left err)
89+ Just b -> pure (Right (RelationalExprAtom b))
90− Right beginv -> do
91− _ <- APT.char ','
92− eEndv <- parseCSVAtomP attrName tConsMap iType
93− case eEndv of
94− Left err -> pure (Left err)
95− Right endv -> do
96− let end = (APT.char ']' >> pure False) <|>
97− (APT.char ')' >> pure True)
98− Right . IntervalAtom beginv endv begin <$> end
99−parseCSVAtomP attrName tConsMap typ@(ConstructedAtomType _ tvmap) = do
90+parseCSVAtomP attrName tConsMap typ@(ConstructedAtomType _ tvmap)
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
100− dConsName <- capitalizedIdentifier
108+ dConsName <- capitalizedIdentifier
101− APT.skipSpace
109+ APT.skipSpace
102 --we need to look up the name right away in order to determine the types of the following arguments
110 --we need to look up the name right away in order to determine the types of the following arguments
103 -- grab the data constructor
111 -- grab the data constructor
104− case findDataConstructor dConsName tConsMap of
112+ case findDataConstructor dConsName tConsMap of
105− Nothing -> pure (Left (NoSuchDataConstructorError dConsName))
113+ Nothing -> pure (Left (NoSuchDataConstructorError dConsName))
106− Just (_, dConsDef) ->
114+ Just (_, dConsDef) ->
107 -- identify the data constructor's expected atom type args
115 -- identify the data constructor's expected atom type args
108− case resolvedAtomTypesForDataConstructorDefArgs tConsMap tvmap dConsDef of
116+ case resolvedAtomTypesForDataConstructorDefArgs tConsMap tvmap dConsDef of
109− Left err -> pure (Left err)
117+ Left err -> pure (Left err)
110− Right argAtomTypes -> do
118+ Right argAtomTypes -> do
111− atomArgs <- mapM (\argTyp -> let parseNextAtom = parseCSVAtomP attrName tConsMap argTyp <* APT.skipSpace in
119+ atomArgs <- mapM (\argTyp -> let parseNextAtom = parseCSVAtomP attrName tConsMap argTyp <* APT.skipSpace in
112− case argTyp of
120+ case argTyp of
113− ConstructedAtomType _ _ ->
121+ ConstructedAtomType _ _ ->
114− parens parseNextAtom <|>
122+ parens parseNextAtom <|>
115− parseNextAtom
123+ parseNextAtom
116− _ -> parseNextAtom
124+ _ -> parseNextAtom
117− ) argAtomTypes
125+ ) argAtomTypes
118− case lefts atomArgs of
126+ case lefts atomArgs of
119− [] -> pure (Right (ConstructedAtom dConsName typ (rights atomArgs)))
127+ [] -> pure (Right (ConstructedAtom dConsName typ (rights atomArgs)))
120− errs -> pure (Left (someErrors errs))
128+ errs -> pure (Left (someErrors errs))
121parseCSVAtomP attrName _ (RelationAtomType _) = pure (Left (RelationValuedAttributesNotSupportedError [attrName]))
129parseCSVAtomP attrName _ (RelationAtomType _) = pure (Left (RelationValuedAttributesNotSupportedError [attrName]))
122parseCSVAtomP _ _ (TypeVariableType x) = pure (Left (TypeConstructorTypeVarMissing x))
130parseCSVAtomP _ _ (TypeVariableType x) = pure (Left (TypeConstructorTypeVarMissing x))
123
131
src/lib/ProjectM36/Relation/Show/CSV.hs+5−5
@@ -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
4+import ProjectM36.Attribute as A
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− | V.null attrs =
20+ | A.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) attrs
25+ relValAttrs = V.toList $ V.filter (isRelationAtomType . atomType) (attributesVec attrs)
26− bsAttrNames = V.map (TE.encodeUtf8 . attributeName) attrs
26+ bsAttrNames = V.map (TE.encodeUtf8 . attributeName) (attributesVec attrs)
27
27
28{-
28{-
29instance ToRecord RelationTuple where
29instance ToRecord RelationTuple where
@@ -36,7 +36,7 @@ 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) (tupleAttributes tuple)
39+ headerOrder (RecordRelationTuple tuple) = V.map (TE.encodeUtf8 . attributeName) (attributesVec (tupleAttributes tuple))
40
40
41newtype RecordAtom = RecordAtom {unAtom :: Atom}
41newtype RecordAtom = RecordAtom {unAtom :: Atom}
42
42
src/lib/ProjectM36/Relation/Show/HTML.hs+5−2
@@ -3,16 +3,18 @@ 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
6import ProjectM36.AtomType
7import ProjectM36.AtomType
7import qualified Data.List as L
8import qualified Data.List as L
8import Data.Text (Text, pack)
9import Data.Text (Text, pack)
9import qualified Data.Text as T
10import qualified Data.Text as T
10import qualified Data.Text.IO as TIO
11import qualified Data.Text.IO as TIO
12+#if __GLASGOW_HASKELL__ < 804
11import Data.Monoid
13import Data.Monoid
12−import qualified Data.Vector as V
14+#endif
13
15
14attributesAsHTML :: Attributes -> Text
16attributesAsHTML :: Attributes -> Text
15−attributesAsHTML attrs = "<tr>" <> T.concat (map oneAttrHTML (V.toList attrs)) <> "</tr>"
17+attributesAsHTML attrs = "<tr>" <> T.concat (map oneAttrHTML (A.toList attrs)) <> "</tr>"
16 where
18 where
17 oneAttrHTML attr = "<th>" <> prettyAttribute attr <> "</th>"
19 oneAttrHTML attr = "<th>" <> prettyAttribute attr <> "</th>"
18
20
@@ -51,6 +53,7 @@ tupleAsHTML tuple = "<tr>" <> T.concat (L.map tupleFrag (tupleAssocs tuple)) <>
51 where
53 where
52 tupleFrag tup = "<td>" <> atomAsHTML (snd tup) <> "</td>"
54 tupleFrag tup = "<td>" <> atomAsHTML (snd tup) <> "</td>"
53 atomAsHTML (RelationAtom rel) = relationAsHTML rel
55 atomAsHTML (RelationAtom rel) = relationAsHTML rel
56+ atomAsHTML (TextAtom t) = "&quot;" <> t <> "&quot;"
54 atomAsHTML atom = atomToText atom
57 atomAsHTML atom = atomToText atom
55
58
56tupleSetAsHTML :: RelationTupleSet -> Text
59tupleSetAsHTML :: RelationTupleSet -> Text
src/lib/ProjectM36/Relation/Show/Term.hs+5−10
@@ -9,7 +9,11 @@ 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
12import Data.Monoid
15import Data.Monoid
16+#endif
13import ProjectM36.WCWidth --guess the width that the character will appear as in the terminal
17import ProjectM36.WCWidth --guess the width that the character will appear as in the terminal
14
18
15boxV :: StringType
19boxV :: StringType
@@ -38,16 +42,6 @@ boxBB = "┴"
38boxC :: StringType
42boxC :: StringType
39boxC = "┼"
43boxC = "┼"
40
44
41−dboxH :: StringType
42−dboxH = "═"
43−dboxL :: StringType
44−dboxL = "╞"
45−dboxR :: StringType
46−dboxR = "╡"
47−
48−class TermSize a where
49− termLength :: a -> Int
50−
51--represent a relation as a table similar to those drawn by Date
45--represent a relation as a table similar to those drawn by Date
52type Cell = StringType
46type Cell = StringType
53type Table = ([Cell], [[Cell]]) --header, body
47type Table = ([Cell], [[Cell]]) --header, body
@@ -105,6 +99,7 @@ showAtom :: Int -> Atom -> StringType
105showAtom _ (RelationAtom rel) = renderTable $ relationAsTable rel
99showAtom _ (RelationAtom rel) = renderTable $ relationAsTable rel
106showAtom level (ConstructedAtom dConsName _ atoms) = showParens (level >= 1 && not (null atoms)) $ T.concat (L.intersperse " " (dConsName : map (showAtom 1) atoms))
100showAtom level (ConstructedAtom dConsName _ atoms) = showParens (level >= 1 && not (null atoms)) $ T.concat (L.intersperse " " (dConsName : map (showAtom 1) atoms))
107showAtom _ (TextAtom t) = "\"" <> t <> "\""
101showAtom _ (TextAtom t) = "\"" <> t <> "\""
102+showAtom _ (ByteStringAtom bs) = TE.decodeUtf8 (B64.encode bs)
108showAtom _ atom = atomToText atom
103showAtom _ atom = atomToText atom
109
104
110renderTable :: Table -> StringType
105renderTable :: Table -> StringType
src/lib/ProjectM36/RelationalExpression.hs+1065−617
@@ -1,33 +1,53 @@
1{-# LANGUAGE ScopedTypeVariables #-}
1{-# LANGUAGE ScopedTypeVariables #-}
2+{-# LANGUAGE FlexibleInstances #-}
3+{-# LANGUAGE FlexibleContexts #-}
4+{-# LANGUAGE OverloadedStrings #-}
2module ProjectM36.RelationalExpression where
5module ProjectM36.RelationalExpression where
3import ProjectM36.Relation
6import ProjectM36.Relation
4import ProjectM36.Tuple
7import ProjectM36.Tuple
5import ProjectM36.TupleSet
8import ProjectM36.TupleSet
6import ProjectM36.Base
9import ProjectM36.Base
10+import qualified Data.UUID as U
7import ProjectM36.Error
11import ProjectM36.Error
8import ProjectM36.AtomType
12import ProjectM36.AtomType
9−import ProjectM36.Attribute (emptyAttributes)
13+import ProjectM36.Attribute (emptyAttributes, attributesFromList)
10import ProjectM36.ScriptSession
14import ProjectM36.ScriptSession
11import ProjectM36.DataTypes.Primitive
15import ProjectM36.DataTypes.Primitive
12import ProjectM36.AtomFunction
16import ProjectM36.AtomFunction
13import ProjectM36.DatabaseContextFunction
17import ProjectM36.DatabaseContextFunction
18+import ProjectM36.Arbitrary
19+import ProjectM36.GraphRefRelationalExpr
20+import ProjectM36.Transaction
14import qualified ProjectM36.Attribute as A
21import qualified ProjectM36.Attribute as A
15import qualified Data.Map as M
22import qualified Data.Map as M
16import qualified Data.HashSet as HS
23import qualified Data.HashSet as HS
17import qualified Data.Set as S
24import qualified Data.Set as S
18import Control.Monad.State hiding (join)
25import Control.Monad.State hiding (join)
19−import Control.Exception
26+import Data.Bifunctor (second)
20import Data.Maybe
27import Data.Maybe
21import Data.Either
28import Data.Either
22import Data.Char (isUpper)
29import Data.Char (isUpper)
30+import Data.Time
31+import qualified Data.List.NonEmpty as NE
32+import Data.Functor.Identity
23import qualified Data.Text as T
33import qualified Data.Text as T
24import qualified Data.Vector as V
34import qualified Data.Vector as V
25import qualified ProjectM36.TypeConstructorDef as TCD
35import qualified ProjectM36.TypeConstructorDef as TCD
26−import Control.Monad.Trans.Except
36+import qualified Control.Monad.RWS.Strict as RWS
37+import Control.Monad.RWS.Strict (RWST, execRWST, runRWST)
38+import Control.Monad.Except hiding (join)
27−import Control.Monad.Trans.Reader
39+import Control.Monad.Trans.Except (except)
28−
40+import Control.Monad.Reader as R hiding (join)
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
29−import GHC
47+import GHC hiding (getContext)
48+import Control.Exception
30import GHC.Paths
49import GHC.Paths
50+#endif
31
51
32data DatabaseContextExprDetails = CountUpdatedTuples
52data DatabaseContextExprDetails = CountUpdatedTuples
33
53
@@ -44,32 +64,63 @@ databaseContextExprDetailsFunc CountUpdatedTuples _ relIn = Relation attrs newTu
44 Right ts -> ts
64 Right ts -> ts
45
65
46-- | Used to start a fresh database state for a new database context expression.
66-- | Used to start a fresh database state for a new database context expression.
47−freshDatabaseState :: DatabaseContext -> DatabaseStateElems
67+mkDatabaseContextEvalState :: DatabaseContext -> DatabaseContextEvalState
68+mkDatabaseContextEvalState context = DatabaseContextEvalState {
69+ dbc_context = context,
70+ dbc_accum = M.empty,
71+ dbc_dirty = False
48−freshDatabaseState ctx = (ctx, M.empty, False) --future work: propagate return accumulator
72+ } --future work: propagate return accumulator
49
73
50-- we need to pass around a higher level RelationTuple and Attributes in order to solve #52
74-- we need to pass around a higher level RelationTuple and Attributes in order to solve #52
51−data RelationalExprStateElems = RelationalExprStateTupleElems DatabaseContext RelationTuple | -- used when fully evaluating a relexpr
75+data RelationalExprEnv = RelationalExprEnv {
52− RelationalExprStateAttrsElems DatabaseContext Attributes | --used when evaluating the type of a relexpr
76+ re_context :: DatabaseContext,
53− RelationalExprStateElems DatabaseContext --used by default at the top level of evaluation
77+ re_graph :: TransactionGraph,
54−
78+ re_extra :: Maybe (Either RelationTuple Attributes)
55−instance Show RelationalExprStateElems where
79+ }
56− show (RelationalExprStateTupleElems _ tup) = "RelationalExprStateTupleElems " ++ show tup
80+
57− show (RelationalExprStateAttrsElems _ attrs) = "RelationalExprStateAttrsElems" ++ show attrs
81+envTuple :: GraphRefRelationalExprEnv -> RelationTuple
58− show (RelationalExprStateElems _) = "RelationalExprStateElems"
82+envTuple e = fromLeft emptyTuple (fromMaybe (Left emptyTuple) (gre_extra e))
59−
83+
60−mkRelationalExprState :: DatabaseContext -> RelationalExprStateElems
84+envAttributes :: GraphRefRelationalExprEnv -> Attributes
61−mkRelationalExprState = RelationalExprStateElems
85+envAttributes e = fromRight emptyAttributes (fromMaybe (Right emptyAttributes) (gre_extra e))
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)
68
86
69−mergeAttributesIntoRelationalExprState :: Attributes -> RelationalExprStateElems -> RelationalExprStateElems
87+instance Show RelationalExprEnv where
70−mergeAttributesIntoRelationalExprState attrs (RelationalExprStateElems ctx) = RelationalExprStateAttrsElems ctx attrs
88+ show e@RelationalExprEnv{} = "RelationalExprEnv " ++ show (re_extra e)
71−mergeAttributesIntoRelationalExprState _ st@(RelationalExprStateTupleElems _ _) = st
89+
72−mergeAttributesIntoRelationalExprState attrsIn (RelationalExprStateAttrsElems ctx attrs) = RelationalExprStateAttrsElems ctx (A.union attrsIn attrs)
90+--used to eval relationalexpr
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)))
73
124
74type ResultAccumName = StringType
125type ResultAccumName = StringType
75
126
@@ -79,422 +130,403 @@ data ResultAccum = ResultAccum { resultAccumFunc :: ResultAccumFunc,
79 resultAccumResult :: Relation
130 resultAccumResult :: Relation
80 }
131 }
81
132
133+data DatabaseContextEvalState = DatabaseContextEvalState {
134+ dbc_context :: DatabaseContext, --new, alterable context for a new transaction
82−type DatabaseStateElems = (DatabaseContext, M.Map ResultAccumName ResultAccum, DirtyFlag)
135+ dbc_accum :: M.Map ResultAccumName ResultAccum,
136+ dbc_dirty :: DirtyFlag
137+ }
83
138
84−type DatabaseState a = State DatabaseStateElems a
139+data DatabaseContextEvalEnv = DatabaseContextEvalEnv
140+ { dce_transId :: TransactionId,
141+ dce_graph :: TransactionGraph
142+ }
85
143
86−getStateContext :: DatabaseState DatabaseContext
144+mkDatabaseContextEvalEnv :: TransactionId -> TransactionGraph -> DatabaseContextEvalEnv
87−getStateContext = do
145+mkDatabaseContextEvalEnv = DatabaseContextEvalEnv
88− (ctx,_, _) <- get
146+
89− pure ctx
147+type DatabaseContextEvalMonad a = RWST DatabaseContextEvalEnv () DatabaseContextEvalState (ExceptT RelationalError Identity) a
90−
148+
91−putStateContext :: DatabaseContext -> DatabaseState ()
149+runDatabaseContextEvalMonad :: DatabaseContext -> DatabaseContextEvalEnv -> DatabaseContextEvalMonad () -> Either RelationalError DatabaseContextEvalState
92−putStateContext ctx = do
150+runDatabaseContextEvalMonad ctx env m = runIdentity (runExceptT (fst <$> execRWST m env freshEnv))
93− (_, accum, _) <- get
151+ where
94− put (ctx, accum, True)
152+ freshEnv = mkDatabaseContextEvalState ctx
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
157
153
158−evalRelationalExpr (MakeRelationFromExprs mAttrExprs tupleExprs) = do
154+
159− currentContext <- fmap stateElemsContext ask
155+dbcTransId :: DatabaseContextEvalMonad TransactionId
160− let tConss = typeConstructorMapping currentContext
156+dbcTransId = dce_transId <$> RWS.ask
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
157+
162− runExceptT $ do
158+dbcGraph :: DatabaseContextEvalMonad TransactionGraph
163− mAttrs <- case mAttrExprs of
159+dbcGraph = dce_graph <$> RWS.ask
164− Just _ ->
160+
165− Just . A.attributesFromList <$> mapM (either throwE pure . evalAttrExpr tConss) (fromMaybe [] mAttrExprs)
161+dbcRelationalExprEnv :: DatabaseContextEvalMonad RelationalExprEnv
166− Nothing -> pure Nothing
162+dbcRelationalExprEnv =
167− tuples <- mapM (liftE . evalTupleExpr mAttrs) tupleExprs
163+ mkRelationalExprEnv <$> getStateContext <*> dbcGraph
168− let attrs = fromMaybe firstTupleAttrs mAttrs
164+
169− firstTupleAttrs = if null tuples then A.emptyAttributes else tupleAttributes (head tuples)
165+getStateContext :: DatabaseContextEvalMonad DatabaseContext
170− either throwE pure (mkRelation attrs (RelationTupleSet tuples))
166+getStateContext = gets dbc_context
167+
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+ }
171
180
172−evalRelationalExpr (ExistingRelation rel) = pure (Right rel)
181+type GraphRefRelationalExprM a = ReaderT GraphRefRelationalExprEnv (ExceptT RelationalError Identity) a
173
182
174−evalRelationalExpr (Rename oldAttrName newAttrName relExpr) = do
183+gfTransForId :: TransactionId -> GraphRefRelationalExprM Transaction
175− evald <- evalRelationalExpr relExpr
184+gfTransForId tid = do
176− case evald of
185+ graph <- gfGraph
177− Right rel -> return $ rename oldAttrName newAttrName rel
186+ lift $ except $ transactionForId tid graph
178− Left err -> return $ Left err
179
187
180−evalRelationalExpr (Group oldAttrNames newAttrName relExpr) = do
188+gfDatabaseContextForMarker :: GraphRefTransactionMarker -> GraphRefRelationalExprM DatabaseContext
181− eOldAttrNameSet <- evalAttributeNames oldAttrNames relExpr
189+gfDatabaseContextForMarker (TransactionMarker transId) = concreteDatabaseContext <$> gfTransForId transId
182− case eOldAttrNameSet of
190+gfDatabaseContextForMarker UncommittedContextMarker = do
183− Left err -> pure (Left err)
191+ mctx <- gre_context <$> askEnv
184− Right oldAttrNameSet -> do
185− evald <- evalRelationalExpr relExpr
186− case evald of
187− Right rel -> return $ group oldAttrNameSet newAttrName rel
188− Left err -> return $ Left err
189−
190−evalRelationalExpr (Ungroup attrName relExpr) = do
191− evald <- evalRelationalExpr relExpr
192− case evald of
193− Right rel -> return $ ungroup attrName rel
194− Left err -> return $ Left err
195−
196−evalRelationalExpr (Restrict predicateExpr relExpr) = do
197− evald <- evalRelationalExpr relExpr
198− case evald of
199− Left err -> return $ Left err
200− Right rel -> do
201− eFilterFunc <- predicateRestrictionFilter (attributes rel) predicateExpr
202− case eFilterFunc of
203− Left err -> return $ Left err
204− Right filterfunc ->
205− pure (restrict filterfunc rel)
206−
207−evalRelationalExpr (Equals relExprA relExprB) = do
208− evaldA <- evalRelationalExpr relExprA
209− evaldB <- evalRelationalExpr relExprB
210− case evaldA of
211− Left err -> return $ Left err
212− Right relA -> case evaldB of
213− Left err -> return $ Left err
214− Right relB -> return $ Right $ if relA == relB then relationTrue else relationFalse
215−
216−--warning: copy-pasta from above- refactor
217−evalRelationalExpr (NotEquals relExprA relExprB) = do
218− evaldA <- evalRelationalExpr relExprA
219− evaldB <- evalRelationalExpr relExprB
220− case evaldA of
192+ case mctx of
221− Left err -> return $ Left err
193+ Nothing -> throwError NoUncommittedContextInEvalError
222− Right relA -> case evaldB of
194+ Just ctx -> pure ctx
223− Left err -> return $ Left err
195+
224− Right relB -> return $ Right $ if relA /= relB then relationTrue else relationFalse
196+runGraphRefRelationalExprM :: GraphRefRelationalExprEnv -> GraphRefRelationalExprM a -> Either RelationalError a
225−
197+runGraphRefRelationalExprM env m = runIdentity (runExceptT (runReaderT m env))
226−-- extending a relation adds a single attribute with the results of the per-tuple expression evaluated
198+
227−evalRelationalExpr (Extend tupleExpression relExpr) = do
199+freshGraphRefRelationalExprEnv :: Maybe DatabaseContext -> TransactionGraph -> GraphRefRelationalExprEnv
228− rstate <- ask
200+freshGraphRefRelationalExprEnv mctx graph = GraphRefRelationalExprEnv {
229− let evald = runReader (evalRelationalExpr relExpr) rstate
201+ gre_context = mctx,
230− case evald of
202+ gre_graph = graph,
231− Left err -> pure (Left err)
203+ gre_extra = Nothing
232− Right rel -> do
204+ }
233− tupProc <- extendTupleExpressionProcessor rel tupleExpression
205+
234− case tupProc of
206+gfGraph :: GraphRefRelationalExprM TransactionGraph
235− Left err -> pure (Left err)
207+gfGraph = asks gre_graph
236− Right (newAttrs, tupProc') -> pure $ relMogrify tupProc' newAttrs rel
208+
209+envContext :: RelationalExprEnv -> DatabaseContext
210+envContext = re_context
211+
212+setEnvContext :: RelationalExprEnv -> DatabaseContext -> RelationalExprEnv
213+setEnvContext e ctx = e { re_context = ctx }
237
214
238--helper function to process relation variable creation/assignment
215--helper function to process relation variable creation/assignment
239−setRelVar :: RelVarName -> Relation -> DatabaseState (Either RelationalError ())
216+setRelVar :: RelVarName -> GraphRefRelationalExpr -> DatabaseContextEvalMonad ()
240−setRelVar relVarName rel = do
217+setRelVar relVarName relExpr = do
241 currentContext <- getStateContext
218 currentContext <- getStateContext
219+ --prevent recursive relvar definition by resolving references to relvars in previous states
220+ relExpr' <- resolve relExpr
242− let newRelVars = M.insert relVarName rel $ relationVariables currentContext
221+ let newRelVars = M.insert relVarName relExpr' $ relationVariables currentContext
243 potentialContext = currentContext { relationVariables = newRelVars }
222 potentialContext = currentContext { relationVariables = newRelVars }
244−
223+ --optimization: if the relexpr is unchanged, skip the update
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
245− case checkConstraints potentialContext of
230+ case checkConstraints potentialContext tid graph of
246− Left err -> pure (Left err)
231+ Left err -> dbErr err
247− Right _ -> do
248− putStateContext potentialContext
232+ Right _ -> putStateContext potentialContext
249− return (Right ())
233+
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
235+--insertIntoRelVar :: RelVarName -> GraphRefRelationalExpr -> DatabaseContextEvalMonad ()
250
236
251-- 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
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−deleteRelVar :: RelVarName -> DatabaseState (Either RelationalError ())
238+deleteRelVar :: RelVarName -> DatabaseContextEvalMonad ()
253deleteRelVar relVarName = do
239deleteRelVar relVarName = do
254 currContext <- getStateContext
240 currContext <- getStateContext
255 let relVars = relationVariables currContext
241 let relVars = relationVariables currContext
256 if M.notMember relVarName relVars then
242 if M.notMember relVarName relVars then
257− pure (Right ())
243+ pure ()
258 else do
244 else do
259 let newRelVars = M.delete relVarName relVars
245 let newRelVars = M.delete relVarName relVars
260 newContext = currContext { relationVariables = newRelVars }
246 newContext = currContext { relationVariables = newRelVars }
261 putStateContext newContext
247 putStateContext newContext
262− pure (Right ())
248+ pure ()
263
249
264−evalDatabaseContextExpr :: DatabaseContextExpr -> DatabaseState (Either RelationalError ())
250+evalGraphRefDatabaseContextExpr :: GraphRefDatabaseContextExpr -> DatabaseContextEvalMonad ()
265−evalDatabaseContextExpr NoOperation = pure (Right ())
251+evalGraphRefDatabaseContextExpr NoOperation = pure ()
266
252
267−evalDatabaseContextExpr (Define relVarName attrExprs) = do
253+evalGraphRefDatabaseContextExpr (Define relVarName attrExprs) = do
254+ context <- getStateContext
268 relvars <- fmap relationVariables getStateContext
255 relvars <- fmap relationVariables getStateContext
269 tConss <- fmap typeConstructorMapping getStateContext
256 tConss <- fmap typeConstructorMapping getStateContext
270− let eAttrs = map (evalAttrExpr tConss) attrExprs
257+ graph <- dbcGraph
271− case lefts eAttrs of
258+ let eAttrs = runGraphRefRelationalExprM gfEnv (mapM evalGraphRefAttrExpr attrExprs)
272− err:_ -> pure (Left err)
259+ gfEnv = freshGraphRefRelationalExprEnv (Just context) graph
260+ case eAttrs of
261+ Left err -> dbErr err
262+ Right attrsList -> do
263+ lift $ except $ validateAttributes tConss (A.attributesFromList attrsList)
273− [] -> case M.member relVarName relvars of
264+ case M.member relVarName relvars of
274− True -> pure (Left (RelVarAlreadyDefinedError relVarName))
265+ True -> dbErr (RelVarAlreadyDefinedError relVarName)
275− False -> setRelVar relVarName emptyRelation >> pure (Right ())
266+ False -> setRelVar relVarName (ExistingRelation emptyRelation)
276− where
267+ where
277− attrs = A.attributesFromList (rights eAttrs)
268+ attrs = A.attributesFromList attrsList
278− emptyRelation = Relation attrs emptyTupleSet
269+ emptyRelation = Relation attrs emptyTupleSet
279−
270+
280−evalDatabaseContextExpr (Undefine relVarName) = deleteRelVar relVarName
271+evalGraphRefDatabaseContextExpr (Undefine relVarName) = deleteRelVar relVarName
281−
272+
282−evalDatabaseContextExpr (Assign relVarName expr) = do
273+evalGraphRefDatabaseContextExpr (Assign relVarName expr) = do
283− -- in the future, it would be nice to get types from the RelationalExpr instead of needing to evaluate it
274+ graph <- re_graph <$> dbcRelationalExprEnv
284− context <- getStateContext
285− let existingRelVar = M.lookup relVarName relVarTable
286− relVarTable = relationVariables context
287− value = runReader (evalRelationalExpr expr) (RelationalExprStateElems context)
288− case value of
289− Left err -> pure (Left err)
290− Right rel -> case existingRelVar of
291− Nothing -> setRelVar relVarName rel
292− Just existingRel -> let expectedAttributes = attributes existingRel
293− foundAttributes = attributes rel in
294− if A.attributesEqual expectedAttributes foundAttributes then
295− setRelVar relVarName rel
296− else
297− pure (Left (RelationTypeMismatchError expectedAttributes foundAttributes))
298−
299−evalDatabaseContextExpr (Insert relVarName relExpr) = do
300− context <- getStateContext
301− let unionexp = Union relExpr rv
302− rv = RelationVariable relVarName ()
303− unioned = runReader (evalRelationalExpr unionexp) (RelationalExprStateElems context)
304− origRel = runReader (evalRelationalExpr rv) (RelationalExprStateElems context)
305− case unioned of
306− Left err -> pure (Left err)
307− Right unioned' -> case origRel of
308− Left err -> pure (Left err)
309− Right origRel' -> if cardinality unioned' == cardinality origRel' then --no tuples actually inserted
310− pure (Right ())
311− else
312− evalDatabaseContextExpr $ Assign relVarName (ExistingRelation unioned')
313−
314−evalDatabaseContextExpr (Delete relVarName predicate) = do
315 context <- getStateContext
275 context <- getStateContext
316− let rv = RelationVariable relVarName ()
276+ let existingRelVar = M.lookup relVarName (relationVariables context)
317− let updatedRel = runReader (evalRelationalExpr (Restrict (NotPredicate predicate) rv)) (RelationalExprStateElems context)
277+ reEnv = freshGraphRefRelationalExprEnv (Just context) graph
318− origRel = runReader (evalRelationalExpr rv) (RelationalExprStateElems context)
278+ eNewExprType = runGraphRefRelationalExprM reEnv (typeForGraphRefRelationalExpr expr)
319− case updatedRel of
279+ 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
286+ Just existingRel -> do
287+ let eExpectedType = runGraphRefRelationalExprM reEnv (typeForGraphRefRelationalExpr existingRel)
288+ case eExpectedType of
320− Left err -> pure (Left err)
289+ Left err -> dbErr err
321− Right updatedRel' -> case origRel of
290+ Right expectedType ->
291+ case eNewExprType of
322− Left err -> pure (Left err)
292+ Left err -> dbErr err
323− Right origRel' -> if cardinality origRel' == cardinality updatedRel' then
293+ Right newExprType -> do
324− pure (Right ())
294+ if newExprType == expectedType then do
295+ lift $ except $ validateAttributes (typeConstructorMapping context) (attributes newExprType)
296+ setRelVar relVarName expr
325− else
297+ else
326− setRelVar relVarName updatedRel'
298+ dbErr (RelationTypeMismatchError (attributes expectedType) (attributes newExprType))
327
299
300+evalGraphRefDatabaseContextExpr (Insert relVarName relExpr) = do
301+ gfExpr <- relVarByName relVarName
302+ let optExpr = applyUnionCollapse (Union
303+ relExpr
304+ gfExpr)
305+ evalGraphRefDatabaseContextExpr (Assign relVarName optExpr)
306+
307+evalGraphRefDatabaseContextExpr (Delete relVarName predicate) = do
308+ gfExpr <- relVarByName relVarName
309+ let optExpr = applyRestrictionCollapse (Restrict (NotPredicate predicate) gfExpr)
310+ setRelVar relVarName optExpr
311+
328--union of restricted+updated portion and the unrestricted+unupdated portion
312--union of restricted+updated portion and the unrestricted+unupdated portion
329−evalDatabaseContextExpr (Update relVarName atomExprMap restrictionPredicateExpr) = do
313+evalGraphRefDatabaseContextExpr (Update relVarName atomExprMap pred') = do
314+ rvExpr <- relVarByName relVarName
315+ graph <- re_graph <$> dbcRelationalExprEnv
330 context <- getStateContext
316 context <- getStateContext
331− let relVarTable = relationVariables context
317+ let reEnv = freshGraphRefRelationalExprEnv (Just context) graph
332− case M.lookup relVarName relVarTable of
318+ --get the current attributes name in the relvar to ensure that we don't conflict when renaming
333− Nothing -> pure (Left (RelVarNotDefinedError relVarName))
319+ eExprType = runGraphRefRelationalExprM reEnv (typeForGraphRefRelationalExpr rvExpr)
334− Just rel ->
320+ exprType' <- case eExprType of
335− case runReader (predicateRestrictionFilter (attributes rel) restrictionPredicateExpr) (RelationalExprStateElems context) of
321+ Left err -> throwError err
336− Left err -> pure (Left err)
322+ Right t -> pure t
337− Right predicateFunc -> do
323+ let unrestrictedPortion = Restrict (NotPredicate pred') rvExpr
338− let ret = do
324+ tmpAttr = tmpAttrC 1
339− restrictedPortion <- restrict predicateFunc rel
325+ tmpAttrC :: Int -> AttributeName -> AttributeName
340− if cardinality restrictedPortion == Finite 0 then
326+ tmpAttrC c attr =
341− pure Nothing
327+ let tmpAttrName = "_tmp_" <> T.pack (show c) <> attr in
328+ if tmpAttrName `S.member` A.attributeNameSet (attributes exprType') then
329+ tmpAttrC (c+1) attr
342− else do
330+ else
343− unrestrictedPortion <- restrict (predicateFunc >=> (pure . not)) rel
331+ tmpAttrName
344− updatedPortion <- relMap (updateTupleWithAtomExprs atomExprMap context) restrictedPortion
332+ updateAttr nam atomExpr = Extend (AttributeExtendTupleExpr (tmpAttr nam) atomExpr)
345− updatedRel <- updatedPortion `union` unrestrictedPortion
333+ projectAndRename attr expr = Rename (tmpAttr attr) attr (Project (InvertedAttributeNames (S.singleton attr)) expr)
346− pure (Just updatedRel)
334+ restrictedPortion = Restrict pred' rvExpr
347− case ret of
335+ updated = foldr (\(oldname, atomExpr) accum ->
348− Left err -> pure (Left err)
336+ let procAtomExpr = runProcessExprM UncommittedContextMarker (processAtomExpr atomExpr) in
349− Right Nothing -> pure (Right ())
337+ updateAttr oldname procAtomExpr accum
350− Right (Just updatedRel) -> setRelVar relVarName updatedRel
338+ ) restrictedPortion (M.toList atomExprMap)
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)
351
342
352−evalDatabaseContextExpr (AddInclusionDependency newDepName newDep) = do
343+evalGraphRefDatabaseContextExpr (AddInclusionDependency newDepName newDep) = do
353 currContext <- getStateContext
344 currContext <- getStateContext
345+ transId <- dbcTransId
346+ graph <- dbcGraph
354 let currDeps = inclusionDependencies currContext
347 let currDeps = inclusionDependencies currContext
355 newDeps = M.insert newDepName newDep currDeps
348 newDeps = M.insert newDepName newDep currDeps
356 if M.member newDepName currDeps then
349 if M.member newDepName currDeps then
357− pure (Left (InclusionDependencyNameInUseError newDepName))
350+ dbErr (InclusionDependencyNameInUseError newDepName)
358 else do
351 else do
359 let potentialContext = currContext { inclusionDependencies = newDeps }
352 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
360− case checkConstraints potentialContext of
355+ case checkConstraints potentialContext transId graph of
361− Left err -> pure (Left err)
356+ Left err -> dbErr err
362− Right _ -> do
357+ Right _ ->
363 putStateContext potentialContext
358 putStateContext potentialContext
364− return (Right ())
365
359
366−evalDatabaseContextExpr (RemoveInclusionDependency depName) = do
360+evalGraphRefDatabaseContextExpr (RemoveInclusionDependency depName) = do
367 currContext <- getStateContext
361 currContext <- getStateContext
368 let currDeps = inclusionDependencies currContext
362 let currDeps = inclusionDependencies currContext
369 newDeps = M.delete depName currDeps
363 newDeps = M.delete depName currDeps
370 if M.notMember depName currDeps then
364 if M.notMember depName currDeps then
371− pure (Left (InclusionDependencyNameNotInUseError depName))
365+ dbErr (InclusionDependencyNameNotInUseError depName)
372− else do
366+ else
373 putStateContext $ currContext {inclusionDependencies = newDeps }
367 putStateContext $ currContext {inclusionDependencies = newDeps }
374− return (Right ())
375
368
376-- | Add a notification which will send the resultExpr when triggerExpr changes between commits.
369-- | Add a notification which will send the resultExpr when triggerExpr changes between commits.
377−evalDatabaseContextExpr (AddNotification notName triggerExpr resultOldExpr resultNewExpr) = do
370+evalGraphRefDatabaseContextExpr (AddNotification notName triggerExpr resultOldExpr resultNewExpr) = do
378 currentContext <- getStateContext
371 currentContext <- getStateContext
379 let nots = notifications currentContext
372 let nots = notifications currentContext
380 if M.member notName nots then
373 if M.member notName nots then
381− pure (Left (NotificationNameInUseError notName))
374+ dbErr (NotificationNameInUseError notName)
382 else do
375 else do
383 let newNotifications = M.insert notName newNotification nots
376 let newNotifications = M.insert notName newNotification nots
384 newNotification = Notification { changeExpr = triggerExpr,
377 newNotification = Notification { changeExpr = triggerExpr,
385 reportOldExpr = resultOldExpr,
378 reportOldExpr = resultOldExpr,
386 reportNewExpr = resultNewExpr}
379 reportNewExpr = resultNewExpr}
387 putStateContext $ currentContext { notifications = newNotifications }
380 putStateContext $ currentContext { notifications = newNotifications }
388− return (Right ())
389
381
390−evalDatabaseContextExpr (RemoveNotification notName) = do
382+evalGraphRefDatabaseContextExpr (RemoveNotification notName) = do
391 currentContext <- getStateContext
383 currentContext <- getStateContext
392 let nots = notifications currentContext
384 let nots = notifications currentContext
393 if M.notMember notName nots then
385 if M.notMember notName nots then
394− pure (Left (NotificationNameNotInUseError notName))
386+ dbErr (NotificationNameNotInUseError notName)
395 else do
387 else do
396 let newNotifications = M.delete notName nots
388 let newNotifications = M.delete notName nots
397 putStateContext $ currentContext { notifications = newNotifications }
389 putStateContext $ currentContext { notifications = newNotifications }
398− pure (Right ())
390+
399
391
400-- | Adds type and data constructors to the database context.
392-- | Adds type and data constructors to the database context.
401-- validate that the type *and* constructor names are unique! not yet implemented!
393-- validate that the type *and* constructor names are unique! not yet implemented!
402−evalDatabaseContextExpr (AddTypeConstructor tConsDef dConsDefList) = do
394+evalGraphRefDatabaseContextExpr (AddTypeConstructor tConsDef dConsDefList) = do
403 currentContext <- getStateContext
395 currentContext <- getStateContext
404 let oldTypes = typeConstructorMapping currentContext
396 let oldTypes = typeConstructorMapping currentContext
405 tConsName = TCD.name tConsDef
397 tConsName = TCD.name tConsDef
406 -- validate that the constructor's types exist
398 -- validate that the constructor's types exist
407− case validateTypeConstructorDef tConsDef dConsDefList of
399+ case validateTypeConstructorDef tConsDef dConsDefList oldTypes of
408− errs@(_:_) -> pure (Left (someErrors errs))
400+ Left err -> throwError err
409− [] | T.null tConsName || not (isUpper (T.head tConsName)) -> pure (Left (InvalidAtomTypeName tConsName))
401+ Right () | T.null tConsName || not (isUpper (T.head tConsName)) -> dbErr (InvalidAtomTypeName tConsName)
410− | isJust (findTypeConstructor tConsName oldTypes) -> pure (Left (AtomTypeNameInUseError tConsName))
402+ | isJust (findTypeConstructor tConsName oldTypes) -> dbErr (AtomTypeNameInUseError tConsName)
411 | otherwise -> do
403 | otherwise -> do
412 let newTypes = oldTypes ++ [(tConsDef, dConsDefList)]
404 let newTypes = oldTypes ++ [(tConsDef, dConsDefList)]
413 putStateContext $ currentContext { typeConstructorMapping = newTypes }
405 putStateContext $ currentContext { typeConstructorMapping = newTypes }
414− pure (Right ())
415
406
416-- | 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.
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−evalDatabaseContextExpr (RemoveTypeConstructor tConsName) = do
408+evalGraphRefDatabaseContextExpr (RemoveTypeConstructor tConsName) = do
418 currentContext <- getStateContext
409 currentContext <- getStateContext
419 let oldTypes = typeConstructorMapping currentContext
410 let oldTypes = typeConstructorMapping currentContext
420 if isNothing (findTypeConstructor tConsName oldTypes) then
411 if isNothing (findTypeConstructor tConsName oldTypes) then
421− pure (Left (AtomTypeNameNotInUseError tConsName))
412+ dbErr (AtomTypeNameNotInUseError tConsName)
422 else do
413 else do
423 let newTypes = filter (\(tCons, _) -> TCD.name tCons /= tConsName) oldTypes
414 let newTypes = filter (\(tCons, _) -> TCD.name tCons /= tConsName) oldTypes
424 putStateContext $ currentContext { typeConstructorMapping = newTypes }
415 putStateContext $ currentContext { typeConstructorMapping = newTypes }
425− pure (Right ())
426
416
427−evalDatabaseContextExpr (MultipleExpr exprs) = do
417+evalGraphRefDatabaseContextExpr (MultipleExpr exprs) =
428 --the multiple expressions must pass the same context around- not the old unmodified context
418 --the multiple expressions must pass the same context around- not the old unmodified context
429− evald <- forM exprs evalDatabaseContextExpr
419+ mapM_ evalGraphRefDatabaseContextExpr exprs
430− --some lifting magic needed here
420+
431− case lefts evald of
432− [] -> pure (Right ())
433− errs -> pure (Left (someErrors errs))
434−
435−evalDatabaseContextExpr (RemoveAtomFunction funcName) = do
421+evalGraphRefDatabaseContextExpr (RemoveAtomFunction funcName) = do
436 currentContext <- getStateContext
422 currentContext <- getStateContext
437 let atomFuncs = atomFunctions currentContext
423 let atomFuncs = atomFunctions currentContext
438 case atomFunctionForName funcName atomFuncs of
424 case atomFunctionForName funcName atomFuncs of
439− Left err -> pure (Left err)
425+ Left err -> dbErr err
426+ Right realFunc ->
440− Right realFunc -> if isScriptedAtomFunction realFunc then do
427+ if isScriptedAtomFunction realFunc then do
441− let updatedFuncs = HS.delete realFunc atomFuncs
428+ let updatedFuncs = HS.delete realFunc atomFuncs
442− putStateContext (currentContext {atomFunctions = updatedFuncs })
429+ putStateContext (currentContext {atomFunctions = updatedFuncs })
443− pure (Right ())
444− else
430+ else
445− pure (Left (PrecompiledFunctionRemoveError funcName))
431+ dbErr (PrecompiledFunctionRemoveError funcName)
446
432
447−evalDatabaseContextExpr (RemoveDatabaseContextFunction funcName) = do
433+evalGraphRefDatabaseContextExpr (RemoveDatabaseContextFunction funcName) = do
448 context <- getStateContext
434 context <- getStateContext
449 let dbcFuncs = dbcFunctions context
435 let dbcFuncs = dbcFunctions context
450 case databaseContextFunctionForName funcName dbcFuncs of
436 case databaseContextFunctionForName funcName dbcFuncs of
451− Left err -> pure (Left err)
437+ Left err -> dbErr err
438+ Right realFunc ->
452− Right realFunc -> if isScriptedDatabaseContextFunction realFunc then do
439+ if isScriptedDatabaseContextFunction realFunc then do
453− let updatedFuncs = HS.delete realFunc dbcFuncs
440+ let updatedFuncs = HS.delete realFunc dbcFuncs
454− putStateContext (context { dbcFunctions = updatedFuncs })
441+ putStateContext (context { dbcFunctions = updatedFuncs })
455− pure (Right ())
456− else
442+ else
457− pure (Left (PrecompiledFunctionRemoveError funcName))
443+ dbErr (PrecompiledFunctionRemoveError funcName)
458
444
459−evalDatabaseContextExpr (ExecuteDatabaseContextFunction funcName atomArgExprs) = do
445+evalGraphRefDatabaseContextExpr (ExecuteDatabaseContextFunction funcName atomArgExprs) = do
460 context <- getStateContext
446 context <- getStateContext
447+ graph <- dbcGraph
461 --resolve atom arguments
448 --resolve atom arguments
462− let relExprState = mkRelationalExprState context
449+ let eAtomTypes = mapM (runGraphRefRelationalExprM gfEnv . typeForGraphRefAtomExpr emptyAttributes) atomArgExprs
463− eAtomTypes = map (\atomExpr -> runReader (typeFromAtomExpr emptyAttributes atomExpr) relExprState) atomArgExprs
464 eFunc = databaseContextFunctionForName funcName (dbcFunctions context)
450 eFunc = databaseContextFunctionForName funcName (dbcFunctions context)
451+ gfEnv = freshGraphRefRelationalExprEnv (Just context) graph
465 case eFunc of
452 case eFunc of
466− Left err -> pure (Left err)
453+ Left err -> dbErr err
467 Right func -> do
454 Right func -> do
468 let expectedArgCount = length (dbcFuncType func)
455 let expectedArgCount = length (dbcFuncType func)
469 actualArgCount = length atomArgExprs
456 actualArgCount = length atomArgExprs
470 if expectedArgCount /= actualArgCount then
457 if expectedArgCount /= actualArgCount then
471− pure (Left (FunctionArgumentCountMismatchError expectedArgCount actualArgCount))
458+ dbErr (FunctionArgumentCountMismatchError expectedArgCount actualArgCount)
472 else
459 else
473 --check that the atom types are valid
460 --check that the atom types are valid
474− case lefts eAtomTypes of
461+ case eAtomTypes of
475− _:_ -> pure (Left (someErrors (lefts eAtomTypes)))
462+ Left err -> dbErr err
476− [] -> do
463+ Right atomTypes -> do
477− let atomTypes = rights eAtomTypes
464+ let mValidTypes = zipWith (\ expType actType
478− let mValidTypes = map (\(expType, actType) -> case atomTypeVerify expType actType of
465+ -> case atomTypeVerify expType actType of
479− Left err -> Just err
466+ Left err -> Just err
467+ Right _ -> Nothing)
480− Right _ -> Nothing) (zip (dbcFuncType func) atomTypes)
468+ (dbcFuncType func) atomTypes
481− typeErrors = catMaybes mValidTypes
469+ typeErrors = catMaybes mValidTypes
482− eAtomArgs = map (\arg -> runReader (evalAtomExpr emptyTuple arg) relExprState) atomArgExprs
470+ eAtomArgs = map (runGraphRefRelationalExprM gfEnv . evalGraphRefAtomExpr emptyTuple) atomArgExprs
483 if length (lefts eAtomArgs) > 1 then
471 if length (lefts eAtomArgs) > 1 then
484− pure (Left (someErrors (lefts eAtomArgs)))
472+ dbErr (someErrors (lefts eAtomArgs))
485 else if not (null typeErrors) then
473 else if not (null typeErrors) then
486− pure (Left (someErrors typeErrors))
474+ dbErr (someErrors typeErrors)
487 else
475 else
488 case evalDatabaseContextFunction func (rights eAtomArgs) context of
476 case evalDatabaseContextFunction func (rights eAtomArgs) context of
489− Left err -> pure (Left err)
477+ Left err -> dbErr err
490− Right newContext -> putStateContext newContext >> pure (Right ())
478+ Right newContext -> putStateContext newContext
491−
479+data DatabaseContextIOEvalEnv = DatabaseContextIOEvalEnv
492−evalDatabaseContextIOExpr :: Maybe ScriptSession -> DatabaseContext -> DatabaseContextIOExpr -> IO (Either RelationalError DatabaseContext)
480+ { dbcio_transId :: TransactionId,
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
493−evalDatabaseContextIOExpr mScriptSession currentContext (AddAtomFunction funcName funcType script) =
523+evalGraphRefDatabaseContextIOExpr (AddAtomFunction funcName funcType script) = do
494− case mScriptSession of
524+ eScriptSession <- requireScriptSession
495− Nothing -> pure (Left (ScriptError ScriptCompilationDisabledError))
525+ currentContext <- getDBCIOContext
526+ case eScriptSession of
527+ Left err -> pure (Left err)
496− Just scriptSession -> do
528+ Right scriptSession -> do
497− res <- try $ runGhc (Just libdir) $ do
529+ res <- liftIO $ try $ runGhc (Just libdir) $ do
498 setSession (hscEnv scriptSession)
530 setSession (hscEnv scriptSession)
499 let atomFuncs = atomFunctions currentContext
531 let atomFuncs = atomFunctions currentContext
500 case extractAtomFunctionType funcType of
532 case extractAtomFunctionType funcType of
@@ -505,7 +537,7 @@ evalDatabaseContextIOExpr mScriptSession currentContext (AddAtomFunction funcNam
505 pure $ case eCompiledFunc of
537 pure $ case eCompiledFunc of
506 Left err -> Left (ScriptError err)
538 Left err -> Left (ScriptError err)
507 Right compiledFunc -> do
539 Right compiledFunc -> do
508− funcAtomType <- mapM (\funcTypeArg -> atomTypeForTypeConstructor funcTypeArg (typeConstructorMapping currentContext) M.empty) adjustedAtomTypeCons
540+ funcAtomType <- mapM (\funcTypeArg -> atomTypeForTypeConstructorValidate False funcTypeArg (typeConstructorMapping currentContext) M.empty) adjustedAtomTypeCons
509 let updatedFuncs = HS.insert newAtomFunc atomFuncs
541 let updatedFuncs = HS.insert newAtomFunc atomFuncs
510 newContext = currentContext { atomFunctions = updatedFuncs }
542 newContext = currentContext { atomFunctions = updatedFuncs }
511 newAtomFunc = AtomFunction { atomFuncName = funcName,
543 newAtomFunc = AtomFunction { atomFuncName = funcName,
@@ -520,12 +552,13 @@ evalDatabaseContextIOExpr mScriptSession currentContext (AddAtomFunction funcNam
520 Left (exc :: SomeException) -> pure $ Left (ScriptError (OtherScriptCompilationError (show exc)))
552 Left (exc :: SomeException) -> pure $ Left (ScriptError (OtherScriptCompilationError (show exc)))
521 Right eContext -> case eContext of
553 Right eContext -> case eContext of
522 Left err -> pure (Left err)
554 Left err -> pure (Left err)
523− Right context' -> pure (Right context')
555+ Right context' -> putDBCIOContext context'
524−
525−evalDatabaseContextIOExpr mScriptSession currentContext (AddDatabaseContextFunction funcName funcType script) =
556+evalGraphRefDatabaseContextIOExpr (AddDatabaseContextFunction funcName funcType script) = do
526− case mScriptSession of
557+ eScriptSession <- requireScriptSession
527− Nothing -> pure (Left (ScriptError ScriptCompilationDisabledError))
558+ currentContext <- getDBCIOContext
559+ case eScriptSession of
560+ Left err -> pure (Left err)
528− Just scriptSession -> do
561+ Right scriptSession -> do
529 --validate that the function signature is of the form x -> y -> ... -> DatabaseContext -> DatabaseContext
562 --validate that the function signature is of the form x -> y -> ... -> DatabaseContext -> DatabaseContext
530 let last2Args = reverse (take 2 (reverse funcType))
563 let last2Args = reverse (take 2 (reverse funcType))
531 atomArgs = take (length funcType - 2) funcType
564 atomArgs = take (length funcType - 2) funcType
@@ -535,7 +568,7 @@ evalDatabaseContextIOExpr mScriptSession currentContext (AddDatabaseContextFunct
535 if last2Args /= [ADTypeConstructor "DatabaseContext" [], dbContextTypeCons] then
568 if last2Args /= [ADTypeConstructor "DatabaseContext" [], dbContextTypeCons] then
536 pure (Left (ScriptError (TypeCheckCompilationError expectedType actualType)))
569 pure (Left (ScriptError (TypeCheckCompilationError expectedType actualType)))
537 else do
570 else do
538− res <- try $ runGhc (Just libdir) $ do
571+ res <- liftIO $ try $ runGhc (Just libdir) $ do
539 setSession (hscEnv scriptSession)
572 setSession (hscEnv scriptSession)
540 eCompiledFunc <- compileScript (dbcFunctionBodyType scriptSession) script
573 eCompiledFunc <- compileScript (dbcFunctionBodyType scriptSession) script
541 pure $ case eCompiledFunc of
574 pure $ case eCompiledFunc of
@@ -560,47 +593,86 @@ evalDatabaseContextIOExpr mScriptSession currentContext (AddDatabaseContextFunct
560 Left (exc :: SomeException) -> pure $ Left (ScriptError (OtherScriptCompilationError (show exc)))
593 Left (exc :: SomeException) -> pure $ Left (ScriptError (OtherScriptCompilationError (show exc)))
561 Right eContext -> case eContext of
594 Right eContext -> case eContext of
562 Left err -> pure (Left err)
595 Left err -> pure (Left err)
563− Right context' -> pure (Right context')
596+ Right context' -> putDBCIOContext context'
564−evalDatabaseContextIOExpr _ currentContext (LoadAtomFunctions modName funcName modPath) = do
597+evalGraphRefDatabaseContextIOExpr (LoadAtomFunctions modName funcName modPath) = do
598+ currentContext <- getDBCIOContext
565− eLoadFunc <- loadAtomFunctions (T.unpack modName) (T.unpack funcName) modPath
599+ eLoadFunc <- liftIO $ loadAtomFunctions (T.unpack modName) (T.unpack funcName) modPath
566 case eLoadFunc of
600 case eLoadFunc of
567 Left LoadSymbolError -> pure (Left LoadFunctionError)
601 Left LoadSymbolError -> pure (Left LoadFunctionError)
568 Right atomFunctionListFunc -> let newContext = currentContext { atomFunctions = mergedFuncs }
602 Right atomFunctionListFunc -> let newContext = currentContext { atomFunctions = mergedFuncs }
569 mergedFuncs = HS.union (atomFunctions currentContext) (HS.fromList atomFunctionListFunc)
603 mergedFuncs = HS.union (atomFunctions currentContext) (HS.fromList atomFunctionListFunc)
570− in pure (Right newContext)
604+ in putDBCIOContext newContext
571−evalDatabaseContextIOExpr _ currentContext (LoadDatabaseContextFunctions modName funcName modPath) = do
605+evalGraphRefDatabaseContextIOExpr (LoadDatabaseContextFunctions modName funcName modPath) = do
606+ currentContext <- getDBCIOContext
572− eLoadFunc <- loadDatabaseContextFunctions (T.unpack modName) (T.unpack funcName) modPath
607+ eLoadFunc <- liftIO $ loadDatabaseContextFunctions (T.unpack modName) (T.unpack funcName) modPath
573 case eLoadFunc of
608 case eLoadFunc of
574 Left LoadSymbolError -> pure (Left LoadFunctionError)
609 Left LoadSymbolError -> pure (Left LoadFunctionError)
575 Right dbcListFunc -> let newContext = currentContext { dbcFunctions = mergedFuncs }
610 Right dbcListFunc -> let newContext = currentContext { dbcFunctions = mergedFuncs }
576 mergedFuncs = HS.union (dbcFunctions currentContext) (HS.fromList dbcListFunc)
611 mergedFuncs = HS.union (dbcFunctions currentContext) (HS.fromList dbcListFunc)
577− in pure (Right newContext)
612+ in putDBCIOContext newContext
578−
613+#endif
579−updateTupleWithAtomExprs :: M.Map AttributeName AtomExpr -> DatabaseContext -> RelationTuple -> Either RelationalError RelationTuple
614+evalGraphRefDatabaseContextIOExpr (CreateArbitraryRelation relVarName attrExprs range) = do
580−updateTupleWithAtomExprs exprMap context tupIn = do
615+ --Define
581− --resolve all atom exprs
616+ currentContext <- getDBCIOContext
582− atomsAssoc <- mapM (\(attrName, atomExpr) -> do
617+ env <- RWS.ask
583− atom <- runReader (evalAtomExpr tupIn atomExpr) (RelationalExprStateElems context)
618+ --create graph ref expr
584− pure (attrName, atom)
619+ let gfExpr = Define relVarName attrExprs
585− ) (M.toList exprMap)
620+ evalEnv = mkDatabaseContextEvalEnv (dbcio_transId env) (dbcio_graph env)
586− pure (updateTupleWithAtoms (M.fromList atomsAssoc) tupIn)
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')
587
644
588--run verification on all constraints
645--run verification on all constraints
589−checkConstraints :: DatabaseContext -> Either RelationalError ()
646+checkConstraints :: DatabaseContext -> TransactionId -> TransactionGraph -> Either RelationalError ()
590−checkConstraints context = do
647+checkConstraints context transId graph@(TransactionGraph graphHeads transSet) = do
591 mapM_ (uncurry checkIncDep) (M.toList deps)
648 mapM_ (uncurry checkIncDep) (M.toList deps)
592− pure ()
593 where
649 where
650+ potentialGraph = TransactionGraph graphHeads (S.insert tempTrans transSet)
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+
594 deps = inclusionDependencies context
660 deps = inclusionDependencies context
595− eval expr = evalReader (evalRelationalExpr expr)
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
596− evalReader f = runReader f (RelationalExprStateElems context)
597 checkIncDep depName (InclusionDependency subsetExpr supersetExpr) = do
662 checkIncDep depName (InclusionDependency subsetExpr supersetExpr) = do
663+ let process = runProcessExprM UncommittedContextMarker
664+ gfSubsetExpr = process (processRelationalExpr subsetExpr)
665+ gfSupersetExpr = process (processRelationalExpr supersetExpr)
598 --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.
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.
599− typeSub <- evalReader (typeForRelationalExpr subsetExpr)
667+ let gfEnv = freshGraphRefRelationalExprEnv (Just context) graph
600− typeSuper <- evalReader (typeForRelationalExpr supersetExpr)
668+ runGfRel = runGraphRefRelationalExprM gfEnv
669+ typeSub <- runGfRel (typeForGraphRefRelationalExpr gfSubsetExpr)
670+ typeSuper <- runGfRel (typeForGraphRefRelationalExpr gfSupersetExpr)
601 when (typeSub /= typeSuper) (Left (RelationTypeMismatchError (attributes typeSub) (attributes typeSuper)))
671 when (typeSub /= typeSuper) (Left (RelationTypeMismatchError (attributes typeSub) (attributes typeSuper)))
602− let checkExpr = Equals supersetExpr (Union subsetExpr supersetExpr)
672+ let checkExpr = Equals gfSupersetExpr (Union gfSubsetExpr gfSupersetExpr)
603− case eval checkExpr of
673+ gfEvald = runGraphRefRelationalExprM gfEnv' (evalGraphRefRelationalExpr checkExpr)
674+ gfEnv' = freshGraphRefRelationalExprEnv (Just context) potentialGraph
675+ case gfEvald of
604 Left err -> Left err
676 Left err -> Left err
605 Right resultRel -> if resultRel == relationTrue then
677 Right resultRel -> if resultRel == relationTrue then
606 pure ()
678 pure ()
@@ -610,88 +682,81 @@ checkConstraints context = do
610-- 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
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
611-- furthermore, the type of a relational expression is the resultant header of the evaluated empty-tupled relation
683-- furthermore, the type of a relational expression is the resultant header of the evaluated empty-tupled relation
612
684
613−typeForRelationalExpr :: RelationalExpr -> RelationalExprState (Either RelationalError Relation)
685+typeForRelationalExpr :: RelationalExpr -> RelationalExprM Relation
614typeForRelationalExpr expr = do
686typeForRelationalExpr expr = do
615− rstate <- ask
616− let context = stateElemsContext rstate
617 --replace the relationVariables context element with a cloned set of relation devoid of tuples
687 --replace the relationVariables context element with a cloned set of relation devoid of tuples
618− let context' = contextWithEmptyTupleSets context
688+ --evalRelationalExpr could still return an existing relation with tuples, so strip them
619− rstate' = setStateElemsContext rstate context'
689+ graph <- reGraph
620− pure (runReader (evalRelationalExpr expr) rstate')
690+ context <- reContext
621−
691+ let gfExpr = runProcessExprM UncommittedContextMarker (processRelationalExpr expr)
622−--returns a database context with all tuples removed
692+ gfEnv = freshGraphRefRelationalExprEnv (Just context) graph
623−--this is useful for type checking and optimization
693+ runGf = runGraphRefRelationalExprM gfEnv (typeForGraphRefRelationalExpr gfExpr)
624−contextWithEmptyTupleSets :: DatabaseContext -> DatabaseContext
694+ lift $ except runGf
625−contextWithEmptyTupleSets contextIn = contextIn { relationVariables = relVars }
626− where
627− relVars = M.map (\rel -> Relation (attributes rel) emptyTupleSet) (relationVariables contextIn)
628
695
629liftE :: (Monad m) => m (Either a b) -> ExceptT a m b
696liftE :: (Monad m) => m (Either a b) -> ExceptT a m b
630liftE v = do
697liftE v = do
631 y <- lift v
698 y <- lift v
632 case y of
699 case y of
633− Left err -> throwE err
700+ Left err -> throwError err
634 Right val -> pure val
701 Right val -> pure val
635
702
636{- used for restrictions- take the restrictionpredicate and return the corresponding filter function -}
703{- used for restrictions- take the restrictionpredicate and return the corresponding filter function -}
637−predicateRestrictionFilter :: Attributes -> RestrictionPredicateExpr -> RelationalExprState (Either RelationalError RestrictionFilter)
704+predicateRestrictionFilter :: Attributes -> GraphRefRestrictionPredicateExpr -> GraphRefRelationalExprM RestrictionFilter
638−predicateRestrictionFilter attrs (AndPredicate expr1 expr2) =
705+predicateRestrictionFilter attrs (AndPredicate expr1 expr2) = do
639− runExceptT $ do
640− expr1v <- liftE (predicateRestrictionFilter attrs expr1)
706+ expr1v <- predicateRestrictionFilter attrs expr1
641− expr2v <- liftE (predicateRestrictionFilter attrs expr2)
707+ expr2v <- predicateRestrictionFilter attrs expr2
642− pure (\x -> do
708+ pure (\x -> do
643− ev1 <- expr1v x
709+ ev1 <- expr1v x
644− ev2 <- expr2v x
710+ ev2 <- expr2v x
645− pure (ev1 && ev2))
711+ pure (ev1 && ev2))
646
712
647−predicateRestrictionFilter attrs (OrPredicate expr1 expr2) =
713+predicateRestrictionFilter attrs (OrPredicate expr1 expr2) = do
648− runExceptT $ do
649− expr1v <- liftE (predicateRestrictionFilter attrs expr1)
714+ expr1v <- predicateRestrictionFilter attrs expr1
650− expr2v <- liftE (predicateRestrictionFilter attrs expr2)
715+ expr2v <- predicateRestrictionFilter attrs expr2
651 pure (\x -> do
716 pure (\x -> do
652 ev1 <- expr1v x
717 ev1 <- expr1v x
653 ev2 <- expr2v x
718 ev2 <- expr2v x
654 pure (ev1 || ev2))
719 pure (ev1 || ev2))
655
720
656−predicateRestrictionFilter _ TruePredicate = pure (Right (\_ -> pure True))
721+predicateRestrictionFilter _ TruePredicate = pure (\_ -> pure True)
657
722
658−predicateRestrictionFilter attrs (NotPredicate expr) =
723+predicateRestrictionFilter attrs (NotPredicate expr) = do
659− runExceptT $ do
660− exprv <- liftE (predicateRestrictionFilter attrs expr)
724+ exprv <- predicateRestrictionFilter attrs expr
661− pure (fmap not . exprv)
725+ pure (fmap not . exprv)
662
726
663--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
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
664predicateRestrictionFilter _ (RelationalExprPredicate relExpr) = do
728predicateRestrictionFilter _ (RelationalExprPredicate relExpr) = do
665− rstate <- ask
729+ renv <- askEnv
666− pure (Right (\tup -> case runReader (evalRelationalExpr relExpr) (mergeTuplesIntoRelationalExprState tup rstate) of
730+ let eval :: RelationTuple -> Either RelationalError Relation
731+ eval tup =
732+ let gfEnv = mergeTuplesIntoGraphRefRelationalExprEnv tup renv in
733+ runGraphRefRelationalExprM gfEnv (evalGraphRefRelationalExpr relExpr)
734+ pure (\tup -> case eval tup of
667 Left err -> Left err
735 Left err -> Left err
668 Right rel -> if arity rel /= 0 then
736 Right rel -> if arity rel /= 0 then
669 Left (PredicateExpressionError "Relational restriction filter must evaluate to 'true' or 'false'")
737 Left (PredicateExpressionError "Relational restriction filter must evaluate to 'true' or 'false'")
670 else
738 else
671− pure (rel == relationTrue)))
739+ pure (rel == relationTrue))
672
740
673predicateRestrictionFilter attrs (AttributeEqualityPredicate attrName atomExpr) = do
741predicateRestrictionFilter attrs (AttributeEqualityPredicate attrName atomExpr) = do
674− rstate <- ask
742+ env <- askEnv
675− let (attrs', ctxtup') = case rstate of
743+ let attrs' = A.union attrs (envAttributes env)
676− RelationalExprStateElems _ -> (attrs, emptyTuple)
744+ ctxtup' = envTuple env
677− RelationalExprStateAttrsElems _ _ -> (attrs, emptyTuple)
678− RelationalExprStateTupleElems _ ctxtup -> (A.union attrs (tupleAttributes ctxtup), ctxtup)
679− runExceptT $ do
680− atomExprType <- liftE (typeFromAtomExpr attrs' atomExpr)
745+ atomExprType <- typeForGraphRefAtomExpr attrs' atomExpr
681− attr <- either throwE pure $ case A.attributeForName attrName attrs of
746+ attr <- lift $ except $ case A.attributeForName attrName attrs of
682 Right attr -> Right attr
747 Right attr -> Right attr
683 Left (NoSuchAttributeNamesError _) -> case A.attributeForName attrName (tupleAttributes ctxtup') of
748 Left (NoSuchAttributeNamesError _) -> case A.attributeForName attrName (tupleAttributes ctxtup') of
684 Right ctxattr -> Right ctxattr
749 Right ctxattr -> Right ctxattr
685 Left err2@(NoSuchAttributeNamesError _) -> Left err2
750 Left err2@(NoSuchAttributeNamesError _) -> Left err2
686 Left err -> Left err
751 Left err -> Left err
687 Left err -> Left err
752 Left err -> Left err
688− if atomExprType /= A.atomType attr then
753+ if atomExprType /= A.atomType attr then
689− throwE (TupleAttributeTypeMismatchError (A.attributesFromList [attr]))
754+ throwError (TupleAttributeTypeMismatchError (A.attributesFromList [attr]))
690− else
755+ else
691 pure $ \tupleIn -> let evalAndCmp atomIn = case atomEvald of
756 pure $ \tupleIn -> let evalAndCmp atomIn = case atomEvald of
692 Right atomCmp -> atomCmp == atomIn
757 Right atomCmp -> atomCmp == atomIn
693 Left _ -> False
758 Left _ -> False
694− atomEvald = runReader (evalAtomExpr tupleIn atomExpr) rstate
759+ atomEvald = runGraphRefRelationalExprM env (evalGraphRefAtomExpr tupleIn atomExpr)
695 in
760 in
696 pure $ case atomForAttributeName attrName tupleIn of
761 pure $ case atomForAttributeName attrName tupleIn of
697 Left (NoSuchAttributeNamesError _) -> case atomForAttributeName attrName ctxtup' of
762 Left (NoSuchAttributeNamesError _) -> case atomForAttributeName attrName ctxtup' of
@@ -702,243 +767,626 @@ predicateRestrictionFilter attrs (AttributeEqualityPredicate attrName atomExpr)
702-- in the future, it would be useful to do typechecking on the attribute and atom expr filters in advance
767-- in the future, it would be useful to do typechecking on the attribute and atom expr filters in advance
703predicateRestrictionFilter attrs (AtomExprPredicate atomExpr) = do
768predicateRestrictionFilter attrs (AtomExprPredicate atomExpr) = do
704 --merge attrs into the state attributes
769 --merge attrs into the state attributes
705− rstate <- ask
770+ renv <- askEnv
706− runExceptT $ do
707− aType <- liftE (typeFromAtomExpr attrs atomExpr)
771+ aType <- typeForGraphRefAtomExpr attrs atomExpr
708− if aType /= BoolAtomType then
772+ if aType /= BoolAtomType then
709− throwE (AtomTypeMismatchError aType BoolAtomType)
773+ throwError (AtomTypeMismatchError aType BoolAtomType)
710− else
774+ else
711 pure (\tupleIn ->
775 pure (\tupleIn ->
712− pure $ case runReader (evalAtomExpr tupleIn atomExpr) rstate of
776+ case runGraphRefRelationalExprM renv (evalGraphRefAtomExpr tupleIn atomExpr) of
713− Left _ -> False
777+ Left err -> Left err
714− Right boolAtomValue -> boolAtomValue == BoolAtom True)
778+ Right boolAtomValue -> pure (boolAtomValue == BoolAtom True))
715
779
716tupleExprCheckNewAttrName :: AttributeName -> Relation -> Either RelationalError Relation
780tupleExprCheckNewAttrName :: AttributeName -> Relation -> Either RelationalError Relation
717tupleExprCheckNewAttrName attrName rel = if isRight (attributeForName attrName rel) then
781tupleExprCheckNewAttrName attrName rel = if isRight (attributeForName attrName rel) then
718− Left (error "SPAMMIT" $ AttributeNameInUseError attrName)
782+ Left (AttributeNameInUseError attrName)
719 else
783 else
720 Right rel
784 Right rel
721
785
722−extendTupleExpressionProcessor :: Relation -> ExtendTupleExpr -> RelationalExprState (Either RelationalError (Attributes, RelationTuple -> Either RelationalError RelationTuple))
786+extendGraphRefTupleExpressionProcessor :: Relation -> GraphRefExtendTupleExpr -> GraphRefRelationalExprM (Attributes, RelationTuple -> Either RelationalError RelationTuple)
723−extendTupleExpressionProcessor relIn (AttributeExtendTupleExpr newAttrName atomExpr) = do
787+extendGraphRefTupleExpressionProcessor relIn (AttributeExtendTupleExpr newAttrName atomExpr) =
724− rstate <- ask
788+-- renv <- askEnv
725 -- check that the attribute name is not in use
789 -- check that the attribute name is not in use
726 case tupleExprCheckNewAttrName newAttrName relIn of
790 case tupleExprCheckNewAttrName newAttrName relIn of
727− Left err -> pure (Left err)
791+ Left err -> throwError err
728− Right _ -> runExceptT $ do
792+ Right _ -> do
729− atomExprType <- liftE (typeFromAtomExpr (attributes relIn) atomExpr)
793+ atomExprType <- typeForGraphRefAtomExpr (attributes relIn) atomExpr
730− atomExprType' <- liftE (verifyAtomExprTypes relIn atomExpr atomExprType)
794+ atomExprType' <- verifyGraphRefAtomExprTypes relIn atomExpr atomExprType
731 let newAttrs = A.attributesFromList [Attribute newAttrName atomExprType']
795 let newAttrs = A.attributesFromList [Attribute newAttrName atomExprType']
732 newAndOldAttrs = A.addAttributes (attributes relIn) newAttrs
796 newAndOldAttrs = A.addAttributes (attributes relIn) newAttrs
733− pure (newAndOldAttrs, \tup -> let substate = mergeTuplesIntoRelationalExprState tup rstate in case runReader (evalAtomExpr tup atomExpr) substate of
797+ env <- ask
734− Left err -> Left err
798+ pure (newAndOldAttrs, \tup -> do
799+ let gfEnv = mergeTuplesIntoGraphRefRelationalExprEnv tup env
800+ atom <- runGraphRefRelationalExprM gfEnv (evalGraphRefAtomExpr tup atomExpr)
735− Right atom -> Right (tupleAtomExtend newAttrName atom tup)
801+ Right (tupleAtomExtend newAttrName atom tup)
736 )
802 )
737
803
738−evalAtomExpr :: RelationTuple -> AtomExpr -> RelationalExprState (Either RelationalError Atom)
804+evalGraphRefAtomExpr :: RelationTuple -> GraphRefAtomExpr -> GraphRefRelationalExprM Atom
805+evalGraphRefAtomExpr tupIn (AttributeAtomExpr attrName) =
739−evalAtomExpr tupIn (AttributeAtomExpr attrName) = case atomForAttributeName attrName tupIn of
806+ case atomForAttributeName attrName tupIn of
740− Right atom -> pure (Right atom)
807+ Right atom -> pure atom
741− err@(Left (NoSuchAttributeNamesError _)) -> do
808+ Left err@(NoSuchAttributeNamesError _) -> do
742− rstate <- ask
809+ env <- askEnv
743− case rstate of
810+ case gre_extra env of
744− RelationalExprStateElems _ -> pure err
811+ Nothing -> throwError err
745− RelationalExprStateAttrsElems _ _ -> pure err
746− RelationalExprStateTupleElems _ ctxtup -> pure (atomForAttributeName attrName ctxtup)
812+ Just (Left ctxtup) -> lift $ except $ atomForAttributeName attrName ctxtup
813+ Just (Right _) -> throwError err
747− Left err -> pure (Left err)
814+ Left err -> throwError err
748−evalAtomExpr _ (NakedAtomExpr atom) = pure (Right atom)
815+evalGraphRefAtomExpr _ (NakedAtomExpr atom) = pure atom
749−evalAtomExpr tupIn (FunctionAtomExpr funcName arguments ()) = do
816+evalGraphRefAtomExpr tupIn (FunctionAtomExpr funcName arguments tid) = do
750− argTypes <- mapM (typeFromAtomExpr (tupleAttributes tupIn)) arguments
817+ argTypes <- mapM (typeForGraphRefAtomExpr (tupleAttributes tupIn)) arguments
751− context <- fmap stateElemsContext ask
818+ context <- gfDatabaseContextForMarker tid
752− runExceptT $ do
753− let functions = atomFunctions context
819+ let functions = atomFunctions context
754− func <- either throwE pure (atomFunctionForName funcName functions)
820+ func <- lift $ except (atomFunctionForName funcName functions)
755− let expectedArgCount = length (atomFuncType func) - 1
821+ let expectedArgCount = length (atomFuncType func) - 1
756− actualArgCount = length argTypes
822+ actualArgCount = length argTypes
757− safeInit [_] = []
758− safeInit [] = [] -- different behavior from normal init
823+ safeInit [] = [] -- different behavior from normal init
759− safeInit (_:xs) = safeInit xs
824+ safeInit xs = init xs
760− if expectedArgCount /= actualArgCount then
825+ if expectedArgCount /= actualArgCount then
761− throwE (FunctionArgumentCountMismatchError expectedArgCount actualArgCount)
826+ throwError (FunctionArgumentCountMismatchError expectedArgCount actualArgCount)
762− else do
827+ else do
763− mapM_ (\(expType, actType) -> either throwE pure (atomTypeVerify expType actType)) (safeInit (zip (atomFuncType func) argTypes))
828+ let zippedArgs = zip (safeInit (atomFuncType func)) argTypes
829+ mapM_ (\(expType, actType) ->
830+ lift $ except (atomTypeVerify expType actType)) zippedArgs
764− evaldArgs <- mapM (liftE . evalAtomExpr tupIn) arguments
831+ evaldArgs <- mapM (evalGraphRefAtomExpr tupIn) arguments
765 case evalAtomFunction func evaldArgs of
832 case evalAtomFunction func evaldArgs of
766− Left err -> throwE (AtomFunctionUserError err)
833+ Left err -> throwError (AtomFunctionUserError err)
767 Right result -> do
834 Right result -> do
768 --validate that the result matches the expected type
835 --validate that the result matches the expected type
769− _ <- either throwE pure (atomTypeVerify (last (atomFuncType func)) (atomTypeForAtom result))
836+ _ <- lift $ except (atomTypeVerify (last (atomFuncType func)) (atomTypeForAtom result))
770 pure result
837 pure result
771−evalAtomExpr tupIn (RelationAtomExpr relExpr) = do
838+evalGraphRefAtomExpr tupIn (RelationAtomExpr relExpr) = do
772 --merge existing state tuple context into new state tuple context to support an arbitrary number of levels, but new attributes trounce old attributes
839 --merge existing state tuple context into new state tuple context to support an arbitrary number of levels, but new attributes trounce old attributes
773− rstate <- ask
840+ env <- ask
774− runExceptT $ do
841+ let gfEnv = mergeTuplesIntoGraphRefRelationalExprEnv tupIn env
775− let newState = mergeTuplesIntoRelationalExprState tupIn rstate
842+ relAtom <- lift $ except $ runGraphRefRelationalExprM gfEnv (evalGraphRefRelationalExpr relExpr)
776− relAtom <- either throwE pure (runReader (evalRelationalExpr relExpr) newState)
777− pure (RelationAtom relAtom)
843+ pure (RelationAtom relAtom)
778−evalAtomExpr tupIn cons@(ConstructedAtomExpr dConsName dConsArgs ()) = runExceptT $ do
844+evalGraphRefAtomExpr tupIn cons@(ConstructedAtomExpr dConsName dConsArgs _) = do --why is the tid unused here? suspicious
779− rstate <- lift ask
845+ let mergeEnv = mergeTuplesIntoGraphRefRelationalExprEnv tupIn
780− let newState = mergeTuplesIntoRelationalExprState tupIn rstate
781− aType <- either throwE pure (runReader (typeFromAtomExpr (tupleAttributes tupIn) cons) newState)
846+ aType <- local mergeEnv (typeForGraphRefAtomExpr (tupleAttributes tupIn) cons)
782− argAtoms <- mapM (\arg -> either throwE pure (runReader (evalAtomExpr tupIn arg) newState)) dConsArgs
847+ argAtoms <- local mergeEnv $
848+ mapM (evalGraphRefAtomExpr tupIn) dConsArgs
783 pure (ConstructedAtom dConsName aType argAtoms)
849 pure (ConstructedAtom dConsName aType argAtoms)
784
850
785−typeFromAtomExpr :: Attributes -> AtomExpr -> RelationalExprState (Either RelationalError AtomType)
851+typeForGraphRefAtomExpr :: Attributes -> GraphRefAtomExpr -> GraphRefRelationalExprM AtomType
786−typeFromAtomExpr attrs (AttributeAtomExpr attrName) = do
852+typeForGraphRefAtomExpr attrs (AttributeAtomExpr attrName) = do
787− rstate <- ask
853+ renv <- askEnv
788 case A.atomTypeForAttributeName attrName attrs of
854 case A.atomTypeForAttributeName attrName attrs of
789− Right aType -> pure (Right aType)
855+ Right aType -> pure aType
790− Left err@(NoSuchAttributeNamesError _) -> case rstate of
856+ Left err@(NoSuchAttributeNamesError _) ->
857+ let envTup = envTuple renv
858+ envAttrs = envAttributes renv in
791− RelationalExprStateAttrsElems _ attrs' -> case A.attributeForName attrName attrs' of
859+ case A.attributeForName attrName envAttrs of
792− Left err' -> pure (Left err')
793− Right attr -> pure (Right (A.atomType attr))
860+ Right attr -> pure (A.atomType attr)
794− RelationalExprStateElems _ -> pure (Left err)
795− RelationalExprStateTupleElems _ tup -> case atomForAttributeName attrName tup of
861+ Left _ -> case atomForAttributeName attrName envTup of
796− Left err' -> pure (Left err')
862+ Right atom -> pure (atomTypeForAtom atom)
797− Right atom -> pure (Right (atomTypeForAtom atom))
863+ Left _ -> --throwError (traceStack (show ("typeForGRAtomExpr", attrs, envTup)) err)
864+ throwError err
798− Left err -> pure (Left err)
865+ Left err -> throwError err
866+
799−typeFromAtomExpr _ (NakedAtomExpr atom) = pure (Right (atomTypeForAtom atom))
867+typeForGraphRefAtomExpr _ (NakedAtomExpr atom) = pure (atomTypeForAtom atom)
800−typeFromAtomExpr attrs (FunctionAtomExpr funcName atomArgs _) = do
868+typeForGraphRefAtomExpr attrs (FunctionAtomExpr funcName atomArgs transId) = do
801− context <- fmap stateElemsContext ask
869+ funcs <- atomFunctions <$> gfDatabaseContextForMarker transId
802− let funcs = atomFunctions context
803 case atomFunctionForName funcName funcs of
870 case atomFunctionForName funcName funcs of
804− Left err -> pure (Left err)
871+ Left err -> throwError err
805 Right func -> do
872 Right func -> do
806 let funcRetType = last (atomFuncType func)
873 let funcRetType = last (atomFuncType func)
807 funcArgTypes = init (atomFuncType func)
874 funcArgTypes = init (atomFuncType func)
808− eArgTypes <- mapM (typeFromAtomExpr attrs) atomArgs
875+ argTypes <- mapM (typeForGraphRefAtomExpr attrs) atomArgs
809− case lefts eArgTypes of
810− errs@(_:_) -> pure (Left (someErrors errs))
811− [] -> do
812− let eTvMap = resolveTypeVariables funcArgTypes argTypes
876+ let eTvMap = resolveTypeVariables funcArgTypes argTypes
813− argTypes = rights eArgTypes
814− case eTvMap of
877+ case eTvMap of
815− Left err -> pure (Left err)
878+ Left err -> throwError err
816− Right tvMap -> pure (resolveFunctionReturnValue funcName tvMap funcRetType)
879+ Right tvMap -> lift $ except $ resolveFunctionReturnValue funcName tvMap funcRetType
817−typeFromAtomExpr attrs (RelationAtomExpr relExpr) = runExceptT $ do
880+typeForGraphRefAtomExpr attrs (RelationAtomExpr relExpr) = do
818− rstate <- lift ask
881+ relType <- R.local (mergeAttributesIntoGraphRefRelationalExprEnv attrs) (typeForGraphRefRelationalExpr relExpr)
819− relType <- either throwE pure (runReader (typeForRelationalExpr relExpr) (mergeAttributesIntoRelationalExprState attrs rstate))
820 pure (RelationAtomType (attributes relType))
882 pure (RelationAtomType (attributes relType))
821-- grab the type of the data constructor, then validate that the args match the expected types
883-- grab the type of the data constructor, then validate that the args match the expected types
822−typeFromAtomExpr attrs (ConstructedAtomExpr dConsName dConsArgs _) =
884+typeForGraphRefAtomExpr attrs (ConstructedAtomExpr dConsName dConsArgs tid) =
823− runExceptT $ do
885+ do
824− argsTypes <- mapM (liftE . typeFromAtomExpr attrs) dConsArgs
886+ argsTypes <- mapM (typeForGraphRefAtomExpr attrs) dConsArgs
825− context <- fmap stateElemsContext (lift ask)
887+ tConsMap <- typeConstructorMapping <$> gfDatabaseContextForMarker tid
826− either throwE pure (atomTypeForDataConstructor (typeConstructorMapping context) dConsName argsTypes)
888+ lift $ except $ atomTypeForDataConstructor tConsMap dConsName argsTypes
827
889
828-- | Validate that the type of the AtomExpr matches the expected type.
890-- | Validate that the type of the AtomExpr matches the expected type.
829−verifyAtomExprTypes :: Relation -> AtomExpr -> AtomType -> RelationalExprState (Either RelationalError AtomType)
891+verifyGraphRefAtomExprTypes :: Relation -> GraphRefAtomExpr -> AtomType -> GraphRefRelationalExprM AtomType
830−verifyAtomExprTypes relIn (AttributeAtomExpr attrName) expectedType = runExceptT $ do
892+verifyGraphRefAtomExprTypes relIn (AttributeAtomExpr attrName) expectedType = do
831− rstate <- lift ask
893+ env <- askEnv
832 case A.atomTypeForAttributeName attrName (attributes relIn) of
894 case A.atomTypeForAttributeName attrName (attributes relIn) of
833− Right aType -> either throwE pure (atomTypeVerify expectedType aType)
895+ Right aType -> lift $ except $ atomTypeVerify expectedType aType
834− (Left err@(NoSuchAttributeNamesError _)) -> case rstate of
896+ (Left err@(NoSuchAttributeNamesError _)) ->
835− RelationalExprStateTupleElems _ _ -> throwE err
897+ let attrs' = envAttributes env in
836− RelationalExprStateElems _ -> throwE err
898+ if attrs' == emptyAttributes then
899+ throwError err
900+ else
837− RelationalExprStateAttrsElems _ attrs -> case A.attributeForName attrName attrs of
901+ case A.attributeForName attrName attrs' of
838− Left err' -> throwE err'
902+ Left err' -> throwError err'
839− Right attrType -> either throwE pure (atomTypeVerify expectedType (A.atomType attrType))
903+ Right attrType -> lift $ except $ atomTypeVerify expectedType (A.atomType attrType)
840− Left err -> throwE err
904+ Left err -> throwError err
905+
906+verifyGraphRefAtomExprTypes _ (NakedAtomExpr atom) expectedType =
841−verifyAtomExprTypes _ (NakedAtomExpr atom) expectedType = pure (atomTypeVerify expectedType (atomTypeForAtom atom))
907+ lift $ except $ atomTypeVerify expectedType (atomTypeForAtom atom)
842−verifyAtomExprTypes relIn (FunctionAtomExpr funcName funcArgExprs _) expectedType = do
908+verifyGraphRefAtomExprTypes relIn (FunctionAtomExpr funcName funcArgExprs tid) expectedType = do
843− rstate <- ask
909+ context <- gfDatabaseContextForMarker tid
844 let functions = atomFunctions context
910 let functions = atomFunctions context
845− context = stateElemsContext rstate
846− runExceptT $ do
847− func <- either throwE pure (atomFunctionForName funcName functions)
911+ func <- lift $ except $ atomFunctionForName funcName functions
848− let expectedArgTypes = atomFuncType func
912+ let expectedArgTypes = atomFuncType func
849− funcArgTypes <- mapM (\(atomExpr,expectedType2,argCount) -> case runReader (verifyAtomExprTypes relIn atomExpr expectedType2) rstate of
913+ funcArgVerifier (atomExpr, expectedType2, argCount) = do
914+ let handler :: RelationalError -> GraphRefRelationalExprM AtomType
850− Left (AtomTypeMismatchError expSubType actSubType) -> throwE (AtomFunctionTypeError funcName argCount expSubType actSubType)
915+ handler (AtomTypeMismatchError expSubType actSubType) = throwError (AtomFunctionTypeError funcName argCount expSubType actSubType)
851− Left err -> throwE err
916+ handler err = throwError err
852− Right x -> pure x
917+ verifyGraphRefAtomExprTypes relIn atomExpr expectedType2 `catchError` handler
853− ) $ zip3 funcArgExprs expectedArgTypes [1..]
918+ funcArgTypes <- mapM funcArgVerifier $ zip3 funcArgExprs expectedArgTypes [1..]
854− if length funcArgTypes /= length expectedArgTypes - 1 then
919+ if length funcArgTypes /= length expectedArgTypes - 1 then
855− throwE (AtomTypeCountError funcArgTypes expectedArgTypes)
920+ throwError (AtomTypeCountError funcArgTypes expectedArgTypes)
856 else
921 else
857− either throwE pure (atomTypeVerify expectedType (last expectedArgTypes))
922+ lift $ except $ atomTypeVerify expectedType (last expectedArgTypes)
858−verifyAtomExprTypes relIn (RelationAtomExpr relationExpr) expectedType = runExceptT $ do
923+verifyGraphRefAtomExprTypes relIn (RelationAtomExpr relationExpr) expectedType =
859− rstate <- lift ask
924+ do
860− relType <- either throwE pure (runReader (typeForRelationalExpr relationExpr) (mergeAttributesIntoRelationalExprState (attributes relIn) rstate))
925+ let mergedAttrsEnv e = mergeAttributesIntoGraphRefRelationalExprEnv (attributes relIn) e
926+ relType <- R.local mergedAttrsEnv (typeForGraphRefRelationalExpr relationExpr)
861− either throwE pure (atomTypeVerify expectedType (RelationAtomType (attributes relType)))
927+ lift $ except $ atomTypeVerify expectedType (RelationAtomType (attributes relType))
862−verifyAtomExprTypes rel cons@ConstructedAtomExpr{} expectedType = runExceptT $ do
928+verifyGraphRefAtomExprTypes rel cons@ConstructedAtomExpr{} expectedType = do
863− cType <- liftE (typeFromAtomExpr (attributes rel) cons)
929+ cType <- typeForGraphRefAtomExpr (attributes rel) cons
864− either throwE pure (atomTypeVerify expectedType cType)
930+ lift $ except $ atomTypeVerify expectedType cType
865
931
866-- | Look up the type's name and create a new attribute.
932-- | Look up the type's name and create a new attribute.
867−evalAttrExpr :: TypeConstructorMapping -> AttributeExpr -> Either RelationalError Attribute
933+evalGraphRefAttrExpr :: GraphRefAttributeExpr -> GraphRefRelationalExprM Attribute
868−evalAttrExpr aTypes (AttributeAndTypeNameExpr attrName tCons ()) = do
934+evalGraphRefAttrExpr (AttributeAndTypeNameExpr attrName tCons transId) = do
869− aType <- atomTypeForTypeConstructor tCons aTypes M.empty
935+ tConsMap <- typeConstructorMapping <$> gfDatabaseContextForMarker transId
936+ aType <- lift $ except $ atomTypeForTypeConstructorValidate True tCons tConsMap M.empty
937+ lift $ except $ validateAtomType aType tConsMap
870− Right (Attribute attrName aType)
938+ pure $ Attribute attrName aType
871
939
872−evalAttrExpr _ (NakedAttributeExpr attr) = Right attr
940+evalGraphRefAttrExpr (NakedAttributeExpr attr) = pure attr
873−
941+
874−evalTupleExpr :: Maybe Attributes -> TupleExpr -> RelationalExprState (Either RelationalError RelationTuple)
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
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
875−evalTupleExpr attrs (TupleExpr tupMap) = do
991+evalGraphRefTupleExpr mAttrs (TupleExpr tupMap) = do
876− context <- fmap stateElemsContext ask
877− runExceptT $ do
878 -- 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
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
879 -- 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
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
994+ let attrs = fromMaybe A.emptyAttributes mAttrs
880− attrAtoms <- mapM (\(attrName, aExpr) -> do
995+ resolveOneAtom (attrName, aExpr) =
881− newAtomType <- liftE (typeFromAtomExpr A.emptyAttributes aExpr)
996+ do
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?
882− newAtom <- liftE (evalAtomExpr emptyTuple aExpr)
1004+ newAtom <- evalGraphRefAtomExpr emptyTuple aExpr
883− pure (attrName, newAtom, newAtomType)
1005+ pure (attrName, newAtom, resolvedType)
884− ) (M.toList tupMap)
1006+ attrAtoms <- mapM resolveOneAtom (M.toList tupMap)
885− let tupAttrs = A.attributesFromList $ map (\(attrName, _, aType) -> Attribute attrName aType) attrAtoms
1007+ let tupAttrs = A.attributesFromList $ map (\(attrName, _, aType) -> Attribute attrName aType) attrAtoms
886− atoms = V.fromList $ map (\(_, atom, _) -> atom) attrAtoms
1008+ atoms = V.fromList $ map (\(_, atom, _) -> atom) attrAtoms
887− tup = mkRelationTuple tupAttrs atoms
1009+ tup = mkRelationTuple tupAttrs atoms
888− tConss = typeConstructorMapping context
889− finalAttrs = fromMaybe tupAttrs attrs
1010+ finalAttrs = fromMaybe tupAttrs mAttrs
890 --verify that the attributes match
1011 --verify that the attributes match
891− when (A.attributeNameSet finalAttrs /= A.attributeNameSet tupAttrs) $ throwE (TupleAttributeTypeMismatchError tupAttrs)
1012+ when (A.attributeNameSet finalAttrs /= A.attributeNameSet tupAttrs) $ throwError (TupleAttributeTypeMismatchError tupAttrs)
1013+ --we can't resolve types here- they have to be resolved at the atom level where the graph ref is held
892− tup' <- either throwE pure (resolveTypesInTuple finalAttrs (reorderTuple finalAttrs tup))
1014+ --tup' <- lift $ except (resolveTypesInTuple finalAttrs tConss (reorderTuple finalAttrs tup))
1015+ let tup' = reorderTuple finalAttrs tup
1016+ --TODO: restore type resolution
893− _ <- either throwE pure (validateTuple tup' tConss)
1017+-- _ <- lift $ except (validateTuple tup' tConss)
894− pure tup'
1018+ pure tup'
895−
1019+
896−evalAttributeNames :: AttributeNames -> RelationalExpr -> RelationalExprState (Either RelationalError (S.Set AttributeName))
1020+--temporary implementation until we have a proper planner+executor
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)
897−evalAttributeNames attrNames expr = do
1172+evalGraphRefAttributeNames attrNames expr = do
898− eExprType <- typeForRelationalExpr expr
1173+ exprType' <- typeForGraphRefRelationalExpr expr
899− case eExprType of
900− Left err -> pure (Left err)
901− Right exprTyp -> do
902− let typeNameSet = S.fromList (V.toList (A.attributeNames (attributes exprTyp)))
1174+ let typeNameSet = S.fromList (V.toList (A.attributeNames (attributes exprType')))
903− case attrNames of
1175+ case attrNames of
904− AttributeNames names ->
1176+ AttributeNames names ->
905− case A.projectionAttributesForNames names (attributes exprTyp) of
1177+ case A.projectionAttributesForNames names (attributes exprType') of
906− Left err -> pure (Left err)
1178+ Left err -> throwError err
907− Right attrs -> pure (Right (S.fromList (V.toList (A.attributeNames attrs))))
1179+ Right attrs -> pure (S.fromList (V.toList (A.attributeNames attrs)))
908
1180
909− InvertedAttributeNames names -> do
1181+ InvertedAttributeNames names -> do
910 let nonExistentAttributeNames = A.attributeNamesNotContained names typeNameSet
1182 let nonExistentAttributeNames = A.attributeNamesNotContained names typeNameSet
911 if not (S.null nonExistentAttributeNames) then
1183 if not (S.null nonExistentAttributeNames) then
912− pure (Left (AttributeNamesMismatchError nonExistentAttributeNames))
1184+ throwError $ AttributeNamesMismatchError nonExistentAttributeNames
913 else
1185 else
914− pure (Right (A.nonMatchingAttributeNameSet names typeNameSet))
1186+ pure (A.nonMatchingAttributeNameSet names typeNameSet)
915
1187
916− UnionAttributeNames namesA namesB -> do
1188+ UnionAttributeNames namesA namesB -> do
917− eNameSetA <- evalAttributeNames namesA expr
1189+ nameSetA <- evalGraphRefAttributeNames namesA expr
918− case eNameSetA of
1190+ nameSetB <- evalGraphRefAttributeNames namesB expr
919− Left err -> pure (Left err)
920− Right nameSetA -> do
921− eNameSetB <- evalAttributeNames namesB expr
922− case eNameSetB of
923− Left err -> pure (Left err)
924− Right nameSetB ->
925− pure (Right (S.union nameSetA nameSetB))
1191+ pure (S.union nameSetA nameSetB)
926
1192
927− IntersectAttributeNames namesA namesB -> do
1193+ IntersectAttributeNames namesA namesB -> do
928− eNameSetA <- evalAttributeNames namesA expr
1194+ nameSetA <- evalGraphRefAttributeNames namesA expr
929− case eNameSetA of
1195+ nameSetB <- evalGraphRefAttributeNames namesB expr
930− Left err -> pure (Left err)
931− Right nameSetA -> do
932− eNameSetB <- evalAttributeNames namesB expr
933− case eNameSetB of
934− Left err -> pure (Left err)
935− Right nameSetB ->
936− pure (Right (S.intersection nameSetA nameSetB))
1196+ pure (S.intersection nameSetA nameSetB)
937
1197
938− RelationalExprAttributeNames attrExpr -> do
1198+ RelationalExprAttributeNames attrExpr -> do
939− eAttrExprType <- typeForRelationalExpr attrExpr
1199+ attrExprType <- typeForGraphRefRelationalExpr attrExpr
940− case eAttrExprType of
941− Left err -> pure (Left err)
942− Right attrExprType -> pure (Right (A.attributeNameSet (attributes attrExprType)))
1200+ pure (A.attributeNameSet (attributes attrExprType))
943−
1201+
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
944
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+
1392+
src/lib/ProjectM36/ScriptSession.hs+100−40
@@ -1,8 +1,12 @@
1−{-# LANGUAGE MagicHash, UnboxedTuples #-}
1+{-# LANGUAGE UnboxedTuples, KindSignatures, DataKinds #-}
2+#ifdef PM36_HASKELL_SCRIPTING
3+{-# LANGUAGE MagicHash #-}
4+#endif
2module ProjectM36.ScriptSession where
5module ProjectM36.ScriptSession where
3
6
7+#ifdef PM36_HASKELL_SCRIPTING
4import ProjectM36.Error
8import ProjectM36.Error
5−
9+import GHC
6import Control.Exception
10import Control.Exception
7import Control.Monad
11import Control.Monad
8import System.IO.Error
12import System.IO.Error
@@ -13,35 +17,60 @@ import System.FilePath
13import System.Info (os, arch)
17import System.Info (os, arch)
14import Data.Text (Text, unpack)
18import Data.Text (Text, unpack)
15import Data.Maybe
19import Data.Maybe
16−
17−import GHC
18import GHC.Paths (libdir)
20import GHC.Paths (libdir)
21+import System.Environment
19#if __GLASGOW_HASKELL__ >= 800
22#if __GLASGOW_HASKELL__ >= 800
20import GHC.LanguageExtensions
23import GHC.LanguageExtensions
24+import GHCi.ObjLink
25+#else
26+import ObjLink
27+#endif
28+#if __GLASGOW_HASKELL__ >= 802
29+import BasicTypes
21#endif
30#endif
22import DynFlags
31import DynFlags
23import Panic
32import Panic
24import Outputable --hiding ((<>))
33import Outputable --hiding ((<>))
25import PprTyThing
34import PprTyThing
26import Unsafe.Coerce
35import Unsafe.Coerce
36+#if __GLASGOW_HASKELL__ >= 802
27import Type
37import Type
28−
38+#elif __GLASGOW_HASKELL__ >= 710
39+import Type hiding (pprTyThing)
40+#else
41+#endif
29import GHC.Exts (addrToAny#)
42import GHC.Exts (addrToAny#)
30import GHC.Ptr (Ptr(..))
43import GHC.Ptr (Ptr(..))
31−import GHCi.ObjLink
32import Encoding
44import Encoding
45+#endif
46+
33
47
34data ScriptSession = ScriptSession {
48data ScriptSession = ScriptSession {
49+#ifdef PM36_HASKELL_SCRIPTING
35− hscEnv :: HscEnv,
50+ hscEnv :: HscEnv,
36 atomFunctionBodyType :: Type,
51 atomFunctionBodyType :: Type,
37 dbcFunctionBodyType :: Type
52 dbcFunctionBodyType :: Type
53+#endif
38 }
54 }
39−
55+
56+#ifdef PM36_HASKELL_SCRIPTING
40−newtype ScriptSessionError = ScriptSessionLoadError GhcException
57+data ScriptSessionError = ScriptSessionLoadError GhcException
58+ | ScriptingDisabled
41 deriving (Show)
59 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
42
68
43-- | Configure a GHC environment/session which we will use for all script compilation.
69-- | Configure a GHC environment/session which we will use for all script compilation.
44initScriptSession :: [String] -> IO (Either ScriptSessionError ScriptSession)
70initScriptSession :: [String] -> IO (Either ScriptSessionError ScriptSession)
71+#if !defined(PM36_HASKELL_SCRIPTING)
72+initScriptSession _ = pure (Left ScriptingDisabled)
73+#else
45initScriptSession ghcPkgPaths = do
74initScriptSession ghcPkgPaths = do
46 --for the sake of convenience, for developers' builds, include the local cabal sandbox package database and the cabal new-build package database
75 --for the sake of convenience, for developers' builds, include the local cabal sandbox package database and the cabal new-build package database
47 eHomeDir <- tryJust (guard . isDoesNotExistError) getHomeDirectory
76 eHomeDir <- tryJust (guard . isDoesNotExistError) getHomeDirectory
@@ -50,40 +79,47 @@ initScriptSession ghcPkgPaths = do
50 handleGhcException excHandler $ runGhc (Just libdir) $ do
79 handleGhcException excHandler $ runGhc (Just libdir) $ do
51 dflags <- getSessionDynFlags
80 dflags <- getSessionDynFlags
52 let ghcVersion = projectVersion dflags
81 let ghcVersion = projectVersion dflags
82+ -- get nix packages dir, if available
83+ mNixLibDir <- liftIO $ lookupEnv "NIX_GHC_LIBDIR"
53
84
54 sandboxPkgPaths <- liftIO $ concat <$> mapM glob [
85 sandboxPkgPaths <- liftIO $ concat <$> mapM glob [
55− "./dist-newstyle/packagedb/ghc-" ++ ghcVersion,
86+ --"./dist-newstyle/packagedb/ghc-" ++ ghcVersion, --rely on cabal 3's ghc.environment install: "cabal install --lib project-m36"
56 ".cabal-sandbox/*ghc-" ++ ghcVersion ++ "-packages.conf.d",
87 ".cabal-sandbox/*ghc-" ++ ghcVersion ++ "-packages.conf.d",
57 ".stack-work/install/*/*/" ++ ghcVersion ++ "/pkgdb",
88 ".stack-work/install/*/*/" ++ ghcVersion ++ "/pkgdb",
58 ".stack-work/install/*/pkgdb/", --windows stack build
89 ".stack-work/install/*/pkgdb/", --windows stack build
59 "C:/sr/snapshots/b201cfe6/pkgdb", --windows stack build- ideally, we could run `stack path --snapshot-pkg-db, but this is sufficient to pass CI
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
60− homeDir </> ".stack/snapshots/*/*/" ++ ghcVersion ++ "/pkgdb",
91+ homeDir </> ".stack/snapshots/*/*/" ++ ghcVersion ++ "/pkgdb"
61− homeDir </> ".cabal/store/ghc-" ++ ghcVersion ++ "/package.db"
92+ --homeDir </> ".cabal/store/ghc-" ++ ghcVersion ++ "/package.db"
62 ]
93 ]
63−
94+
64− let localPkgPaths = map PkgConfFile (ghcPkgPaths ++ sandboxPkgPaths)
95+ let localPkgPaths = map PkgConfFile (ghcPkgPaths ++ sandboxPkgPaths ++ maybeToList mNixLibDir)
65−
96+
66− let dflags' = applyGopts . applyXopts $ dflags { hscTarget = HscInterpreted ,
97+ let dflags' = applyGopts . applyXopts $ dflags { hscTarget = HscInterpreted ,
67− ghcLink = LinkInMemory,
98+ ghcLink = LinkInMemory,
68 safeHaskell = Sf_Trustworthy,
99 safeHaskell = Sf_Trustworthy,
69 safeInfer = True,
100 safeInfer = True,
70 safeInferred = True,
101 safeInferred = True,
71 --verbosity = 3,
102 --verbosity = 3,
72−#if __GLASGOW_HASKELL__ >= 800
103+#if __GLASGOW_HASKELL__ >= 800
73 trustFlags = map TrustPackage required_packages,
104 trustFlags = map TrustPackage required_packages,
74−#endif
105+#endif
75 packageFlags = packageFlags dflags ++ packages,
106 packageFlags = packageFlags dflags ++ packages,
107+#if __GLASGOW_HASKELL__ >= 802
108+ packageDBFlags = map PackageDB localPkgPaths
109+#else
76 extraPkgConfs = const (localPkgPaths ++ [UserPkgConf, GlobalPkgConf])
110 extraPkgConfs = const (localPkgPaths ++ [UserPkgConf, GlobalPkgConf])
111+#endif
112+
77 }
113 }
78 applyGopts flags = foldl gopt_set flags gopts
114 applyGopts flags = foldl gopt_set flags gopts
79 applyXopts flags = foldl xopt_set flags xopts
115 applyXopts flags = foldl xopt_set flags xopts
80#if __GLASGOW_HASKELL__ >= 800
116#if __GLASGOW_HASKELL__ >= 800
81 xopts = [OverloadedStrings, ExtendedDefaultRules, ImplicitPrelude, ScopedTypeVariables]
117 xopts = [OverloadedStrings, ExtendedDefaultRules, ImplicitPrelude, ScopedTypeVariables]
82−#else
118+#else
83 xopts = [Opt_OverloadedStrings, Opt_ExtendedDefaultRules, Opt_ImplicitPrelude, Opt_ScopedTypeVariables]
119 xopts = [Opt_OverloadedStrings, Opt_ExtendedDefaultRules, Opt_ImplicitPrelude, Opt_ScopedTypeVariables]
84#endif
120#endif
85 gopts = [] --[Opt_DistrustAllPackages, Opt_PackageTrust]
121 gopts = [] --[Opt_DistrustAllPackages, Opt_PackageTrust]
86− required_packages = ["base",
122+ required_packages = ["base",
87 "containers",
123 "containers",
88 "Glob",
124 "Glob",
89 "directory",
125 "directory",
@@ -92,8 +128,6 @@ initScriptSession ghcPkgPaths = do
92 "uuid",
128 "uuid",
93 "vector",
129 "vector",
94 "text",
130 "text",
95− "binary",
96− "vector-binary-instances",
97 "time",
131 "time",
98 "project-m36",
132 "project-m36",
99 "bytestring"]
133 "bytestring"]
@@ -105,16 +139,33 @@ initScriptSession ghcPkgPaths = do
105 --liftIO $ traceShowM (showSDoc dflags' (ppr packages))
139 --liftIO $ traceShowM (showSDoc dflags' (ppr packages))
106 _ <- setSessionDynFlags dflags'
140 _ <- setSessionDynFlags dflags'
107 let safeImportDecl mn mQual = ImportDecl {
141 let safeImportDecl mn mQual = ImportDecl {
142+#if __GLASGOW_HASKELL__ >= 802
143+ ideclSourceSrc = NoSourceText,
144+#else
108 ideclSourceSrc = Nothing,
145 ideclSourceSrc = Nothing,
146+#endif
147+
148+#if __GLASGOW_HASKELL__ >= 810
149+ ideclExt = noExtField,
150+#elif __GLASGOW_HASKELL__ >= 806
151+ ideclExt = NoExt,
152+#endif
109 ideclName = noLoc mn,
153 ideclName = noLoc mn,
110 ideclPkgQual = Nothing,
154 ideclPkgQual = Nothing,
111 ideclSource = False,
155 ideclSource = False,
112 ideclSafe = True,
156 ideclSafe = True,
113 ideclImplicit = False,
157 ideclImplicit = False,
158+#if __GLASGOW_HASKELL__ >= 810
159+ ideclQualified = if isJust mQual then QualifiedPre else NotQualified,
160+#else
114 ideclQualified = isJust mQual,
161 ideclQualified = isJust mQual,
162+#endif
115 ideclAs = mQual,
163 ideclAs = mQual,
116 ideclHiding = Nothing
164 ideclHiding = Nothing
117 }
165 }
166+#if __GLASGOW_HASKELL__ >= 806
167+ :: ImportDecl (GhcPass (c :: Pass))
168+#endif
118 unqualifiedModules = map (\modn -> IIDecl $ safeImportDecl (mkModuleName modn) Nothing) [
169 unqualifiedModules = map (\modn -> IIDecl $ safeImportDecl (mkModuleName modn) Nothing) [
119 "Prelude",
170 "Prelude",
120 "Data.Map",
171 "Data.Map",
@@ -127,7 +178,12 @@ initScriptSession ghcPkgPaths = do
127 "ProjectM36.DatabaseContextFunctionError",
178 "ProjectM36.DatabaseContextFunctionError",
128 "ProjectM36.DatabaseContextFunctionUtils",
179 "ProjectM36.DatabaseContextFunctionUtils",
129 "ProjectM36.RelationalExpression"]
180 "ProjectM36.RelationalExpression"]
181+#if __GLASGOW_HASKELL__ >= 802
182+ mkModName = noLoc . mkModuleName
183+#else
184+ mkModName = mkModuleName
185+#endif
130− qualifiedModules = map (\(modn, qualNam) -> IIDecl $ safeImportDecl (mkModuleName modn) (Just (mkModuleName qualNam))) [
186+ qualifiedModules = map (\(modn, qualNam) -> IIDecl $ safeImportDecl (mkModuleName modn) (Just (mkModName qualNam))) [
131 ("Data.Text", "T")
187 ("Data.Text", "T")
132 ]
188 ]
133 setContext (unqualifiedModules ++ qualifiedModules)
189 setContext (unqualifiedModules ++ qualifiedModules)
@@ -139,8 +195,8 @@ initScriptSession ghcPkgPaths = do
139addImport :: String -> Ghc ()
195addImport :: String -> Ghc ()
140addImport moduleNam = do
196addImport moduleNam = do
141 ctx <- getContext
197 ctx <- getContext
142− setContext ( (IIDecl $ simpleImportDecl (mkModuleName moduleNam)) : ctx )
198+ setContext (IIDecl (simpleImportDecl (mkModuleName moduleNam)) : ctx)
143−
199+
144showType :: DynFlags -> Type -> String
200showType :: DynFlags -> Type -> String
145showType dflags ty = showSDocForUser dflags alwaysQualify (pprTypeForUser ty)
201showType dflags ty = showSDocForUser dflags alwaysQualify (pprTypeForUser ty)
146
202
@@ -165,37 +221,40 @@ compileScript funcType script = do
165 mErr <- typeCheckScript funcType script
221 mErr <- typeCheckScript funcType script
166 case mErr of
222 case mErr of
167 Just err -> pure (Left err)
223 Just err -> pure (Left err)
168− Nothing ->
224+ Nothing ->
169 --catch exception here
225 --catch exception here
170 --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.
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.
171 -- we can't use dynCompileExpr here because
227 -- we can't use dynCompileExpr here because
172 Right . unsafeCoerce <$> compileExpr sScript
228 Right . unsafeCoerce <$> compileExpr sScript
173−
229+
174−typeCheckScript :: Type -> Text -> Ghc (Maybe ScriptCompilationError)
230+typeCheckScript :: Type -> Text -> Ghc (Maybe ScriptCompilationError)
175typeCheckScript expectedType inp = do
231typeCheckScript expectedType inp = do
176− dflags <- getSessionDynFlags
232+ dflags <- getSessionDynFlags
177 --catch exception for SyntaxError
233 --catch exception for SyntaxError
234+#if __GLASGOW_HASKELL__ >= 802
235+ funcType <- GHC.exprType TM_Inst (unpack inp)
236+#else
178 funcType <- GHC.exprType (unpack inp)
237 funcType <- GHC.exprType (unpack inp)
238+#endif
179− --liftIO $ putStrLn $ showType dflags expectedType ++ ":::" ++ showType dflags funcType
239+ --liftIO $ putStrLn $ showType dflags expectedType ++ ":::" ++ showType dflags funcType
180 if eqType funcType expectedType then
240 if eqType funcType expectedType then
181 pure Nothing
241 pure Nothing
182 else
242 else
183 pure (Just (TypeCheckCompilationError (showType dflags expectedType) (showType dflags funcType)))
243 pure (Just (TypeCheckCompilationError (showType dflags expectedType) (showType dflags funcType)))
184−
244+
185mangleSymbol :: Maybe String -> String -> String -> String
245mangleSymbol :: Maybe String -> String -> String -> String
186mangleSymbol pkg module' valsym =
246mangleSymbol pkg module' valsym =
187 prefixUnderscore ++
247 prefixUnderscore ++
188 maybe "" (\p -> zEncodeString p ++ "_") pkg ++
248 maybe "" (\p -> zEncodeString p ++ "_") pkg ++
189 zEncodeString module' ++ "_" ++ zEncodeString valsym ++ "_closure"
249 zEncodeString module' ++ "_" ++ zEncodeString valsym ++ "_closure"
190−
191−type ModName = String
192−type FuncName = String
193−
194−data LoadSymbolError = LoadSymbolError
195
250
196loadFunction :: ModName -> FuncName -> FilePath -> IO (Either LoadSymbolError a)
251loadFunction :: ModName -> FuncName -> FilePath -> IO (Either LoadSymbolError a)
197loadFunction modName funcName objPath = do
252loadFunction modName funcName objPath = do
253+#if __GLASGOW_HASKELL__ >= 802
254+ initObjLinker RetainCAFs
255+#else
198 initObjLinker
256 initObjLinker
257+#endif
199 loadObj objPath
258 loadObj objPath
200 _ <- resolveObjs
259 _ <- resolveObjs
201 ptr <- lookupSymbol (mangleSymbol Nothing modName funcName)
260 ptr <- lookupSymbol (mangleSymbol Nothing modName funcName)
@@ -203,8 +262,8 @@ loadFunction modName funcName objPath = do
203 Nothing -> pure (Left LoadSymbolError)
262 Nothing -> pure (Left LoadSymbolError)
204 Just (Ptr addr) -> case addrToAny# addr of
263 Just (Ptr addr) -> case addrToAny# addr of
205 (# hval #) -> pure (Right hval)
264 (# hval #) -> pure (Right hval)
206−
265+
207−prefixUnderscore :: String
266+prefixUnderscore :: String
208prefixUnderscore =
267prefixUnderscore =
209 case (os,arch) of
268 case (os,arch) of
210 ("mingw32","x86_64") -> ""
269 ("mingw32","x86_64") -> ""
@@ -212,4 +271,5 @@ prefixUnderscore =
212 ("mingw32",_) -> "_"
271 ("mingw32",_) -> "_"
213 ("darwin",_) -> "_"
272 ("darwin",_) -> "_"
214 ("cygwin",_) -> "_"
273 ("cygwin",_) -> "_"
215− _ -> ""
274+ _ -> ""
275+#endif
src/lib/ProjectM36/Serialise/AtomFunctionError.hsnew file+7
@@ -0,0 +1,7 @@
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.hsnew file+85
@@ -0,0 +1,85 @@
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.hsnew file+13
@@ -0,0 +1,13 @@
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.hsnew file+7
@@ -0,0 +1,7 @@
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.hsnew file+15
@@ -0,0 +1,15 @@
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.hsnew file+7
@@ -0,0 +1,7 @@
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.hsnew file+1
@@ -0,0 +1 @@
1+
src/lib/ProjectM36/Server.hs+166−84
@@ -7,75 +7,119 @@ 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(..))
17−import Control.Concurrent.MVar (putMVar, MVar)
10+import Control.Concurrent.MVar (MVar)
18import System.IO (stderr, hPutStrLn)
11import System.IO (stderr, hPutStrLn)
19import System.FilePath (takeDirectory)
12import System.FilePath (takeDirectory)
20import System.Directory (doesDirectoryExist)
13import 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
21
18
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
19+type TestMode = Bool
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 (RetrieveAtomFunctionSummary sessionId) -> handleRetrieveAtomFunctionSummary ti sessionId conn),
45− handleCall (\conn (RetrieveDatabaseContextFunctionSummary sessionId) -> handleRetrieveDatabaseContextFunctionSummary ti sessionId conn),
46− handleCall (\conn (RetrieveCurrentSchemaName sessionId) -> handleRetrieveCurrentSchemaName ti sessionId conn),
47− handleCall (\conn (ExecuteSchemaExpr sessionId schemaExpr) -> handleExecuteSchemaExpr ti sessionId conn schemaExpr),
48− handleCall (\conn (RetrieveSessionIsDirty sessionId) -> handleRetrieveSessionIsDirty ti sessionId conn),
49− handleCall (\conn (ExecuteAutoMergeToHead sessionId strat headName') -> handleExecuteAutoMergeToHead ti sessionId conn strat headName'),
50− handleCall (\conn (RetrieveTypeConstructorMapping sessionId) -> handleRetrieveTypeConstructorMapping ti sessionId conn),
51− handleCall (\conn Logout -> handleLogout ti conn)
52− ] ++ testModeHandlers,
53− unhandledMessagePolicy = Terminate
54− --unhandledMessagePolicy = Log
55− }
56− where
57− testModeHandlers = if not testBool then
58− []
59− else
60− [handleCall (\conn (TestTimeout sessionId) -> handleTestTimeout ti sessionId conn)]
61−
62−
63−initServer :: InitHandler (Connection, DatabaseName, Maybe (MVar EndPointAddress), EndPointAddress) Connection
64−initServer (conn, dbname, mAddressMVar, saddress) = do
65− registerDB dbname
66− case mAddressMVar of
67− Nothing -> pure ()
68− Just addressMVar -> liftIO $ putMVar addressMVar saddress
69− --traceShowM ("server started on " ++ show saddress)
70− pure $ InitOk conn Infinity
71
20
72−registerDB :: DatabaseName -> Process ()
21+requestHandlers :: TestMode -> Maybe Timeout -> RequestHandlers ServerState
73−registerDB dbname = do
22+requestHandlers testFlag ti =
74− self <- getSelfPid
23+ [
75− let dbname' = remoteDBLookupName dbname
24+ RequestHandler (\sState (Login dbName) -> do
76− register dbname' self
25+ addClientLogin dbName sState
77− --liftIO $ putStrLn $ "registered " ++ (show self) ++ " " ++ dbname'
26+ conn <- getConn sState
78−
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+
122+
79-- | A notification callback which logs the notification to stderr and does nothing else.
123-- | A notification callback which logs the notification to stderr and does nothing else.
80loggingNotificationCallback :: NotificationCallback
124loggingNotificationCallback :: NotificationCallback
81loggingNotificationCallback notName evaldNot = hPutStrLn stderr $ "Notification received \"" ++ show notName ++ "\": " ++ show evaldNot
125loggingNotificationCallback notName evaldNot = hPutStrLn stderr $ "Notification received \"" ++ show notName ++ "\": " ++ show evaldNot
@@ -100,9 +144,47 @@ checkFSType performCheck strat =
100checkFSErrorMsg :: String
144checkFSErrorMsg :: String
101checkFSErrorMsg = "The filesystem does not support journaling so writes may not be crash-safe. Use --disable-fscheck to disable this fatal error."
145checkFSErrorMsg = "The filesystem does not support journaling so writes may not be crash-safe. Use --disable-fscheck to disable this fatal error."
102
146
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 })
103-- | 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.
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.
104−launchServer :: ServerConfig -> Maybe (MVar EndPointAddress) -> IO Bool
186+launchServer :: ServerConfig -> Maybe (MVar SockAddr) -> IO Bool
105−launchServer daemonConfig mAddressMVar = do
187+launchServer daemonConfig mAddr = do
106 checkFSResult <- checkFSType (checkFS daemonConfig) (persistenceStrategy daemonConfig)
188 checkFSResult <- checkFSType (checkFS daemonConfig) (persistenceStrategy daemonConfig)
107 if not checkFSResult then do
189 if not checkFSResult then do
108 hPutStrLn stderr checkFSErrorMsg
190 hPutStrLn stderr checkFSErrorMsg
@@ -115,21 +197,21 @@ launchServer daemonConfig mAddressMVar = do
115 pure False
197 pure False
116 Right conn -> do
198 Right conn -> do
117 let hostname = bindHost daemonConfig
199 let hostname = bindHost daemonConfig
118− port = bindPort daemonConfig
200+ port = fromIntegral (bindPort daemonConfig)
119− etransport <- createTransport hostname (show port) defaultTCPParameters
201+
120− case etransport of
202+
121− Left err -> error ("failed to create transport: " ++ show err)
203+ --curryer only supports IPv4 for now
122− Right transport -> do
204+ let addrHints = defaultHints { addrSocketType = Stream, addrFamily = AF_INET }
123− eEndpoint <- newEndPoint transport
205+ hostAddrs <- getAddrInfo (Just addrHints) (Just hostname) Nothing
124− case eEndpoint of
206+ case hostAddrs of
125− Left err -> hPutStrLn stderr ("Failed to create transport: " ++ show err) >> pure False
207+ [] -> hPutStrLn stderr ("Failed to resolve: " <> hostname) >> pure False
126− Right endpoint -> do
208+ (AddrInfo _ _ _ _ (SockAddrInet _ addr32) _):_ -> do
127− localTCPNode <- newLocalNode transport initRemoteTable
209+ let hostAddr = hostAddressToTuple addr32
128− --traceShowM ("newLocalNode in Server " ++ show (localNodeId localTCPNode))
129− runProcess localTCPNode $ do
130− let testBool = testMode daemonConfig
131− reqTimeout = perRequestTimeout daemonConfig
210+ mTimeout = fromIntegral <$> case perRequestTimeout daemonConfig of
132− serve (conn, databaseName daemonConfig, mAddressMVar, address endpoint) initServer (serverDefinition testBool reqTimeout)
211+ 0 -> Nothing
133− liftIO $ putStrLn "serve returned"
212+ v -> Just v
134− pure True
213+
135−
214+ sState <- initialServerState (databaseName daemonConfig) conn
215+ serve (requestHandlers (testMode daemonConfig) mTimeout) sState hostAddr port mAddr
216+ _ -> error "unsupported socket addressing mode (IPv4 only currently)"
217+
src/lib/ProjectM36/Server/Config.hs+6
@@ -12,6 +12,12 @@ 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+
15defaultServerConfig :: ServerConfig
21defaultServerConfig :: ServerConfig
16defaultServerConfig = ServerConfig { persistenceStrategy = NoPersistence,
22defaultServerConfig = ServerConfig { persistenceStrategy = NoPersistence,
17 checkFS = True,
23 checkFS = True,
src/lib/ProjectM36/Server/EntryPoints.hs+127−148
@@ -1,167 +1,146 @@
1+{-# LANGUAGE MonoLocalBinds #-}
1module ProjectM36.Server.EntryPoints where
2module ProjectM36.Server.EntryPoints where
2import ProjectM36.Base hiding (inclusionDependencies)
3import ProjectM36.Base hiding (inclusionDependencies)
3import ProjectM36.IsomorphicSchema
4import ProjectM36.IsomorphicSchema
4import ProjectM36.Client as C
5import 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)
12import Data.Map
6import Data.Map
13import Control.Concurrent (threadDelay)
7import Control.Concurrent (threadDelay)
8+import Network.RPC.Curryer.Server
9+import System.Timeout hiding (Timeout)
10+import Network.Socket
11+import Control.Exception
14
12
15−timeoutOrDie :: Serializable a => Timeout -> IO a -> Process (Either ServerError a)
13+timeoutOrDie :: Maybe Timeout -> IO a -> IO (Maybe a)
16−timeoutOrDie micros act =
14+timeoutOrDie mMicros act =
17− if micros == 0 then
18− liftIO act >>= \x -> pure (Right x)
19− else do
20− asyncUnit <- async (task (liftIO act))
21− asyncRes <- waitCancelTimeout micros asyncUnit
22− case asyncRes of
15+ case mMicros of
23− AsyncDone x -> pure (Right x)
16+ Nothing -> Just <$> act
24− AsyncCancelled -> pure (Left RequestTimeoutError)
17+ Just micros ->
25− AsyncFailed reason -> pure (Left (ProcessDiedError (show reason)))
18+ timeout (fromIntegral micros) act
26− AsyncLinkFailed reason -> pure (Left (ProcessDiedError (show reason)))
27− AsyncPending -> pure (Left (ProcessDiedError "process pending"))
28−
29−type Timeout = Int
30
19
31−type Reply a = Process (ProcessReply (Either ServerError a) Connection)
20+timeoutRelErr :: Maybe Timeout -> IO (Either RelationalError a) -> IO (Either RelationalError a)
32−
21+timeoutRelErr mMicros act = do
33−handleExecuteRelationalExpr :: Timeout -> SessionId -> Connection -> RelationalExpr -> Reply (Either RelationalError Relation)
22+ ret <- timeoutOrDie mMicros act
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)
56 case ret of
23 case ret of
57− Right () -> reply (Right True) conn
24+ Nothing -> throw TimeoutException
58− Left err -> reply (Left err) conn
25+ Just v -> pure v
59−
26+
60−handleExecuteGraphExpr :: Timeout -> SessionId -> Connection -> TransactionGraphOperator -> Reply (Either RelationalError ())
61−handleExecuteGraphExpr ti sessionId conn graphExpr = do
62− ret <- timeoutOrDie ti (executeGraphExpr sessionId conn graphExpr)
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
69
27
70−handleExecuteTypeForRelationalExpr :: Timeout -> SessionId -> Connection -> RelationalExpr -> Reply (Either RelationalError Relation)
28+handleExecuteRelationalExpr :: Maybe Timeout -> SessionId -> Connection -> RelationalExpr -> IO (Either RelationalError Relation)
71−handleExecuteTypeForRelationalExpr ti sessionId conn relExpr = do
29+handleExecuteRelationalExpr ti sessionId conn expr =
30+ timeoutRelErr ti (executeRelationalExpr sessionId conn expr)
31+
32+handleExecuteDataFrameExpr :: Maybe Timeout -> SessionId -> Connection -> DataFrameExpr -> IO (Either RelationalError DataFrame)
33+handleExecuteDataFrameExpr ti sessionId conn expr =
34+ timeoutRelErr ti (executeDataFrameExpr sessionId conn expr)
35+
36+handleExecuteDatabaseContextExpr :: Maybe Timeout -> SessionId -> Connection -> DatabaseContextExpr -> IO (Either RelationalError ())
37+handleExecuteDatabaseContextExpr ti sessionId conn dbexpr =
38+ timeoutRelErr ti (executeDatabaseContextExpr sessionId conn dbexpr)
39+
40+handleExecuteDatabaseContextIOExpr :: Maybe Timeout -> SessionId -> Connection -> DatabaseContextIOExpr -> IO (Either RelationalError ())
41+handleExecuteDatabaseContextIOExpr ti sessionId conn dbexpr =
42+ timeoutRelErr ti (executeDatabaseContextIOExpr sessionId conn dbexpr)
43+
44+handleExecuteHeadName :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError HeadName)
45+handleExecuteHeadName ti sessionId conn =
46+ timeoutRelErr ti (headName sessionId conn)
47+
48+handleLogin :: Connection -> Locking Socket -> IO Bool
49+handleLogin conn lockSock = do
50+ addClientNode conn lockSock
51+ pure True
52+
53+handleExecuteGraphExpr :: Maybe Timeout -> SessionId -> Connection -> TransactionGraphOperator -> IO (Either RelationalError ())
54+handleExecuteGraphExpr ti sessionId conn graphExpr =
55+ timeoutRelErr ti (executeGraphExpr sessionId conn graphExpr)
56+
57+handleExecuteTransGraphRelationalExpr :: Maybe Timeout -> SessionId -> Connection -> TransGraphRelationalExpr -> IO (Either RelationalError Relation)
58+handleExecuteTransGraphRelationalExpr ti sessionId conn graphExpr =
59+ timeoutRelErr ti (executeTransGraphRelationalExpr sessionId conn graphExpr)
60+
61+handleExecuteTypeForRelationalExpr :: Maybe Timeout -> SessionId -> Connection -> RelationalExpr -> IO (Either RelationalError Relation)
62+handleExecuteTypeForRelationalExpr ti sessionId conn relExpr =
72− ret <- timeoutOrDie ti (typeForRelationalExpr sessionId conn relExpr)
63+ timeoutRelErr ti (typeForRelationalExpr sessionId conn relExpr)
73− reply ret conn
64+
74−
75−handleRetrieveInclusionDependencies :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError (Map IncDepName InclusionDependency))
65+handleRetrieveInclusionDependencies :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError (Map IncDepName InclusionDependency))
76−handleRetrieveInclusionDependencies ti sessionId conn = do
66+handleRetrieveInclusionDependencies ti sessionId conn =
77− ret <- timeoutOrDie ti (inclusionDependencies sessionId conn)
67+ timeoutRelErr ti (inclusionDependencies sessionId conn)
78− reply ret conn
68+
79−
80−handleRetrievePlanForDatabaseContextExpr :: Timeout -> SessionId -> Connection -> DatabaseContextExpr -> Reply (Either RelationalError DatabaseContextExpr)
69+handleRetrievePlanForDatabaseContextExpr :: Maybe Timeout -> SessionId -> Connection -> DatabaseContextExpr -> IO (Either RelationalError GraphRefDatabaseContextExpr)
81−handleRetrievePlanForDatabaseContextExpr ti sessionId conn dbExpr = do
70+handleRetrievePlanForDatabaseContextExpr ti sessionId conn dbExpr =
82− ret <- timeoutOrDie ti (planForDatabaseContextExpr sessionId conn dbExpr)
71+ timeoutRelErr ti (planForDatabaseContextExpr sessionId conn dbExpr)
83− reply ret conn
72+
84−
85−handleRetrieveTransactionGraph :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError Relation)
73+handleRetrieveTransactionGraph :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError Relation)
86−handleRetrieveTransactionGraph ti sessionId conn = do
74+handleRetrieveTransactionGraph ti sessionId conn =
87− ret <- timeoutOrDie ti (transactionGraphAsRelation sessionId conn)
75+ timeoutRelErr ti (transactionGraphAsRelation sessionId conn)
88− reply ret conn
76+
89−
90−handleRetrieveHeadTransactionId :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError TransactionId)
77+handleRetrieveHeadTransactionId :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError TransactionId)
91−handleRetrieveHeadTransactionId ti sessionId conn = do
78+handleRetrieveHeadTransactionId ti sessionId conn =
92− ret <- timeoutOrDie ti (headTransactionId sessionId conn)
79+ timeoutRelErr ti (headTransactionId sessionId conn)
93− reply ret conn
94−
95−handleCreateSessionAtCommit :: Timeout -> Connection -> TransactionId -> Reply (Either RelationalError SessionId)
96−handleCreateSessionAtCommit ti conn commitId = do
97− ret <- timeoutOrDie ti (createSessionAtCommit conn commitId)
98− reply ret conn
99−
100−handleCreateSessionAtHead :: Timeout -> Connection -> HeadName -> Reply (Either RelationalError SessionId)
101−handleCreateSessionAtHead ti conn headn = do
102− ret <- timeoutOrDie ti (createSessionAtHead conn headn)
103− reply ret conn
104−
105−handleCloseSession :: Timeout -> SessionId -> Connection -> Reply ()
106−handleCloseSession ti sessionId conn = do
107− ret <- timeoutOrDie ti (closeSession sessionId conn)
108− case ret of
109− Right () -> reply (Right ()) conn
110− Left err -> reply (Left err) conn
111
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+
112−handleRetrieveAtomTypesAsRelation :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError Relation)
93+handleRetrieveAtomTypesAsRelation :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError Relation)
113−handleRetrieveAtomTypesAsRelation ti sessionId conn = do
94+handleRetrieveAtomTypesAsRelation ti sessionId conn =
114− ret <- timeoutOrDie ti (atomTypesAsRelation sessionId conn)
95+ timeoutRelErr ti (atomTypesAsRelation sessionId conn)
115− reply ret conn
116
96
117-- | Returns a relation which lists the names of relvars in the current session as well as its types.
97-- | Returns a relation which lists the names of relvars in the current session as well as its types.
118−handleRetrieveRelationVariableSummary :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError Relation)
98+handleRetrieveRelationVariableSummary :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError Relation)
119−handleRetrieveRelationVariableSummary ti sessionId conn = do
99+handleRetrieveRelationVariableSummary ti sessionId conn =
120− ret <- timeoutOrDie ti (relationVariablesAsRelation sessionId conn)
100+ timeoutRelErr ti (relationVariablesAsRelation sessionId conn)
121− reply ret conn
101+
122−
123−handleRetrieveAtomFunctionSummary :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError Relation)
102+handleRetrieveAtomFunctionSummary :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError Relation)
124−handleRetrieveAtomFunctionSummary ti sessionId conn = do
103+handleRetrieveAtomFunctionSummary ti sessionId conn =
125− ret <- timeoutOrDie ti (atomFunctionsAsRelation sessionId conn)
104+ timeoutRelErr ti (atomFunctionsAsRelation sessionId conn)
126− reply ret conn
105+
127−
128−handleRetrieveDatabaseContextFunctionSummary :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError Relation)
106+handleRetrieveDatabaseContextFunctionSummary :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError Relation)
129−handleRetrieveDatabaseContextFunctionSummary ti sessionId conn = do
107+handleRetrieveDatabaseContextFunctionSummary ti sessionId conn =
130− ret <- timeoutOrDie ti (databaseContextFunctionsAsRelation sessionId conn)
108+ timeoutRelErr ti (databaseContextFunctionsAsRelation sessionId conn)
131− reply ret conn
109+
132−
133−handleRetrieveCurrentSchemaName :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError SchemaName)
110+handleRetrieveCurrentSchemaName :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError SchemaName)
134−handleRetrieveCurrentSchemaName ti sessionId conn = do
111+handleRetrieveCurrentSchemaName ti sessionId conn =
135− ret <- timeoutOrDie ti (currentSchemaName sessionId conn)
112+ timeoutRelErr ti (currentSchemaName sessionId conn)
136− reply ret conn
137
113
138−handleExecuteSchemaExpr :: Timeout -> SessionId -> Connection -> SchemaExpr -> Reply (Either RelationalError ())
114+handleExecuteSchemaExpr :: Maybe Timeout -> SessionId -> Connection -> SchemaExpr -> IO (Either RelationalError ())
139−handleExecuteSchemaExpr ti sessionId conn schemaExpr = do
115+handleExecuteSchemaExpr ti sessionId conn schemaExpr =
140− ret <- timeoutOrDie ti (executeSchemaExpr sessionId conn schemaExpr)
116+ timeoutRelErr ti (executeSchemaExpr sessionId conn schemaExpr)
141− reply ret conn
142
117
143−handleLogout :: Timeout -> Connection -> Reply Bool
118+handleLogout :: Maybe Timeout -> Connection -> IO Bool
144−handleLogout _ =
119+handleLogout _ _ =
145 --liftIO $ closeRemote_ conn
120 --liftIO $ closeRemote_ conn
146− reply (pure True)
121+ pure True
147
122
148−handleTestTimeout :: Timeout -> SessionId -> Connection -> Reply Bool
123+handleTestTimeout :: Maybe Timeout -> SessionId -> Connection -> IO Bool
149−handleTestTimeout ti _ conn = do
124+handleTestTimeout ti _ _ = do
150− ret <- timeoutOrDie ti (threadDelay 100000 >> pure True)
125+ ret <- timeoutRelErr ti (threadDelay 100000 >> pure (Right ()))
151− reply ret conn
126+ case ret of
127+ Right () -> pure True
128+ Left _ -> pure False
152
129
130+
131+
153−handleRetrieveSessionIsDirty :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError Bool)
132+handleRetrieveSessionIsDirty :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError Bool)
154−handleRetrieveSessionIsDirty ti sessionId conn = do
133+handleRetrieveSessionIsDirty ti sessionId conn =
155− ret <- timeoutOrDie ti (disconnectedTransactionIsDirty sessionId conn)
134+ timeoutRelErr ti (disconnectedTransactionIsDirty sessionId conn)
156− reply ret conn
135+
157−
158−handleExecuteAutoMergeToHead :: Timeout -> SessionId -> Connection -> MergeStrategy -> HeadName -> Reply (Either RelationalError ())
136+handleExecuteAutoMergeToHead :: Maybe Timeout -> SessionId -> Connection -> MergeStrategy -> HeadName -> IO (Either RelationalError ())
159−handleExecuteAutoMergeToHead ti sessionId conn strat headName' = do
137+handleExecuteAutoMergeToHead ti sessionId conn strat headName' =
160− ret <- timeoutOrDie ti (autoMergeToHead sessionId conn strat headName')
138+ timeoutRelErr ti (autoMergeToHead sessionId conn strat headName')
161− reply ret conn
162
139
163−handleRetrieveTypeConstructorMapping :: Timeout -> SessionId -> Connection -> Reply (Either RelationalError TypeConstructorMapping)
140+handleRetrieveTypeConstructorMapping :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError TypeConstructorMapping)
164−handleRetrieveTypeConstructorMapping ti sessionId conn = do
141+handleRetrieveTypeConstructorMapping ti sessionId conn =
165− ret <- timeoutOrDie ti (C.typeConstructorMapping sessionId conn)
142+ timeoutRelErr ti (C.typeConstructorMapping sessionId conn)
166− reply ret conn
143+
167−
144+handleValidateMerkleHashes :: Maybe Timeout -> SessionId -> Connection -> IO (Either RelationalError ())
145+handleValidateMerkleHashes ti sessionId conn =
146+ timeoutRelErr ti (C.validateMerkleHashes sessionId conn)
src/lib/ProjectM36/Server/ParseArgs.hs+60−25
@@ -3,65 +3,100 @@ 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
6import Data.Monoid
7import Data.Monoid
8+#endif
7
9
8parseArgsWithDefaults :: ServerConfig -> Parser ServerConfig
10parseArgsWithDefaults :: ServerConfig -> Parser ServerConfig
9−parseArgsWithDefaults defaults = ServerConfig <$>
11+parseArgsWithDefaults defaults = ServerConfig <$>
10− parsePersistenceStrategy <*>
12+ parsePersistenceStrategy <*>
11− parseCheckFS <*>
13+ parseCheckFS <*>
12− parseDatabaseName <*>
14+ parseDatabaseName <*>
13− parseHostname (bindHost defaults) <*>
15+ parseHostname (bindHost defaults) <*>
14− parsePort (bindPort defaults) <*>
16+ parsePort (bindPort defaults) <*>
15− many parseGhcPkgPath <*>
17+ many parseGhcPkgPath <*>
16− parseTimeout (perRequestTimeout defaults) <*>
18+ parseTimeout (perRequestTimeout defaults) <*>
17− pure False
19+ parseTestMode
18−
20+
19parsePersistenceStrategy :: Parser PersistenceStrategy
21parsePersistenceStrategy :: Parser PersistenceStrategy
20parsePersistenceStrategy = CrashSafePersistence <$> (dbdirOpt <* fsyncOpt) <|>
22parsePersistenceStrategy = CrashSafePersistence <$> (dbdirOpt <* fsyncOpt) <|>
21 MinimalPersistence <$> dbdirOpt <|>
23 MinimalPersistence <$> dbdirOpt <|>
22 pure NoPersistence
24 pure NoPersistence
23− where
25+ where
24− dbdirOpt = strOption (short 'd' <>
26+ dbdirOpt = strOption (short 'd' <>
25− long "database-directory" <>
27+ long "database-directory" <>
26 metavar "DIRECTORY" <>
28 metavar "DIRECTORY" <>
27 showDefaultWith show
29 showDefaultWith show
28 )
30 )
29 fsyncOpt = switch (short 'f' <>
31 fsyncOpt = switch (short 'f' <>
30 long "fsync" <>
32 long "fsync" <>
31 help "Fsync all new transactions.")
33 help "Fsync all new transactions.")
32−
34+
35+parseTestMode :: Parser Bool
36+parseTestMode = flag True False (long "test-mode" <> hidden)
37+
33−parseCheckFS :: Parser Bool
38+parseCheckFS :: Parser Bool
34parseCheckFS = flag True False (long "disable-fscheck" <>
39parseCheckFS = flag True False (long "disable-fscheck" <>
35 help "Disable filesystem check for journaling.")
40 help "Disable filesystem check for journaling.")
36−
41+
37parseDatabaseName :: Parser DatabaseName
42parseDatabaseName :: Parser DatabaseName
38parseDatabaseName = strOption (short 'n' <>
43parseDatabaseName = strOption (short 'n' <>
39 long "database" <>
44 long "database" <>
40 metavar "DATABASE_NAME")
45 metavar "DATABASE_NAME")
41−
46+
42−parseHostname :: Hostname -> Parser Hostname
47+parseHostname :: Hostname -> Parser Hostname
43parseHostname defHostname = strOption (short 'h' <>
48parseHostname defHostname = strOption (short 'h' <>
44 long "hostname" <>
49 long "hostname" <>
45 metavar "HOST_NAME" <>
50 metavar "HOST_NAME" <>
46 value defHostname)
51 value defHostname)
47−
52+
48−parsePort :: Port -> Parser Port
53+parsePort :: Port -> Parser Port
49parsePort defPort = option auto (short 'p' <>
54parsePort defPort = option auto (short 'p' <>
50 long "port" <>
55 long "port" <>
51 metavar "PORT_NUMBER" <>
56 metavar "PORT_NUMBER" <>
52 value defPort)
57 value defPort)
53−
58+
54parseGhcPkgPath :: Parser String
59parseGhcPkgPath :: Parser String
55parseGhcPkgPath = strOption (long "ghc-pkg-dir" <>
60parseGhcPkgPath = strOption (long "ghc-pkg-dir" <>
56 metavar "GHC_PACKAGE_DIRECTORY")
61 metavar "GHC_PACKAGE_DIRECTORY")
57−
62+
58−parseTimeout :: Int -> Parser Int
63+parseTimeout :: Int -> Parser Int
59parseTimeout defTimeout = option auto (long "timeout" <>
64parseTimeout defTimeout = option auto (long "timeout" <>
60 metavar "MICROSECONDS" <>
65 metavar "MICROSECONDS" <>
61 value defTimeout)
66 value defTimeout)
62
67
63parseConfig :: IO ServerConfig
68parseConfig :: IO ServerConfig
64parseConfig = parseConfigWithDefaults defaultServerConfig
69parseConfig = parseConfigWithDefaults defaultServerConfig
65−
70+
66parseConfigWithDefaults :: ServerConfig -> IO ServerConfig
71parseConfigWithDefaults :: ServerConfig -> IO ServerConfig
67−parseConfigWithDefaults defaults = execParser (info (parseArgsWithDefaults defaults) idm)
72+parseConfigWithDefaults defaults = execParser (info (parseArgsWithDefaults defaults <**> helpOption) 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+69−34
@@ -1,68 +1,103 @@
1−{-# LANGUAGE DeriveAnyClass, DeriveGeneric #-}
1+{-# LANGUAGE DeriveGeneric, DerivingVia, CPP #-}
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
6import ProjectM36.TransGraphRelationalExpression
7import ProjectM36.TransGraphRelationalExpression
7import ProjectM36.Session
8import ProjectM36.Session
9+import ProjectM36.Serialise.DataFrame ()
10+import ProjectM36.Serialise.IsomorphicSchema ()
8import GHC.Generics
11import GHC.Generics
9−import Data.Binary
12+import Codec.Winery
10−import Control.Distributed.Process (ProcessId)
13+
14+#define RPCData(typeName) deriving Generic \
15+ deriving Serialise via WineryVariant typeName
11
16
12{-# ANN module ("HLint: ignore Use newtype instead of data" :: String) #-}
17{-# ANN module ("HLint: ignore Use newtype instead of data" :: String) #-}
13-- | The initial login message. The argument should be the process id of the initiating client. This ProcessId will receive notification callbacks.
18-- | The initial login message. The argument should be the process id of the initiating client. This ProcessId will receive notification callbacks.
14−data Login = Login ProcessId
19+data Login = Login DatabaseName
15− deriving (Binary, Generic)
20+ RPCData(Login)
16
21
17data Logout = Logout
22data Logout = Logout
18− deriving (Binary, Generic)
23+ RPCData(Logout)
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+
21data ExecuteDatabaseContextExpr = ExecuteDatabaseContextExpr SessionId DatabaseContextExpr
31data ExecuteDatabaseContextExpr = ExecuteDatabaseContextExpr SessionId DatabaseContextExpr
22− deriving (Binary, Generic)
32+ RPCData(ExecuteDatabaseContextExpr)
33+
23data ExecuteDatabaseContextIOExpr = ExecuteDatabaseContextIOExpr SessionId DatabaseContextIOExpr
34data ExecuteDatabaseContextIOExpr = ExecuteDatabaseContextIOExpr SessionId DatabaseContextIOExpr
24− deriving (Binary, Generic)
35+ RPCData(ExecuteDatabaseContextIOExpr)
36+
25data ExecuteGraphExpr = ExecuteGraphExpr SessionId TransactionGraphOperator
37data ExecuteGraphExpr = ExecuteGraphExpr SessionId TransactionGraphOperator
26− deriving (Binary, Generic)
38+ RPCData(ExecuteGraphExpr)
39+
27data ExecuteTransGraphRelationalExpr = ExecuteTransGraphRelationalExpr SessionId TransGraphRelationalExpr
40data ExecuteTransGraphRelationalExpr = ExecuteTransGraphRelationalExpr SessionId TransGraphRelationalExpr
28− deriving (Binary, Generic)
41+ RPCData(ExecuteTransGraphRelationalExpr)
42+
29data ExecuteHeadName = ExecuteHeadName SessionId
43data ExecuteHeadName = ExecuteHeadName SessionId
30− deriving (Binary, Generic)
44+ RPCData(ExecuteHeadName)
45+
31data ExecuteTypeForRelationalExpr = ExecuteTypeForRelationalExpr SessionId RelationalExpr
46data ExecuteTypeForRelationalExpr = ExecuteTypeForRelationalExpr SessionId RelationalExpr
32− deriving (Binary, Generic)
47+ RPCData(ExecuteTypeForRelationalExpr)
48+
33−data ExecuteSchemaExpr = ExecuteSchemaExpr SessionId SchemaExpr
49+data ExecuteSchemaExpr = ExecuteSchemaExpr SessionId SchemaExpr RPCData(ExecuteSchemaExpr)
34− deriving (Binary, Generic)
50+
35data ExecuteSetCurrentSchema = ExecuteSetCurrentSchema SessionId SchemaName
51data ExecuteSetCurrentSchema = ExecuteSetCurrentSchema SessionId SchemaName
36− deriving (Binary, Generic)
52+ RPCData(ExecuteSetCurrentSchema)
53+
37data RetrieveInclusionDependencies = RetrieveInclusionDependencies SessionId
54data RetrieveInclusionDependencies = RetrieveInclusionDependencies SessionId
38− deriving (Binary, Generic)
55+ RPCData(RetrieveInclusionDependencies)
56+
39data RetrievePlanForDatabaseContextExpr = RetrievePlanForDatabaseContextExpr SessionId DatabaseContextExpr
57data RetrievePlanForDatabaseContextExpr = RetrievePlanForDatabaseContextExpr SessionId DatabaseContextExpr
40− deriving (Binary, Generic)
58+ RPCData(RetrievePlanForDatabaseContextExpr)
59+
41data RetrieveTransactionGraph = RetrieveTransactionGraph SessionId
60data RetrieveTransactionGraph = RetrieveTransactionGraph SessionId
42− deriving (Binary, Generic)
61+ RPCData(RetrieveTransactionGraph)
62+
43data RetrieveHeadTransactionId = RetrieveHeadTransactionId SessionId
63data RetrieveHeadTransactionId = RetrieveHeadTransactionId SessionId
44− deriving (Binary, Generic)
64+ RPCData(RetrieveHeadTransactionId)
65+
45data CreateSessionAtCommit = CreateSessionAtCommit TransactionId
66data CreateSessionAtCommit = CreateSessionAtCommit TransactionId
46− deriving (Binary, Generic)
67+ RPCData(CreateSessionAtCommit)
68+
47data CreateSessionAtHead = CreateSessionAtHead HeadName
69data CreateSessionAtHead = CreateSessionAtHead HeadName
48− deriving (Binary, Generic)
70+ RPCData(CreateSessionAtHead)
71+
49data CloseSession = CloseSession SessionId
72data CloseSession = CloseSession SessionId
50− deriving (Binary, Generic)
73+ RPCData(CloseSession)
74+
51data RetrieveAtomTypesAsRelation = RetrieveAtomTypesAsRelation SessionId
75data RetrieveAtomTypesAsRelation = RetrieveAtomTypesAsRelation SessionId
52− deriving (Binary, Generic)
76+ RPCData(RetrieveAtomTypesAsRelation)
77+
53data RetrieveRelationVariableSummary = RetrieveRelationVariableSummary SessionId
78data RetrieveRelationVariableSummary = RetrieveRelationVariableSummary SessionId
54− deriving (Binary, Generic)
79+ RPCData(RetrieveRelationVariableSummary)
80+
55data RetrieveAtomFunctionSummary = RetrieveAtomFunctionSummary SessionId
81data RetrieveAtomFunctionSummary = RetrieveAtomFunctionSummary SessionId
56− deriving (Binary, Generic)
82+ RPCData(RetrieveAtomFunctionSummary)
83+
57data RetrieveDatabaseContextFunctionSummary = RetrieveDatabaseContextFunctionSummary SessionId
84data RetrieveDatabaseContextFunctionSummary = RetrieveDatabaseContextFunctionSummary SessionId
58− deriving (Binary, Generic)
85+ RPCData(RetrieveDatabaseContextFunctionSummary)
86+
59data RetrieveCurrentSchemaName = RetrieveCurrentSchemaName SessionId
87data RetrieveCurrentSchemaName = RetrieveCurrentSchemaName SessionId
60− deriving (Binary, Generic)
88+ RPCData(RetrieveCurrentSchemaName)
89+
61data TestTimeout = TestTimeout SessionId
90data TestTimeout = TestTimeout SessionId
62− deriving (Binary, Generic)
91+ RPCData(TestTimeout)
92+
63−data RetrieveSessionIsDirty = RetrieveSessionIsDirty SessionId
93+data RetrieveSessionIsDirty = RetrieveSessionIsDirty SessionId
64− deriving (Binary, Generic)
94+ RPCData(RetrieveSessionIsDirty)
95+
65data ExecuteAutoMergeToHead = ExecuteAutoMergeToHead SessionId MergeStrategy HeadName
96data ExecuteAutoMergeToHead = ExecuteAutoMergeToHead SessionId MergeStrategy HeadName
66− deriving (Binary, Generic)
97+ RPCData(ExecuteAutoMergeToHead)
98+
67data RetrieveTypeConstructorMapping = RetrieveTypeConstructorMapping SessionId
99data RetrieveTypeConstructorMapping = RetrieveTypeConstructorMapping SessionId
68− deriving (Binary, Generic)
100+ RPCData(RetrieveTypeConstructorMapping)
101+
102+data ExecuteValidateMerkleHashes = ExecuteValidateMerkleHashes SessionId
103+ RPCData(ExecuteValidateMerkleHashes)
src/lib/ProjectM36/Session.hs+3−2
@@ -3,6 +3,7 @@ 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
6
7
7type SessionId = UUID
8type SessionId = UUID
8
9
@@ -18,7 +19,7 @@ disconnectedTransaction :: Session -> DisconnectedTransaction
18disconnectedTransaction (Session discon _) = discon
19disconnectedTransaction (Session discon _) = discon
19
20
20isDirty :: Session -> DirtyFlag
21isDirty :: Session -> DirtyFlag
21−isDirty (Session (DisconnectedTransaction _ _ dirtyFlag) _) = dirtyFlag
22+isDirty (Session discon _) = Discon.isDirty discon
22
23
23concreteDatabaseContext :: Session -> DatabaseContext
24concreteDatabaseContext :: Session -> DatabaseContext
24concreteDatabaseContext (Session (DisconnectedTransaction _ (Schemas context _) _) _) = context
25concreteDatabaseContext (Session (DisconnectedTransaction _ (Schemas context _) _) _) = context
@@ -40,4 +41,4 @@ setSchemaName sname session = if sname == defaultSchemaName || M.member sname (s
40 pure (Session (disconnectedTransaction session) sname)
41 pure (Session (disconnectedTransaction session) sname)
41 else
42 else
42 Left (SubschemaNameNotInUseError sname)
43 Left (SubschemaNameNotInUseError sname)
43−
44+
src/lib/ProjectM36/Sessions.hs+29−7
@@ -1,18 +1,42 @@
1+{-# LANGUAGE PackageImports #-}
1module ProjectM36.Sessions where
2module ProjectM36.Sessions where
2import Control.Concurrent.STM
3import Control.Concurrent.STM
4+#if MIN_VERSION_stm_containers(1,0,0)
5+import qualified StmContainers.Map as StmMap
6+import qualified StmContainers.Set as StmSet
7+#else
3−import qualified STMContainers.Map as STMMap
8+import qualified STMContainers.Map as StmMap
4−import ListT
9+import qualified STMContainers.Set as StmSet
10+#endif
5import ProjectM36.Attribute
11import ProjectM36.Attribute
6import ProjectM36.Base
12import ProjectM36.Base
7import ProjectM36.Session
13import ProjectM36.Session
8import ProjectM36.Relation
14import ProjectM36.Relation
9import ProjectM36.Error
15import ProjectM36.Error
10import qualified Data.UUID as U
16import 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
11
23
12−type Sessions = STMMap.Map SessionId Session
24+type Sessions = StmMap.Map SessionId Session
13
25
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)]
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
15−stmMapToList = ListT.fold (\l -> return . (:l)) [] . STMMap.stream
38+stmSetToList = ListT.fold (\l -> return . (:l)) [] . StmSet.stream
39+#endif
16
40
17uuidAtom :: U.UUID -> Atom
41uuidAtom :: U.UUID -> Atom
18uuidAtom = TextAtom . U.toText
42uuidAtom = TextAtom . U.toText
@@ -23,5 +47,3 @@ sessionsAsRelation sessions = do
23 let atomMatrix = map (\(sessionId, session) -> [uuidAtom sessionId, uuidAtom (parentId session)]) sessionAssocs
47 let atomMatrix = map (\(sessionId, session) -> [uuidAtom sessionId, uuidAtom (parentId session)]) sessionAssocs
24 pure $ mkRelationFromList (attributesFromList [Attribute "sessionid" TextAtomType,
48 pure $ mkRelationFromList (attributesFromList [Attribute "sessionid" TextAtomType,
25 Attribute "parentCommit" TextAtomType]) atomMatrix
49 Attribute "parentCommit" TextAtomType]) atomMatrix
26−
27−
src/lib/ProjectM36/Shortcuts.hsnew file+247
@@ -0,0 +1,247 @@
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+373−248
@@ -1,287 +1,402 @@
1+{-# LANGUAGE FlexibleInstances #-}
2+{-# LANGUAGE FlexibleContexts #-}
1module ProjectM36.StaticOptimizer where
3module ProjectM36.StaticOptimizer where
2import ProjectM36.Base
4import ProjectM36.Base
3−import ProjectM36.RelationalExpression
5+import ProjectM36.GraphRefRelationalExpr
4import ProjectM36.Relation
6import ProjectM36.Relation
7+import ProjectM36.RelationalExpression
8+import ProjectM36.TransGraphRelationalExpression as TGRE hiding (askGraph)
5import ProjectM36.Error
9import ProjectM36.Error
10+import ProjectM36.Transaction
11+import ProjectM36.NormalizeExpr
6import qualified ProjectM36.Attribute as A
12import qualified ProjectM36.Attribute as A
7import qualified ProjectM36.AttributeNames as AS
13import qualified ProjectM36.AttributeNames as AS
8import ProjectM36.TupleSet
14import ProjectM36.TupleSet
9import Control.Monad.State
15import Control.Monad.State
10−import Data.Either (rights, lefts)
16+import Control.Monad.Reader
17+import Control.Monad.Except
11−import Control.Monad.Trans.Reader
18+import Control.Monad.Trans.Except
19+import Data.Functor.Identity
12import qualified Data.Map as M
20import qualified Data.Map as M
13import qualified Data.Set as S
21import qualified Data.Set as S
14
22
15-- the static optimizer performs optimizations which need not take any specific-relation statistics into account
23-- the static optimizer performs optimizations which need not take any specific-relation statistics into account
16−optimizeRelationalExpr :: DatabaseContext -> RelationalExpr -> Either RelationalError RelationalExpr
24+
17−optimizeRelationalExpr context expr = runReader (optimizeRelationalExprReader expr) (mkRelationalExprState context)
25+data GraphRefSOptRelationalExprEnv =
18−
26+ GraphRefSOptRelationalExprEnv
19−optimizeRelationalExprReader :: RelationalExpr -> RelationalExprState (Either RelationalError RelationalExpr)
27+ {
20−optimizeRelationalExprReader expr = do
28+ ore_graph :: TransactionGraph,
21− eOptExpr <- applyStaticRelationalOptimization expr
29+ ore_mcontext :: Maybe DatabaseContext
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)
22 case eOptExpr of
110 case eOptExpr of
23 Left err -> pure (Left err)
111 Left err -> pure (Left err)
24 Right optExpr ->
112 Right optExpr ->
113+ evalGraphRefDatabaseContextIOExpr 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
25− applyStaticJoinElimination (applyStaticRestrictionPushdown (applyStaticRestrictionCollapse optExpr))
171+ let optExpr' = applyStaticRestrictionPushdown (applyStaticRestrictionCollapse optExpr)
172+ applyStaticJoinElimination optExpr'
26
173
27−optimizeDatabaseContextExpr :: DatabaseContext -> DatabaseContextExpr -> Either RelationalError DatabaseContextExpr
28−optimizeDatabaseContextExpr context dbExpr = evalState (applyStaticDatabaseOptimization dbExpr) (freshDatabaseState context)
29-- apply optimizations which merely remove steps to become no-ops: example: projection of a relation across all of its attributes => original relation
174-- apply optimizations which merely remove steps to become no-ops: example: projection of a relation across all of its attributes => original relation
30
175
31--should optimizations offer the possibility to pure errors? If they perform the up-front type-checking, maybe so
176--should optimizations offer the possibility to pure errors? If they perform the up-front type-checking, maybe so
32−applyStaticRelationalOptimization :: RelationalExpr -> RelationalExprState (Either RelationalError RelationalExpr)
177+optimizeGraphRefRelationalExpr :: GraphRefRelationalExpr -> GraphRefSOptRelationalExprM GraphRefRelationalExpr
33−applyStaticRelationalOptimization e@(MakeStaticRelation _ _) = pure $ Right e
178+optimizeGraphRefRelationalExpr e@(MakeStaticRelation _ _) = pure e
34
179
35−applyStaticRelationalOptimization e@(MakeRelationFromExprs _ _) = pure $ Right e
180+optimizeGraphRefRelationalExpr e@MakeRelationFromExprs{} = pure e
36
181
37−applyStaticRelationalOptimization e@(ExistingRelation _) = pure $ Right e
182+optimizeGraphRefRelationalExpr e@(ExistingRelation _) = pure e
38
183
39−applyStaticRelationalOptimization e@(RelationVariable _ _) = pure $ Right e
184+optimizeGraphRefRelationalExpr e@(RelationVariable _ _) = pure e
40
185
41--remove project of attributes which removes no attributes
186--remove project of attributes which removes no attributes
42−applyStaticRelationalOptimization (Project attrNameSet expr) = do
187+optimizeGraphRefRelationalExpr (Project attrNameSet expr) = do
43− relType <- typeForRelationalExpr expr
188+ graph <- askGraph
189+ mctx <- askMaybeContext
190+ let relType = runGraphRefRelationalExprM gfEnv (typeForGraphRefRelationalExpr expr)
191+ gfEnv = freshGraphRefRelationalExprEnv mctx graph
44 case relType of
192 case relType of
45− Left err -> pure $ Left err
193+ Left err -> throwError err
46 Right relType2
194 Right relType2
47− | AS.all == attrNameSet ->
195+ | AS.all == attrNameSet ->
48− applyStaticRelationalOptimization expr
196+ optimizeGraphRefRelationalExpr expr
49 | AttributeNames (attributeNames relType2) == attrNameSet ->
197 | AttributeNames (attributeNames relType2) == attrNameSet ->
50− applyStaticRelationalOptimization expr
198+ optimizeGraphRefRelationalExpr expr
51 | otherwise -> do
199 | otherwise -> do
52− optimizedSubExpression <- applyStaticRelationalOptimization expr
200+ optSubExpr <- optimizeGraphRefRelationalExpr expr
53− case optimizedSubExpression of
54− Left err -> pure $ Left err
55− Right optSubExpr -> pure (Right (Project attrNameSet optSubExpr))
201+ pure (Project attrNameSet optSubExpr)
56
202
57−applyStaticRelationalOptimization (Union exprA exprB) = do
203+optimizeGraphRefRelationalExpr (Union exprA exprB) = do
58− eOptExprA <- applyStaticRelationalOptimization exprA
204+ optExprA <- optimizeGraphRefRelationalExpr exprA
59− eOptExprB <- applyStaticRelationalOptimization exprB
205+ optExprB <- optimizeGraphRefRelationalExpr exprB
60− case eOptExprA of
61− Left err -> pure $ Left err
62− Right optExprA -> case eOptExprB of
63− Left err -> pure $ Left err
64− Right optExprB -> -- (x where pred1) union (x where pred2) -> (x where pred1 or pred2)
206+ -- (x where pred1) union (x where pred2) -> (x where pred1 or pred2)
65− case (optExprA, optExprB) of
207+ case (optExprA, optExprB) of
66− (Restrict predA (RelationVariable nameA ()),
208+ (Restrict predA (RelationVariable nameA sA),
67− Restrict predB (RelationVariable nameB ())) | nameA == nameB -> pure (Right (Restrict (AndPredicate predA predB) (RelationVariable nameA ())))
209+ Restrict predB (RelationVariable nameB sB)) | nameA == nameB && sA == sB -> pure (Restrict (AndPredicate predA predB) (RelationVariable nameA sA))
210+ (exprA', exprB') | isEmptyRelationExpr exprA' -> pure exprB'
211+ | isEmptyRelationExpr exprB' -> pure exprA'
68 _ -> if optExprA == optExprB then
212 _ -> if optExprA == optExprB then
69− pure (Right optExprA)
213+ pure optExprA
70 else
214 else
71− pure $ Right $ Union optExprA optExprB
215+ pure $ Union optExprA optExprB
72
216
73−applyStaticRelationalOptimization (Join exprA exprB) = do
217+optimizeGraphRefRelationalExpr (Join exprA exprB) = do
74− eOptExprA <- applyStaticRelationalOptimization exprA
218+ optExprA <- optimizeGraphRefRelationalExpr exprA
75− eOptExprB <- applyStaticRelationalOptimization exprB
219+ optExprB <- optimizeGraphRefRelationalExpr exprB
76− case eOptExprA of
77− Left err -> pure $ Left err
78− Right optExprA -> case eOptExprB of
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
220+ -- if the relvars to join are the same but with predicates, then just AndPredicate the predicates
82− case (optExprA, optExprB) of
221+ case (optExprA, optExprB) of
83− (Restrict predA (RelationVariable nameA ()),
222+ (Restrict predA (RelationVariable nameA sA),
84− Restrict predB (RelationVariable nameB ())) | nameA == nameB -> pure (Right (Restrict (AndPredicate predA predB) (RelationVariable nameA ())))
223+ Restrict predB (RelationVariable nameB sB)) | nameA == nameB && sA == sB -> pure (Restrict (AndPredicate predA predB) (RelationVariable nameA sA))
85 _ -> if optExprA == optExprB then --A join A == A
224 _ -> if optExprA == optExprB then --A join A == A
86− pure (Right optExprA)
225+ pure optExprA
87 else
226 else
88− pure (Right (Join optExprA optExprB))
227+ pure (Join optExprA optExprB)
89
228
90−applyStaticRelationalOptimization (Difference exprA exprB) = do
229+optimizeGraphRefRelationalExpr (Difference exprA exprB) = do
91− optExprA <- applyStaticRelationalOptimization exprA
230+ graph <- askGraph
92− optExprB <- applyStaticRelationalOptimization exprB
231+ context <- askMaybeContext
93− case optExprA of
232+ optExprA <- optimizeGraphRefRelationalExpr exprA
94− Left err -> pure $ Left err
233+ optExprB <- optimizeGraphRefRelationalExpr exprB
95− Right optExprA2 -> case optExprB of
96− Left err -> pure $ Left err
97− Right optExprB2 -> if optExprA == optExprB then do --A difference A == A where false
234+ if optExprA == optExprB then do --A difference A == A where false
98− eEmptyRel <- typeForRelationalExpr optExprA2
235+ let eEmptyRel = runGraphRefRelationalExprM gfEnv (typeForGraphRefRelationalExpr optExprA)
236+ gfEnv = freshGraphRefRelationalExprEnv context graph
99− case eEmptyRel of
237+ case eEmptyRel of
100− Left err -> pure (Left err)
238+ Left err -> throwError err
101− Right emptyRel -> pure (Right (ExistingRelation emptyRel))
239+ Right emptyRel -> pure (ExistingRelation emptyRel)
102− else
240+ else
103− pure $ Right (Difference optExprA2 optExprB2)
241+ pure (Difference optExprA optExprB)
104
242
105−applyStaticRelationalOptimization e@Rename{} = pure $ Right e
243+optimizeGraphRefRelationalExpr e@Rename{} = pure e
106
244
107−applyStaticRelationalOptimization (Group oldAttrNames newAttrName expr) =
245+optimizeGraphRefRelationalExpr (Group oldAttrNames newAttrName expr) =
108− pure $ Right $ Group oldAttrNames newAttrName expr
246+ pure $ Group oldAttrNames newAttrName expr
109
247
110−applyStaticRelationalOptimization (Ungroup attrName expr) =
248+optimizeGraphRefRelationalExpr (Ungroup attrName expr) =
111− pure $ Right $ Ungroup attrName expr
249+ pure $ Ungroup attrName expr
112
250
113--remove restriction of nothing
251--remove restriction of nothing
114−applyStaticRelationalOptimization (Restrict predicate expr) = do
252+optimizeGraphRefRelationalExpr (Restrict predicate expr) = do
253+ graph <- askGraph
254+ mctx <- askMaybeContext
115 optimizedPredicate <- applyStaticPredicateOptimization predicate
255 optimizedPredicate <- applyStaticPredicateOptimization predicate
116 case optimizedPredicate of
256 case optimizedPredicate of
117− Left err -> pure $ Left err
257+ optimizedPredicate' | isTrueExpr optimizedPredicate' -> optimizeGraphRefRelationalExpr expr -- remove predicate entirely
118− Right optimizedPredicate2
119− | isTrueExpr optimizedPredicate2 -> applyStaticRelationalOptimization expr -- remove predicate entirely
120− | isFalseExpr optimizedPredicate2 -> do -- replace where false predicate with empty relation with attributes from relexpr
258+ optimizedPredicate' | isFalseExpr optimizedPredicate' -> do -- replace where false predicate with empty relation with attributes from relexpr
121− attributesRel <- typeForRelationalExpr expr
259+ let attributesRel = runGraphRefRelationalExprM gfEnv (typeForGraphRefRelationalExpr expr)
260+ gfEnv = freshGraphRefRelationalExprEnv mctx graph
122 case attributesRel of
261 case attributesRel of
123− Left err -> pure $ Left err
262+ Left err -> throwError err
124− Right attributesRelA -> pure $ Right $ MakeStaticRelation (attributes attributesRelA) emptyTupleSet
263+ Right attributesRelA -> pure $ MakeStaticRelation (attributes attributesRelA) emptyTupleSet
125 | otherwise -> do
264 | otherwise -> do
126− optimizedSubExpression <- applyStaticRelationalOptimization expr
265+ optSubExpr <- optimizeGraphRefRelationalExpr expr
127− case optimizedSubExpression of
128− Left err -> pure $ Left err
129− Right optSubExpr -> pure $ Right $ Restrict optimizedPredicate2 optSubExpr
266+ pure $ Restrict optimizedPredicate' optSubExpr
130
267
131−applyStaticRelationalOptimization e@(Equals _ _) = pure $ Right e
268+optimizeGraphRefRelationalExpr e@(Equals _ _) = pure e
132
269
133−applyStaticRelationalOptimization e@(NotEquals _ _) = pure $ Right e
270+optimizeGraphRefRelationalExpr e@(NotEquals _ _) = pure e
134
271
135−applyStaticRelationalOptimization e@(Extend _ _) = pure $ Right e
272+optimizeGraphRefRelationalExpr e@(Extend _ _) = pure e
136
273
137−applyStaticDatabaseOptimization :: DatabaseContextExpr -> DatabaseState (Either RelationalError DatabaseContextExpr)
274+optimizeGraphRefRelationalExpr e@(With _ _) = pure e
138−applyStaticDatabaseOptimization x@NoOperation = pure $ Right x
139−applyStaticDatabaseOptimization x@(Define _ _) = pure $ Right x
140
275
141−applyStaticDatabaseOptimization x@(Undefine _) = pure $ Right x
276+-- database context expr
277+optimizeGraphRefDatabaseContextExpr :: GraphRefDatabaseContextExpr -> GraphRefSOptDatabaseContextExprM GraphRefDatabaseContextExpr
278+optimizeGraphRefDatabaseContextExpr x@NoOperation = pure x
279+optimizeGraphRefDatabaseContextExpr x@(Define _ _) = pure x
142
280
143−applyStaticDatabaseOptimization (Assign name expr) = do
281+optimizeGraphRefDatabaseContextExpr x@(Undefine _) = pure x
144− context <- getStateContext
282+
145− let optimizedExpr = optimizeRelationalExpr context expr
283+optimizeGraphRefDatabaseContextExpr (Assign name expr) = do
146− case optimizedExpr of
284+ optExpr <- liftGraphRefRelExpr (fullOptimizeGraphRefRelationalExpr expr)
147− Left err -> pure $ Left err
285+ pure $ Assign name optExpr
148− Right optimizedExpr2 -> pure $ Right (Assign name optimizedExpr2)
149
286
150−applyStaticDatabaseOptimization (Insert targetName expr) = do
287+optimizeGraphRefDatabaseContextExpr (Insert targetName expr) = do
151− context <- getStateContext
288+ optimizedExpr <- liftGraphRefRelExpr (fullOptimizeGraphRefRelationalExpr expr)
152− let optimizedExpr = optimizeRelationalExpr context expr
153− case optimizedExpr of
154− Left err -> pure $ Left err
155− Right optimizedExpr2 -> if isEmptyRelationExpr optimizedExpr2 then -- if we are trying to insert an empty relation, do nothing
289+ if isEmptyRelationExpr optimizedExpr then -- if we are trying to insert an empty relation, do nothing
156− pure (Right NoOperation)
290+ pure NoOperation
157− else
291+ else
158− case optimizedExpr2 of
292+ case optimizedExpr of
159− -- if the target relvar and the insert relvar are the same, there is nothing to do
293+ -- if the target relvar and the insert relvar are the same, there is nothing to do
160− -- insert s s -> NoOperation
294+ -- insert s s -> NoOperation
161− RelationVariable insName () | insName == targetName -> pure (Right NoOperation)
295+ RelationVariable insName _ | insName == targetName -> pure NoOperation
162− _ -> pure $ Right (Insert targetName optimizedExpr2)
296+ _ -> pure (Insert targetName optimizedExpr)
163
297
164−applyStaticDatabaseOptimization (Delete name predicate) = do
298+optimizeGraphRefDatabaseContextExpr (Delete name predicate) =
165− context <- getStateContext
166− let optimizedPredicate = runReader (applyStaticPredicateOptimization predicate) (RelationalExprStateElems context)
299+ Delete name <$> liftGraphRefRelExpr (applyStaticPredicateOptimization predicate)
167− case optimizedPredicate of
168− Left err -> pure $ Left err
169− Right optimizedPredicate2 -> pure $ Right (Delete name optimizedPredicate2)
170
300
171−applyStaticDatabaseOptimization (Update name upmap predicate) = do
301+optimizeGraphRefDatabaseContextExpr (Update name upmap predicate) =
172− context <- getStateContext
173− let optimizedPredicate = runReader (applyStaticPredicateOptimization predicate) (RelationalExprStateElems context)
302+ Update name upmap <$> liftGraphRefRelExpr (applyStaticPredicateOptimization predicate)
174− case optimizedPredicate of
175− Left err -> pure $ Left err
176− Right optimizedPredicate2 -> pure $ Right (Update name upmap optimizedPredicate2)
177
303
178−applyStaticDatabaseOptimization dep@(AddInclusionDependency _ _) = pure $ Right dep
304+optimizeGraphRefDatabaseContextExpr dep@(AddInclusionDependency _ _) = pure dep
179
305
180−applyStaticDatabaseOptimization (RemoveInclusionDependency name) = pure $ Right (RemoveInclusionDependency name)
306+optimizeGraphRefDatabaseContextExpr (RemoveInclusionDependency name) = pure (RemoveInclusionDependency name)
181
307
182−applyStaticDatabaseOptimization (AddNotification name triggerExpr resultOldExpr resultNewExpr) = do
308+optimizeGraphRefDatabaseContextExpr (AddNotification name triggerExpr resultOldExpr resultNewExpr) =
183− context <- getStateContext
309+ --we can't optimize these expressions until they run
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))
310+ pure (AddNotification name triggerExpr resultOldExpr resultNewExpr)
189
311
190−applyStaticDatabaseOptimization notif@(RemoveNotification _) = pure (Right notif)
312+optimizeGraphRefDatabaseContextExpr notif@(RemoveNotification _) = pure notif
191
313
192−applyStaticDatabaseOptimization c@(AddTypeConstructor _ _) = pure (Right c)
314+optimizeGraphRefDatabaseContextExpr c@(AddTypeConstructor _ _) = pure c
193−applyStaticDatabaseOptimization c@(RemoveTypeConstructor _) = pure (Right c)
315+optimizeGraphRefDatabaseContextExpr c@(RemoveTypeConstructor _) = pure c
194−applyStaticDatabaseOptimization c@(RemoveAtomFunction _) = pure (Right c)
316+optimizeGraphRefDatabaseContextExpr c@(RemoveAtomFunction _) = pure c
195−applyStaticDatabaseOptimization c@(RemoveDatabaseContextFunction _) = pure (Right c)
317+optimizeGraphRefDatabaseContextExpr c@(RemoveDatabaseContextFunction _) = pure c
196−applyStaticDatabaseOptimization c@(ExecuteDatabaseContextFunction _ _) = pure (Right c)
318+optimizeGraphRefDatabaseContextExpr c@(ExecuteDatabaseContextFunction _ _) = pure c
197
319
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
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
199
321
200--applyStaticDatabaseOptimization (MultipleExpr exprs) = pure $ Right $ MultipleExpr exprs
322--applyStaticDatabaseOptimization (MultipleExpr exprs) = pure $ Right $ MultipleExpr exprs
201--for multiple expressions, we must evaluate
323--for multiple expressions, we must evaluate
202−applyStaticDatabaseOptimization (MultipleExpr exprs) = do
324+optimizeGraphRefDatabaseContextExpr (MultipleExpr exprs) = do
203− context <- getStateContext
204− let optExprs = evalState substateRunner (contextWithEmptyTupleSets context, M.empty, False)
205− let errors = lefts optExprs
206− if not (null errors) then
207− pure $ Left (head errors)
208− else
209− pure $ Right $ MultipleExpr (rights optExprs)
210− where
211− substateRunner = forM exprs $ \expr -> do
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
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
213− _ <- evalDatabaseContextExpr expr
326+ context <- askContext
214− applyStaticDatabaseOptimization expr
327+ graph <- askGraph
215− --this error handling could be improved with some lifting presumably
328+ parentId <- askTransId
216− --restore original context
329+
217−
330+ let emptyRvs ctx = ctx { relationVariables = mkEmptyRelVars (relationVariables ctx) }
218−applyStaticPredicateOptimization :: RestrictionPredicateExpr -> RelationalExprState (Either RelationalError RestrictionPredicateExpr)
331+ dbcEnv = mkDatabaseContextEvalEnv parentId graph
332+ folder (ctx, expracc) expr = do
333+ --optimize the expr and run it against empty relvars to add it to the context
334+ case runGraphRefSOptDatabaseContextExprM parentId ctx graph (optimizeGraphRefDatabaseContextExpr expr) of
335+ Left err -> throwError err
336+ Right optExpr ->
337+ case runDatabaseContextEvalMonad ctx dbcEnv (evalGraphRefDatabaseContextExpr optExpr) of
338+ Left err -> throwError err
339+ Right dbcState ->
340+ pure (emptyRvs $ dbc_context dbcState, expracc ++ [optExpr])
341+
342+ (_, exprs') <- foldM folder (context,[]) exprs
343+ pure (MultipleExpr exprs')
344+
345+applyStaticPredicateOptimization :: GraphRefRestrictionPredicateExpr -> GraphRefSOptRelationalExprM GraphRefRestrictionPredicateExpr
219applyStaticPredicateOptimization predi = do
346applyStaticPredicateOptimization predi = do
220− eOptPred <- case predi of
347+ optPred <- case predi of
221-- where x and x => where x
348-- where x and x => where x
222 AndPredicate pred1 pred2 -> do
349 AndPredicate pred1 pred2 -> do
223− eOptPred1 <- applyStaticPredicateOptimization pred1
350+ optPredA <- applyStaticPredicateOptimization pred1
224− case eOptPred1 of
225− Left err -> pure (Left err)
226− Right optPred1 -> do
227− eOptPred2 <- applyStaticPredicateOptimization pred2
351+ optPredB <- applyStaticPredicateOptimization pred2
228− case eOptPred2 of
352+ if optPredA == optPredB then
229− Left err -> pure (Left err)
353+ pure optPredA
230− Right optPred2 ->
231− if optPred1 == optPred2 then
232− pure (Right optPred1)
233− else
354+ else
234− pure (Right (AndPredicate optPred1 optPred2))
355+ pure (AndPredicate optPredA optPredB)
235-- where x or x => where x
356-- where x or x => where x
236 OrPredicate pred1 pred2 -> do
357 OrPredicate pred1 pred2 -> do
237− eOptPred1 <- applyStaticPredicateOptimization pred1
358+ optPredA <- applyStaticPredicateOptimization pred1
238− case eOptPred1 of
239− Left err -> pure (Left err)
240− Right optPred1 -> do
241− eOptPred2 <- applyStaticPredicateOptimization pred2
359+ optPredB <- applyStaticPredicateOptimization pred2
242− case eOptPred2 of
360+ if (optPredA == optPredB) || isTrueExpr optPredA then
243− Left err -> pure (Left err)
361+ pure optPredA
244− Right optPred2 | optPred1 == optPred2 -> pure (Right optPred1)
362+ else if isTrueExpr optPredB then
245− | isTrueExpr optPred1 -> pure (Right optPred1) -- True or x -> True
363+ pure optPredB
246− | isTrueExpr optPred2 -> pure (Right optPred2)
364+ else
247− | otherwise -> pure (Right (OrPredicate optPred1 optPred2))
365+ pure (OrPredicate optPredA optPredB)
248 AttributeEqualityPredicate attrNameA (AttributeAtomExpr attrNameB) ->
366 AttributeEqualityPredicate attrNameA (AttributeAtomExpr attrNameB) ->
249 if attrNameA == attrNameB then
367 if attrNameA == attrNameB then
250− pure (Right TruePredicate)
368+ pure TruePredicate
251 else
369 else
252− pure (Right predi)
370+ pure predi
253− AttributeEqualityPredicate{} -> pure (Right predi)
371+ AttributeEqualityPredicate{} -> pure predi
254− TruePredicate -> pure $ Right predi
372+ TruePredicate -> pure predi
255− NotPredicate{} -> pure $ Right predi
373+ NotPredicate{} -> pure predi
256− RelationalExprPredicate{} -> pure (Right predi)
374+ RelationalExprPredicate{} -> pure predi
257− AtomExprPredicate{} -> pure (Right predi)
375+ AtomExprPredicate{} -> pure predi
258− case eOptPred of
259− Left err -> pure (Left err)
260− Right optPred ->
261− let attrMap = findStaticRestrictionPredicates optPred in
376+ let attrMap = findStaticRestrictionPredicates optPred
262− pure (Right (replaceStaticAtomExprs optPred attrMap))
377+ pure (replaceStaticAtomExprs optPred attrMap)
263
378
264--determines if an atom expression is tautologically true
379--determines if an atom expression is tautologically true
265−isTrueExpr :: RestrictionPredicateExpr -> Bool
380+isTrueExpr :: RestrictionPredicateExprBase a -> Bool
266isTrueExpr TruePredicate = True
381isTrueExpr TruePredicate = True
267isTrueExpr (AtomExprPredicate (NakedAtomExpr (BoolAtom True))) = True
382isTrueExpr (AtomExprPredicate (NakedAtomExpr (BoolAtom True))) = True
268isTrueExpr _ = False
383isTrueExpr _ = False
269
384
270--determines if an atom expression is tautologically false
385--determines if an atom expression is tautologically false
271−isFalseExpr :: RestrictionPredicateExpr -> Bool
386+isFalseExpr :: RestrictionPredicateExprBase a -> Bool
272isFalseExpr (NotPredicate expr) = isTrueExpr expr
387isFalseExpr (NotPredicate expr) = isTrueExpr expr
273isFalseExpr (AtomExprPredicate (NakedAtomExpr (BoolAtom False))) = True
388isFalseExpr (AtomExprPredicate (NakedAtomExpr (BoolAtom False))) = True
274isFalseExpr _ = False
389isFalseExpr _ = False
275
390
276-- determine if the created relation can statically be determined to be empty
391-- determine if the created relation can statically be determined to be empty
277−isEmptyRelationExpr :: RelationalExpr -> Bool
392+isEmptyRelationExpr :: RelationalExprBase a -> Bool
278−isEmptyRelationExpr (MakeRelationFromExprs _ []) = True
393+isEmptyRelationExpr (MakeRelationFromExprs _ (TupleExprs _ [])) = True
279isEmptyRelationExpr (MakeStaticRelation _ tupSet) = null (asList tupSet)
394isEmptyRelationExpr (MakeStaticRelation _ tupSet) = null (asList tupSet)
280isEmptyRelationExpr (ExistingRelation rel) = rel == emptyRelationWithAttrs (attributes rel)
395isEmptyRelationExpr (ExistingRelation rel) = rel == emptyRelationWithAttrs (attributes rel)
281isEmptyRelationExpr _ = False
396isEmptyRelationExpr _ = False
282
397
283--transitive static variable optimization
398--transitive static variable optimization
284−replaceStaticAtomExprs :: RestrictionPredicateExpr -> M.Map AttributeName AtomExpr -> RestrictionPredicateExpr
399+replaceStaticAtomExprs :: GraphRefRestrictionPredicateExpr -> M.Map AttributeName GraphRefAtomExpr -> GraphRefRestrictionPredicateExpr
285replaceStaticAtomExprs predIn replaceMap = case predIn of
400replaceStaticAtomExprs predIn replaceMap = case predIn of
286 AttributeEqualityPredicate newAttrName (AttributeAtomExpr matchName) -> case M.lookup matchName replaceMap of
401 AttributeEqualityPredicate newAttrName (AttributeAtomExpr matchName) -> case M.lookup matchName replaceMap of
287 Nothing -> predIn
402 Nothing -> predIn
@@ -294,7 +409,7 @@ replaceStaticAtomExprs predIn replaceMap = case predIn of
294 RelationalExprPredicate{} -> predIn
409 RelationalExprPredicate{} -> predIn
295 AtomExprPredicate{} -> predIn
410 AtomExprPredicate{} -> predIn
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
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
297−findStaticRestrictionPredicates :: RestrictionPredicateExpr -> M.Map AttributeName AtomExpr
412+findStaticRestrictionPredicates :: GraphRefRestrictionPredicateExpr -> M.Map AttributeName GraphRefAtomExpr
298findStaticRestrictionPredicates (AttributeEqualityPredicate attrName atomExpr) =
413findStaticRestrictionPredicates (AttributeEqualityPredicate attrName atomExpr) =
299 case atomExpr of
414 case atomExpr of
300 val@NakedAtomExpr{} -> M.singleton attrName val
415 val@NakedAtomExpr{} -> M.singleton attrName val
@@ -318,66 +433,72 @@ isStaticAtomExpr FunctionAtomExpr{} = False
318isStaticAtomExpr RelationAtomExpr{} = False
433isStaticAtomExpr RelationAtomExpr{} = False
319
434
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
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
321−applyStaticJoinElimination :: RelationalExpr -> RelationalExprState (Either RelationalError RelationalExpr)
436+applyStaticJoinElimination :: GraphRefRelationalExpr -> GraphRefSOptRelationalExprM GraphRefRelationalExpr
322applyStaticJoinElimination expr@(Project attrNameSet (Join exprA exprB)) = do
437applyStaticJoinElimination expr@(Project attrNameSet (Join exprA exprB)) = do
323− relState <- ask
438+ graph <- askGraph
324− eProjType <- typeForRelationalExpr expr
439+ case inSameTransaction exprA exprB of
325− eTypeA <- typeForRelationalExpr exprA
440+ -- the sub exprs are in different transactions or none at all, so we cannot extract inclusion dependencies across transaction boundaries
326− eTypeB <- typeForRelationalExpr exprB
441+ Nothing -> pure expr
327− case eProjType of
442+ Just marker -> do
328− Left err -> pure (Left err)
443+ commonContext <- case marker of
329− Right projType ->
444+ UncommittedContextMarker -> askContext
330− case eTypeA of
445+ TransactionMarker tid -> concreteDatabaseContext <$> lift (except (transactionForId tid graph))
331− Left err -> pure (Left err)
446+ let typeForExpr e = lift $ except $ runGraphRefRelationalExprM gfEnv (typeForGraphRefRelationalExpr e)
332− Right typeA ->
447+ gfEnv = freshGraphRefRelationalExprEnv (Just commonContext) graph
333− case eTypeB of
448+
334− Left err -> pure (Left err)
449+ projType <- typeForExpr expr
335− Right typeB -> do
450+ typeA <- typeForExpr exprA
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
464+ --lookup transaction
348− --scan inclusion dependencies for a foreign key relationship
465+ --scan inclusion dependencies for a foreign key relationship
349− incDeps <- inclusionDependencies . stateElemsContext <$> ask
466+ let incDeps = inclusionDependencies commonContext
350− let fkConstraint = foldM isFkConstraint False incDeps
467+ fkConstraint = foldM isFkConstraint False incDeps
351− --search for matching fk constraint
468+ --search for matching fk constraint
352− isFkConstraint acc (InclusionDependency (Project subattrNames subrv) (Project _ superrv)) =
469+ isFkConstraint acc (InclusionDependency (Project subAttrNames subrv) (Project _ superrv)) = do
353− case runReader (evalAttributeNames subattrNames expr) relState of
470+ let gfSubAttrNames = processM (processAttributeNames subAttrNames)
471+ gfSubRv = processM (processRelationalExpr subrv)
472+ gfSuperRv = processM (processRelationalExpr superrv)
473+ processM = runProcessExprM marker
474+ case runGraphRefRelationalExprM gfEnv (evalGraphRefAttributeNames gfSubAttrNames expr) of
354− Left _ -> pure acc
475+ Left _ -> pure acc
355− Right subAttrNameSet ->
476+ Right subAttrNameSet ->
356− pure (acc || (joinedExpr == subrv &&
477+ pure (acc || (joinedExpr == gfSubRv &&
357− unjoinedExpr == superrv &&
478+ unjoinedExpr == gfSuperRv &&
358− -- the fk attribute is one of the projection attributes
479+ -- the fk attribute is one of the projection attributes
359− A.attributeNamesContained subAttrNameSet (A.attributeNameSet (attributes joinedType))
480+ A.attributeNamesContained subAttrNameSet (A.attributeNameSet (attributes joinedType))
360 ))
481 ))
361− isFkConstraint acc _ = pure acc
482+ isFkConstraint acc _ = pure acc
362− case fkConstraint of
483+ case fkConstraint of
363− Right True -> --join elimination optimization applies
484+ Right True -> --join elimination optimization applies
364− applyStaticRelationalOptimization (Project attrNameSet joinedExpr)
485+ optimizeGraphRefRelationalExpr (Project attrNameSet joinedExpr)
365− Right False -> --join elimination optimization does not apply
486+ Right False -> --join elimination optimization does not apply
366− pure (Right expr)
487+ pure expr
367− Left err ->
488+ Left err -> throwError err
368− pure (Left err)
369
489
370−applyStaticJoinElimination expr = pure (Right expr)
490+applyStaticJoinElimination expr = pure expr
371
491
372--restriction collapse converts chained restrictions into (Restrict (And pred1 pred2 pred3...))
492--restriction collapse converts chained restrictions into (Restrict (And pred1 pred2 pred3...))
373 --this optimization should be fairly uncontroversial- performing a tuple scan once is cheaper than twice- parallelization can still take place
493 --this optimization should be fairly uncontroversial- performing a tuple scan once is cheaper than twice- parallelization can still take place
374−applyStaticRestrictionCollapse :: RelationalExpr -> RelationalExpr
494+applyStaticRestrictionCollapse :: GraphRefRelationalExpr -> GraphRefRelationalExpr
375applyStaticRestrictionCollapse expr =
495applyStaticRestrictionCollapse expr =
376 case expr of
496 case expr of
377 MakeRelationFromExprs _ _ -> expr
497 MakeRelationFromExprs _ _ -> expr
378 MakeStaticRelation _ _ -> expr
498 MakeStaticRelation _ _ -> expr
379 ExistingRelation _ -> expr
499 ExistingRelation _ -> expr
380 RelationVariable _ _ -> expr
500 RelationVariable _ _ -> expr
501+ With _ _ -> expr
381 Project attrs subexpr ->
502 Project attrs subexpr ->
382 Project attrs (applyStaticRestrictionCollapse subexpr)
503 Project attrs (applyStaticRestrictionCollapse subexpr)
383 Union sub1 sub2 ->
504 Union sub1 sub2 ->
@@ -407,19 +528,20 @@ applyStaticRestrictionCollapse expr =
407 andPreds = foldr (\(Restrict subpred _) acc -> AndPredicate acc subpred) firstPred (tail restrictions) in
528 andPreds = foldr (\(Restrict subpred _) acc -> AndPredicate acc subpred) firstPred (tail restrictions) in
408 Restrict andPreds optFinalExpr
529 Restrict andPreds optFinalExpr
409
530
410−sequentialRestrictions :: RelationalExpr -> [RelationalExpr]
531+sequentialRestrictions :: RelationalExprBase a -> [RelationalExprBase a]
411sequentialRestrictions expr@(Restrict _ subexpr) = expr:sequentialRestrictions subexpr
532sequentialRestrictions expr@(Restrict _ subexpr) = expr:sequentialRestrictions subexpr
412sequentialRestrictions _ = []
533sequentialRestrictions _ = []
413
534
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
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
415-- x{proj} where c1 -> (x where c1){proj} #project on fewer tuples
536-- x{proj} where c1 -> (x where c1){proj} #project on fewer tuples
416-- (x union y) where c -> (x where c) union (y where c) #with a selective restriction, fewer tuples will need to be joined
537-- (x union y) where c -> (x where c) union (y where c) #with a selective restriction, fewer tuples will need to be joined
417−applyStaticRestrictionPushdown :: RelationalExpr -> RelationalExpr
538+applyStaticRestrictionPushdown :: GraphRefRelationalExpr -> GraphRefRelationalExpr
418applyStaticRestrictionPushdown expr = case expr of
539applyStaticRestrictionPushdown expr = case expr of
419 MakeRelationFromExprs _ _ -> expr
540 MakeRelationFromExprs _ _ -> expr
420 MakeStaticRelation _ _ -> expr
541 MakeStaticRelation _ _ -> expr
421 ExistingRelation _ -> expr
542 ExistingRelation _ -> expr
422 RelationVariable _ _ -> expr
543 RelationVariable _ _ -> expr
544+ With _ _ -> expr
423 Project _ _ -> expr
545 Project _ _ -> expr
424 --this transformation cannot be inverted because the projection attributes might not exist in the inverted version
546 --this transformation cannot be inverted because the projection attributes might not exist in the inverted version
425 Restrict restrictAttrs (Project projAttrs subexpr) ->
547 Restrict restrictAttrs (Project projAttrs subexpr) ->
@@ -450,4 +572,7 @@ applyStaticRestrictionPushdown expr = case expr of
450 Extend n sub ->
572 Extend n sub ->
451 Extend n (applyStaticRestrictionPushdown sub)
573 Extend n (applyStaticRestrictionPushdown sub)
452
574
453−
575+-- no optimizations available
576+optimizeDatabaseContextIOExpr :: GraphRefDatabaseContextIOExpr -> GraphRefSOptDatabaseContextExprM GraphRefDatabaseContextIOExpr
577+optimizeDatabaseContextIOExpr = pure
578+
src/lib/ProjectM36/TransGraphRelationalExpression.hs+135−130
@@ -1,175 +1,180 @@
1−{-# LANGUAGE TypeSynonymInstances, FlexibleInstances #-}
1+{-# LANGUAGE 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
9import ProjectM36.Error
7import ProjectM36.Error
10−import ProjectM36.Tuple
11−import ProjectM36.AtomType
12import qualified Data.Map as M
8import qualified Data.Map as M
13import Control.Monad.Trans.Reader
9import Control.Monad.Trans.Reader
14−import Data.Binary
10+import Control.Monad.Trans.Class
11+import Control.Monad.Trans.Except
12+import Data.Functor.Identity
15
13
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).
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).
17type TransGraphRelationalExpr = RelationalExprBase TransactionIdLookup
15type TransGraphRelationalExpr = RelationalExprBase TransactionIdLookup
18
16
19−instance Binary TransGraphRelationalExpr
20−
21type TransGraphAttributeNames = AttributeNamesBase TransactionIdLookup
17type TransGraphAttributeNames = AttributeNamesBase TransactionIdLookup
22
18
23−instance Binary TransGraphAttributeNames
24−
25type TransGraphExtendTupleExpr = ExtendTupleExprBase TransactionIdLookup
19type TransGraphExtendTupleExpr = ExtendTupleExprBase TransactionIdLookup
26
20
27−instance Binary TransGraphExtendTupleExpr
28−
29type TransGraphTupleExpr = TupleExprBase TransactionIdLookup
21type TransGraphTupleExpr = TupleExprBase TransactionIdLookup
30
22
31−instance Binary TransGraphTupleExpr
23+type TransGraphTupleExprs = TupleExprsBase TransactionIdLookup
32
24
33type TransGraphRestrictionPredicateExpr = RestrictionPredicateExprBase TransactionIdLookup
25type TransGraphRestrictionPredicateExpr = RestrictionPredicateExprBase TransactionIdLookup
34
26
35−instance Binary TransGraphRestrictionPredicateExpr
36−
37type TransGraphAtomExpr = AtomExprBase TransactionIdLookup
27type TransGraphAtomExpr = AtomExprBase TransactionIdLookup
38
28
39−instance Binary TransGraphAtomExpr
40−
41type TransGraphAttributeExpr = AttributeExprBase TransactionIdLookup
29type TransGraphAttributeExpr = AttributeExprBase TransactionIdLookup
42
30
31+type TransGraphWithNameExpr = WithNameExprBase TransactionIdLookup
32+
33+newtype TransGraphEvalEnv = TransGraphEvalEnv {
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+
48+findTransId :: TransactionIdLookup -> TransGraphEvalMonad GraphRefTransactionMarker
49+findTransId tlook = TransactionMarker . transactionId <$> findTrans tlook
50+
51+findTrans :: TransactionIdLookup -> TransGraphEvalMonad Transaction
52+findTrans tlook = do
53+ graph <- askGraph
54+ liftE $ lookupTransaction graph tlook
55+
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.
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.
44−evalTransGraphRelationalExpr :: TransGraphRelationalExpr -> TransactionGraph -> Either RelationalError RelationalExpr
57+processTransGraphRelationalExpr :: TransGraphRelationalExpr -> TransGraphEvalMonad GraphRefRelationalExpr
45−evalTransGraphRelationalExpr (MakeRelationFromExprs mAttrExprs tupleExprs) graph = do
58+processTransGraphRelationalExpr (MakeRelationFromExprs mAttrExprs tupleExprs) = do
46− tupleExprs' <- mapM (evalTransGraphTupleExpr graph) tupleExprs
59+ tupleExprs' <- processTransGraphTupleExprs tupleExprs
47 case mAttrExprs of
60 case mAttrExprs of
48 Nothing -> pure (MakeRelationFromExprs Nothing tupleExprs')
61 Nothing -> pure (MakeRelationFromExprs Nothing tupleExprs')
49 Just attrExprs -> do
62 Just attrExprs -> do
50− attrExprs' <- mapM (evalTransGraphAttributeExpr graph) attrExprs
63+ attrExprs' <- mapM processTransGraphAttributeExpr attrExprs
51 pure (MakeRelationFromExprs (Just attrExprs') tupleExprs')
64 pure (MakeRelationFromExprs (Just attrExprs') tupleExprs')
52−evalTransGraphRelationalExpr (MakeStaticRelation attrs tupSet) _ = pure (MakeStaticRelation attrs tupSet)
65+processTransGraphRelationalExpr (MakeStaticRelation attrs tupSet) = pure (MakeStaticRelation attrs tupSet)
53−evalTransGraphRelationalExpr (ExistingRelation rel) _ = pure (ExistingRelation rel)
66+processTransGraphRelationalExpr (ExistingRelation rel) = pure (ExistingRelation rel)
54−evalTransGraphRelationalExpr (RelationVariable rvname transLookup) graph = do
67+processTransGraphRelationalExpr (RelationVariable rvname transLookup) =
55− trans <- lookupTransaction graph transLookup
68+ RelationVariable rvname <$> findTransId transLookup
56− rel <- runReader (evalRelationalExpr (RelationVariable rvname ())) (RelationalExprStateElems (concreteDatabaseContext trans))
57− pure (ExistingRelation rel)
58−evalTransGraphRelationalExpr (Project transAttrNames expr) graph = do
69+processTransGraphRelationalExpr (Project transAttrNames expr) =
59− expr' <- evalTransGraphRelationalExpr expr graph
70+ Project <$> processTransGraphAttributeNames transAttrNames <*> processTransGraphRelationalExpr expr
60− attrNames <- evalTransAttributeNames transAttrNames graph
71+processTransGraphRelationalExpr (Union exprA exprB) =
61− pure (Project attrNames expr')
72+ Union <$> processTransGraphRelationalExpr exprA <*> processTransGraphRelationalExpr exprB
62−evalTransGraphRelationalExpr (Union exprA exprB) graph = do
73+processTransGraphRelationalExpr (Join exprA exprB) =
63− exprA' <- evalTransGraphRelationalExpr exprA graph
74+ Join <$> processTransGraphRelationalExpr exprA <*> processTransGraphRelationalExpr exprB
64− exprB' <- evalTransGraphRelationalExpr exprB graph
65− pure (Union exprA' exprB')
66−evalTransGraphRelationalExpr (Join exprA exprB) graph = do
67− exprA' <- evalTransGraphRelationalExpr exprA graph
68− exprB' <- evalTransGraphRelationalExpr exprB graph
69− pure (Join exprA' exprB')
70−evalTransGraphRelationalExpr (Rename attrName1 attrName2 expr) graph = do
75+processTransGraphRelationalExpr (Rename attrName1 attrName2 expr) =
71− let expr' = evalTransGraphRelationalExpr expr graph
72− Rename attrName1 attrName2 <$> expr'
76+ Rename attrName1 attrName2 <$> processTransGraphRelationalExpr expr
73−evalTransGraphRelationalExpr (Difference exprA exprB) graph = do
77+processTransGraphRelationalExpr (Difference exprA exprB) =
74− exprA' <- evalTransGraphRelationalExpr exprA graph
78+ Difference <$> processTransGraphRelationalExpr exprA <*> processTransGraphRelationalExpr exprB
75− exprB' <- evalTransGraphRelationalExpr exprB graph
76− pure (Difference exprA' exprB')
77−evalTransGraphRelationalExpr (Group transAttrNames attrName expr) graph = do
79+processTransGraphRelationalExpr (Group transAttrNames attrName expr) =
78− expr' <- evalTransGraphRelationalExpr expr graph
80+ Group <$>
79− attrNames <- evalTransAttributeNames transAttrNames graph
81+ processTransGraphAttributeNames transAttrNames <*>
80− pure (Group attrNames attrName expr')
82+ pure attrName <*>
81−evalTransGraphRelationalExpr (Ungroup attrName expr) graph = do
83+ processTransGraphRelationalExpr expr
82− let expr' = evalTransGraphRelationalExpr expr graph
84+processTransGraphRelationalExpr (Ungroup attrName expr) =
83− Ungroup attrName <$> expr'
85+ Ungroup attrName <$> processTransGraphRelationalExpr expr
84−evalTransGraphRelationalExpr (Restrict predicateExpr expr) graph = do
86+processTransGraphRelationalExpr (Restrict predicateExpr expr) =
85− expr' <- evalTransGraphRelationalExpr expr graph
86− predicateExpr' <- evalTransGraphRestrictionPredicateExpr predicateExpr graph
87+ Restrict <$> evalTransGraphRestrictionPredicateExpr predicateExpr <*>
87− pure (Restrict predicateExpr' expr')
88+ processTransGraphRelationalExpr expr
88−evalTransGraphRelationalExpr (Equals exprA exprB) graph = do
89+processTransGraphRelationalExpr (Equals exprA exprB) = do
89− exprA' <- evalTransGraphRelationalExpr exprA graph
90+ exprA' <- processTransGraphRelationalExpr exprA
90− exprB' <- evalTransGraphRelationalExpr exprB graph
91+ exprB' <- processTransGraphRelationalExpr exprB
91 pure (Equals exprA' exprB')
92 pure (Equals exprA' exprB')
92−evalTransGraphRelationalExpr (NotEquals exprA exprB) graph = do
93+processTransGraphRelationalExpr (NotEquals exprA exprB) = do
93− exprA' <- evalTransGraphRelationalExpr exprA graph
94+ exprA' <- processTransGraphRelationalExpr exprA
94− exprB' <- evalTransGraphRelationalExpr exprB graph
95+ exprB' <- processTransGraphRelationalExpr exprB
95 pure (NotEquals exprA' exprB')
96 pure (NotEquals exprA' exprB')
96−evalTransGraphRelationalExpr (Extend extendExpr expr) graph = do
97+processTransGraphRelationalExpr (Extend extendExpr expr) = do
97− extendExpr' <- evalTransGraphExtendTupleExpr extendExpr graph
98+ extendExpr' <- processTransGraphExtendTupleExpr extendExpr
98− expr' <- evalTransGraphRelationalExpr expr graph
99+ expr' <- processTransGraphRelationalExpr expr
99 pure (Extend extendExpr' expr')
100 pure (Extend extendExpr' expr')
100−
101+processTransGraphRelationalExpr (With views expr) = do
101−evalTransGraphTupleExpr :: TransactionGraph -> TransGraphTupleExpr -> Either RelationalError TupleExpr
102+ evaldViews <- mapM (\(wnexpr, vexpr) -> do
103+ wnexpr' <- processTransGraphWithNameExpr wnexpr
104+ vexpr' <- processTransGraphRelationalExpr vexpr
105+ pure (wnexpr', vexpr')
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
102−evalTransGraphTupleExpr graph (TupleExpr attrMap) = do
115+processTransGraphTupleExpr (TupleExpr attrMap) = do
103 let attrAssoc = mapM (\(attrName, atomExpr) -> do
116 let attrAssoc = mapM (\(attrName, atomExpr) -> do
104− aExpr <- evalTransGraphAtomExpr graph atomExpr
117+ aExpr <- processTransGraphAtomExpr atomExpr
105 pure (attrName, aExpr)
118 pure (attrName, aExpr)
106 ) (M.toList attrMap)
119 ) (M.toList attrMap)
107 TupleExpr . M.fromList <$> attrAssoc
120 TupleExpr . M.fromList <$> attrAssoc
108
121
109−evalTransGraphAtomExpr :: TransactionGraph -> TransGraphAtomExpr -> Either RelationalError AtomExpr
122+processTransGraphAtomExpr :: TransGraphAtomExpr -> TransGraphEvalMonad GraphRefAtomExpr
110−evalTransGraphAtomExpr _ (AttributeAtomExpr aname) = pure $ AttributeAtomExpr aname
123+processTransGraphAtomExpr (AttributeAtomExpr aname) = pure $ AttributeAtomExpr aname
111−evalTransGraphAtomExpr _ (NakedAtomExpr atom) = pure $ NakedAtomExpr atom
124+processTransGraphAtomExpr (NakedAtomExpr atom) = pure $ NakedAtomExpr atom
112−evalTransGraphAtomExpr graph (FunctionAtomExpr funcName args tLookup) = do
125+processTransGraphAtomExpr (FunctionAtomExpr funcName args tLookup) =
113− trans <- lookupTransaction graph tLookup
126+ FunctionAtomExpr funcName <$> mapM processTransGraphAtomExpr args <*> findTransId tLookup
114− --I can't return a FunctionAtomExpr because the function needs to be resolved at a specific context
115− args' <- mapM (evalTransGraphAtomExpr graph) args
116− atom <- runReader (evalAtomExpr emptyTuple (FunctionAtomExpr funcName args' ())) (RelationalExprStateElems (concreteDatabaseContext trans))
117− pure (NakedAtomExpr atom)
118−evalTransGraphAtomExpr graph (RelationAtomExpr expr) = do
127+processTransGraphAtomExpr (RelationAtomExpr expr) =
119− let expr' = evalTransGraphRelationalExpr expr graph
120− RelationAtomExpr <$> expr'
128+ RelationAtomExpr <$> processTransGraphRelationalExpr expr
121−evalTransGraphAtomExpr graph (ConstructedAtomExpr dConsName args tLookup) = do
129+processTransGraphAtomExpr (ConstructedAtomExpr dConsName args tLookup) =
122− trans <- lookupTransaction graph tLookup
130+ ConstructedAtomExpr dConsName <$> mapM processTransGraphAtomExpr args <*> findTransId 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
131+evalTransGraphRestrictionPredicateExpr :: TransGraphRestrictionPredicateExpr -> TransGraphEvalMonad GraphRefRestrictionPredicateExpr
128−evalTransGraphRestrictionPredicateExpr TruePredicate _ = pure TruePredicate
132+evalTransGraphRestrictionPredicateExpr TruePredicate = pure TruePredicate
129−evalTransGraphRestrictionPredicateExpr (AndPredicate exprA exprB) graph = do
133+evalTransGraphRestrictionPredicateExpr (AndPredicate exprA exprB) = do
130− exprA' <- evalTransGraphRestrictionPredicateExpr exprA graph
134+ exprA' <- evalTransGraphRestrictionPredicateExpr exprA
131− exprB' <- evalTransGraphRestrictionPredicateExpr exprB graph
135+ exprB' <- evalTransGraphRestrictionPredicateExpr exprB
132 pure (AndPredicate exprA' exprB')
136 pure (AndPredicate exprA' exprB')
133−evalTransGraphRestrictionPredicateExpr (OrPredicate exprA exprB) graph = do
137+evalTransGraphRestrictionPredicateExpr (OrPredicate exprA exprB) = do
134− exprA' <- evalTransGraphRestrictionPredicateExpr exprA graph
138+ exprA' <- evalTransGraphRestrictionPredicateExpr exprA
135− exprB' <- evalTransGraphRestrictionPredicateExpr exprB graph
139+ exprB' <- evalTransGraphRestrictionPredicateExpr exprB
136 pure (OrPredicate exprA' exprB')
140 pure (OrPredicate exprA' exprB')
137−evalTransGraphRestrictionPredicateExpr (NotPredicate expr) graph = do
141+evalTransGraphRestrictionPredicateExpr (NotPredicate expr) = do
138− let expr' = evalTransGraphRestrictionPredicateExpr expr graph
142+ let expr' = evalTransGraphRestrictionPredicateExpr expr
139 NotPredicate <$> expr'
143 NotPredicate <$> expr'
140−evalTransGraphRestrictionPredicateExpr (RelationalExprPredicate expr) graph = do
144+evalTransGraphRestrictionPredicateExpr (RelationalExprPredicate expr) = do
141− let expr' = evalTransGraphRelationalExpr expr graph
145+ let expr' = processTransGraphRelationalExpr expr
142 RelationalExprPredicate <$> expr'
146 RelationalExprPredicate <$> expr'
143−evalTransGraphRestrictionPredicateExpr (AtomExprPredicate expr) graph = do
147+evalTransGraphRestrictionPredicateExpr (AtomExprPredicate expr) = do
144− let expr' = evalTransGraphAtomExpr graph expr
148+ let expr' = processTransGraphAtomExpr expr
145 AtomExprPredicate <$> expr'
149 AtomExprPredicate <$> expr'
146−evalTransGraphRestrictionPredicateExpr (AttributeEqualityPredicate attrName expr) graph = do
150+evalTransGraphRestrictionPredicateExpr (AttributeEqualityPredicate attrName expr) = do
147− let expr' = evalTransGraphAtomExpr graph expr
151+ let expr' = processTransGraphAtomExpr expr
148 AttributeEqualityPredicate attrName <$> expr'
152 AttributeEqualityPredicate attrName <$> expr'
149
153
150−evalTransGraphExtendTupleExpr :: TransGraphExtendTupleExpr -> TransactionGraph -> Either RelationalError ExtendTupleExpr
154+processTransGraphExtendTupleExpr :: TransGraphExtendTupleExpr -> TransGraphEvalMonad GraphRefExtendTupleExpr
151−evalTransGraphExtendTupleExpr (AttributeExtendTupleExpr attrName expr) graph = do
155+processTransGraphExtendTupleExpr (AttributeExtendTupleExpr attrName expr) =
152− let expr' = evalTransGraphAtomExpr graph expr
153− AttributeExtendTupleExpr attrName <$> expr'
156+ AttributeExtendTupleExpr attrName <$> processTransGraphAtomExpr expr
154−
157+
155−evalTransGraphAttributeExpr :: TransactionGraph -> TransGraphAttributeExpr -> Either RelationalError AttributeExpr
158+processTransGraphAttributeExpr :: TransGraphAttributeExpr -> TransGraphEvalMonad GraphRefAttributeExpr
156−evalTransGraphAttributeExpr graph (AttributeAndTypeNameExpr attrName tCons tLookup) = do
159+processTransGraphAttributeExpr (AttributeAndTypeNameExpr attrName tCons tLookup) =
157− trans <- lookupTransaction graph tLookup
160+ AttributeAndTypeNameExpr attrName tCons <$> findTransId tLookup
158− aType <- atomTypeForTypeConstructor tCons (typeConstructorMapping (concreteDatabaseContext trans)) M.empty
159− pure (NakedAttributeExpr (Attribute attrName aType))
160−evalTransGraphAttributeExpr _ (NakedAttributeExpr attr) = pure (NakedAttributeExpr attr)
161+processTransGraphAttributeExpr (NakedAttributeExpr attr) = pure (NakedAttributeExpr attr)
161−
162+
162−evalTransAttributeNames :: TransGraphAttributeNames -> TransactionGraph -> Either RelationalError AttributeNames
163+processTransGraphAttributeNames :: TransGraphAttributeNames -> TransGraphEvalMonad GraphRefAttributeNames
163−evalTransAttributeNames (AttributeNames names) _ = Right (AttributeNames names)
164+processTransGraphAttributeNames (AttributeNames names) = pure (AttributeNames names)
164−evalTransAttributeNames (InvertedAttributeNames names) _ = Right (InvertedAttributeNames names)
165+processTransGraphAttributeNames (InvertedAttributeNames names) = pure (InvertedAttributeNames names)
165−evalTransAttributeNames (UnionAttributeNames namesA namesB) graph = do
166+processTransGraphAttributeNames (UnionAttributeNames namesA namesB) = do
166− nA <- evalTransAttributeNames namesA graph
167+ nA <- processTransGraphAttributeNames namesA
167− nB <- evalTransAttributeNames namesB graph
168+ nB <- processTransGraphAttributeNames namesB
168− Right (UnionAttributeNames nA nB)
169+ pure (UnionAttributeNames nA nB)
169−evalTransAttributeNames (IntersectAttributeNames namesA namesB) graph = do
170+processTransGraphAttributeNames (IntersectAttributeNames namesA namesB) = do
170− nA <- evalTransAttributeNames namesA graph
171+ nA <- processTransGraphAttributeNames namesA
171− nB <- evalTransAttributeNames namesB graph
172+ nB <- processTransGraphAttributeNames namesB
172− Right (IntersectAttributeNames nA nB)
173+ pure (IntersectAttributeNames nA nB)
173−evalTransAttributeNames (RelationalExprAttributeNames expr) graph = do
174+processTransGraphAttributeNames (RelationalExprAttributeNames expr) = do
174− evaldExpr <- evalTransGraphRelationalExpr expr graph
175+ evaldExpr <- processTransGraphRelationalExpr expr
175− Right (RelationalExprAttributeNames evaldExpr)
176+ pure (RelationalExprAttributeNames evaldExpr)
177+
178+processTransGraphWithNameExpr :: TransGraphWithNameExpr -> TransGraphEvalMonad GraphRefWithNameExpr
179+processTransGraphWithNameExpr (WithNameExpr rvname tlookup) =
180+ WithNameExpr rvname <$> findTransId tlookup
src/lib/ProjectM36/Transaction.hs+24−16
@@ -3,28 +3,24 @@ 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
6
7
7−transactionTimestamp :: Transaction -> UTCTime
8+parentIds :: Transaction -> S.Set TransactionId
8−transactionTimestamp (Transaction _ (TransactionInfo _ _ stamp) _) = stamp
9+parentIds (Transaction _ tinfo _) = S.fromList (NE.toList (parents tinfo))
9−transactionTimestamp (Transaction _ (MergeTransactionInfo _ _ _ stamp) _) = stamp
10
10
11−transactionParentIds :: Transaction -> S.Set TransactionId
11+rootParent :: TransactionParents
12−transactionParentIds (Transaction _ (TransactionInfo pId _ _) _) = S.singleton pId
12+rootParent = singleParent U.nil
13−transactionParentIds (Transaction _ (MergeTransactionInfo pId1 pId2 _ _) _) = S.fromList [pId1, pId2]
14
13
15−transactionChildIds :: Transaction -> S.Set TransactionId
14+singleParent :: TransactionId -> TransactionParents
16−transactionChildIds (Transaction _ (TransactionInfo _ children _) _) = children
15+singleParent tid = tid NE.:| []
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'
23
16
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.
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.
25filterTransactionInfoTransactions :: S.Set TransactionId -> TransactionInfo -> TransactionInfo
18filterTransactionInfoTransactions :: S.Set TransactionId -> TransactionInfo -> TransactionInfo
26−filterTransactionInfoTransactions filterIds (TransactionInfo parentId childIds stamp) = TransactionInfo (filterParent parentId filterIds) (S.intersection childIds filterIds) stamp
19+filterTransactionInfoTransactions filterIds tinfo =
27−filterTransactionInfoTransactions filterIds (MergeTransactionInfo parentIdA parentIdB childIds stamp) = MergeTransactionInfo (filterParent parentIdA filterIds) (filterParent parentIdB filterIds) (S.intersection childIds filterIds) stamp
20+ tinfo { parents = case
21+ NE.filter (`S.member` filterIds) (parents tinfo) of
22+ [] -> rootParent
23+ xs -> NE.fromList xs}
28
24
29filterParent :: TransactionId -> S.Set TransactionId -> TransactionId
25filterParent :: TransactionId -> S.Set TransactionId -> TransactionId
30filterParent parentId validIds = if S.member parentId validIds then parentId else U.nil
26filterParent parentId validIds = if S.member parentId validIds then parentId else U.nil
@@ -44,3 +40,15 @@ schemas (Transaction _ _ schemas') = schemas'
44-- | Returns all subschemas which are isomorphic or sub-isomorphic to the concrete schema.
40-- | Returns all subschemas which are isomorphic or sub-isomorphic to the concrete schema.
45subschemas :: Transaction -> Subschemas
41subschemas :: Transaction -> Subschemas
46subschemas (Transaction _ _ (Schemas _ sschemas)) = sschemas
42subschemas (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+60−52
@@ -1,3 +1,4 @@
1+{-# LANGUAGE TypeApplications #-}
1module ProjectM36.Transaction.Persist where
2module ProjectM36.Transaction.Persist where
2import ProjectM36.Base
3import ProjectM36.Base
3import ProjectM36.Error
4import ProjectM36.Error
@@ -7,20 +8,19 @@ import ProjectM36.AtomFunction
7import ProjectM36.Persist (writeBSFileSync, DiskSync, renameSync)
8import ProjectM36.Persist (writeBSFileSync, DiskSync, renameSync)
8import qualified Data.Map as M
9import qualified Data.Map as M
9import qualified Data.HashSet as HS
10import qualified Data.HashSet as HS
10−import qualified Data.Binary as B
11−--import qualified Data.ByteString as BS
12import System.FilePath
11import System.FilePath
13import System.Directory
12import System.Directory
14import qualified Data.Text as T
13import qualified Data.Text as T
15import Control.Monad
14import Control.Monad
16import ProjectM36.ScriptSession
15import ProjectM36.ScriptSession
17import ProjectM36.AtomFunctions.Basic (precompiledAtomFunctions)
16import ProjectM36.AtomFunctions.Basic (precompiledAtomFunctions)
18−import Control.Exception
17+import Codec.Winery
18+
19+#ifdef PM36_HASKELL_SCRIPTING
19import GHC
20import GHC
21+import Control.Exception
20import GHC.Paths
22import GHC.Paths
21−import Codec.Compression.GZip
23+#endif
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]
26getDirectoryNames path =
26getDirectoryNames path =
@@ -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−relvarsDir :: FilePath -> FilePath
39+relvarsPath :: FilePath -> FilePath
40−relvarsDir transdir = transdir </> "relvars"
40+relvarsPath 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 <- B.decodeFile (transactionInfoPath transDir)
65+ transInfo <- readFileDeserialise (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,77 +85,75 @@ 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, relvarsDir tempTransDir, incDepsDir tempTransDir, dbcFuncsDir tempTransDir]
88+ mapM_ createDirectory [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− B.encodeFile (transactionInfoPath tempTransDir) (transactionInfo trans)
95+ writeFileSerialise (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
107
98
108−readRelVars :: FilePath -> IO (M.Map RelVarName Relation)
99+writeRelVars :: DiskSync -> FilePath -> RelationVariables -> IO ()
109−readRelVars transDir = do
100+writeRelVars sync transDir relvars = do
110− let relvarsPath = relvarsDir transDir
101+ let path = relvarsPath transDir
111− relvarNames <- getDirectoryNames relvarsPath
102+ writeBSFileSync sync path (serialise relvars)
112− let relvars = mapM (\name -> do
103+
113− rel <- B.decode . decompress . BSL.fromStrict <$> BS.readFile (relvarsPath </> name)
104+readRelVars :: FilePath -> IO RelationVariables
114− return (T.pack name, rel)) relvarNames
105+readRelVars transDir =
115− M.fromList <$> relvars
106+ readFileDeserialise (relvarsPath transDir)
116
107
117writeAtomFuncs :: DiskSync -> FilePath -> AtomFunctions -> IO ()
108writeAtomFuncs :: DiskSync -> FilePath -> AtomFunctions -> IO ()
118writeAtomFuncs sync transDir funcs = do
109writeAtomFuncs sync transDir funcs = do
119 let atomFuncPath = atomFuncsPath transDir
110 let atomFuncPath = atomFuncsPath transDir
120− writeBSFileSync sync atomFuncPath (B.encode $ map (\f -> (atomFuncType f, atomFuncName f, atomFunctionScript f)) (HS.toList funcs))
111+ writeBSFileSync sync atomFuncPath (serialise $ map (\f -> (atomFuncType f, atomFuncName f, atomFunctionScript f)) (HS.toList funcs))
121
112
122--all the atom functions are in one file
113--all the atom functions are in one file
123readAtomFuncs :: FilePath -> Maybe ScriptSession -> IO AtomFunctions
114readAtomFuncs :: FilePath -> Maybe ScriptSession -> IO AtomFunctions
124readAtomFuncs transDir mScriptSession = do
115readAtomFuncs transDir mScriptSession = do
125− atomFuncsList <- B.decodeFile (atomFuncsPath transDir)
116+ atomFuncsList <- readFileDeserialise (atomFuncsPath transDir)
126 --only Haskell script functions can be serialized
117 --only Haskell script functions can be serialized
127 --we always return the pre-compiled functions
118 --we always return the pre-compiled functions
128 funcs <- mapM (\(funcType, funcName, mFuncScript) -> loadAtomFunc precompiledAtomFunctions mScriptSession funcName funcType mFuncScript) atomFuncsList
119 funcs <- mapM (\(funcType, funcName, mFuncScript) -> loadAtomFunc precompiledAtomFunctions mScriptSession funcName funcType mFuncScript) atomFuncsList
129 pure (HS.union precompiledAtomFunctions (HS.fromList funcs))
120 pure (HS.union precompiledAtomFunctions (HS.fromList funcs))
130
121
131loadAtomFunc :: AtomFunctions -> Maybe ScriptSession -> AtomFunctionName -> [AtomType] -> Maybe AtomFunctionBodyScript -> IO AtomFunction
122loadAtomFunc :: AtomFunctions -> Maybe ScriptSession -> AtomFunctionName -> [AtomType] -> Maybe AtomFunctionBodyScript -> IO AtomFunction
132−loadAtomFunc precompiledFuncs mScriptSession funcName funcType mFuncScript = case mFuncScript of
123+loadAtomFunc precompiledFuncs _mScriptSession funcName _funcType mFuncScript = case mFuncScript of
133 --handle pre-compiled case- pull it from the precompiled list
124 --handle pre-compiled case- pull it from the precompiled list
134 Nothing -> case atomFunctionForName funcName precompiledFuncs of
125 Nothing -> case atomFunctionForName funcName precompiledFuncs of
135 --WARNING: possible landmine here if we remove a precompiled atom function in the future, then the transaction cannot be restored
126 --WARNING: possible landmine here if we remove a precompiled atom function in the future, then the transaction cannot be restored
136 Left _ -> error ("expected precompiled atom function: " ++ T.unpack funcName)
127 Left _ -> error ("expected precompiled atom function: " ++ T.unpack funcName)
137 Right realFunc -> pure realFunc
128 Right realFunc -> pure realFunc
138 --handle a real Haskell scripted function- compile and load
129 --handle a real Haskell scripted function- compile and load
139− Just funcScript ->
130+ Just _funcScript ->
140− case mScriptSession of
131+#ifdef PM36_HASKELL_SCRIPTING
132+ case _mScriptSession of
141 Nothing -> error "attempted to read serialized AtomFunction without scripting enabled"
133 Nothing -> error "attempted to read serialized AtomFunction without scripting enabled"
142 Just scriptSession -> do
134 Just scriptSession -> do
143 --risk of GHC exception during compilation here
135 --risk of GHC exception during compilation here
144 eCompiledScript <- runGhc (Just libdir) $ do
136 eCompiledScript <- runGhc (Just libdir) $ do
145 setSession (hscEnv scriptSession)
137 setSession (hscEnv scriptSession)
146− compileScript (atomFunctionBodyType scriptSession) funcScript
138+ compileScript (atomFunctionBodyType scriptSession) _funcScript
147 case eCompiledScript of
139 case eCompiledScript of
148 Left err -> throwIO err
140 Left err -> throwIO err
149 Right compiledScript -> pure AtomFunction { atomFuncName = funcName,
141 Right compiledScript -> pure AtomFunction { atomFuncName = funcName,
150− atomFuncType = funcType,
142+ atomFuncType = _funcType,
151− atomFuncBody = AtomFunctionBody (Just funcScript) compiledScript }
143+ atomFuncBody = AtomFunctionBody (Just _funcScript) compiledScript }
144+#else
145+ error "Haskell scripting is disabled"
146+#endif
152
147
153--if the script session is enabled, compile the script, otherwise, hard error!
148--if the script session is enabled, compile the script, otherwise, hard error!
154
149
155readAtomFunc :: FilePath -> AtomFunctionName -> Maybe ScriptSession -> AtomFunctions -> IO AtomFunction
150readAtomFunc :: FilePath -> AtomFunctionName -> Maybe ScriptSession -> AtomFunctions -> IO AtomFunction
151+#if !defined(PM36_HASKELL_SCRIPTING)
152+readAtomFunc _ _ _ _ = error "Haskell scripting is disabled"
153+#else
156readAtomFunc transDir funcName mScriptSession precompiledFuncs = do
154readAtomFunc transDir funcName mScriptSession precompiledFuncs = do
157 let atomFuncPath = atomFuncsPath transDir
155 let atomFuncPath = atomFuncsPath transDir
158− (funcType, mFuncScript) <- B.decodeFile atomFuncPath
156+ (funcType, mFuncScript) <- readFileDeserialise @([AtomType],Maybe T.Text) atomFuncPath
159 case mFuncScript of
157 case mFuncScript of
160 --handle pre-compiled case- pull it from the precompiled list
158 --handle pre-compiled case- pull it from the precompiled list
161 Nothing -> case atomFunctionForName funcName precompiledFuncs of
159 Nothing -> case atomFunctionForName funcName precompiledFuncs of
@@ -163,7 +161,8 @@ readAtomFunc transDir funcName mScriptSession precompiledFuncs = do
163 Left _ -> error ("expected precompiled atom function: " ++ T.unpack funcName)
161 Left _ -> error ("expected precompiled atom function: " ++ T.unpack funcName)
164 Right realFunc -> pure realFunc
162 Right realFunc -> pure realFunc
165 --handle a real Haskell scripted function- compile and load
163 --handle a real Haskell scripted function- compile and load
166− Just funcScript ->
164+ Just funcScript ->
165+
167 case mScriptSession of
166 case mScriptSession of
168 Nothing -> error "attempted to read serialized AtomFunction without scripting enabled"
167 Nothing -> error "attempted to read serialized AtomFunction without scripting enabled"
169 Just scriptSession -> do
168 Just scriptSession -> do
@@ -176,6 +175,7 @@ readAtomFunc transDir funcName mScriptSession precompiledFuncs = do
176 Right compiledScript -> pure AtomFunction { atomFuncName = funcName,
175 Right compiledScript -> pure AtomFunction { atomFuncName = funcName,
177 atomFuncType = funcType,
176 atomFuncType = funcType,
178 atomFuncBody = AtomFunctionBody (Just funcScript) compiledScript }
177 atomFuncBody = AtomFunctionBody (Just funcScript) compiledScript }
178+#endif
179
179
180
180
181writeDBCFuncs :: DiskSync -> FilePath -> DatabaseContextFunctions -> IO ()
181writeDBCFuncs :: DiskSync -> FilePath -> DatabaseContextFunctions -> IO ()
@@ -184,7 +184,7 @@ 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 (B.encode (dbcFuncType func, databaseContextFunctionScript func))
187+ writeBSFileSync sync dbcFuncPath (serialise (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
@@ -194,30 +194,38 @@ readDBCFuncs transDir mScriptSession = do
194 let funcs = mapM ((\name -> readDBCFunc transDir name mScriptSession precompiledDatabaseContextFunctions) . T.pack) funcNames
194 let funcs = mapM ((\name -> readDBCFunc transDir name mScriptSession precompiledDatabaseContextFunctions) . T.pack) funcNames
195 HS.union basicDatabaseContextFunctions . HS.fromList <$> funcs
195 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
198readDBCFunc transDir funcName mScriptSession precompiledFuncs = do
201readDBCFunc transDir funcName mScriptSession precompiledFuncs = do
202+#endif
199 let dbcFuncPath = dbcFuncsDir transDir </> T.unpack funcName
203 let dbcFuncPath = dbcFuncsDir transDir </> T.unpack funcName
200− (funcType, mFuncScript) <- B.decodeFile dbcFuncPath
204+ (_funcType, mFuncScript) <- readFileDeserialise @([AtomType], Maybe T.Text) dbcFuncPath
201 case mFuncScript of
205 case mFuncScript of
202 Nothing -> case databaseContextFunctionForName funcName precompiledFuncs of
206 Nothing -> case databaseContextFunctionForName funcName precompiledFuncs of
203 Left _ -> error ("expected precompiled dbc function: " ++ T.unpack funcName)
207 Left _ -> error ("expected precompiled dbc function: " ++ T.unpack funcName)
204 Right realFunc -> pure realFunc --return precompiled function
208 Right realFunc -> pure realFunc --return precompiled function
205− Just funcScript ->
209+ Just _funcScript ->
210+#ifdef PM36_HASKELL_SCRIPTING
206 case mScriptSession of
211 case mScriptSession of
207 Nothing -> error "attempted to read serialized AtomFunction without scripting enabled"
212 Nothing -> error "attempted to read serialized AtomFunction without scripting enabled"
208 Just scriptSession -> do
213 Just scriptSession -> do
209 eCompiledScript <- runGhc (Just libdir) $ do
214 eCompiledScript <- runGhc (Just libdir) $ do
210 setSession (hscEnv scriptSession)
215 setSession (hscEnv scriptSession)
211− compileScript (dbcFunctionBodyType scriptSession) funcScript
216+ compileScript (dbcFunctionBodyType scriptSession) _funcScript
212 case eCompiledScript of
217 case eCompiledScript of
213 Left err -> throwIO err
218 Left err -> throwIO err
214 Right compiledScript -> pure DatabaseContextFunction { dbcFuncName = funcName,
219 Right compiledScript -> pure DatabaseContextFunction { dbcFuncName = funcName,
215− dbcFuncType = funcType,
220+ dbcFuncType = _funcType,
216− dbcFuncBody = DatabaseContextFunctionBody (Just funcScript) compiledScript}
221+ dbcFuncBody = DatabaseContextFunctionBody (Just _funcScript) compiledScript}
222+#else
223+ error "Haskell scripting is disabled"
224+#endif
217
225
218writeIncDep :: DiskSync -> FilePath -> (IncDepName, InclusionDependency) -> IO ()
226writeIncDep :: DiskSync -> FilePath -> (IncDepName, InclusionDependency) -> IO ()
219writeIncDep sync transDir (incDepName, incDep) =
227writeIncDep sync transDir (incDepName, incDep) =
220− writeBSFileSync sync (incDepsDir transDir </> T.unpack incDepName) $ B.encode incDep
228+ writeBSFileSync sync (incDepsDir transDir </> T.unpack incDepName) $ serialise incDep
221
229
222writeIncDeps :: DiskSync -> FilePath -> M.Map IncDepName InclusionDependency -> IO ()
230writeIncDeps :: DiskSync -> FilePath -> M.Map IncDepName InclusionDependency -> IO ()
223writeIncDeps sync transDir incdeps = mapM_ (writeIncDep sync transDir) $ M.toList incdeps
231writeIncDeps sync transDir incdeps = mapM_ (writeIncDep sync transDir) $ M.toList incdeps
@@ -225,7 +233,7 @@ writeIncDeps sync transDir incdeps = mapM_ (writeIncDep sync transDir) $ M.toLis
225readIncDep :: FilePath -> IncDepName -> IO (IncDepName, InclusionDependency)
233readIncDep :: FilePath -> IncDepName -> IO (IncDepName, InclusionDependency)
226readIncDep transDir incdepName = do
234readIncDep transDir incdepName = do
227 let incDepPath = incDepsDir transDir </> T.unpack incdepName
235 let incDepPath = incDepsDir transDir </> T.unpack incdepName
228− incDepData <- B.decodeFile incDepPath
236+ incDepData <- readFileDeserialise incDepPath
229 pure (incdepName, incDepData)
237 pure (incdepName, incDepData)
230
238
231readIncDeps :: FilePath -> IO (M.Map IncDepName InclusionDependency)
239readIncDeps :: FilePath -> IO (M.Map IncDepName InclusionDependency)
@@ -237,20 +245,20 @@ readIncDeps transDir = do
237readSubschemas :: FilePath -> IO Subschemas
245readSubschemas :: FilePath -> IO Subschemas
238readSubschemas transDir = do
246readSubschemas transDir = do
239 let sschemasPath = subschemasPath transDir
247 let sschemasPath = subschemasPath transDir
240− B.decodeFile sschemasPath
248+ readFileDeserialise sschemasPath
241
249
242writeSubschemas :: DiskSync -> FilePath -> Subschemas -> IO ()
250writeSubschemas :: DiskSync -> FilePath -> Subschemas -> IO ()
243writeSubschemas sync transDir sschemas = do
251writeSubschemas sync transDir sschemas = do
244 let sschemasPath = subschemasPath transDir
252 let sschemasPath = subschemasPath transDir
245− writeBSFileSync sync sschemasPath (B.encode sschemas)
253+ writeBSFileSync sync sschemasPath (serialise sschemas)
246
254
247writeTypeConstructorMapping :: DiskSync -> FilePath -> TypeConstructorMapping -> IO ()
255writeTypeConstructorMapping :: DiskSync -> FilePath -> TypeConstructorMapping -> IO ()
248writeTypeConstructorMapping sync path types = let atPath = typeConsPath path in
256writeTypeConstructorMapping sync path types = let atPath = typeConsPath path in
249− writeBSFileSync sync atPath $ B.encode types
257+ writeBSFileSync sync atPath $ serialise types
250
258
251readTypeConstructorMapping :: FilePath -> IO TypeConstructorMapping
259readTypeConstructorMapping :: FilePath -> IO TypeConstructorMapping
252readTypeConstructorMapping path = do
260readTypeConstructorMapping path = do
253 let atPath = typeConsPath path
261 let atPath = typeConsPath path
254− B.decodeFile atPath
262+ readFileDeserialise atPath
263+
255
264
256−
src/lib/ProjectM36/Transaction/Type.hsnew file+8
@@ -0,0 +1,8 @@
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.hsnew file+12
@@ -0,0 +1,12 @@
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+239−149
@@ -1,46 +1,52 @@
1−{-# LANGUAGE DeriveAnyClass, DeriveGeneric #-}
1+{-# LANGUAGE DeriveGeneric, CPP, FlexibleContexts, DerivingVia #-}
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
6import ProjectM36.Relation
7import ProjectM36.Relation
7import ProjectM36.TupleSet
8import ProjectM36.TupleSet
8import ProjectM36.Tuple
9import ProjectM36.Tuple
9import ProjectM36.RelationalExpression
10import ProjectM36.RelationalExpression
10import ProjectM36.TransactionGraph.Merge
11import ProjectM36.TransactionGraph.Merge
12+import ProjectM36.MerkleHash
11import qualified ProjectM36.DisconnectedTransaction as Discon
13import qualified ProjectM36.DisconnectedTransaction as Discon
14+import qualified ProjectM36.Attribute as A
12
15
16+import Codec.Winery
17+import Control.Monad.Except hiding (join)
18+import Control.Monad.Reader hiding (join)
13import qualified Data.Vector as V
19import qualified Data.Vector as V
14−import qualified ProjectM36.Attribute as A
15import qualified Data.UUID as U
20import qualified Data.UUID as U
16import qualified Data.Set as S
21import qualified Data.Set as S
17import qualified Data.Map as M
22import qualified Data.Map as M
18−import Control.Monad
23+import qualified Data.List.NonEmpty as NE
19import Data.Time.Clock
24import Data.Time.Clock
20import qualified Data.Text as T
25import qualified Data.Text as T
21import GHC.Generics
26import GHC.Generics
22−import Data.Binary
23import Data.Either (lefts, rights, isRight)
27import Data.Either (lefts, rights, isRight)
28+#if __GLASGOW_HASKELL__ < 804
24import Data.Monoid
29import Data.Monoid
30+#endif
25import Control.Arrow
31import Control.Arrow
26import Data.Maybe
32import Data.Maybe
27−
33+import Data.UUID.V4
28−{-
34+import qualified Data.ByteString.Lazy as BL
29−--import Debug.Trace
35+import ProjectM36.DatabaseContext as DBC
30−import Control.Monad.Reader
36+import Crypto.Hash.SHA256
31−import qualified ProjectM36.DisconnectedTransaction as D
32−-}
33
37
34-- | Record a lookup for a specific transaction in the graph.
38-- | Record a lookup for a specific transaction in the graph.
35data TransactionIdLookup = TransactionIdLookup TransactionId |
39data TransactionIdLookup = TransactionIdLookup TransactionId |
36 TransactionIdHeadNameLookup HeadName [TransactionIdHeadBacktrack]
40 TransactionIdHeadNameLookup HeadName [TransactionIdHeadBacktrack]
37− deriving (Show, Eq, Binary, Generic)
41+ deriving (Show, Eq, Generic)
42+ deriving Serialise via WineryVariant TransactionIdLookup
38
43
39-- | Used for git-style head backtracking such as topic~3^2.
44-- | Used for git-style head backtracking such as topic~3^2.
40−data TransactionIdHeadBacktrack = TransactionIdHeadParentBacktrack Int | -- ^ git equivalent of ~: walk back n parents, arbitrarily choosing a parent when a choice must be made
45+data TransactionIdHeadBacktrack = TransactionIdHeadParentBacktrack Int | -- ^ git equivalent of ~v: walk back n parents, arbitrarily choosing a parent when a choice must be made
41 TransactionIdHeadBranchBacktrack Int | -- ^ git equivalent of ^: walk back one parent level to the nth arbitrarily-chosen parent
46 TransactionIdHeadBranchBacktrack Int | -- ^ git equivalent of ^: walk back one parent level to the nth arbitrarily-chosen parent
42 TransactionStampHeadBacktrack UTCTime -- ^ git equivalent of 'git-rev-list -n 1 --before X' find the first transaction which was created before the timestamp
47 TransactionStampHeadBacktrack UTCTime -- ^ git equivalent of 'git-rev-list -n 1 --before X' find the first transaction which was created before the timestamp
43− deriving (Show, Eq, Binary, Generic)
48+ deriving (Show, Eq, Generic)
49+ deriving Serialise via WineryVariant TransactionIdHeadBacktrack
44
50
45
51
46-- | Operators which manipulate a transaction graph and which transaction the current 'Session' is based upon.
52-- | Operators which manipulate a transaction graph and which transaction the current 'Session' is based upon.
@@ -52,22 +58,32 @@ data TransactionGraphOperator = JumpToHead HeadName |
52 MergeTransactions MergeStrategy HeadName HeadName |
58 MergeTransactions MergeStrategy HeadName HeadName |
53 Commit |
59 Commit |
54 Rollback
60 Rollback
55− deriving (Eq, Show, Binary, Generic)
61+ deriving (Eq, Show, Generic)
62+ deriving Serialise via WineryVariant TransactionGraphOperator
56
63
57isCommit :: TransactionGraphOperator -> Bool
64isCommit :: TransactionGraphOperator -> Bool
58isCommit Commit = True
65isCommit Commit = True
59isCommit _ = False
66isCommit _ = False
60
67
61−data ROTransactionGraphOperator = ShowGraph
68+data ROTransactionGraphOperator = ShowGraph | ValidateMerkleHashes
62 deriving Show
69 deriving Show
63
70
64bootstrapTransactionGraph :: UTCTime -> TransactionId -> DatabaseContext -> TransactionGraph
71bootstrapTransactionGraph :: UTCTime -> TransactionId -> DatabaseContext -> TransactionGraph
65−bootstrapTransactionGraph stamp freshId context = TransactionGraph bootstrapHeads bootstrapTransactions
72+bootstrapTransactionGraph stamp' freshId context = TransactionGraph bootstrapHeads bootstrapTransactions
66 where
73 where
67 bootstrapHeads = M.singleton "master" freshTransaction
74 bootstrapHeads = M.singleton "master" freshTransaction
68 newSchemas = Schemas context M.empty
75 newSchemas = Schemas context M.empty
69− freshTransaction = Transaction freshId (TransactionInfo U.nil S.empty stamp) newSchemas
76+ freshTransaction = fresh freshId 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+
71
87
72emptyTransactionGraph :: TransactionGraph
88emptyTransactionGraph :: TransactionGraph
73emptyTransactionGraph = TransactionGraph M.empty S.empty
89emptyTransactionGraph = TransactionGraph M.empty S.empty
@@ -86,75 +102,79 @@ headNameForTransaction transaction (TransactionGraph heads _) = if M.null matchi
86 where
102 where
87 matchingTrans = M.filter (transaction ==) heads
103 matchingTrans = M.filter (transaction ==) heads
88
104
89−transactionForId :: TransactionId -> TransactionGraph -> Either RelationalError Transaction
90−transactionForId tid 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)
99−
100transactionsForIds :: S.Set TransactionId -> TransactionGraph -> Either RelationalError (S.Set Transaction)
105transactionsForIds :: S.Set TransactionId -> TransactionGraph -> Either RelationalError (S.Set Transaction)
101transactionsForIds idSet graph =
106transactionsForIds idSet graph =
102 S.fromList <$> forM (S.toList idSet) (`transactionForId` graph)
107 S.fromList <$> forM (S.toList idSet) (`transactionForId` graph)
103
108
109+-- | A root transaction terminates a graph and has no parents.
104−isRootTransaction :: Transaction -> TransactionGraph -> Bool
110+isRootTransaction :: Transaction -> Bool
105−isRootTransaction (Transaction _ (TransactionInfo pId _ _) _) _ = U.null pId
111+isRootTransaction trans = parentIds trans == S.singleton U.nil
106−isRootTransaction (Transaction _ MergeTransactionInfo{} _) _ = False
112+
113+rootTransactions :: TransactionGraph -> S.Set Transaction
114+rootTransactions graph = S.filter isRootTransaction (transactionsForGraph graph)
107
115
108-- the first transaction has no parent - all other do have parents- merges have two parents
116-- the first transaction has no parent - all other do have parents- merges have two parents
109parentTransactions :: Transaction -> TransactionGraph -> Either RelationalError (S.Set Transaction)
117parentTransactions :: Transaction -> TransactionGraph -> Either RelationalError (S.Set Transaction)
110−parentTransactions (Transaction _ (TransactionInfo pId _ _) _) graph =
118+parentTransactions trans = transactionsForIds (parentIds trans)
111− S.singleton <$> transactionForId pId graph
112−
113−
114−parentTransactions (Transaction _ (MergeTransactionInfo pId1 pId2 _ _) _ ) graph = transactionsForIds (S.fromList [pId1, pId2]) graph
115−
116
119
117childTransactions :: Transaction -> TransactionGraph -> Either RelationalError (S.Set Transaction)
120childTransactions :: Transaction -> TransactionGraph -> Either RelationalError (S.Set Transaction)
118−childTransactions (Transaction _ (TransactionInfo _ children _) _) = transactionsForIds children
121+childTransactions trans graph = transactionsForIds childIds graph
119−childTransactions (Transaction _ (MergeTransactionInfo _ _ children _) _) = transactionsForIds children
122+ where
123+ childIds = S.map transactionId (S.filter filt (transactionsForGraph graph))
124+ filt trans' = S.member (transactionId trans) (parentIds trans')
120
125
121-- create a new commit and add it to the heads
126-- create a new commit and add it to the heads
122-- 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)
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)
123addBranch :: UTCTime -> TransactionId -> HeadName -> TransactionId -> TransactionGraph -> Either RelationalError (Transaction, TransactionGraph)
128addBranch :: UTCTime -> TransactionId -> HeadName -> TransactionId -> TransactionGraph -> Either RelationalError (Transaction, TransactionGraph)
124−addBranch stamp newId newBranchName branchPointId graph = do
129+addBranch stamp' newId newBranchName branchPointId graph = do
125 parentTrans <- transactionForId branchPointId graph
130 parentTrans <- transactionForId branchPointId graph
126− let newTrans = Transaction newId (TransactionInfo branchPointId S.empty stamp) (schemas parentTrans)
131+ let newTrans = Transaction newId (TI.singleParent branchPointId stamp') (schemas parentTrans)
127 addTransactionToGraph newBranchName newTrans graph
132 addTransactionToGraph newBranchName newTrans graph
128
133
129--adds a disconnected transaction to a transaction graph at some head
134--adds a disconnected transaction to a transaction graph at some head
130addDisconnectedTransaction :: UTCTime -> TransactionId -> HeadName -> DisconnectedTransaction -> TransactionGraph -> Either RelationalError (Transaction, TransactionGraph)
135addDisconnectedTransaction :: UTCTime -> TransactionId -> HeadName -> DisconnectedTransaction -> TransactionGraph -> Either RelationalError (Transaction, TransactionGraph)
131−addDisconnectedTransaction stamp newId headName (DisconnectedTransaction parentId schemas' _) = addTransactionToGraph headName (Transaction newId (TransactionInfo parentId S.empty stamp) schemas')
136+addDisconnectedTransaction stamp' newId headName (DisconnectedTransaction parentId schemas' _) graph = addTransactionToGraph headName newTrans' graph
132−
137+ where
133−
138+ newTrans = Transaction newId newTInfo schemas'
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
134addTransactionToGraph :: HeadName -> Transaction -> TransactionGraph -> Either RelationalError (Transaction, TransactionGraph)
143addTransactionToGraph :: HeadName -> Transaction -> TransactionGraph -> Either RelationalError (Transaction, TransactionGraph)
135addTransactionToGraph headName newTrans graph = do
144addTransactionToGraph headName newTrans graph = do
136− let parentIds = transactionParentIds newTrans
145+ let parentIds' = parentIds newTrans
137− childIds = transactionChildIds newTrans
138 newId = transactionId newTrans
146 newId = transactionId newTrans
139 validateIds ids = mapM (`transactionForId` graph) (S.toList ids)
147 validateIds ids = mapM (`transactionForId` graph) (S.toList ids)
140− addChildTransaction trans = transactionSetChildren trans (S.insert newId (transactionChildIds trans))
148+ childTs <- childTransactions newTrans graph
141 --validate that the parent transactions are in the graph
149 --validate that the parent transactions are in the graph
142− _ <- validateIds parentIds
150+ _ <- validateIds parentIds'
143− when (S.size parentIds < 1) (Left $ NewTransactionMissingParentError newId)
151+ when (S.size parentIds' < 1) (Left $ NewTransactionMissingParentError newId)
144 --if the headName already exists, ensure that it refers to a parent
152 --if the headName already exists, ensure that it refers to a parent
145 case transactionForHead headName graph of
153 case transactionForHead headName graph of
146 Nothing -> pure () -- any headName is OK
154 Nothing -> pure () -- any headName is OK
147− Just trans -> when (S.notMember (transactionId trans) parentIds) (Left (HeadNameSwitchingHeadProhibitedError headName))
155+ Just trans -> when (S.notMember (transactionId trans) parentIds') (Left (HeadNameSwitchingHeadProhibitedError headName))
148 --validate that the transaction has no children
156 --validate that the transaction has no children
149− unless (S.null childIds) (Left $ NewTransactionMayNotHaveChildrenError newId)
157+ unless (S.null childTs) (Left $ NewTransactionMayNotHaveChildrenError newId)
150 --validate that the trasaction's id is unique
158 --validate that the trasaction's id is unique
151 when (isRight (transactionForId newId graph)) (Left (TransactionIdInUseError newId))
159 when (isRight (transactionForId newId graph)) (Left (TransactionIdInUseError newId))
152− --update the parent transactions to point to the new transaction
160+ --replace all references to UncommittedTransactionMarker to new transaction id
153− parents <- mapM (`transactionForId` graph) (S.toList parentIds)
161+ let newTrans' = newTransUncommittedReplace newTrans
154− let updatedParents = S.map addChildTransaction (S.fromList parents)
155− updatedTransSet = S.insert newTrans (S.union updatedParents (transactionsForGraph graph))
162+ updatedTransSet = S.insert newTrans' (transactionsForGraph graph)
156− updatedHeads = M.insert headName newTrans (transactionHeadsForGraph graph)
163+ updatedHeads = M.insert headName newTrans' (transactionHeadsForGraph graph)
157− pure (newTrans, TransactionGraph updatedHeads updatedTransSet)
164+ pure (newTrans', TransactionGraph updatedHeads updatedTransSet)
165+
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+
158
178
159validateGraph :: TransactionGraph -> Maybe [RelationalError]
179validateGraph :: TransactionGraph -> Maybe [RelationalError]
160validateGraph graph@(TransactionGraph _ transSet) = do
180validateGraph graph@(TransactionGraph _ transSet) = do
@@ -226,7 +246,7 @@ evalGraphOp _ _ discon graph (WalkBackToTime backTime) = do
226 case transactionForId jumpDest graph of
246 case transactionForId jumpDest graph of
227 Left err -> Left err
247 Left err -> Left err
228 Right trans -> do
248 Right trans -> do
229− let disconnectedTrans = DisconnectedTransaction (transactionId trans) (schemas trans) False
249+ let disconnectedTrans = Discon.freshTransaction (transactionId trans) (schemas trans)
230 Right (disconnectedTrans, graph)
250 Right (disconnectedTrans, graph)
231
251
232-- add new head pointing to branchPoint
252-- add new head pointing to branchPoint
@@ -244,15 +264,15 @@ evalGraphOp newId discon@(DisconnectedTransaction parentId disconContext) graph
244
264
245-- create a new commit and add it to the heads
265-- create a new commit and add it to the heads
246-- 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)
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−evalGraphOp stamp newId (DisconnectedTransaction parentId schemas' _) graph (Branch newBranchName) = do
267+evalGraphOp stamp' newId (DisconnectedTransaction parentId schemas' _) graph (Branch newBranchName) = do
248− let newDiscon = DisconnectedTransaction newId schemas' False
268+ let newDiscon = Discon.freshTransaction newId schemas'
249− case addBranch stamp newId newBranchName parentId graph of
269+ case addBranch stamp' newId newBranchName parentId graph of
250 Left err -> Left err
270 Left err -> Left err
251 Right (_, newGraph) -> Right (newDiscon, newGraph)
271 Right (_, newGraph) -> Right (newDiscon, newGraph)
252
272
253-- add the disconnected transaction to the graph
273-- add the disconnected transaction to the graph
254-- affects graph and disconnectedtransaction- the new disconnectedtransaction's parent is the freshly committed transaction
274-- affects graph and disconnectedtransaction- the new disconnectedtransaction's parent is the freshly committed transaction
255−evalGraphOp stamp newTransId discon@(DisconnectedTransaction parentId schemas' _) graph Commit = case transactionForId parentId graph of
275+evalGraphOp stamp' newTransId discon@(DisconnectedTransaction parentId schemas' _) graph Commit = case transactionForId parentId graph of
256 Left err -> Left err
276 Left err -> Left err
257 Right parentTransaction -> case headNameForTransaction parentTransaction graph of
277 Right parentTransaction -> case headNameForTransaction parentTransaction graph of
258 Nothing -> Left $ TransactionIsNotAHeadError parentId
278 Nothing -> Left $ TransactionIsNotAHeadError parentId
@@ -260,17 +280,20 @@ evalGraphOp stamp newTransId discon@(DisconnectedTransaction parentId schemas' _
260 Left err-> Left err
280 Left err-> Left err
261 Right (_, updatedGraph) -> Right (newDisconnectedTrans, updatedGraph)
281 Right (_, updatedGraph) -> Right (newDisconnectedTrans, updatedGraph)
262 where
282 where
263− newDisconnectedTrans = DisconnectedTransaction newTransId schemas' False
283+ newDisconnectedTrans = Discon.freshTransaction newTransId schemas'
264− maybeUpdatedGraph = addDisconnectedTransaction stamp newTransId headName discon graph
284+ maybeUpdatedGraph = addDisconnectedTransaction stamp' newTransId headName discon graph
265
285
266-- refresh the disconnected transaction, return the same graph
286-- refresh the disconnected transaction, return the same graph
267evalGraphOp _ _ (DisconnectedTransaction parentId _ _) graph Rollback = case transactionForId parentId graph of
287evalGraphOp _ _ (DisconnectedTransaction parentId _ _) graph Rollback = case transactionForId parentId graph of
268 Left err -> Left err
288 Left err -> Left err
269 Right parentTransaction -> Right (newDiscon, graph)
289 Right parentTransaction -> Right (newDiscon, graph)
270 where
290 where
271− newDiscon = DisconnectedTransaction parentId (schemas parentTransaction) False
291+ newDiscon = Discon.freshTransaction parentId (schemas parentTransaction)
272
292
273−evalGraphOp stamp newId (DisconnectedTransaction parentId _ _) graph (MergeTransactions mergeStrategy headNameA headNameB) = mergeTransactions stamp newId parentId mergeStrategy (headNameA, headNameB) graph
293+evalGraphOp stamp' newId (DisconnectedTransaction parentId _ _) graph (MergeTransactions mergeStrategy headNameA headNameB) =
294+ runGraphRefRelationalExprM env $ mergeTransactions stamp' newId parentId mergeStrategy (headNameA, headNameB)
295+ where
296+ env = freshGraphRefRelationalExprEnv Nothing graph
274
297
275evalGraphOp _ _ discon graph@(TransactionGraph graphHeads transSet) (DeleteBranch branchName) = case transactionForHead branchName graph of
298evalGraphOp _ _ discon graph@(TransactionGraph graphHeads transSet) (DeleteBranch branchName) = case transactionForHead branchName graph of
276 Nothing -> Left (NoSuchHeadNameError branchName)
299 Nothing -> Left (NoSuchHeadNameError branchName)
@@ -283,6 +306,7 @@ graphAsRelation (DisconnectedTransaction parentId _ _) graph@(TransactionGraph _
283 mkRelationFromList attrs tupleMatrix
306 mkRelationFromList attrs tupleMatrix
284 where
307 where
285 attrs = A.attributesFromList [Attribute "id" TextAtomType,
308 attrs = A.attributesFromList [Attribute "id" TextAtomType,
309+ Attribute "hash" ByteStringAtomType,
286 Attribute "stamp" DateTimeAtomType,
310 Attribute "stamp" DateTimeAtomType,
287 Attribute "parents" (RelationAtomType parentAttributes),
311 Attribute "parents" (RelationAtomType parentAttributes),
288 Attribute "current" BoolAtomType,
312 Attribute "current" BoolAtomType,
@@ -292,7 +316,8 @@ graphAsRelation (DisconnectedTransaction parentId _ _) graph@(TransactionGraph _
292 tupleGenerator transaction = case transactionParentsRelation transaction graph of
316 tupleGenerator transaction = case transactionParentsRelation transaction graph of
293 Left err -> Left err
317 Left err -> Left err
294 Right parentTransRel -> Right [TextAtom $ T.pack $ show (transactionId transaction),
318 Right parentTransRel -> Right [TextAtom $ T.pack $ show (transactionId transaction),
319+ ByteStringAtom $ _unMerkleHash (merkleHash (transactionInfo transaction)),
295− DateTimeAtom (transactionTimestamp transaction),
320+ DateTimeAtom (timestamp transaction),
296 RelationAtom parentTransRel,
321 RelationAtom parentTransRel,
297 BoolAtom $ parentId == transactionId transaction,
322 BoolAtom $ parentId == transactionId transaction,
298 TextAtom $ fromMaybe "" (headNameForTransaction transaction graph)
323 TextAtom $ fromMaybe "" (headNameForTransaction transaction graph)
@@ -300,7 +325,7 @@ graphAsRelation (DisconnectedTransaction parentId _ _) graph@(TransactionGraph _
300
325
301transactionParentsRelation :: Transaction -> TransactionGraph -> Either RelationalError Relation
326transactionParentsRelation :: Transaction -> TransactionGraph -> Either RelationalError Relation
302transactionParentsRelation trans graph =
327transactionParentsRelation trans graph =
303− if isRootTransaction trans graph then
328+ if isRootTransaction trans then
304 mkRelation attrs emptyTupleSet
329 mkRelation attrs emptyTupleSet
305 else do
330 else do
306 parentTransSet <- parentTransactions trans graph
331 parentTransSet <- parentTransactions trans graph
@@ -319,39 +344,47 @@ evalROGraphOp discon graph ShowGraph = do
319-}
344-}
320
345
321-- | Execute the merge strategy against the transactions, returning a new transaction which can be then added to the transaction graph
346-- | Execute the merge strategy against the transactions, returning a new transaction which can be then added to the transaction graph
322−createMergeTransaction :: UTCTime -> TransactionId -> MergeStrategy -> TransactionGraph -> (Transaction, Transaction) -> Either MergeError Transaction
347+createMergeTransaction :: UTCTime -> TransactionId -> MergeStrategy -> (Transaction, Transaction) -> GraphRefRelationalExprM Transaction
323−createMergeTransaction stamp newId (SelectedBranchMergeStrategy selectedBranch) graph t2@(trans1, trans2) = do
348+createMergeTransaction stamp' newId (SelectedBranchMergeStrategy selectedBranch) t2@(trans1, trans2) = do
349+ graph <- gfGraph
324− let selectedTrans = validateHeadName selectedBranch graph t2
350+ selectedTrans <- validateHeadName selectedBranch graph t2
325− Transaction newId (MergeTransactionInfo (transactionId trans1) (transactionId trans2) S.empty stamp) . schemas <$> selectedTrans
351+ pure $ addMerkleHash graph $
352+ Transaction newId (TransactionInfo {
353+ parents = NE.fromList [transactionId trans1,
354+ transactionId trans2],
355+ stamp = stamp',
356+ merkleHash = mempty }) (schemas selectedTrans)
326
357
327-- merge functions, relvars, individually
358-- merge functions, relvars, individually
328−createMergeTransaction stamp newId strat@UnionMergeStrategy graph t2 = createUnionMergeTransaction stamp newId strat graph t2
359+createMergeTransaction stamp' newId strat@UnionMergeStrategy t2 =
360+ createUnionMergeTransaction stamp' newId strat t2
329
361
330-- merge function, relvars, but, on error, just take the component from the preferred branch
362-- merge function, relvars, but, on error, just take the component from the preferred branch
331−createMergeTransaction stamp newId strat@(UnionPreferMergeStrategy _) graph t2 = createUnionMergeTransaction stamp newId strat graph t2
363+createMergeTransaction stamp' newId strat@(UnionPreferMergeStrategy _) t2 =
364+ createUnionMergeTransaction stamp' newId strat t2
332
365
333-- | 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.
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−validateHeadName :: HeadName -> TransactionGraph -> (Transaction, Transaction) -> Either MergeError Transaction
367+validateHeadName :: HeadName -> TransactionGraph -> (Transaction, Transaction) -> GraphRefRelationalExprM Transaction
335validateHeadName headName graph (t1, t2) =
368validateHeadName headName graph (t1, t2) =
336 case transactionForHead headName graph of
369 case transactionForHead headName graph of
337− Nothing -> Left SelectedHeadMismatchMergeError
370+ Nothing -> throwError (MergeTransactionError SelectedHeadMismatchMergeError)
338 Just trans -> if trans /= t1 && trans /= t2 then
371 Just trans -> if trans /= t1 && trans /= t2 then
339− Left SelectedHeadMismatchMergeError
372+ throwError (MergeTransactionError SelectedHeadMismatchMergeError)
340 else
373 else
341− Right trans
374+ pure trans
342
375
343-- 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.
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.
344subGraphOfFirstCommonAncestor :: TransactionGraph -> TransactionHeads -> Transaction -> Transaction -> S.Set Transaction -> Either RelationalError TransactionGraph
377subGraphOfFirstCommonAncestor :: TransactionGraph -> TransactionHeads -> Transaction -> Transaction -> S.Set Transaction -> Either RelationalError TransactionGraph
345−subGraphOfFirstCommonAncestor origGraph resultHeads currentTrans goalTrans traverseSet = do
378+subGraphOfFirstCommonAncestor origGraph resultHeads currentTrans' goalTrans traverseSet = do
346− let currentid = transactionId currentTrans
379+ let currentid = transactionId currentTrans'
347 goalid = transactionId goalTrans
380 goalid = transactionId goalTrans
348− if currentTrans == goalTrans then
381+ if currentTrans' == goalTrans then
349 Right (TransactionGraph resultHeads traverseSet) -- add filter
382 Right (TransactionGraph resultHeads traverseSet) -- add filter
350 --catch root transaction to improve error?
383 --catch root transaction to improve error?
351 else do
384 else do
352− currentTransChildren <- S.fromList <$> mapM (`transactionForId` origGraph) (S.toList (transactionChildIds currentTrans))
385+ currentTransChildren <- childTransactions currentTrans' origGraph
353− let searchChildren = S.difference (S.insert currentTrans traverseSet) currentTransChildren
386+ let searchChildren = S.difference (S.insert currentTrans' traverseSet) currentTransChildren
354− searchChild start = pathToTransaction origGraph start goalTrans (S.insert currentTrans traverseSet)
387+ searchChild start' = pathToTransaction origGraph start' goalTrans (S.insert currentTrans' traverseSet)
355 childSearches = map searchChild (S.toList searchChildren)
388 childSearches = map searchChild (S.toList searchChildren)
356 errors = lefts childSearches
389 errors = lefts childSearches
357 pathsFound = rights childSearches
390 pathsFound = rights childSearches
@@ -360,17 +393,16 @@ subGraphOfFirstCommonAncestor origGraph resultHeads currentTrans goalTrans trave
360 unless (null realErrors) (Left (head realErrors))
393 unless (null realErrors) (Left (head realErrors))
361 -- if no paths found, search the parent
394 -- if no paths found, search the parent
362 if null pathsFound then
395 if null pathsFound then
363− case oneParent currentTrans of
396+ case oneParent currentTrans' of
364 Left RootTransactionTraversalError -> Left (NoCommonTransactionAncestorError currentid goalid)
397 Left RootTransactionTraversalError -> Left (NoCommonTransactionAncestorError currentid goalid)
365 Left err -> Left err
398 Left err -> Left err
366 Right currentTransParent ->
399 Right currentTransParent ->
367− subGraphOfFirstCommonAncestor origGraph resultHeads currentTransParent goalTrans (S.insert currentTrans traverseSet)
400+ subGraphOfFirstCommonAncestor origGraph resultHeads currentTransParent goalTrans (S.insert currentTrans' traverseSet)
368 else -- we found a path
401 else -- we found a path
369 Right (TransactionGraph resultHeads (S.unions (traverseSet : pathsFound)))
402 Right (TransactionGraph resultHeads (S.unions (traverseSet : pathsFound)))
370 where
403 where
371− oneParent (Transaction _ (TransactionInfo parentId _ _) _) = transactionForId parentId origGraph
404+ oneParent (Transaction _ tinfo _) = transactionForId (NE.head (parents tinfo)) origGraph
372− oneParent (Transaction _ (MergeTransactionInfo parentId _ _ _) _) = transactionForId parentId origGraph
405+
373−
374-- | Search from a past graph point to all following heads for a specific transaction. If found, return the transaction path, otherwise a RelationalError.
406-- | Search from a past graph point to all following heads for a specific transaction. If found, return the transaction path, otherwise a RelationalError.
375pathToTransaction :: TransactionGraph -> Transaction -> Transaction -> S.Set Transaction -> Either RelationalError (S.Set Transaction)
407pathToTransaction :: TransactionGraph -> Transaction -> Transaction -> S.Set Transaction -> Either RelationalError (S.Set Transaction)
376pathToTransaction graph currentTransaction targetTransaction accumTransSet = do
408pathToTransaction graph currentTransaction targetTransaction accumTransSet = do
@@ -378,11 +410,11 @@ pathToTransaction graph currentTransaction targetTransaction accumTransSet = do
378 if transactionId targetTransaction == transactionId currentTransaction then
410 if transactionId targetTransaction == transactionId currentTransaction then
379 Right accumTransSet
411 Right accumTransSet
380 else do
412 else do
381− currentTransChildren <- mapM (`transactionForId` graph) (S.toList (transactionChildIds currentTransaction))
413+ currentTransChildren <- childTransactions currentTransaction graph
382 if null currentTransChildren then
414 if null currentTransChildren then
383 Left (FailedToFindTransactionError targetId)
415 Left (FailedToFindTransactionError targetId)
384 else do
416 else do
385− let searches = map (\t -> pathToTransaction graph t targetTransaction (S.insert t accumTransSet)) currentTransChildren
417+ let searches = map (\t -> pathToTransaction graph t targetTransaction (S.insert t accumTransSet)) (S.toList currentTransChildren)
386 let realErrors = filter (/= FailedToFindTransactionError targetId) (lefts searches)
418 let realErrors = filter (/= FailedToFindTransactionError targetId) (lefts searches)
387 paths = rights searches
419 paths = rights searches
388 if not (null realErrors) then -- found some real errors
420 if not (null realErrors) then -- found some real errors
@@ -392,35 +424,39 @@ pathToTransaction graph currentTransaction targetTransaction accumTransSet = do
392 else --we have some paths!
424 else --we have some paths!
393 Right (S.unions paths)
425 Right (S.unions paths)
394
426
395−mergeTransactions :: UTCTime -> TransactionId -> TransactionId -> MergeStrategy -> (HeadName, HeadName) -> TransactionGraph -> Either RelationalError (DisconnectedTransaction, TransactionGraph)
427+mergeTransactions :: UTCTime -> TransactionId -> TransactionId -> MergeStrategy -> (HeadName, HeadName) -> GraphRefRelationalExprM (DisconnectedTransaction, TransactionGraph)
396−mergeTransactions stamp newId parentId mergeStrategy (headNameA, headNameB) graph = do
428+mergeTransactions stamp' newId parentId mergeStrategy (headNameA, headNameB) = do
429+ graph <- gfGraph
397 let transactionForHeadErr name = case transactionForHead name graph of
430 let transactionForHeadErr name = case transactionForHead name graph of
398− Nothing -> Left (NoSuchHeadNameError name)
431+ Nothing -> throwError (NoSuchHeadNameError name)
399− Just t -> Right t
432+ Just t -> pure t
433+ runE e = case e of
434+ Left e' -> throwError e'
435+ Right v -> pure v
400− transA <- transactionForHeadErr headNameA
436+ transA <- transactionForHeadErr headNameA
401− transB <- transactionForHeadErr headNameB
437+ transB <- transactionForHeadErr headNameB
402− disconParent <- transactionForId parentId graph
438+ disconParent <- gfTransForId parentId
403− let subHeads = M.filterWithKey (\k _ -> elem k [headNameA, headNameB]) (transactionHeadsForGraph graph)
439+ let subHeads = M.filterWithKey (\k _ -> k `elem` [headNameA, headNameB]) (transactionHeadsForGraph graph)
404− subGraph <- subGraphOfFirstCommonAncestor graph subHeads transA transB S.empty
440+ subGraph <- runE $ subGraphOfFirstCommonAncestor graph subHeads transA transB S.empty
405− subGraph' <- filterSubGraph subGraph subHeads
441+ subGraph' <- runE $ filterSubGraph subGraph subHeads
406− case createMergeTransaction stamp newId mergeStrategy subGraph' (transA, transB) of
442+ mergedTrans <- local (const (freshGraphRefRelationalExprEnv Nothing subGraph')) $ createMergeTransaction stamp' newId mergeStrategy (transA, transB)
407− Left err -> Left (MergeTransactionError err)
408− Right mergedTrans -> case checkConstraints (concreteDatabaseContext mergedTrans) of
409− Left err -> Left err
410− Right _ -> case headNameForTransaction disconParent graph of
443+ case headNameForTransaction disconParent graph of
411− Nothing -> Left (TransactionIsNotAHeadError parentId)
444+ Nothing -> throwError (TransactionIsNotAHeadError parentId)
412 Just headName -> do
445 Just headName -> do
413− (newTrans, newGraph) <- addTransactionToGraph headName mergedTrans graph
446+ (newTrans, newGraph) <- runE $ addTransactionToGraph headName mergedTrans graph
447+ case checkConstraints (concreteDatabaseContext mergedTrans) newId graph of
448+ Left err -> throwError err
449+ Right _ -> do
414− let newGraph' = TransactionGraph (transactionHeadsForGraph newGraph) (transactionsForGraph newGraph)
450+ let newGraph' = TransactionGraph (transactionHeadsForGraph newGraph) (transactionsForGraph newGraph)
415− newDiscon = DisconnectedTransaction newId (schemas newTrans) False
451+ newDiscon = Discon.freshTransaction newId (schemas newTrans)
416− pure (newDiscon, newGraph')
452+ pure (newDiscon, newGraph')
417
453
418--TEMPORARY COPY/PASTE
454--TEMPORARY COPY/PASTE
419showTransactionStructureX :: Transaction -> TransactionGraph -> String
455showTransactionStructureX :: Transaction -> TransactionGraph -> String
420showTransactionStructureX trans graph = headInfo ++ " " ++ show (transactionId trans) ++ " " ++ parentTransactionsInfo
456showTransactionStructureX trans graph = headInfo ++ " " ++ show (transactionId trans) ++ " " ++ parentTransactionsInfo
421 where
457 where
422 headInfo = maybe "" show (headNameForTransaction trans graph)
458 headInfo = maybe "" show (headNameForTransaction trans graph)
423− parentTransactionsInfo = if isRootTransaction trans graph then "root" else case parentTransactions trans graph of
459+ parentTransactionsInfo = if isRootTransaction trans then "root" else case parentTransactions trans graph of
424 Left err -> show err
460 Left err -> show err
425 Right parentTransSet -> concat $ S.toList $ S.map (show . transactionId) parentTransSet
461 Right parentTransSet -> concat $ S.toList $ S.map (show . transactionId) parentTransSet
426
462
@@ -439,25 +475,29 @@ filterSubGraph graph heads = Right $ TransactionGraph newHeads newTransSet
439 newHeads = M.map (filterTransaction validIds) heads
475 newHeads = M.map (filterTransaction validIds) heads
440
476
441--helper function for commonalities in union merge
477--helper function for commonalities in union merge
442−createUnionMergeTransaction :: UTCTime -> TransactionId -> MergeStrategy -> TransactionGraph -> (Transaction, Transaction) -> Either MergeError Transaction
478+createUnionMergeTransaction :: UTCTime -> TransactionId -> MergeStrategy -> (Transaction, Transaction) -> GraphRefRelationalExprM Transaction
443−createUnionMergeTransaction stamp newId strategy graph (t1,t2) = do
479+createUnionMergeTransaction stamp' newId strategy (t1,t2) = do
444 let contextA = concreteDatabaseContext t1
480 let contextA = concreteDatabaseContext t1
445 contextB = concreteDatabaseContext t2
481 contextB = concreteDatabaseContext t2
446−
482+ liftMergeE x = case x of
483+ Left e -> throwError (MergeTransactionError e)
484+ Right t -> pure t
485+
486+ graph <- gfGraph
447 preference <- case strategy of
487 preference <- case strategy of
448 UnionMergeStrategy -> pure PreferNeither
488 UnionMergeStrategy -> pure PreferNeither
449 UnionPreferMergeStrategy preferBranch ->
489 UnionPreferMergeStrategy preferBranch ->
450 case transactionForHead preferBranch graph of
490 case transactionForHead preferBranch graph of
451− Nothing -> Left (PreferredHeadMissingMergeError preferBranch)
491+ Nothing -> throwError (MergeTransactionError (PreferredHeadMissingMergeError preferBranch))
452 Just preferredTrans -> pure $ if t1 == preferredTrans then PreferFirst else PreferSecond
492 Just preferredTrans -> pure $ if t1 == preferredTrans then PreferFirst else PreferSecond
453− badStrat -> Left (InvalidMergeStrategyError badStrat)
493+ badStrat -> throwError (MergeTransactionError (InvalidMergeStrategyError badStrat))
454
494
455− incDeps <- unionMergeMaps preference (inclusionDependencies contextA) (inclusionDependencies contextB)
495+ incDeps <- liftMergeE $ unionMergeMaps preference (inclusionDependencies contextA) (inclusionDependencies contextB)
456 relVars <- unionMergeRelVars preference (relationVariables contextA) (relationVariables contextB)
496 relVars <- unionMergeRelVars preference (relationVariables contextA) (relationVariables contextB)
457− atomFuncs <- unionMergeAtomFunctions preference (atomFunctions contextA) (atomFunctions contextB)
497+ atomFuncs <- liftMergeE $ unionMergeAtomFunctions preference (atomFunctions contextA) (atomFunctions contextB)
458− notifs <- unionMergeMaps preference (notifications contextA) (notifications contextB)
498+ notifs <- liftMergeE $ unionMergeMaps preference (notifications contextA) (notifications contextB)
459− types <- unionMergeTypeConstructorMapping preference (typeConstructorMapping contextA) (typeConstructorMapping contextB)
499+ types <- liftMergeE $ unionMergeTypeConstructorMapping preference (typeConstructorMapping contextA) (typeConstructorMapping contextB)
460− dbcFuncs <- unionMergeDatabaseContextFunctions preference (dbcFunctions contextA) (dbcFunctions contextB)
500+ dbcFuncs <- liftMergeE $ unionMergeDatabaseContextFunctions preference (dbcFunctions contextA) (dbcFunctions contextB)
461 -- TODO: add merge of subschemas
501 -- TODO: add merge of subschemas
462 let newContext = DatabaseContext {
502 let newContext = DatabaseContext {
463 inclusionDependencies = incDeps,
503 inclusionDependencies = incDeps,
@@ -468,7 +508,12 @@ createUnionMergeTransaction stamp newId strategy graph (t1,t2) = do
468 typeConstructorMapping = types
508 typeConstructorMapping = types
469 }
509 }
470 newSchemas = Schemas newContext (subschemas t1)
510 newSchemas = Schemas newContext (subschemas t1)
471− pure (Transaction newId (MergeTransactionInfo (transactionId t1) (transactionId t2) S.empty stamp) newSchemas)
511+ pure $ addMerkleHash graph $
512+ Transaction newId (TransactionInfo {
513+ parents = NE.fromList [transactionId t1,
514+ transactionId t2],
515+ stamp = stamp',
516+ merkleHash = mempty }) newSchemas
472
517
473lookupTransaction :: TransactionGraph -> TransactionIdLookup -> Either RelationalError Transaction
518lookupTransaction :: TransactionGraph -> TransactionIdLookup -> Either RelationalError Transaction
474lookupTransaction graph (TransactionIdLookup tid) = transactionForId tid graph
519lookupTransaction graph (TransactionIdLookup tid) = transactionForId tid graph
@@ -485,56 +530,57 @@ backtrackGraph :: TransactionGraph -> TransactionId -> TransactionIdHeadBacktrac
485-- tilde, step back one parent link- if a choice must be made, choose the "first" link arbitrarily
530-- tilde, step back one parent link- if a choice must be made, choose the "first" link arbitrarily
486backtrackGraph graph currentTid (TransactionIdHeadParentBacktrack steps) = do
531backtrackGraph graph currentTid (TransactionIdHeadParentBacktrack steps) = do
487 trans <- transactionForId currentTid graph
532 trans <- transactionForId currentTid graph
533+
488− let parents = S.toAscList (transactionParentIds trans)
534+ let parentIds' = S.toAscList (parentIds trans)
489− if length parents < 1 then
535+ case parentIds' of
490− Left RootTransactionTraversalError
536+ [] -> Left RootTransactionTraversalError
491− else do
537+ firstParentId:_ -> do
492− parentTrans <- transactionForId (head parents) graph
538+ parentTrans <- transactionForId firstParentId graph
493− if steps == 1 then
539+ if steps == 1 then
494− pure (transactionId parentTrans)
540+ pure (transactionId parentTrans)
495− else
541+ else
496− backtrackGraph graph (transactionId parentTrans) (TransactionIdHeadParentBacktrack (steps - 1))
542+ backtrackGraph graph (transactionId parentTrans) (TransactionIdHeadParentBacktrack (steps - 1))
497
543
498backtrackGraph graph currentTid (TransactionIdHeadBranchBacktrack steps) = do
544backtrackGraph graph currentTid (TransactionIdHeadBranchBacktrack steps) = do
499 trans <- transactionForId currentTid graph
545 trans <- transactionForId currentTid graph
500− let parents = transactionParentIds trans
546+ let parentIds' = parentIds trans
501− if S.size parents < 1 then
547+ if S.size parentIds' < 1 then
502 Left RootTransactionTraversalError
548 Left RootTransactionTraversalError
503− else if S.size parents < steps then
549+ else if S.size parentIds' < steps then
504− Left (ParentCountTraversalError (S.size parents) steps)
550+ Left (ParentCountTraversalError (S.size parentIds') steps)
505 else
551 else
506− pure (S.elemAt (steps - 1) parents)
552+ pure (S.elemAt (steps - 1) parentIds')
507
553
508−backtrackGraph graph currentTid btrack@(TransactionStampHeadBacktrack stamp) = do
554+backtrackGraph graph currentTid btrack@(TransactionStampHeadBacktrack stamp') = do
509 trans <- transactionForId currentTid graph
555 trans <- transactionForId currentTid graph
510− let parents = transactionParentIds trans
556+ let parentIds' = parentIds trans
511− if transactionTimestamp trans <= stamp then
557+ if timestamp trans <= stamp' then
512 pure currentTid
558 pure currentTid
513− else if S.null parents then
559+ else if S.null parentIds' then
514 Left RootTransactionTraversalError
560 Left RootTransactionTraversalError
515 else
561 else
516− let arbitraryParent = head (S.toList parents) in
562+ let arbitraryParent = head (S.toList parentIds') in
517 backtrackGraph graph arbitraryParent btrack
563 backtrackGraph graph arbitraryParent btrack
518
564
519-- | 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.
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--this is not a GraphOp because it combines multiple graph operations
566--this is not a GraphOp because it combines multiple graph operations
521autoMergeToHead :: UTCTime -> (TransactionId, TransactionId, TransactionId) -> DisconnectedTransaction -> HeadName -> MergeStrategy -> TransactionGraph -> Either RelationalError (DisconnectedTransaction, TransactionGraph)
567autoMergeToHead :: UTCTime -> (TransactionId, TransactionId, TransactionId) -> DisconnectedTransaction -> HeadName -> MergeStrategy -> TransactionGraph -> Either RelationalError (DisconnectedTransaction, TransactionGraph)
522−autoMergeToHead stamp (tempBranchTransId, tempCommitTransId, mergeTransId) discon mergeToHeadName strat graph = do
568+autoMergeToHead stamp' (tempBranchTransId, tempCommitTransId, mergeTransId) discon mergeToHeadName strat graph = do
523 let tempBranchName = "mergebranch_" <> U.toText tempBranchTransId
569 let tempBranchName = "mergebranch_" <> U.toText tempBranchTransId
524 --create the temp branch
570 --create the temp branch
525− (discon', graph') <- evalGraphOp stamp tempBranchTransId discon graph (Branch tempBranchName)
571+ (discon', graph') <- evalGraphOp stamp' tempBranchTransId discon graph (Branch tempBranchName)
526
572
527 --commit to the new branch- possible future optimization: don't require fsync for this- create a temp commit type
573 --commit to the new branch- possible future optimization: don't require fsync for this- create a temp commit type
528− (discon'', graph'') <- evalGraphOp stamp tempCommitTransId discon' graph' Commit
574+ (discon'', graph'') <- evalGraphOp stamp' tempCommitTransId discon' graph' Commit
529
575
530 --jump to merge head
576 --jump to merge head
531− (discon''', graph''') <- evalGraphOp stamp tempBranchTransId discon'' graph'' (JumpToHead mergeToHeadName)
577+ (discon''', graph''') <- evalGraphOp stamp' tempBranchTransId discon'' graph'' (JumpToHead mergeToHeadName)
532
578
533 --create the merge
579 --create the merge
534− (discon'''', graph'''') <- evalGraphOp stamp mergeTransId discon''' graph''' (MergeTransactions strat tempBranchName mergeToHeadName)
580+ (discon'''', graph'''') <- evalGraphOp stamp' mergeTransId discon''' graph''' (MergeTransactions strat tempBranchName mergeToHeadName)
535
581
536 --delete the temp branch
582 --delete the temp branch
537− (discon''''', graph''''') <- evalGraphOp stamp tempBranchTransId discon'''' graph'''' (DeleteBranch tempBranchName)
583+ (discon''''', graph''''') <- evalGraphOp stamp' tempBranchTransId discon'''' graph'''' (DeleteBranch tempBranchName)
538 {-
584 {-
539 let rel = runReader (evalRelationalExpr (RelationVariable "s" ())) (mkRelationalExprState $ D.concreteDatabaseContext discon'''')
585 let rel = runReader (evalRelationalExpr (RelationVariable "s" ())) (mkRelationalExprState $ D.concreteDatabaseContext discon'''')
540 traceShowM rel
586 traceShowM rel
@@ -542,4 +588,48 @@ autoMergeToHead stamp (tempBranchTransId, tempCommitTransId, mergeTransId) disco
542
588
543 pure (discon''''', graph''''')
589 pure (discon''''', graph''''')
544
590
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 }
545
596
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+16−12
@@ -2,10 +2,11 @@
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)
5import qualified Data.Set as S
7import qualified Data.Set as S
6import qualified Data.Map as M
8import qualified Data.Map as M
7import qualified ProjectM36.TypeConstructorDef as TCD
9import qualified ProjectM36.TypeConstructorDef as TCD
8−import ProjectM36.Relation
9import Control.Monad (foldM)
10import Control.Monad (foldM)
10import qualified Data.HashSet as HS
11import qualified Data.HashSet as HS
11
12
@@ -22,19 +23,22 @@ unionMergeMaps prefer mapA mapB = case prefer of
22 Left StrategyViolatesComponentMergeError
23 Left StrategyViolatesComponentMergeError
23
24
24-- perform the merge even if the attributes are different- is this what we want? Obviously, we need finer-grained merge options.
25-- perform the merge even if the attributes are different- is this what we want? Obviously, we need finer-grained merge options.
25−unionMergeRelation :: MergePreference -> Relation -> Relation -> Either MergeError Relation
26+unionMergeRelation :: MergePreference -> GraphRefRelationalExpr -> GraphRefRelationalExpr -> GraphRefRelationalExprM GraphRefRelationalExpr
26−unionMergeRelation prefer relA relB = case relA `union` relB of
27+unionMergeRelation prefer relA relB = do
27− Right unionRel -> pure unionRel
28+ let unioned = Union relA relB
28− Left (AttributeNamesMismatchError _) -> preferredRelVar
29− Left _ -> Left StrategyViolatesRelationVariableMergeError
29+ mergeErr = MergeTransactionError StrategyViolatesRelationVariableMergeError
30− where
31− preferredRelVar = case prefer of
30+ preferredRelVar =
31+ case prefer of
32− PreferFirst -> Right relA
32+ PreferFirst -> pure relA
33− PreferSecond -> Right relB
33+ PreferSecond -> pure relB
34− PreferNeither -> Left StrategyViolatesRelationVariableMergeError
34+ PreferNeither -> throwError mergeErr
35+ handler AttributeNamesMismatchError{} = preferredRelVar
36+ handler _err' = throwError mergeErr
37+ --typecheck first?
38+ (evalGraphRefRelationalExpr unioned >> pure (Union relA relB)) `catchError` handler
35
39
36--try to execute unions against the relvars contents -- if a relvar only appears in one context, include it
40--try to execute unions against the relvars contents -- if a relvar only appears in one context, include it
37−unionMergeRelVars :: MergePreference -> RelationVariables -> RelationVariables -> Either MergeError RelationVariables
41+unionMergeRelVars :: MergePreference -> RelationVariables -> RelationVariables -> GraphRefRelationalExprM RelationVariables
38unionMergeRelVars prefer relvarsA relvarsB = do
42unionMergeRelVars prefer relvarsA relvarsB = do
39 let allNames = S.toList (S.union (M.keysSet relvarsA) (M.keysSet relvarsB))
43 let allNames = S.toList (S.union (M.keysSet relvarsA) (M.keysSet relvarsB))
40 foldM (\acc name -> do
44 foldM (\acc name -> do
src/lib/ProjectM36/TransactionGraph/Persist.hs+8−5
@@ -1,8 +1,8 @@
1module ProjectM36.TransactionGraph.Persist where
1module ProjectM36.TransactionGraph.Persist where
2import ProjectM36.Error
2import ProjectM36.Error
3−import ProjectM36.TransactionGraph
4import ProjectM36.Transaction
3import ProjectM36.Transaction
5import ProjectM36.Transaction.Persist
4import 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)
@@ -24,7 +24,9 @@ import Control.Exception.Base
24import qualified Data.ByteString as BS
24import qualified Data.ByteString as BS
25import qualified Data.Text.Encoding as TE
25import qualified Data.Text.Encoding as TE
26import Data.ByteString (ByteString)
26import Data.ByteString (ByteString)
27+#if __GLASGOW_HASKELL__ < 804
27import Data.Monoid
28import Data.Monoid
29+#endif
28import qualified Crypto.Hash.SHA256 as SHA256
30import qualified Crypto.Hash.SHA256 as SHA256
29import Control.Arrow
31import Control.Arrow
30import Data.Time.Clock
32import Data.Time.Clock
@@ -192,12 +194,12 @@ writeGraphTransactionIdFile sync destDirectory (TransactionGraph _ transSet) = w
192 uuidInfo = T.intercalate "\n" graphLines
194 uuidInfo = T.intercalate "\n" graphLines
193 digest = SHA256.hash (encodeUtf8 uuidInfo)
195 digest = SHA256.hash (encodeUtf8 uuidInfo)
194 graphLines = S.toList $ S.map graphLine transSet
196 graphLines = S.toList $ S.map graphLine transSet
195− epochTime = realToFrac . utcTimeToPOSIXSeconds . transactionTimestamp :: Transaction -> Double
197+ epochTime = realToFrac . utcTimeToPOSIXSeconds . timestamp :: Transaction -> Double
196 graphLine trans = U.toText (transactionId trans)
198 graphLine trans = U.toText (transactionId trans)
197 <> " "
199 <> " "
198 <> T.pack (show (epochTime trans))
200 <> T.pack (show (epochTime trans))
199 <> " "
201 <> " "
200− <> T.intercalate " " (S.toList (S.map U.toText $ transactionParentIds trans))
202+ <> T.intercalate " " (S.toList (S.map U.toText $ parentIds trans))
201
203
202readGraphTransactionIdFileDigest :: FilePath -> IO LockFileHash
204readGraphTransactionIdFileDigest :: FilePath -> IO LockFileHash
203readGraphTransactionIdFileDigest dbdir = do
205readGraphTransactionIdFileDigest dbdir = do
@@ -207,8 +209,8 @@ readGraphTransactionIdFileDigest dbdir = do
207readGraphTransactionIdFile :: FilePath -> IO (Either PersistenceError [(TransactionId, UTCTime, [TransactionId])])
209readGraphTransactionIdFile :: FilePath -> IO (Either PersistenceError [(TransactionId, UTCTime, [TransactionId])])
208readGraphTransactionIdFile dbdir = do
210readGraphTransactionIdFile dbdir = do
209 --read in all transactions' uuids
211 --read in all transactions' uuids
210− let grapher line = let tid:epochText:parentIds = T.words line in
212+ let grapher line = let tid:epochText:parentIds' = T.words line in
211− (readUUID tid, readEpoch epochText, map readUUID parentIds)
213+ (readUUID tid, readEpoch epochText, map readUUID parentIds')
212 readUUID uuidText = fromMaybe (error "failed to read uuid") (U.fromText uuidText)
214 readUUID uuidText = fromMaybe (error "failed to read uuid") (U.fromText uuidText)
213 readEpoch t = posixSecondsToUTCTime (realToFrac (either (error "failed to read epoch") fst (double t)))
215 readEpoch t = posixSecondsToUTCTime (realToFrac (either (error "failed to read epoch") fst (double t)))
214 Right . map grapher . T.lines <$> readUTF8FileOrError (transactionLogPath dbdir)
216 Right . map grapher . T.lines <$> readUTF8FileOrError (transactionLogPath dbdir)
@@ -223,3 +225,4 @@ readUTF8FileOrError pathIn = do
223 case TE.decodeUtf8' fileBytes of
225 case TE.decodeUtf8' fileBytes of
224 Left err -> error (show err)
226 Left err -> error (show err)
225 Right utf8Bytes -> pure utf8Bytes
227 Right utf8Bytes -> pure utf8Bytes
228+
src/lib/ProjectM36/TransactionGraph/Show.hs+3−4
@@ -1,17 +1,16 @@
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
5import qualified Data.Set as S
4import qualified Data.Set as S
6
5
7showTransactionStructure :: Transaction -> TransactionGraph -> String
6showTransactionStructure :: Transaction -> TransactionGraph -> String
8−showTransactionStructure trans graph = headInfo ++ " " ++ show (transactionId trans) ++ " p" ++ parentTransactionsInfo ++ " c" ++ childTransactionsInfo
7+showTransactionStructure trans graph = headInfo ++ " " ++ show (transactionId trans) ++ " p" ++ parentTransactionsInfo
9 where
8 where
10 headInfo = maybe "" show (headNameForTransaction trans graph)
9 headInfo = maybe "" show (headNameForTransaction trans graph)
11− parentTransactionsInfo = if isRootTransaction trans graph then "root" else case parentTransactions trans graph of
10+ parentTransactionsInfo = if isRootTransaction trans then "root" else case parentTransactions trans graph of
12 Left err -> show err
11 Left err -> show err
13 Right parentTransSet -> concat $ S.toList $ S.map (show . transactionId) parentTransSet
12 Right parentTransSet -> concat $ S.toList $ S.map (show . transactionId) parentTransSet
14− childTransactionsInfo = show (S.toList (transactionChildIds trans))
13+
15
14
16showGraphStructure :: TransactionGraph -> String
15showGraphStructure :: TransactionGraph -> String
17showGraphStructure graph@(TransactionGraph _ transSet) = S.foldr folder "" transSet
16showGraphStructure graph@(TransactionGraph _ transSet) = S.foldr folder "" transSet
src/lib/ProjectM36/TransactionGraph/Types.hsnew file+12
@@ -0,0 +1,12 @@
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.hsnew file+12
@@ -0,0 +1,12 @@
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+47−40
@@ -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
4+import ProjectM36.Attribute as A
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 V.empty V.empty
18+emptyTuple = RelationTuple mempty mempty
19
19
20tupleSize :: RelationTuple -> Int
20tupleSize :: RelationTuple -> Int
21−tupleSize (RelationTuple tupAttrs _) = V.length tupAttrs
21+tupleSize (RelationTuple tupAttrs _) = arity tupAttrs
22
22
23tupleAttributeNameSet :: RelationTuple -> S.Set AttributeName
23tupleAttributeNameSet :: RelationTuple -> S.Set AttributeName
24−tupleAttributeNameSet (RelationTuple tupAttrs _) = S.fromList $ V.toList $ V.map attributeName tupAttrs
24+tupleAttributeNameSet (RelationTuple tupAttrs _) = attributeNameSet 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 attrVec tupVec) = V.toList $ V.map (first attributeName) (V.zip attrVec tupVec)
30+tupleAssocs (RelationTuple attrs tupVec) = V.toList $ V.map (first attributeName) (V.zip (attributesVec attrs) 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,19 +42,12 @@ 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) tupAttrs of
45+atomForAttributeName attrName (RelationTuple tupAttrs tupVec) = case V.findIndex (\attr -> attributeName attr == attrName) (attributesVec 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−
58atomsForAttributeNames :: V.Vector AttributeName -> RelationTuple -> Either RelationalError (V.Vector Atom)
51atomsForAttributeNames :: V.Vector AttributeName -> RelationTuple -> Either RelationalError (V.Vector Atom)
59atomsForAttributeNames attrNames tuple =
52atomsForAttributeNames attrNames tuple =
60 V.map (\index -> tupleAtoms tuple V.! index) <$> vectorIndicesForAttributeNames attrNames (tupleAttributes tuple)
53 V.map (\index -> tupleAtoms tuple V.! index) <$> vectorIndicesForAttributeNames attrNames (tupleAttributes tuple)
@@ -66,7 +59,7 @@ vectorIndicesForAttributeNames attrNameVec attrs = if not $ V.null unknownAttrNa
66 Right $ V.map mapper attrNameVec
59 Right $ V.map mapper attrNameVec
67 where
60 where
68 unknownAttrNames = V.filter (`V.notElem` attributeNames attrs) attrNameVec
61 unknownAttrNames = V.filter (`V.notElem` attributeNames attrs) attrNameVec
69− mapper attrName = fromMaybe (error "logic failure in vectorIndicesForAttributeNames") (V.elemIndex attrName (V.map attributeName attrs))
62+ mapper attrName = fromMaybe (error "logic failure in vectorIndicesForAttributeNames") (V.elemIndex attrName (attributeNames attrs))
70
63
71
64
72relationForAttributeName :: AttributeName -> RelationTuple -> Either RelationalError Relation
65relationForAttributeName :: AttributeName -> RelationTuple -> Either RelationalError Relation
@@ -93,10 +86,10 @@ mkRelationTuples attrs = map mapper
93 mapper = mkRelationTuple attrs
86 mapper = mkRelationTuple attrs
94
87
95mkRelationTupleFromMap :: M.Map AttributeName Atom -> RelationTuple
88mkRelationTupleFromMap :: M.Map AttributeName Atom -> RelationTuple
96−mkRelationTupleFromMap attrMap = RelationTuple attrs (V.map (\attrName -> attrMap M.! attrName) attrNames)
89+mkRelationTupleFromMap attrMap = RelationTuple (attributesFromList attrs) (V.map (attrMap M.!) (V.fromList attrNames))
97 where
90 where
98− attrNames = V.fromList (M.keys attrMap)
91+ attrNames = M.keys attrMap
99− attrs = V.map (\attrName -> Attribute attrName (atomTypeForAtom (attrMap M.! attrName))) attrNames
92+ attrs = map (\attrName -> Attribute attrName (atomTypeForAtom (attrMap M.! attrName))) attrNames
100
93
101--return error if attribute names match but their types do not
94--return error if attribute names match but their types do not
102singleTupleSetJoin :: Attributes -> RelationTuple -> RelationTupleSet -> Either RelationalError [RelationTuple]
95singleTupleSetJoin :: Attributes -> RelationTuple -> RelationTupleSet -> Either RelationalError [RelationTuple]
@@ -127,8 +120,8 @@ singleTupleJoin joinedAttrs tup1@(RelationTuple tupAttrs1 _) tup2@(RelationTuple
127 return $ Just $ RelationTuple joinedAttrs newVec
120 return $ Just $ RelationTuple joinedAttrs newVec
128 where
121 where
129 keysIntersection = V.map attributeName attrsIntersection
122 keysIntersection = V.map attributeName attrsIntersection
130− attrsIntersection = V.filter (`V.elem` tupAttrs1) tupAttrs2
123+ attrsIntersection = V.filter (`V.elem` attributesVec tupAttrs1) (attributesVec tupAttrs2)
131− newVec = V.map (findAtomForAttributeName . attributeName) joinedAttrs
124+ newVec = V.map (findAtomForAttributeName . attributeName) (attributesVec joinedAttrs)
132 --search both tuples for the attribute
125 --search both tuples for the attribute
133 findAtomForAttributeName attrName = head $ rights $ fmap (atomForAttributeName attrName) [tup1, tup2]
126 findAtomForAttributeName attrName = head $ rights $ fmap (atomForAttributeName attrName) [tup1, tup2]
134
127
@@ -145,23 +138,31 @@ vectorUnion v1 v2 = V.foldr folder v1 v2
145tupleExtend :: RelationTuple -> RelationTuple -> RelationTuple
138tupleExtend :: RelationTuple -> RelationTuple -> RelationTuple
146tupleExtend (RelationTuple tupAttrs1 tupVec1) (RelationTuple tupAttrs2 tupVec2) = RelationTuple newAttrs newVec
139tupleExtend (RelationTuple tupAttrs1 tupVec1) (RelationTuple tupAttrs2 tupVec2) = RelationTuple newAttrs newVec
147 where
140 where
148− newAttrs = tupAttrs1 V.++ tupAttrs2
141+ newAttrs = tupAttrs1 <> tupAttrs2
149− newVec = tupVec1 V.++ tupVec2
142+ newVec = tupVec1 <> tupVec2
150
143
151tupleAtomExtend :: AttributeName -> Atom -> RelationTuple -> RelationTuple
144tupleAtomExtend :: AttributeName -> Atom -> RelationTuple -> RelationTuple
152tupleAtomExtend newAttrName atom tupIn = tupleExtend tupIn newTup
145tupleAtomExtend newAttrName atom tupIn = tupleExtend tupIn newTup
153 where
146 where
154− newTup = RelationTuple (V.singleton $ Attribute newAttrName (atomTypeForAtom atom)) (V.singleton atom)
147+ newTup = RelationTuple (A.singleton $ Attribute newAttrName (atomTypeForAtom atom)) (V.singleton atom)
155
148
156−--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)]
157−tupleProject :: S.Set AttributeName -> RelationTuple -> RelationTuple
149+{-tupleProject :: S.Set AttributeName -> RelationTuple -> RelationTuple
158tupleProject projectAttrs (RelationTuple attrs tupVec) = RelationTuple newAttrs newTupVec
150tupleProject projectAttrs (RelationTuple attrs tupVec) = RelationTuple newAttrs newTupVec
159 where
151 where
160− deleteIndices = V.findIndices (\attr -> S.notMember (attributeName attr) projectAttrs) attrs
152+ deleteIndices = V.findIndices (\attr -> S.notMember (attributeName attr) projectAttrs) (attributesVec attrs)
161 indexDeleter = V.ifilter (\index _ -> V.notElem index deleteIndices)
153 indexDeleter = V.ifilter (\index _ -> V.notElem index deleteIndices)
162− newAttrs = indexDeleter attrs
154+ newAttrs = case A.projectionAttributesForNames projectAttrs attrs of
155+ Left err -> error (show (err, projectAttrs, attrs))
156+ Right attrs' -> attrs'
163 newTupVec = indexDeleter tupVec
157 newTupVec = indexDeleter tupVec
164−
158+-}
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)
165--return the attributes and atoms which are equal in both vectors
166--return the attributes and atoms which are equal in both vectors
166--semi-join
167--semi-join
167tupleIntersection :: RelationTuple -> RelationTuple -> RelationTuple
168tupleIntersection :: RelationTuple -> RelationTuple -> RelationTuple
@@ -169,12 +170,14 @@ tupleIntersection tuple1 tuple2 = RelationTuple newAttrs newTupVec
169 where
170 where
170 attrs1 = tupleAttributes tuple1
171 attrs1 = tupleAttributes tuple1
171 attrs2 = tupleAttributes tuple2
172 attrs2 = tupleAttributes tuple2
173+ intersectAttrs = A.intersection attrs1 attrs2
172− matchingIndices = V.findIndices (\attr -> V.elem attr attrs2 &&
174+ matchingIndices = V.findIndices (\attr -> A.member attr intersectAttrs &&
173− atomForAttributeName (attributeName attr) tuple1 ==
175+ atomForAttributeName (attributeName attr) tuple1 ==
174− atomForAttributeName (attributeName attr) tuple2
176+ atomForAttributeName (attributeName attr) tuple2) (attributesVec attrs1)
175− ) attrs1
176 indexFilter = V.ifilter (\index _ -> V.elem index matchingIndices)
177 indexFilter = V.ifilter (\index _ -> V.elem index matchingIndices)
177− newAttrs = indexFilter attrs1
178+ newAttrs = case A.projectionAttributesForNames (A.attributeNameSet intersectAttrs) attrs1 of
179+ Left _ -> mempty
180+ Right attrs' -> attrs'
178 newTupVec = indexFilter (tupleAtoms tuple1)
181 newTupVec = indexFilter (tupleAtoms tuple1)
179
182
180-- | An optimized form of tuple update which updates vectors efficiently.
183-- | An optimized form of tuple update which updates vectors efficiently.
@@ -182,19 +185,20 @@ updateTupleWithAtoms :: M.Map AttributeName Atom -> RelationTuple -> RelationTup
182updateTupleWithAtoms updateMap (RelationTuple attrs tupVec) = RelationTuple attrs newVec
185updateTupleWithAtoms updateMap (RelationTuple attrs tupVec) = RelationTuple attrs newVec
183 where
186 where
184 updateKeysSet = M.keysSet updateMap
187 updateKeysSet = M.keysSet updateMap
185− updateKeysIVec = V.filter (\(_,attr) -> S.member (attributeName attr) updateKeysSet) (V.indexed attrs)
188+ updateKeysIVec = V.filter (\(_,attr) -> S.member (attributeName attr) updateKeysSet) (V.indexed (attributesVec attrs))
186 newVec = V.update tupVec updateVec
189 newVec = V.update tupVec updateVec
187 updateVec = V.map (\(index, attr) -> (index, updateMap M.! attributeName attr)) updateKeysIVec
190 updateVec = V.map (\(index, attr) -> (index, updateMap M.! attributeName attr)) updateKeysIVec
188
191
189tupleToMap :: RelationTuple -> M.Map AttributeName Atom
192tupleToMap :: RelationTuple -> M.Map AttributeName Atom
190tupleToMap (RelationTuple attrs tupVec) = M.fromList assocList
193tupleToMap (RelationTuple attrs tupVec) = M.fromList assocList
191 where
194 where
192− assocList = V.toList $ V.map (\(index, attr) -> (attributeName attr, tupVec V.! index)) (V.indexed attrs)
195+ assocList = V.toList $ V.map (\(index, attr) -> (attributeName attr, tupVec V.! index)) (V.indexed (attributesVec attrs))
193
196
197+-- | Validate that the tuple has the correct attributes in the correct order
194verifyTuple :: Attributes -> RelationTuple -> Either RelationalError RelationTuple
198verifyTuple :: Attributes -> RelationTuple -> Either RelationalError RelationTuple
195−verifyTuple attrs tuple = let attrsTypes = V.map atomType attrs
199+verifyTuple attrs tuple = let attrsTypes = A.atomTypes attrs
196 tupleTypes = V.map atomTypeForAtom (tupleAtoms tuple) in
200 tupleTypes = V.map atomTypeForAtom (tupleAtoms tuple) in
197− if V.length attrs /= V.length tupleTypes then
201+ if A.arity attrs /= V.length tupleTypes then
198 Left $ TupleAttributeCountMismatchError 0
202 Left $ TupleAttributeCountMismatchError 0
199 else do
203 else do
200 mapM_ (uncurry atomTypeVerify) (V.zip attrsTypes tupleTypes)
204 mapM_ (uncurry atomTypeVerify) (V.zip attrsTypes tupleTypes)
@@ -203,15 +207,18 @@ verifyTuple attrs tuple = let attrsTypes = V.map atomType attrs
203--two tuples can be equal but the vectors of attributes could be out-of-order
207--two tuples can be equal but the vectors of attributes could be out-of-order
204--reorder if necessary- this is useful during relMogrify so that all the relation's tuples have identical atom/attribute ordering
208--reorder if necessary- this is useful during relMogrify so that all the relation's tuples have identical atom/attribute ordering
205reorderTuple :: Attributes -> RelationTuple -> RelationTuple
209reorderTuple :: Attributes -> RelationTuple -> RelationTuple
206−reorderTuple attrs tupIn = if tupleAttributes tupIn == attrs then
210+reorderTuple attrs tupIn = if attributesAndOrderEqual (tupleAttributes tupIn) attrs then
207 tupIn
211 tupIn
208 else
212 else
209− RelationTuple attrs (V.map mapper attrs)
213+ RelationTuple attrs (V.map mapper (attributesVec attrs))
210 where
214 where
211 mapper attr = case atomForAttributeName (attributeName attr) tupIn of
215 mapper attr = case atomForAttributeName (attributeName attr) tupIn of
212− Left err -> error ("logic bug in reorderTuple: " ++ show err)
216+ Left err -> error ("logic bug in reorderTuple: " ++ show err <> show tupIn)
213 Right atom -> atom
217 Right atom -> atom
214
218
215--used in Generics derivation for ADTs without named attributes
219--used in Generics derivation for ADTs without named attributes
216trimTuple :: Int -> RelationTuple -> RelationTuple
220trimTuple :: Int -> RelationTuple -> RelationTuple
217−trimTuple index (RelationTuple attrs vals) = RelationTuple (V.drop index attrs) (V.drop index vals)
221+trimTuple index (RelationTuple attrs vals) =
222+ RelationTuple newAttrs (V.drop index vals)
223+ where
224+ newAttrs = A.drop index attrs
src/lib/ProjectM36/TupleSet.hs+7
@@ -31,3 +31,10 @@ 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+112−32
@@ -4,19 +4,41 @@
4{-# LANGUAGE ScopedTypeVariables #-}
4{-# LANGUAGE ScopedTypeVariables #-}
5{-# LANGUAGE TypeOperators #-}
5{-# LANGUAGE TypeOperators #-}
6{-# LANGUAGE UndecidableInstances #-}
6{-# LANGUAGE UndecidableInstances #-}
7−
7+{-# LANGUAGE CPP #-}
8+
8−module ProjectM36.Tupleable where
9+module ProjectM36.Tupleable
10+ ( toInsertExpr
11+ , toDefineExpr
12+ , tupleAssocsEqualityPredicate
13+ , partitionByAttributes
14+ , toUpdateExpr
15+ , toDeleteExpr
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
9
29
10import Data.Foldable
30import Data.Foldable
11import Data.List (partition)
31import Data.List (partition)
12import qualified Data.Map as Map
32import qualified Data.Map as Map
33+#if __GLASGOW_HASKELL__ < 804
13import Data.Monoid
34import Data.Monoid
35+#endif
14import Data.Proxy
36import Data.Proxy
15import qualified Data.Text as T
37import qualified Data.Text as T
16import qualified Data.Vector as V
38import qualified Data.Vector as V
17import GHC.Generics
39import GHC.Generics
18import ProjectM36.Atomable
40import ProjectM36.Atomable
19−import ProjectM36.Attribute hiding (null)
41+import ProjectM36.Attribute as A hiding (null, toList)
20import ProjectM36.Base
42import ProjectM36.Base
21import ProjectM36.DataTypes.Primitive
43import ProjectM36.DataTypes.Primitive
22import ProjectM36.Error
44import ProjectM36.Error
@@ -67,7 +89,7 @@ toInsertExpr vals rvName = do
67
89
68-- | 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'.
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'.
69toDefineExpr :: forall a proxy. Tupleable a => proxy a -> RelVarName -> DatabaseContextExpr
91toDefineExpr :: forall a proxy. Tupleable a => proxy a -> RelVarName -> DatabaseContextExpr
70−toDefineExpr _ rvName = Define rvName (map NakedAttributeExpr (V.toList attrs))
92+toDefineExpr _ rvName = Define rvName (map NakedAttributeExpr (V.toList (attributesVec attrs)))
71 where
93 where
72 attrs = toAttributes (Proxy :: Proxy a)
94 attrs = toAttributes (Proxy :: Proxy a)
73
95
@@ -118,56 +140,110 @@ validateAttributes actualAttrs expectedAttrs val
118 where
140 where
119 nonMatchingAttrs = attributeNamesNotContained actualAttrs expectedAttrs
141 nonMatchingAttrs = attributeNamesNotContained actualAttrs expectedAttrs
120
142
121−
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
122class Tupleable a where
164class Tupleable a where
123 toTuple :: a -> RelationTuple
165 toTuple :: a -> RelationTuple
124
166
125 fromTuple :: RelationTuple -> Either RelationalError a
167 fromTuple :: RelationTuple -> Either RelationalError a
126
168
127− toAttributes :: proxy a -> Attributes
169+ toAttributes :: Proxy a -> Attributes
128
170
129 default toTuple :: (Generic a, TupleableG (Rep a)) => a -> RelationTuple
171 default toTuple :: (Generic a, TupleableG (Rep a)) => a -> RelationTuple
130− toTuple v = toTupleG (from v)
172+ toTuple = genericToTuple defaultTupleableOptions
131
173
132 default fromTuple :: (Generic a, TupleableG (Rep a)) => RelationTuple -> Either RelationalError a
174 default fromTuple :: (Generic a, TupleableG (Rep a)) => RelationTuple -> Either RelationalError a
175+ fromTuple = genericFromTuple defaultTupleableOptions
176+
177+ default toAttributes :: (Generic a, TupleableG (Rep a)) => Proxy a -> Attributes
178+ toAttributes = genericToAttributes defaultTupleableOptions
179+
180+-- | Options that influence deriving behavior.
181+newtype TupleableOptions = TupleableOptions {
182+ -- | A function that translates record field names into attribute names.
183+ fieldModifier :: T.Text -> T.Text
184+ }
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
133− fromTuple tup = to <$> fromTupleG tup
208+genericFromTuple opts tup = to <$> fromTupleG opts tup
134
209
135− default toAttributes :: (Generic a, TupleableG (Rep a)) => proxy a -> Attributes
210+genericToAttributes :: forall a. (Generic a, TupleableG (Rep a)) => TupleableOptions -> Proxy a -> Attributes
136− toAttributes _ = toAttributesG (from (undefined :: a))
211+genericToAttributes opts _ = toAttributesG opts (from (undefined :: a))
137
212
138class TupleableG g where
213class TupleableG g where
139− toTupleG :: g a -> RelationTuple
214+ toTupleG :: TupleableOptions -> g a -> RelationTuple
140− toAttributesG :: g a -> Attributes
215+ toAttributesG :: TupleableOptions -> g a -> Attributes
141− fromTupleG :: RelationTuple -> Either RelationalError (g a)
216+ fromTupleG :: TupleableOptions -> RelationTuple -> Either RelationalError (g a)
142 isRecordTypeG :: g a -> Bool
217 isRecordTypeG :: g a -> Bool
143
218
144--data type metadata
219--data type metadata
145instance (Datatype c, TupleableG a) => TupleableG (M1 D c a) where
220instance (Datatype c, TupleableG a) => TupleableG (M1 D c a) where
146− toTupleG (M1 v) = toTupleG v
221+ toTupleG opts (M1 v) = toTupleG opts v
147− toAttributesG (M1 v) = toAttributesG v
222+ toAttributesG opts (M1 v) = toAttributesG opts v
148− fromTupleG v = M1 <$> fromTupleG v
223+ fromTupleG opts v = M1 <$> fromTupleG opts v
149 isRecordTypeG (M1 v) = isRecordTypeG v
224 isRecordTypeG (M1 v) = isRecordTypeG v
150
225
151--constructor metadata
226--constructor metadata
152instance (Constructor c, TupleableG a, AtomableG a) => TupleableG (M1 C c a) where
227instance (Constructor c, TupleableG a, AtomableG a) => TupleableG (M1 C c a) where
153− toTupleG (M1 v) = RelationTuple attrs atoms
228+ toTupleG opts (M1 v) = RelationTuple attrs atoms
154 where
229 where
155− attrsToCheck = toAttributesG v
230+ attrsToCheck = toAttributesG opts v
156− counter = V.generate (V.length attrsToCheck) id
231+ counter = V.generate (arity attrsToCheck) id
232+ attrs = attributesFromList (V.toList attrsV)
157− 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
158 Attribute ("attr" <> T.pack (show (num + 1))) typ
234 Attribute ("attr" <> T.pack (show (num + 1))) typ
159 else
235 else
160− attr) counter attrsToCheck
236+ attr) counter (attributesVec attrsToCheck)
161 atoms = V.fromList (toAtomsG v)
237 atoms = V.fromList (toAtomsG v)
162− toAttributesG (M1 v) = toAttributesG v
238+ toAttributesG opts (M1 v) = toAttributesG opts v
163− fromTupleG tup = M1 <$> fromTupleG tup
239+ fromTupleG opts tup = M1 <$> fromTupleG opts tup
164 isRecordTypeG (M1 v) = isRecordTypeG v
240 isRecordTypeG (M1 v) = isRecordTypeG v
165
241
166-- product types
242-- product types
167instance (TupleableG a, TupleableG b) => TupleableG (a :*: b) where
243instance (TupleableG a, TupleableG b) => TupleableG (a :*: b) where
168 toTupleG = error "toTupleG"
244 toTupleG = error "toTupleG"
169− 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
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
170− fromTupleG tup = (:*:) <$> fromTupleG tup <*> fromTupleG processedTuple
246+ fromTupleG opts tup = (:*:) <$> fromTupleG opts tup <*> fromTupleG opts processedTuple
171 where
247 where
172 processedTuple = if isRecordTypeG (undefined :: a x) then
248 processedTuple = if isRecordTypeG (undefined :: a x) then
173 tup
249 tup
@@ -178,18 +254,22 @@ instance (TupleableG a, TupleableG b) => TupleableG (a :*: b) where
178--selector/record
254--selector/record
179instance (Selector c, AtomableG a) => TupleableG (M1 S c a) where
255instance (Selector c, AtomableG a) => TupleableG (M1 S c a) where
180 toTupleG = error "toTupleG"
256 toTupleG = error "toTupleG"
181− toAttributesG m@(M1 v) = V.singleton (Attribute name aType)
257+ toAttributesG opts m@(M1 v) = A.singleton (Attribute modifiedName aType)
182 where
258 where
183 name = T.pack (selName m)
259 name = T.pack (selName m)
260+ modifiedName = if T.null name then
261+ name
262+ else
263+ fieldModifier opts name
184 aType = toAtomTypeG v
264 aType = toAtomTypeG v
185− fromTupleG tup = if null name then -- non-record type, just pull off the first tuple item
265+ fromTupleG opts tup = if null name then -- non-record type, just pull off the first tuple item
186 M1 <$> atomv (V.head (tupleAtoms tup))
266 M1 <$> atomv (V.head (tupleAtoms tup))
187 else do
267 else do
188− atom <- atomForAttributeName (T.pack name) tup
268+ atom <- atomForAttributeName (fieldModifier opts (T.pack name)) tup
189 val <- atomv atom
269 val <- atomv atom
190 pure (M1 val)
270 pure (M1 val)
191 where
271 where
192− expectedAtomType = atomType (V.head (toAttributesG (undefined :: M1 S c a x)))
272+ expectedAtomType = atomType (V.head (attributesVec (toAttributesG opts (undefined :: M1 S c a x))))
193 atomv atom = maybe (Left (AtomTypeMismatchError
273 atomv atom = maybe (Left (AtomTypeMismatchError
194 expectedAtomType
274 expectedAtomType
195 (atomTypeForAtom atom)
275 (atomTypeForAtom atom)
@@ -200,8 +280,8 @@ instance (Selector c, AtomableG a) => TupleableG (M1 S c a) where
200--constructors with no arguments
280--constructors with no arguments
201--basically useless but orthoganal to relationTrue
281--basically useless but orthoganal to relationTrue
202instance TupleableG U1 where
282instance TupleableG U1 where
203− toTupleG _= emptyTuple
283+ toTupleG _ _ = emptyTuple
204− toAttributesG _ = emptyAttributes
284+ toAttributesG _ _ = emptyAttributes
205− fromTupleG _ = pure U1
285+ fromTupleG _ _ = pure U1
206 isRecordTypeG _ = False
286 isRecordTypeG _ = False
207
287
src/lib/ProjectM36/Tupleable/Deriving.hsnew file+229
@@ -0,0 +1,229 @@
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+4−6
@@ -1,19 +1,17 @@
1module ProjectM36.TypeConstructor where
1module ProjectM36.TypeConstructor where
2import ProjectM36.Base
2import ProjectM36.Base
3−import qualified Data.Set as S
4
3
5name :: TypeConstructor -> TypeConstructorName
4name :: TypeConstructor -> TypeConstructorName
6name (ADTypeConstructor name' _) = name'
5name (ADTypeConstructor name' _) = name'
7name (PrimitiveTypeConstructor name' _) = name'
6name (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 _) = []
13arguments (TypeVariable _) = []
14arguments (TypeVariable _) = []
14
15
15−typeVars :: TypeConstructor -> S.Set TypeVarName
16+
16−typeVars (PrimitiveTypeConstructor _ _) = S.empty
17−typeVars (ADTypeConstructor _ args) = S.unions (map typeVars args)
18−typeVars (TypeVariable v) = S.singleton v
19
17
src/lib/ProjectM36/Win32Handle.hs+4−1
@@ -53,5 +53,8 @@ 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
56withStablePtr :: a -> (StablePtr a -> IO b) -> IO b
58withStablePtr :: a -> (StablePtr a -> IO b) -> IO b
57−withStablePtr value = bracket (newStablePtr value) freeStablePtr
59+withStablePtr value = bracket (newStablePtr value) freeStablePtr
60+#endif
src/lib/ProjectM36/WithNameExpr.hsnew file+86
@@ -0,0 +1,86 @@
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.yamlnew file+19
@@ -0,0 +1,19 @@
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.yaml → stack.ghc8.6.yamlrenamed+28−15
@@ -2,27 +2,41 @@
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-8.5
5+resolver: lts-14.27
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−- data-accessor-transformers-0.2.1.7
12+ - git: https://github.com/agentm/curryer.git
13−- data-interval-1.2.0
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
14−- extended-reals-0.2.1.0
20+ - extended-reals-0.2.3.0
15−- gnuplot-0.5.4.1
21+ - data-interval-2.0.1
16−- text-1.2.2.1
22+ - stm-containers-1.1.0.4
17−- aeson-1.2.1.00
23+ - stm-hamt-1.2.0.4
18−- distributed-process-0.6.6
19−- distributed-process-async-0.2.4
20−- distributed-process-client-server-0.2.3
21−- distributed-process-extras-0.3.2
22−- rset-1.0.0
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
23
35
24# Override default flag values for local packages and extra-deps
36# Override default flag values for local packages and extra-deps
25−flags: {}
37+flags:
38+ project-m36:
39+ stack: true
26
40
27# Extra package databases containing global packages
41# Extra package databases containing global packages
28extra-package-dbs: []
42extra-package-dbs: []
@@ -46,4 +60,3 @@ extra-package-dbs: []
46# compiler-check: newer-minor
60# compiler-check: newer-minor
47
61
48allow-newer: true
62allow-newer: true
49−
stack.ghc7.10.yaml → stack.ghc8.8.yamlrenamed+28−17
@@ -2,29 +2,41 @@
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-6.35
5+resolver: lts-16.4
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−- data-accessor-transformers-0.2.1.7
12+ - git: https://github.com/agentm/curryer.git
13−- data-interval-1.2.0
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
14−- extended-reals-0.2.1.0
20+ - extended-reals-0.2.3.0
15−- gnuplot-0.5.4.1
21+ - data-interval-2.0.1
16−- text-1.2.2.1
22+ - stm-containers-1.1.0.4
17−- aeson-1.2.1.00
23+ - stm-hamt-1.2.0.4
18−- distributed-process-0.6.6
24+ - rset-1.0.0
19−- distributed-process-async-0.2.4
25+ - hashable-time-0.2.0.2
20−- distributed-process-client-server-0.2.3
26+ - network-transport-tcp-0.7.0
21−- distributed-process-extras-0.3.2
22−- cryptohash-sha256-0.11.100.1
23−- megaparsec-5.3.1
27+ - megaparsec-7.0.5
24−- rset-1.0.0
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
25
35
26# Override default flag values for local packages and extra-deps
36# Override default flag values for local packages and extra-deps
27−flags: {}
37+flags:
38+ project-m36:
39+ stack: true
28
40
29# Extra package databases containing global packages
41# Extra package databases containing global packages
30extra-package-dbs: []
42extra-package-dbs: []
@@ -48,4 +60,3 @@ extra-package-dbs: []
48# compiler-check: newer-minor
60# compiler-check: newer-minor
49
61
50allow-newer: true
62allow-newer: true
51−
test/Client/Simple.hs+1−2
@@ -9,7 +9,6 @@ import System.IO.Temp
9import System.FilePath
9import System.FilePath
10import ProjectM36.TupleSet
10import ProjectM36.TupleSet
11import ProjectM36.Attribute
11import ProjectM36.Attribute
12−import qualified Data.Vector as V
13import qualified Data.Map as M
12import qualified Data.Map as M
14
13
15main :: IO ()
14main :: IO ()
@@ -59,7 +58,7 @@ testSimpleCommitFailure = TestCase $ do
59 execute $ Assign "x" (ExistingRelation relationTrue)
58 execute $ Assign "x" (ExistingRelation relationTrue)
60 --cause error
59 --cause error
61 execute $ Assign "x" (MakeStaticRelation failAttrs emptyTupleSet)
60 execute $ Assign "x" (MakeStaticRelation failAttrs emptyTupleSet)
62− let expectedErr = Left (RelError (RelationTypeMismatchError V.empty failAttrs))
61+ let expectedErr = Left (RelError (RelationTypeMismatchError mempty failAttrs))
63 assertEqual "dbc error" expectedErr err
62 assertEqual "dbc error" expectedErr err
64
63
65-- #176 default merge couldn't handle Update
64-- #176 default merge couldn't handle Update
test/DataFrame.hsnew file+61
@@ -0,0 +1,61 @@
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+43−33
@@ -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
7import qualified ProjectM36.DatabaseContext as DBC
9import qualified ProjectM36.DatabaseContext as DBC
8import qualified ProjectM36.Attribute as A
10import qualified ProjectM36.Attribute as A
9import System.Exit
11import System.Exit
10import qualified Data.Map as M
12import qualified Data.Map as M
11import qualified Data.Set as S
13import 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" relationTrue
39+ relationVariables = M.singleton "anotherRel" (ExistingRelation 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,15 +50,17 @@ 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 schemaA = mkRelationalExprState DBC.empty {
53+ let ctx = DBC.empty {
54− relationVariables = M.fromList [("employee", relationTrue),
54+ relationVariables = M.fromList [("employee", ExistingRelation relationTrue),
55− ("department", relationFalse)]
55+ ("department", ExistingRelation relationFalse)]
56 }
56 }
57+ (graph, _) <- freshTransactionGraph ctx
57− isomorphsAtoB = [IsoRename "emp" "employee",
58+ let isomorphsAtoB = [IsoRename "emp" "employee",
58 IsoRename "department" "department"]
59 IsoRename "department" "department"]
59− unionExpr = Union (RelationVariable "emp" ()) (RelationVariable "department" ())
60+ unionExpr = Union (RelationVariable "emp" ()) (RelationVariable "department" ())
61+ env = mkRelationalExprEnv ctx graph
60 relExpr <- assertEither (applyRelationalExprSchemaIsomorphs isomorphsAtoB unionExpr)
62 relExpr <- assertEither (applyRelationalExprSchemaIsomorphs isomorphsAtoB unionExpr)
61− let relResult = runReader (evalRelationalExpr relExpr) schemaA
63+ let relResult = optimizeAndEvalRelationalExpr env relExpr
62 assertEqual "employee relation morph" (Right relationTrue) relResult
64 assertEqual "employee relation morph" (Right relationTrue) relResult
63
65
64testIsoRestrict :: Test
66testIsoRestrict :: Test
@@ -67,62 +69,70 @@ testIsoRestrict = TestCase $ do
67 -- the virtual schema has an employee
69 -- the virtual schema has an employee
68 let empattrs = A.attributesFromList [Attribute "name" TextAtomType,
70 let empattrs = A.attributesFromList [Attribute "name" TextAtomType,
69 Attribute "boss" TextAtomType]
71 Attribute "boss" TextAtomType]
72+ (graph, transId) <- freshTransactionGraph DBC.empty
70 emprel <- assertEither $ mkRelationFromList empattrs
73 emprel <- assertEither $ mkRelationFromList empattrs
71 [[TextAtom "Steve", TextAtom ""],
74 [[TextAtom "Steve", TextAtom ""],
72 [TextAtom "Cindy", TextAtom "Steve"],
75 [TextAtom "Cindy", TextAtom "Steve"],
73 [TextAtom "Sam", TextAtom "Steve"]]
76 [TextAtom "Sam", TextAtom "Steve"]]
74 let predicate = AttributeEqualityPredicate "boss" (NakedAtomExpr (TextAtom ""))
77 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)))
77
81
78− let schemaA = mkRelationalExprState DBC.empty {
82+ let schemaA = mkRelationalExprEnv baseContext graph
83+ baseContext = DBC.empty {
79− relationVariables = M.fromList [("nonboss", nonBossRel),
84+ relationVariables = M.fromList [("nonboss", ExistingRelation nonBossRel),
80− ("boss", bossRel)]
85+ ("boss", ExistingRelation bossRel)]
81 }
86 }
82−
83 isomorphsAtoB = [IsoRestrict "employee" predicate ("boss", "nonboss")]
87 isomorphsAtoB = [IsoRestrict "employee" predicate ("boss", "nonboss")]
84 bossq = RelationVariable "boss" ()
88 bossq = RelationVariable "boss" ()
85 nonbossq = RelationVariable "nonboss" ()
89 nonbossq = RelationVariable "nonboss" ()
86 employeeq = RelationVariable "employee" ()
90 employeeq = RelationVariable "employee" ()
87 unionq = Union bossq nonbossq
91 unionq = Union bossq nonbossq
88 empExpr <- assertEither (applyRelationalExprSchemaIsomorphs isomorphsAtoB employeeq)
92 empExpr <- assertEither (applyRelationalExprSchemaIsomorphs isomorphsAtoB employeeq)
89− let empResult = runReader (evalRelationalExpr empExpr) schemaA
93+ let empResult = evalRelExpr (evalRelationalExpr empExpr)
90− unionResult = runReader (evalRelationalExpr unionq) schemaA
94+ unionResult = evalRelExpr (evalRelationalExpr unionq)
95+ evalRelExpr = runRelationalExprM schemaA
91 assertEqual "boss/nonboss isorestrict" unionResult empResult
96 assertEqual "boss/nonboss isorestrict" unionResult empResult
92 --execute database context expr
97 --execute database context expr
93 bobRel <- assertEither (mkRelationFromList empattrs [[TextAtom "Bob", TextAtom ""]])
98 bobRel <- assertEither (mkRelationFromList empattrs [[TextAtom "Bob", TextAtom ""]])
94 let schemaBInsertExpr = Insert "employee" (ExistingRelation bobRel)
99 let schemaBInsertExpr = Insert "employee" (ExistingRelation bobRel)
95 schemaBInsertExpr' <- assertEither (processDatabaseContextExprInSchema (Schema isomorphsAtoB) schemaBInsertExpr)
100 schemaBInsertExpr' <- assertEither (processDatabaseContextExprInSchema (Schema isomorphsAtoB) schemaBInsertExpr)
96− let (postInsertContext,_,_) = execState (evalDatabaseContextExpr schemaBInsertExpr') (freshDatabaseState (stateElemsContext schemaA))
101+ let Right dbcState = evalDBCExpr schemaBInsertExpr'
102+ postInsertContext = dbc_context dbcState
103+ evalDBCExpr expr' = runDatabaseContextEvalMonad baseContext dbcenv (optimizeAndEvalDatabaseContextExpr False expr')
104+ dbcenv = mkDatabaseContextEvalEnv transId graph
97− expectedRel = runReader (evalRelationalExpr (Union (RelationVariable "boss" ()) (RelationVariable "nonboss" ()))) (mkRelationalExprState postInsertContext)
105+ expectedRel = runRelationalExprM postInsertEnv (evalRelationalExpr (Union (RelationVariable "boss" ()) (RelationVariable "nonboss" ())))
106+ postInsertEnv = mkRelationalExprEnv postInsertContext graph
98 --execute the expression against the schema and compare against the base context
107 --execute the expression against the schema and compare against the base context
99 processedExpr <- assertEither (processRelationalExprInSchema (Schema isomorphsAtoB) (RelationVariable "employee" ()))
108 processedExpr <- assertEither (processRelationalExprInSchema (Schema isomorphsAtoB) (RelationVariable "employee" ()))
100− let processedRel = runReader (evalRelationalExpr processedExpr) (mkRelationalExprState postInsertContext)
109+ let processedRel = runRelationalExprM postInsertEnv (evalRelationalExpr processedExpr)
101 assertEqual "insert bob boss" expectedRel processedRel
110 assertEqual "insert bob boss" expectedRel processedRel
102
111
103testIsoUnion :: Test
112testIsoUnion :: Test
104testIsoUnion = TestCase $ do
113testIsoUnion = TestCase $ do
105 --create motors relation which is split into low-power (<50 horsepower) and high-power (>=50 horsepower) motors
114 --create motors relation which is split into low-power (<50 horsepower) and high-power (>=50 horsepower) motors
106 --the schema is contains the split relvars
115 --the schema is contains the split relvars
116+ (graph, _) <- freshTransactionGraph DBC.empty
107 motorsRel <- assertEither $ mkRelationFromList (A.attributesFromList [Attribute "name" TextAtomType,
117 motorsRel <- assertEither $ mkRelationFromList (A.attributesFromList [Attribute "name" TextAtomType,
108− Attribute "power" IntAtomType])
118+ Attribute "power" IntegerAtomType])
109− [[TextAtom "Puny", IntAtom 10],
119+ [[TextAtom "Puny", IntegerAtom 10],
110− [TextAtom "Scooter", IntAtom 49],
120+ [TextAtom "Scooter", IntegerAtom 49],
111− [TextAtom "Auto", IntAtom 200],
121+ [TextAtom "Auto", IntegerAtom 200],
112− [TextAtom "Tractor", IntAtom 500]]
122+ [TextAtom "Tractor", IntegerAtom 500]]
113− let baseSchema = mkRelationalExprState DBC.basicDatabaseContext {
123+ let env = mkRelationalExprEnv DBC.basicDatabaseContext {
114− relationVariables = M.singleton "motor" motorsRel
124+ relationVariables = M.singleton "motor" (ExistingRelation motorsRel)
115− }
125+ } graph
116− splitPredicate = AtomExprPredicate (FunctionAtomExpr "lt" [AttributeAtomExpr "power", NakedAtomExpr (IntAtom 50)] ())
126+ splitPredicate = AtomExprPredicate (FunctionAtomExpr "lt" [AttributeAtomExpr "power", NakedAtomExpr (IntegerAtom 50)] ())
117 splitIsomorphs = [IsoUnion ("lowpower", "highpower") splitPredicate "motor",
127 splitIsomorphs = [IsoUnion ("lowpower", "highpower") splitPredicate "motor",
118 IsoRename "true" "true",
128 IsoRename "true" "true",
119 IsoRename "false" "false"]
129 IsoRename "false" "false"]
120− lowmotors = runReader (evalRelationalExpr (Restrict splitPredicate (RelationVariable "motor" ()))) baseSchema
130+ lowmotors = runRelationalExprM env (evalRelationalExpr (Restrict splitPredicate (RelationVariable "motor" ())))
121− highmotors = runReader (evalRelationalExpr (Restrict (NotPredicate splitPredicate) (RelationVariable "motor" ()))) baseSchema
131+ highmotors = runRelationalExprM env (evalRelationalExpr (Restrict (NotPredicate splitPredicate) (RelationVariable "motor" ())))
122− relResult expr = runReader (evalRelationalExpr expr) baseSchema
132+ relResult expr = runRelationalExprM env (evalRelationalExpr expr)
123 lowpowerExpr <- assertEither (processRelationalExprInSchema (Schema splitIsomorphs) (RelationVariable "lowpower" ()))
133 lowpowerExpr <- assertEither (processRelationalExprInSchema (Schema splitIsomorphs) (RelationVariable "lowpower" ()))
124 lowpowerRel <- assertEither (relResult lowpowerExpr)
134 lowpowerRel <- assertEither (relResult lowpowerExpr)
125 highpowerExpr <- assertEither (processRelationalExprInSchema (Schema splitIsomorphs) (RelationVariable "highpower" ()))
135 highpowerExpr <- assertEither (processRelationalExprInSchema (Schema splitIsomorphs) (RelationVariable "highpower" ()))
126 highpowerRel <- assertEither (relResult highpowerExpr)
136 highpowerRel <- assertEither (relResult highpowerExpr)
127 assertEqual "lowpower relation difference" (Right lowpowerRel) lowmotors
137 assertEqual "lowpower relation difference" (Right lowpowerRel) lowmotors
128− assertEqual "highpower relation difference" (Right highpowerRel) highmotors
138+ assertEqual "highpower relation difference" (Right highpowerRel) highmotors
test/Relation/Atomable.hs+89−14
@@ -1,8 +1,7 @@
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 #-}
2+{-# LANGUAGE DeriveGeneric, DeriveAnyClass, OverloadedStrings, TypeApplications, DerivingVia #-}
3import Test.HUnit
3import Test.HUnit
4import ProjectM36.Client
4import ProjectM36.Client
5−import Data.Binary
6import Control.DeepSeq
5import Control.DeepSeq
7import System.Exit
6import System.Exit
8import TutorialD.Interpreter.TestBase
7import TutorialD.Interpreter.TestBase
@@ -13,42 +12,83 @@ import Data.Time.Calendar (fromGregorian)
13import Data.Text
12import Data.Text
14import qualified Data.Map as M
13import qualified Data.Map as M
15import Data.Proxy
14import 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, Binary, NFData, Atomable)
19+ deriving (Generic, Show, Eq, NFData, Atomable)
20+ deriving Serialise via WineryVariant Test1T
20
21
21data Test2T x = Test2C x
22data Test2T x = Test2C x
22− deriving (Show, Generic, Eq, Binary, NFData, Atomable)
23+ deriving (Show, Generic, Eq, NFData, Atomable)
24+ deriving Serialise via WineryVariant (Test2T x)
23
25
24data Test3T = Test3C Integer Integer
26data Test3T = Test3C Integer Integer
25− deriving (Show, Generic, Eq, Binary, NFData, Atomable)
27+ deriving (Show, Generic, Eq, NFData, Atomable)
28+ deriving Serialise via WineryVariant Test3T
26
29
27data Test4T = Test4Ca Integer |
30data Test4T = Test4Ca Integer |
28 Test4Cb Integer
31 Test4Cb Integer
29− deriving (Show, Generic, Eq, Binary, NFData, Atomable)
32+ deriving (Show, Generic, Eq, NFData, Atomable)
33+ deriving Serialise via WineryVariant Test4T
30
34
31data TestListT = TestListC [Integer]
35data TestListT = TestListC [Integer]
32− deriving (Show, Generic, Eq, Binary, NFData, Atomable)
36+ deriving (Show, Generic, Eq, NFData, Atomable)
37+ deriving Serialise via WineryVariant TestListT
33
38
39+data TestNonEmptyT = TestNonEmptyC [Integer]
40+ deriving (Show, Generic, Eq, NFData, Atomable)
41+ deriving Serialise via WineryVariant TestNonEmptyT
42+
34data Test5T = Test5C {
43data Test5T = Test5C {
35 con1 :: Integer,
44 con1 :: Integer,
36 con2 :: Integer
45 con2 :: Integer
37− } deriving (Show, Generic, Eq, Binary, NFData, Atomable)
46+ } deriving (Show, Generic, Eq, NFData, Atomable)
47+ deriving Serialise via WineryRecord Test5T
38
48
39data Test6T = Test6C (Maybe Integer)
49data Test6T = Test6C (Maybe Integer)
40− deriving (Show, Generic, Eq, Binary, NFData, Atomable)
50+ deriving (Show, Generic, Eq, NFData, Atomable)
51+ deriving Serialise via WineryVariant Test6T
41
52
42data Test7T = Test7C (Either Integer Integer)
53data Test7T = Test7C (Either Integer Integer)
43− deriving (Show, Generic, Eq, Binary, NFData, Atomable)
54+ deriving (Show, Generic, Eq, NFData, Atomable)
44−
55+ deriving Serialise via WineryVariant Test7T
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+
45main :: IO ()
85main :: IO ()
46main = do
86main = do
47 tcounts <- runTestTT testList
87 tcounts <- runTestTT testList
48 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
88 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
49
89
50testList :: Test
90testList :: Test
51−testList = TestList [testHaskell2DB, testADT1, testADT2, testADT3, testADT4, testADT5, testBasicMarshaling, testListInstance, testADT6Maybe, testADT7Either]
91+testList = TestList [testHaskell2DB, testADT1, testADT2, testADT3, testADT4, testADT5, testBasicMarshaling, testSimpleList, testListInstance, testNonEmptyInstance, testADT6Maybe, testADT7Either, testNonPrimitiveValues, testRecordType, testManyFields]
52
92
53-- test some basic data types like int, day, etc.
93-- test some basic data types like int, day, etc.
54testBasicMarshaling :: Test
94testBasicMarshaling :: Test
@@ -77,7 +117,7 @@ testHaskell2DB = TestCase $ do
77 let createRelExpr = Assign "x" rel
117 let createRelExpr = Assign "x" rel
78
118
79 rel = MakeRelationFromExprs Nothing
119 rel = MakeRelationFromExprs Nothing
80− [TupleExpr (M.singleton "a1" (NakedAtomExpr atomVal))]
120+ (TupleExprs () [TupleExpr (M.singleton "a1" (NakedAtomExpr atomVal))])
81 atomVal = toAtom exampleVal
121 atomVal = toAtom exampleVal
82 exampleVal = Test1C 10
122 exampleVal = Test1C 10
83 checkExecuteDatabaseContextExpr sessionId dbconn createRelExpr
123 checkExecuteDatabaseContextExpr sessionId dbconn createRelExpr
@@ -131,4 +171,39 @@ checkExecuteDatabaseContextExpr sessionId dbconn expr = executeDatabaseContextEx
131testListInstance :: Test
171testListInstance :: Test
132testListInstance = TestCase $ do
172testListInstance = TestCase $ do
133 let example = TestListC [3,4,5]
173 let example = TestListC [3,4,5]
134− assertEqual "List instance" example (fromAtom (toAtom example))
174+ 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+27−14
@@ -3,13 +3,11 @@ 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)
8import ProjectM36.DataTypes.Primitive
6import ProjectM36.DataTypes.Primitive
9import ProjectM36.RelationalExpression
7import ProjectM36.RelationalExpression
8+import ProjectM36.TransactionGraph
10import ProjectM36.Tuple
9import ProjectM36.Tuple
11import qualified ProjectM36.DatabaseContext as DBC
10import qualified ProjectM36.DatabaseContext as DBC
12−import Control.Monad.Trans.Reader
13import qualified ProjectM36.Attribute as A
11import qualified ProjectM36.Attribute as A
14import qualified Data.Map as M
12import qualified Data.Map as M
15import qualified Data.Vector as V
13import qualified Data.Vector as V
@@ -25,7 +23,8 @@ testList = TestList [testRelation "relationTrue" relationTrue, testRelation "rel
25 testRelation "products" productsRel,
23 testRelation "products" productsRel,
26 testRelation "supplierProducts" supplierProductsRel,
24 testRelation "supplierProducts" supplierProductsRel,
27 testMkRelationFromExprsBadAttrs,
25 testMkRelationFromExprsBadAttrs,
28− testDuplicateAttributes
26+ testExistingRelationType,
27+ testReorderTuple
29 ]
28 ]
30
29
31main :: IO ()
30main :: IO ()
@@ -63,8 +62,8 @@ validateAttrTypesMatchTupleAttrTypes rel@(Relation attrs tupSet) = foldr (\tuple
63 tupleAtomCheck tuple = V.all (== True) (attrChecks tuple)
62 tupleAtomCheck tuple = V.all (== True) (attrChecks tuple)
64 attrChecks tuple = V.map (\attr -> case atomForAttributeName (A.attributeName attr) tuple of
63 attrChecks tuple = V.map (\attr -> case atomForAttributeName (A.attributeName attr) tuple of
65 Left _ -> False
64 Left _ -> False
66− Right atom -> (Right $ atomTypeForAtom atom) ==
65+ Right atom -> Right (atomTypeForAtom atom) ==
67− A.atomTypeForAttributeName (A.attributeName attr) attrs) (attributes rel)
66+ A.atomTypeForAttributeName (A.attributeName attr) attrs) (attributesVec (attributes rel))
68
67
69simpleRel :: Relation
68simpleRel :: Relation
70simpleRel = case mkRelation attrs tupleSet of
69simpleRel = case mkRelation attrs tupleSet of
@@ -93,14 +92,28 @@ testMkRelation1 = TestCase $ assertEqual "key mismatch" expectedError (mkRelatio
93
92
94testMkRelationFromExprsBadAttrs :: Test
93testMkRelationFromExprsBadAttrs :: Test
95testMkRelationFromExprsBadAttrs = TestCase $ do
94testMkRelationFromExprsBadAttrs = TestCase $ do
96− let context = DBC.empty
95+ let context = DBC.empty
96+ (graph,_) <- freshTransactionGraph context
97+ let reenv = mkRelationalExprEnv context graph
97− case runReader (evalRelationalExpr (MakeRelationFromExprs (Just [AttributeAndTypeNameExpr "badAttr1" (PrimitiveTypeConstructor "Int" IntAtomType) ()]) [TupleExpr (M.singleton "badAttr2" (NakedAtomExpr (IntAtom 1)))])) (mkRelationalExprState context) of
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
98 Left err -> assertEqual "tuple type mismatch" (TupleAttributeTypeMismatchError (A.attributesFromList [Attribute "badAttr2" IntAtomType])) err
101 Left err -> assertEqual "tuple type mismatch" (TupleAttributeTypeMismatchError (A.attributesFromList [Attribute "badAttr2" IntAtomType])) err
99 Right _ -> assertFailure "expected tuple type mismatch"
102 Right _ -> assertFailure "expected tuple type mismatch"
100
103
101−--creating an empty relation with duplicate attribute names should fail
104+testExistingRelationType :: Test
102−testDuplicateAttributes :: Test
105+testExistingRelationType = TestCase $ do
103−testDuplicateAttributes = TestCase $ do
106+ (graph, _) <- freshTransactionGraph dateExamples
104− let eRel = mkRelation attrs emptyTupleSet
107+ let typeResult = runRelationalExprM reenv (typeForRelationalExpr (ExistingRelation relationTrue))
108+ reenv = mkRelationalExprEnv dateExamples graph
109+ assertEqual "ExistingRelation with tuples type" (Right relationFalse) typeResult
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"])
105− attrs = attributesFromList [Attribute "a" IntAtomType, Attribute "a" TextAtomType]
115+ attrs1 = A.attributesFromList [Attribute "a" IntAtomType, Attribute "b" TextAtomType]
106− assertEqual "duplicate attribute names" (Left (DuplicateAttributeNamesError (S.singleton "a"))) eRel
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+24−19
@@ -1,3 +1,5 @@
1+{-# LANGUAGE CPP #-}
2+
1import ProjectM36.Base
3import ProjectM36.Base
2import ProjectM36.Relation.Show.CSV
4import ProjectM36.Relation.Show.CSV
3import ProjectM36.Relation.Parse.CSV
5import ProjectM36.Relation.Parse.CSV
@@ -11,7 +13,11 @@ import System.Exit
11import Test.HUnit
13import Test.HUnit
12import Data.Time.Calendar
14import Data.Time.Calendar
13import Data.Time.Clock
15import Data.Time.Clock
16+
17+#if __GLASGOW_HASKELL__ < 804
14import Data.Monoid
18import Data.Monoid
19+#endif
20+
15{-
21{-
16import qualified Data.Text.Lazy as TL
22import qualified Data.Text.Lazy as TL
17import qualified Data.Text.Lazy.Encoding as TE
23import qualified Data.Text.Lazy.Encoding as TE
@@ -19,9 +25,9 @@ import ProjectM36.Relation.Show.Term
19import qualified Data.ByteString.Lazy as BS
25import qualified Data.ByteString.Lazy as BS
20-}
26-}
21
27
22−main :: IO ()
28+main :: IO ()
23−main = do
29+main = do
24− tcounts <- runTestTT $ TestList [testCSVExport,
30+ tcounts <- runTestTT $ TestList [testCSVExport,
25 testADTExport]
31 testADTExport]
26 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
32 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
27
33
@@ -31,8 +37,8 @@ assertEither x = do
31 case res of
37 case res of
32 Left err -> assertFailure (show err) >> undefined
38 Left err -> assertFailure (show err) >> undefined
33 Right val -> pure val
39 Right val -> pure val
34−
40+
35−testADTExport :: Test
41+testADTExport :: Test
36testADTExport = TestCase $ do
42testADTExport = TestCase $ do
37 let adtCSV = "a\nCons 4 (Cons 5 Empty)\n"
43 let adtCSV = "a\nCons 4 (Cons 5 Empty)\n"
38 attrs = A.attributesFromList [Attribute "a" (listAtomType IntegerAtomType)]
44 attrs = A.attributesFromList [Attribute "a" (listAtomType IntegerAtomType)]
@@ -40,29 +46,29 @@ testADTExport = TestCase $ do
40 case csvAsRelation attrs basicTypeConstructorMapping adtCSV of
46 case csvAsRelation attrs basicTypeConstructorMapping adtCSV of
41 Left err -> assertFailure ("import failure: " <> show err)
47 Left err -> assertFailure ("import failure: " <> show err)
42 Right rel -> assertEqual "import cons list" expectedRel (Right rel)
48 Right rel -> assertEqual "import cons list" expectedRel (Right rel)
43−
49+
44--round-trip various atom types through CSV export/import
50--round-trip various atom types through CSV export/import
45testCSVExport :: Test
51testCSVExport :: Test
46testCSVExport = TestCase $ do
52testCSVExport = TestCase $ do
47 now <- getCurrentTime
53 now <- getCurrentTime
48− testInterval <- assertEither $ pure (createInterval
54+ testInterval <- assertEither $ pure (createInterval
49− (DateTimeAtom now)
55+ (DateTimeAtom now)
50 (DateTimeAtom (addUTCTime 86400 now))
56 (DateTimeAtom (addUTCTime 86400 now))
51 True
57 True
52 False)
58 False)
53− let attrs = A.attributesFromList [Attribute "textattr" TextAtomType,
59+ let attrs = A.attributesFromList [Attribute "textattr" TextAtomType,
54 Attribute "integerattr" IntegerAtomType,
60 Attribute "integerattr" IntegerAtomType,
55 Attribute "dayattr" DayAtomType,
61 Attribute "dayattr" DayAtomType,
56 Attribute "datetimeattr" DateTimeAtomType,
62 Attribute "datetimeattr" DateTimeAtomType,
57 Attribute "bytestringattr" ByteStringAtomType,
63 Attribute "bytestringattr" ByteStringAtomType,
58 Attribute "listintegerattr" (listAtomType IntegerAtomType),
64 Attribute "listintegerattr" (listAtomType IntegerAtomType),
59 Attribute "listtextattr" (listAtomType TextAtomType),
65 Attribute "listtextattr" (listAtomType TextAtomType),
60− Attribute "intervalattr" (IntervalAtomType DateTimeAtomType)
66+ Attribute "intervalattr" (intervalAtomType DateTimeAtomType)
61 ]
67 ]
62 sampleByteString = "\1\0\244\34\150"
68 sampleByteString = "\1\0\244\34\150"
63 relOrErr = mkRelationFromList attrs [
69 relOrErr = mkRelationFromList attrs [
64− [TextAtom "text atom with \"quote\"",
70+ [TextAtom "text atom with \"quote\"",
65− IntegerAtom 123,
71+ IntegerAtom 123,
66 DayAtom (fromGregorian 2017 4 10),
72 DayAtom (fromGregorian 2017 4 10),
67 DateTimeAtom now,
73 DateTimeAtom now,
68 ByteStringAtom sampleByteString,
74 ByteStringAtom sampleByteString,
@@ -70,19 +76,19 @@ testCSVExport = TestCase $ do
70 listCons TextAtomType [TextAtom "text1", TextAtom "text2"],
76 listCons TextAtomType [TextAtom "text1", TextAtom "text2"],
71 testInterval
77 testInterval
72 ],
78 ],
73− [TextAtom "second text atom with 漢字",
79+ [TextAtom "second text atom with 漢字",
74− IntegerAtom 314,
80+ IntegerAtom 314,
75 DayAtom (fromGregorian 1001 6 28),
81 DayAtom (fromGregorian 1001 6 28),
76 DateTimeAtom (addUTCTime 360 now),
82 DateTimeAtom (addUTCTime 360 now),
77− ByteStringAtom sampleByteString,
83+ ByteStringAtom sampleByteString,
78 listCons IntegerAtomType [IntegerAtom 10, IntegerAtom 11, IntegerAtom 12],
84 listCons IntegerAtomType [IntegerAtom 10, IntegerAtom 11, IntegerAtom 12],
79 listCons TextAtomType [TextAtom "text5\"", TextAtom "text6\r\n"],
85 listCons TextAtomType [TextAtom "text5\"", TextAtom "text6\r\n"],
80 testInterval
86 testInterval
81 ]]
87 ]]
82−
88+
83− case relOrErr of
89+ case relOrErr of
84 Left err -> assertFailure $ "export relation creation failure: " ++ show err
90 Left err -> assertFailure $ "export relation creation failure: " ++ show err
85− Right rel ->
91+ Right rel ->
86 case relationAsCSV rel of
92 case relationAsCSV rel of
87 Left err -> assertFailure $ "export failed: " ++ show err
93 Left err -> assertFailure $ "export failed: " ++ show err
88 Right csvData ->
94 Right csvData ->
@@ -91,4 +97,3 @@ testCSVExport = TestCase $ do
91 case csvAsRelation attrs basicTypeConstructorMapping csvData of -- import csv data back to relation
97 case csvAsRelation attrs basicTypeConstructorMapping csvData of -- import csv data back to relation
92 Left err -> assertFailure $ "re-import failed: " ++ show err
98 Left err -> assertFailure $ "re-import failed: " ++ show err
93 Right rel' -> assertEqual "relation CSV comparison" rel rel'
99 Right rel' -> assertEqual "relation CSV comparison" rel rel'
94−
test/Relation/StaticOptimizer.hs+76−51
@@ -1,13 +1,12 @@
1import ProjectM36.Base
1import ProjectM36.Base
2import ProjectM36.Relation
2import ProjectM36.Relation
3−import ProjectM36.RelationalExpression
3+import ProjectM36.TransactionGraph
4import ProjectM36.DateExamples
4import ProjectM36.DateExamples
5−import ProjectM36.Error
6import ProjectM36.TupleSet
5import ProjectM36.TupleSet
7import ProjectM36.StaticOptimizer
6import 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
11import Test.HUnit
10import Test.HUnit
12import qualified Data.Set as S
11import qualified Data.Set as S
13
12
@@ -16,100 +15,126 @@ main = do
16 tcounts <- runTestTT (TestList tests)
15 tcounts <- runTestTT (TestList tests)
17 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
16 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
18 where
17 where
19− tests = relationOptTests ++ databaseOptTests ++ [testTransitiveOptimization,
18+ tests = [testTransitiveOptimization,
20− testImpossiblePredicates,
19+ testImpossiblePredicates,
21− testJoinElimination,
20+ testJoinElimination,
22− testRestrictionPredicateCollapse,
21+ testRestrictionPredicateCollapse,
23− testPushDownRestrictionPredicate]
22+ testPushDownRestrictionPredicate,
24− optDBCTest = map (\(name, expr, unopt) -> TestCase $ assertEqual name expr (evalState (applyStaticDatabaseOptimization unopt) (freshDatabaseState dateExamples)))
23+ testOptimizeRelationalExpr,
25− relvar nam = RelationVariable nam ()
24+ testOptimizeDatabaseContextExpr]
26− startState = mkRelationalExprState dateExamples
25+
27− optRelTest = map (\(name, expr, unopt) -> TestCase $ assertEqual name expr (runReader (applyStaticRelationalOptimization unopt) startState))
26+testOptimizeDatabaseContextExpr :: Test
28− relationOptTests = optRelTest [
27+testOptimizeDatabaseContextExpr = TestCase $ do
29− ("StaticProject", Right $ relvar "s", Project (AttributeNames (attributeNames suppliersRel)) (relvar "s")),
28+ (graph, transId) <- freshTransactionGraph DBC.empty
30− ("StaticUnion", Right $ relvar "s", Union (relvar "s") (relvar "s")),
29+ let relvar nam = RelationVariable nam ()
31− ("StaticJoin", Right $ relvar "s", Join (relvar "s") (relvar "s"))
30+ relvarId nam = RelationVariable nam UncommittedContextMarker
32− ]
31+ testInfos = [
33− databaseOptTests = optDBCTest [
34− ("StaticAssign",
32+ ("StaticAssign",
35− Right $ Assign "z" (relvar "s"),
33+ Right $ Assign "z" (relvarId "s"),
36− Assign "z" (Restrict TruePredicate (relvar "s"))
34+ Assign "z" (Restrict TruePredicate (relvar "s"))
37− ),
35+ ),
38− ("StaticMultipleExpr",
36+ ("StaticMultipleExpr",
39− Right $ MultipleExpr [Assign "z" (relvar "s"),
37+ Right $ MultipleExpr [Assign "z" (relvarId "s"),
40− Assign "z" (relvar "s")],
38+ Assign "z" (relvarId "s")],
41− MultipleExpr [Assign "z" (Restrict TruePredicate (relvar "s")),
39+ MultipleExpr [Assign "z" (Restrict TruePredicate (relvar "s")),
42− Assign "z" (Restrict TruePredicate (relvar "s"))])
40+ Assign "z" (Restrict TruePredicate (relvar "s"))])
43− ]
41+ ]
42+ forM_ testInfos $ \(name, expectedExpr, unoptExpr) -> do
43+ let optExpr = runGraphRefSOptDatabaseContextExprM transId dateExamples graph (optimizeDatabaseContextExpr unoptExpr)
44+ assertEqual name expectedExpr optExpr
44
45
45testTransitiveOptimization :: Test
46testTransitiveOptimization :: Test
46testTransitiveOptimization = TestCase $ do
47testTransitiveOptimization = TestCase $ do
48+ (graph, _) <- freshTransactionGraph dateExamples
47 let expr atomexpr = AndPredicate (AttributeEqualityPredicate "a" (NakedAtomExpr (IntegerAtom 300))) (AttributeEqualityPredicate "b" atomexpr)
49 let expr atomexpr = AndPredicate (AttributeEqualityPredicate "a" (NakedAtomExpr (IntegerAtom 300))) (AttributeEqualityPredicate "b" atomexpr)
48 exprIn = expr (AttributeAtomExpr "a")
50 exprIn = expr (AttributeAtomExpr "a")
49 exprOut = expr (NakedAtomExpr (IntegerAtom 300))
51 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
54
74
55testImpossiblePredicates :: Test
75testImpossiblePredicates :: Test
56testImpossiblePredicates = TestCase $ do
76testImpossiblePredicates = TestCase $ do
77+ (graph, _) <- freshTransactionGraph dateExamples
57 let tautTrue = Restrict (AtomExprPredicate (NakedAtomExpr (BoolAtom True))) rel
78 let tautTrue = Restrict (AtomExprPredicate (NakedAtomExpr (BoolAtom True))) rel
58 tautTrue2 = Restrict TruePredicate rel
79 tautTrue2 = Restrict TruePredicate rel
59 tautFalse = Restrict (AtomExprPredicate (NakedAtomExpr (BoolAtom False))) rel
80 tautFalse = Restrict (AtomExprPredicate (NakedAtomExpr (BoolAtom False))) rel
60 tautFalse2 = Restrict (NotPredicate TruePredicate) rel
81 tautFalse2 = Restrict (NotPredicate TruePredicate) rel
61 emptyRel = MakeStaticRelation (attributes suppliersRel) emptyTupleSet
82 emptyRel = MakeStaticRelation (attributes suppliersRel) emptyTupleSet
62− rel = RelationVariable "s" ()
83+ rel = RelationVariable "s" UncommittedContextMarker
84+ optRelExpr expr = optimizeGraphRefRelationalExpr' (Just dateExamples) graph expr
63 assertEqual "remove tautology where true" (Right rel) (optRelExpr tautTrue)
85 assertEqual "remove tautology where true" (Right rel) (optRelExpr tautTrue)
64 assertEqual "remove tautology where true2" (Right rel) (optRelExpr tautTrue2)
86 assertEqual "remove tautology where true2" (Right rel) (optRelExpr tautTrue2)
65 assertEqual "remove tautology where false" (Right emptyRel) (optRelExpr tautFalse)
87 assertEqual "remove tautology where false" (Right emptyRel) (optRelExpr tautFalse)
66 assertEqual "remove tautology where false2" (Right emptyRel) (optRelExpr tautFalse2)
88 assertEqual "remove tautology where false2" (Right emptyRel) (optRelExpr tautFalse2)
67−
68−optJoinExpr :: RelationalExpr -> Either RelationalError RelationalExpr
69−optJoinExpr expr = runReader (applyStaticJoinElimination expr) (RelationalExprStateElems dateExamples)
70
89
71testJoinElimination :: Test
90testJoinElimination :: Test
72testJoinElimination = TestCase $ do
91testJoinElimination = 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+
73 -- (s join sp){s#,qty,p#} == sp
97 -- (s join sp){s#,qty,p#} == sp
74− let unoptExpr = Project (AttributeNames (S.fromList ["p#", "qty", "s#"])) (Join (RelationVariable "sp" ()) (RelationVariable "s" ()))
98+ let unoptExpr = Project (AttributeNames (S.fromList ["p#", "qty", "s#"])) (Join (relvar "sp") (relvar "s"))
75− assertEqual "remove extraneous join" (Right (RelationVariable "sp" ())) (optJoinExpr unoptExpr)
99+ assertEqual "remove extraneous join" (Right (relvar "sp")) (optJoinExpr unoptExpr)
76
100
77-- (sp join s){s#,qty,p#} == sp --flip relvar names
101-- (sp join s){s#,qty,p#} == sp --flip relvar names
78− let unoptExpr2 = Project (AttributeNames (S.fromList ["p#", "qty", "s#"])) (Join (RelationVariable "s" ()) (RelationVariable "sp" ()))
102+ let unoptExpr2 = Project (AttributeNames (S.fromList ["p#", "qty", "s#"])) (Join (relvar "s") (relvar "sp"))
79− assertEqual "remove extraneous join2" (Right (RelationVariable "sp" ())) (optJoinExpr unoptExpr2)
103+ assertEqual "remove extraneous join2" (Right (relvar "sp")) (optJoinExpr unoptExpr2)
80
104
81-- (sp join s){s#,qty,sname} != sp - attribute from s included
105-- (sp join s){s#,qty,sname} != sp - attribute from s included
82− let expr3 = Project (AttributeNames (S.fromList ["p#", "qty", "sname"])) (Join (RelationVariable "sp" ()) (RelationVariable "s" ()))
106+ let expr3 = Project (AttributeNames (S.fromList ["p#", "qty", "sname"])) (Join (relvar "sp") (relvar "s"))
83 assertEqual "retain join" (Right expr3) (optJoinExpr expr3)
107 assertEqual "retain join" (Right expr3) (optJoinExpr expr3)
84
108
85 -- (sp join s){qty} != sp --projection does not include foreign key attribute
109 -- (sp join s){qty} != sp --projection does not include foreign key attribute
86− let expr4 = Project (AttributeNames (S.singleton "qty")) (Join (RelationVariable "sp" ()) (RelationVariable "s" ()))
110+ let expr4 = Project (AttributeNames (S.singleton "qty")) (Join (relvar "sp") (relvar "s"))
87 assertEqual "retain join2" (Right expr4) (optJoinExpr expr4)
111 assertEqual "retain join2" (Right expr4) (optJoinExpr expr4)
88
112
89 -- (sp join s){s#,qty} == sp - a subset of attributes in the projection are in the foreign key
113 -- (sp join s){s#,qty} == sp - a subset of attributes in the projection are in the foreign key
90− let expr5 = Project (AttributeNames (S.fromList ["s#", "qty"])) (Join (RelationVariable "sp" ()) (RelationVariable "s" ()))
114+ let expr5 = Project (AttributeNames (S.fromList ["s#", "qty"])) (Join (relvar "sp") (relvar "s"))
91− let expect5 = Project (AttributeNames (S.fromList ["s#", "qty"])) (RelationVariable "sp" ())
115+ let expect5 = Project (AttributeNames (S.fromList ["s#", "qty"])) (relvar "sp")
92 assertEqual "remove extraneous join (attribute subset)" (Right expect5) (optJoinExpr expr5)
116 assertEqual "remove extraneous join (attribute subset)" (Right expect5) (optJoinExpr expr5)
93
117
94 -- (s join p){s#,p#} != sp -- no foreign key
118 -- (s join p){s#,p#} != sp -- no foreign key
95− let expr6 = Project (AttributeNames (S.fromList ["s#", "p#"])) (Join (RelationVariable "s" ()) (RelationVariable "p" ()))
119+ let expr6 = Project (AttributeNames (S.fromList ["s#", "p#"])) (Join (relvar "s") (relvar "p"))
96 assertEqual "retain join- no foreign key" (Right expr6) (optJoinExpr expr6)
120 assertEqual "retain join- no foreign key" (Right expr6) (optJoinExpr expr6)
97
121
98 -- (s join p){s#,qty,p#,sname} != sp -- all sp attributes plus one s attributes
122 -- (s join p){s#,qty,p#,sname} != sp -- all sp attributes plus one s attributes
99− let expr7 = Project (AttributeNames (S.fromList ["s#", "p#", "qty", "sname"])) (Join (RelationVariable "s" ()) (RelationVariable "sp" ()))
123+ let expr7 = Project (AttributeNames (S.fromList ["s#", "p#", "qty", "sname"])) (Join (relvar "s") (relvar "sp"))
100 assertEqual "retain join- attributes from both relvars" (Right expr7) (optJoinExpr expr7)
124 assertEqual "retain join- attributes from both relvars" (Right expr7) (optJoinExpr expr7)
101
125
102testRestrictionPredicateCollapse :: Test
126testRestrictionPredicateCollapse :: Test
103testRestrictionPredicateCollapse = TestCase $ do
127testRestrictionPredicateCollapse = TestCase $ do
104 let expr1 = Restrict (NotPredicate TruePredicate) rv
128 let expr1 = Restrict (NotPredicate TruePredicate) rv
105− rv = RelationVariable "a" ()
129+ rv = RelationVariable "a" UncommittedContextMarker
130+ relvar name = RelationVariable name UncommittedContextMarker
106 assertEqual "one restriction" expr1 (applyStaticRestrictionCollapse expr1)
131 assertEqual "one restriction" expr1 (applyStaticRestrictionCollapse expr1)
107
132
108 let attrEqualsPred = AttributeEqualityPredicate "x" (NakedAtomExpr (IntAtom 3))
133 let attrEqualsPred = AttributeEqualityPredicate "x" (NakedAtomExpr (IntAtom 3))
109− expr2 = Restrict TruePredicate (Restrict attrEqualsPred (RelationVariable "a" ()))
134+ expr2 = Restrict TruePredicate (Restrict attrEqualsPred (relvar "a"))
110− assertEqual "two restrictions" (Restrict (AndPredicate TruePredicate attrEqualsPred) (RelationVariable "a" ())) (applyStaticRestrictionCollapse expr2)
135+ assertEqual "two restrictions" (Restrict (AndPredicate TruePredicate attrEqualsPred) (relvar "a")) (applyStaticRestrictionCollapse expr2)
111
136
112− let expr3 = Restrict pred1 (Restrict pred2 (Restrict pred3 (RelationVariable "a" ())))
137+ let expr3 = Restrict pred1 (Restrict pred2 (Restrict pred3 (relvar "a")))
113 pred1 = NotPredicate TruePredicate
138 pred1 = NotPredicate TruePredicate
114 pred2 = attrEqualsPred
139 pred2 = attrEqualsPred
115 pred3 = AtomExprPredicate (NakedAtomExpr (BoolAtom True))
140 pred3 = AtomExprPredicate (NakedAtomExpr (BoolAtom True))
@@ -123,7 +148,7 @@ testRestrictionPredicateCollapse = TestCase $ do
123testPushDownRestrictionPredicate :: Test
148testPushDownRestrictionPredicate :: Test
124testPushDownRestrictionPredicate = TestCase $ do
149testPushDownRestrictionPredicate = TestCase $ do
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)
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)
126− let rvs = RelationVariable "s" ()
151+ let rvs = RelationVariable "s" UncommittedContextMarker
127 let status30 = AttributeEqualityPredicate "status" (NakedAtomExpr (IntAtom 30))
152 let status30 = AttributeEqualityPredicate "status" (NakedAtomExpr (IntAtom 30))
128 relationsOrError = do
153 relationsOrError = do
129 stevens <- mkRelationFromList (attributes suppliersRel) [[TextAtom "S6", TextAtom "Stevens", IntegerAtom 50, TextAtom "Boston"]]
154 stevens <- mkRelationFromList (attributes suppliersRel) [[TextAtom "S6", TextAtom "Stevens", IntegerAtom 50, TextAtom "Boston"]]
test/Relation/Tupleable.hs+188−10
@@ -1,19 +1,29 @@
1−{-# LANGUAGE DeriveGeneric, FlexibleInstances, FlexibleContexts, TypeOperators, DeriveAnyClass #-}
1+{-# LANGUAGE
2+ DeriveGeneric
3+ , FlexibleInstances
4+ , FlexibleContexts
5+ , DeriveAnyClass
6+ , ScopedTypeVariables
7+ , TypeApplications
8+ , DataKinds
9+ , TypeOperators
10+ , AllowAmbiguousTypes
11+ , DerivingVia
12+ #-}
2import Test.HUnit
13import Test.HUnit
3−import ProjectM36.Tupleable
14+import ProjectM36.Tupleable.Deriving
4import ProjectM36.Atomable
15import ProjectM36.Atomable
5−import ProjectM36.Attribute
16+import ProjectM36.Attribute as A
6import ProjectM36.Error
17import ProjectM36.Error
7−import Data.Binary
8import ProjectM36.Base
18import ProjectM36.Base
9import Control.DeepSeq (NFData)
19import Control.DeepSeq (NFData)
10−import GHC.Generics
11import qualified Data.Vector as V
20import qualified Data.Vector as V
12import qualified Data.Map as M
21import qualified Data.Map as M
13import qualified Data.Text as T
22import qualified Data.Text as T
14import qualified Data.Set as S
23import qualified Data.Set as S
15import System.Exit
24import System.Exit
16import Data.Proxy
25import Data.Proxy
26+import Codec.Winery
17
27
18{-# ANN module ("Hlint: ignore Use newtype instead of data" :: String) #-}
28{-# ANN module ("Hlint: ignore Use newtype instead of data" :: String) #-}
19
29
@@ -21,35 +31,43 @@ data Test1T = Test1C {
21 attrA :: Integer
31 attrA :: Integer
22 }
32 }
23 deriving (Generic, Eq, Show)
33 deriving (Generic, Eq, Show)
34+ deriving Serialise via WineryRecord Test1T
24
35
25data Test2T = Test2C {
36data Test2T = Test2C {
26 attrB :: Integer,
37 attrB :: Integer,
27 attrC :: Integer
38 attrC :: Integer
28 }
39 }
29 deriving (Generic, Eq, Show)
40 deriving (Generic, Eq, Show)
41+ deriving Serialise via WineryRecord Test2T
30
42
31data Test3T = Test3C Integer
43data Test3T = Test3C Integer
32 deriving (Generic, Eq, Show)
44 deriving (Generic, Eq, Show)
45+ deriving Serialise via WineryVariant Test3T
33
46
34data Test4T = Test4C
47data Test4T = Test4C
35 deriving (Generic, Eq, Show)
48 deriving (Generic, Eq, Show)
49+ deriving Serialise via WineryVariant Test4T
36
50
37data Test5T = Test5C1 Integer |
51data Test5T = Test5C1 Integer |
38 Test5C2 Integer
52 Test5C2 Integer
39 deriving (Generic, Eq, Show)
53 deriving (Generic, Eq, Show)
54+ deriving Serialise via WineryVariant Test5T
40
55
41data Test6T = Test6C T.Text Integer Double
56data Test6T = Test6C T.Text Integer Double
42 deriving (Generic, Eq, Show)
57 deriving (Generic, Eq, Show)
43
58
44data Test7A = Test7AC Integer
59data Test7A = Test7AC Integer
45− deriving (Generic, Show, Eq, Binary, NFData, Atomable)
60+ deriving (Generic, Show, Eq, NFData, Atomable)
61+ deriving Serialise via WineryVariant Test7A
46
62
47
63
48data Test7T = Test7C Test7A
64data Test7T = Test7C Test7A
49 deriving (Generic, Show, Eq)
65 deriving (Generic, Show, Eq)
66+ deriving Serialise via WineryVariant Test7T
50
67
51data Test8T = Test8C
68data Test8T = Test8C
52 deriving (Generic, Show, Eq)
69 deriving (Generic, Show, Eq)
70+ deriving Serialise via WineryVariant Test8T
53
71
54data Test9T = Test9C
72data Test9T = Test9C
55 {
73 {
@@ -58,6 +76,15 @@ data Test9T = Test9C
58 attr9C :: Double
76 attr9C :: Double
59 }
77 }
60 deriving (Generic, Show, Eq)
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
61
88
62instance Tupleable Test1T
89instance Tupleable Test1T
63
90
@@ -83,7 +110,7 @@ main = do
83 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
110 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
84
111
85testList :: Test
112testList :: Test
86−testList = TestList [testADT1, testADT2, testADT3, testADT4, testADT6, testADT7, testADT8, testInsertExpr, testDefineExpr, testUpdateExpr, testUpdateExprEmptyAttrs, testDeleteExpr, testUpdateExprWrongAttr, testReorderedTuple]
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]
87
114
88testADT1 :: Test
115testADT1 :: Test
89testADT1 = TestCase $ assertEqual "one record constructor" (Right example) (fromTuple (toTuple example))
116testADT1 = TestCase $ assertEqual "one record constructor" (Right example) (fromTuple (toTuple example))
@@ -121,7 +148,7 @@ testADT7 :: Test
121testADT7 = TestCase $ do
148testADT7 = TestCase $ do
122 let example = Test7C (Test7AC 3)
149 let example = Test7C (Test7AC 3)
123 assertEqual "atom type" (Right example) (fromTuple (toTuple example))
150 assertEqual "atom type" (Right example) (fromTuple (toTuple example))
124− let expectedAttrs = V.singleton (Attribute "" (ConstructedAtomType "Test7A" M.empty))
151+ let expectedAttrs = A.singleton (Attribute "" (ConstructedAtomType "Test7A" M.empty))
125 assertEqual "adt atomtype" expectedAttrs (toAttributes (Proxy :: Proxy Test7T))
152 assertEqual "adt atomtype" expectedAttrs (toAttributes (Proxy :: Proxy Test7T))
126
153
127testADT8 :: Test
154testADT8 :: Test
@@ -195,8 +222,159 @@ testDeleteExpr = TestCase $ do
195testReorderedTuple :: Test
222testReorderedTuple :: Test
196testReorderedTuple = TestCase $ do
223testReorderedTuple = TestCase $ do
197 let tupleRev :: RelationTuple -> RelationTuple
224 let tupleRev :: RelationTuple -> RelationTuple
198− tupleRev (RelationTuple v1 v2) = RelationTuple (V.reverse v1) (V.reverse v2)
225+ tupleRev (RelationTuple v1 v2) = RelationTuple (revAttrs v1) (V.reverse v2)
226+ revAttrs attrs = A.attributesFromList (reverse (A.toList attrs))
199 expected = Test2C {attrB = 3,
227 expected = Test2C {attrB = 3,
200 attrC = 4}
228 attrC = 4}
201 actual = fromTuple . tupleRev . toTuple $ expected
229 actual = fromTuple . tupleRev . toTuple $ expected
202− assertEqual "reordered tuple" (Right expected) actual
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+26−19
@@ -5,7 +5,6 @@ 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
9import ProjectM36.Server
8import ProjectM36.Server
10import ProjectM36.Server.Config
9import ProjectM36.Server.Config
11import ProjectM36.Relation
10import ProjectM36.Relation
@@ -14,10 +13,8 @@ import ProjectM36.IsomorphicSchema
14import ProjectM36.Base
13import ProjectM36.Base
15
14
16import System.Exit
15import System.Exit
17−
16+import Network.Socket (SockAddr(..))
18import Control.Concurrent
17import Control.Concurrent
19−import Network.Transport (EndPointAddress)
20−import Network.Transport.TCP (encodeEndPointAddress, decodeEndPointAddress)
21import Data.Either (isRight)
18import Data.Either (isRight)
22import Control.Exception
19import Control.Exception
23import System.IO.Temp
20import System.IO.Temp
@@ -26,6 +23,8 @@ import System.FilePath
26import System.Directory
23import System.Directory
27#endif
24#endif
28
25
26+type Timeout = Int
27+
29testList :: SessionId -> Connection -> MVar () -> Test
28testList :: SessionId -> Connection -> MVar () -> Test
30testList sessionId conn notificationTestMVar = TestList $ serverTests ++ sessionTests
29testList sessionId conn notificationTestMVar = TestList $ serverTests ++ sessionTests
31 where
30 where
@@ -43,7 +42,7 @@ testList sessionId conn notificationTestMVar = TestList $ serverTests ++ session
43 testRelationVariableSummary,
42 testRelationVariableSummary,
44 testNotification notificationTestMVar
43 testNotification notificationTestMVar
45 ]
44 ]
46− serverTests = [testRequestTimeout, testFileDescriptorCount]
45+ serverTests = [testRequestTimeout, testFileDescriptorCount, testClientConnectFail]
47
46
48main :: IO ()
47main :: IO ()
49main = do
48main = do
@@ -63,11 +62,9 @@ main = do
63testDatabaseName :: DatabaseName
62testDatabaseName :: DatabaseName
64testDatabaseName = "test"
63testDatabaseName = "test"
65
64
66−testConnection :: EndPointAddress -> MVar () -> IO (Either ConnectionError (SessionId, Connection))
65+testConnection :: Port -> MVar () -> IO (Either ConnectionError (SessionId, Connection))
67−testConnection serverAddress mvar = do
66+testConnection serverPort mvar = do
68− let Just (host, service, _) = decodeEndPointAddress serverAddress
69− serverAddress' = encodeEndPointAddress host service 1
70− let connInfo = RemoteProcessConnectionInfo testDatabaseName (NodeId serverAddress') (testNotificationCallback mvar)
67+ let connInfo = RemoteConnectionInfo testDatabaseName "127.0.0.1" (show serverPort) (testNotificationCallback mvar)
71 --putStrLn ("testConnection: " ++ show serverAddress)
68 --putStrLn ("testConnection: " ++ show serverAddress)
72 eConn <- connectProjectM36 connInfo
69 eConn <- connectProjectM36 connInfo
73 case eConn of
70 case eConn of
@@ -79,7 +76,7 @@ testConnection serverAddress mvar = do
79 Right sessionId -> pure $ Right (sessionId, conn)
76 Right sessionId -> pure $ Right (sessionId, conn)
80
77
81-- | A version of 'launchServer' which returns the port on which the server is listening on a secondary thread
78-- | A version of 'launchServer' which returns the port on which the server is listening on a secondary thread
82−launchTestServer :: Timeout -> IO (EndPointAddress, ThreadId)
79+launchTestServer :: Timeout -> IO (Port, ThreadId)
83launchTestServer ti = do
80launchTestServer ti = do
84 addressMVar <- newEmptyMVar
81 addressMVar <- newEmptyMVar
85 tid <- forkIO $
82 tid <- forkIO $
@@ -88,13 +85,14 @@ launchTestServer ti = do
88 persistenceStrategy = CrashSafePersistence (tempdir </> "db"),
85 persistenceStrategy = CrashSafePersistence (tempdir </> "db"),
89 perRequestTimeout = ti,
86 perRequestTimeout = ti,
90 testMode = True,
87 testMode = True,
91− bindPort = 0
88+ bindPort = 0,
89+ checkFS = False --not stricly needed for these tests
92 }
90 }
93
91
94 launchServer config (Just addressMVar) >> pure ()
92 launchServer config (Just addressMVar) >> pure ()
95− endPointAddress <- takeMVar addressMVar
93+ (SockAddrInet port _) <- takeMVar addressMVar
96 --liftIO $ putStrLn ("launched server on " ++ show endPointAddress)
94 --liftIO $ putStrLn ("launched server on " ++ show endPointAddress)
97− pure (endPointAddress, tid)
95+ pure (fromIntegral port, tid)
98
96
99testRelationalExpr :: SessionId -> Connection -> Test
97testRelationalExpr :: SessionId -> Connection -> Test
100testRelationalExpr sessionId conn = TestCase $ do
98testRelationalExpr sessionId conn = TestCase $ do
@@ -140,10 +138,11 @@ testPlanForDatabaseContextExpr sessionId conn = TestCase $ do
140 let attrExprs = [AttributeAndTypeNameExpr "x" (PrimitiveTypeConstructor "Int" IntAtomType) ()]
138 let attrExprs = [AttributeAndTypeNameExpr "x" (PrimitiveTypeConstructor "Int" IntAtomType) ()]
141 testrv = "testrv"
139 testrv = "testrv"
142 dbExpr = Define testrv attrExprs
140 dbExpr = Define testrv attrExprs
141+ expected = Define testrv [AttributeAndTypeNameExpr "x" (PrimitiveTypeConstructor "Int" IntAtomType) UncommittedContextMarker]
143 planResult <- planForDatabaseContextExpr sessionId conn dbExpr
142 planResult <- planForDatabaseContextExpr sessionId conn dbExpr
144 case planResult of
143 case planResult of
145 Left err -> assertFailure (show err)
144 Left err -> assertFailure (show err)
146− Right plan -> assertEqual "planForDatabaseContextExpr failure" dbExpr plan
145+ Right plan -> assertEqual "planForDatabaseContextExpr failure" expected plan
147
146
148testTransactionGraphAsRelation :: SessionId -> Connection -> Test
147testTransactionGraphAsRelation :: SessionId -> Connection -> Test
149testTransactionGraphAsRelation sessionId conn = TestCase $ do
148testTransactionGraphAsRelation sessionId conn = TestCase $ do
@@ -209,19 +208,19 @@ testRequestTimeout = TestCase $ do
209 Left err -> putStrLn ("failed to connect: " ++ show err) >> exitFailure
208 Left err -> putStrLn ("failed to connect: " ++ show err) >> exitFailure
210 Right (session, testConn) -> do
209 Right (session, testConn) -> do
211 res <- catchJust (\exc -> if exc == RequestTimeoutException then Just exc else Nothing) (callTestTimeout_ session testConn) (const (pure False))
210 res <- catchJust (\exc -> if exc == RequestTimeoutException then Just exc else Nothing) (callTestTimeout_ session testConn) (const (pure False))
212− assertBool "exception was not thrown" (not res)
211+ assertBool "timeout exception was not thrown" (not res)
213 killThread serverTid
212 killThread serverTid
214
213
215testFileDescriptorCount :: Test
214testFileDescriptorCount :: Test
216#if defined(linux_HOST_OS)
215#if defined(linux_HOST_OS)
217--validate that creating a server, connecting a client, and then disconnecting doesn't leak file descriptors
216--validate that creating a server, connecting a client, and then disconnecting doesn't leak file descriptors
218testFileDescriptorCount = TestCase $ do
217testFileDescriptorCount = TestCase $ do
219− (serverAddress, serverTid) <- launchTestServer 1000
218+ (serverAddress, serverTid) <- launchTestServer 0
220 unusedMVar <- newEmptyMVar
219 unusedMVar <- newEmptyMVar
221 startCount <- fdCount
220 startCount <- fdCount
222 Right (sess, testConn) <- testConnection serverAddress unusedMVar
221 Right (sess, testConn) <- testConnection serverAddress unusedMVar
223 --add a test commit to trigger the fsync machinery
222 --add a test commit to trigger the fsync machinery
224− executeDatabaseContextExpr sess testConn (Assign "x" (ExistingRelation relationFalse)) >>= eitherFail
223+ executeDatabaseContextExpr sess testConn (Assign "x" (ExistingRelation relationFalse)) >>= eitherFail
225 commit sess testConn >>= eitherFail
224 commit sess testConn >>= eitherFail
226 close testConn
225 close testConn
227 endCount <- fdCount
226 endCount <- fdCount
@@ -238,4 +237,12 @@ fdCount = do
238#else
237#else
239--pass on non-linux platforms
238--pass on non-linux platforms
240testFileDescriptorCount = TestCase (pure ())
239testFileDescriptorCount = TestCase (pure ())
241−#endif
240+#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+9−7
@@ -1,3 +1,4 @@
1+{-# LANGUAGE CPP #-}
1-- test the websocket server
2-- test the websocket server
2import Test.HUnit
3import Test.HUnit
3import qualified Network.WebSockets as WS
4import qualified Network.WebSockets as WS
@@ -17,7 +18,6 @@ import Data.Aeson
17import qualified Data.Map as M
18import qualified Data.Map as M
18import qualified Data.ByteString.Lazy as BS
19import qualified Data.ByteString.Lazy as BS
19import ProjectM36.Relation
20import 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,16 +26,17 @@ 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}
30 testDatabaseName = "test"
31 testDatabaseName = "test"
31 -- start normal server
32 -- start normal server
32 _ <- forkIO (launchServer config (Just addressMVar) >> pure ())
33 _ <- forkIO (launchServer config (Just addressMVar) >> pure ())
33− serverAddress <- takeMVar addressMVar
34+ (SockAddrInet dbPort _) <- takeMVar addressMVar
34 let wsServerHost = "127.0.0.1"
35 let wsServerHost = "127.0.0.1"
35 wsServerPort = 8889
36 wsServerPort = 8889
36− Just (dbHost, dbPort, _) = decodeEndPointAddress serverAddress
37+ dbHost = "127.0.0.1"
37 -- start websocket server proxy -- runServer doesn't support returning an arbitrary socket
38 -- start websocket server proxy -- runServer doesn't support returning an arbitrary socket
38− _ <- forkIO (WS.runServer wsServerHost wsServerPort (websocketProxyServer (read dbPort) dbHost))
39+ _ <- forkIO (WS.runServer wsServerHost wsServerPort (websocketProxyServer (fromIntegral dbPort) dbHost))
39 --wait for socket to be listening
40 --wait for socket to be listening
40 waitForListenSocket 5 (fromIntegral wsServerPort)
41 waitForListenSocket 5 (fromIntegral wsServerPort)
41 pure (fromIntegral wsServerPort, testDatabaseName)
42 pure (fromIntegral wsServerPort, testDatabaseName)
@@ -50,13 +51,14 @@ waitForListenSocket secondsToTry port =
50 if secondsToTry <= 0 then
51 if secondsToTry <= 0 then
51 throw WaitForSocketListenException
52 throw WaitForSocketListenException
52 else do
53 else do
53− hostaddr <- inet_addr "127.0.0.1"
54+ --hostaddr <- inet_addr "127.0.0.1"
55+ hostaddr:_ <- getAddrInfo Nothing (Just "127.0.0.1") (Just (show port))
54 sock <- socket AF_INET Stream defaultProtocol
56 sock <- socket AF_INET Stream defaultProtocol
55 let handler :: IOException -> IO ()
57 let handler :: IOException -> IO ()
56 handler _ = do
58 handler _ = do
57 threadDelay 1000000
59 threadDelay 1000000
58 waitForListenSocket (secondsToTry - 1) port
60 waitForListenSocket (secondsToTry - 1) port
59− catch (connect sock (SockAddrInet port hostaddr)) handler
61+ catch (connect sock (addrAddress hostaddr)) handler
60
62
61main :: IO ()
63main :: IO ()
62main = do
64main = do
test/TransactionGraph/Merge.hs+70−39
@@ -4,15 +4,28 @@ 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
7import ProjectM36.TransactionGraph
8import ProjectM36.TransactionGraph
8import ProjectM36.Error
9import ProjectM36.Error
9import ProjectM36.Key
10import ProjectM36.Key
10import qualified ProjectM36.DisconnectedTransaction as Discon
11import qualified ProjectM36.DisconnectedTransaction as Discon
11import qualified ProjectM36.DatabaseContext as DBC
12import qualified ProjectM36.DatabaseContext as DBC
12import ProjectM36.RelationalExpression
13import ProjectM36.RelationalExpression
14+import ProjectM36.StaticOptimizer
13
15
14import qualified Data.ByteString.Lazy as BS
16import qualified Data.ByteString.Lazy as BS
15import System.Exit
17import System.Exit
18+
19+
20+
21+
22+
23+
24+
25+
26+
27+
28+
16import Data.Word
29import Data.Word
17import qualified Data.UUID as U
30import qualified Data.UUID as U
18import qualified Data.Set as S
31import qualified Data.Set as S
@@ -21,8 +34,6 @@ import Data.Maybe
21import Data.Time.Clock
34import Data.Time.Clock
22import Data.Time.Calendar
35import Data.Time.Calendar
23
36
24−import Control.Monad.State
25−
26{-# ANN module ("HLint: ignore Reduce duplication" :: String) #-}
37{-# ANN module ("HLint: ignore Reduce duplication" :: String) #-}
27
38
28testTime :: UTCTime
39testTime :: UTCTime
@@ -62,8 +73,8 @@ basicTransactionGraph = do
62 uuidB = fakeUUID 11
73 uuidB = fakeUUID 11
63 uuidRoot = fakeUUID 1
74 uuidRoot = fakeUUID 1
64 rootContext = concreteDatabaseContext rootTrans
75 rootContext = concreteDatabaseContext rootTrans
65− (_, bsGraph') <- addTransaction "branchA" (createTrans uuidA (TransactionInfo uuidRoot S.empty testTime) rootContext) bsGraph
76+ (_, bsGraph') <- addTransaction "branchA" (createTrans uuidA (TI.singleParent uuidRoot testTime) rootContext) bsGraph
66− (_, bsGraph'') <- addTransaction "branchB" (createTrans uuidB (TransactionInfo uuidRoot S.empty testTime) rootContext) bsGraph'
77+ (_, bsGraph'') <- addTransaction "branchB" (createTrans uuidB (TI.singleParent uuidRoot testTime) rootContext) bsGraph'
67 pure bsGraph''
78 pure bsGraph''
68
79
69addTransaction :: HeadName -> Transaction -> TransactionGraph -> IO (Transaction, TransactionGraph)
80addTransaction :: HeadName -> Transaction -> TransactionGraph -> IO (Transaction, TransactionGraph)
@@ -107,7 +118,7 @@ testSubGraphToFirstAncestorSnipBranch = TestCase $ do
107 baseGraph <- basicTransactionGraph
118 baseGraph <- basicTransactionGraph
108 transA <- assertMaybe (transactionForHead "branchA" baseGraph) "failed to get branchA"
119 transA <- assertMaybe (transactionForHead "branchA" baseGraph) "failed to get branchA"
109 transB <- assertMaybe (transactionForHead "branchB" baseGraph) "failed to get branchB"
120 transB <- assertMaybe (transactionForHead "branchB" baseGraph) "failed to get branchB"
110− (_, graph) <- addTransaction "branchC" (createTrans (fakeUUID 12) (TransactionInfo (fakeUUID 1) S.empty testTime) (concreteDatabaseContext transA)) baseGraph
121+ (_, graph) <- addTransaction "branchC" (createTrans (fakeUUID 12) (TI.singleParent (fakeUUID 1) testTime) (concreteDatabaseContext transA)) baseGraph
111 subgraph <- assertEither $ subGraphOfFirstCommonAncestor graph (transactionHeadsForGraph baseGraph) transA transB S.empty
122 subgraph <- assertEither $ subGraphOfFirstCommonAncestor graph (transactionHeadsForGraph baseGraph) transA transB S.empty
112 assertGraph subgraph
123 assertGraph subgraph
113 let graphEq graphArg = S.map transactionId (transactionsForGraph graphArg)
124 let graphEq graphArg = S.map transactionId (transactionsForGraph graphArg)
@@ -121,16 +132,18 @@ testSubGraphToFirstAncestorMoreTransactions = TestCase $ do
121
132
122-- add another relvar to branchB
133-- add another relvar to branchB
123 branchBTrans <- assertMaybe (transactionForHead "branchB" graph) "failed to get branchB head"
134 branchBTrans <- assertMaybe (transactionForHead "branchB" graph) "failed to get branchB head"
135+ let env = mkDatabaseContextEvalEnv (transactionId branchBTrans) graph
136+ branchBContext = concreteDatabaseContext branchBTrans
124− (updatedBranchBContext,_,_) <- case runState (evalDatabaseContextExpr (Assign "branchBOnlyRelvar" (ExistingRelation relationTrue))) (freshDatabaseState (concreteDatabaseContext branchBTrans)) of
137+ updatedBranchBContext <- case runDatabaseContextEvalMonad branchBContext env (optimizeAndEvalDatabaseContextExpr True (Assign "branchBOnlyRelvar" (ExistingRelation relationTrue))) of
125− (Left err, _) -> assertFailure (show err) >> undefined
138+ Left err -> assertFailure (show err) >> undefined
126− (Right (), context) -> pure context
139+ Right st -> pure $ dbc_context st
127− (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TransactionInfo (transactionId branchBTrans) S.empty testTime) updatedBranchBContext) graph
140+ (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TI.singleParent (transactionId branchBTrans) testTime) updatedBranchBContext) graph
128 branchBTrans' <- assertMaybe (transactionForHead "branchB" graph') "failed to get branchB head"
141 branchBTrans' <- assertMaybe (transactionForHead "branchB" graph') "failed to get branchB head"
129 assertEqual "branchB id 3" (fakeUUID 3) (transactionId branchBTrans')
142 assertEqual "branchB id 3" (fakeUUID 3) (transactionId branchBTrans')
130
143
131 -- add another transaction to branchA
144 -- add another transaction to branchA
132 branchATrans <- assertMaybe (transactionForHead "branchA" graph) "failed to get branchA head"
145 branchATrans <- assertMaybe (transactionForHead "branchA" graph) "failed to get branchA head"
133− (_, graph'') <- addTransaction "branchA" (createTrans (fakeUUID 4) (TransactionInfo (transactionId branchATrans) S.empty testTime) (concreteDatabaseContext branchATrans)) graph'
146+ (_, graph'') <- addTransaction "branchA" (createTrans (fakeUUID 4) (TI.singleParent (transactionId branchATrans) testTime) (concreteDatabaseContext branchATrans)) graph'
134 branchATrans' <- assertMaybe (transactionForHead "branchA" graph'') "failed to get branchA head"
147 branchATrans' <- assertMaybe (transactionForHead "branchA" graph'') "failed to get branchA head"
135 assertEqual "branchA id 4" (fakeUUID 4) (transactionId branchATrans')
148 assertEqual "branchA id 4" (fakeUUID 4) (transactionId branchATrans')
136
149
@@ -148,12 +161,15 @@ testSelectedBranchMerge = TestCase $ do
148
161
149 -- add another relvar to branchB
162 -- add another relvar to branchB
150 branchBTrans <- assertMaybe (transactionForHead "branchB" graph) "failed to get branchB head"
163 branchBTrans <- assertMaybe (transactionForHead "branchB" graph) "failed to get branchB head"
151− (updatedBranchBContext,_,_) <- case runState (evalDatabaseContextExpr (Assign "branchBOnlyRelvar" (ExistingRelation relationTrue))) (freshDatabaseState (concreteDatabaseContext branchBTrans)) of
164+ let env = mkDatabaseContextEvalEnv (transactionId branchBTrans) graph
165+ branchBContext = concreteDatabaseContext branchBTrans
166+ updatedBranchBContext <- case runDatabaseContextEvalMonad branchBContext env (optimizeAndEvalDatabaseContextExpr True (Assign "branchBOnlyRelvar" (ExistingRelation relationTrue))) of
152− (Left err, _) -> assertFailure (show err) >> undefined
167+ Left err -> assertFailure (show err) >> undefined
153− (Right (), context) -> pure context
168+ Right st -> pure (dbc_context st)
154− (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TransactionInfo (transactionId branchBTrans) S.empty testTime) updatedBranchBContext) graph
169+ (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TI.singleParent (transactionId branchBTrans) testTime) updatedBranchBContext) graph
155 --create the merge transaction in the graph
170 --create the merge transaction in the graph
156− let eGraph' = mergeTransactions testTime (fakeUUID 4) (fakeUUID 10) (SelectedBranchMergeStrategy "branchA") ("branchA", "branchB") graph'
171+ let eGraph' = runGraphRefRelationalExprM gfEnv $ mergeTransactions testTime (fakeUUID 4) (fakeUUID 10) (SelectedBranchMergeStrategy "branchA") ("branchA", "branchB")
172+ gfEnv = freshGraphRefRelationalExprEnv Nothing graph'
157
173
158 (_, graph'') <- assertEither eGraph'
174 (_, graph'') <- assertEither eGraph'
159
175
@@ -175,18 +191,22 @@ testUnionPreferMergeStrategy = TestCase $ do
175 branchBTrans <- assertMaybe (transactionForHead "branchB" graph) "branchBTrans"
191 branchBTrans <- assertMaybe (transactionForHead "branchB" graph) "branchBTrans"
176 branchBRelVar <- assertEither $ mkRelationFromList (attributesFromList [Attribute "conflict" IntAtomType]) []
192 branchBRelVar <- assertEither $ mkRelationFromList (attributesFromList [Attribute "conflict" IntAtomType]) []
177 let branchAContext = (concreteDatabaseContext branchATrans) {relationVariables = M.insert conflictRelVarName branchARelVar (relationVariables (concreteDatabaseContext branchATrans))}
193 let branchAContext = (concreteDatabaseContext branchATrans) {relationVariables = M.insert conflictRelVarName branchARelVar (relationVariables (concreteDatabaseContext branchATrans))}
178− branchARelVar = relationTrue
194+ branchARelVar = ExistingRelation relationTrue
179− branchBContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.insert conflictRelVarName branchBRelVar (relationVariables (concreteDatabaseContext branchBTrans))}
195+ branchBContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.insert conflictRelVarName (ExistingRelation branchBRelVar) (relationVariables (concreteDatabaseContext branchBTrans))}
180− conflictRelVarName = "conflictRelVar"
196+ conflictRelVarName = "conflictRelVar"
181
197
182− (_, graph') <- addTransaction "branchA" (createTrans (fakeUUID 3) (TransactionInfo (transactionId branchATrans) S.empty testTime) branchAContext) graph
198+ (_, graph') <- addTransaction "branchA" (createTrans (fakeUUID 3) (TI.singleParent (transactionId branchATrans) testTime) branchAContext) graph
183− (_, graph'') <- addTransaction "branchB" (createTrans (fakeUUID 4) (TransactionInfo (transactionId branchBTrans) S.empty testTime) branchBContext) graph'
199+ (_, graph'') <- addTransaction "branchB" (createTrans (fakeUUID 4) (TI.singleParent (transactionId branchBTrans) testTime) branchBContext) graph'
184 -- validate that the conflict is hidden because we preferred a branch
200 -- validate that the conflict is hidden because we preferred a branch
185− let merged = mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) (UnionPreferMergeStrategy "branchB") ("branchA", "branchB") graph''
201+ let merged = runGraphRefRelationalExprM env $ mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) (UnionPreferMergeStrategy "branchB") ("branchA", "branchB")
202+ env = freshGraphRefRelationalExprEnv Nothing graph''
186 case merged of
203 case merged of
187 Left err -> assertFailure ("expected merge success: " ++ show err)
204 Left err -> assertFailure ("expected merge success: " ++ show err)
188− Right (discon, _) ->
205+ Right (discon, _) -> do
206+ let Just rvExpr = M.lookup conflictRelVarName (relationVariables (Discon.concreteDatabaseContext discon))
207+ reEnv = freshGraphRefRelationalExprEnv (Just (Discon.concreteDatabaseContext discon)) graph
208+ let eRvRel = runGraphRefRelationalExprM reEnv (evalGraphRefRelationalExpr rvExpr)
189− assertEqual "branchB relvar preferred in conflict" (Just branchBRelVar) (M.lookup conflictRelVarName (relationVariables (Discon.concreteDatabaseContext discon)))
209+ assertEqual "branchB relvar preferred in conflict" (Right branchBRelVar) eRvRel
190
210
191-- try various individual component conflicts and check for merge failure
211-- try various individual component conflicts and check for merge failure
192testUnionMergeStrategy :: Test
212testUnionMergeStrategy :: Test
@@ -201,31 +221,41 @@ testUnionMergeStrategy = TestCase $ do
201
221
202 let updatedBranchBContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.insert branchBOnlyRelVarName branchBOnlyRelVar (relationVariables (concreteDatabaseContext branchBTrans)) }
222 let updatedBranchBContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.insert branchBOnlyRelVarName branchBOnlyRelVar (relationVariables (concreteDatabaseContext branchBTrans)) }
203 updatedBranchAContext = (concreteDatabaseContext branchATrans) {inclusionDependencies = M.insert branchAOnlyIncDepName branchAOnlyIncDep (inclusionDependencies (concreteDatabaseContext branchATrans)) }
223 updatedBranchAContext = (concreteDatabaseContext branchATrans) {inclusionDependencies = M.insert branchAOnlyIncDepName branchAOnlyIncDep (inclusionDependencies (concreteDatabaseContext branchATrans)) }
204− branchBOnlyRelVar = relationTrue
224+ branchBOnlyRelVar = ExistingRelation relationTrue
205 branchAOnlyIncDepName = "branchAOnlyIncDep"
225 branchAOnlyIncDepName = "branchAOnlyIncDep"
206 branchBOnlyRelVarName = "branchBOnlyRelVar"
226 branchBOnlyRelVarName = "branchBOnlyRelVar"
207 branchAOnlyIncDep = InclusionDependency (ExistingRelation relationTrue) (ExistingRelation relationTrue)
227 branchAOnlyIncDep = InclusionDependency (ExistingRelation relationTrue) (ExistingRelation relationTrue)
208− (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TransactionInfo (transactionId branchBTrans) S.empty testTime) updatedBranchBContext) graph
228+ (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TI.singleParent (transactionId branchBTrans) 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")
231+ let Just rvExpr = M.lookup branchBOnlyRelVarName (relationVariables (Discon.concreteDatabaseContext discon))
232+ Right rvRel = runGraphRefRelationalExprM reEnv (evalGraphRefRelationalExpr rvExpr)
233+ reEnv = freshGraphRefRelationalExprEnv (Just (Discon.concreteDatabaseContext discon)) graph
234+
210− assertEqual "branchBOnlyRelVar should appear in the merge" (M.lookup branchBOnlyRelVarName (relationVariables (Discon.concreteDatabaseContext discon))) (Just relationTrue)
235+ assertEqual "branchBOnlyRelVar should appear in the merge" relationTrue rvRel
211− (_, graph'') <- addTransaction "branchA" (createTrans (fakeUUID 4) (TransactionInfo (transactionId branchATrans) S.empty testTime) updatedBranchAContext) graph'
236+ (_, graph'') <- addTransaction "branchA" (createTrans (fakeUUID 4) (TI.singleParent (transactionId branchATrans) testTime) updatedBranchAContext) graph'
212− let eMergeGraph = mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) UnionMergeStrategy ("branchA", "branchB") graph''
237+ let eMergeGraph = runGraphRefRelationalExprM gfEnv $ mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) UnionMergeStrategy ("branchA", "branchB")
238+ gfEnv = freshGraphRefRelationalExprEnv Nothing graph''
213 case eMergeGraph of
239 case eMergeGraph of
214 Left err -> assertFailure ("expected merge success: " ++ show err)
240 Left err -> assertFailure ("expected merge success: " ++ show err)
215 Right (_, mergeGraph) -> do
241 Right (_, mergeGraph) -> do
216 -- check that the new merge transaction has the correct parents
242 -- check that the new merge transaction has the correct parents
217 mergeTrans <- assertEither $ transactionForId (fakeUUID 5) mergeGraph
243 mergeTrans <- assertEither $ transactionForId (fakeUUID 5) mergeGraph
218 let mergeContext = concreteDatabaseContext mergeTrans
244 let mergeContext = concreteDatabaseContext mergeTrans
219− assertEqual "merge transaction parents" (transactionParentIds mergeTrans) (S.fromList [fakeUUID 3, fakeUUID 4])
245+ assertEqual "merge transaction parents" (parentIds mergeTrans) (S.fromList [fakeUUID 3, fakeUUID 4])
220 -- check that the new merge tranasction has elements from both A and B branches
246 -- check that the new merge tranasction has elements from both A and B branches
221− assertEqual "merge transaction relvars" (Just relationTrue) (M.lookup branchBOnlyRelVarName (relationVariables mergeContext))
247+ let Just rvExpr' = 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'
222 assertEqual "merge transaction incdeps" (Just branchAOnlyIncDep) (M.lookup branchAOnlyIncDepName (inclusionDependencies mergeContext))
251 assertEqual "merge transaction incdeps" (Just branchAOnlyIncDep) (M.lookup branchAOnlyIncDepName (inclusionDependencies mergeContext))
223 -- test an expected conflict- add branchBOnlyRelVar with same name but different attributes
252 -- test an expected conflict- add branchBOnlyRelVar with same name but different attributes
224 conflictRelVar <- assertEither $ mkRelationFromList (attributesFromList [Attribute "conflict" IntAtomType]) []
253 conflictRelVar <- assertEither $ mkRelationFromList (attributesFromList [Attribute "conflict" IntAtomType]) []
225− let conflictContextA = updatedBranchAContext {relationVariables = M.insert branchBOnlyRelVarName conflictRelVar (relationVariables updatedBranchAContext) }
254+ let conflictContextA = updatedBranchAContext {relationVariables = M.insert branchBOnlyRelVarName (ExistingRelation conflictRelVar) (relationVariables updatedBranchAContext) }
226 conflictBranchATrans <- assertMaybe (transactionForHead "branchA" graph'') "retrieving head transaction for expected conflict"
255 conflictBranchATrans <- assertMaybe (transactionForHead "branchA" graph'') "retrieving head transaction for expected conflict"
227− (_, graph''') <- addTransaction "branchA" (createTrans (fakeUUID 6) (TransactionInfo (transactionId conflictBranchATrans) S.empty testTime) conflictContextA) graph''
256+ (_, graph''') <- addTransaction "branchA" (createTrans (fakeUUID 6) (TI.singleParent (transactionId conflictBranchATrans) testTime) conflictContextA) graph''
228− let failingMerge = mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) UnionMergeStrategy ("branchA", "branchB") graph'''
257+ let failingMerge = runGraphRefRelationalExprM gfEnv' $ mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) UnionMergeStrategy ("branchA", "branchB")
258+ gfEnv' = freshGraphRefRelationalExprEnv Nothing graph'''
229 case failingMerge of
259 case failingMerge of
230 Right _ -> assertFailure "expected merge failure"
260 Right _ -> assertFailure "expected merge failure"
231 Left err -> assertEqual "merge failure" err (MergeTransactionError StrategyViolatesRelationVariableMergeError)
261 Left err -> assertEqual "merge failure" err (MergeTransactionError StrategyViolatesRelationVariableMergeError)
@@ -244,20 +274,21 @@ testUnionMergeIncDepViolation = TestCase $ do
244 rvName = "x"
274 rvName = "x"
245 Right branchArv = eRel 2
275 Right branchArv = eRel 2
246 Right branchBrv = eRel 3
276 Right branchBrv = eRel 3
247− branchAContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.singleton rvName branchArv}
277+ branchAContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.singleton rvName (ExistingRelation branchArv)}
248− branchBContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.singleton rvName branchBrv,
278+ branchBContext = (concreteDatabaseContext branchBTrans) {relationVariables = M.singleton rvName (ExistingRelation branchBrv),
249 inclusionDependencies = M.singleton incDepName incDep}
279 inclusionDependencies = M.singleton incDepName incDep}
250 incDepName = "x_key"
280 incDepName = "x_key"
251 incDep = inclusionDependencyForKey (AttributeNames (S.singleton "x")) (RelationVariable "x" ())
281 incDep = inclusionDependencyForKey (AttributeNames (S.singleton "x")) (RelationVariable "x" ())
252
282
253
283
254 --add the rv in new commits to both branches
284 --add the rv in new commits to both branches
255− (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TransactionInfo (transactionId branchBTrans) S.empty testTime) branchBContext) graph
285+ (_, graph') <- addTransaction "branchB" (createTrans (fakeUUID 3) (TI.singleParent (transactionId branchBTrans) testTime) branchBContext) graph
256
286
257− (_, graph'') <- addTransaction "branchA" (createTrans (fakeUUID 4) (TransactionInfo (transactionId branchATrans) S.empty testTime) branchAContext) graph'
287+ (_, graph'') <- addTransaction "branchA" (createTrans (fakeUUID 4) (TI.singleParent (transactionId branchATrans) testTime) branchAContext) graph'
258
288
259 --check that the union merge fails due to a violated constraint
289 --check that the union merge fails due to a violated constraint
260− let eMerge = mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) UnionMergeStrategy ("branchA", "branchB") graph''
290+ let eMerge = runGraphRefRelationalExprM env $ mergeTransactions testTime (fakeUUID 5) (fakeUUID 3) UnionMergeStrategy ("branchA", "branchB")
291+ env = freshGraphRefRelationalExprEnv Nothing graph''
261 case eMerge of
292 case eMerge of
262 Left (InclusionDependencyCheckError incDepName') -> assertEqual "incdep violation name" incDepName incDepName'
293 Left (InclusionDependencyCheckError incDepName') -> assertEqual "incdep violation name" incDepName incDepName'
263 Left err -> assertFailure ("other error: " ++ show err)
294 Left err -> assertFailure ("other error: " ++ show err)
test/TransactionGraph/Persist.hs+83−18
@@ -1,14 +1,14 @@
1+{-# LANGUAGE CPP #-}
1import Test.HUnit
2import Test.HUnit
2import ProjectM36.Base
3import ProjectM36.Base
3import ProjectM36.Persist (DiskSync(NoDiskSync))
4import ProjectM36.Persist (DiskSync(NoDiskSync))
4import ProjectM36.TransactionGraph.Persist
5import ProjectM36.TransactionGraph.Persist
5−import ProjectM36.TransactionGraph
6+import ProjectM36.TransactionGraph as TG
6import ProjectM36.Transaction
7import ProjectM36.Transaction
7import ProjectM36.DateExamples
8import ProjectM36.DateExamples
8−import ProjectM36.Client
9−import ProjectM36.Relation
10import System.IO.Temp
9import System.IO.Temp
11import System.Exit
10import 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,6 +17,9 @@ 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
20
23
21main :: IO ()
24main :: IO ()
22main = do
25main = do
@@ -25,11 +28,13 @@ main = do
25
28
26testList :: Test
29testList :: Test
27testList = TestList [testBootstrapDB,
30testList = TestList [testBootstrapDB,
28− testDBSimplePersistence,
31+ testDBSimplePersistence,
29− testFunctionPersistence]
32+ testFunctionPersistence,
33+ testMerkleHashValidation]
34+
30
35
31−stamp :: UTCTime
36+stamp' :: UTCTime
32−stamp = UTCTime (fromGregorian 1980 01 01) (secondsToDiffTime 1000)
37+stamp' = UTCTime (fromGregorian 1980 01 01) (secondsToDiffTime 1000)
33
38
34{- bootstrap a database, ensure that it can be read -}
39{- bootstrap a database, ensure that it can be read -}
35testBootstrapDB :: Test
40testBootstrapDB :: Test
@@ -37,7 +42,7 @@ testBootstrapDB = TestCase $ withSystemTempDirectory "m36testdb" $ \tempdir -> d
37 let dbdir = tempdir </> "dbdir"
42 let dbdir = tempdir </> "dbdir"
38 freshId <- nextRandom
43 freshId <- nextRandom
39
44
40− _ <- bootstrapDatabaseDir NoDiskSync dbdir (bootstrapTransactionGraph stamp freshId dateExamples)
45+ _ <- bootstrapDatabaseDir NoDiskSync dbdir (bootstrapTransactionGraph stamp' freshId dateExamples)
41 loadedGraph <- transactionGraphLoad dbdir emptyTransactionGraph Nothing
46 loadedGraph <- transactionGraphLoad dbdir emptyTransactionGraph Nothing
42 assertBool "transactionGraphLoad" $ isRight loadedGraph
47 assertBool "transactionGraphLoad" $ isRight loadedGraph
43
48
@@ -47,17 +52,17 @@ testDBSimplePersistence = TestCase $ withSystemTempDirectory "m36testdb" $ \temp
47 let dbdir = tempdir </> "dbdir"
52 let dbdir = tempdir </> "dbdir"
48 freshId <- nextRandom
53 freshId <- nextRandom
49
54
50− let graph = bootstrapTransactionGraph stamp freshId dateExamples
55+ let graph = bootstrapTransactionGraph stamp' freshId dateExamples
51 _ <- bootstrapDatabaseDir NoDiskSync dbdir graph
56 _ <- bootstrapDatabaseDir NoDiskSync dbdir graph
52 case transactionForHead "master" graph of
57 case transactionForHead "master" graph of
53 Nothing -> assertFailure "Failed to retrieve head transaction for master branch."
58 Nothing -> assertFailure "Failed to retrieve head transaction for master branch."
54 Just headTrans ->
59 Just headTrans ->
55− case interpretDatabaseContextExpr (concreteDatabaseContext headTrans) "x:=s" of
60+ case interpretDatabaseContextExpr (concreteDatabaseContext headTrans) (transactionId headTrans) graph "x:=s" of
56 Left err -> assertFailure (show err)
61 Left err -> assertFailure (show err)
57 Right context' -> do
62 Right context' -> do
58 freshId' <- nextRandom
63 freshId' <- nextRandom
59− let newdiscon = DisconnectedTransaction (transactionId headTrans) (Schemas context' M.empty) True
64+ let newdiscon = DisconnectedTransaction (transactionId headTrans) (Schemas context' M.empty) False
60− addTrans = addDisconnectedTransaction stamp freshId' "master" newdiscon graph
65+ addTrans = addDisconnectedTransaction stamp' freshId' "master" newdiscon graph
61 --add a transaction to the graph
66 --add a transaction to the graph
62 case addTrans of
67 case addTrans of
63 Left err -> assertFailure (show err)
68 Left err -> assertFailure (show err)
@@ -70,11 +75,70 @@ testDBSimplePersistence = TestCase $ withSystemTempDirectory "m36testdb" $ \temp
70 case graphErr of
75 case graphErr of
71 Left err -> assertFailure (show err)
76 Left err -> assertFailure (show err)
72 Right graph'' -> assertBool "graph equality" (mapEq graph'' == mapEq graph')
77 Right graph'' -> assertBool "graph equality" (mapEq graph'' == mapEq graph')
73−
78+
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+
74
134
75--only Haskell-scripted dbc and atom functions can be serialized
135--only Haskell-scripted dbc and atom functions can be serialized
76testFunctionPersistence :: Test
136testFunctionPersistence :: Test
137+#if !defined(PM36_HASKELL_SCRIPTING)
138+testFunctionPersistence = TestCase $ pure ()
139+#else
140+testFunctionPersistence = TestCase $
77−testFunctionPersistence = TestCase $ withSystemTempDirectory "m36testdb" $ \tempdir -> do
141+ withSystemTempDirectory "m36testdb" $ \tempdir -> do
78 let dbdir = tempdir </> "dbdir"
142 let dbdir = tempdir </> "dbdir"
79 connInfo = InProcessConnectionInfo (MinimalPersistence dbdir) emptyNotificationCallback []
143 connInfo = InProcessConnectionInfo (MinimalPersistence dbdir) emptyNotificationCallback []
80 conn <- assertIOEither $ connectProjectM36 connInfo
144 conn <- assertIOEither $ connectProjectM36 connInfo
@@ -85,17 +149,18 @@ testFunctionPersistence = TestCase $ withSystemTempDirectory "m36testdb" $ \temp
85 ADTypeConstructor "Either" [ADTypeConstructor "AtomFunctionError" [],
149 ADTypeConstructor "Either" [ADTypeConstructor "AtomFunctionError" [],
86 intTCons]] "(\\(x:_) -> pure x) :: [Atom] -> Either AtomFunctionError Atom"
150 intTCons]] "(\\(x:_) -> pure x) :: [Atom] -> Either AtomFunctionError Atom"
87 _ <- assertIOEither $ executeDatabaseContextIOExpr sess conn addfunc
151 _ <- assertIOEither $ executeDatabaseContextIOExpr sess conn addfunc
88−
89 _ <- assertIOEither $ commit sess conn
152 _ <- assertIOEither $ commit sess conn
90− close conn
153+ --close conn - pauses indefinitely on Windows
91 --re-open the connection to reload the graph
154 --re-open the connection to reload the graph
92 conn2 <- assertIOEither $ connectProjectM36 connInfo
155 conn2 <- assertIOEither $ connectProjectM36 connInfo
93 sess2 <- assertIOEither $ createSessionAtHead conn2 "master"
156 sess2 <- assertIOEither $ createSessionAtHead conn2 "master"
94
157
95− res <- executeRelationalExpr sess2 conn2 (MakeRelationFromExprs Nothing [TupleExpr (M.singleton "a" (FunctionAtomExpr "testdisk" [NakedAtomExpr (IntAtom 3)] ()))])
158+ res <- executeRelationalExpr sess2 conn2 (MakeRelationFromExprs Nothing (TupleExprs () [TupleExpr (M.singleton "a" (FunctionAtomExpr "testdisk" [NakedAtomExpr (IntAtom 3)] ()))]))
96 let expectedRel = mkRelationFromList (attributesFromList [Attribute "a" IntAtomType]) [[IntAtom 3]]
159 let expectedRel = mkRelationFromList (attributesFromList [Attribute "a" IntAtomType]) [[IntAtom 3]]
97 assertEqual "testdisk dbc function run" expectedRel res
160 assertEqual "testdisk dbc function run" expectedRel res
98−
161+
162+#endif
163+
99assertIOEither :: (Show a) => IO (Either a b) -> IO b
164assertIOEither :: (Show a) => IO (Either a b) -> IO b
100assertIOEither x = do
165assertIOEither x = do
101 ret <- x
166 ret <- x
test/TutorialD/Interpreter/AtomFunctionScript.hs+25−17
@@ -1,25 +1,32 @@
1−import TutorialD.Interpreter.TestBase
1+{-# LANGUAGE CPP #-}
2import System.Exit
2import System.Exit
3import Test.HUnit
3import Test.HUnit
4+#ifdef PM36_HASKELL_SCRIPTING
5+import TutorialD.Interpreter.TestBase
4import ProjectM36.Client
6import ProjectM36.Client
5import ProjectM36.Relation
7import ProjectM36.Relation
6import ProjectM36.DataTypes.Maybe
8import ProjectM36.DataTypes.Maybe
7import qualified Data.Vector as V
9import qualified Data.Vector as V
8import qualified Data.Map as M
10import qualified Data.Map as M
11+#endif
9
12
10{-# ANN module ("HLint: ignore Reduce duplication" :: String) #-}
13{-# ANN module ("HLint: ignore Reduce duplication" :: String) #-}
11main :: IO ()
14main :: IO ()
12main = do
15main = do
13− tcounts <- runTestTT (TestList [testBasicAtomFunction,
16+ tcounts <- runTestTT (TestList [
17+#ifdef PM36_HASKELL_SCRIPTING
18+ testBasicAtomFunction,
14− testExceptionAtomFunction,
19+ testExceptionAtomFunction,
15− testErrorAtomFunction,
20+ testErrorAtomFunction,
16− testNoArgumentAtomFunction,
21+ testNoArgumentAtomFunction,
17− testArgumentTypeMismatch,
22+ testArgumentTypeMismatch,
18− testPolymorphicReturnType,
23+ testPolymorphicReturnType,
19− testScriptedTypeVariable
24+ testScriptedTypeVariable
25+#endif
20− ])
26+ ])
21 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
27 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
22
28
29+#ifdef PM36_HASKELL_SCRIPTING
23--add an atom function and run it
30--add an atom function and run it
24testBasicAtomFunction :: Test
31testBasicAtomFunction :: Test
25testBasicAtomFunction = TestCase $ do
32testBasicAtomFunction = TestCase $ do
@@ -29,7 +36,7 @@ testBasicAtomFunction = TestCase $ do
29 funcAtomExpr = FunctionAtomExpr "mkTest" [NakedAtomExpr (IntegerAtom 3)] ()
36 funcAtomExpr = FunctionAtomExpr "mkTest" [NakedAtomExpr (IntegerAtom 3)] ()
30 tupleExprs = [TupleExpr (M.singleton "x" funcAtomExpr)]
37 tupleExprs = [TupleExpr (M.singleton "x" funcAtomExpr)]
31 expectedResult = mkRelationFromList (V.fromList attrs) [[IntegerAtom 3]]
38 expectedResult = mkRelationFromList (V.fromList attrs) [[IntegerAtom 3]]
32− result <- executeRelationalExpr sess conn (MakeRelationFromExprs (Just (map NakedAttributeExpr attrs)) tupleExprs)
39+ result <- executeRelationalExpr sess conn (MakeRelationFromExprs (Just (map NakedAttributeExpr attrs)) (TupleExprs () tupleExprs))
33
40
34 assertEqual "simple atom function equality" expectedResult result
41 assertEqual "simple atom function equality" expectedResult result
35
42
@@ -40,7 +47,7 @@ testExceptionAtomFunction = TestCase $ do
40 executeTutorialD sess conn "addatomfunction \"mkTest\" Integer -> Either AtomFunctionError Integer \"\"\"(\\(IntegerAtom x:xs) -> (error (show 1))) :: [Atom] -> Either AtomFunctionError Atom\"\"\""
47 executeTutorialD sess conn "addatomfunction \"mkTest\" Integer -> Either AtomFunctionError Integer \"\"\"(\\(IntegerAtom x:xs) -> (error (show 1))) :: [Atom] -> Either AtomFunctionError Atom\"\"\""
41 let attrs = [Attribute "x" IntegerAtomType]
48 let attrs = [Attribute "x" IntegerAtomType]
42 funcAtomExpr = FunctionAtomExpr "mkTest" [NakedAtomExpr (IntegerAtom 3)] ()
49 funcAtomExpr = FunctionAtomExpr "mkTest" [NakedAtomExpr (IntegerAtom 3)] ()
43− tupleExprs = [TupleExpr (M.singleton "x" funcAtomExpr)]
50+ tupleExprs = TupleExprs () [TupleExpr (M.singleton "x" funcAtomExpr)]
44 result <- executeRelationalExpr sess conn (MakeRelationFromExprs (Just (map NakedAttributeExpr attrs)) tupleExprs)
51 result <- executeRelationalExpr sess conn (MakeRelationFromExprs (Just (map NakedAttributeExpr attrs)) tupleExprs)
45 assertBool "catch error exception from script" (case result of
52 assertBool "catch error exception from script" (case result of
46 Left (UnhandledExceptionError _) -> True
53 Left (UnhandledExceptionError _) -> True
@@ -57,7 +64,7 @@ testNoArgumentAtomFunction = TestCase $ do
57 executeTutorialD sess conn "addatomfunction \"mkTest\" Either AtomFunctionError Integer \"\"\"(\\x -> pure (IntegerAtom 5)) :: [Atom] -> Either AtomFunctionError Atom\"\"\""
64 executeTutorialD sess conn "addatomfunction \"mkTest\" Either AtomFunctionError Integer \"\"\"(\\x -> pure (IntegerAtom 5)) :: [Atom] -> Either AtomFunctionError Atom\"\"\""
58 let attrs = [Attribute "x" IntegerAtomType]
65 let attrs = [Attribute "x" IntegerAtomType]
59 funcAtomExpr = FunctionAtomExpr "mkTest" [] ()
66 funcAtomExpr = FunctionAtomExpr "mkTest" [] ()
60− tupleExprs = [TupleExpr (M.singleton "x" funcAtomExpr)]
67+ tupleExprs = TupleExprs () [TupleExpr (M.singleton "x" funcAtomExpr)]
61 expectedResult = mkRelationFromList (V.fromList attrs) [[IntegerAtom 5]]
68 expectedResult = mkRelationFromList (V.fromList attrs) [[IntegerAtom 5]]
62 result <- executeRelationalExpr sess conn (MakeRelationFromExprs (Just (map NakedAttributeExpr attrs)) tupleExprs)
69 result <- executeRelationalExpr sess conn (MakeRelationFromExprs (Just (map NakedAttributeExpr attrs)) tupleExprs)
63 assertEqual "no argument scripted function" expectedResult result
70 assertEqual "no argument scripted function" expectedResult result
@@ -66,7 +73,7 @@ testArgumentTypeMismatch :: Test
66testArgumentTypeMismatch = TestCase $ do
73testArgumentTypeMismatch = TestCase $ do
67 (sess, conn) <- dateExamplesConnection emptyNotificationCallback
74 (sess, conn) <- dateExamplesConnection emptyNotificationCallback
68 executeTutorialD sess conn "addatomfunction \"mkTest\" Integer -> Either AtomFunctionError Integer \"\"\"(\\(IntegerAtom x:_) -> pure $ TextAtom \"wrong type\") :: [Atom] -> Either AtomFunctionError Atom\"\"\""
75 executeTutorialD sess conn "addatomfunction \"mkTest\" Integer -> Either AtomFunctionError Integer \"\"\"(\\(IntegerAtom x:_) -> pure $ TextAtom \"wrong type\") :: [Atom] -> Either AtomFunctionError Atom\"\"\""
69− let tupleExprs = [TupleExpr (M.singleton "x" funcAtomExpr)]
76+ let tupleExprs = TupleExprs () [TupleExpr (M.singleton "x" funcAtomExpr)]
70 funcAtomExpr = FunctionAtomExpr "mkTest" [NakedAtomExpr (IntegerAtom 3)] ()
77 funcAtomExpr = FunctionAtomExpr "mkTest" [NakedAtomExpr (IntegerAtom 3)] ()
71 attrs = [Attribute "x" IntegerAtomType]
78 attrs = [Attribute "x" IntegerAtomType]
72 expectedResult = Left (AtomTypeMismatchError IntegerAtomType TextAtomType)
79 expectedResult = Left (AtomTypeMismatchError IntegerAtomType TextAtomType)
@@ -80,7 +87,7 @@ testPolymorphicReturnType = TestCase $ do
80 let funcAtomExpr = FunctionAtomExpr "fromMaybe" [NakedAtomExpr (IntegerAtom 5),
87 let funcAtomExpr = FunctionAtomExpr "fromMaybe" [NakedAtomExpr (IntegerAtom 5),
81 NakedAtomExpr maybeAtom] ()
88 NakedAtomExpr maybeAtom] ()
82 maybeAtom = ConstructedAtom "Just" (maybeAtomType IntegerAtomType) [IntegerAtom 3]
89 maybeAtom = ConstructedAtom "Just" (maybeAtomType IntegerAtomType) [IntegerAtom 3]
83− relExpr = MakeRelationFromExprs Nothing [TupleExpr (M.singleton "x" funcAtomExpr)]
90+ relExpr = MakeRelationFromExprs Nothing (TupleExprs () [TupleExpr (M.singleton "x" funcAtomExpr)])
84 mRelType <- typeForRelationalExpr sess conn relExpr
91 mRelType <- typeForRelationalExpr sess conn relExpr
85 case mRelType of
92 case mRelType of
86 Left err -> assertFailure (show err)
93 Left err -> assertFailure (show err)
@@ -94,7 +101,7 @@ testPolymorphicReturnType = TestCase $ do
94 let failFuncAtomExpr = FunctionAtomExpr "fromMaybe" [NakedAtomExpr (IntegerAtom 5),
101 let failFuncAtomExpr = FunctionAtomExpr "fromMaybe" [NakedAtomExpr (IntegerAtom 5),
95 NakedAtomExpr mismatchAtom] ()
102 NakedAtomExpr mismatchAtom] ()
96 mismatchAtom = ConstructedAtom "Just" (maybeAtomType TextAtomType) [TextAtom "fail"]
103 mismatchAtom = ConstructedAtom "Just" (maybeAtomType TextAtomType) [TextAtom "fail"]
97− failRelExpr = MakeRelationFromExprs Nothing [TupleExpr (M.singleton "x" failFuncAtomExpr)]
104+ failRelExpr = MakeRelationFromExprs Nothing (TupleExprs () [TupleExpr (M.singleton "x" failFuncAtomExpr)])
98 mFailRes <- executeRelationalExpr sess conn failRelExpr
105 mFailRes <- executeRelationalExpr sess conn failRelExpr
99 let expectedErr = Left (AtomFunctionTypeVariableMismatch "a" IntegerAtomType TextAtomType)
106 let expectedErr = Left (AtomFunctionTypeVariableMismatch "a" IntegerAtomType TextAtomType)
100 assertEqual "expected type variable mismatch" expectedErr mFailRes
107 assertEqual "expected type variable mismatch" expectedErr mFailRes
@@ -106,9 +113,10 @@ testScriptedTypeVariable = TestCase $ do
106 executeTutorialD sess conn "addatomfunction \"idTest\" a -> Either AtomFunctionError a \"(\\\\(x:_) -> pure x) :: [Atom] -> Either AtomFunctionError Atom\""
113 executeTutorialD sess conn "addatomfunction \"idTest\" a -> Either AtomFunctionError a \"(\\\\(x:_) -> pure x) :: [Atom] -> Either AtomFunctionError Atom\""
107 let attrs = [Attribute "x" IntegerAtomType]
114 let attrs = [Attribute "x" IntegerAtomType]
108 funcAtomExpr = FunctionAtomExpr "idTest" [NakedAtomExpr (IntegerAtom 3)] ()
115 funcAtomExpr = FunctionAtomExpr "idTest" [NakedAtomExpr (IntegerAtom 3)] ()
109− tupleExprs = [TupleExpr (M.singleton "x" funcAtomExpr)]
116+ tupleExprs = TupleExprs () [TupleExpr (M.singleton "x" funcAtomExpr)]
110 expectedResult = mkRelationFromList (V.fromList attrs) [[IntegerAtom 3]]
117 expectedResult = mkRelationFromList (V.fromList attrs) [[IntegerAtom 3]]
111 result <- executeRelationalExpr sess conn (MakeRelationFromExprs (Just (map NakedAttributeExpr attrs)) tupleExprs)
118 result <- executeRelationalExpr sess conn (MakeRelationFromExprs (Just (map NakedAttributeExpr attrs)) tupleExprs)
112
119
113 assertEqual "id function equality" expectedResult result
120 assertEqual "id function equality" expectedResult result
114−
121+
122+#endif
test/TutorialD/Interpreter/DatabaseContextFunctionScript.hs+16−17
@@ -1,31 +1,36 @@
1−import TutorialD.Interpreter.TestBase
1+{-# LANGUAGE CPP #-}
2import System.Exit
2import System.Exit
3import Test.HUnit
3import Test.HUnit
4+#ifdef PM36_HASKELL_SCRIPTING
5+import TutorialD.Interpreter.TestBase
4import ProjectM36.Client
6import ProjectM36.Client
5import ProjectM36.Relation
7import ProjectM36.Relation
6import qualified Data.Text as T
8import qualified Data.Text as T
9+#endif
7
10
8main :: IO ()
11main :: IO ()
9main = do
12main = do
10− tcounts <- runTestTT (TestList [testBasicDBCFunction,
13+ tcounts <- runTestTT (TestList [
14+#ifdef PM36_HASKELL_SCRIPTING
15+ testBasicDBCFunction,
11− testErrorDBCFunction,
16+ testErrorDBCFunction,
12− testExceptionDBCFunction,
17+ testExceptionDBCFunction,
13− testDBCFunctionWithAtomArguments
18+ testDBCFunctionWithAtomArguments
19+#endif
14 ])
20 ])
15 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
21 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
16
22
17−{-
23+#ifdef PM36_HASKELL_SCRIPTING
18−adddatabasecontextfunction "addtruerv" DatabaseContext -> DatabaseContext """(\[] ctx -> execState (evalDatabaseContextExpr (Assign "true2" (ExistingRelation relationTrue))) ctx) :: [Atom] -> DatabaseContext -> DatabaseContext"""
19−-}
20testBasicDBCFunction :: Test
24testBasicDBCFunction :: Test
21testBasicDBCFunction = TestCase $ do
25testBasicDBCFunction = TestCase $ do
22 (sess, conn) <- dateExamplesConnection emptyNotificationCallback
26 (sess, conn) <- dateExamplesConnection emptyNotificationCallback
23 let addfunc = "adddatabasecontextfunction \"addTrue2\" DatabaseContext -> Either DatabaseContextFunctionError DatabaseContext \"\"\"(\\[] ctx -> executeDatabaseContextExpr (Assign \"true2\" (ExistingRelation relationTrue)) ctx) :: [Atom] -> DatabaseContext -> Either DatabaseContextFunctionError DatabaseContext\"\"\""
27 let addfunc = "adddatabasecontextfunction \"addTrue2\" DatabaseContext -> Either DatabaseContextFunctionError DatabaseContext \"\"\"(\\[] ctx -> executeDatabaseContextExpr (Assign \"true2\" (ExistingRelation relationTrue)) ctx) :: [Atom] -> DatabaseContext -> Either DatabaseContextFunctionError DatabaseContext\"\"\""
24 executeTutorialD sess conn addfunc
28 executeTutorialD sess conn addfunc
25 executeTutorialD sess conn "execute addTrue2()"
29 executeTutorialD sess conn "execute addTrue2()"
30+ {-
26 let true2Expr = RelationVariable "true2" ()
31 let true2Expr = RelationVariable "true2" ()
27 result <- executeRelationalExpr sess conn true2Expr
32 result <- executeRelationalExpr sess conn true2Expr
28− assertEqual "simple atom function equality" (Right relationTrue) result
33+ assertEqual "simple atom function equality" (Right relationTrue) result-}
29
34
30testErrorDBCFunction :: Test
35testErrorDBCFunction :: Test
31testErrorDBCFunction = TestCase $ do
36testErrorDBCFunction = TestCase $ do
@@ -40,12 +45,9 @@ testExceptionDBCFunction = TestCase $ do
40 (sess, conn) <- dateExamplesConnection emptyNotificationCallback
45 (sess, conn) <- dateExamplesConnection emptyNotificationCallback
41 let addfunc = "adddatabasecontextfunction \"bomb\" DatabaseContext -> Either DatabaseContextFunctionError DatabaseContext \"\"\"(\\[] _ -> error \"boom\") :: [Atom] -> DatabaseContext -> Either DatabaseContextFunctionError DatabaseContext\"\"\""
46 let addfunc = "adddatabasecontextfunction \"bomb\" DatabaseContext -> Either DatabaseContextFunctionError DatabaseContext \"\"\"(\\[] _ -> error \"boom\") :: [Atom] -> DatabaseContext -> Either DatabaseContextFunctionError DatabaseContext\"\"\""
42 executeTutorialD sess conn addfunc
47 executeTutorialD sess conn addfunc
43− expectTutorialDErr sess conn (\err -> "UnhandledExceptionError" `T.isPrefixOf` err) "execute bomb()"
48+ expectTutorialDErr sess conn ("UnhandledExceptionError" `T.isPrefixOf`) "execute bomb()"
44
49
45
50
46−{-
47−adddatabasecontextfunction "multiArgFunc" Int -> Text -> DatabaseContext -> DatabaseContext """(\(age:name:_) ctx -> execState (evalDatabaseContextExpr (Assign "person" (MakeRelationFromExprs Nothing [TupleExpr (fromList [("name", NakedAtomExpr name), ("age", NakedAtomExpr age)])]))) ctx)"""
48−-}
49testDBCFunctionWithAtomArguments :: Test
51testDBCFunctionWithAtomArguments :: Test
50testDBCFunctionWithAtomArguments = TestCase $ do
52testDBCFunctionWithAtomArguments = TestCase $ do
51 --test function with creation of a relvar with some arguments
53 --test function with creation of a relvar with some arguments
@@ -60,7 +62,4 @@ testDBCFunctionWithAtomArguments = TestCase $ do
60 assertEqual "person relation" expectedPerson result
62 assertEqual "person relation" expectedPerson result
61 expectTutorialDErr sess conn (T.isPrefixOf "AtomTypeMismatchError") "execute multiArgFunc(\"fail\", \"fail\")"
63 expectTutorialDErr sess conn (T.isPrefixOf "AtomTypeMismatchError") "execute multiArgFunc(\"fail\", \"fail\")"
62
64
63−{-
65+#endif
64−adddatabasecontextfunction "addperson" Int -> Text -> DatabaseContext -> DatabaseContext """(\(age:name:_) ctx -> let newrel = MakeRelationFromExprs Nothing [TupleExpr (fromList [("name", name),("age",age))]] in if isRight (runState (executeRelationalExpr (RelationVariable "person" ()) ctx)) then execState (executeContextExpr (Insert "person" newrel)) ctx else execState (executeContextExpr (Assign "person" newrel)) ctx) :: [Atom] -> DatabaseContext -> DatabaseContext"""
65−-}
66−
test/TutorialD/Interpreter/Import/ImportTest.hsnew file+47
@@ -0,0 +1,47 @@
1+import Test.HUnit
2+import ProjectM36.Base
3+import TutorialD.Interpreter.Import.TutorialD
4+import System.Exit
5+import qualified Data.Text as T
6+import System.IO.Temp
7+import System.FilePath
8+import qualified Data.Map as M
9+import System.IO
10+import System.Directory
11+import qualified Data.ByteString as BS
12+import qualified Data.Text.Encoding as TE
13+import Text.URI hiding (makeAbsolute)
14+
15+main :: IO ()
16+main = do
17+ tcounts <- runTestTT $ TestList [testTutdFileImport
18+ ,testTutdHTTPSImport
19+ ]
20+ if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
21+
22+testTutdFileImport :: Test
23+testTutdFileImport = TestCase $
24+ withSystemTempFile "m.tutd" $ \tempPath handle -> do
25+ BS.hPut handle (TE.encodeUtf8 "x:=relation{tuple{a 5,b \"spam\"}}; y:=relation{tuple{b \"漢字\"}}")
26+ hClose handle
27+ let expectedExpr = MultipleExpr [
28+ Assign "x" (MakeRelationFromExprs Nothing
29+ $ TupleExprs () [TupleExpr (M.fromList [("a", NakedAtomExpr $ IntegerAtom 5),
30+ ("b", NakedAtomExpr $ TextAtom "spam")])]),
31+ Assign "y" (MakeRelationFromExprs Nothing
32+ $ TupleExprs () [TupleExpr (M.fromList [("b", NakedAtomExpr (TextAtom "漢字"))])])]
33+ --on Windows, the file URI should not include the drive letter "/c/Users..." -> "/Users"
34+ let uri = "file://" <> map (\c -> if c == '\\' then '/' else c) ( joinDrive "/" (dropDrive tempPath))
35+ fileURI <- mkURI (T.pack uri)
36+ imported <- importTutorialDFromFile fileURI Nothing
37+ assertEqual "import tutd" (Right expectedExpr) imported
38+
39+testTutdHTTPSImport :: Test
40+testTutdHTTPSImport = TestCase $ do
41+ uri <- mkURI "https://raw.githubusercontent.com/agentm/project-m36/master/test/TutorialD/Interpreter/Import/httpimporttest.tutd"
42+ let hash = "effe32b247586dc3ac0079fc241b9618d41d189afcaeb7907edbe5a8b45992a4"
43+ expected = Right (MultipleExpr [Assign "x" (RelationVariable "true" ()),Assign "y" (RelationVariable "false" ())])
44+ actual <- importTutorialDViaHTTP uri (Just hash)
45+ assertEqual "github https" expected actual
46+
47+
test/TutorialD/Interpreter/Import/TutorialD.hsdeleted−29
@@ -1,29 +0,0 @@
1−import Test.HUnit
2−import ProjectM36.Base
3−import TutorialD.Interpreter.Import.TutorialD
4−import System.Exit
5−import System.IO.Temp
6−import qualified Data.Map as M
7−import System.IO
8−import qualified Data.ByteString as BS
9−import qualified Data.Text.Encoding as TE
10−
11−main :: IO ()
12−main = do
13− tcounts <- runTestTT $ TestList [testTutdImport]
14− if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
15−
16−testTutdImport :: Test
17−testTutdImport = TestCase $
18− withSystemTempFile "m.tutd" $ \tempPath handle -> do
19− BS.hPut handle (TE.encodeUtf8 "x:=relation{tuple{a 5,b \"spam\"}}; y:=relation{tuple{b \"漢字\"}}")
20− hClose handle
21− let expectedExpr = MultipleExpr [
22− Assign "x" (MakeRelationFromExprs Nothing
23− [TupleExpr (M.fromList [("a", NakedAtomExpr $ IntegerAtom 5),
24− ("b", NakedAtomExpr $ TextAtom "spam")])]),
25− Assign "y" (MakeRelationFromExprs Nothing
26− [TupleExpr (M.fromList [("b", NakedAtomExpr (TextAtom "漢字"))])])]
27− imported <- importTutorialD tempPath
28− assertEqual "import tutd" (Right expectedExpr) imported
29−
test/TutorialD/Interpreter/Import/httpimporttest.tutdnew file+2
@@ -0,0 +1,2 @@
1+x:=true;
2+y:=false;
test/TutorialD/Interpreter/TestBase.hs+7−8
@@ -2,16 +2,14 @@ module TutorialD.Interpreter.TestBase where
2import ProjectM36.Client
2import ProjectM36.Client
3import TutorialD.Interpreter
3import TutorialD.Interpreter
4import TutorialD.Interpreter.Base
4import TutorialD.Interpreter.Base
5−import qualified ProjectM36.Base as Base
6import ProjectM36.DateExamples
5import ProjectM36.DateExamples
6+import ProjectM36.DatabaseContext
7import Test.HUnit
7import Test.HUnit
8−import qualified Data.Map as M
9import Data.Text
8import Data.Text
10
9
11dateExamplesConnection :: NotificationCallback -> IO (SessionId, Connection)
10dateExamplesConnection :: NotificationCallback -> IO (SessionId, Connection)
12dateExamplesConnection callback = do
11dateExamplesConnection callback = do
13 dbconn <- connectProjectM36 (InProcessConnectionInfo NoPersistence callback [])
12 dbconn <- connectProjectM36 (InProcessConnectionInfo NoPersistence callback [])
14− let incDeps = Base.inclusionDependencies dateExamples
15 case dbconn of
13 case dbconn of
16 Left err -> error (show err)
14 Left err -> error (show err)
17 Right conn -> do
15 Right conn -> do
@@ -19,8 +17,7 @@ dateExamplesConnection callback = do
19 case eSessionId of
17 case eSessionId of
20 Left err -> error (show err)
18 Left err -> error (show err)
21 Right sessionId -> do
19 Right sessionId -> do
22− mapM_ (\(rvName,rvRel) -> executeDatabaseContextExpr sessionId conn (Assign rvName (Base.ExistingRelation rvRel))) (M.toList (Base.relationVariables dateExamples))
20+ executeDatabaseContextExpr sessionId conn (databaseContextAsDatabaseContextExpr dateExamples) >>= eitherFail
23− mapM_ (\(idName,incDep) -> executeDatabaseContextExpr sessionId conn (AddInclusionDependency idName incDep)) (M.toList incDeps)
24 --skipping atom functions for now- there are no atom function manipulation operators yet
21 --skipping atom functions for now- there are no atom function manipulation operators yet
25 commit sessionId conn >>= eitherFail
22 commit sessionId conn >>= eitherFail
26 pure (sessionId, conn)
23 pure (sessionId, conn)
@@ -35,8 +32,9 @@ executeTutorialD sessionId conn tutd = case parseTutorialD tutd of
35 DisplayResult _ -> assertFailure "display?"
32 DisplayResult _ -> assertFailure "display?"
36 DisplayIOResult _ -> assertFailure "displayIO?"
33 DisplayIOResult _ -> assertFailure "displayIO?"
37 DisplayRelationResult _ -> assertFailure "displayrelation?"
34 DisplayRelationResult _ -> assertFailure "displayrelation?"
35+ DisplayDataFrameResult _ -> assertFailure "displaydataframe?"
38 DisplayParseErrorResult _ _ -> assertFailure "displayparseerrorresult?"
36 DisplayParseErrorResult _ _ -> assertFailure "displayparseerrorresult?"
39− DisplayErrorResult err -> assertFailure (show err)
37+ DisplayErrorResult err -> assertFailure (show tutd ++ ": " ++ show err)
40 QuietSuccessResult -> pure ()
38 QuietSuccessResult -> pure ()
41
39
42expectTutorialDErr :: SessionId -> Connection -> (Text -> Bool) -> Text -> IO ()
40expectTutorialDErr :: SessionId -> Connection -> (Text -> Bool) -> Text -> IO ()
@@ -49,10 +47,11 @@ expectTutorialDErr sessionId conn matchFunc tutd = case parseTutorialD tutd of
49 DisplayResult _ -> assertFailure "display?"
47 DisplayResult _ -> assertFailure "display?"
50 DisplayIOResult _ -> assertFailure "displayIO?"
48 DisplayIOResult _ -> assertFailure "displayIO?"
51 DisplayRelationResult _ -> assertFailure "displayrelation?"
49 DisplayRelationResult _ -> assertFailure "displayrelation?"
50+ DisplayDataFrameResult _ -> assertFailure "displaydataframe?"
52 DisplayParseErrorResult _ _ -> assertFailure "displayparseerrorresult?"
51 DisplayParseErrorResult _ _ -> assertFailure "displayparseerrorresult?"
53− DisplayErrorResult err -> assertBool ("match error on: " ++ unpack err) (matchFunc err)
52+ DisplayErrorResult err -> assertBool (unpack tutd ++ " match error on: " ++ unpack err) (matchFunc err)
54 QuietSuccessResult -> pure ()
53 QuietSuccessResult -> pure ()
55
54
56eitherFail :: Either RelationalError a -> IO ()
55eitherFail :: Either RelationalError a -> IO ()
57eitherFail (Left err) = assertFailure (show err)
56eitherFail (Left err) = assertFailure (show err)
58−eitherFail (Right _) = pure ()
57+eitherFail (Right _) = pure ()
test/TutorialD/Interpreter.hs → test/TutorialD/InterpreterTest.hsrenamed+232−39
@@ -3,13 +3,17 @@ import TutorialD.Interpreter.TestBase
3import TutorialD.Interpreter
3import TutorialD.Interpreter
4import TutorialD.Interpreter.Base
4import TutorialD.Interpreter.Base
5import Test.HUnit
5import Test.HUnit
6−import ProjectM36.Relation
6+import ProjectM36.Relation as R
7import ProjectM36.Tuple
7import ProjectM36.Tuple
8import ProjectM36.TupleSet
8import ProjectM36.TupleSet
9import ProjectM36.Error
9import ProjectM36.Error
10import ProjectM36.DatabaseContext
10import ProjectM36.DatabaseContext
11import ProjectM36.AtomFunctions.Primitive
11import ProjectM36.AtomFunctions.Primitive
12+import ProjectM36.RelationalExpression
12import ProjectM36.DataTypes.Either
13import ProjectM36.DataTypes.Either
14+import ProjectM36.DataTypes.Interval
15+import ProjectM36.DataTypes.NonEmptyList
16+import ProjectM36.DataTypes.List
13import ProjectM36.DateExamples
17import ProjectM36.DateExamples
14import ProjectM36.Base hiding (Finite)
18import ProjectM36.Base hiding (Finite)
15import ProjectM36.TransactionGraph
19import ProjectM36.TransactionGraph
@@ -29,20 +33,23 @@ import Data.Text hiding (map)
29import qualified Data.Text as T
33import qualified Data.Text as T
30import Data.Time.Clock.POSIX hiding (getCurrentTime)
34import Data.Time.Clock.POSIX hiding (getCurrentTime)
31import Data.Time.Clock (getCurrentTime)
35import Data.Time.Clock (getCurrentTime)
36+import Data.Time.Calendar (fromGregorian)
32
37
33main :: IO ()
38main :: IO ()
34main = do
39main = do
35 tcounts <- runTestTT (TestList tests)
40 tcounts <- runTestTT (TestList tests)
36 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
41 if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
37 where
42 where
38− tests = map (\(tutd, expected) -> TestCase $ assertTutdEqual basicDatabaseContext expected tutd) simpleRelTests ++ map (\(tutd, expected) -> TestCase $ assertTutdEqual dateExamples expected tutd) dateExampleRelTests ++ [
43+ tests = [
44+ simpleRelTests,
45+ dateExampleRelTests,
39 transactionGraphBasicTest,
46 transactionGraphBasicTest,
40 transactionGraphAddCommitTest,
47 transactionGraphAddCommitTest,
41 transactionRollbackTest,
48 transactionRollbackTest,
42 transactionJumpTest,
49 transactionJumpTest,
43 transactionBranchTest,
50 transactionBranchTest,
44 simpleJoinTest,
51 simpleJoinTest,
45− testNotification,
52+ testNotification,
46 testTypeConstructors,
53 testTypeConstructors,
47 testMergeTransactions,
54 testMergeTransactions,
48 testComments,
55 testComments,
@@ -59,9 +66,31 @@ main = do
59 testRestrictionPredicateExprs,
66 testRestrictionPredicateExprs,
60 testRelationalAttributeNames,
67 testRelationalAttributeNames,
61 testSemijoin,
68 testSemijoin,
62− testAntijoin
69+ testAntijoin,
70+ testRelationAttributeDefinition,
71+ testAssignWithTypeVar,
72+ testDefineWithTypeVar,
73+ testIntervalType,
74+ testArbitraryRelation,
75+ testNonEmptyListType,
76+ testUnresolvedAtomTypes,
77+ testWithClause,
78+ testAtomFunctionArgumentMismatch,
79+ testInvalidDataConstructor,
80+ testBasicList,
81+ testRelationDeclarationMismatch,
82+ testInvalidTuples,
83+ testSelfReferencingUncommittedContext,
84+ testUnionAndIntersectionAttributeExprs
63 ]
85 ]
86+
87+simpleRelTests :: Test
88+simpleRelTests = TestCase $ do
89+ (graph, transId) <- freshTransactionGraph dateExamples
90+ mapM_ (\(tutd, expected) ->
91+ assertTutdEqual basicDatabaseContext transId graph expected tutd) testTups
92+ where
64− simpleRelTests = [("x:=true", Right relationTrue),
93+ testTups = [("x:=true", Right relationTrue),
65 ("x:=false", Right relationFalse),
94 ("x:=false", Right relationFalse),
66 ("x:=true union false", Right relationTrue),
95 ("x:=true union false", Right relationTrue),
67 ("x:=true minus false", Right relationTrue),
96 ("x:=true minus false", Right relationTrue),
@@ -86,7 +115,7 @@ main = do
86 ("x:=true=true", Right relationTrue),
115 ("x:=true=true", Right relationTrue),
87 ("x:=true=false", Right relationFalse),
116 ("x:=true=false", Right relationFalse),
88 ("x:=true; undefine x", Left (RelVarNotDefinedError "x")),
117 ("x:=true; undefine x", Left (RelVarNotDefinedError "x")),
89− ("x:=relation {b Integer, a Text}{}; insert x relation{tuple{b 5, a \"spam\"}}", mkRelationFromTuples simpleCAttributes [RelationTuple simpleCAttributes $ V.fromList [TextAtom "spam", IntegerAtom 5]]),
118+ ("x:=relation {b Integer, a Text}{}; insert x relation{tuple{b -5, a \"spam\"}}", mkRelationFromTuples simpleCAttributes [RelationTuple simpleCAttributes $ V.fromList [TextAtom "spam", IntegerAtom (-5)]]),
90 -- test nested relation constructor
119 -- test nested relation constructor
91 ("x:=relation{tuple{a 5, b relation{tuple{a 6}}}}", mkRelation nestedRelationAttributes $ RelationTupleSet [RelationTuple nestedRelationAttributes (V.fromList [IntegerAtom 5, RelationAtom (Relation simpleAAttributes $ RelationTupleSet [RelationTuple simpleAAttributes $ V.fromList [IntegerAtom 6]])])]),
120 ("x:=relation{tuple{a 5, b relation{tuple{a 6}}}}", mkRelation nestedRelationAttributes $ RelationTupleSet [RelationTuple nestedRelationAttributes (V.fromList [IntegerAtom 5, RelationAtom (Relation simpleAAttributes $ RelationTupleSet [RelationTuple simpleAAttributes $ V.fromList [IntegerAtom 6]])])]),
92 ("x:=relation{tuple{b 5,a \"spam\"},tuple{b 6,a \"sam\"}}; delete x where b=6", mkRelation simpleCAttributes $ RelationTupleSet [RelationTuple simpleCAttributes (V.fromList [TextAtom "spam", IntegerAtom 5])]),
121 ("x:=relation{tuple{b 5,a \"spam\"},tuple{b 6,a \"sam\"}}; delete x where b=6", mkRelation simpleCAttributes $ RelationTupleSet [RelationTuple simpleCAttributes (V.fromList [TextAtom "spam", IntegerAtom 5])]),
@@ -94,39 +123,47 @@ main = do
94 ("x:=relation{tuple{a 5}} : {b:=6}", mkRelationFromTuples simpleDAttributes [RelationTuple simpleDAttributes (V.fromList [IntegerAtom 5, IntegerAtom 6])]),
123 ("x:=relation{tuple{a 5}} : {b:=6}", mkRelationFromTuples simpleDAttributes [RelationTuple simpleDAttributes (V.fromList [IntegerAtom 5, IntegerAtom 6])]),
95 ("x:=relation{tuple{a 5}} : {b:=add(@a,5)}", mkRelationFromTuples simpleDAttributes [RelationTuple simpleDAttributes (V.fromList [IntegerAtom 5, IntegerAtom 10])]),
124 ("x:=relation{tuple{a 5}} : {b:=add(@a,5)}", mkRelationFromTuples simpleDAttributes [RelationTuple simpleDAttributes (V.fromList [IntegerAtom 5, IntegerAtom 10])]),
96 ("x:=relation{tuple{a 5}} : {b:=add(@a,\"spam\")}", Left (AtomFunctionTypeError "add" 2 IntegerAtomType TextAtomType)),
125 ("x:=relation{tuple{a 5}} : {b:=add(@a,\"spam\")}", Left (AtomFunctionTypeError "add" 2 IntegerAtomType TextAtomType)),
97− ("x:=relation{tuple{a 5}} : {b:=add(add(@a,2),5)}", mkRelationFromTuples simpleDAttributes [RelationTuple simpleDAttributes (V.fromList [IntegerAtom 5, IntegerAtom 12])])
126+ ("x:=relation{tuple{a 5}} : {b:=add(add(@a,2),5)}", mkRelationFromTuples simpleDAttributes [RelationTuple simpleDAttributes (V.fromList [IntegerAtom 5, IntegerAtom 12])]),
127+ ("x:=false:{a:=1,b:=2}", mkRelationFromTuples simpleDAttributes [])
98 ]
128 ]
99 simpleAAttributes = A.attributesFromList [Attribute "a" IntegerAtomType]
129 simpleAAttributes = A.attributesFromList [Attribute "a" IntegerAtomType]
100 simpleBAttributes = A.attributesFromList [Attribute "d" IntegerAtomType]
130 simpleBAttributes = A.attributesFromList [Attribute "d" IntegerAtomType]
101 simpleCAttributes = A.attributesFromList [Attribute "a" TextAtomType, Attribute "b" IntegerAtomType]
131 simpleCAttributes = A.attributesFromList [Attribute "a" TextAtomType, Attribute "b" IntegerAtomType]
102 simpleDAttributes = A.attributesFromList [Attribute "a" IntegerAtomType, Attribute "b" IntegerAtomType]
132 simpleDAttributes = A.attributesFromList [Attribute "a" IntegerAtomType, Attribute "b" IntegerAtomType]
103− maybeTextAtomType = ConstructedAtomType "Maybe" (M.singleton "a" TextAtomType)
133+ simpleProjectionAttributes = A.attributesFromList [Attribute "c" IntegerAtomType]
134+ nestedRelationAttributes = A.attributesFromList [Attribute "a" IntegerAtomType, Attribute "b" (RelationAtomType $ A.attributesFromList [Attribute "a" IntegerAtomType])]
135+
136+dateExampleRelTests :: Test
137+dateExampleRelTests = TestCase $ do
138+ (graph, transId) <- freshTransactionGraph dateExamples
139+ mapM_ (\(tutd, expected) ->
140+ assertTutdEqual dateExamples transId graph expected tutd) testTups
141+ where
142+ simpleEitherIntTextAttributes = A.attributesFromList [Attribute "a" (eitherAtomType IntegerAtomType TextAtomType)]
104 maybeIntegerAtomType = ConstructedAtomType "Maybe" (M.singleton "a" IntegerAtomType)
143 maybeIntegerAtomType = ConstructedAtomType "Maybe" (M.singleton "a" IntegerAtomType)
144+ maybeTextAtomType = ConstructedAtomType "Maybe" (M.singleton "a" TextAtomType)
105 simpleMaybeTextAttributes = A.attributesFromList [Attribute "a" maybeTextAtomType]
145 simpleMaybeTextAttributes = A.attributesFromList [Attribute "a" maybeTextAtomType]
106 simpleMaybeIntAttributes = A.attributesFromList [Attribute "a" maybeIntegerAtomType]
146 simpleMaybeIntAttributes = A.attributesFromList [Attribute "a" maybeIntegerAtomType]
107− simpleEitherIntTextAttributes = A.attributesFromList [Attribute "a" (eitherAtomType IntegerAtomType TextAtomType)]
108− simpleProjectionAttributes = A.attributesFromList [Attribute "c" IntegerAtomType]
109− nestedRelationAttributes = A.attributesFromList [Attribute "a" IntegerAtomType, Attribute "b" (RelationAtomType $ A.attributesFromList [Attribute "a" IntegerAtomType])]
110− extendTestAttributes = A.attributesFromList [Attribute "a" IntegerAtomType, Attribute "b" $ RelationAtomType (attributes suppliersRel)]
111 byteStringAttributes = A.attributesFromList [Attribute "y" ByteStringAtomType]
147 byteStringAttributes = A.attributesFromList [Attribute "y" ByteStringAtomType]
112− groupCountAttrs = A.attributesFromList [Attribute "z" IntegerAtomType]
113 minMaxAttrs = A.attributesFromList [Attribute "s#" TextAtomType, Attribute "z" IntegerAtomType]
148 minMaxAttrs = A.attributesFromList [Attribute "s#" TextAtomType, Attribute "z" IntegerAtomType]
149+ groupCountAttrs = A.attributesFromList [Attribute "z" IntegerAtomType]
114 updateParisPlus10 = relMap (\tuple -> do
150 updateParisPlus10 = relMap (\tuple -> do
115 statusAtom <- atomForAttributeName "status" tuple
151 statusAtom <- atomForAttributeName "status" tuple
116 cityAtom <- atomForAttributeName "city" tuple
152 cityAtom <- atomForAttributeName "city" tuple
117 if cityAtom == TextAtom "Paris" then
153 if cityAtom == TextAtom "Paris" then
118 Right $ updateTupleWithAtoms (M.singleton "status" (IntegerAtom (castInteger statusAtom + 10))) tuple
154 Right $ updateTupleWithAtoms (M.singleton "status" (IntegerAtom (castInteger statusAtom + 10))) tuple
119 else Right tuple) suppliersRel
155 else Right tuple) suppliersRel
156+ extendTestAttributes = A.attributesFromList [Attribute "a" IntegerAtomType, Attribute "b" $ RelationAtomType (R.attributes suppliersRel)]
120− dateExampleRelTests = [("x:=s where true", Right suppliersRel),
157+ testTups = [("x:=s where true", Right suppliersRel),
121− ("x:=s where city = \"London\"", restrict (\tuple -> pure $ atomForAttributeName "city" tuple == (Right $ TextAtom "London")) suppliersRel),
158+ ("x:=s where city = \"London\"", restrict (\tuple -> pure $ atomForAttributeName "city" tuple == Right (TextAtom "London")) suppliersRel),
122− ("x:=s where false", Right $ Relation (attributes suppliersRel) emptyTupleSet),
159+ ("x:=s where false", Right $ Relation (R.attributes suppliersRel) emptyTupleSet),
123− ("x:=p where color=\"Blue\" and city=\"Paris\"", mkRelationFromList (attributes productsRel) [[TextAtom "P5", TextAtom "Cam", TextAtom "Blue", IntegerAtom 12, TextAtom "Paris"]]),
160+ ("x:=p where color=\"Blue\" and city=\"Paris\"", mkRelationFromList (R.attributes productsRel) [[TextAtom "P5", TextAtom "Cam", TextAtom "Blue", IntegerAtom 12, TextAtom "Paris"]]),
124 ("a:=s; update a (status:=50); x:=a{status}", mkRelation (A.attributesFromList [Attribute "status" IntegerAtomType]) (RelationTupleSet [mkRelationTuple (A.attributesFromList [Attribute "status" IntegerAtomType]) (V.fromList [IntegerAtom 50])])),
161 ("a:=s; update a (status:=50); x:=a{status}", mkRelation (A.attributesFromList [Attribute "status" IntegerAtomType]) (RelationTupleSet [mkRelationTuple (A.attributesFromList [Attribute "status" IntegerAtomType]) (V.fromList [IntegerAtom 50])])),
125− ("x:=s minus (s where status=20)", mkRelationFromList (attributes suppliersRel) [[TextAtom "S2", TextAtom "Jones", IntegerAtom 10, TextAtom "Paris"], [TextAtom "S3", TextAtom "Blake", IntegerAtom 30, TextAtom "Paris"], [TextAtom "S5", TextAtom "Adams", IntegerAtom 30, TextAtom "Athens"]]),
162+ ("x:=s minus (s where status=20)", mkRelationFromList (R.attributes suppliersRel) [[TextAtom "S2", TextAtom "Jones", IntegerAtom 10, TextAtom "Paris"], [TextAtom "S3", TextAtom "Blake", IntegerAtom 30, TextAtom "Paris"], [TextAtom "S5", TextAtom "Adams", IntegerAtom 30, TextAtom "Athens"]]),
126 --atom function tests
163 --atom function tests
127 ("x:=((s : {status2 := add(10,@status)}) where status2=add(10,@status)){city,s#,sname,status}", Right suppliersRel),
164 ("x:=((s : {status2 := add(10,@status)}) where status2=add(10,@status)){city,s#,sname,status}", Right suppliersRel),
128 ("x:=relation{tuple{a 5}} : {b:=s}", mkRelation extendTestAttributes (RelationTupleSet [mkRelationTuple extendTestAttributes (V.fromList [IntegerAtom 5, RelationAtom suppliersRel])])),
165 ("x:=relation{tuple{a 5}} : {b:=s}", mkRelation extendTestAttributes (RelationTupleSet [mkRelationTuple extendTestAttributes (V.fromList [IntegerAtom 5, RelationAtom suppliersRel])])),
129− ("x:=s; update x where sname=\"Blake\" (city:=\"Boston\")", relMap (\tuple -> if atomForAttributeName "sname" tuple == (Right $ TextAtom "Blake") then Right $ updateTupleWithAtoms (M.singleton "city" (TextAtom "Boston")) tuple else Right tuple) suppliersRel),
166+ ("x:=s; update x where sname=\"Blake\" (city:=\"Boston\")", relMap (\tuple -> if atomForAttributeName "sname" tuple == Right (TextAtom "Blake") then Right $ updateTupleWithAtoms (M.singleton "city" (TextAtom "Boston")) tuple else Right tuple) suppliersRel),
130 ("x:=s; update x where city=\"Paris\" (status:=add(@status,10))", updateParisPlus10),
167 ("x:=s; update x where city=\"Paris\" (status:=add(@status,10))", updateParisPlus10),
131 --relatom function tests
168 --relatom function tests
132 ("x:=((s group ({city} as y)):{z:=count(@y)}){z}", mkRelation groupCountAttrs (RelationTupleSet [mkRelationTuple groupCountAttrs (V.singleton $ IntegerAtom 1)])),
169 ("x:=((s group ({city} as y)):{z:=count(@y)}){z}", mkRelation groupCountAttrs (RelationTupleSet [mkRelationTuple groupCountAttrs (V.singleton $ IntegerAtom 1)])),
@@ -135,11 +172,11 @@ main = do
135 ("x:=((sp{s#,qty}) group ({qty} as x):{z:=min(@x)}){s#,z}", mkRelationFromList minMaxAttrs (map (\(s,i) -> [TextAtom s,IntegerAtom i]) [("S1", 100), ("S2", 300), ("S3", 200), ("S4", 200)])),
172 ("x:=((sp{s#,qty}) group ({qty} as x):{z:=min(@x)}){s#,z}", mkRelationFromList minMaxAttrs (map (\(s,i) -> [TextAtom s,IntegerAtom i]) [("S1", 100), ("S2", 300), ("S3", 200), ("S4", 200)])),
136 ("x:=((sp{s#,qty}) group ({qty} as x):{z:=sum(@x)}){s#,z}", mkRelationFromList minMaxAttrs (map (\(s,i) -> [TextAtom s,IntegerAtom i]) [("S1", 1000), ("S2", 700), ("S3", 200), ("S4", 900)])),
173 ("x:=((sp{s#,qty}) group ({qty} as x):{z:=sum(@x)}){s#,z}", mkRelationFromList minMaxAttrs (map (\(s,i) -> [TextAtom s,IntegerAtom i]) [("S1", 1000), ("S2", 700), ("S3", 200), ("S4", 900)])),
137 --boolean function restriction
174 --boolean function restriction
138− ("x:=s where ^lt(@status,20)", mkRelationFromList (attributes suppliersRel) [[TextAtom "S2", TextAtom "Jones", IntegerAtom 10, TextAtom "Paris"]]),
175+ ("x:=s where ^lt(@status,20)", mkRelationFromList (R.attributes suppliersRel) [[TextAtom "S2", TextAtom "Jones", IntegerAtom 10, TextAtom "Paris"]]),
139− ("x:=s where ^gt(@status,20)", mkRelationFromList (attributes suppliersRel) [[TextAtom "S3", TextAtom "Blake", IntegerAtom 30, TextAtom "Paris"],
176+ ("x:=s where ^gt(@status,20)", mkRelationFromList (R.attributes suppliersRel) [[TextAtom "S3", TextAtom "Blake", IntegerAtom 30, TextAtom "Paris"],
140 [TextAtom "S5", TextAtom "Adams", IntegerAtom 30, TextAtom "Athens"]]),
177 [TextAtom "S5", TextAtom "Adams", IntegerAtom 30, TextAtom "Athens"]]),
141 ("x:=s where ^sum(@status)", Left $ AtomTypeMismatchError IntegerAtomType BoolAtomType),
178 ("x:=s where ^sum(@status)", Left $ AtomTypeMismatchError IntegerAtomType BoolAtomType),
142− ("x:=s where ^not(gte(@status,20))", mkRelationFromList (attributes suppliersRel) [[TextAtom "S2", TextAtom "Jones", IntegerAtom 10, TextAtom "Paris"]]),
179+ ("x:=s where ^not(gte(@status,20))", mkRelationFromList (R.attributes suppliersRel) [[TextAtom "S2", TextAtom "Jones", IntegerAtom 10, TextAtom "Paris"]]),
143 --test "all but" attribute inversion syntax
180 --test "all but" attribute inversion syntax
144 ("x:=s{all but s#} = s{city,sname,status}", Right relationTrue),
181 ("x:=s{all but s#} = s{city,sname,status}", Right relationTrue),
145 --test key syntax
182 --test key syntax
@@ -152,20 +189,25 @@ main = do
152 --test Maybe Integer
189 --test Maybe Integer
153 ("x:=relation{tuple{a Just 3}}", mkRelationFromList simpleMaybeIntAttributes [[ConstructedAtom "Just" maybeIntegerAtomType [IntegerAtom 3]]]),
190 ("x:=relation{tuple{a Just 3}}", mkRelationFromList simpleMaybeIntAttributes [[ConstructedAtom "Just" maybeIntegerAtomType [IntegerAtom 3]]]),
154 --test Either Integer Text
191 --test Either Integer Text
155− ("x:=relation{tuple{a Left 3}}", Left (TypeConstructorTypeVarsMismatch (S.fromList ["a","b"]) (S.fromList ["a"]))), -- Left 3, alone is not enough information to imply the type
192+ ("x:=relation{tuple{a Left 3}}", Left (TypeConstructorTypeVarMissing "b")), -- Left 3, alone is not enough information to imply the type
156 ("x:=relation{a Either Integer Text}{tuple{a Left 3}}", mkRelationFromList simpleEitherIntTextAttributes [[ConstructedAtom "Left" (eitherAtomType IntegerAtomType TextAtomType) [IntegerAtom 3]]]),
193 ("x:=relation{a Either Integer Text}{tuple{a Left 3}}", mkRelationFromList simpleEitherIntTextAttributes [[ConstructedAtom "Left" (eitherAtomType IntegerAtomType TextAtomType) [IntegerAtom 3]]]),
157 --test datetime constructor
194 --test datetime constructor
158− ("x:=relation{tuple{a dateTimeFromEpochSeconds(1495199790)}}", mkRelationFromList (A.attributesFromList [Attribute "a" DateTimeAtomType]) [[DateTimeAtom (posixSecondsToUTCTime(realToFrac (1495199790 :: Int)))]])
195+ ("x:=relation{tuple{a dateTimeFromEpochSeconds(1495199790)}}", mkRelationFromList (A.attributesFromList [Attribute "a" DateTimeAtomType]) [[DateTimeAtom (posixSecondsToUTCTime(realToFrac (1495199790 :: Int)))]]),
196+ --test Day constructor
197+ ("x:=relation{tuple{a fromGregorian(2017,05,30)}}", mkRelationFromList (A.attributesFromList [Attribute "a" DayAtomType]) [[DayAtom (fromGregorian 2017 05 30)]])
159 ]
198 ]
160
199
161−assertTutdEqual :: DatabaseContext -> Either RelationalError Relation -> Text -> Assertion
200+assertTutdEqual :: DatabaseContext -> TransactionId -> TransactionGraph -> Either RelationalError Relation -> Text -> Assertion
162−assertTutdEqual databaseContext expected tutd = assertEqual (unpack tutd) expected interpreted
201+assertTutdEqual databaseContext transId graph expected tutd = assertEqual (unpack tutd) expected interpreted
163 where
202 where
164− interpreted = case interpretDatabaseContextExpr databaseContext tutd of
203+ interpreted = case interpretDatabaseContextExpr databaseContext transId graph tutd of
165 Left err -> Left err
204 Left err -> Left err
166 Right context -> case M.lookup "x" (relationVariables context) of
205 Right context -> case M.lookup "x" (relationVariables context) of
167 Nothing -> Left $ RelVarNotDefinedError "x"
206 Nothing -> Left $ RelVarNotDefinedError "x"
168− Just rel -> Right rel
207+ Just relExpr -> do
208+ let env = freshGraphRefRelationalExprEnv (Just context) graph
209+ runGraphRefRelationalExprM env (evalGraphRefRelationalExpr relExpr)
210+
169
211
170transactionGraphBasicTest :: Test
212transactionGraphBasicTest :: Test
171transactionGraphBasicTest = TestCase $ do
213transactionGraphBasicTest = TestCase $ do
@@ -186,13 +228,14 @@ transactionGraphAddCommitTest = TestCase $ do
186 DisplayResult _ -> assertFailure "display?"
228 DisplayResult _ -> assertFailure "display?"
187 DisplayIOResult _ -> assertFailure "displayIO?"
229 DisplayIOResult _ -> assertFailure "displayIO?"
188 DisplayRelationResult _ -> assertFailure "displayrelation?"
230 DisplayRelationResult _ -> assertFailure "displayrelation?"
231+ DisplayDataFrameResult _ -> assertFailure "displaydataframe?"
189 DisplayParseErrorResult _ _ -> assertFailure "displayparseerror?"
232 DisplayParseErrorResult _ _ -> assertFailure "displayparseerror?"
190 DisplayErrorResult err -> assertFailure (show err)
233 DisplayErrorResult err -> assertFailure (show err)
191 QuietSuccessResult -> do
234 QuietSuccessResult -> do
192 commit sessionId dbconn >>= eitherFail
235 commit sessionId dbconn >>= eitherFail
193 discon <- disconnectedTransaction_ sessionId dbconn
236 discon <- disconnectedTransaction_ sessionId dbconn
194 let context = Discon.concreteDatabaseContext discon
237 let context = Discon.concreteDatabaseContext discon
195− assertEqual "ensure x was added" (M.lookup "x" (relationVariables context)) (Just suppliersRel)
238+ assertEqual "ensure x was added" (M.lookup "x" (relationVariables context)) (Just (ExistingRelation suppliersRel))
196
239
197transactionRollbackTest :: Test
240transactionRollbackTest :: Test
198transactionRollbackTest = TestCase $ do
241transactionRollbackTest = TestCase $ do
@@ -234,12 +277,16 @@ transactionBranchTest = TestCase $ do
234
277
235-- test that overlapping attribute names with different types fail with an error
278-- test that overlapping attribute names with different types fail with an error
236failJoinTest :: Test
279failJoinTest :: Test
280+failJoinTest = TestCase $ do
281+ (graph, transId) <- freshTransactionGraph dateExamples
237−failJoinTest = TestCase $ assertTutdEqual basicDatabaseContext err "x:=relation{tuple{test 4}} join relation{tuple{test \"test\"}}"
282+ assertTutdEqual basicDatabaseContext transId graph err "x:=relation{tuple{test 4}} join relation{tuple{test \"test\"}}"
238 where
283 where
239 err = Left (TupleAttributeTypeMismatchError (A.attributesFromList [Attribute "test" IntegerAtomType]))
284 err = Left (TupleAttributeTypeMismatchError (A.attributesFromList [Attribute "test" IntegerAtomType]))
240
285
241simpleJoinTest :: Test
286simpleJoinTest :: Test
287+simpleJoinTest = TestCase $ do
288+ (graph, transId) <- freshTransactionGraph dateExamples
242−simpleJoinTest = TestCase $ assertTutdEqual dateExamples joinedRel "x:=s join sp"
289+ assertTutdEqual dateExamples transId graph joinedRel "x:=s join sp"
243 where
290 where
244 attrs = A.attributesFromList [Attribute "city" TextAtomType,
291 attrs = A.attributesFromList [Attribute "city" TextAtomType,
245 Attribute "qty" IntegerAtomType,
292 Attribute "qty" IntegerAtomType,
@@ -315,7 +362,7 @@ testComments :: Test
315testComments = TestCase $ do
362testComments = TestCase $ do
316 (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
363 (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
317 mapM_ (executeTutorialD sessionId dbconn) [
364 mapM_ (executeTutorialD sessionId dbconn) [
318− ":branch testbranch --test comment\n",
365+ ":branch testbranch --test comment",
319 ":jumphead {- test comment -} master"]
366 ":jumphead {- test comment -} master"]
320
367
321-- create a graph and query from two disparate contexts
368-- create a graph and query from two disparate contexts
@@ -366,7 +413,9 @@ testTransGraphRelationalExpr = TestCase $ do
366 _ -> assertFailure "failed to delete branch"
413 _ -> assertFailure "failed to delete branch"
367
414
368testMultiAttributeRename :: Test
415testMultiAttributeRename :: Test
416+testMultiAttributeRename = TestCase $ do
417+ (graph, transId) <- freshTransactionGraph dateExamples
369−testMultiAttributeRename = TestCase $ assertTutdEqual dateExamples renamedRel "x:=s rename {city as town, status as price} where false"
418+ assertTutdEqual dateExamples transId graph renamedRel "x:=s rename {city as town, status as price} where false"
370 where
419 where
371 sattrs = attributesFromList [Attribute "town" TextAtomType,
420 sattrs = attributesFromList [Attribute "town" TextAtomType,
372 Attribute "sname" TextAtomType,
421 Attribute "sname" TextAtomType,
@@ -451,16 +500,22 @@ testEmptyCommits = TestCase $ do
451 assertEqual "empty insert empty commit" (Right False) dirty'
500 assertEqual "empty insert empty commit" (Right False) dirty'
452 Right () <- commit sessionId dbconn
501 Right () <- commit sessionId dbconn
453
502
454− --update no tuples
503+ --update no tuples- since we defer the restriction, we can only assume the context is dirty, perhaps the constraint checker could offer an optimization here
455 Right () <- executeDatabaseContextExpr sessionId dbconn (Update "s" (M.singleton "sname" (NakedAtomExpr (TextAtom "Bob"))) (AttributeEqualityPredicate "sname" (NakedAtomExpr (TextAtom "Mike"))))
504 Right () <- executeDatabaseContextExpr sessionId dbconn (Update "s" (M.singleton "sname" (NakedAtomExpr (TextAtom "Bob"))) (AttributeEqualityPredicate "sname" (NakedAtomExpr (TextAtom "Mike"))))
456 dirty'' <- disconnectedTransactionIsDirty sessionId dbconn
505 dirty'' <- disconnectedTransactionIsDirty sessionId dbconn
457− assertEqual "empty update empty commit" (Right False) dirty''
506+ assertEqual "empty update empty commit" (Right True) dirty''
507+ Right () <- commit sessionId dbconn
508+
509+ --assign the same rel expr
510+ Right () <- executeDatabaseContextExpr sessionId dbconn (Assign "true" (ExistingRelation relationTrue))
511+ sameREdirty <- disconnectedTransactionIsDirty sessionId dbconn
512+ assertEqual "same relexpr assigned" (Right False) sameREdirty
458 Right () <- commit sessionId dbconn
513 Right () <- commit sessionId dbconn
459
514
460 --delete no tuples
515 --delete no tuples
461 Right () <- executeDatabaseContextExpr sessionId dbconn (Delete "s" (AttributeEqualityPredicate "sname" (NakedAtomExpr (TextAtom "Mike"))))
516 Right () <- executeDatabaseContextExpr sessionId dbconn (Delete "s" (AttributeEqualityPredicate "sname" (NakedAtomExpr (TextAtom "Mike"))))
462 dirty''' <- disconnectedTransactionIsDirty sessionId dbconn
517 dirty''' <- disconnectedTransactionIsDirty sessionId dbconn
463− assertEqual "empty delete empty commit" (Right False) dirty'''
518+ assertEqual "empty delete empty commit" (Right True) dirty'''
464
519
465testIntervalAtom :: Test
520testIntervalAtom :: Test
466testIntervalAtom = TestCase $ do
521testIntervalAtom = TestCase $ do
@@ -490,7 +545,7 @@ testListConstructedAtom = TestCase $ do
490testTypeChecker :: Test
545testTypeChecker :: Test
491testTypeChecker = TestCase $ do
546testTypeChecker = TestCase $ do
492 (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
547 (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
493− let err1 = "AtomFunctionTypeError \"max\" 1 (RelationAtomType [Attribute \"_\" IntegerAtomType]) IntegerAtomType"
548+ let err1 = "AtomFunctionTypeError \"max\" 1"
494 expectTutorialDErr sessionId dbconn (T.isPrefixOf err1) "x:=relation{tuple{a 0}}:{b:=max(@a)}"
549 expectTutorialDErr sessionId dbconn (T.isPrefixOf err1) "x:=relation{tuple{a 0}}:{b:=max(@a)}"
495
550
496--exercise expression parser
551--exercise expression parser
@@ -506,7 +561,7 @@ testRestrictionPredicateExprs = TestCase $ do
506 -- and
561 -- and
507 executeTutorialD sessionId dbconn "x:=s where status=20 and status=10"
562 executeTutorialD sessionId dbconn "x:=s where status=20 and status=10"
508 eRvAnd <- executeRelationalExpr sessionId dbconn (RelationVariable "x" ())
563 eRvAnd <- executeRelationalExpr sessionId dbconn (RelationVariable "x" ())
509− let expectedRelAnd = Right (emptyRelationWithAttrs (attributes suppliersRel))
564+ let expectedRelAnd = Right (emptyRelationWithAttrs (R.attributes suppliersRel))
510 assertEqual "status 20 and 10" expectedRelAnd eRvAnd
565 assertEqual "status 20 and 10" expectedRelAnd eRvAnd
511
566
512testRelationalAttributeNames :: Test
567testRelationalAttributeNames :: Test
@@ -517,7 +572,7 @@ testRelationalAttributeNames = TestCase $ do
517 case eRv of
572 case eRv of
518 Left err -> assertFailure (show err)
573 Left err -> assertFailure (show err)
519 Right rel ->
574 Right rel ->
520− assertEqual "attributes from sp" (attributes supplierProductsRel) (attributes rel)
575+ assertEqual "attributes from sp" (R.attributes supplierProductsRel) (R.attributes rel)
521
576
522testSemijoin :: Test
577testSemijoin :: Test
523testSemijoin = TestCase $ do
578testSemijoin = TestCase $ do
@@ -537,3 +592,141 @@ testAntijoin = TestCase $ do
537 eY <- executeRelationalExpr sessionId dbconn (RelationVariable "y" ())
592 eY <- executeRelationalExpr sessionId dbconn (RelationVariable "y" ())
538 assertEqual "antijoin only Adams" eX eY
593 assertEqual "antijoin only Adams" eX eY
539
594
595+testRelationAttributeDefinition :: Test
596+testRelationAttributeDefinition = TestCase $ do
597+ -- test normal subrelation construction
598+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
599+ executeTutorialD sessionId dbconn "x:=relation{a relation{b Integer}}{tuple{a relation{tuple{b 4}}}}"
600+ eX <- executeRelationalExpr sessionId dbconn (RelationVariable "x" ())
601+ let expected = mkRelationFromList attrs [[RelationAtom subRel]]
602+ attrs = attributesFromList [Attribute "a" (RelationAtomType subRelAttrs)]
603+ subRelAttrs = attributesFromList [Attribute "b" IntegerAtomType]
604+ Right subRel = mkRelationFromList subRelAttrs [[IntegerAtom 4]]
605+ assertEqual "relation attribute construction" expected eX
606+ -- test rejected subrelation construction due to floating type variables
607+ expectTutorialDErr sessionId dbconn (T.isPrefixOf "TypeConstructorTypeVarMissing") "y:=relation{a relation{b x}}"
608+
609+testAssignWithTypeVar :: Test
610+testAssignWithTypeVar = TestCase $ do
611+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
612+ let err1 = "TypeConstructorTypeVarMissing"
613+ expectTutorialDErr sessionId dbconn (T.isPrefixOf err1) "y:=relation{a int, b invalidtype}"
614+
615+testDefineWithTypeVar :: Test
616+testDefineWithTypeVar = TestCase $ do
617+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
618+ let err1 = "TypeConstructorTypeVarMissing"
619+ expectTutorialDErr sessionId dbconn (T.isInfixOf err1) "y::{a int, b invalidtype}"
620+
621+testIntervalType :: Test
622+testIntervalType = TestCase $ do
623+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
624+ executeTutorialD sessionId dbconn "x:=relation{a Interval Integer}"
625+ eX <- executeRelationalExpr sessionId dbconn (RelationVariable "x" ())
626+ let expectedIntervalInt = mkRelationFromList expectedAttrs []
627+ expectedAttrs = A.attributesFromList [Attribute "a" (intervalAtomType IntegerAtomType)]
628+ assertEqual "Interval Int attribute" expectedIntervalInt eX
629+
630+testArbitraryRelation :: Test
631+testArbitraryRelation = TestCase $ do
632+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
633+ executeTutorialD sessionId dbconn "createarbitraryrelation rv1 {a Integer} 5-10"
634+ executeTutorialD sessionId dbconn "createarbitraryrelation rv2 {a Integer, b relation{c Integer}} 10-100"
635+ executeTutorialD sessionId dbconn "createarbitraryrelation rv3 {a Int, b relation{c Interval Int}} 3-100"
636+
637+testNonEmptyListType :: Test
638+testNonEmptyListType = TestCase $ do
639+ --create a NonEmptyList
640+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
641+ executeTutorialD sessionId dbconn "x:=relation{tuple{a NECons 3 (Cons 4 Empty)}} : {x:=nonEmptyListHead(@a)}"
642+ eX <- executeRelationalExpr sessionId dbconn (RelationVariable "x" ())
643+ let expected = mkRelationFromList attrs [[nelist, nehead]]
644+ attrs = attributesFromList [Attribute "a" neListType,
645+ Attribute "x" IntegerAtomType]
646+ neListType = nonEmptyListAtomType IntegerAtomType
647+ listType = listAtomType IntegerAtomType
648+ nelist = ConstructedAtom "NECons" (nonEmptyListAtomType IntegerAtomType) [
649+ IntegerAtom 3,
650+ ConstructedAtom "Cons" listType [IntegerAtom 4, ConstructedAtom "Empty" listType []]]
651+ nehead = IntegerAtom 3
652+ assertEqual "non-empty list type construction" expected eX
653+
654+testUnresolvedAtomTypes :: Test
655+testUnresolvedAtomTypes = TestCase $ do
656+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
657+ let err1 = "TypeConstructorTypeVarMissing"
658+ expectTutorialDErr sessionId dbconn (T.isPrefixOf err1) "x:=relation{tuple{a Empty}}"
659+ executeTutorialD sessionId dbconn "x:=relation{a List Int}{tuple{a Empty}}"
660+
661+-- with (x as s) s
662+testWithClause :: Test
663+testWithClause = TestCase $ do
664+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
665+ executeTutorialD sessionId dbconn "x:=with (x as s) x"
666+ eX <- executeRelationalExpr sessionId dbconn (RelationVariable "x" ())
667+ assertEqual "with x as s" (Right suppliersRel) eX
668+
669+ executeTutorialD sessionId dbconn "y:=with(a as true) (with (b as a) b)"
670+ eY <- executeRelationalExpr sessionId dbconn (RelationVariable "y" ())
671+ assertEqual "nested with" (Right relationTrue) eY
672+
673+ let err1 = "RelVarAlreadyDefinedError"
674+ expectTutorialDErr sessionId dbconn (T.isPrefixOf err1) "x:=with (s as s) s"
675+
676+ expectTutorialDErr sessionId dbconn (T.isPrefixOf err1) "x:=with (s as sp) s"
677+
678+testAtomFunctionArgumentMismatch :: Test
679+testAtomFunctionArgumentMismatch = TestCase $ do
680+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
681+ let err1 = "AtomTypeMismatchError"
682+ --atom function type mismatch
683+ expectTutorialDErr sessionId dbconn (T.isPrefixOf err1) "x:=relation{tuple{a 5}} where ^gt(@a,1.5)"
684+ --wrong argument count
685+ let err2 = "FunctionArgumentCountMismatchError"
686+ expectTutorialDErr sessionId dbconn (T.isPrefixOf err2) "x:=relation{tuple{a 5}} where ^gt(@a,1,3)"
687+
688+testInvalidDataConstructor :: Test
689+testInvalidDataConstructor = TestCase $ do
690+ --test that a referenced TypeConstructor in a DataConstructor definition matches the expected count of arguments
691+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
692+ let err1 = "ConstructedAtomArgumentCountMismatchError"
693+ expectTutorialDErr sessionId dbconn (T.isPrefixOf err1) "data TestT = TestT Maybe Int"
694+
695+testBasicList :: Test
696+testBasicList = TestCase $ do
697+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
698+ executeTutorialD sessionId dbconn "x := relation{tuple{ a (Cons 1 (Cons 2 Empty)) }}"
699+
700+testRelationDeclarationMismatch :: Test
701+testRelationDeclarationMismatch = TestCase $ do
702+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
703+ expectTutorialDErr sessionId dbconn (T.isPrefixOf "AtomTypeMismatchError") "data A a = A a | B | C; a := relation{a A Integer}{tuple{a A \"1\"}}"
704+
705+--generate errors when the tuples in a new relation don't match
706+testInvalidTuples :: Test
707+testInvalidTuples = TestCase $ do
708+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
709+ expectTutorialDErr sessionId dbconn (T.isPrefixOf "AttributeNamesMismatchError") ":showexpr relation{tuple{a 1},tuple{b 2}}"
710+ expectTutorialDErr sessionId dbconn (T.isPrefixOf "AttributeNamesMismatchError") ":showexpr relation{tuple{a 1},tuple{a 2, b 3}}"
711+-- expectTutorialDErr sessionId dbconn (T.isPrefixOf "ParseErrorBundle") ":showexpr relation{tuple{a 2, a 3}}" --parse failure can't be validated with this function
712+
713+testSelfReferencingUncommittedContext :: Test
714+testSelfReferencingUncommittedContext = TestCase $ do
715+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
716+ executeTutorialD sessionId dbconn "s:=s union s"
717+ eS <- executeRelationalExpr sessionId dbconn (RelationVariable "s" ())
718+ _ <- rollback sessionId dbconn
719+ eSorig <- executeRelationalExpr sessionId dbconn (RelationVariable "s" ())
720+ assertEqual "s=s'" eSorig eS
721+
722+testUnionAndIntersectionAttributeExprs :: Test
723+testUnionAndIntersectionAttributeExprs = TestCase $ do
724+ (sessionId, dbconn) <- dateExamplesConnection emptyNotificationCallback
725+ executeTutorialD sessionId dbconn "x:=s{intersection of {all but sname} {sname}}"
726+ xRel <- executeRelationalExpr sessionId dbconn (RelationVariable "x" ())
727+ assertEqual "intersection attrs" (Right relationTrue) xRel
728+
729+ executeTutorialD sessionId dbconn "y:=s{union of {all but sname} {sname}}"
730+ yRel <- executeRelationalExpr sessionId dbconn (RelationVariable "y" ())
731+ assertEqual "union attrs" (Right suppliersRel) yRel
732+
test/TutorialD/PrinterTest.hsnew file+47
@@ -0,0 +1,47 @@
1+{-# LANGUAGE OverloadedStrings #-}
2+import Test.HUnit
3+import ProjectM36.Base
4+import System.Exit
5+import Data.Text.Prettyprint.Doc
6+import Data.Map (fromList)
7+import TutorialD.Printer ()
8+import TutorialD.Interpreter.RelationalExpr
9+import Text.Megaparsec
10+import Data.Text (pack)
11+
12+testList :: Test
13+testList = TestList [
14+ testPretty "true" (RelationVariable "true" ()),
15+ testPretty "relation{tuple{a 3, b \"x\"}, tuple{a 4, b \"y\"}}" (MakeRelationFromExprs Nothing (TupleExprs () [TupleExpr (fromList [("a",NakedAtomExpr (IntegerAtom 3)),("b",NakedAtomExpr (TextAtom "x"))]),TupleExpr (fromList [("a",NakedAtomExpr (IntegerAtom 4)),("b",NakedAtomExpr (TextAtom "y"))])])),
16+ testPretty "true:{a:=1, b:=1}" (Extend (AttributeExtendTupleExpr "b" (NakedAtomExpr (IntegerAtom 1))) (Extend (AttributeExtendTupleExpr "a" (NakedAtomExpr (IntegerAtom 1))) (RelationVariable "true" ()))),
17+ testPretty "relation{tuple{a fromGregorian(2014, 2, 4)}}" (MakeRelationFromExprs Nothing (TupleExprs () [TupleExpr (fromList [("a",FunctionAtomExpr "fromGregorian" [NakedAtomExpr (IntegerAtom 2014),NakedAtomExpr (IntegerAtom 2),NakedAtomExpr (IntegerAtom 4)] ())])])),
18+ testPretty "relation{tuple{a bytestring(\"dGVzdGRhdGE=\")}}" (MakeRelationFromExprs Nothing (TupleExprs () [TupleExpr (fromList [("a",FunctionAtomExpr "bytestring" [NakedAtomExpr (TextAtom "dGVzdGRhdGE=")] ())])])),
19+ testPretty "relation{tuple{a t}}" (MakeRelationFromExprs Nothing (TupleExprs () [TupleExpr (fromList [("a",NakedAtomExpr (BoolAtom True))])])),
20+ testPretty "relation{tuple{a Cons 4 (Cons 5 Empty)}}" (MakeRelationFromExprs Nothing (TupleExprs () [TupleExpr (fromList [("a",ConstructedAtomExpr "Cons" [NakedAtomExpr (IntegerAtom 4),ConstructedAtomExpr "Cons" [NakedAtomExpr (IntegerAtom 5),ConstructedAtomExpr "Empty" [] ()] ()] ())])])),
21+ testPretty "relation{a Int, b Text, c Bool}{}" (MakeRelationFromExprs (Just [AttributeAndTypeNameExpr "a" (ADTypeConstructor "Int" []) (),AttributeAndTypeNameExpr "b" (ADTypeConstructor "Text" []) (),AttributeAndTypeNameExpr "c" (ADTypeConstructor "Bool" []) ()]) (TupleExprs () [])),
22+ testPretty "relation{a relation{b Int}}{}" (MakeRelationFromExprs (Just [AttributeAndTypeNameExpr "a" (RelationAtomTypeConstructor [AttributeAndTypeNameExpr "b" (ADTypeConstructor "Int" []) ()]) ()]) (TupleExprs () []))
23+ ]
24+
25+main :: IO ()
26+main = do
27+ tcounts <- runTestTT testList
28+ if errors tcounts + failures tcounts > 0 then exitFailure else exitSuccess
29+
30+testPretty :: String -> RelationalExpr -> Test
31+testPretty tutdStr relExprADT =
32+ TestCase $ do
33+ let relExprStr = show (pretty relExprADT)
34+ print relExprStr
35+ roundTrip <- parseRelExpr relExprStr
36+ {-tutdIn <- parseRelExpr tutdStr
37+ print ("tutd parsed", tutdIn)-}
38+ assertEqual ("pretty ADT " <> tutdStr) tutdStr relExprStr
39+ assertEqual ("round-trip " <> tutdStr) relExprADT roundTrip
40+
41+--round trip tutoriald
42+parseRelExpr :: String -> IO RelationalExpr
43+parseRelExpr tutdStr =
44+ case parse relExprP "test" (pack tutdStr) of
45+ Left err ->
46+ assertFailure (show err)
47+ Right parsed -> pure parsed
test/scripts.hs+5−2
@@ -4,6 +4,8 @@ import TutorialD.Interpreter.Import.TutorialD
4import System.Directory
4import System.Directory
5import Data.List (isSuffixOf)
5import Data.List (isSuffixOf)
6import System.Exit
6import System.Exit
7+import qualified Data.Text as T
8+import Text.URI
7
9
8testList :: IO Test
10testList :: IO Test
9testList = do
11testList = do
@@ -20,7 +22,8 @@ main = do
20
22
21testScript :: FilePath -> Test
23testScript :: FilePath -> Test
22testScript tutdFile = TestCase $ do
24testScript tutdFile = TestCase $ do
23− eImport <- importTutorialD tutdFile
25+ fileURI <- mkURI (T.pack ("file://" <> tutdFile))
26+ eImport <- importTutorialDFromFile fileURI Nothing
24 case eImport of
27 case eImport of
25 Left err -> assertFailure ("tutd import failure in " ++ tutdFile ++ ": " ++ show err)
28 Left err -> assertFailure ("tutd import failure in " ++ tutdFile ++ ": " ++ show err)
26− Right _ -> pure ()
29+ Right _ -> pure ()