Update license date (#561)

- Reduce the size of TypedValue
- Fix double allocation
- Add `Graph` to `TypedValue` unit tests
- Fix allocator usage in `TypedValue`
- Add graph projection to `long_running.cpp` stress test

.clang-tidy

@@ -1,5 +1,9 @@
 ---
 Checks: '*,
+         -abseil-string-find-str-contains,
+         -altera-id-dependent-backward-branch,
+         -altera-struct-pack-align,
+         -altera-unroll-loops,
          -android-*,
          -cert-err58-cpp,
          -cppcoreguidelines-avoid-c-arrays,
@@ -26,6 +30,7 @@ Checks: '*,
          -fuchsia-virtual-inheritance,
          -google-explicit-constructor,
          -google-readability-*,
+         -google-runtime-references,
          -hicpp-avoid-c-arrays,
          -hicpp-avoid-goto,
          -hicpp-braces-around-statements,
@@ -34,13 +39,14 @@ Checks: '*,
          -hicpp-no-assembler,
          -hicpp-no-malloc,
          -hicpp-use-equals-default,
+         -hicpp-use-nullptr,
          -hicpp-vararg,
          -llvm-header-guard,
+         -llvm-include-order,
          -llvmlibc-callee-namespace,
          -llvmlibc-implementation-in-namespace,
          -llvmlibc-restrict-system-libc-headers,
          -misc-non-private-member-variables-in-classes,
-         -misc-unused-parameters,
          -modernize-avoid-c-arrays,
          -modernize-concat-nested-namespaces,
          -modernize-pass-by-value,
@@ -50,9 +56,14 @@ Checks: '*,
          -performance-unnecessary-value-param,
          -readability-braces-around-statements,
          -readability-else-after-return,
+         -readability-function-cognitive-complexity,
          -readability-implicit-bool-conversion,
          -readability-magic-numbers,
-         -readability-named-parameter'
+         -readability-named-parameter,
+         -misc-no-recursion,
+         -concurrency-mt-unsafe,
+         -bugprone-easily-swappable-parameters'
+
 WarningsAsErrors: ''
 HeaderFilterRegex: 'src/.*'
 AnalyzeTemporaryDtors: false
@@ -79,4 +90,3 @@ CheckOptions:
   - key:             modernize-use-nullptr.NullMacros
     value:           'NULL'
 ...
-

.githooks/pre-commit

@@ -16,6 +16,7 @@ tmpdir=$(mktemp -d repo-XXXXXXXX)
 trap "rm -rf $tmpdir" EXIT INT
 
 modified_files=$(git diff --cached --name-only --diff-filter=AM $against | sed -nE "/.*\.(cpp|cc|cxx|c|h|hpp)$/p")
+FAIL=0
 for file in $modified_files; do
   echo "Checking $file..."
 
@@ -23,13 +24,13 @@ for file in $modified_files; do
 
   git checkout-index --prefix="$tmpdir/" -- $file
 
-  echo "Running clang-format..."
-  $project_folder/tools/git-clang-format $tmpdir/$file
-  code=$?
-
-  if [ $code -ne 0 ]; then
-    break
+  # Do not break header checker
+  echo "Running header checker..."
+  $project_folder/tools/header-checker.py $tmpdir/$file $file --amend-year
+  CODE=$?
+  if [ $CODE -ne 0 ]; then
+    FAIL=1
   fi
 done;
 
-return $code
+return ${FAIL}

.github/ISSUE_TEMPLATE/bug_report.md

@@ -0,0 +1,34 @@
+---
+name: Bug report
+about: Create a report to help us improve
+title: "[BUG] "
+labels: bug
+assignees: gitbuda, antonio2368
+
+---
+
+
+**Memgraph version**
+Which version did you use?
+
+**Environment**
+Some information about the environment you are using Memgraph on: operating
+system, how do you connect, with or without docker, which driver etc.
+
+**Describe the bug**
+A clear and concise description of what the bug is.
+
+**To Reproduce**
+Steps to reproduce the behavior:
+1. Run the following query '...'
+2. Click on '....'
+
+**Expected behavior**
+A clear and concise description of what you expected to happen.
+
+**Logs**
+If applicable, add logs of Memgraph, CLI output or screenshots to help explain
+your problem.
+
+**Additional context**
+Add any other context about the problem here.

.github/pull_request_template.md

@@ -0,0 +1,11 @@
+[master < Epic] PR
+- [ ] Check, and update documentation if necessary
+- [ ] Update [changelog](https://docs.memgraph.com/memgraph/changelog)
+- [ ] Write E2E tests
+- [ ] Compare the [benchmarking results](https://bench-graph.memgraph.com/) between the master branch and the Epic branch
+- [ ] Provide the full content or a guide for the final git message
+
+[master < Task] PR
+- [ ] Check, and update documentation if necessary
+- [ ] Update [changelog](https://docs.memgraph.com/memgraph/changelog)
+- [ ] Provide the full content or a guide for the final git message

.github/workflows/daily_benchmark.yaml

@@ -0,0 +1,82 @@
+name: Daily Benchmark
+
+on:
+  workflow_dispatch:
+  schedule:
+    - cron: "0 1 * * *"
+
+jobs:
+  release_benchmarks:
+    name: "Release benchmarks"
+    runs-on: [self-hosted, Linux, X64, Diff, Gen7]
+    env:
+      THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
+
+    steps:
+      - name: Set up repository
+        uses: actions/checkout@v2
+        with:
+          # Number of commits to fetch. `0` indicates all history for all
+          # branches and tags. (default: 1)
+          fetch-depth: 0
+
+      - name: Build release binaries
+        run: |
+          # Activate toolchain.
+          source /opt/toolchain-v4/activate
+
+          # Initialize dependencies.
+          ./init
+
+          # Build only memgraph release binaries.
+          cd build
+          cmake -DCMAKE_BUILD_TYPE=release ..
+          make -j$THREADS
+
+      - name: Run macro benchmarks
+        run: |
+          cd tests/macro_benchmark
+          ./harness QuerySuite MemgraphRunner \
+            --groups aggregation 1000_create unwind_create dense_expand match \
+            --no-strict
+
+      - name: Get branch name (merge)
+        if: github.event_name != 'pull_request'
+        shell: bash
+        run: echo "BRANCH_NAME=$(echo ${GITHUB_REF#refs/heads/} | tr / -)" >> $GITHUB_ENV
+
+      - name: Get branch name (pull request)
+        if: github.event_name == 'pull_request'
+        shell: bash
+        run: echo "BRANCH_NAME=$(echo ${GITHUB_HEAD_REF} | tr / -)" >> $GITHUB_ENV
+
+      - name: Upload macro benchmark results
+        run: |
+          cd tools/bench-graph-client
+          virtualenv -p python3 ve3
+          source ve3/bin/activate
+          pip install -r requirements.txt
+          ./main.py --benchmark-name "macro_benchmark" \
+                    --benchmark-results-path "../../tests/macro_benchmark/.harness_summary" \
+                    --github-run-id "${{ github.run_id }}" \
+                    --github-run-number "${{ github.run_number }}" \
+                    --head-branch-name "${{ env.BRANCH_NAME }}"
+
+      - name: Run mgbench
+        run: |
+          cd tests/mgbench
+          ./benchmark.py --num-workers-for-benchmark 12 --export-results benchmark_result.json pokec/medium/*/*
+
+      - name: Upload mgbench results
+        run: |
+          cd tools/bench-graph-client
+          virtualenv -p python3 ve3
+          source ve3/bin/activate
+          pip install -r requirements.txt
+          ./main.py --benchmark-name "mgbench" \
+                    --benchmark-results-path "../../tests/mgbench/benchmark_result.json" \
+                    --github-run-id "${{ github.run_id }}" \
+                    --github-run-number "${{ github.run_number }}" \
+                    --head-branch-name "${{ env.BRANCH_NAME }}"

.github/workflows/diff.yaml

@@ -1,11 +1,19 @@
 name: Diff
+concurrency:
+  group: ${{ github.head_ref || github.sha }}
+  cancel-in-progress: true
 
 on:
   push:
+    branches:
+      - master
+  workflow_dispatch:
+  pull_request:
     paths-ignore:
-      - 'docs/**'
-      - '**/*.md'
-      - '.clang-*'
+      - "docs/**"
+      - "**/*.md"
+      - ".clang-format"
+      - "CODEOWNERS"
 
 jobs:
   community_build:
@@ -13,6 +21,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, Diff]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
 
     steps:
       - name: Set up repository
@@ -25,7 +35,7 @@ jobs:
       - name: Build community binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -38,38 +48,19 @@ jobs:
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run unit tests.
           cd build
           ctest -R memgraph__unit --output-on-failure -j$THREADS
 
-      - name: Run stress test
-        run: |
-          cd tests/stress
-          ./continuous_integration
-
-      - name: Create community DEB package
-        run: |
-          # Activate toolchain.
-          source /opt/toolchain-v2/activate
-
-          # Create community DEB package.
-          cd build
-          mkdir output && cd output
-          cpack -G DEB --config ../CPackConfig.cmake
-
-      - name: Save community DEB package
-        uses: actions/upload-artifact@v2
-        with:
-          name: "Community DEB package"
-          path: build/output/memgraph*.deb
-
   code_analysis:
     name: "Code analysis"
     runs-on: [self-hosted, Linux, X64, Diff]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
 
     steps:
       - name: Set up repository
@@ -79,10 +70,15 @@ jobs:
           # branches and tags. (default: 1)
           fetch-depth: 0
 
+        # This is also needed if we want do to comparison against other branches
+        # See https://github.community/t/checkout-code-fails-when-it-runs-lerna-run-test-since-master/17920
+      - name: Fetch all history for all tags and branches
+        run: git fetch
+
       - name: Build combined ASAN, UBSAN and coverage binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -94,7 +90,7 @@ jobs:
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run unit tests. It is restricted to 2 threads intentionally, because higher concurrency makes the timing related tests unstable.
           cd build
@@ -103,7 +99,7 @@ jobs:
       - name: Compute code coverage
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Compute code coverage.
           cd tools/github
@@ -119,12 +115,22 @@ jobs:
           name: "Code coverage"
           path: tools/github/generated/code_coverage.tar.gz
 
+      - name: Set base branch
+        if: ${{ github.event_name == 'pull_request' }}
+        run: |
+          echo "BASE_BRANCH=origin/${{ github.base_ref }}" >> $GITHUB_ENV
+
+      - name: Set base branch # if we manually dispatch or push to master
+        if: ${{ github.event_name != 'pull_request' }}
+        run: |
+          echo "BASE_BRANCH=origin/master" >> $GITHUB_ENV
+
       - name: Run clang-tidy
         run: |
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Restrict clang-tidy results only to the modified parts
-          git diff -U0 master... -- src ':!*.hpp' | ./tools/github/clang-tidy/clang-tidy-diff.py -p 1 -j $THREADS -path build | tee ./build/clang_tidy_output.txt
+          git diff -U0 ${{ env.BASE_BRANCH }}... -- src | ./tools/github/clang-tidy/clang-tidy-diff.py -p 1 -j $THREADS -path build  -regex ".+\.cpp" | tee ./build/clang_tidy_output.txt
 
           # Fail if any warning is reported
           ! cat ./build/clang_tidy_output.txt | ./tools/github/clang-tidy/grep_error_lines.sh > /dev/null
@@ -134,6 +140,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, Diff]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
 
     steps:
       - name: Set up repository
@@ -146,7 +154,7 @@ jobs:
       - name: Build debug binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -159,7 +167,7 @@ jobs:
       - name: Run leftover CTest tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run leftover CTest tests (all except unit and benchmark tests).
           cd build
@@ -191,7 +199,7 @@ jobs:
       - name: Run cppcheck and clang-format
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run cppcheck and clang-format.
           cd tools/github
@@ -208,6 +216,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, Diff]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
 
     steps:
       - name: Set up repository
@@ -220,7 +230,7 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -243,22 +253,23 @@ jobs:
             tests/gql_behave/gql_behave_status.csv
             tests/gql_behave/gql_behave_status.html
 
-      - name: Run e2e replication tests
+      - name: Run unit tests
+        run: |
+          # Activate toolchain.
+          source /opt/toolchain-v4/activate
+
+          # Run unit tests.
+          cd build
+          ctest -R memgraph__unit --output-on-failure -j$THREADS
+
+      - name: Run e2e tests
         run: |
           # TODO(gitbuda): Setup mgclient and pymgclient properly.
           cd tests
           ./setup.sh
           source ve3/bin/activate
           cd e2e
-          LD_LIBRARY_PATH=$LD_LIBRARY_PATH:../../libs/mgclient/lib python runner.py --workloads-path replication/workloads.yaml
-
-      - name: Run e2e memory control tests
-        run: |
-          cd tests
-          ./setup.sh
-          source ve3/bin/activate
-          cd e2e
-          LD_LIBRARY_PATH=$LD_LIBRARY_PATH:../../libs/mgclient/lib python runner.py --workloads-path memory/workloads.yaml
+          LD_LIBRARY_PATH=$LD_LIBRARY_PATH:../../libs/mgclient/lib python runner.py --workloads-root-directory .
 
       - name: Run stress test (plain)
         run: |
@@ -279,10 +290,15 @@ jobs:
       - name: Create enterprise DEB package
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
+
+          cd build
+
+          # create mgconsole
+          # we use the -B to force the build
+          make -j$THREADS -B mgconsole
 
           # Create enterprise DEB package.
-          cd build
           mkdir output && cd output
           cpack -G DEB --config ../CPackConfig.cmake
 
@@ -307,6 +323,8 @@ jobs:
     #continue-on-error: true
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
 
     steps:
       - name: Set up repository
@@ -319,7 +337,7 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -346,6 +364,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, Diff, Gen7]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
 
     steps:
       - name: Set up repository
@@ -358,12 +378,12 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
 
-          # Build only memgraph release binarie.
+          # Build only memgraph release binaries.
           cd build
           cmake -DCMAKE_BUILD_TYPE=release ..
           make -j$THREADS
@@ -375,6 +395,16 @@ jobs:
             --groups aggregation 1000_create unwind_create dense_expand match \
             --no-strict
 
+      - name: Get branch name (merge)
+        if: github.event_name != 'pull_request'
+        shell: bash
+        run: echo "BRANCH_NAME=$(echo ${GITHUB_REF#refs/heads/} | tr / -)" >> $GITHUB_ENV
+
+      - name: Get branch name (pull request)
+        if: github.event_name == 'pull_request'
+        shell: bash
+        run: echo "BRANCH_NAME=$(echo ${GITHUB_HEAD_REF} | tr / -)" >> $GITHUB_ENV
+
       - name: Upload macro benchmark results
         run: |
           cd tools/bench-graph-client
@@ -384,7 +414,8 @@ jobs:
           ./main.py --benchmark-name "macro_benchmark" \
                     --benchmark-results-path "../../tests/macro_benchmark/.harness_summary" \
                     --github-run-id "${{ github.run_id }}" \
-                    --github-run-number "${{ github.run_number }}"
+                    --github-run-number "${{ github.run_number }}" \
+                    --head-branch-name "${{ env.BRANCH_NAME }}"
 
       - name: Run mgbench
         run: |
@@ -400,4 +431,5 @@ jobs:
           ./main.py --benchmark-name "mgbench" \
                     --benchmark-results-path "../../tests/mgbench/benchmark_result.json" \
                     --github-run-id "${{ github.run_id }}" \
-                    --github-run-number "${{ github.run_number }}"
+                    --github-run-number "${{ github.run_number }}" \
+                    --head-branch-name "${{ env.BRANCH_NAME }}"

.github/workflows/full_clang_tidy.yaml

@@ -9,6 +9,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, Ubuntu20.04]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
 
     steps:
       - name: Set up repository
@@ -21,7 +23,7 @@ jobs:
       - name: Build debug binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -34,10 +36,10 @@ jobs:
 
       - name: Run clang-tidy
         run: |
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # The results are also written to standard output in order to retain them in the logs
-          ./tools/github/clang-tidy/run-clang-tidy.py -p build -j $THREADS -clang-tidy-binary=/opt/toolchain-v2/bin/clang-tidy "$PWD/src/*" |
+          ./tools/github/clang-tidy/run-clang-tidy.py -p build -j $THREADS -clang-tidy-binary=/opt/toolchain-v4/bin/clang-tidy "$PWD/src/*" |
             tee ./build/full_clang_tidy_output.txt
 
       - name: Summarize clang-tidy results

.github/workflows/package_all.yaml

@@ -5,244 +5,174 @@ name: Package All
 on: workflow_dispatch
 
 jobs:
-  centos-7_community:
-    runs-on: [self-hosted, DockerMgBuild]
+  centos-7:
+    runs-on: [self-hosted, DockerMgBuild, X64]
     timeout-minutes: 60
     steps:
       - name: "Set up repository"
-        uses: actions/checkout@v2
+        uses: actions/checkout@v3
         with:
           fetch-depth: 0 # Required because of release/get_version.py
       - name: "Build package"
         run: |
-          ./release/package/run.sh package community centos-7
+          ./release/package/run.sh package centos-7
       - name: "Upload package"
         uses: actions/upload-artifact@v2
         with:
-          name: centos-7_community
+          name: centos-7
           path: build/output/centos-7/memgraph*.rpm
 
-  centos-8_community:
-    runs-on: [self-hosted, DockerMgBuild]
+  centos-9:
+    runs-on: [self-hosted, DockerMgBuild, X64]
     timeout-minutes: 60
     steps:
       - name: "Set up repository"
-        uses: actions/checkout@v2
+        uses: actions/checkout@v3
         with:
           fetch-depth: 0 # Required because of release/get_version.py
       - name: "Build package"
         run: |
-          ./release/package/run.sh package community centos-8
+          ./release/package/run.sh package centos-9
       - name: "Upload package"
         uses: actions/upload-artifact@v2
         with:
-          name: centos-8_community
-          path: build/output/centos-8/memgraph*.rpm
+          name: centos-9
+          path: build/output/centos-9/memgraph*.rpm
 
-  debian-9_community:
-    runs-on: [self-hosted, DockerMgBuild]
+  debian-10:
+    runs-on: [self-hosted, DockerMgBuild, X64]
     timeout-minutes: 60
     steps:
       - name: "Set up repository"
-        uses: actions/checkout@v2
+        uses: actions/checkout@v3
         with:
           fetch-depth: 0 # Required because of release/get_version.py
       - name: "Build package"
         run: |
-          ./release/package/run.sh package community debian-9
+          ./release/package/run.sh package debian-10
       - name: "Upload package"
         uses: actions/upload-artifact@v2
         with:
-          name: debian-9_community
-          path: build/output/debian-9/memgraph*.deb
-
-  debian-10_community:
-    runs-on: [self-hosted, DockerMgBuild]
-    timeout-minutes: 60
-    steps:
-      - name: "Set up repository"
-        uses: actions/checkout@v2
-        with:
-          fetch-depth: 0 # Required because of release/get_version.py
-      - name: "Build package"
-        run: |
-          ./release/package/run.sh package community debian-10
-      - name: "Upload package"
-        uses: actions/upload-artifact@v2
-        with:
-          name: debian-10_community
+          name: debian-10
           path: build/output/debian-10/memgraph*.deb
 
-  docker_community:
-    runs-on: [self-hosted, DockerMgBuild]
+  debian-11:
+    runs-on: [self-hosted, DockerMgBuild, X64]
     timeout-minutes: 60
     steps:
       - name: "Set up repository"
-        uses: actions/checkout@v2
+        uses: actions/checkout@v3
+        with:
+          fetch-depth: 0 # Required because of release/get_version.py
+      - name: "Build package"
+        run: |
+          ./release/package/run.sh package debian-11
+      - name: "Upload package"
+        uses: actions/upload-artifact@v2
+        with:
+          name: debian-11
+          path: build/output/debian-11/memgraph*.deb
+
+  docker:
+    runs-on: [self-hosted, DockerMgBuild, X64]
+    timeout-minutes: 60
+    steps:
+      - name: "Set up repository"
+        uses: actions/checkout@v3
         with:
           fetch-depth: 0 # Required because of release/get_version.py
       - name: "Build package"
         run: |
           cd release/package
-          ./run.sh package community debian-10 --for-docker
+          ./run.sh package debian-11 --for-docker
           ./run.sh docker
       - name: "Upload package"
         uses: actions/upload-artifact@v2
         with:
-          name: docker_community
+          name: docker
           path: build/output/docker/memgraph*.tar.gz
 
-  ubuntu-1804_community:
-    runs-on: [self-hosted, DockerMgBuild]
+  ubuntu-1804:
+    runs-on: [self-hosted, DockerMgBuild, X64]
     timeout-minutes: 60
     steps:
       - name: "Set up repository"
-        uses: actions/checkout@v2
+        uses: actions/checkout@v3
         with:
           fetch-depth: 0 # Required because of release/get_version.py
       - name: "Build package"
         run: |
-          ./release/package/run.sh package community ubuntu-18.04
+          ./release/package/run.sh package ubuntu-18.04
       - name: "Upload package"
         uses: actions/upload-artifact@v2
         with:
-          name: ubuntu-1804_community
+          name: ubuntu-1804
           path: build/output/ubuntu-18.04/memgraph*.deb
 
-  ubuntu-2004_community:
-    runs-on: [self-hosted, DockerMgBuild]
+  ubuntu-2004:
+    runs-on: [self-hosted, DockerMgBuild, X64]
     timeout-minutes: 60
     steps:
       - name: "Set up repository"
-        uses: actions/checkout@v2
+        uses: actions/checkout@v3
         with:
           fetch-depth: 0 # Required because of release/get_version.py
       - name: "Build package"
         run: |
-          ./release/package/run.sh package community ubuntu-20.04
+          ./release/package/run.sh package ubuntu-20.04
       - name: "Upload package"
         uses: actions/upload-artifact@v2
         with:
-          name: ubuntu-2004_community
+          name: ubuntu-2004
           path: build/output/ubuntu-20.04/memgraph*.deb
 
-  centos-7_enterprise:
-    runs-on: [self-hosted, DockerMgBuild]
+  ubuntu-2204:
+    runs-on: [self-hosted, DockerMgBuild, X64]
     timeout-minutes: 60
     steps:
       - name: "Set up repository"
-        uses: actions/checkout@v2
+        uses: actions/checkout@v3
         with:
           fetch-depth: 0 # Required because of release/get_version.py
       - name: "Build package"
         run: |
-          ./release/package/run.sh package enterprise centos-7
+          ./release/package/run.sh package ubuntu-22.04
       - name: "Upload package"
         uses: actions/upload-artifact@v2
         with:
-          name: centos-7_enterprise
-          path: build/output/centos-7/memgraph*.rpm
+          name: ubuntu-2204
+          path: build/output/ubuntu-22.04/memgraph*.deb
 
-  centos-8_enterprise:
-    runs-on: [self-hosted, DockerMgBuild]
+  debian-11-platform:
+    runs-on: [self-hosted, DockerMgBuild, X64]
     timeout-minutes: 60
     steps:
       - name: "Set up repository"
-        uses: actions/checkout@v2
+        uses: actions/checkout@v3
         with:
           fetch-depth: 0 # Required because of release/get_version.py
       - name: "Build package"
         run: |
-          ./release/package/run.sh package enterprise centos-8
+          ./release/package/run.sh package debian-11 --for-platform
       - name: "Upload package"
         uses: actions/upload-artifact@v2
         with:
-          name: centos-8_enterprise
-          path: build/output/centos-8/memgraph*.rpm
+          name: debian-11-platform
+          path: build/output/debian-11/memgraph*.deb
 
-  debian-9_enterprise:
-    runs-on: [self-hosted, DockerMgBuild]
+  debian-11-arm:
+    runs-on: [self-hosted, DockerMgBuild, ARM64, strange]
     timeout-minutes: 60
     steps:
       - name: "Set up repository"
-        uses: actions/checkout@v2
+        uses: actions/checkout@v3
         with:
           fetch-depth: 0 # Required because of release/get_version.py
       - name: "Build package"
         run: |
-          ./release/package/run.sh package enterprise debian-9
+          ./release/package/run.sh package debian-11-arm
       - name: "Upload package"
         uses: actions/upload-artifact@v2
         with:
-          name: debian-9_enterprise
-          path: build/output/debian-9/memgraph*.deb
-
-  debian-10_enterprise:
-    runs-on: [self-hosted, DockerMgBuild]
-    timeout-minutes: 60
-    steps:
-      - name: "Set up repository"
-        uses: actions/checkout@v2
-        with:
-          fetch-depth: 0 # Required because of release/get_version.py
-      - name: "Build package"
-        run: |
-          ./release/package/run.sh package enterprise debian-10
-      - name: "Upload package"
-        uses: actions/upload-artifact@v2
-        with:
-          name: debian-10_enterprise
-          path: build/output/debian-10/memgraph*.deb
-
-  docker_enterprise:
-    runs-on: [self-hosted, DockerMgBuild]
-    timeout-minutes: 60
-    steps:
-      - name: "Set up repository"
-        uses: actions/checkout@v2
-        with:
-          fetch-depth: 0 # Required because of release/get_version.py
-      - name: "Build package"
-        run: |
-          cd release/package
-          ./run.sh package enterprise debian-10 --for-docker
-          ./run.sh docker
-      - name: "Upload package"
-        uses: actions/upload-artifact@v2
-        with:
-          name: docker_enterprise
-          path: build/output/docker/memgraph*.tar.gz
-
-  ubuntu-1804_enterprise:
-    runs-on: [self-hosted, DockerMgBuild]
-    timeout-minutes: 60
-    steps:
-      - name: "Set up repository"
-        uses: actions/checkout@v2
-        with:
-          fetch-depth: 0 # Required because of release/get_version.py
-      - name: "Build package"
-        run: |
-          ./release/package/run.sh package enterprise ubuntu-18.04
-      - name: "Upload package"
-        uses: actions/upload-artifact@v2
-        with:
-          name: ubuntu-1804_enterprise
-          path: build/output/ubuntu-18.04/memgraph*.deb
-
-  ubuntu-2004_enterprise:
-    runs-on: [self-hosted, DockerMgBuild]
-    timeout-minutes: 60
-    steps:
-      - name: "Set up repository"
-        uses: actions/checkout@v2
-        with:
-          fetch-depth: 0 # Required because of release/get_version.py
-      - name: "Build package"
-        run: |
-          ./release/package/run.sh package enterprise ubuntu-20.04
-      - name: "Upload package"
-        uses: actions/upload-artifact@v2
-        with:
-          name: ubuntu-2004_enterprise
-          path: build/output/ubuntu-20.04/memgraph*.deb
+          name: debian-11-arm
+          path: build/output/debian-11-arm/memgraph*.deb

.github/workflows/release_centos8.yaml

@@ -11,6 +11,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, CentOS8]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
     timeout-minutes: 960
 
     steps:
@@ -24,7 +26,7 @@ jobs:
       - name: Build community binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -34,47 +36,22 @@ jobs:
           cmake -DCMAKE_BUILD_TYPE=release -DMG_ENTERPRISE=OFF ..
           make -j$THREADS
 
-      - name: Create community RPM package
-        run: |
-          # Activate toolchain.
-          source /opt/toolchain-v2/activate
-
-          # Create community RPM package.
-          cd build
-          mkdir output && cd output
-          cpack -G RPM --config ../CPackConfig.cmake
-          rpmlint memgraph*.rpm
-
-      - name: Save community RPM package
-        uses: actions/upload-artifact@v2
-        with:
-          name: "Community RPM package"
-          path: build/output/memgraph*.rpm
-
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run unit tests.
           cd build
           ctest -R memgraph__unit --output-on-failure
 
-      - name: Run stress test (plain)
-        run: |
-          cd tests/stress
-          ./continuous_integration
-
-      - name: Run stress test (large)
-        run: |
-          cd tests/stress
-          ./continuous_integration --large-dataset
-
   coverage_build:
     name: "Coverage build"
     runs-on: [self-hosted, Linux, X64, CentOS8]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
 
     steps:
       - name: Set up repository
@@ -87,7 +64,7 @@ jobs:
       - name: Build coverage binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -100,7 +77,7 @@ jobs:
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run unit tests.
           cd build
@@ -109,7 +86,7 @@ jobs:
       - name: Compute code coverage
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Compute code coverage.
           cd tools/github
@@ -130,6 +107,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, CentOS8]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
 
     steps:
       - name: Set up repository
@@ -142,7 +121,7 @@ jobs:
       - name: Build debug binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -155,7 +134,7 @@ jobs:
       - name: Run leftover CTest tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run leftover CTest tests (all except unit and benchmark tests).
           cd build
@@ -187,7 +166,7 @@ jobs:
       - name: Run cppcheck and clang-format
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run cppcheck and clang-format.
           cd tools/github
@@ -204,6 +183,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, CentOS8]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
     timeout-minutes: 960
 
     steps:
@@ -217,7 +198,7 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -230,10 +211,15 @@ jobs:
       - name: Create enterprise RPM package
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
+
+          cd build
+
+          # create mgconsole
+          # we use the -B to force the build
+          make -j$THREADS -B mgconsole
 
           # Create enterprise RPM package.
-          cd build
           mkdir output && cd output
           cpack -G RPM --config ../CPackConfig.cmake
           rpmlint memgraph*.rpm
@@ -247,7 +233,7 @@ jobs:
       - name: Run micro benchmark tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run micro benchmark tests.
           cd build
@@ -283,22 +269,23 @@ jobs:
             tests/gql_behave/gql_behave_status.csv
             tests/gql_behave/gql_behave_status.html
 
-      - name: Run e2e replication tests
+      - name: Run unit tests
+        run: |
+          # Activate toolchain.
+          source /opt/toolchain-v4/activate
+
+          # Run unit tests.
+          cd build
+          ctest -R memgraph__unit --output-on-failure
+
+      - name: Run e2e tests
         run: |
           # TODO(gitbuda): Setup mgclient and pymgclient properly.
           cd tests
           ./setup.sh
           source ve3/bin/activate
           cd e2e
-          LD_LIBRARY_PATH=$LD_LIBRARY_PATH:../../libs/mgclient/lib python runner.py --workloads-path replication/workloads.yaml
-
-      - name: Run e2e memory control tests
-        run: |
-          cd tests
-          ./setup.sh
-          source ve3/bin/activate
-          cd e2e
-          LD_LIBRARY_PATH=$LD_LIBRARY_PATH:../../libs/mgclient/lib python runner.py --workloads-path memory/workloads.yaml
+          LD_LIBRARY_PATH=$LD_LIBRARY_PATH:../../libs/mgclient/lib python runner.py --workloads-root-directory .
 
       - name: Run stress test (plain)
         run: |

.github/workflows/release_debian10.yaml

@@ -11,6 +11,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, Debian10]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
     timeout-minutes: 960
 
     steps:
@@ -24,7 +26,7 @@ jobs:
       - name: Build community binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -34,46 +36,22 @@ jobs:
           cmake -DCMAKE_BUILD_TYPE=release -DMG_ENTERPRISE=OFF ..
           make -j$THREADS
 
-      - name: Create community DEB package
-        run: |
-          # Activate toolchain.
-          source /opt/toolchain-v2/activate
-
-          # Create community DEB package.
-          cd build
-          mkdir output && cd output
-          cpack -G DEB --config ../CPackConfig.cmake
-
-      - name: Save community DEB package
-        uses: actions/upload-artifact@v2
-        with:
-          name: "Community DEB package"
-          path: build/output/memgraph*.deb
-
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run unit tests.
           cd build
           ctest -R memgraph__unit --output-on-failure
 
-      - name: Run stress test (plain)
-        run: |
-          cd tests/stress
-          ./continuous_integration
-
-      - name: Run stress test (large)
-        run: |
-          cd tests/stress
-          ./continuous_integration --large-dataset
-
   coverage_build:
     name: "Coverage build"
     runs-on: [self-hosted, Linux, X64, Debian10]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
 
     steps:
       - name: Set up repository
@@ -86,7 +64,7 @@ jobs:
       - name: Build coverage binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -99,7 +77,7 @@ jobs:
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run unit tests.
           cd build
@@ -108,7 +86,7 @@ jobs:
       - name: Compute code coverage
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Compute code coverage.
           cd tools/github
@@ -129,6 +107,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, Debian10]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
 
     steps:
       - name: Set up repository
@@ -141,7 +121,7 @@ jobs:
       - name: Build debug binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -154,7 +134,7 @@ jobs:
       - name: Run leftover CTest tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run leftover CTest tests (all except unit and benchmark tests).
           cd build
@@ -186,7 +166,7 @@ jobs:
       - name: Run cppcheck and clang-format
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run cppcheck and clang-format.
           cd tools/github
@@ -203,6 +183,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, Debian10]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
     timeout-minutes: 960
 
     steps:
@@ -216,7 +198,7 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -229,10 +211,15 @@ jobs:
       - name: Create enterprise DEB package
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
+
+          cd build
+
+          # create mgconsole
+          # we use the -B to force the build
+          make -j$THREADS -B mgconsole
 
           # Create enterprise DEB package.
-          cd build
           mkdir output && cd output
           cpack -G DEB --config ../CPackConfig.cmake
 
@@ -245,7 +232,7 @@ jobs:
       - name: Run micro benchmark tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run micro benchmark tests.
           cd build
@@ -281,22 +268,23 @@ jobs:
             tests/gql_behave/gql_behave_status.csv
             tests/gql_behave/gql_behave_status.html
 
-      - name: Run e2e replication tests
+      - name: Run unit tests
+        run: |
+          # Activate toolchain.
+          source /opt/toolchain-v4/activate
+
+          # Run unit tests.
+          cd build
+          ctest -R memgraph__unit --output-on-failure
+
+      - name: Run e2e tests
         run: |
           # TODO(gitbuda): Setup mgclient and pymgclient properly.
           cd tests
           ./setup.sh
           source ve3/bin/activate
           cd e2e
-          LD_LIBRARY_PATH=$LD_LIBRARY_PATH:../../libs/mgclient/lib python runner.py --workloads-path replication/workloads.yaml
-
-      - name: Run e2e memory control tests
-        run: |
-          cd tests
-          ./setup.sh
-          source ve3/bin/activate
-          cd e2e
-          LD_LIBRARY_PATH=$LD_LIBRARY_PATH:../../libs/mgclient/lib python runner.py --workloads-path memory/workloads.yaml
+          LD_LIBRARY_PATH=$LD_LIBRARY_PATH:../../libs/mgclient/lib python runner.py --workloads-root-directory .
 
       - name: Run stress test (plain)
         run: |
@@ -330,6 +318,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, Debian10, JepsenControl]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
     timeout-minutes: 60
 
     steps:
@@ -343,7 +333,7 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init

.github/workflows/release_docker.yaml

@@ -0,0 +1,69 @@
+name: Publish Docker images
+
+on:
+  workflow_dispatch:
+    inputs:
+      version:
+        description: "Memgraph binary version to publish on DockerHub."
+        required: true
+      force_release:
+        type: boolean
+        required: false
+        default: false
+
+jobs:
+  docker_publish:
+    runs-on: ubuntu-latest
+    env:
+      DOCKER_ORGANIZATION_NAME: memgraph
+      DOCKER_REPOSITORY_NAME: memgraph
+    steps:
+      - name: Checkout
+        uses: actions/checkout@v2
+
+      - name: Set up QEMU
+        uses: docker/setup-qemu-action@v1
+
+      - name: Set up Docker Buildx
+        id: buildx
+        uses: docker/setup-buildx-action@v1
+
+      - name: Log in to Docker Hub
+        uses: docker/login-action@v1
+        with:
+          username: ${{ secrets.DOCKER_USERNAME }}
+          password: ${{ secrets.DOCKER_PASSWORD }}
+
+      - name: Download memgraph binary
+        run: |
+          cd release/docker
+          curl -L https://download.memgraph.com/memgraph/v${{ github.event.inputs.version }}/debian-11/memgraph_${{ github.event.inputs.version }}-1_amd64.deb > memgraph-amd64.deb
+          curl -L https://download.memgraph.com/memgraph/v${{ github.event.inputs.version }}/debian-11-aarch64/memgraph_${{ github.event.inputs.version }}-1_arm64.deb > memgraph-arm64.deb
+
+      - name: Check if specified version is already pushed
+        run: |
+          EXISTS=$(docker manifest inspect $DOCKER_ORGANIZATION_NAME/$DOCKER_REPOSITORY_NAME:${{ github.event.inputs.version }} > /dev/null; echo $?)
+          echo $EXISTS
+          if [[ ${EXISTS} -eq 0 ]]; then
+              echo 'The specified version has been already released to DockerHub.'
+              if [[ ${{ github.event.inputs.force_release }} = true ]]; then
+                echo 'Forcing the release!'
+              else
+                echo 'Stopping the release!'
+                exit 1
+              fi
+          else
+              echo 'All good the specified version has not been release to DockerHub.'
+          fi
+
+      - name: Build & push docker images
+        run: |
+          cd release/docker
+          docker buildx build \
+          --build-arg BINARY_NAME="memgraph-" \
+          --build-arg EXTENSION="deb" \
+          --platform linux/amd64,linux/arm64 \
+          --tag $DOCKER_ORGANIZATION_NAME/$DOCKER_REPOSITORY_NAME:${{ github.event.inputs.version }} \
+          --tag $DOCKER_ORGANIZATION_NAME/$DOCKER_REPOSITORY_NAME:latest \
+          --file memgraph_deb.dockerfile \
+          --push .

.github/workflows/release_ubuntu2004.yaml

@@ -11,6 +11,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, Ubuntu20.04]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
     timeout-minutes: 960
 
     steps:
@@ -24,7 +26,7 @@ jobs:
       - name: Build community binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -34,46 +36,22 @@ jobs:
           cmake -DCMAKE_BUILD_TYPE=release -DMG_ENTERPRISE=OFF ..
           make -j$THREADS
 
-      - name: Create community DEB package
-        run: |
-          # Activate toolchain.
-          source /opt/toolchain-v2/activate
-
-          # Create community DEB package.
-          cd build
-          mkdir output && cd output
-          cpack -G DEB --config ../CPackConfig.cmake
-
-      - name: Save community DEB package
-        uses: actions/upload-artifact@v2
-        with:
-          name: "Community DEB package"
-          path: build/output/memgraph*.deb
-
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run unit tests.
           cd build
           ctest -R memgraph__unit --output-on-failure
 
-      - name: Run stress test (plain)
-        run: |
-          cd tests/stress
-          ./continuous_integration
-
-      - name: Run stress test (large)
-        run: |
-          cd tests/stress
-          ./continuous_integration --large-dataset
-
   coverage_build:
     name: "Coverage build"
     runs-on: [self-hosted, Linux, X64, Ubuntu20.04]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
 
     steps:
       - name: Set up repository
@@ -86,7 +64,7 @@ jobs:
       - name: Build coverage binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -99,7 +77,7 @@ jobs:
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run unit tests.
           cd build
@@ -108,7 +86,7 @@ jobs:
       - name: Compute code coverage
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Compute code coverage.
           cd tools/github
@@ -129,6 +107,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, Ubuntu20.04]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
 
     steps:
       - name: Set up repository
@@ -141,7 +121,7 @@ jobs:
       - name: Build debug binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -154,7 +134,7 @@ jobs:
       - name: Run leftover CTest tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run leftover CTest tests (all except unit and benchmark tests).
           cd build
@@ -186,7 +166,7 @@ jobs:
       - name: Run cppcheck and clang-format
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run cppcheck and clang-format.
           cd tools/github
@@ -203,6 +183,8 @@ jobs:
     runs-on: [self-hosted, Linux, X64, Ubuntu20.04]
     env:
       THREADS: 24
+      MEMGRAPH_ENTERPRISE_LICENSE: ${{ secrets.MEMGRAPH_ENTERPRISE_LICENSE }}
+      MEMGRAPH_ORGANIZATION_NAME: ${{ secrets.MEMGRAPH_ORGANIZATION_NAME }}
     timeout-minutes: 960
 
     steps:
@@ -216,7 +198,7 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Initialize dependencies.
           ./init
@@ -229,10 +211,15 @@ jobs:
       - name: Create enterprise DEB package
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
+
+          cd build
+
+          # create mgconsole
+          # we use the -B to force the build
+          make -j$THREADS -B mgconsole
 
           # Create enterprise DEB package.
-          cd build
           mkdir output && cd output
           cpack -G DEB --config ../CPackConfig.cmake
 
@@ -245,7 +232,7 @@ jobs:
       - name: Run micro benchmark tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v2/activate
+          source /opt/toolchain-v4/activate
 
           # Run micro benchmark tests.
           cd build
@@ -281,22 +268,23 @@ jobs:
             tests/gql_behave/gql_behave_status.csv
             tests/gql_behave/gql_behave_status.html
 
-      - name: Run e2e replication tests
+      - name: Run unit tests
+        run: |
+          # Activate toolchain.
+          source /opt/toolchain-v4/activate
+
+          # Run unit tests.
+          cd build
+          ctest -R memgraph__unit --output-on-failure
+
+      - name: Run e2e tests
         run: |
           # TODO(gitbuda): Setup mgclient and pymgclient properly.
           cd tests
           ./setup.sh
           source ve3/bin/activate
           cd e2e
-          LD_LIBRARY_PATH=$LD_LIBRARY_PATH:../../libs/mgclient/lib python runner.py --workloads-path replication/workloads.yaml
-
-      - name: Run e2e memory control tests
-        run: |
-          cd tests
-          ./setup.sh
-          source ve3/bin/activate
-          cd e2e
-          LD_LIBRARY_PATH=$LD_LIBRARY_PATH:../../libs/mgclient/lib python runner.py --workloads-path memory/workloads.yaml
+          LD_LIBRARY_PATH=$LD_LIBRARY_PATH:../../libs/mgclient/lib python runner.py --workloads-root-directory .
 
       - name: Run stress test (plain)
         run: |

.pre-commit-config.yaml

@@ -0,0 +1,24 @@
+repos:
+  - repo: https://github.com/pre-commit/pre-commit-hooks
+    rev: v2.3.0
+    hooks:
+      - id: check-yaml
+      - id: end-of-file-fixer
+      - id: trailing-whitespace
+  - repo: https://github.com/psf/black
+    rev: 22.3.0
+    hooks:
+      - id: black
+        args: # arguments to configure black
+          - --line-length=120
+          - --include='\.pyi?$'
+          # these folders wont be formatted by black
+          - --exclude="""\.git |
+            \.__pycache__|
+            build|
+            libs|
+            .cache"""
+  - repo: https://github.com/pre-commit/mirrors-clang-format
+    rev: v13.0.0
+    hooks:
+      - id: clang-format

CHANGELOG.md

@@ -1,489 +1,5 @@
-# Change Log
+Change Log for all versions of Memgraph can be found on-line at
+https://docs.memgraph.com/memgraph/changelog
 
-## Future
-
-### Bug Fixes
-
-* Fixed parsing of types for Python procedures for types nested in `mgp.List`.
-  For example, parsing of `mgp.List[mgp.Map]` works now.
-* Fixed memory tracking issues. Some of the allocation and deallocation weren't
-  tracked during the query execution.
-* Fixed reading CSV files that are using CRLF as the newline symbol.
-
-## v1.4.0
-
-### Breaking Changes
-
-* Changed `MEMORY LIMIT num (KB|MB)` clause in the procedure calls to `PROCEDURE MEMORY LIMIT num (KB|MB)`.
-  The functionality is still the same.
-
-### Major Feature and Improvements
-
-* Added replication to community version.
-* Added support for multiple query modules directories at the same time.
-  You can now define multiple, comma-separated paths to directories from
-  which the modules will be loaded using the `--query-modules-directory` flag.
-* Added support for programatically reading in data from CSV files through the
-  `LOAD CSV` clause. We support CSV files with and without a header, the
-  supported dialect being Excel.
-* Added a new flag `--memory-limit` which enables the user to set the maximum total amount of memory
-  memgraph can allocate during its runtime.
-* Added `FREE MEMORY` query which tries to free unusued memory chunks in different parts of storage.
-* Added the memory limit and amount of currently allocated bytes in the result of `SHOW STORAGE INFO` query.
-* Added `QUERY MEMORY LIMIT num (KB|MB)` to Cypher queries which allows you to limit memory allocation for
-  the entire query. It can be added only at the end of the entire Cypher query.
-* Added logs for the different parts of the recovery process. `INFO`, `DEBUG` and `TRACE` level all contain
-  additional information that is printed out while the recovery is in progress.
-
-### Bug Fixes
-
-* Fixed garbage collector by correctly marking the oldest current timestamp
-  after the database was recovered using the durability files.
-* Fixed reloading of the modules with changed result names.
-* Fixed profile query to show the correct name of the ScanAll operator variant.
-
-## v1.3.0
-
-### Breaking Changes
-
-* Added extra information in durability files to support replication, making it
-  incompatible with the durability files generated by older versions of
-  Memgraph. Even though the replication is an Enterprise feature, the files are
-  compatible with the Community version.
-
-### Major Features and Improvements
-
-* Added support for data replication across a cluster of Memgraph instances.
-  Supported instance types are MAIN and REPLICA. Supported replication modes
-  are SYNC (all SYNC REPLICAS have to receive data before the MAIN can commit
-  the transaction), ASYNC (MAIN doesn't care if data is replicated), SYNC WITH
-  TIMEOUT (MAIN will wait for REPLICAS within the given timeout period, after
-  timout, replication isn't aborted but the replication demotes the REPLICA to
-  the ASYNC mode).
-* Added support for query type deduction. Possible query types are `r` (read),
-  `w` (write), `rw` (read-write). The query type is returned as a part of the
-  summary.
-* Improved logging capabilities by introducing granular logging levels. Added
-  new flag, `--log-level`, which specifies the minimum log level that will be
-  printed. E.g., it's possible to print incoming queries or Bolt server states.
-* Added ability to lock the storage data directory by executing the `LOCK DATA
-  DIRECTORY;` query which delays the deletion of the files contained in the
-  data directory. The data directory can be unlocked again by executing the
-  `UNLOCK DATA DIRECTORY;` query.
-
-### Bug Fixes and Other Changes
-
-* Added cleanup of query executions if not in an explicit transaction.
-* Fix RPC dangling reference.
-
-## v1.2.0
-
-### Breaking Changes
-
-* SSL is disabled by default (`--bolt-cert-file` and `--bolt-key-file` are
-  empty). This change might only affect the client connection configuration.
-
-### Major Features and Improvements
-
-* Added support for Bolt v4.0 and v4.1.
-* Added `mgp_networkx.py` as an alternative implementation of NetworkX graph
-  objects, which is useful to use Memgraph data from NetworkX algorithms
-  optimally.
-* Added `nxalg.py` query module as a proxy to NetworkX algorithms.
-* Added plan optimization to use a label-property index where the property is
-  not null. As a result, the query engine, instead of scanning all elements and
-  applying the filter, performs a label-property index lookup when possible.
-
-### Bug Fixes and Other Changes
-
-* Fixed Cypher `ID` function `Null` handling. When the `ID` function receives
-  `Null`, it will also return `Null`.
-* Fixed bug that caused random crashes in SSL communication on platforms
-  that use older versions of OpenSSL (< 1.1) by adding proper multi-threading
-  handling.
-* Fix `DISCARD` message handling. The query is now executed before discarding
-  the results.
-
-## v1.1.0
-
-### Major Features and Improvements
-
-* Properties in nodes and edges are now stored encoded and compressed. This
-  change significantly reduces memory usage. Depending on the specific dataset,
-  total memory usage can be reduced up to 50%.
-* Added support for rescanning query modules. Previously, the query modules
-  directory was scanned only upon startup. Now it is scanned each time the user
-  requests to load a query module. The functions used to load the query modules
-  were renamed to `mg.load()` and `mg.load_all()` (from `mg.reload()` and
-  `mg.reload_all()`).
-* Improved execution performance of queries that have an IN list filter by
-  using label+property indices.
-  Example: `MATCH (n:Label) WHERE n.property IN [] ...`
-* Added support for `ANY` and `NONE` openCypher functions. Previously, only
-  `ALL` and `SINGLE` functions were implemented.
-
-### Bug Fixes and Other Changes
-
-* Fixed invalid paths returned by variable expansion when the starting node and
-  destination node used the same symbol.
-  Example: `MATCH path = (n:Person {name: "John"})-[:KNOWS*]->(n) RETURN path`
-* Improved semantics of `ALL` and `SINGLE` functions to be consistent with
-  openCypher when handling lists with `Null`s.
-* `SHOW CONSTRAINT INFO` now returns property names as a list for unique
-  constraints.
-* Escaped label/property/edgetype names in `DUMP DATABASE` to support names
-  with spaces in them.
-* Fixed handling of `DUMP DATABASE` queries in multi-command transactions
-  (`BEGIN`, ..., `COMMIT`).
-* Fixed handling of various query types in explicit transactions. For example,
-  constraints were allowed to be created in multi-command transactions
-  (`BEGIN`, ..., `COMMIT`) but that isn't a transactional operation and as such
-  can't be allowed in multi-command transactions.
-* Fixed integer overflow bugs in `COUNT`, `LIMIT` and `SKIP`.
-* Fixed integer overflow bugs in weighted shortest path expansions.
-* Fixed various other integer overflow bugs in query execution.
-* Added Marvel Comic Universe tutorial.
-* Added FootballTransfers tutorial.
-
-## v1.0.0
-
-### Major Features and Improvements
-
-* [Enterprise Ed.] Exposed authentication username/rolename regex as a flag
-  (`--auth-user-or-role-name-regex`).
-* [Enterprise Ed.] Improved auth module error handling and added support for
-  relative paths.
-* Added support for Python query modules. This release of Memgraph supports
-  query modules written using the already existing C API and the new Python
-  API.
-* Added support for unique constraints. The unique constraint is created with a
-  label and one or more properties.
-* Implemented support for importing CSV files (`mg_import_csv`). The importer
-  is compatible with the Neo4j batch CSV importer.
-* Snapshot and write-ahead log format changed (backward compatible with v0.50).
-* Vertices looked up by their openCypher ID (`MATCH (n) WHERE ID(n) = ...`)
-  will now find the node in O(logn) instead of O(n).
-* Improved planning of BFS expansion, a faster, specific approach is now
-  favored instead of a ScanAll+Filter operation.
-* Added syntax for limiting memory of `CALL`.
-* Exposed server name that should be used for Bolt handshake as flag
-  (`--bolt-server-name-for-init`).
-* Added several more functions to the query module C API.
-* Implemented a storage locking mechanism that prevents the user from
-  concurrently starting two Memgraph instances with the same data directory.
-
-### Bug Fixes and Other Changes
-
-* [Enterprise Ed.] Fixed a bug that crashed the database when granting
-  privileges to a user.
-* [Enterprise Ed.] Improved Louvain algorithm for community detection.
-* Type of variable expansion is now printed in `EXPLAIN` (e.g. ExpandVariable,
-  STShortestPath, BFSExpand, WeightedShortestPath).
-* Correctly display `CALL` in `EXPLAIN` output.
-* Correctly delimit arguments when printing the signature of a query module.
-* Fixed a planning issue when `CALL` preceded filtering.
-* Fixed spelling mistakes in the storage durability module.
-* Fixed storage GC indices/constraints subtle race condition.
-* Reduced memory allocations in storage API and indices.
-* Memgraph version is now outputted to `stdout` when Memgraph is started.
-* Improved RPM packaging.
-* Reduced number of errors reported in production log when loading query
-  modules.
-* Removed `early access` wording from the Community Offering license.
-
-## v0.50.0
-
-### Breaking Changes
-
-* [Enterprise Ed.] Remove support for Kafka streams.
-* Snapshot and write-ahead log format changed (not backward compatible).
-* Removed support for unique constraints.
-* Label indices aren't created automatically, create them explicitly instead.
-* Renamed several database flags. Please see the configuration file for a list of current flags.
-
-### Major Features and Improvements
-
-* [Enterprise Ed.] Add support for auth module.
-* [Enterprise Ed.] LDAP support migrated to auth module.
-* Implemented new graph storage engine.
-* Add support for disabling properties on edges.
-* Add support for existence constraints.
-* Add support for custom openCypher procedures using a C API.
-* Support loading query modules implementing read-only procedures.
-* Add `CALL <procedure> YIELD <result>` syntax for invoking loaded procedures.
-* Add `CREATE INDEX ON :Label` for creating label indices.
-* Add `DROP INDEX ON :Label` for dropping label indices.
-* Add `DUMP DATABASE` clause to openCypher.
-* Add functions for treating character strings as byte strings.
-
-### Bug Fixes and Other Changes
-
-* Fix several memory management bugs.
-* Reduce memory usage in query execution.
-* Fix bug that crashes the database when `EXPLAIN` is used.
-
-## v0.15.0
-
-### Breaking Changes
-
-* Snapshot and write-ahead log format changed (not backward compatible).
-* `indexInfo()` function replaced with `SHOW INDEX INFO` syntax.
-* Removed support for unique index. Use unique constraints instead.
-* `CREATE UNIQUE INDEX ON :label (property)` replaced with `CREATE CONSTRAINT ON (n:label) ASSERT n.property IS UNIQUE`.
-* Changed semantics for `COUNTER` openCypher function.
-
-### Major Features and Improvements
-
-* [Enterprise Ed.] Add new privilege, `STATS` for accessing storage info.
-* [Enterprise Ed.] LDAP authentication and authorization support.
-* [Enterprise Ed.] Add audit logging feature.
-* Add multiple properties unique constraint which replace unique indices.
-* Add `SHOW STORAGE INFO` feature.
-* Add `PROFILE` clause to openCypher.
-* Add `CREATE CONSTRAINT` clause to openCypher.
-* Add `DROP CONSTRAINT` clause to openCypher.
-* Add `SHOW CONSTRAINT INFO` feature.
-* Add `uniformSample` function to openCypher.
-* Add regex matching to openCypher.
-
-### Bug Fixes and Other Changes
-
-* Fix bug in explicit transaction handling.
-* Fix bug in edge filtering by edge type and destination.
-* Fix bug in query comment parsing.
-* Fix bug in query symbol table.
-* Fix OpenSSL memory leaks.
-* Make authentication case insensitive.
-* Remove `COALESCE` function.
-* Add movie tutorial.
-* Add backpacking tutorial.
-
-## v0.14.0
-
-### Breaking Changes
-
-* Write-ahead log format changed (not backward compatible).
-
-### Major Features and Improvements
-
-* [Enterprise Ed.] Reduce memory usage in distributed usage.
-* Add `DROP INDEX` feature.
-* Improve SSL error messages.
-
-### Bug Fixes and Other Changes
-
-* [Enterprise Ed.] Fix issues with reading and writing in a distributed query.
-* Correctly handle an edge case with unique constraint checks.
-* Fix a minor issue with `mg_import_csv`.
-* Fix an issue with `EXPLAIN`.
-
-## v0.13.0
-
-### Breaking Changes
-
-* Write-ahead log format changed (not backward compatible).
-* Snapshot format changed (not backward compatible).
-
-### Major Features and Improvements
-
-* [Enterprise Ed.] Authentication and authorization support.
-* [Enterprise Ed.] Kafka integration.
-* [Enterprise Ed.] Support dynamic worker addition in distributed.
-* Reduce memory usage and improve overall performance.
-* Add `CREATE UNIQUE INDEX` clause to openCypher.
-* Add `EXPLAIN` clause to openCypher.
-* Add `inDegree` and `outDegree` functions to openCypher.
-* Improve BFS performance when both endpoints are known.
-* Add new `node-label`, `relationship-type` and `quote` options to
-  `mg_import_csv` tool.
-* Reduce memory usage of `mg_import_csv`.
-
-### Bug Fixes and Other Changes
-
-* [Enterprise Ed.] Fix an edge case in distributed index creation.
-* [Enterprise Ed.] Fix issues with Cartesian in distributed queries.
-* Correctly handle large messages in Bolt protocol.
-* Fix issues when handling explicitly started transactions in queries.
-* Allow openCypher keywords to be used as variable names.
-* Revise and make user visible error messages consistent.
-* Improve aborting time consuming execution.
-
-## v0.12.0
-
-### Breaking Changes
-
-* Snapshot format changed (not backward compatible).
-
-### Major Features and Improvements
-
-* Improved Id Cypher function.
-* Added string functions to openCypher (`lTrim`, `left`, `rTrim`, `replace`,
- `reverse`, `right`, `split`, `substring`, `toLower`, `toUpper`, `trim`).
-* Added `timestamp` function to openCypher.
-* Added support for dynamic property access with `[]` operator.
-
-## v0.11.0
-
-### Major Features and Improvements
-
-* [Enterprise Ed.] Improve Cartesian support in distributed queries.
-* [Enterprise Ed.] Improve distributed execution of BFS.
-* [Enterprise Ed.] Dynamic graph partitioner added.
-* Static nodes/edges id generators exposed through the Id Cypher function.
-* Properties on disk added.
-* Telemetry added.
-* SSL support added.
-* `toString` function added.
-
-### Bug Fixes and Other Changes
-
-* Document issues with Docker on OS X.
-* Add BFS and Dijkstra's algorithm examples to documentation.
-
-## v0.10.0
-
-### Breaking Changes
-
-* Snapshot format changed (not backward compatible).
-
-### Major Features and Improvements
-
-* [Enterprise Ed.] Distributed storage and execution.
-* `reduce` and `single` functions added to openCypher.
-* `wShortest` edge expansion added to openCypher.
-* Support packaging RPM on CentOS 7.
-
-### Bug Fixes and Other Changes
-
-* Report an error if updating a deleted element.
-* Log an error if reading info on available memory fails.
-* Fix a bug when `MATCH` would stop matching if a result was empty, but later
-  results still contain data to be matched. The simplest case of this was the
-  query: `UNWIND [1,2,3] AS x MATCH (n :Label {prop: x}) RETURN n`. If there
-  was no node `(:Label {prop: 1})`, then the `MATCH` wouldn't even try to find
-  for `x` being 2 or 3.
-* Report an error if trying to compare a property value with something that
-  cannot be stored in a property.
-* Fix crashes in some obscure cases.
-* Commit log automatically garbage collected.
-* Add minor performance improvements.
-
-## v0.9.0
-
-### Breaking Changes
-
-* Snapshot format changed (not backward compatible).
-* Snapshot configuration flags changed, general durability flags added.
-
-### Major Features and Improvements
-
-* Write-ahead log added.
-* `nodes` and `relationships` functions added.
-* `UNION` and `UNION ALL` is implemented.
-* Concurrent index creation is now enabled.
-
-### Bug Fixes and Other Changes
-
-
-## v0.8.0
-
-### Major Features and Improvements
-
-* CASE construct (without aggregations).
-* Named path support added.
-* Maps can now be stored as node/edge properties.
-* Map indexing supported.
-* `rand` function added.
-* `assert` function added.
-* `counter` and `counterSet` functions added.
-* `indexInfo` function added.
-* `collect` aggregation now supports Map collection.
-* Changed the BFS syntax.
-
-### Bug Fixes and Other Changes
-
-* Use \u to specify 4 digit codepoint and \U for 8 digit
-* Keywords appearing in header (named expressions) keep original case.
-* Our Bolt protocol implementation is now completely compatible with the protocol version 1 specification. (https://boltprotocol.org/v1/)
-* Added a log warning when running out of memory and the `memory_warning_threshold` flag
-* Edges are no longer additionally filtered after expansion.
-
-## v0.7.0
-
-### Major Features and Improvements
-
-* Variable length path `MATCH`.
-* Explicitly started transactions (multi-query transactions).
-* Map literal.
-* Query parameters (except for parameters in place of property maps).
-* `all` function in openCypher.
-* `degree` function in openCypher.
-* User specified transaction execution timeout.
-
-### Bug Fixes and Other Changes
-
-* Concurrent `BUILD INDEX` deadlock now returns an error to the client.
-* A `MATCH` preceeded by `OPTIONAL MATCH` expansion inconsistencies.
-* High concurrency Antlr parsing bug.
-* Indexing improvements.
-* Query stripping and caching speedups.
-
-## v0.6.0
-
-### Major Features and Improvements
-
-* AST caching.
-* Label + property index support.
-* Different logging setup & format.
-
-## v0.5.0
-
-### Major Features and Improvements
-
-* Use label indexes to speed up querying.
-* Generate multiple query plans and use the cost estimator to select the best.
-* Snapshots & Recovery.
-* Abandon old yaml configuration and migrate to gflags.
-* Query stripping & AST caching support.
-
-### Bug Fixes and Other Changes
-
-* Fixed race condition in MVCC. Hints exp+aborted race condition prevented.
-* Fixed conceptual bug in MVCC GC. Evaluate old records w.r.t. the oldest.
-  transaction's id AND snapshot.
-* User friendly error messages thrown from the query engine.
-
-## Build 837
-
-### Bug Fixes and Other Changes
-
-* List indexing supported with preceeding IN (for example in query `RETURN 1 IN [[1,2]][0]`).
-
-## Build 825
-
-### Major Features and Improvements
-
-* RETURN *, count(*), OPTIONAL MATCH, UNWIND, DISTINCT (except DISTINCT in aggregate functions), list indexing and slicing, escaped labels, IN LIST operator, range function.
-
-### Bug Fixes and Other Changes
-
-* TCP_NODELAY -> import should be faster.
-* Clear hint bits.
-
-## Build 783
-
-### Major Features and Improvements
-
-* SKIP, LIMIT, ORDER BY.
-* Math functions.
-* Initial support for MERGE clause.
-
-### Bug Fixes and Other Changes
-
-* Unhandled Lock Timeout Exception.
-
-## Build 755
-
-### Major Features and Improvements
-
-* MATCH, CREATE, WHERE, SET, REMOVE, DELETE.
+All the updates to the Change Log can be made in the following repository:
+https://github.com/memgraph/docs

CMakeLists.txt

@@ -35,13 +35,14 @@ else()
   message(FATAL_ERROR "Couldn't find clang and/or clang++!")
 endif()
 
-option(BUILD_FOR_DOCKER "Build Memgraph binary for docker." OFF)
-message(STATUS "BUILD_FOR_DOCKER: ${BUILD_FOR_DOCKER}")
-
 # -----------------------------------------------------------------------------
 
 project(memgraph)
 
+# Install licenses.
+install(DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR}/licenses/
+        DESTINATION share/doc/memgraph)
+
 # For more information about how to release a new version of Memgraph, see
 # `release/README.md`.
 
@@ -61,21 +62,21 @@ set(MEMGRAPH_OVERRIDE_VERSION_SUFFIX "")
 
 # Variables used to generate the versions.
 if (MG_ENTERPRISE)
-  set(get_version_enterprise "--enterprise")
+  set(get_version_offering "")
 else()
-  set(get_version_enterprise "")
+  set(get_version_offering "--open-source")
 endif()
-set(get_version_script "${CMAKE_SOURCE_DIR}/release/get_version.py")
+set(get_version_script "${CMAKE_CURRENT_SOURCE_DIR}/release/get_version.py")
 
 # Get version that should be used in the binary.
 execute_process(
     OUTPUT_VARIABLE MEMGRAPH_VERSION
     RESULT_VARIABLE MEMGRAPH_VERSION_RESULT
-    COMMAND "${get_version_script}" ${get_version_enterprise}
+    COMMAND "${get_version_script}" ${get_version_offering}
                 "${MEMGRAPH_OVERRIDE_VERSION}"
                 "${MEMGRAPH_OVERRIDE_VERSION_SUFFIX}"
                 "--memgraph-root-dir"
-                "${CMAKE_SOURCE_DIR}"
+                "${CMAKE_CURRENT_SOURCE_DIR}"
 )
 if(MEMGRAPH_VERSION_RESULT AND NOT MEMGRAPH_VERSION_RESULT EQUAL 0)
     message(FATAL_ERROR "Unable to get Memgraph version.")
@@ -87,12 +88,12 @@ endif()
 execute_process(
     OUTPUT_VARIABLE MEMGRAPH_VERSION_DEB
     RESULT_VARIABLE MEMGRAPH_VERSION_DEB_RESULT
-    COMMAND "${get_version_script}" ${get_version_enterprise}
+    COMMAND "${get_version_script}" ${get_version_offering}
                 --variant deb
                 "${MEMGRAPH_OVERRIDE_VERSION}"
                 "${MEMGRAPH_OVERRIDE_VERSION_SUFFIX}"
                 "--memgraph-root-dir"
-                "${CMAKE_SOURCE_DIR}"
+                "${CMAKE_CURRENT_SOURCE_DIR}"
 )
 if(MEMGRAPH_VERSION_DEB_RESULT AND NOT MEMGRAPH_VERSION_DEB_RESULT EQUAL 0)
     message(FATAL_ERROR "Unable to get Memgraph DEB version.")
@@ -104,12 +105,12 @@ endif()
 execute_process(
     OUTPUT_VARIABLE MEMGRAPH_VERSION_RPM
     RESULT_VARIABLE MEMGRAPH_VERSION_RPM_RESULT
-    COMMAND "${get_version_script}" ${get_version_enterprise}
+    COMMAND "${get_version_script}" ${get_version_offering}
                 --variant rpm
                 "${MEMGRAPH_OVERRIDE_VERSION}"
                 "${MEMGRAPH_OVERRIDE_VERSION_SUFFIX}"
                 "--memgraph-root-dir"
-                "${CMAKE_SOURCE_DIR}"
+                "${CMAKE_CURRENT_SOURCE_DIR}"
 )
 if(MEMGRAPH_VERSION_RPM_RESULT AND NOT MEMGRAPH_VERSION_RPM_RESULT EQUAL 0)
     message(FATAL_ERROR "Unable to get Memgraph RPM version.")
@@ -183,7 +184,8 @@ set(CMAKE_CXX_STANDARD_REQUIRED ON)
 set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wall \
     -Werror=switch -Werror=switch-bool -Werror=return-type \
     -Werror=return-stack-address \
-    -Wno-c99-designator")
+    -Wno-c99-designator \
+    -DBOOST_ASIO_USE_TS_EXECUTOR_AS_DEFAULT")
 
 # Don't omit frame pointer in RelWithDebInfo, for additional callchain debug.
 set(CMAKE_CXX_FLAGS_RELWITHDEBINFO
@@ -203,6 +205,8 @@ set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -fuse-ld=gold")
 # release flags
 set(CMAKE_CXX_FLAGS_RELEASE "-O2 -DNDEBUG")
 
+SET(CMAKE_CXX_LINK_FLAGS "${CMAKE_CXX_LINK_FLAGS} -pthread")
+
 #debug flags
 set(PREFERRED_DEBUGGER "gdb" CACHE STRING
     "Tunes the debug output for your preferred debugger (gdb or lldb).")
@@ -227,6 +231,8 @@ endif()
 message(STATUS "CMake build type: ${CMAKE_BUILD_TYPE}")
 # -----------------------------------------------------------------------------
 
+set(MG_ARCH "x86_64" CACHE STRING "Host architecture to build Memgraph on. Supported values are x86_64 (default), ARM64.")
+
 # setup external dependencies -------------------------------------------------
 
 # threading
@@ -265,7 +271,11 @@ if (MG_ENTERPRISE)
   add_definitions(-DMG_ENTERPRISE)
 endif()
 
+set(ENABLE_JEMALLOC ON)
+
 if (ASAN)
+  message(WARNING "Disabling jemalloc as it doesn't work well with ASAN")
+  set(ENABLE_JEMALLOC OFF)
   # Enable Addres sanitizer and get nicer stack traces in error messages.
   # NOTE: AddressSanitizer uses llvm-symbolizer binary from the Clang
   # distribution to symbolize the stack traces (note that ideally the
@@ -317,7 +327,8 @@ if (UBSAN)
   # To make the program abort on undefined behavior, use UBSAN_OPTIONS=halt_on_error=1.
 endif()
 
-set(MG_PYTHON_VERSION "" CACHE STRING "Specify the exact python version used by the query modules")
+set(MG_PYTHON_VERSION "" CACHE STRING "Specify the exact Python version used by the query modules")
+set(MG_PYTHON_PATH "" CACHE STRING "Specify the exact Python path used by the query modules")
 
 # Add subprojects
 include_directories(src)
@@ -326,8 +337,13 @@ add_subdirectory(src)
 # Release configuration
 add_subdirectory(release)
 
-enable_testing()
-add_subdirectory(tests)
+option(MG_ENABLE_TESTING "Set this to OFF to disable building test binaries" ON)
+message(STATUS "MG_ENABLE_TESTING: ${MG_ENABLE_TESTING}")
+
+if (MG_ENABLE_TESTING)
+  enable_testing()
+  add_subdirectory(tests)
+endif()
 
 if(TOOLS)
   add_subdirectory(tools)
@@ -336,3 +352,7 @@ endif()
 if(QUERY_MODULES)
   add_subdirectory(query_modules)
 endif()
+
+install(FILES ${CMAKE_BINARY_DIR}/bin/mgconsole
+  PERMISSIONS OWNER_EXECUTE OWNER_READ OWNER_WRITE GROUP_READ GROUP_EXECUTE WORLD_READ WORLD_EXECUTE
+  TYPE BIN)

CODEOWNERS

@@ -1,4 +0,0 @@
-/docs/ @gitbuda
-/src/communication/ @antonio2368
-/src/query/ @the-joksim
-/src/storage/ @antonio2368

CODE_OF_CONDUCT.md

@@ -0,0 +1,127 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our
+community a harassment-free experience for everyone, regardless of age, body
+size, visible or invisible disability, ethnicity, sex characteristics, gender
+identity and expression, level of experience, education, socio-economic status,
+nationality, personal appearance, race, caste, color, religion, or sexual
+identity and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming,
+diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our
+community include:
+
+- Demonstrating empathy and kindness toward other people
+- Being respectful of differing opinions, viewpoints, and experiences
+- Giving and gracefully accepting constructive feedback
+- Accepting responsibility and apologizing to those affected by our mistakes,
+  and learning from the experience
+- Focusing on what is best not just for us as individuals, but for the overall
+  community
+
+Examples of unacceptable behavior include:
+
+- The use of sexualized language or imagery, and sexual attention or advances of
+  any kind
+- Trolling, insulting or derogatory comments, and personal or political attacks
+- Public or private harassment
+- Publishing other's private information, such as a physical or email address,
+  without their explicit permission
+- Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of
+acceptable behavior and will take appropriate and fair corrective action in
+response to any behavior that they deem inappropriate, threatening, offensive,
+or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject
+comments, commits, code, wiki edits, issues, and other contributions that are
+not aligned to this Code of Conduct, and will communicate reasons for moderation
+decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when
+an individual is officially representing the community in public spaces.
+Examples of representing our community include using an official e-mail address,
+posting via an official social media account, or acting as an appointed
+representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported to the community leaders responsible for enforcement at
+[contact@memgraph.com](contact@memgraph.com). All complaints will be reviewed
+and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the
+reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining
+the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed
+unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing
+clarity around the nature of the violation and an explanation of why the
+behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series of
+actions.
+
+**Consequence**: A warning with consequences for continued behavior. No
+interaction with the people involved, including unsolicited interaction with
+those enforcing the Code of Conduct, for a specified period of time. This
+includes avoiding interactions in community spaces as well as external channels
+like social media. Violating these terms may lead to a temporary or permanent
+ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including
+sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public
+communication with the community for a specified period of time. No public or
+private interaction with the people involved, including unsolicited interaction
+with those enforcing the Code of Conduct, is allowed during this period.
+Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community
+standards, including sustained inappropriate behavior, harassment of an
+individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within the
+community.
+
+## Attribution
+
+This Code of Conduct is adapted from the Contributor Covenant, version 2.1,
+available at
+[https://www.contributor-covenant.org/version/2/1/code_of_conduct.html](https://www.contributor-covenant.org/version/2/1/code_of_conduct.html).
+
+Community Impact Guidelines were inspired by [Mozilla's code of conduct
+enforcement ladder][mozilla coc].
+
+For answers to common questions about this code of conduct, see the FAQ at
+[https://www.contributor-covenant.org/faq](https://www.contributor-covenant.org/faq).
+Translations are available at
+[https://www.contributor-covenant.org/translations](https://www.contributor-covenant.org/translations).

CONTRIBUTING.md

@@ -0,0 +1,121 @@
+# How to contribute?
+
+This is a general purpose guide for contributing to Memgraph. We're still
+working out the kinks to make contributing to this project as easy and
+transparent as possible, but we're not quite there yet. Hopefully, this document
+makes the process for contributing clear and answers some questions that you may
+have.
+
+- [How to contribute?](#how-to-contribute)
+  - [Open development](#open-development)
+  - [Branch organization](#branch-organization)
+  - [Bugs & changes](#bugs--changes)
+    - [Where to find known issues?](#where-to-find-known-issues)
+    - [Proposing a change](#proposing-a-change)
+    - [Your first pull request](#your-first-pull-request)
+    - [Sending a pull request](#sending-a-pull-request)
+    - [Style guide](#style-guide)
+  - [How to get in touch?](#how-to-get-in-touch)
+  - [Code of Conduct](#code-of-conduct)
+  - [License](#license)
+  - [Attribution](#attribution)
+
+## Open development
+
+All work on Memgraph is done via [GitHub](https://github.com/memgraph/memgraph).
+Both core team members and external contributors send pull requests which go
+through the same review process.
+
+## Branch organization
+
+Most pull requests should target the [`master
+branch`](https://github.com/memgraph/memgraph/tree/master). We only use separate
+branches for developing new features and fixing bugs before they are merged with
+`master`. We do our best to keep `master` in good shape, with all tests passing.
+
+Code that lands in `master` must be compatible with the latest stable release.
+It may contain additional features but no breaking changes if it's not
+absolutely necessary. We should be able to release a new minor version from the
+tip of `master` at any time.
+
+## Bugs & changes
+
+### Where to find known issues?
+
+We are using [GitHub Issues](https://github.com/memgraph/memgraph/issues) for
+our public bugs. We keep a close eye on this and try to make it clear when we
+have an internal fix in progress. Before filing a new task, try to make sure
+your problem doesn't already exist.
+
+### Proposing a change
+
+If you intend to change the public API, or make any non-trivial changes to the
+implementation, we recommend [filing an
+issue](https://github.com/memgraph/memgraph/issues/new). This lets us reach an
+agreement on your proposal before you put significant effort into it.
+
+If you're only fixing a bug, it's fine to submit a pull request right away but
+we still recommend to file an issue detailing what you're fixing. This is
+helpful in case we don't accept that specific fix but want to keep track of the
+issue.
+
+### Your first pull request
+
+Working on your first Pull Request? You can learn how from this free video
+series:
+
+**[How to Contribute to an Open Source Project on
+GitHub](https://app.egghead.io/courses/how-to-contribute-to-an-open-source-project-on-github)**
+
+If you decide to fix an issue, please be sure to check the comment thread in
+case somebody is already working on a fix. If nobody is working on it at the
+moment, please leave a comment stating that you intend to work on it so other
+people don't accidentally duplicate your effort.
+
+If somebody claims an issue but doesn't follow up for more than two weeks, it's
+fine to take it over but you should still leave a comment.
+
+### Sending a pull request
+
+The core team is monitoring for pull requests. We will review your pull request
+and either merge it, request changes to it, or close it with an explanation.
+**Before submitting a pull request,** please make sure the following is done:
+
+1. Fork [the repository](https://github.com/memgraph/memgraph) and create your
+   branch from `master`.
+2. If you've fixed a bug or added code that should be tested, add tests!
+3. Use the formatter `clang-format` for C/C++ code and `flake8` for Python code.
+   `clang-format` will automatically detect the `.clang-format` file in the root
+   directory while `flake8` can be used with the default configuration.
+
+### Style guide
+
+Memgraph uses the [Google Style
+Guide](https://google.github.io/styleguide/cppguide.html) for C++ in most of its
+code. You should follow them whenever writing new code.
+
+## How to get in touch?
+
+Aside from communicating directly via Pull Requests and Issues, the Memgraph
+Community [Discord Server](https://discord.gg/memgraph) is the best place for
+conversing with project maintainers and other community members.
+
+## [Code of Conduct](https://github.com/memgraph/memgraph/blob/master/CODE_OF_CONDUCT.md)
+
+Memgraph has adopted the [Contributor
+Covenant](https://www.contributor-covenant.org/) as its Code of Conduct, and we
+expect project participants to adhere to it. Please read [the full
+text](https://github.com/memgraph/memgraph/blob/master/CODE_OF_CONDUCT.md) so
+that you can understand what actions will and will not be tolerated.
+
+## License
+
+By contributing to Memgraph, you agree that your contributions will be licensed
+under the [Memgraph licensing
+scheme](https://github.com/memgraph/memgraph/blob/master/LICENSE).
+
+## Attribution
+
+This Contributing guide is adapted from the **React.js Contributing guide**
+available at
+[https://reactjs.org/docs/how-to-contribute.html](https://reactjs.org/docs/how-to-contribute.html).

LICENSE

@@ -0,0 +1,5 @@
+Source code in this repository is variously licensed under the Business Source
+License 1.1 (BSL), the Memgraph Enterprise License (MEL). A copy of each licence
+can be found in the licences directory. Source code in a given file is licensed
+under the BSL and the copyright belongs to The Memgraph Authors unless
+otherwise noted at th beginning of the file.

README.md

@@ -1,21 +1,148 @@
-# Memgraph
+<p align="center">
+<img width="400px" src="https://uploads-ssl.webflow.com/5e7ceb09657a69bdab054b3a/5e7ceb09657a6937ab054bba_Black_Original%20_Logo.png">
+</p>
 
-Memgraph is an ACID compliant high performance transactional distributed
-in-memory graph database featuring runtime native query compiling, lock free
-data structures, multi-version concurrency control and asynchronous IO.
+---
 
-## Development Documentation
+<p align="center">
+Build modern, graph-based applications on top of your streaming data in minutes.
+</p>
 
-Please continue in
-[Notion](https://www.notion.so/memgraph/memgraph-0428591638604c8385550e214ea9f3e6).
+<p align="center">
+  <a href="https://github.com/memgraph/memgraph/blob/master/licenses/APL.txt">
+    <img src="https://img.shields.io/badge/license-APL-green" alt="license" title="license"/>
+  </a>
+  <a href="https://github.com/memgraph/memgraph/blob/master/licenses/BSL.txt">
+    <img src="https://img.shields.io/badge/license-BSL-yellowgreen" alt="license" title="license"/>
+  </a>
+  <a href="https://github.com/memgraph/memgraph/blob/master/licenses/MEL.txt" alt="Documentation">
+    <img src="https://img.shields.io/badge/license-MEL-yellow" alt="license" title="license"/>
+  </a>
+</p>
 
-## User Documentation
+<p align="center">
+  <a href="https://github.com/memgraph/memgraph">
+    <img src="https://img.shields.io/github/workflow/status/memgraph/memgraph/Release%20Ubuntu%2020.04/master" alt="build" title="build"/>
+  </a>
+  <a href="https://memgraph.com/docs/" alt="Documentation">
+    <img src="https://img.shields.io/badge/documentation-Memgraph-orange" />
+  </a>
+</p>
 
-Memgraph user documentation is maintained within
-[docs](https://github.com/memgraph/docs) repository. The documentation is also
-available on [GitBook](https://docs.memgraph.com).
+<p align="center">
+  <a href="https://memgr.ph/join-discord">
+    <img src="https://img.shields.io/badge/Discord-7289DA?style=for-the-badge&logo=discord&logoColor=white" alt="Discord"/>
+  </a>
+</p>
 
-## Licences
+## :clipboard: Description
 
-* [Community](release/LICENSE_COMMUNITY.md)
-* [Enterprise](release/LICENSE_ENTERPRISE.md)
+Memgraph is a streaming graph application platform that helps you wrangle your
+streaming data, build sophisticated models that you can query in real-time, and
+develop graph applications.
+
+Memgraph directly connects to your streaming infrastructure. You can ingest data
+from sources like Kafka, SQL, or plain CSV files. Memgraph provides a standard
+interface to query your data with Cypher, a widely-used and declarative query
+language that is easy to write, understand and optimize for performance. This is
+achieved by using the property graph data model, which stores data in terms of
+objects, their attributes, and the relationships that connect them. This is a
+natural and effective way to model many real-world problems without relying on
+complex SQL schemas.
+
+Memgraph is implemented in C/C++ and leverages an in-memory first architecture
+to ensure that you’re getting the best possible performance consistently and
+without surprises. It’s also ACID-compliant and highly available.
+
+## :video_game: Memgraph Playground
+
+You don't need to install anything to try out Memgraph. Check out 
+our **[Memgraph Playground](https://playground.memgraph.com/)** sandboxes in 
+your browser.
+
+<p align="left">
+  <a href="https://playground.memgraph.com/">
+    <img width="450px" alt="Memgraph Playground" src="https://download.memgraph.com/asset/github/memgraph/memgraph-playground.png">
+  </a>
+</p>
+
+## :floppy_disk: Download & Install
+
+### Windows
+
+[![Windows](https://img.shields.io/badge/Windows-Docker-0078D6?style=for-the-badge&logo=windows&logoColor=white)](https://memgraph.com/docs/memgraph/install-memgraph-on-windows-docker)
+[![Windows](https://img.shields.io/badge/Windows-WSL-0078D6?style=for-the-badge&logo=windows&logoColor=white)](https://memgraph.com/docs/memgraph/install-memgraph-on-windows-wsl)
+
+### macOS
+
+[![macOS](https://img.shields.io/badge/macOS-Docker-000000?style=for-the-badge&logo=macos&logoColor=F0F0F0)](https://memgraph.com/docs/memgraph/install-memgraph-on-macos-docker)
+
+### Linux
+
+[![Linux](https://img.shields.io/badge/Linux-Docker-FCC624?style=for-the-badge&logo=linux&logoColor=black)](https://memgraph.com/docs/memgraph/install-memgraph-on-linux-docker)
+[![Debian](https://img.shields.io/badge/Debian-D70A53?style=for-the-badge&logo=debian&logoColor=white)](https://memgraph.com/docs/memgraph/install-memgraph-on-debian)
+[![Ubuntu](https://img.shields.io/badge/Ubuntu-E95420?style=for-the-badge&logo=ubuntu&logoColor=white)](https://memgraph.com/docs/memgraph/install-memgraph-on-ubuntu)
+[![Cent
+OS](https://img.shields.io/badge/cent%20os-002260?style=for-the-badge&logo=centos&logoColor=F0F0F0)](https://memgraph.com/docs/memgraph/install-memgraph-from-rpm)
+
+You can find the binaries and Docker images on the [Download
+Hub](https://memgraph.com/download) and the installation instructions in the
+[official documentation](https://memgraph.com/docs/memgraph/installation).
+
+## :zap: Features
+
+- Run Python, Rust, and C/C++ code natively, check out the
+  [MAGE](https://github.com/memgraph/mage) graph algorithm library
+- Native support for machine learning
+- Streaming support
+- Replication
+- Authentication and authorization
+- ACID compliance
+
+## :bookmark_tabs: Documentation
+
+The Memgraph documentation is available at
+[memgraph.com/docs](https://memgraph.com/docs).
+
+## :question: Configuration
+
+Command line options that Memgraph accepts are available in the [reference
+guide](https://memgraph.com/docs/memgraph/reference-guide/configuration).
+
+## :trophy: Contributing
+
+The main purpose of this repository is to continue evolving Memgraph, making it
+faster and easier to use. Development of Memgraph happens in the open on GitHub,
+and we are grateful to the community for contributing bug fixes and
+improvements. Read below to learn how you can take part in improving Memgraph.
+
+### Code of Conduct
+
+Memgraph has adopted a Code of Conduct that we expect project participants to
+adhere to. Please read [the full text](CODE_OF_CONDUCT.md) so that you can
+understand what actions will and will not be tolerated.
+
+### Contributing Guide
+
+Read our [contributing guide](CONTRIBUTING.md) to learn about our development
+process and how to propose bug fixes and improvements.
+
+### Internals
+
+Read our
+[internal](https://memgraph.notion.site/Memgraph-Internals-12b69132d67a417898972927d6870bd2)
+docs to learn more about Memgraph's architecture, how to build the project from
+source and how to start contributing. All information related to the database,
+can be found in the aforementioned docs.
+
+### :scroll: License
+
+Memgraph Community is available under the [BSL
+license](./licenses/BSL.txt).</br> Memgraph Enterprise is available under the
+[MEL license](./licenses/MEL.txt).
+
+<p align="center">
+  <a href="#">
+    <img src="https://img.shields.io/badge/⬆️back_to_top_⬆️-white" alt="Back to top" title="Back to top"/>
+  </a>
+</p>

cmake/FindJemalloc.cmake

@@ -0,0 +1,55 @@
+# Try to find jemalloc library
+#
+# Use this module as:
+#   find_package(Jemalloc)
+#
+# or:
+#   find_package(Jemalloc REQUIRED)
+#
+# This will define the following variables:
+#
+#   Jemalloc_FOUND           True if the system has the jemalloc library.
+#   Jemalloc_INCLUDE_DIRS    Include directories needed to use jemalloc.
+#   Jemalloc_LIBRARIES       Libraries needed to link to jemalloc.
+#
+# The following cache variables may also be set:
+#
+# Jemalloc_INCLUDE_DIR     The directory containing jemalloc/jemalloc.h.
+# Jemalloc_LIBRARY         The path to the jemalloc static library.
+
+find_path(Jemalloc_INCLUDE_DIR NAMES jemalloc/jemalloc.h PATH_SUFFIXES include)
+
+find_library(Jemalloc_LIBRARY NAMES libjemalloc.a PATH_SUFFIXES lib)
+
+include(FindPackageHandleStandardArgs)
+find_package_handle_standard_args(Jemalloc
+  FOUND_VAR Jemalloc_FOUND
+  REQUIRED_VARS
+    Jemalloc_LIBRARY
+    Jemalloc_INCLUDE_DIR
+)
+
+if(Jemalloc_FOUND)
+  set(Jemalloc_LIBRARIES ${Jemalloc_LIBRARY})
+  set(Jemalloc_INCLUDE_DIRS ${Jemalloc_INCLUDE_DIR})
+else()
+  if(Jemalloc_FIND_REQUIRED)
+    message(FATAL_ERROR "Cannot find jemalloc!")
+  else()
+    message(WARNING "jemalloc is not found!")
+  endif()
+endif()
+
+if(Jemalloc_FOUND AND NOT TARGET Jemalloc::Jemalloc)
+  add_library(Jemalloc::Jemalloc UNKNOWN IMPORTED)
+  set_target_properties(Jemalloc::Jemalloc
+    PROPERTIES
+      IMPORTED_LOCATION "${Jemalloc_LIBRARY}"
+      INTERFACE_INCLUDE_DIRECTORIES "${Jemalloc_INCLUDE_DIR}"
+  )
+endif()
+
+mark_as_advanced(
+  Jemalloc_INCLUDE_DIR
+  Jemalloc_LIBRARY
+)

config/flags.yaml

@@ -47,6 +47,14 @@ modifications:
     value: ""
     override: false
 
+  - name: "bolt_cert_file"
+    value: "/etc/memgraph/ssl/cert.pem"
+    override: false
+
+  - name: "bolt_key_file"
+    value: "/etc/memgraph/ssl/key.pem"
+    override: false
+
   - name: "storage_properties_on_edges"
     value: "true"
     override: true
@@ -85,7 +93,15 @@ modifications:
 
   - name: "memory_limit"
     value: "0"
-    override: true 
+    override: true
+
+  - name: "isolation_level"
+    value: "SNAPSHOT_ISOLATION"
+    override: true
+
+  - name: "allow_load_csv"
+    value: "true"
+    override: false
 
 undocumented:
   - "flag_file"
@@ -93,3 +109,5 @@ undocumented:
   - "help"
   - "help_xml"
   - "version"
+  - "organization_name"
+  - "license_key"

docs/csv-import-tool/README.md

@@ -0,0 +1,204 @@
+# CSV Import Tool Documentation
+
+CSV is a universal and very versatile data format used to store large quantities
+of data.  Each Memgraph database instance has a CSV import tool installed called
+`mg_import_csv`.  The CSV import tool should be used for initial bulk ingestion
+of data into the database.  Upon ingestion, the CSV importer creates a snapshot
+that will be used by the database to recover its state on its next startup.
+
+If you are already familiar with the Neo4j bulk import tool, then using the
+`mg_import_csv` tool should be easy.  The CSV import tool is fully compatible
+with the [Neo4j CSV
+format](https://neo4j.com/docs/operations-manual/current/tools/import/). If you
+already have a pipeline set-up for Neo4j, you should only replace `neo4j-admin
+import` with `mg_import_csv`.
+
+## CSV File Format
+
+Each row of a CSV file represents a single entry that should be imported into
+the database.  Both nodes and relationships can be imported into the database
+using CSV files.
+
+Each set of CSV files must have a header that describes the data that is stored
+in the CSV files. Each field in the CSV header is in the format
+`<name>[:<type>]` which identifies the name that should be used for that column
+and the type that should be used for that column. The type is optional and
+defaults to `string` (see the following chapter).
+
+Each CSV field must be divided using the delimiter and each CSV field can either
+be quoted or unquoted. When the field is quoted, the first and last character in
+the field *must* be the quote character. If the field isn't quoted, and a quote
+character appears in it, it is treated as a regular character. If a quote
+character appears inside a quoted string then the quote character must be
+doubled in order to escape it. Line feeds and carriage returns are ignored in
+the CSV file, also, the file can't contain a NULL character.
+
+## Properties
+
+Both nodes and relationships can have properties added to them.  When importing
+properties, the CSV importer uses the name specified in the header of the
+corresponding CSV column for the name of the property.  A property is designated
+by specifying one of the following types in the header:
+ - `integer`, `int`, `long`, `byte`, `short`: creates an integer property
+ - `float`, `double`: creates a float property
+ - `boolean`, `bool`: creates a boolean property
+ - `string`, `char`: creates a string property
+
+When importing a boolean value, the CSV field should contain exactly the text
+`true` to import a `True` boolean value.  All other text values are treated as a
+boolean value `False`.
+
+If you want to import an array of values, you can do so by appending `[]` to any
+of the above types.  The values of the array are then determined by splitting
+the raw CSV value using the array delimiter character.
+
+Assuming that the array delimiter is `;`, the following example:
+```plaintext
+first_name,last_name:string,number:integer,aliases:string[]
+John,Doe,1,Johnny;Jo;J-man
+Melissa,Doe,2,Mel
+```
+
+Will yield these results:
+```plaintext
+CREATE ({first_name: "John", last_name: "Doe", number: 1, aliases: ["Johnny", "Jo", "J-man"]});
+CREATE ({first_name: "Melissa", last_name: "Doe", number: 2, aliases: ["Mel"]});
+```
+### Nodes
+
+When importing nodes, several more types can be specified in the header of the
+CSV file (along with all property types):
+ - `ID`: id of the node that should be used as the node ID when importing
+   relationships
+ - `LABEL`: designates that the field contains additional labels for the node
+ - `IGNORE`: designates that the field should be ignored
+
+The `ID` field type sets the internal ID that will be used for the node when
+creating relationships.  It is optional and nodes that don't have an ID value
+specified will be imported, but can't be connected to any relationships.  If you
+want to save the ID value as a property in the database, just specify a name for
+the ID (`user_id:ID`).  If you just want to use the ID during the import, leave
+out the name of the field (`:ID`).  The `ID` field also supports creating
+separate ID spaces.  The ID space is specified with the ID space name appended
+to the `ID` type in parentheses (`ID(user)`).  That allows you to have the same
+IDs (by value) for multiple different node files (for example, numbers from 1 to
+N).  The IDs in each ID space will be treated as an independent set of IDs that
+don't interfere with IDs in another ID space.
+
+The `LABEL` field type adds additional labels to the node.  The value is treated
+as an array type so that multiple additional labels can be specified for each
+node.  The value is split using the array delimiter (`--array-delimiter` flag).
+
+### Relationships
+
+In order to be able to import relationships, you must import the nodes in the
+same invocation of `mg_import_csv` that is used to import the relationships.
+
+When importing relationships, several more types can be specified in the header
+of the CSV file (along with all property types):
+ - `START_ID`: id of the start node that should be connected with the
+   relationship
+ - `END_ID`: id of the end node that should be connected with the relationship
+ - `TYPE`: designates the type of the relationship
+ - `IGNORE`: designates that the field should be ignored
+
+The `START_ID` field type sets the start node that should be connected with the
+relationship to the end node.  The field *must* be specified and the node ID
+must be one of the node IDs that were specified in the node CSV files.  The name
+of this field is ignored.  If the node ID is in an ID space, you can specify the
+ID space for the in the same way as for the node ID (`START_ID(user)`).
+
+The `END_ID` field type sets the end node that should be connected with the
+relationship to the start node.  The field *must* be specified and the node ID
+must be one of the node IDs that were specified in the node CSV files.  The name
+of this field is ignored.  If the node ID is in an ID space, you can specify the
+ID space for the in the same way as for the node ID (`END_ID(user)`).
+
+The `TYPE` field type sets the type of the relationship.  Each relationship
+*must* have a relationship type, but it doesn't necessarily need to be specified
+in the CSV file, it can also be set externally for the whole CSV file.  The name
+of this field is ignored.
+
+## CSV Importer Flags
+
+The importer has many command line options that allow you to customize the way
+the importer loads your data.
+
+The two main flags that are used to specify the input CSV files are `--nodes`
+and `--relationships`. Basic description of these flags is provided in the table
+and more detailed explainion can be found further down bellow.
+
+
+| Flag                  | Description  |
+|-----------------------| -------------- |
+|`--nodes`                | Used to specify CSV files that contain the nodes to the importer. |
+|`--relationships`        |  Used to specify CSV files that contain the relationships to the importer.|
+|`--delimiter`            | Sets the delimiter that should be used when splitting the CSV fields (default `,`)|
+|`--quote`                | Sets the quote character that should be used to quote a CSV field (default `"`)|
+|`--array-delimiter`      | Sets the delimiter that should be used when splitting array values (default `;`)|
+|`--id-type`              | Specifies which data type should be used to store the supplied <br /> node IDs when storing them as properties (if the field name is supplied). <br /> The supported values are either `STRING` or `INTEGER`. (default `STRING`)|
+|`--ignore-empty-strings` | Instructs the importer to treat all empty strings as `Null` values  <br /> instead of an empty string value (default `false`)|
+|`--ignore-extra-columns` | Instructs the importer to ignore all columns (instead of raising an error) <br /> that aren't specified after the last specified column in the CSV header. (default `false`) |
+| `--skip-bad-relationships`| Instructs the importer to ignore all relationships (instead of raising an error) <br /> that refer to nodes that don't exist in the node files. (default `false`) |
+|`--skip-duplicate-nodes`  | Instructs the importer to ignore all duplicate nodes (instead of raising an error).  <br /> Duplicate nodes are nodes that have an ID that is the same as another node that was already imported. (default `false`) |
+| `--trim-strings`| Instructs the importer to trim all of the loaded CSV field values before processing them further. <br /> Trimming the fields removes all leading and trailing whitespace from them. (default `false`) |
+
+The `--nodes` and  `--relationships` flags are used to specify CSV files that
+contain the nodes and relationships to the importer.  Multiple files can be
+specified in each supplied `--nodes` or `--relationships` flag. Files that are
+supplied in one `--nodes` or `--relationships` flag are treated by the CSV
+parser as one big CSV file.  Only the first line of the first file is parsed for
+the CSV header, all other files (and rows) are treated as data.  This is useful
+when you have a very large CSV file and don't want to edit its first line just
+to add a CSV header.  Instead, you can specify the header in a separate file
+(e.g. `users_header.csv` or `friendships_header.csv`) and have the data intact
+in the large file (e.g. `users.csv` or `friendships.csv`).  Also, you can supply
+additional labels for each set of node files.
+
+The format of `--nodes` flag is:
+`[<label>[:<label>]...=]<file>[,<file>][,<file>]...`.  Take note that only the
+first `<file>` part is mandatory, all other parts of the flag value are
+optional. Multiple `--nodes` flags can be supplied to describe multiple sets of
+different node files.  For the importer to work, at least one `--nodes` flag
+*must* be supplied.
+
+The format of `--relationships` flag is: `[<type>=]<file>[,<file>][,<file>]...`.
+Take note that only the first `<file>` part is mandatory, all other parts of the
+flag value are optional.  Multiple `--relationships` flags can be supplied to
+describe multiple sets of different relationship files.  The `--relationships`
+flag isn't mandatory.
+
+## CSV Parser Logic
+
+The CSV parser uses the same logic as the standard Python CSV parser.  The data
+is parsed in the same way as the following snippet:
+
+```python
+import csv
+for row in csv.reader(stream, strict=True):
+    # process 'row'
+```
+
+Python uses 'excel' as the default dialect when parsing CSV files and the
+default settings for the CSV parser are:
+ - delimiter: `','`
+ - doublequote: `True`
+ - escapechar: `None`
+ - lineterminator: `'\r\n'`
+ - quotechar: `'"'`
+ - skipinitialspace: `False`
+
+The above snippet can be expanded to:
+
+```python
+import csv
+for row in csv.reader(stream, delimiter=',', doublequote=True,
+                      escapechar=None, lineterminator='\r\n',
+                      quotechar='"', skipinitialspace=False,
+                      strict=True):
+    # process 'row'
+```
+
+For more information about the meaning of the above values, see:
+https://docs.python.org/3/library/csv.html#csv.Dialect
+

environment/README.md

@@ -1,4 +0,0 @@
-# Memgraph Build and Run Environments
-
-Please continue in
-[Notion](https://www.notion.so/memgraph/Tools-05e0baafb78a49b386e0063b4833d23d).

environment/os/centos-7.sh

@@ -5,18 +5,27 @@ set -Eeuo pipefail
 DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
 source "$DIR/../util.sh"
 
+check_operating_system "centos-7"
+check_architecture "x86_64"
+
 TOOLCHAIN_BUILD_DEPS=(
     coreutils gcc gcc-c++ make # generic build tools
     wget # used for archive download
     gnupg2 # used for archive signature verification
     tar gzip bzip2 xz unzip # used for archive unpacking
     zlib-devel # zlib library used for all builds
-    expat-devel libipt-devel libbabeltrace-devel xz-devel python3-devel # gdb
+    expat-devel libipt libipt-devel libbabeltrace-devel xz-devel python3-devel # gdb
     texinfo # gdb
     libcurl-devel # cmake
+    curl # snappy
     readline-devel # cmake and llvm
     libffi-devel libxml2-devel perl-Digest-MD5 # llvm
     libedit-devel pcre-devel automake bison # swig
+    file
+    openssl-devel
+    gmp-devel
+    gperf
+    patch
 )
 
 TOOLCHAIN_RUN_DEPS=(
@@ -26,10 +35,10 @@ TOOLCHAIN_RUN_DEPS=(
     expat libipt libbabeltrace xz-libs python3 # for gdb
     readline # for cmake and llvm
     libffi libxml2 # for llvm
+    openssl-devel
 )
 
 MEMGRAPH_BUILD_DEPS=(
-    git # source code control
     make pkgconfig # build system
     curl wget # for downloading libs
     libuuid-devel java-11-openjdk # required by antlr
@@ -49,6 +58,7 @@ MEMGRAPH_BUILD_DEPS=(
     doxygen graphviz # source documentation generators
     which mono-complete dotnet-sdk-3.1 golang nodejs zip unzip java-11-openjdk-devel # for driver tests
     autoconf # for jemalloc code generation
+    libtool  # for protobuf code generation
 )
 
 list() {
@@ -94,8 +104,12 @@ install() {
         echo "NOTE: export LANG=en_US.utf8"
     fi
     yum install -y epel-release
+    yum remove -y ius-release
+    yum install -y \
+      https://repo.ius.io/ius-release-el7.rpm
     yum update -y
-    yum install -y wget git python3 python3-pip
+    yum install -y wget python3 python3-pip
+    yum install -y git
     for pkg in $1; do
         if [ "$pkg" == libipt ]; then
             if ! yum list installed libipt >/dev/null 2>/dev/null; then

environment/os/centos-9.sh

@@ -5,38 +5,49 @@ set -Eeuo pipefail
 DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
 source "$DIR/../util.sh"
 
+check_operating_system "centos-9"
+check_architecture "x86_64"
+
 TOOLCHAIN_BUILD_DEPS=(
-    coreutils gcc gcc-c++ make # generic build tools
+    coreutils-common gcc gcc-c++ make # generic build tools
     wget # used for archive download
     gnupg2 # used for archive signature verification
     tar gzip bzip2 xz unzip # used for archive unpacking
     zlib-devel # zlib library used for all builds
-    expat-devel libipt-devel libbabeltrace-devel xz-devel python36-devel texinfo # for gdb
-    libcurl-devel # for cmake
+    expat-devel xz-devel python3-devel texinfo libbabeltrace-devel # for gdb
     readline-devel # for cmake and llvm
     libffi-devel libxml2-devel # for llvm
     libedit-devel pcre-devel automake bison # for swig
+    file
+    openssl-devel
+    gmp-devel
+    gperf
+    diffutils
+    libipt libipt-devel # intel
+    patch
 )
 
 TOOLCHAIN_RUN_DEPS=(
     make # generic build tools
     tar gzip bzip2 xz # used for archive unpacking
     zlib # zlib library used for all builds
-    expat libipt libbabeltrace xz-libs python36 # for gdb
+    expat xz-libs python3 # for gdb
     readline # for cmake and llvm
     libffi libxml2 # for llvm
+    openssl-devel
+    perl # for openssl
 )
 
 MEMGRAPH_BUILD_DEPS=(
     git # source code control
     make pkgconf-pkg-config # build system
-    curl wget # for downloading libs
+    wget # for downloading libs
     libuuid-devel java-11-openjdk # required by antlr
     readline-devel # for memgraph console
-    python36-devel # for query modules
+    python3-devel # for query modules
     openssl-devel
     libseccomp-devel
-    python36 python3-virtualenv python3-pip nmap-ncat # for qa, macro_benchmark and stress tests
+    python3 python3-pip python3-virtualenv nmap-ncat # for qa, macro_benchmark and stress tests
     #
     # IMPORTANT: python3-yaml does NOT exist on CentOS
     # Install it manually using `pip3 install PyYAML`
@@ -45,9 +56,10 @@ MEMGRAPH_BUILD_DEPS=(
     libcurl-devel # mg-requests
     rpm-build rpmlint # for RPM package building
     doxygen graphviz # source documentation generators
-    which mono-complete dotnet-sdk-3.1 nodejs golang zip unzip java-11-openjdk-devel # for driver tests
+    which nodejs golang zip unzip java-11-openjdk-devel # for driver tests
     sbcl # for custom Lisp C++ preprocessing
     autoconf # for jemalloc code generation
+    libtool  # for protobuf code generation
 )
 
 list() {
@@ -63,6 +75,9 @@ check() {
             fi
             continue
         fi
+        if [ "$pkg" == "python3-virtualenv" ]; then
+            continue
+        fi
         if ! yum list installed "$pkg" >/dev/null 2>/dev/null; then
             missing="$pkg $missing"
         fi
@@ -86,12 +101,13 @@ install() {
     else
         echo "NOTE: export LANG=en_US.utf8"
     fi
-    dnf install -y epel-release
-    dnf install -y 'dnf-command(config-manager)'
-    dnf config-manager --set-enabled powertools # Required to install texinfo.
-    dnf update -y
-    dnf install -y wget git python36 python3-pip
+    yum update -y
+    yum install -y wget git python3 python3-pip
     for pkg in $1; do
+        # Since there is no support for libipt-devel for CentOS 9 we install
+        # Fedoras version of same libs, they are the same version but released
+        # for different OS
+        # TODO Update when libipt-devel releases for CentOS 9
         if [ "$pkg" == libipt ]; then
             if ! dnf list installed libipt >/dev/null 2>/dev/null; then
                 dnf install -y http://repo.okay.com.mx/centos/8/x86_64/release/libipt-1.6.1-8.el8.x86_64.rpm
@@ -99,19 +115,14 @@ install() {
             continue
         fi
         if [ "$pkg" == libipt-devel ]; then
-            if ! yum list installed libipt-devel >/dev/null 2>/dev/null; then
+            if ! dnf list installed libipt-devel >/dev/null 2>/dev/null; then
                 dnf install -y http://repo.okay.com.mx/centos/8/x86_64/release/libipt-devel-1.6.1-8.el8.x86_64.rpm
             fi
             continue
         fi
-        # Install GDB dependencies not present in the standard repos.
-        # https://bugs.centos.org/view.php?id=17068
-        # https://centos.pkgs.org
-	    # Since 2020, there is Babeltrace2 (https://babeltrace.org). Not used
-        # within GDB yet (an assumption).
         if [ "$pkg" == libbabeltrace-devel ]; then
             if ! dnf list installed libbabeltrace-devel >/dev/null 2>/dev/null; then
-                dnf install -y http://repo.okay.com.mx/centos/8/x86_64/release/libbabeltrace-devel-1.5.4-2.el8.x86_64.rpm
+                dnf install -y http://mirror.stream.centos.org/9-stream/CRB/x86_64/os/Packages/libbabeltrace-devel-1.5.8-10.el9.x86_64.rpm
             fi
             continue
         fi
@@ -127,15 +138,6 @@ install() {
             fi
             continue
         fi
-        if [ "$pkg" == dotnet-sdk-3.1 ]; then
-            if ! dnf list installed dotnet-sdk-3.1 >/dev/null 2>/dev/null; then
-                wget -nv https://packages.microsoft.com/config/centos/8/packages-microsoft-prod.rpm -O packages-microsoft-prod.rpm
-                rpm -Uvh https://packages.microsoft.com/config/centos/8/packages-microsoft-prod.rpm
-                dnf update -y
-                dnf install -y dotnet-sdk-3.1
-            fi
-            continue
-        fi
         if [ "$pkg" == PyYAML ]; then
             if [ -z ${SUDO_USER+x} ]; then # Running as root (e.g. Docker).
                 pip3 install --user PyYAML
@@ -144,7 +146,17 @@ install() {
             fi
             continue
         fi
-        dnf install -y "$pkg"
+        if [ "$pkg" == python3-virtualenv ]; then
+            if [ -z ${SUDO_USER+x} ]; then # Running as root (e.g. Docker).
+                pip3 install virtualenv
+                pip3 install virtualenvwrapper
+            else # Running using sudo.
+                sudo -H -u "$SUDO_USER" bash -c "pip3 install virtualenv"
+                sudo -H -u "$SUDO_USER" bash -c "pip3 install virtualenvwrapper"
+            fi
+            continue
+        fi
+        yum install -y "$pkg"
     done
 }
 

environment/os/debian-10.sh

@@ -5,6 +5,9 @@ set -Eeuo pipefail
 DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
 source "$DIR/../util.sh"
 
+check_operating_system "debian-10"
+check_architecture "x86_64"
+
 TOOLCHAIN_BUILD_DEPS=(
     coreutils gcc g++ build-essential make # generic build tools
     wget # used for archive download
@@ -15,6 +18,12 @@ TOOLCHAIN_BUILD_DEPS=(
     libcurl4-openssl-dev # for cmake
     libreadline-dev # for cmake and llvm
     libffi-dev libxml2-dev # for llvm
+    curl # snappy
+    file # for libunwind
+    libssl-dev # for libevent
+    libgmp-dev # for gdb
+    gperf # for proxygen
+    git # for fbthrift
     libedit-dev libpcre3-dev automake bison # for swig
 )
 
@@ -26,6 +35,7 @@ TOOLCHAIN_RUN_DEPS=(
     libcurl4 # for cmake
     libreadline7 # for cmake and llvm
     libffi6 libxml2 # for llvm
+    libssl-dev # for libevent
 )
 
 MEMGRAPH_BUILD_DEPS=(
@@ -46,6 +56,7 @@ MEMGRAPH_BUILD_DEPS=(
     mono-runtime mono-mcs zip unzip default-jdk-headless # for driver tests
     dotnet-sdk-3.1 golang nodejs npm
     autoconf # for jemalloc code generation
+    libtool  # for protobuf code generation
 )
 
 list() {
@@ -66,7 +77,7 @@ deb http://security.debian.org/debian-security buster/updates main contrib non-f
 deb-src http://security.debian.org/debian-security buster/updates main contrib non-free
 EOF
     cd "$DIR"
-    apt update
+    apt --allow-releaseinfo-change update
     # If GitHub Actions runner is installed, append LANG to the environment.
     # Python related tests doesn't work the LANG export.
     if [ -d "/home/gh/actions-runner" ]; then

environment/os/debian-11-arm.sh

@@ -0,0 +1,98 @@
+#!/bin/bash
+
+set -Eeuo pipefail
+
+DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
+source "$DIR/../util.sh"
+
+check_operating_system "debian-11"
+check_architecture "arm64"
+
+TOOLCHAIN_BUILD_DEPS=(
+    coreutils gcc g++ build-essential make # generic build tools
+    wget # used for archive download
+    gnupg # used for archive signature verification
+    tar gzip bzip2 xz-utils unzip # used for archive unpacking
+    zlib1g-dev # zlib library used for all builds
+    libexpat1-dev liblzma-dev python3-dev texinfo # for gdb
+    libcurl4-openssl-dev # for cmake
+    libreadline-dev # for cmake and llvm
+    libffi-dev libxml2-dev # for llvm
+    libedit-dev libpcre3-dev automake bison # for swig
+    curl # snappy
+    file # for libunwind
+    libssl-dev # for libevent
+    libgmp-dev
+    gperf # for proxygen
+    git # for fbthrift
+)
+
+TOOLCHAIN_RUN_DEPS=(
+    make # generic build tools
+    tar gzip bzip2 xz-utils # used for archive unpacking
+    zlib1g # zlib library used for all builds
+    libexpat1 liblzma5 python3 # for gdb
+    libcurl4 # for cmake
+    file # for CPack
+    libreadline8 # for cmake and llvm
+    libffi7 libxml2 # for llvm
+    libssl-dev # for libevent
+)
+
+MEMGRAPH_BUILD_DEPS=(
+    git # source code control
+    make pkg-config # build system
+    curl wget # for downloading libs
+    uuid-dev default-jre-headless # required by antlr
+    libreadline-dev # for memgraph console
+    libpython3-dev python3-dev # for query modules
+    libssl-dev
+    libseccomp-dev
+    netcat # tests are using nc to wait for memgraph
+    python3 virtualenv python3-virtualenv python3-pip # for qa, macro_benchmark and stress tests
+    python3-yaml # for the configuration generator
+    libcurl4-openssl-dev # mg-requests
+    sbcl # for custom Lisp C++ preprocessing
+    doxygen graphviz # source documentation generators
+    mono-runtime mono-mcs zip unzip default-jdk-headless # for driver tests
+    golang nodejs npm
+    autoconf # for jemalloc code generation
+    libtool  # for protobuf code generation
+)
+
+list() {
+    echo "$1"
+}
+
+check() {
+    check_all_dpkg "$1"
+}
+
+install() {
+    cat >/etc/apt/sources.list <<EOF
+deb http://deb.debian.org/debian bullseye main
+deb-src http://deb.debian.org/debian bullseye main
+
+deb http://deb.debian.org/debian-security/ bullseye-security main
+deb-src http://deb.debian.org/debian-security/ bullseye-security main
+
+deb http://deb.debian.org/debian bullseye-updates main
+deb-src http://deb.debian.org/debian bullseye-updates main
+EOF
+    cd "$DIR"
+    apt update
+    # If GitHub Actions runner is installed, append LANG to the environment.
+    # Python related tests doesn't work the LANG export.
+    if [ -d "/home/gh/actions-runner" ]; then
+        echo "LANG=en_US.utf8" >> /home/gh/actions-runner/.env
+    else
+        echo "NOTE: export LANG=en_US.utf8"
+    fi
+    apt install -y wget
+    for pkg in $1; do
+        apt install -y "$pkg"
+    done
+}
+
+deps=$2"[*]"
+"$1" "${!deps}"

environment/os/debian-11.sh

@@ -0,0 +1,107 @@
+#!/bin/bash
+
+set -Eeuo pipefail
+
+DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
+source "$DIR/../util.sh"
+
+check_operating_system "debian-11"
+check_architecture "x86_64"
+
+TOOLCHAIN_BUILD_DEPS=(
+    coreutils gcc g++ build-essential make # generic build tools
+    wget # used for archive download
+    gnupg # used for archive signature verification
+    tar gzip bzip2 xz-utils unzip # used for archive unpacking
+    zlib1g-dev # zlib library used for all builds
+    libexpat1-dev libipt-dev libbabeltrace-dev liblzma-dev python3-dev texinfo # for gdb
+    libcurl4-openssl-dev # for cmake
+    libreadline-dev # for cmake and llvm
+    libffi-dev libxml2-dev # for llvm
+    libedit-dev libpcre3-dev automake bison # for swig
+    curl # snappy
+    file # for libunwind
+    libssl-dev # for libevent
+    libgmp-dev
+    gperf # for proxygen
+    git # for fbthrift
+)
+
+TOOLCHAIN_RUN_DEPS=(
+    make # generic build tools
+    tar gzip bzip2 xz-utils # used for archive unpacking
+    zlib1g # zlib library used for all builds
+    libexpat1 libipt2 libbabeltrace1 liblzma5 python3 # for gdb
+    libcurl4 # for cmake
+    file # for CPack
+    libreadline8 # for cmake and llvm
+    libffi7 libxml2 # for llvm
+    libssl-dev # for libevent
+)
+
+MEMGRAPH_BUILD_DEPS=(
+    git # source code control
+    make pkg-config # build system
+    curl wget # for downloading libs
+    uuid-dev default-jre-headless # required by antlr
+    libreadline-dev # for memgraph console
+    libpython3-dev python3-dev # for query modules
+    libssl-dev
+    libseccomp-dev
+    netcat # tests are using nc to wait for memgraph
+    python3 virtualenv python3-virtualenv python3-pip # for qa, macro_benchmark and stress tests
+    python3-yaml # for the configuration generator
+    libcurl4-openssl-dev # mg-requests
+    sbcl # for custom Lisp C++ preprocessing
+    doxygen graphviz # source documentation generators
+    mono-runtime mono-mcs zip unzip default-jdk-headless # for driver tests
+    dotnet-sdk-3.1 golang nodejs npm
+    autoconf # for jemalloc code generation
+    libtool  # for protobuf code generation
+)
+
+list() {
+    echo "$1"
+}
+
+check() {
+    check_all_dpkg "$1"
+}
+
+install() {
+    cat >/etc/apt/sources.list <<EOF
+deb http://deb.debian.org/debian bullseye main
+deb-src http://deb.debian.org/debian bullseye main
+
+deb http://deb.debian.org/debian-security/ bullseye-security main
+deb-src http://deb.debian.org/debian-security/ bullseye-security main
+
+deb http://deb.debian.org/debian bullseye-updates main
+deb-src http://deb.debian.org/debian bullseye-updates main
+EOF
+    cd "$DIR"
+    apt update
+    # If GitHub Actions runner is installed, append LANG to the environment.
+    # Python related tests doesn't work the LANG export.
+    if [ -d "/home/gh/actions-runner" ]; then
+        echo "LANG=en_US.utf8" >> /home/gh/actions-runner/.env
+    else
+        echo "NOTE: export LANG=en_US.utf8"
+    fi
+    apt install -y wget
+    for pkg in $1; do
+        if [ "$pkg" == dotnet-sdk-3.1  ]; then
+            if ! dpkg -s "$pkg" 2>/dev/null >/dev/null; then
+                wget -nv https://packages.microsoft.com/config/debian/10/packages-microsoft-prod.deb -O packages-microsoft-prod.deb
+                dpkg -i packages-microsoft-prod.deb
+                apt-get update
+                apt-get install -y apt-transport-https dotnet-sdk-3.1
+            fi
+            continue
+        fi
+        apt install -y "$pkg"
+    done
+}
+
+deps=$2"[*]"
+"$1" "${!deps}"

environment/os/debian-9.sh

@@ -1,62 +0,0 @@
-#!/bin/bash
-
-set -Eeuo pipefail
-
-DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
-source "$DIR/../util.sh"
-
-TOOLCHAIN_BUILD_DEPS=(
-    coreutils gcc g++ build-essential make # generic build tools
-    wget # used for archive download
-    gnupg # used for archive signature verification
-    tar gzip bzip2 xz-utils unzip # used for archive unpacking
-    zlib1g-dev # zlib library used for all builds
-    libexpat1-dev libipt-dev libbabeltrace-dev libbabeltrace-ctf-dev liblzma-dev python3-dev texinfo # for gdb
-    libcurl4-openssl-dev # for cmake
-    libreadline-dev # for cmake and llvm
-    libffi-dev libxml2-dev # for llvm
-    libedit-dev libpcre3-dev automake bison # for swig
-)
-
-TOOLCHAIN_RUN_DEPS=(
-    make # generic build tools
-    tar gzip bzip2 xz-utils # used for archive unpacking
-    zlib1g # zlib library used for all builds
-    libexpat1 libipt1 libbabeltrace1 libbabeltrace-ctf1 liblzma5 python3 # for gdb
-    libcurl3 # for cmake
-    libreadline7 # for cmake and llvm
-    libffi6 libxml2 # for llvm
-)
-
-MEMGRAPH_BUILD_DEPS=(
-    git # source code control
-    make pkg-config # build system
-    curl wget # for downloading libs
-    uuid-dev default-jre-headless # required by antlr
-    libreadline-dev # for memgraph console
-    libpython3-dev python3-dev # for query modules
-    libssl-dev
-    libseccomp-dev
-    python3 python-virtualenv python3-pip # for qa, macro_benchmark and stress tests
-    python3-yaml # for the configuration generator
-    libcurl4-openssl-dev # mg-requests
-    sbcl # for custom Lisp C++ preprocessing
-    doxygen graphviz # source documentation generators
-    mono-runtime mono-mcs nodejs zip unzip default-jdk-headless # for driver tests
-    autoconf # for jemalloc code generation
-)
-
-list() {
-    echo "$1"
-}
-
-check() {
-    check_all_dpkg "$1"
-}
-
-install() {
-    install_all_apt "$1"
-}
-
-deps=$2"[*]"
-"$1" "${!deps}"

environment/os/template.sh

@@ -5,6 +5,8 @@ set -Eeuo pipefail
 DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
 source "$DIR/../util.sh"
 
+check_operating_system "todo-os-name"
+
 TOOLCHAIN_BUILD_DEPS=(
     pkg
 )

environment/os/ubuntu-18.04.sh

@@ -5,6 +5,9 @@ set -Eeuo pipefail
 DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
 source "$DIR/../util.sh"
 
+check_operating_system "ubuntu-18.04"
+check_architecture "x86_64"
+
 TOOLCHAIN_BUILD_DEPS=(
     coreutils gcc g++ build-essential make # generic build tools
     wget # archive download
@@ -16,6 +19,12 @@ TOOLCHAIN_BUILD_DEPS=(
     libcurl4-openssl-dev # cmake
     libreadline-dev # cmake and llvm
     libffi-dev libxml2-dev # llvm
+    curl # snappy
+    file
+    git # for thrift
+    libgmp-dev # for gdb
+    gperf # for proxygen
+    libssl-dev
     libedit-dev libpcre3-dev automake bison # swig
 )
 
@@ -27,6 +36,7 @@ TOOLCHAIN_RUN_DEPS=(
     libcurl4 # for cmake
     libreadline7 # for cmake and llvm
     libffi6 libxml2 # for llvm
+    libssl-dev # for libevent
 )
 
 MEMGRAPH_BUILD_DEPS=(
@@ -45,6 +55,7 @@ MEMGRAPH_BUILD_DEPS=(
     doxygen graphviz # source documentation generators
     mono-runtime mono-mcs nodejs zip unzip default-jdk-headless # driver tests
     autoconf # for jemalloc code generation
+    libtool  # for protobuf code generation
 )
 
 list() {

environment/os/ubuntu-20.04.sh

@@ -5,6 +5,9 @@ set -Eeuo pipefail
 DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
 source "$DIR/../util.sh"
 
+check_operating_system "ubuntu-20.04"
+check_architecture "x86_64"
+
 TOOLCHAIN_BUILD_DEPS=(
     coreutils gcc g++ build-essential make # generic build tools
     wget # used for archive download
@@ -15,6 +18,12 @@ TOOLCHAIN_BUILD_DEPS=(
     libcurl4-openssl-dev # for cmake
     libreadline-dev # for cmake and llvm
     libffi-dev libxml2-dev # for llvm
+    curl # snappy
+    file
+    git # for thrift
+    libgmp-dev # for gdb
+    gperf # for proxygen
+    libssl-dev
     libedit-dev libpcre3-dev automake bison # for swig
 )
 
@@ -26,6 +35,7 @@ TOOLCHAIN_RUN_DEPS=(
     libcurl4 # for cmake
     libreadline8 # for cmake and llvm
     libffi7 libxml2 # for llvm
+    libssl-dev # for libevent
 )
 
 MEMGRAPH_BUILD_DEPS=(
@@ -46,6 +56,7 @@ MEMGRAPH_BUILD_DEPS=(
     mono-runtime mono-mcs zip unzip default-jdk-headless # for driver tests
     dotnet-sdk-3.1 golang nodejs npm
     autoconf # for jemalloc code generation
+    libtool  # for protobuf code generation
 )
 
 list() {

environment/os/ubuntu-22.04.sh

@@ -0,0 +1,96 @@
+#!/bin/bash
+
+set -Eeuo pipefail
+
+DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
+source "$DIR/../util.sh"
+
+check_operating_system "ubuntu-22.04"
+check_architecture "x86_64"
+
+TOOLCHAIN_BUILD_DEPS=(
+    coreutils gcc g++ build-essential make # generic build tools
+    wget # used for archive download
+    gnupg # used for archive signature verification
+    tar gzip bzip2 xz-utils unzip # used for archive unpacking
+    zlib1g-dev # zlib library used for all builds
+    libexpat1-dev libipt-dev libbabeltrace-dev liblzma-dev python3-dev texinfo # for gdb
+    libcurl4-openssl-dev # for cmake
+    libreadline-dev # for cmake and llvm
+    libffi-dev libxml2-dev # for llvm
+    curl # snappy
+    file
+    git # for thrift
+    libgmp-dev # for gdb
+    gperf # for proxygen
+    libssl-dev
+    libedit-dev libpcre3-dev automake bison # for swig
+)
+
+TOOLCHAIN_RUN_DEPS=(
+    make # generic build tools
+    tar gzip bzip2 xz-utils # used for archive unpacking
+    zlib1g # zlib library used for all builds
+    libexpat1 libipt2 libbabeltrace1 liblzma5 python3 # for gdb
+    libcurl4 # for cmake
+    libreadline8 # for cmake and llvm
+    libffi7 libxml2 # for llvm
+    libssl-dev # for libevent
+)
+
+MEMGRAPH_BUILD_DEPS=(
+    git # source code control
+    make pkg-config # build system
+    curl wget # for downloading libs
+    uuid-dev default-jre-headless # required by antlr
+    libreadline-dev # for memgraph console
+    libpython3-dev python3-dev # for query modules
+    libssl-dev
+    libseccomp-dev
+    netcat # tests are using nc to wait for memgraph
+    python3 python3-virtualenv python3-pip # for qa, macro_benchmark and stress tests
+    python3-yaml # for the configuration generator
+    libcurl4-openssl-dev # mg-requests
+    sbcl # for custom Lisp C++ preprocessing
+    doxygen graphviz # source documentation generators
+    mono-runtime mono-mcs zip unzip default-jdk-headless # for driver tests
+    dotnet-sdk-6.0 golang nodejs npm
+    autoconf # for jemalloc code generation
+    libtool  # for protobuf code generation
+)
+
+list() {
+    echo "$1"
+}
+
+check() {
+    check_all_dpkg "$1"
+}
+
+install() {
+    cd "$DIR"
+    apt update
+    # If GitHub Actions runner is installed, append LANG to the environment.
+    # Python related tests doesn't work the LANG export.
+    if [ -d "/home/gh/actions-runner" ]; then
+        echo "LANG=en_US.utf8" >> /home/gh/actions-runner/.env
+    else
+        echo "NOTE: export LANG=en_US.utf8"
+    fi
+    apt install -y wget
+    for pkg in $1; do
+        if [ "$pkg" == dotnet-sdk-6.0 ]; then
+            if ! dpkg -s dotnet-sdk-6.0 2>/dev/null >/dev/null; then
+                wget -nv https://packages.microsoft.com/config/ubuntu/22.04/packages-microsoft-prod.deb -O packages-microsoft-prod.deb
+                dpkg -i packages-microsoft-prod.deb
+                apt-get update
+                apt-get install -y apt-transport-https dotnet-sdk-6.0
+            fi
+            continue
+        fi
+        apt install -y "$pkg"
+    done
+}
+
+deps=$2"[*]"
+"$1" "${!deps}"

environment/toolchain/folly.patch

@@ -0,0 +1,41 @@
+diff -ur a/folly/CMakeLists.txt b/folly/CMakeLists.txt
+--- a/folly/CMakeLists.txt	2021-12-12 23:10:42.000000000 +0100
++++ b/folly/CMakeLists.txt	2022-02-03 15:19:41.349693134 +0100
+@@ -28,7 +28,6 @@
+ )
+
+ add_subdirectory(experimental/exception_tracer)
+-add_subdirectory(logging/example)
+
+ if (PYTHON_EXTENSIONS)
+   # Create tree of symbolic links in structure required for successful
+diff -ur a/folly/experimental/exception_tracer/ExceptionTracerLib.cpp b/folly/experimental/exception_tracer/ExceptionTracerLib.cpp
+--- a/folly/experimental/exception_tracer/ExceptionTracerLib.cpp	2021-12-12 23:10:42.000000000 +0100
++++ b/folly/experimental/exception_tracer/ExceptionTracerLib.cpp	2022-02-03 15:19:11.003368891 +0100
+@@ -96,6 +96,7 @@
+ #define __builtin_unreachable()
+ #endif
+
++#if 0
+ namespace __cxxabiv1 {
+
+ void __cxa_throw(
+@@ -154,5 +155,5 @@
+ }
+
+ } // namespace std
+-
++#endif
+ #endif // defined(__GLIBCXX__)
+diff -ur a/folly/Portability.h b/folly/Portability.h
+--- a/folly/Portability.h	2021-12-12 23:10:42.000000000 +0100
++++ b/folly/Portability.h	2022-02-03 15:19:11.003368891 +0100
+@@ -566,7 +566,7 @@
+ #define FOLLY_HAS_COROUTINES 0
+ #elif (__cpp_coroutines >= 201703L || __cpp_impl_coroutine >= 201902L) && \
+     (__has_include(<coroutine>) || __has_include(<experimental/coroutine>))
+-#define FOLLY_HAS_COROUTINES 1
++#define FOLLY_HAS_COROUTINES 0
+ // This is mainly to workaround bugs triggered by LTO, when stack allocated
+ // variables in await_suspend end up on a coroutine frame.
+ #define FOLLY_CORO_AWAIT_SUSPEND_NONTRIVIAL_ATTRIBUTES FOLLY_NOINLINE

environment/toolchain/proxygen.patch

@@ -0,0 +1,11 @@
+diff -ur a/cmake/proxygen-config.cmake.in b/cmake/proxygen-config.cmake.in
+--- a/cmake/proxygen-config.cmake.in	2021-12-13 02:37:05.000000000 +0100
++++ b/cmake/proxygen-config.cmake.in	2022-01-27 17:14:28.284810621 +0100
+@@ -21,7 +21,6 @@
+ find_dependency(folly)
+ find_dependency(wangle)
+ find_dependency(Fizz)
+-find_dependency(mvfst)
+ # For now, anything that depends on Proxygen has to copy its FindZstd.cmake
+ # and issue a `find_package(Zstd)`.  Uncommenting this won't work because
+ # this Zstd module exposes a library called `zstd`.  The right fix is

environment/toolchain/snappy.patch

@@ -0,0 +1,29 @@
+diff -ur a/CMakeLists.txt b/CMakeLists.txt
+--- a/CMakeLists.txt	2021-05-05 00:53:34.000000000 +0200
++++ b/CMakeLists.txt	2022-01-27 17:18:34.758302398 +0100
+@@ -52,9 +52,9 @@
+   set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /EHs-c-")
+   add_definitions(-D_HAS_EXCEPTIONS=0)
+ 
+-  # Disable RTTI.
+-  string(REGEX REPLACE "/GR" "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
+-  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /GR-")
++  # # Disable RTTI.
++  # string(REGEX REPLACE "/GR" "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
++  # set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /GR-")
+ else(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+   # Use -Wall for clang and gcc.
+   if(NOT CMAKE_CXX_FLAGS MATCHES "-Wall")
+@@ -77,9 +77,9 @@
+   string(REGEX REPLACE "-fexceptions" "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
+   set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fno-exceptions")
+ 
+-  # Disable RTTI.
+-  string(REGEX REPLACE "-frtti" "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
+-  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fno-rtti")
++  # # Disable RTTI.
++  # string(REGEX REPLACE "-frtti" "" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
++  # set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fno-rtti")
+ endif(CMAKE_CXX_COMPILER_ID STREQUAL "MSVC")
+ 
+ # BUILD_SHARED_LIBS is a standard CMake variable, but we declare it here to make

environment/toolchain/v3.sh

@@ -0,0 +1,556 @@
+#!/bin/bash -e
+
+# helpers
+pushd () { command pushd "$@" > /dev/null; }
+popd () { command popd "$@" > /dev/null; }
+DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
+CPUS=$( grep -c processor < /proc/cpuinfo )
+cd "$DIR"
+
+source "$DIR/../util.sh"
+DISTRO="$(operating_system)"
+
+# toolchain version
+TOOLCHAIN_VERSION=3
+
+# package versions used
+GCC_VERSION=11.1.0
+BINUTILS_VERSION=2.36.1
+case "$DISTRO" in
+    centos-7) # because GDB >= 9 does NOT compile with readline6.
+        GDB_VERSION=8.3
+    ;;
+    *)
+        GDB_VERSION=10.2
+    ;;
+esac
+CMAKE_VERSION=3.20.5
+CPPCHECK_VERSION=2.4.1
+LLVM_VERSION=12.0.1rc4
+LLVM_VERSION_LONG=12.0.1-rc4
+SWIG_VERSION=4.0.2 # used only for LLVM compilation
+
+# Check for the dependencies.
+echo "ALL BUILD PACKAGES: $($DIR/../os/$DISTRO.sh list TOOLCHAIN_BUILD_DEPS)"
+$DIR/../os/$DISTRO.sh check TOOLCHAIN_BUILD_DEPS
+echo "ALL RUN PACKAGES: $($DIR/../os/$DISTRO.sh list TOOLCHAIN_RUN_DEPS)"
+$DIR/../os/$DISTRO.sh check TOOLCHAIN_RUN_DEPS
+
+# check installation directory
+NAME=toolchain-v$TOOLCHAIN_VERSION
+PREFIX=/opt/$NAME
+mkdir -p $PREFIX >/dev/null 2>/dev/null || true
+if [ ! -d $PREFIX ] || [ ! -w $PREFIX ]; then
+    echo "Please make sure that the directory '$PREFIX' exists and is writable by the current user!"
+    echo
+    echo "If unsure, execute these commands as root:"
+    echo "    mkdir $PREFIX && chown $USER:$USER $PREFIX"
+    echo
+    echo "Press <return> when you have created the directory and granted permissions."
+    # wait for the directory to be created
+    while true; do
+        read
+        if [ ! -d $PREFIX ] || [ ! -w $PREFIX ]; then
+            echo
+            echo "You can't continue before you have created the directory and granted permissions!"
+            echo
+            echo "Press <return> when you have created the directory and granted permissions."
+        else
+            break
+        fi
+    done
+fi
+
+# create archives directory
+mkdir -p archives
+
+# download all archives
+pushd archives
+if [ ! -f gcc-$GCC_VERSION.tar.gz ]; then
+    wget https://ftp.gnu.org/gnu/gcc/gcc-$GCC_VERSION/gcc-$GCC_VERSION.tar.gz
+fi
+if [ ! -f binutils-$BINUTILS_VERSION.tar.gz ]; then
+    wget https://ftp.gnu.org/gnu/binutils/binutils-$BINUTILS_VERSION.tar.gz
+fi
+if [ ! -f gdb-$GDB_VERSION.tar.gz ]; then
+    wget https://ftp.gnu.org/gnu/gdb/gdb-$GDB_VERSION.tar.gz
+fi
+if [ ! -f cmake-$CMAKE_VERSION.tar.gz ]; then
+    wget https://github.com/Kitware/CMake/releases/download/v$CMAKE_VERSION/cmake-$CMAKE_VERSION.tar.gz
+fi
+if [ ! -f swig-$SWIG_VERSION.tar.gz ]; then
+    wget https://github.com/swig/swig/archive/rel-$SWIG_VERSION.tar.gz -O swig-$SWIG_VERSION.tar.gz
+fi
+if [ ! -f cppcheck-$CPPCHECK_VERSION.tar.gz ]; then
+    wget https://github.com/danmar/cppcheck/archive/$CPPCHECK_VERSION.tar.gz -O cppcheck-$CPPCHECK_VERSION.tar.gz
+fi
+if [ ! -f llvm-$LLVM_VERSION.src.tar.xz ]; then
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION_LONG/llvm-$LLVM_VERSION.src.tar.xz
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION_LONG/clang-$LLVM_VERSION.src.tar.xz
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION_LONG/lld-$LLVM_VERSION.src.tar.xz
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION_LONG/clang-tools-extra-$LLVM_VERSION.src.tar.xz
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION_LONG/compiler-rt-$LLVM_VERSION.src.tar.xz
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION_LONG/libunwind-$LLVM_VERSION.src.tar.xz
+fi
+if [ ! -f pahole-gdb-master.zip ]; then
+    wget https://github.com/PhilArmstrong/pahole-gdb/archive/master.zip -O pahole-gdb-master.zip
+fi
+
+# verify all archives
+# NOTE: Verification can fail if the archive is signed by another developer. I
+# haven't added commands to download all developer GnuPG keys because the
+# download is very slow. If the verification fails for you, figure out who has
+# signed the archive and download their public key instead.
+GPG="gpg --homedir .gnupg"
+KEYSERVER="hkp://keyserver.ubuntu.com"
+
+mkdir -p .gnupg
+chmod 700 .gnupg
+# verify gcc
+if [ ! -f gcc-$GCC_VERSION.tar.gz.sig ]; then
+    wget https://ftp.gnu.org/gnu/gcc/gcc-$GCC_VERSION/gcc-$GCC_VERSION.tar.gz.sig
+fi
+# list of valid gcc gnupg keys: https://gcc.gnu.org/mirrors.html
+$GPG --keyserver $KEYSERVER --recv-keys 0x6C35B99309B5FA62
+$GPG --verify gcc-$GCC_VERSION.tar.gz.sig gcc-$GCC_VERSION.tar.gz
+# verify binutils
+if [ ! -f binutils-$BINUTILS_VERSION.tar.gz.sig ]; then
+    wget https://ftp.gnu.org/gnu/binutils/binutils-$BINUTILS_VERSION.tar.gz.sig
+fi
+$GPG --keyserver $KEYSERVER --recv-keys 0xDD9E3C4F
+$GPG --verify binutils-$BINUTILS_VERSION.tar.gz.sig binutils-$BINUTILS_VERSION.tar.gz
+# verify gdb
+if [ ! -f gdb-$GDB_VERSION.tar.gz.sig ]; then
+    wget https://ftp.gnu.org/gnu/gdb/gdb-$GDB_VERSION.tar.gz.sig
+fi
+$GPG --keyserver $KEYSERVER --recv-keys 0xFF325CF3
+$GPG --verify gdb-$GDB_VERSION.tar.gz.sig gdb-$GDB_VERSION.tar.gz
+# verify cmake
+if [ ! -f cmake-$CMAKE_VERSION-SHA-256.txt ] || [ ! -f cmake-$CMAKE_VERSION-SHA-256.txt.asc ]; then
+    wget https://github.com/Kitware/CMake/releases/download/v$CMAKE_VERSION/cmake-$CMAKE_VERSION-SHA-256.txt
+    wget https://github.com/Kitware/CMake/releases/download/v$CMAKE_VERSION/cmake-$CMAKE_VERSION-SHA-256.txt.asc
+    # Because CentOS 7 doesn't have the `--ignore-missing` flag for `sha256sum`
+    # we filter out the missing files from the sums here manually.
+    cat cmake-$CMAKE_VERSION-SHA-256.txt | grep "cmake-$CMAKE_VERSION.tar.gz" > cmake-$CMAKE_VERSION-SHA-256-filtered.txt
+fi
+$GPG --keyserver $KEYSERVER --recv-keys 0xC6C265324BBEBDC350B513D02D2CEF1034921684
+sha256sum -c cmake-$CMAKE_VERSION-SHA-256-filtered.txt
+$GPG --verify cmake-$CMAKE_VERSION-SHA-256.txt.asc cmake-$CMAKE_VERSION-SHA-256.txt
+# verify llvm, cfe, lld, clang-tools-extra
+if [ ! -f llvm-$LLVM_VERSION.src.tar.xz.sig ]; then
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION_LONG/llvm-$LLVM_VERSION.src.tar.xz.sig
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION_LONG/clang-$LLVM_VERSION.src.tar.xz.sig
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION_LONG/lld-$LLVM_VERSION.src.tar.xz.sig
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION_LONG/clang-tools-extra-$LLVM_VERSION.src.tar.xz.sig
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION_LONG/compiler-rt-$LLVM_VERSION.src.tar.xz.sig
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION_LONG/libunwind-$LLVM_VERSION.src.tar.xz.sig
+fi
+# list of valid llvm gnupg keys: https://releases.llvm.org/download.html
+$GPG --keyserver $KEYSERVER --recv-keys 0x474E22316ABF4785A88C6E8EA2C794A986419D8A
+$GPG --verify llvm-$LLVM_VERSION.src.tar.xz.sig llvm-$LLVM_VERSION.src.tar.xz
+$GPG --verify clang-$LLVM_VERSION.src.tar.xz.sig clang-$LLVM_VERSION.src.tar.xz
+$GPG --verify lld-$LLVM_VERSION.src.tar.xz.sig lld-$LLVM_VERSION.src.tar.xz
+$GPG --verify clang-tools-extra-$LLVM_VERSION.src.tar.xz.sig clang-tools-extra-$LLVM_VERSION.src.tar.xz
+$GPG --verify compiler-rt-$LLVM_VERSION.src.tar.xz.sig compiler-rt-$LLVM_VERSION.src.tar.xz
+$GPG --verify libunwind-$LLVM_VERSION.src.tar.xz.sig libunwind-$LLVM_VERSION.src.tar.xz
+popd
+
+# create build directory
+mkdir -p build
+pushd build
+
+# compile gcc
+if [ ! -f $PREFIX/bin/gcc ]; then
+    if [ -d gcc-$GCC_VERSION ]; then
+        rm -rf gcc-$GCC_VERSION
+    fi
+    tar -xvf ../archives/gcc-$GCC_VERSION.tar.gz
+    pushd gcc-$GCC_VERSION
+    ./contrib/download_prerequisites
+    mkdir build && pushd build
+    # influenced by: https://buildd.debian.org/status/fetch.php?pkg=gcc-8&arch=amd64&ver=8.3.0-6&stamp=1554588545
+    ../configure -v \
+        --build=x86_64-linux-gnu \
+        --host=x86_64-linux-gnu \
+        --target=x86_64-linux-gnu \
+        --prefix=$PREFIX \
+        --disable-multilib \
+        --with-system-zlib \
+        --enable-checking=release \
+        --enable-languages=c,c++,fortran \
+        --enable-gold=yes \
+        --enable-ld=yes \
+        --enable-lto \
+        --enable-bootstrap \
+        --disable-vtable-verify \
+        --disable-werror \
+        --without-included-gettext \
+        --enable-threads=posix \
+        --enable-nls \
+        --enable-clocale=gnu \
+        --enable-libstdcxx-debug \
+        --enable-libstdcxx-time=yes \
+        --enable-gnu-unique-object \
+        --enable-libmpx \
+        --enable-plugin \
+        --enable-default-pie \
+        --with-target-system-zlib \
+        --with-tune=generic \
+        --without-cuda-driver
+        #--program-suffix=$( printf "$GCC_VERSION" | cut -d '.' -f 1,2 ) \
+    make -j$CPUS
+    # make -k check # run test suite
+    make install
+    popd && popd
+fi
+
+# activate toolchain
+export PATH=$PREFIX/bin:$PATH
+export LD_LIBRARY_PATH=$PREFIX/lib64
+
+# compile binutils
+if [ ! -f $PREFIX/bin/ld.gold ]; then
+    if [ -d binutils-$BINUTILS_VERSION ]; then
+        rm -rf binutils-$BINUTILS_VERSION
+    fi
+    tar -xvf ../archives/binutils-$BINUTILS_VERSION.tar.gz
+    pushd binutils-$BINUTILS_VERSION
+    mkdir build && pushd build
+    # influenced by: https://buildd.debian.org/status/fetch.php?pkg=binutils&arch=amd64&ver=2.32-7&stamp=1553247092
+    env \
+        CC=gcc \
+        CXX=g++ \
+        CFLAGS="-g -O2" \
+        CXXFLAGS="-g -O2" \
+        LDFLAGS="" \
+        ../configure \
+            --build=x86_64-linux-gnu \
+            --host=x86_64-linux-gnu \
+            --prefix=$PREFIX \
+            --enable-ld=default \
+            --enable-gold \
+            --enable-lto \
+            --enable-plugins \
+            --enable-shared \
+            --enable-threads \
+            --with-system-zlib \
+            --enable-deterministic-archives \
+            --disable-compressed-debug-sections \
+            --enable-new-dtags \
+            --disable-werror
+    make -j$CPUS
+    # make -k check # run test suite
+    make install
+    popd && popd
+fi
+
+# compile gdb
+if [ ! -f $PREFIX/bin/gdb ]; then
+    if [ -d gdb-$GDB_VERSION ]; then
+        rm -rf gdb-$GDB_VERSION
+    fi
+    tar -xvf ../archives/gdb-$GDB_VERSION.tar.gz
+    pushd gdb-$GDB_VERSION
+    mkdir build && pushd build
+    # https://buildd.debian.org/status/fetch.php?pkg=gdb&arch=amd64&ver=8.2.1-2&stamp=1550831554&raw=0
+    env \
+        CC=gcc \
+        CXX=g++ \
+        CFLAGS="-g -O2 -fstack-protector-strong -Wformat -Werror=format-security" \
+        CXXFLAGS="-g -O2 -fstack-protector-strong -Wformat -Werror=format-security" \
+        CPPFLAGS="-Wdate-time -D_FORTIFY_SOURCE=2 -fPIC" \
+        LDFLAGS="-Wl,-z,relro" \
+        PYTHON="" \
+        ../configure \
+            --build=x86_64-linux-gnu \
+            --host=x86_64-linux-gnu \
+            --prefix=$PREFIX \
+            --disable-maintainer-mode \
+            --disable-dependency-tracking \
+            --disable-silent-rules \
+            --disable-gdbtk \
+            --disable-shared \
+            --without-guile \
+            --with-system-gdbinit=$PREFIX/etc/gdb/gdbinit \
+            --with-system-readline \
+            --with-expat \
+            --with-system-zlib \
+            --with-lzma \
+            --with-babeltrace \
+            --with-intel-pt \
+            --enable-tui \
+            --with-python=python3
+    make -j$CPUS
+    make install
+    popd && popd
+fi
+
+# install pahole
+if [ ! -d $PREFIX/share/pahole-gdb ]; then
+    unzip ../archives/pahole-gdb-master.zip
+    mv pahole-gdb-master $PREFIX/share/pahole-gdb
+fi
+
+# setup system gdbinit
+if [ ! -f $PREFIX/etc/gdb/gdbinit ]; then
+    mkdir -p $PREFIX/etc/gdb
+    cat >$PREFIX/etc/gdb/gdbinit <<EOF
+# improve formatting
+set print pretty on
+set print object on
+set print static-members on
+set print vtbl on
+set print demangle on
+set demangle-style gnu-v3
+set print sevenbit-strings off
+
+# load libstdc++ pretty printers
+add-auto-load-scripts-directory $PREFIX/lib64
+add-auto-load-safe-path $PREFIX
+
+# load pahole
+python
+sys.path.insert(0, "$PREFIX/share/pahole-gdb")
+import offsets
+import pahole
+end
+EOF
+fi
+
+# compile cmake
+if [ ! -f $PREFIX/bin/cmake ]; then
+    if [ -d cmake-$CMAKE_VERSION ]; then
+        rm -rf cmake-$CMAKE_VERSION
+    fi
+    tar -xvf ../archives/cmake-$CMAKE_VERSION.tar.gz
+    pushd cmake-$CMAKE_VERSION
+    # influenced by: https://buildd.debian.org/status/fetch.php?pkg=cmake&arch=amd64&ver=3.13.4-1&stamp=1549799837
+    echo 'set(CMAKE_SKIP_RPATH ON CACHE BOOL "Skip rpath" FORCE)' >> build-flags.cmake
+    echo 'set(CMAKE_USE_RELATIVE_PATHS ON CACHE BOOL "Use relative paths" FORCE)' >> build-flags.cmake
+    echo 'set(CMAKE_C_FLAGS "-g -O2 -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2" CACHE STRING "C flags" FORCE)' >> build-flags.cmake
+    echo 'set(CMAKE_CXX_FLAGS "-g -O2 -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2" CACHE STRING "C++ flags" FORCE)' >> build-flags.cmake
+    echo 'set(CMAKE_SKIP_BOOTSTRAP_TEST ON CACHE BOOL "Skip BootstrapTest" FORCE)' >> build-flags.cmake
+    echo 'set(BUILD_CursesDialog ON CACHE BOOL "Build curses GUI" FORCE)' >> build-flags.cmake
+    mkdir build && pushd build
+    ../bootstrap \
+        --prefix=$PREFIX \
+        --init=../build-flags.cmake \
+        --parallel=$CPUS \
+        --system-curl
+    make -j$CPUS
+    # make test # run test suite
+    make install
+    popd && popd
+fi
+
+# compile cppcheck
+if [ ! -f $PREFIX/bin/cppcheck ]; then
+    if [ -d cppcheck-$CPPCHECK_VERSION ]; then
+        rm -rf cppcheck-$CPPCHECK_VERSION
+    fi
+    tar -xvf ../archives/cppcheck-$CPPCHECK_VERSION.tar.gz
+    pushd cppcheck-$CPPCHECK_VERSION
+    # this was fixed in cppcheck 2.5, remove this in toolchain-v4 after the lib is updated
+    # to 2.5+ version.
+    sed -i '/#include <iostream>/ a #include <limits>' lib/symboldatabase.cpp
+    env \
+        CC=gcc \
+        CXX=g++ \
+        PREFIX=$PREFIX \
+        FILESDIR=$PREFIX/share/cppcheck \
+        CFGDIR=$PREFIX/share/cppcheck/cfg \
+            make -j$CPUS
+    env \
+        CC=gcc \
+        CXX=g++ \
+        PREFIX=$PREFIX \
+        FILESDIR=$PREFIX/share/cppcheck \
+        CFGDIR=$PREFIX/share/cppcheck/cfg \
+            make install
+    popd
+fi
+
+# compile swig
+if [ ! -d swig-$SWIG_VERSION/install ]; then
+    if [ -d swig-$SWIG_VERSION ]; then
+        rm -rf swig-$SWIG_VERSION
+    fi
+    tar -xvf ../archives/swig-$SWIG_VERSION.tar.gz
+    mv swig-rel-$SWIG_VERSION swig-$SWIG_VERSION
+    pushd swig-$SWIG_VERSION
+    ./autogen.sh
+    mkdir build && pushd build
+    ../configure --prefix=$DIR/build/swig-$SWIG_VERSION/install
+    make -j$CPUS
+    make install
+    popd && popd
+fi
+
+# compile llvm
+if [ ! -f $PREFIX/bin/clang ]; then
+    if [ -d llvm-$LLVM_VERSION ]; then
+        rm -rf llvm-$LLVM_VERSION
+    fi
+    tar -xvf ../archives/llvm-$LLVM_VERSION.src.tar.xz
+    mv llvm-$LLVM_VERSION.src llvm-$LLVM_VERSION
+    tar -xvf ../archives/clang-$LLVM_VERSION.src.tar.xz
+    mv clang-$LLVM_VERSION.src llvm-$LLVM_VERSION/tools/clang
+    tar -xvf ../archives/lld-$LLVM_VERSION.src.tar.xz
+    mv lld-$LLVM_VERSION.src/ llvm-$LLVM_VERSION/tools/lld
+    tar -xvf ../archives/clang-tools-extra-$LLVM_VERSION.src.tar.xz
+    mv clang-tools-extra-$LLVM_VERSION.src/ llvm-$LLVM_VERSION/tools/clang/tools/extra
+    tar -xvf ../archives/compiler-rt-$LLVM_VERSION.src.tar.xz
+    mv compiler-rt-$LLVM_VERSION.src/ llvm-$LLVM_VERSION/projects/compiler-rt
+    tar -xvf ../archives/libunwind-$LLVM_VERSION.src.tar.xz
+    mv libunwind-$LLVM_VERSION.src/include/mach-o llvm-$LLVM_VERSION/tools/lld/include
+    pushd llvm-$LLVM_VERSION
+    mkdir build && pushd build
+    # activate swig
+    export PATH=$DIR/build/swig-$SWIG_VERSION/install/bin:$PATH
+    # influenced by: https://buildd.debian.org/status/fetch.php?pkg=llvm-toolchain-7&arch=amd64&ver=1%3A7.0.1%7E%2Brc2-1%7Eexp1&stamp=1541506173&raw=0
+    cmake .. \
+        -DCMAKE_C_COMPILER=$PREFIX/bin/gcc \
+        -DCMAKE_CXX_COMPILER=$PREFIX/bin/g++ \
+        -DCMAKE_CXX_LINK_FLAGS="-L$PREFIX/lib64 -Wl,-rpath,$PREFIX/lib64" \
+        -DCMAKE_INSTALL_PREFIX=$PREFIX \
+        -DCMAKE_BUILD_TYPE=RelWithDebInfo \
+        -DCMAKE_CXX_FLAGS_RELWITHDEBINFO="-O2 -DNDEBUG" \
+        -DCMAKE_CXX_FLAGS=' -fuse-ld=gold -fPIC -Wno-unused-command-line-argument -Wno-unknown-warning-option' \
+        -DCMAKE_C_FLAGS=' -fuse-ld=gold -fPIC -Wno-unused-command-line-argument -Wno-unknown-warning-option' \
+        -DLLVM_LINK_LLVM_DYLIB=ON \
+        -DLLVM_INSTALL_UTILS=ON \
+        -DLLVM_VERSION_SUFFIX= \
+        -DLLVM_BUILD_LLVM_DYLIB=ON \
+        -DLLVM_ENABLE_RTTI=ON \
+        -DLLVM_ENABLE_FFI=ON \
+        -DLLVM_BINUTILS_INCDIR=$PREFIX/include/ \
+        -DLLVM_USE_PERF=yes
+    make -j$CPUS
+    make -j$CPUS check-clang # run clang test suite
+    make -j$CPUS check-lld # run lld test suite
+    make install
+    popd && popd
+fi
+
+# create README
+if [ ! -f $PREFIX/README.md ]; then
+    cat >$PREFIX/README.md <<EOF
+# Memgraph Toolchain v$TOOLCHAIN_VERSION
+
+## Included tools
+
+ - GCC $GCC_VERSION
+ - Binutils $BINUTILS_VERSION
+ - GDB $GDB_VERSION
+ - CMake $CMAKE_VERSION
+ - Cppcheck $CPPCHECK_VERSION
+ - LLVM (Clang, LLD, compiler-rt, Clang tools extra) $LLVM_VERSION
+
+## Required libraries
+
+In order to be able to run all of these tools you should install the following
+packages:
+
+\`\`\`
+$($DIR/../os/$DISTRO.sh list TOOLCHAIN_RUN_DEPS)
+\`\`\`
+
+## Usage
+
+In order to use the toolchain you just have to source the activation script:
+
+\`\`\`
+source $PREFIX/activate
+\`\`\`
+EOF
+fi
+
+# create activation script
+if [ ! -f $PREFIX/activate ]; then
+    cat >$PREFIX/activate <<EOF
+# This file must be used with "source $PREFIX/activate" *from bash*
+# You can't run it directly!
+
+env_error="You already have an active virtual environment!"
+
+# zsh does not recognize the option -t of the command type
+# therefore we use the alternative whence -w
+if [[ "\$ZSH_NAME" == "zsh" ]]; then
+    # check for active virtual environments
+    if [ "\$( whence -w deactivate )" != "deactivate: none" ]; then
+        echo \$env_error
+        return 0;
+    fi
+# any other shell
+else
+    # check for active virtual environments
+    if [ "\$( type -t deactivate )" != "" ]; then
+        echo \$env_error
+        return 0
+    fi
+fi
+
+# check that we aren't root
+if [[ "\$USER" == "root" ]]; then
+    echo "You shouldn't use the toolchain as root!"
+    return 0
+fi
+
+# save original environment
+export ORIG_PATH=\$PATH
+export ORIG_PS1=\$PS1
+export ORIG_LD_LIBRARY_PATH=\$LD_LIBRARY_PATH
+
+# activate new environment
+export PATH=$PREFIX/bin:\$PATH
+export PS1="($NAME) \$PS1"
+export LD_LIBRARY_PATH=$PREFIX/lib:$PREFIX/lib64
+
+# disable root
+function su () {
+    echo "You don't want to use root functions while using the toolchain!"
+    return 1
+}
+function sudo () {
+    echo "You don't want to use root functions while using the toolchain!"
+    return 1
+}
+
+# create deactivation function
+function deactivate() {
+    export PATH=\$ORIG_PATH
+    export PS1=\$ORIG_PS1
+    export LD_LIBRARY_PATH=\$ORIG_LD_LIBRARY_PATH
+    unset ORIG_PATH ORIG_PS1 ORIG_LD_LIBRARY_PATH
+    unset -f su sudo deactivate
+}
+EOF
+fi
+
+# create toolchain archive
+if [ ! -f $NAME-binaries-$DISTRO.tar.gz ]; then
+    tar --owner=root --group=root -cpvzf $NAME-binaries-$DISTRO.tar.gz -C /opt $NAME
+fi
+
+# output final instructions
+echo -e "\n\n"
+echo "All tools have been built. They are installed in '$PREFIX'."
+echo "In order to distribute the tools to someone else, an archive with the toolchain was created in the 'build' directory."
+echo "If you want to install the packed tools you should execute the following command:"
+echo
+echo "    tar -xvzf build/$NAME-binaries.tar.gz -C /opt"
+echo
+echo "Because the tools were built on this machine, you should probably change the permissions of the installation directory using:"
+echo
+echo "    OPTIONAL: chown -R root:root $PREFIX"
+echo
+echo "In order to use all of the newly compiled tools you should use the prepared activation script:"
+echo
+echo "    source $PREFIX/activate"
+echo
+echo "Or, for more advanced uses, you can add the following lines to your script:"
+echo
+echo "    export PATH=$PREFIX/bin:\$PATH"
+echo "    export LD_LIBRARY_PATH=$PREFIX/lib:$PREFIX/lib64"
+echo
+echo "Enjoy!"

environment/toolchain/xz_pgp.txt

@@ -0,0 +1,75 @@
+-----BEGIN PGP PUBLIC KEY BLOCK-----
+
+mQINBEzEOZIBEACxg/IuXERlDB48JBWmF4NxNUuuup1IhJAJyFGFSKh3OGAO2Ard
+sNuRLjANsFXA7m7P5eTFcG+BoHHuAVYmKnI3PPZtHVLnUt4pGItPczQZ2BE1WpcI
+ayjGTBJeKItX3Npqg9D/odO9WWS1i3FQPVdrLn0YH37/BA66jeMQCRo7g7GLpaNf
+IrvYGsqTbxCwsmA37rpE7oyU4Yrf74HT091WBsRIoq/MelhbxTDMR8eu/dUGZQVc
+Kj3lN55RepwWwUUKyqarY0zMt4HkFJ7v7yRL+Cvzy92Ouv4Wf2FlhNtEs5LE4Tax
+W0PO5AEmUoKjX87SezQK0f652018b4u6Ex52cY7p+n5TII/UyoowH6+tY8UHo9yb
+fStrqgNE/mY2bhA6+AwCaOUGsFzVVPTbjtxL3HacUP/jlA1h78V8VTvTs5d55iG7
+jSqR9o05wje8rwNiXXK0xtiJahyNzL97Kn/DgPSqPIi45G+8nxWSPFM5eunBKRl9
+vAnsvwrdPRsR6YR3uMHTuVhQX9/CY891MHkaZJ6wydWtKt3yQwJLYqwo5d4DwnUX
+CduUwSKv+6RmtWI5ZmTQYOcBRcZyGKml9X9Q8iSbm6cnpFXmLrNQwCJN+D3SiYGc
+MtbltZo0ysPMa6Xj5xFaYqWk/BI4iLb2Gs+ByGo/+a0Eq4XYBMOpitNniQARAQAB
+tCdMYXNzZSBDb2xsaW4gPGxhc3NlLmNvbGxpbkB0dWthYW5pLm9yZz6JAlEEEwEK
+ADsCGwMCHgECF4AECwkIBwMVCggFFgIDAQAWIQQ2kMJAzlG0Zw0wrRw47nV9aRhG
+IAUCYEt9dQUJFxeR4wAKCRA47nV9aRhGIBNDEACxD6vJ+enZwe3IgkJh5JtLsC9b
+MWCQRlPW1EVMsg96Cb5Rtron1eN1pp1TlzENJu1/C7C/VEsr9WwOPg26Men7fNf/
+O21QM9IBWd/uB0Pu333WqKh92ESS5x9ST9DrG39nVGSPkQQBMuia72VrA+crPnwT
+/h/u1IN6/sff5VDIU24rUiqW2Npy733dANruj7Ny0scRXVPltnVdhqwPHt6qNjC1
+t+/cCnwHgW1BR1RYXBPpB42z/m29dL9rPrG0YPGWs2Bc+EATUICfEE6eIvwfciue
+IJTjKT9Y9DrogJC2AYFhjC7N04OKdCB2hFs4BjexJwr4X0GJO7LhFl03c951AsIE
+GHwrucRPB5bo2vmvQ8IvZn7CmtdUJzXv9JlyU6p+MIK1pz7TK6GgSOSffQIXZn6e
+nUPtm9mEwuncOfmW8/ODYPs1gCWYgyiFJx8h7eEu+M4MxHSFBs7MwXf/Ae2fSp+M
+P/p198qB8fC5oVBnF95qb0Qi0uc1D+Gb+gpBF+ymMb+s/VBOR3QWiym7AzBrJ62g
+UnbC9jMLGnSRI+7p7raUfMTgXr5/oQoBw7ExJVltSSRrim2YH/t4CV47mO6dR9J3
+1RtsTFIRNhz+07XPsETcuCV/dgqeC8fOFLt9MY17Sufhb1DcGy4urZBOIhXcpTV7
+vHVj5IYH5nYOT49NRYkCOAQTAQIAIgUCTMQ5kgIbAwYLCQgHAwIGFQgCCQoLBBYC
+AwECHgECF4AACgkQOO51fWkYRiAg4A/7BXKwoRaXrMbMPOW7vuVF7c2IKB2Yqzn1
+vLBCwuEHkqY237lDcXY4/5LR+1gcZ3Duw1n/BRSm0FBdvyX/JTWiWNSDUkKAO/0l
+T2Tg44YLrDT3bzwu8dbU9xQt6kH+SCOHvv5Oe4k79l5mro6fF3H1M0bN63x/YoFY
+ojy09D7/JptY82oR4f/VdKnfZLJcCViCb0wp8SD2NkDAudKg+K+7PD8HlTWklQQg
+TZdRXxVZKIJeU42aJDqnRbAhJd64YHyClhqut9F5LUmiP5qfLfNhkKDhNOwk2Blr
+BGBJkSd7wPyzcX4Mun/L6YspHjbeVMt9TD7HQlo+OOd2OjAHCx6pqwkXnzeLPEaE
+cPdQ1SHgrBViAxX3DNPubLP0Knw8XwFu96EuhHZgexE1W7bB4LFsJyXAc5k1PqPD
+CLsAauxmvI2OfI7opG/8wyxDvNgoPjG8fZNAgY0REqPC0JnTXChH31IxUmhNotH8
+tD3DDTZOHw05n5MwwUrEE9xiETVDfFQcMLfxZ9KLz+BC2g1t5LYublRgnCMNJzFg
+sNUMM02CphABzl/LCLnumr0eyQQ/weV4twEhLwSDmqLYHL0EdYW0Y3CnnU9vmYxQ
+cXKbstS71sEJJYBBmSBbf9GxkOY8BRNtwVwY0kPgxv1WqdVBiAFvfB+pyAsrax9B
+3UeB7ZSwRD6JAhwEEAEKAAYFAlS25GwACgkQlbYYGy0z6ew92Q//ZA9/6piQtoW4
+PwP/1DtWGyKU8hwR+9FG669iPk/dAG+yoEJtFMOUpg/FUFmCX8Bc4oEHsCVyLxKt
+DcCVUIRcYNSFi5hTZaBEbwsOlDT37gtlfIIu34hhHRccKaLnN/N9gNMNw8wGh9xg
+Q/KtxZwcbk/bZIlDkKTJkFBRAekdEGAFDWb/AZOy+LQxS8ZAh1eWkfV0i8opmK9k
+gPXtLE0WSsqtYyGs58z+BFE9NH3tEUwK6jSvtuLwQl4UrICNbKthcpb8WwH6UXzb
+q3QNSYVOpf/cqRdBJA6bvb/ku/xyKVL08lGmxD9v1b137R7mafDAFPTsvH2Mt/0V
+YuhtWav3r1Bl9QksDxt2DTS8wiWDUBetGqOVdcw7vBrXPEWDNBmxeJXsiJ7zJlR+
+9wrJOm6RV2+l1IPxu96EaPS+kTNBijKrhxb67bww8BTEWTd0wcdJmgWRkM8SIstp
+IKqd0L2TFYph2/NtrBhRg+DIEPJPpSTGsUMcCEXCZPQ+cIdlQKsWpk0tZ62DlvEl
+r7E+wgUSQolRfx5KrpZifiS2zQlhzdXv28CJhsVbLyw5fUAWUKIH/dCo5NKsNLk2
+Lc5DH9VWnFgxAAtW290FqeK/4ulMq7Vs1dQSwyHM2Ni3QqqeaiOrh8gbSY5CMLFN
+Y3HYRwuTYPa3AobsozCzBj0Zdf/6AFe5Ag0ETMQ5kgEQAL/FwKdjxgPxtSpgq1SM
+zgZtTTyLqhgGD3NZfadHWHYRIL38NDV3JeTA79Y2zj2dj7KQPDT+0aqeizTV2E3j
+P3iCQ53VOT4consBaQAgKexpptnS+T1DobtICFJ0GGzf0HRj6KO2zSOuOitWPWlU
+wbvX7M0LLI2+hqlx0jTPqbJFZ/Za6KTtbS6xdCPVUpUqYZQpokEZcwQmUp8Q+lGo
+JD2sNYCZyap63X/aAOgCGr2RXYddOH5e8vGzGW+mwtCv+WQ9Ay35mGqI5MqkbZd1
+Qbuv2b1647E/QEEucfRHVbJVKGGPpFMUJtcItyyIt5jo+r9CCL4Cs47dF/9/RNwu
+NvpvHXUyqMBQdWNZRMx4k/NGD/WviPi9m6mIMui6rOQsSOaqYdcUX4Nq2Orr3Oaz
+2JPQdUfeI23iot1vK8hxvUCQTV3HfJghizN6spVl0yQOKBiE8miJRgrjHilH3hTb
+xoo42xDkNAq+CQo3QAm1ibDxKCDq0RcWPjcCRAN/Q5MmpcodpdKkzV0yGIS4g7s5
+frVrgV/kox2r4/Yxsr8K909+4H82AjTKGX/BmsQFCTAqBk6p7I0zxjIqJ/w33TZB
+Q0Pn4r3WIlUPafzY6a9/LAvN1fHRxf9SpCByJsszD03Qu5f5TB8gthsdnVmTo7jj
+iordEKMtw2aEMLzdWWTQ/TNVABEBAAGJAjwEGAEKACYCGwwWIQQ2kMJAzlG0Zw0w
+rRw47nV9aRhGIAUCYEt9YAUJFxeRzgAKCRA47nV9aRhGIMLtD/9HuKM4pngImcuz
+YwzQmdv4j26YYyh4jVsKEmVWTiRcehEgUIlrWkCu3qzd5NK+RetS7kJ8MPnzEUfj
+YbpdC6yrF6n1mSrZZ4VJMkV2ev37bIgXM+Wp1mCAGbjNxQnjn9RabT/gjIqmGuRn
+AP7RsSeOSuO/gO9h2Pteciz23ussTilB+8cTooQEQQZe6Kv/zukvL+ccSehLHsZ7
+qVfRUAmtt8nFkXXE+s8jfLfhqstaI2/RJu5witaPcXM8Mnz2E95aASAbZy0eQot9
+0Pvf07n9yuC3tueTvzvlXx3h5U3yT44tIOmzANIQjay1TGdm+RBJ2ZYyhyLawlZ2
+NVUXXSp4QZZXPA0UWbF+pb7Q9cdKDNFVuvGBljuea0Yd0T2o+ibDq43HziX9ll+l
+SXk9mqvW1UcDOaxWrSsm1Gc1O9g3wqH5xHAhtY8GPh/7VgAawskPkmnlkMW6pYPy
+zibbeISJL1gd1jIT63y6aoVrtNoo+wYJm280ROflh4+5QOo6QJ+jm70fkXSG/qJ5
+a8/qCPTHkJc/rpkL6/TDQAJURi9RhDAC0gb40HtusbN1LZEA+i0cWTmYXap+DB4Y
+R4pApilpaG87M+VUokR4xpnx7vTb2MPa7Mdenvi9FEGnKXadmT8038vlfzz5GGUT
+MlVin9BQPTpdA+PpRiJvKJgVDeAFOg==
+=asTC
+-----END PGP PUBLIC KEY BLOCK-----

environment/util.sh

@@ -5,6 +5,28 @@ operating_system() {
     sort | cut -d '=' -f 2- | sed 's/"//g' | paste -s -d '-'
 }
 
+check_operating_system() {
+    if [ "$(operating_system)" != "$1" ]; then
+        echo "Not the right operating system!"
+        exit 1
+    else
+        echo "The right operating system."
+    fi
+}
+
+architecture() {
+    uname -m
+}
+
+check_architecture() {
+    if [ "$(architecture)" != "$1" ]; then
+        echo "Not the right architecture!"
+        exit 1
+    else
+        echo "The right architecture."
+    fi
+}
+
 check_all_yum() {
     local missing=""
     for pkg in $1; do

include/_mgp.hpp

@@ -0,0 +1,693 @@
+// Copyright 2022 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
+/// @file _mgp.hpp
+///
+/// The file contains methods that connect mg procedures and the outside code
+/// Methods like mapping a graph into memory or assigning new mg results or
+/// their properties are implemented.
+#pragma once
+
+#include "mg_exceptions.hpp"
+#include "mg_procedure.h"
+
+namespace mgp {
+
+namespace {
+void MgExceptionHandle(mgp_error result_code) {
+  switch (result_code) {
+    case mgp_error::MGP_ERROR_UNKNOWN_ERROR:
+      throw mg_exception::UnknownException();
+    case mgp_error::MGP_ERROR_UNABLE_TO_ALLOCATE:
+      throw mg_exception::AllocationException();
+    case mgp_error::MGP_ERROR_INSUFFICIENT_BUFFER:
+      throw mg_exception::InsufficientBufferException();
+    case mgp_error::MGP_ERROR_OUT_OF_RANGE:
+      throw mg_exception::OutOfRangeException();
+    case mgp_error::MGP_ERROR_LOGIC_ERROR:
+      throw mg_exception::LogicException();
+    case mgp_error::MGP_ERROR_DELETED_OBJECT:
+      throw mg_exception::DeletedObjectException();
+    case mgp_error::MGP_ERROR_INVALID_ARGUMENT:
+      throw mg_exception::InvalidArgumentException();
+    case mgp_error::MGP_ERROR_KEY_ALREADY_EXISTS:
+      throw mg_exception::KeyAlreadyExistsException();
+    case mgp_error::MGP_ERROR_IMMUTABLE_OBJECT:
+      throw mg_exception::ImmutableObjectException();
+    case mgp_error::MGP_ERROR_VALUE_CONVERSION:
+      throw mg_exception::ValueConversionException();
+    case mgp_error::MGP_ERROR_SERIALIZATION_ERROR:
+      throw mg_exception::SerializationException();
+    default:
+      return;
+  }
+}
+
+template <typename TResult, typename TFunc, typename... TArgs>
+TResult MgInvoke(TFunc func, TArgs... args) {
+  TResult result{};
+
+  auto result_code = func(args..., &result);
+  MgExceptionHandle(result_code);
+
+  return result;
+}
+
+template <typename TFunc, typename... TArgs>
+void MgInvokeVoid(TFunc func, TArgs... args) {
+  auto result_code = func(args...);
+  MgExceptionHandle(result_code);
+}
+}  // namespace
+
+// mgp_value
+
+// Make value
+
+mgp_value *value_make_null(mgp_memory *memory) { return MgInvoke<mgp_value *>(mgp_value_make_null, memory); }
+
+mgp_value *value_make_bool(int val, mgp_memory *memory) {
+  return MgInvoke<mgp_value *>(mgp_value_make_bool, val, memory);
+}
+
+mgp_value *value_make_int(int64_t val, mgp_memory *memory) {
+  return MgInvoke<mgp_value *>(mgp_value_make_int, val, memory);
+}
+
+mgp_value *value_make_double(double val, mgp_memory *memory) {
+  return MgInvoke<mgp_value *>(mgp_value_make_double, val, memory);
+}
+
+mgp_value *value_make_string(const char *val, mgp_memory *memory) {
+  return MgInvoke<mgp_value *>(mgp_value_make_string, val, memory);
+}
+
+mgp_value *value_make_list(mgp_list *val) { return MgInvoke<mgp_value *>(mgp_value_make_list, val); }
+
+mgp_value *value_make_map(mgp_map *val) { return MgInvoke<mgp_value *>(mgp_value_make_map, val); }
+
+mgp_value *value_make_vertex(mgp_vertex *val) { return MgInvoke<mgp_value *>(mgp_value_make_vertex, val); }
+
+mgp_value *value_make_edge(mgp_edge *val) { return MgInvoke<mgp_value *>(mgp_value_make_edge, val); }
+
+mgp_value *value_make_path(mgp_path *val) { return MgInvoke<mgp_value *>(mgp_value_make_path, val); }
+
+mgp_value *value_make_date(mgp_date *val) { return MgInvoke<mgp_value *>(mgp_value_make_date, val); }
+
+mgp_value *value_make_local_time(mgp_local_time *val) { return MgInvoke<mgp_value *>(mgp_value_make_local_time, val); }
+
+mgp_value *value_make_local_date_time(mgp_local_date_time *val) {
+  return MgInvoke<mgp_value *>(mgp_value_make_local_date_time, val);
+}
+
+mgp_value *value_make_duration(mgp_duration *val) { return MgInvoke<mgp_value *>(mgp_value_make_duration, val); }
+
+// Copy value
+
+// TODO: implement within MGP API
+// with primitive types ({bool, int, double, string}), create a new identical value
+// otherwise call mgp_##TYPE_copy and convert tpye
+mgp_value *value_copy(mgp_value *val, mgp_memory *memory) { return MgInvoke<mgp_value *>(mgp_value_copy, val, memory); }
+
+// Destroy value
+
+void value_destroy(mgp_value *val) { mgp_value_destroy(val); }
+
+// Get value of type
+
+mgp_value_type value_get_type(mgp_value *val) { return MgInvoke<mgp_value_type>(mgp_value_get_type, val); }
+
+bool value_get_bool(mgp_value *val) { return MgInvoke<int>(mgp_value_get_bool, val); }
+
+int64_t value_get_int(mgp_value *val) { return MgInvoke<int64_t>(mgp_value_get_int, val); }
+
+double value_get_double(mgp_value *val) { return MgInvoke<double>(mgp_value_get_double, val); }
+
+const char *value_get_string(mgp_value *val) { return MgInvoke<const char *>(mgp_value_get_string, val); }
+
+mgp_list *value_get_list(mgp_value *val) { return MgInvoke<mgp_list *>(mgp_value_get_list, val); }
+
+mgp_map *value_get_map(mgp_value *val) { return MgInvoke<mgp_map *>(mgp_value_get_map, val); }
+
+mgp_vertex *value_get_vertex(mgp_value *val) { return MgInvoke<mgp_vertex *>(mgp_value_get_vertex, val); }
+
+mgp_edge *value_get_edge(mgp_value *val) { return MgInvoke<mgp_edge *>(mgp_value_get_edge, val); }
+
+mgp_path *value_get_path(mgp_value *val) { return MgInvoke<mgp_path *>(mgp_value_get_path, val); }
+
+mgp_date *value_get_date(mgp_value *val) { return MgInvoke<mgp_date *>(mgp_value_get_date, val); }
+
+mgp_local_time *value_get_local_time(mgp_value *val) {
+  return MgInvoke<mgp_local_time *>(mgp_value_get_local_time, val);
+}
+
+mgp_local_date_time *value_get_local_date_time(mgp_value *val) {
+  return MgInvoke<mgp_local_date_time *>(mgp_value_get_local_date_time, val);
+}
+
+mgp_duration *value_get_duration(mgp_value *val) { return MgInvoke<mgp_duration *>(mgp_value_get_duration, val); }
+
+// Check type of value
+
+bool value_is_null(mgp_value *val) { return MgInvoke<int>(mgp_value_is_null, val); }
+
+bool value_is_bool(mgp_value *val) { return MgInvoke<int>(mgp_value_is_bool, val); }
+
+bool value_is_int(mgp_value *val) { return MgInvoke<int>(mgp_value_is_int, val); }
+
+bool value_is_double(mgp_value *val) { return MgInvoke<int>(mgp_value_is_double, val); }
+
+bool value_is_string(mgp_value *val) { return MgInvoke<int>(mgp_value_is_string, val); }
+
+bool value_is_list(mgp_value *val) { return MgInvoke<int>(mgp_value_is_list, val); }
+
+bool value_is_map(mgp_value *val) { return MgInvoke<int>(mgp_value_is_map, val); }
+
+bool value_is_vertex(mgp_value *val) { return MgInvoke<int>(mgp_value_is_vertex, val); }
+
+bool value_is_edge(mgp_value *val) { return MgInvoke<int>(mgp_value_is_edge, val); }
+
+bool value_is_path(mgp_value *val) { return MgInvoke<int>(mgp_value_is_path, val); }
+
+bool value_is_date(mgp_value *val) { return MgInvoke<int>(mgp_value_is_date, val); }
+
+bool value_is_local_time(mgp_value *val) { return MgInvoke<int>(mgp_value_is_local_time, val); }
+
+bool value_is_local_date_time(mgp_value *val) { return MgInvoke<int>(mgp_value_is_local_date_time, val); }
+
+bool value_is_duration(mgp_value *val) { return MgInvoke<int>(mgp_value_is_duration, val); }
+
+// Get type
+
+mgp_type *type_any() { return MgInvoke<mgp_type *>(mgp_type_any); }
+
+mgp_type *type_bool() { return MgInvoke<mgp_type *>(mgp_type_bool); }
+
+mgp_type *type_string() { return MgInvoke<mgp_type *>(mgp_type_string); }
+
+mgp_type *type_int() { return MgInvoke<mgp_type *>(mgp_type_int); }
+
+mgp_type *type_float() { return MgInvoke<mgp_type *>(mgp_type_float); }
+
+mgp_type *type_number() { return MgInvoke<mgp_type *>(mgp_type_number); }
+
+mgp_type *type_list(mgp_type *element_type) { return MgInvoke<mgp_type *>(mgp_type_list, element_type); }
+
+mgp_type *type_map() { return MgInvoke<mgp_type *>(mgp_type_map); }
+
+mgp_type *type_node() { return MgInvoke<mgp_type *>(mgp_type_node); }
+
+mgp_type *type_relationship() { return MgInvoke<mgp_type *>(mgp_type_relationship); }
+
+mgp_type *type_path() { return MgInvoke<mgp_type *>(mgp_type_path); }
+
+mgp_type *type_date() { return MgInvoke<mgp_type *>(mgp_type_date); }
+
+mgp_type *type_local_time() { return MgInvoke<mgp_type *>(mgp_type_local_time); }
+
+mgp_type *type_local_date_time() { return MgInvoke<mgp_type *>(mgp_type_local_date_time); }
+
+mgp_type *type_duration() { return MgInvoke<mgp_type *>(mgp_type_duration); }
+
+mgp_type *type_nullable(mgp_type *type) { return MgInvoke<mgp_type *>(mgp_type_nullable, type); }
+
+// mgp_graph
+
+bool graph_is_mutable(mgp_graph *graph) { return MgInvoke<int>(mgp_graph_is_mutable, graph); }
+
+mgp_vertex *graph_create_vertex(mgp_graph *graph, mgp_memory *memory) {
+  return MgInvoke<mgp_vertex *>(mgp_graph_create_vertex, graph, memory);
+}
+
+void graph_delete_vertex(mgp_graph *graph, mgp_vertex *vertex) { MgInvokeVoid(mgp_graph_delete_vertex, graph, vertex); }
+
+void graph_detach_delete_vertex(mgp_graph *graph, mgp_vertex *vertex) {
+  MgInvokeVoid(mgp_graph_detach_delete_vertex, graph, vertex);
+}
+
+mgp_edge *graph_create_edge(mgp_graph *graph, mgp_vertex *from, mgp_vertex *to, mgp_edge_type type,
+                            mgp_memory *memory) {
+  return MgInvoke<mgp_edge *>(mgp_graph_create_edge, graph, from, to, type, memory);
+}
+
+void graph_delete_edge(mgp_graph *graph, mgp_edge *edge) { MgInvokeVoid(mgp_graph_delete_edge, graph, edge); }
+
+mgp_vertex *graph_get_vertex_by_id(mgp_graph *g, mgp_vertex_id id, mgp_memory *memory) {
+  return MgInvoke<mgp_vertex *>(mgp_graph_get_vertex_by_id, g, id, memory);
+}
+
+mgp_vertices_iterator *graph_iter_vertices(mgp_graph *g, mgp_memory *memory) {
+  return MgInvoke<mgp_vertices_iterator *>(mgp_graph_iter_vertices, g, memory);
+}
+
+// mgp_vertices_iterator
+
+void vertices_iterator_destroy(mgp_vertices_iterator *it) { mgp_vertices_iterator_destroy(it); }
+
+mgp_vertex *vertices_iterator_get(mgp_vertices_iterator *it) {
+  return MgInvoke<mgp_vertex *>(mgp_vertices_iterator_get, it);
+}
+
+mgp_vertex *vertices_iterator_next(mgp_vertices_iterator *it) {
+  return MgInvoke<mgp_vertex *>(mgp_vertices_iterator_next, it);
+}
+
+// mgp_edges_iterator
+
+void edges_iterator_destroy(mgp_edges_iterator *it) { mgp_edges_iterator_destroy(it); }
+
+mgp_edge *edges_iterator_get(mgp_edges_iterator *it) { return MgInvoke<mgp_edge *>(mgp_edges_iterator_get, it); }
+
+mgp_edge *edges_iterator_next(mgp_edges_iterator *it) { return MgInvoke<mgp_edge *>(mgp_edges_iterator_next, it); }
+
+// mgp_properties_iterator
+
+void properties_iterator_destroy(mgp_properties_iterator *it) { mgp_properties_iterator_destroy(it); }
+
+mgp_property *properties_iterator_get(mgp_properties_iterator *it) {
+  return MgInvoke<mgp_property *>(mgp_properties_iterator_get, it);
+}
+
+mgp_property *properties_iterator_next(mgp_properties_iterator *it) {
+  return MgInvoke<mgp_property *>(mgp_properties_iterator_next, it);
+}
+
+// Container {mgp_list, mgp_map} methods
+
+// mgp_list
+
+mgp_list *list_make_empty(size_t capacity, mgp_memory *memory) {
+  return MgInvoke<mgp_list *>(mgp_list_make_empty, capacity, memory);
+}
+
+mgp_list *list_copy(mgp_list *list, mgp_memory *memory) { return MgInvoke<mgp_list *>(mgp_list_copy, list, memory); }
+
+void list_destroy(mgp_list *list) { mgp_list_destroy(list); }
+
+void list_append(mgp_list *list, mgp_value *val) { MgInvokeVoid(mgp_list_append, list, val); }
+
+void list_append_extend(mgp_list *list, mgp_value *val) { MgInvokeVoid(mgp_list_append_extend, list, val); }
+
+size_t list_size(mgp_list *list) { return MgInvoke<size_t>(mgp_list_size, list); }
+
+size_t list_capacity(mgp_list *list) { return MgInvoke<size_t>(mgp_list_capacity, list); }
+
+mgp_value *list_at(mgp_list *list, size_t index) { return MgInvoke<mgp_value *>(mgp_list_at, list, index); }
+
+// mgp_map
+
+mgp_map *map_make_empty(mgp_memory *memory) { return MgInvoke<mgp_map *>(mgp_map_make_empty, memory); }
+
+mgp_map *map_copy(mgp_map *map, mgp_memory *memory) { return MgInvoke<mgp_map *>(mgp_map_copy, map, memory); }
+
+void map_destroy(mgp_map *map) { mgp_map_destroy(map); }
+
+void map_insert(mgp_map *map, const char *key, mgp_value *value) { MgInvokeVoid(mgp_map_insert, map, key, value); }
+
+size_t map_size(mgp_map *map) { return MgInvoke<size_t>(mgp_map_size, map); }
+
+mgp_value *map_at(mgp_map *map, const char *key) { return MgInvoke<mgp_value *>(mgp_map_at, map, key); }
+
+const char *map_item_key(mgp_map_item *item) { return MgInvoke<const char *>(mgp_map_item_key, item); }
+
+mgp_value *map_item_value(mgp_map_item *item) { return MgInvoke<mgp_value *>(mgp_map_item_value, item); }
+
+mgp_map_items_iterator *map_iter_items(mgp_map *map, mgp_memory *memory) {
+  return MgInvoke<mgp_map_items_iterator *>(mgp_map_iter_items, map, memory);
+}
+
+void map_items_iterator_destroy(mgp_map_items_iterator *it) { mgp_map_items_iterator_destroy(it); }
+
+mgp_map_item *map_items_iterator_get(mgp_map_items_iterator *it) {
+  return MgInvoke<mgp_map_item *>(mgp_map_items_iterator_get, it);
+}
+
+mgp_map_item *map_items_iterator_next(mgp_map_items_iterator *it) {
+  return MgInvoke<mgp_map_item *>(mgp_map_items_iterator_next, it);
+}
+
+// mgp_vertex
+
+mgp_vertex_id vertex_get_id(mgp_vertex *v) { return MgInvoke<mgp_vertex_id>(mgp_vertex_get_id, v); }
+
+mgp_vertex *vertex_copy(mgp_vertex *v, mgp_memory *memory) {
+  return MgInvoke<mgp_vertex *>(mgp_vertex_copy, v, memory);
+}
+
+void vertex_destroy(mgp_vertex *v) { mgp_vertex_destroy(v); }
+
+bool vertex_equal(mgp_vertex *v1, mgp_vertex *v2) { return MgInvoke<int>(mgp_vertex_equal, v1, v2); }
+
+size_t vertex_labels_count(mgp_vertex *v) { return MgInvoke<size_t>(mgp_vertex_labels_count, v); }
+
+mgp_label vertex_label_at(mgp_vertex *v, size_t index) { return MgInvoke<mgp_label>(mgp_vertex_label_at, v, index); }
+
+bool vertex_has_label(mgp_vertex *v, mgp_label label) { return MgInvoke<int>(mgp_vertex_has_label, v, label); }
+
+bool vertex_has_label_named(mgp_vertex *v, const char *label_name) {
+  return MgInvoke<int>(mgp_vertex_has_label_named, v, label_name);
+}
+
+void vertex_add_label(mgp_vertex *vertex, mgp_label label) { MgInvokeVoid(mgp_vertex_add_label, vertex, label); }
+
+mgp_value *vertex_get_property(mgp_vertex *v, const char *property_name, mgp_memory *memory) {
+  return MgInvoke<mgp_value *>(mgp_vertex_get_property, v, property_name, memory);
+}
+
+mgp_properties_iterator *vertex_iter_properties(mgp_vertex *v, mgp_memory *memory) {
+  return MgInvoke<mgp_properties_iterator *>(mgp_vertex_iter_properties, v, memory);
+}
+
+mgp_edges_iterator *vertex_iter_in_edges(mgp_vertex *v, mgp_memory *memory) {
+  return MgInvoke<mgp_edges_iterator *>(mgp_vertex_iter_in_edges, v, memory);
+}
+
+mgp_edges_iterator *vertex_iter_out_edges(mgp_vertex *v, mgp_memory *memory) {
+  return MgInvoke<mgp_edges_iterator *>(mgp_vertex_iter_out_edges, v, memory);
+}
+
+// mgp_edge
+
+mgp_edge_id edge_get_id(mgp_edge *e) { return MgInvoke<mgp_edge_id>(mgp_edge_get_id, e); }
+
+mgp_edge *edge_copy(mgp_edge *e, mgp_memory *memory) { return MgInvoke<mgp_edge *>(mgp_edge_copy, e, memory); }
+
+void edge_destroy(mgp_edge *e) { mgp_edge_destroy(e); }
+
+bool edge_equal(mgp_edge *e1, mgp_edge *e2) { return MgInvoke<int>(mgp_edge_equal, e1, e2); }
+
+mgp_edge_type edge_get_type(mgp_edge *e) { return MgInvoke<mgp_edge_type>(mgp_edge_get_type, e); }
+
+mgp_vertex *edge_get_from(mgp_edge *e) { return MgInvoke<mgp_vertex *>(mgp_edge_get_from, e); }
+
+mgp_vertex *edge_get_to(mgp_edge *e) { return MgInvoke<mgp_vertex *>(mgp_edge_get_to, e); }
+
+mgp_value *edge_get_property(mgp_edge *e, const char *property_name, mgp_memory *memory) {
+  return MgInvoke<mgp_value *>(mgp_edge_get_property, e, property_name, memory);
+}
+
+mgp_properties_iterator *edge_iter_properties(mgp_edge *e, mgp_memory *memory) {
+  return MgInvoke<mgp_properties_iterator *>(mgp_edge_iter_properties, e, memory);
+}
+
+// mgp_path
+
+mgp_path *path_make_with_start(mgp_vertex *vertex, mgp_memory *memory) {
+  return MgInvoke<mgp_path *>(mgp_path_make_with_start, vertex, memory);
+}
+
+mgp_path *path_copy(mgp_path *path, mgp_memory *memory) { return MgInvoke<mgp_path *>(mgp_path_copy, path, memory); }
+
+void path_destroy(mgp_path *path) { mgp_path_destroy(path); }
+
+void path_expand(mgp_path *path, mgp_edge *edge) { MgInvokeVoid(mgp_path_expand, path, edge); }
+
+size_t path_size(mgp_path *path) { return MgInvoke<size_t>(mgp_path_size, path); }
+
+mgp_vertex *path_vertex_at(mgp_path *path, size_t index) {
+  return MgInvoke<mgp_vertex *>(mgp_path_vertex_at, path, index);
+}
+
+mgp_edge *path_edge_at(mgp_path *path, size_t index) { return MgInvoke<mgp_edge *>(mgp_path_edge_at, path, index); }
+
+bool path_equal(mgp_path *p1, mgp_path *p2) { return MgInvoke<int>(mgp_path_equal, p1, p2); }
+
+// Temporal type {mgp_date, mgp_local_time, mgp_local_date_time, mgp_duration} methods
+
+// mgp_date
+
+mgp_date *date_from_string(const char *string, mgp_memory *memory) {
+  return MgInvoke<mgp_date *>(mgp_date_from_string, string, memory);
+}
+
+mgp_date *date_from_parameters(mgp_date_parameters *parameters, mgp_memory *memory) {
+  return MgInvoke<mgp_date *>(mgp_date_from_parameters, parameters, memory);
+}
+
+mgp_date *date_copy(mgp_date *date, mgp_memory *memory) { return MgInvoke<mgp_date *>(mgp_date_copy, date, memory); }
+
+void date_destroy(mgp_date *date) { mgp_date_destroy(date); }
+
+bool date_equal(mgp_date *first, mgp_date *second) { return MgInvoke<int>(mgp_date_equal, first, second); }
+
+int date_get_year(mgp_date *date) { return MgInvoke<int>(mgp_date_get_year, date); }
+
+int date_get_month(mgp_date *date) { return MgInvoke<int>(mgp_date_get_month, date); }
+
+int date_get_day(mgp_date *date) { return MgInvoke<int>(mgp_date_get_day, date); }
+
+int64_t date_timestamp(mgp_date *date) { return MgInvoke<int64_t>(mgp_date_timestamp, date); }
+
+mgp_date *date_now(mgp_memory *memory) { return MgInvoke<mgp_date *>(mgp_date_now, memory); }
+
+mgp_date *date_add_duration(mgp_date *date, mgp_duration *dur, mgp_memory *memory) {
+  return MgInvoke<mgp_date *>(mgp_date_add_duration, date, dur, memory);
+}
+
+mgp_date *date_sub_duration(mgp_date *date, mgp_duration *dur, mgp_memory *memory) {
+  return MgInvoke<mgp_date *>(mgp_date_sub_duration, date, dur, memory);
+}
+
+mgp_duration *date_diff(mgp_date *first, mgp_date *second, mgp_memory *memory) {
+  return MgInvoke<mgp_duration *>(mgp_date_diff, first, second, memory);
+}
+
+// mgp_local_time
+
+mgp_local_time *local_time_from_string(const char *string, mgp_memory *memory) {
+  return MgInvoke<mgp_local_time *>(mgp_local_time_from_string, string, memory);
+}
+
+mgp_local_time *local_time_from_parameters(mgp_local_time_parameters *parameters, mgp_memory *memory) {
+  return MgInvoke<mgp_local_time *>(mgp_local_time_from_parameters, parameters, memory);
+}
+
+mgp_local_time *local_time_copy(mgp_local_time *local_time, mgp_memory *memory) {
+  return MgInvoke<mgp_local_time *>(mgp_local_time_copy, local_time, memory);
+}
+
+void local_time_destroy(mgp_local_time *local_time) { mgp_local_time_destroy(local_time); }
+
+bool local_time_equal(mgp_local_time *first, mgp_local_time *second) {
+  return MgInvoke<int>(mgp_local_time_equal, first, second);
+}
+
+int local_time_get_hour(mgp_local_time *local_time) { return MgInvoke<int>(mgp_local_time_get_hour, local_time); }
+
+int local_time_get_minute(mgp_local_time *local_time) { return MgInvoke<int>(mgp_local_time_get_minute, local_time); }
+
+int local_time_get_second(mgp_local_time *local_time) { return MgInvoke<int>(mgp_local_time_get_second, local_time); }
+
+int local_time_get_millisecond(mgp_local_time *local_time) {
+  return MgInvoke<int>(mgp_local_time_get_millisecond, local_time);
+}
+
+int local_time_get_microsecond(mgp_local_time *local_time) {
+  return MgInvoke<int>(mgp_local_time_get_microsecond, local_time);
+}
+
+int64_t local_time_timestamp(mgp_local_time *local_time) {
+  return MgInvoke<int64_t>(mgp_local_time_timestamp, local_time);
+}
+
+mgp_local_time *local_time_now(mgp_memory *memory) { return MgInvoke<mgp_local_time *>(mgp_local_time_now, memory); }
+
+mgp_local_time *local_time_add_duration(mgp_local_time *local_time, mgp_duration *dur, mgp_memory *memory) {
+  return MgInvoke<mgp_local_time *>(mgp_local_time_add_duration, local_time, dur, memory);
+}
+
+mgp_local_time *local_time_sub_duration(mgp_local_time *local_time, mgp_duration *dur, mgp_memory *memory) {
+  return MgInvoke<mgp_local_time *>(mgp_local_time_sub_duration, local_time, dur, memory);
+}
+
+mgp_duration *local_time_diff(mgp_local_time *first, mgp_local_time *second, mgp_memory *memory) {
+  return MgInvoke<mgp_duration *>(mgp_local_time_diff, first, second, memory);
+}
+
+// mgp_local_date_time
+
+mgp_local_date_time *local_date_time_from_string(const char *string, mgp_memory *memory) {
+  return MgInvoke<mgp_local_date_time *>(mgp_local_date_time_from_string, string, memory);
+}
+
+mgp_local_date_time *local_date_time_from_parameters(mgp_local_date_time_parameters *parameters, mgp_memory *memory) {
+  return MgInvoke<mgp_local_date_time *>(mgp_local_date_time_from_parameters, parameters, memory);
+}
+
+mgp_local_date_time *local_date_time_copy(mgp_local_date_time *local_date_time, mgp_memory *memory) {
+  return MgInvoke<mgp_local_date_time *>(mgp_local_date_time_copy, local_date_time, memory);
+}
+
+void local_date_time_destroy(mgp_local_date_time *local_date_time) { mgp_local_date_time_destroy(local_date_time); }
+
+bool local_date_time_equal(mgp_local_date_time *first, mgp_local_date_time *second) {
+  return MgInvoke<int>(mgp_local_date_time_equal, first, second);
+}
+
+int local_date_time_get_year(mgp_local_date_time *local_date_time) {
+  return MgInvoke<int>(mgp_local_date_time_get_year, local_date_time);
+}
+
+int local_date_time_get_month(mgp_local_date_time *local_date_time) {
+  return MgInvoke<int>(mgp_local_date_time_get_month, local_date_time);
+}
+
+int local_date_time_get_day(mgp_local_date_time *local_date_time) {
+  return MgInvoke<int>(mgp_local_date_time_get_day, local_date_time);
+}
+
+int local_date_time_get_hour(mgp_local_date_time *local_date_time) {
+  return MgInvoke<int>(mgp_local_date_time_get_hour, local_date_time);
+}
+
+int local_date_time_get_minute(mgp_local_date_time *local_date_time) {
+  return MgInvoke<int>(mgp_local_date_time_get_minute, local_date_time);
+}
+
+int local_date_time_get_second(mgp_local_date_time *local_date_time) {
+  return MgInvoke<int>(mgp_local_date_time_get_second, local_date_time);
+}
+
+int local_date_time_get_millisecond(mgp_local_date_time *local_date_time) {
+  return MgInvoke<int>(mgp_local_date_time_get_millisecond, local_date_time);
+}
+
+int local_date_time_get_microsecond(mgp_local_date_time *local_date_time) {
+  return MgInvoke<int>(mgp_local_date_time_get_microsecond, local_date_time);
+}
+
+int64_t local_date_time_timestamp(mgp_local_date_time *local_date_time) {
+  return MgInvoke<int64_t>(mgp_local_date_time_timestamp, local_date_time);
+}
+
+mgp_local_date_time *local_date_time_now(mgp_memory *memory) {
+  return MgInvoke<mgp_local_date_time *>(mgp_local_date_time_now, memory);
+}
+
+mgp_local_date_time *local_date_time_add_duration(mgp_local_date_time *local_date_time, mgp_duration *dur,
+                                                  mgp_memory *memory) {
+  return MgInvoke<mgp_local_date_time *>(mgp_local_date_time_add_duration, local_date_time, dur, memory);
+}
+
+mgp_local_date_time *local_date_time_sub_duration(mgp_local_date_time *local_date_time, mgp_duration *dur,
+                                                  mgp_memory *memory) {
+  return MgInvoke<mgp_local_date_time *>(mgp_local_date_time_sub_duration, local_date_time, dur, memory);
+}
+
+mgp_duration *local_date_time_diff(mgp_local_date_time *first, mgp_local_date_time *second, mgp_memory *memory) {
+  return MgInvoke<mgp_duration *>(mgp_local_date_time_diff, first, second, memory);
+}
+
+// mgp_duration
+
+mgp_duration *duration_from_string(const char *string, mgp_memory *memory) {
+  return MgInvoke<mgp_duration *>(mgp_duration_from_string, string, memory);
+}
+
+mgp_duration *duration_from_parameters(mgp_duration_parameters *parameters, mgp_memory *memory) {
+  return MgInvoke<mgp_duration *>(mgp_duration_from_parameters, parameters, memory);
+}
+
+mgp_duration *duration_from_microseconds(int64_t microseconds, mgp_memory *memory) {
+  return MgInvoke<mgp_duration *>(mgp_duration_from_microseconds, microseconds, memory);
+}
+
+mgp_duration *duration_copy(mgp_duration *duration, mgp_memory *memory) {
+  return MgInvoke<mgp_duration *>(mgp_duration_copy, duration, memory);
+}
+
+void duration_destroy(mgp_duration *duration) { mgp_duration_destroy(duration); }
+
+int64_t duration_get_microseconds(mgp_duration *duration) {
+  return MgInvoke<int64_t>(mgp_duration_get_microseconds, duration);
+}
+
+bool duration_equal(mgp_duration *first, mgp_duration *second) {
+  return MgInvoke<int>(mgp_duration_equal, first, second);
+}
+
+mgp_duration *duration_neg(mgp_duration *duration, mgp_memory *memory) {
+  return MgInvoke<mgp_duration *>(mgp_duration_neg, duration, memory);
+}
+
+mgp_duration *duration_add(mgp_duration *first, mgp_duration *second, mgp_memory *memory) {
+  return MgInvoke<mgp_duration *>(mgp_duration_add, first, second, memory);
+}
+
+mgp_duration *duration_sub(mgp_duration *first, mgp_duration *second, mgp_memory *memory) {
+  return MgInvoke<mgp_duration *>(mgp_duration_sub, first, second, memory);
+}
+
+// Procedure
+
+mgp_proc *module_add_read_procedure(mgp_module *module, const char *name, mgp_proc_cb cb) {
+  return MgInvoke<mgp_proc *>(mgp_module_add_read_procedure, module, name, cb);
+}
+
+mgp_proc *module_add_write_procedure(mgp_module *module, const char *name, mgp_proc_cb cb) {
+  return MgInvoke<mgp_proc *>(mgp_module_add_write_procedure, module, name, cb);
+}
+
+void proc_add_arg(mgp_proc *proc, const char *name, mgp_type *type) {
+  MgInvokeVoid(mgp_proc_add_arg, proc, name, type);
+}
+
+void proc_add_opt_arg(mgp_proc *proc, const char *name, mgp_type *type, mgp_value *default_value) {
+  MgInvokeVoid(mgp_proc_add_opt_arg, proc, name, type, default_value);
+}
+
+void proc_add_result(mgp_proc *proc, const char *name, mgp_type *type) {
+  MgInvokeVoid(mgp_proc_add_result, proc, name, type);
+}
+
+void proc_add_deprecated_result(mgp_proc *proc, const char *name, mgp_type *type) {
+  MgInvokeVoid(mgp_proc_add_deprecated_result, proc, name, type);
+}
+
+bool must_abort(mgp_graph *graph) { return mgp_must_abort(graph); }
+
+// mgp_result
+
+void result_set_error_msg(mgp_result *res, const char *error_msg) {
+  MgInvokeVoid(mgp_result_set_error_msg, res, error_msg);
+}
+
+mgp_result_record *result_new_record(mgp_result *res) {
+  return MgInvoke<mgp_result_record *>(mgp_result_new_record, res);
+}
+
+void result_record_insert(mgp_result_record *record, const char *field_name, mgp_value *val) {
+  MgInvokeVoid(mgp_result_record_insert, record, field_name, val);
+}
+
+// Function
+
+mgp_func *module_add_function(mgp_module *module, const char *name, mgp_func_cb cb) {
+  return MgInvoke<mgp_func *>(mgp_module_add_function, module, name, cb);
+}
+
+void func_add_arg(mgp_func *func, const char *name, mgp_type *type) {
+  MgInvokeVoid(mgp_func_add_arg, func, name, type);
+}
+
+void func_add_opt_arg(mgp_func *func, const char *name, mgp_type *type, mgp_value *default_value) {
+  MgInvokeVoid(mgp_func_add_opt_arg, func, name, type, default_value);
+}
+
+void func_result_set_error_msg(mgp_func_result *res, const char *msg, mgp_memory *memory) {
+  MgInvokeVoid(mgp_func_result_set_error_msg, res, msg, memory);
+}
+
+void func_result_set_value(mgp_func_result *res, mgp_value *value, mgp_memory *memory) {
+  MgInvokeVoid(mgp_func_result_set_value, res, value, memory);
+}
+
+}  // namespace mgp

include/mg_exceptions.hpp

@@ -0,0 +1,57 @@
+// Copyright 2022 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
+#pragma once
+
+#include <exception>
+#include <iostream>
+
+namespace mg_exception {
+struct NotEnoughMemoryException : public std::exception {
+  const char *what() const throw() { return "Not enough memory!"; }
+};
+struct UnknownException : public std::exception {
+  const char *what() const throw() { return "Unknown exception!"; }
+};
+struct AllocationException : public std::exception {
+  const char *what() const throw() { return "Could not allocate memory!"; }
+};
+struct InsufficientBufferException : public std::exception {
+  const char *what() const throw() { return "Buffer is not sufficient to process procedure!"; }
+};
+struct OutOfRangeException : public std::exception {
+  const char *what() const throw() { return "Index out of range!"; }
+};
+struct LogicException : public std::exception {
+  const char *what() const throw() { return "Logic exception, check the procedure signature!"; }
+};
+struct DeletedObjectException : public std::exception {
+  const char *what() const throw() { return "Object is deleted!"; }
+};
+struct InvalidArgumentException : public std::exception {
+  const char *what() const throw() { return "Invalid argument!"; }
+};
+struct InvalidIDException : public std::exception {
+  const char *what() const throw() { return "Invalid ID!"; }
+};
+struct KeyAlreadyExistsException : public std::exception {
+  const char *what() const throw() { return "Key you are trying to set already exists!"; }
+};
+struct ImmutableObjectException : public std::exception {
+  const char *what() const throw() { return "Object you are trying to change is immutable!"; }
+};
+struct ValueConversionException : public std::exception {
+  const char *what() const throw() { return "Error in value conversion!"; }
+};
+struct SerializationException : public std::exception {
+  const char *what() const throw() { return "Error in serialization!"; }
+};
+}  // namespace mg_exception

init

@@ -10,6 +10,8 @@ function print_help () {
     echo -e "Check for missing packages and setup the project.\n"
     echo "Optional arguments:"
     echo -e "  -h\tdisplay this help and exit"
+    echo -e "  --without-libs-setup\tskip the step for setting up libs"
+    echo -e "  --wsl-quicklisp-proxy \"host:port\"\tquicklist HTTP proxy (this flag + HTTP proxy are required on WSL)"
 }
 
 function setup_virtualenv () {
@@ -22,7 +24,7 @@ function setup_virtualenv () {
     fi
 
     # create new virtualenv
-    virtualenv -p python3 ve3 || exit 1
+    python3 -m virtualenv -p python3 ve3 || exit 1
     source ve3/bin/activate
     pip --timeout 1000 install -r requirements.txt || exit 1
     deactivate
@@ -30,26 +32,47 @@ function setup_virtualenv () {
     popd > /dev/null
 }
 
-if [[ $# -gt 1 ]]; then
+wsl_quicklisp_proxy=""
+setup_libs=true
+if [[ $# -eq 1 && "$1" == "-h" ]]; then
     print_help
-    exit 1
-elif  [[ $# -eq 1 ]]; then
-    case "$1" in
-      -h)
-          print_help
-          exit 0
-      ;;
-      *)
-          # unknown option
-          print_help
-          exit 1
-      ;;
-  esac
+    exit 0
+else
+    while(($#)); do
+        case "$1" in
+          --wsl-quicklisp-proxy)
+              shift
+              if [[ $# -eq 0 ]]; then
+                  echo "Missing proxy URL"
+                  print_help
+                  exit 1
+              fi
+              wsl_quicklisp_proxy=":proxy \"http://$1/\""
+              shift
+          ;;
+          --without-libs-setup)
+              shift
+              setup_libs=false
+          ;;
+          *)
+              # unknown option
+              echo "Invalid argument provided: $1"
+              print_help
+              exit 1
+          ;;
+        esac
+    done
 fi
 
 DISTRO=$(operating_system)
-echo "ALL BUILD PACKAGES: $($DIR/environment/os/$DISTRO.sh list MEMGRAPH_BUILD_DEPS)"
-$DIR/environment/os/$DISTRO.sh check MEMGRAPH_BUILD_DEPS
+ARCHITECTURE=$(architecture)
+if [ "${ARCHITECTURE}" = "arm64" ] || [ "${ARCHITECTURE}" = "aarch64" ]; then
+  OS_SCRIPT=$DIR/environment/os/$DISTRO-arm.sh
+else
+  OS_SCRIPT=$DIR/environment/os/$DISTRO.sh
+fi
+echo "ALL BUILD PACKAGES: $($OS_SCRIPT list MEMGRAPH_BUILD_DEPS)"
+$OS_SCRIPT check MEMGRAPH_BUILD_DEPS
 echo "All packages are in-place..."
 
 # create a default build directory
@@ -66,7 +89,7 @@ if [[ ! -f "${quicklisp_install_dir}/setup.lisp" ]]; then
   echo \
   "
   (load \"${DIR}/quicklisp.lisp\")
-  (quicklisp-quickstart:install :path \"${quicklisp_install_dir}\")
+  (quicklisp-quickstart:install $wsl_quicklisp_proxy :path \"${quicklisp_install_dir}\")
   " | sbcl --script || exit 1
   rm -rf quicklisp.lisp || exit 1
 fi
@@ -80,11 +103,13 @@ echo \
   (ql:quickload '(:lcp :lcp/test) :silent t)
   " | sbcl --script
 
-# Setup libs (download).
-cd libs
-./cleanup.sh
-./setup.sh
-cd ..
+if [[ "$setup_libs" == "true" ]]; then
+    # Setup libs (download).
+    cd libs
+    ./cleanup.sh
+    ./setup.sh
+    cd ..
+fi
 
 # setup gql_behave dependencies
 setup_virtualenv tests/gql_behave
@@ -110,3 +135,10 @@ for hook in $(find $DIR/.githooks -type f -printf "%f\n"); do
   ln -s -f "$DIR/.githooks/$hook" "$DIR/.git/hooks/$hook"
   echo "Added $hook hook"
 done;
+
+# Install precommit hook
+python3 -m pip install pre-commit
+python3 -m pre_commit install
+
+# Link `include/mgp.py` with `release/mgp/mgp.py`
+ln -v -f include/mgp.py release/mgp/mgp.py

libs/.gitignore

@@ -4,4 +4,5 @@
 !cleanup.sh
 !CMakeLists.txt
 !__main.cpp
-!jemalloc.cmake
+!pulsar.patch
+!antlr4.10.1.patch

libs/CMakeLists.txt

@@ -8,6 +8,15 @@ if (NPROC EQUAL 0)
   set(NPROC 1)
 endif()
 
+find_package(Boost 1.78 REQUIRED)
+find_package(BZip2 1.0.6 REQUIRED)
+find_package(Threads REQUIRED)
+set(GFLAGS_NOTHREADS OFF)
+find_package(gflags REQUIRED)
+find_package(fmt 8.0.1)
+find_package(Jemalloc REQUIRED)
+find_package(ZLIB 1.2.11 REQUIRED)
+
 set(LIB_DIR ${CMAKE_CURRENT_SOURCE_DIR})
 
 # convenience functions
@@ -48,7 +57,7 @@ endfunction(import_library)
 # INSTALL_COMMAND arguments.
 function(add_external_project name)
   set(options NO_C_COMPILER)
-  set(one_value_kwargs SOURCE_DIR)
+  set(one_value_kwargs SOURCE_DIR BUILD_IN_SOURCE)
   set(multi_value_kwargs CMAKE_ARGS DEPENDS INSTALL_COMMAND BUILD_COMMAND
       CONFIGURE_COMMAND)
   cmake_parse_arguments(KW "${options}" "${one_value_kwargs}" "${multi_value_kwargs}" ${ARGN})
@@ -56,11 +65,16 @@ function(add_external_project name)
   if (KW_SOURCE_DIR)
     set(source_dir ${KW_SOURCE_DIR})
   endif()
+  set(build_in_source 0)
+  if (KW_BUILD_IN_SOURCE)
+    set(build_in_source ${KW_BUILD_IN_SOURCE})
+  endif()
   if (NOT KW_NO_C_COMPILER)
     set(KW_CMAKE_ARGS -DCMAKE_C_COMPILER=${CMAKE_C_COMPILER} ${KW_CMAKE_ARGS})
   endif()
   ExternalProject_Add(${name}-proj DEPENDS ${KW_DEPENDS}
                       PREFIX ${source_dir} SOURCE_DIR ${source_dir}
+                      BUILD_IN_SOURCE ${build_in_source}
                       CONFIGURE_COMMAND ${KW_CONFIGURE_COMMAND}
                       CMAKE_ARGS -DCMAKE_BUILD_TYPE=Release
                                  -DCMAKE_CXX_COMPILER=${CMAKE_CXX_COMPILER}
@@ -91,25 +105,19 @@ import_external_library(antlr4 STATIC
   CMAKE_ARGS # http://stackoverflow.com/questions/37096062/get-a-basic-c-program-to-compile-using-clang-on-ubuntu-16/38385967#38385967
              -DWITH_LIBCXX=OFF # because of debian bug
              -DCMAKE_SKIP_INSTALL_ALL_DEPENDENCY=true
+             -DCMAKE_CXX_STANDARD=20
+             -DANTLR_BUILD_CPP_TESTS=OFF
   BUILD_COMMAND $(MAKE) antlr4_static
-  # Make a License.txt out of thin air, so that antlr4.6 knows how to build.
-  # When we upgrade antlr, this will no longer be needed.
-  INSTALL_COMMAND touch ${CMAKE_CURRENT_SOURCE_DIR}/antlr4/runtime/Cpp/License.txt
-  COMMAND $(MAKE) install)
+  INSTALL_COMMAND $(MAKE) install)
 
 # Setup google benchmark.
 import_external_library(benchmark STATIC
-  ${CMAKE_CURRENT_SOURCE_DIR}/benchmark/lib/libbenchmark.a
+  ${CMAKE_CURRENT_SOURCE_DIR}/benchmark/${CMAKE_INSTALL_LIBDIR}/libbenchmark.a
   ${CMAKE_CURRENT_SOURCE_DIR}/benchmark/include
   # Skip testing. The tests don't compile with Clang 8.
   CMAKE_ARGS -DBENCHMARK_ENABLE_TESTING=OFF)
 
-# setup fmt format
-import_external_library(fmt STATIC
-  ${CMAKE_CURRENT_SOURCE_DIR}/fmt/${CMAKE_INSTALL_LIBDIR}/libfmt.a
-  ${CMAKE_CURRENT_SOURCE_DIR}/fmt/include
-  # Skip testing.
-  CMAKE_ARGS -DFMT_TEST=OFF)
+include(FetchContent)
 
 # setup rapidcheck (it cannot be external, since it doesn't have install
 # target)
@@ -136,55 +144,19 @@ import_library(gtest_main STATIC ${GTEST_MAIN_LIBRARY} ${GTEST_INCLUDE_DIR} gtes
 import_library(gmock STATIC ${GMOCK_LIBRARY} ${GTEST_INCLUDE_DIR} gtest-proj)
 import_library(gmock_main STATIC ${GMOCK_MAIN_LIBRARY} ${GTEST_INCLUDE_DIR} gtest-proj)
 
-# setup google flags
-set(GFLAGS_NO_FILENAMES "0")
-if ("${CMAKE_BUILD_TYPE}" MATCHES "^(R|r)(E|e)(L|l).+")
-  set(GFLAGS_NO_FILENAMES "1")
-endif()
-
-# setup google flags
-import_external_library(gflags STATIC
-  ${CMAKE_CURRENT_SOURCE_DIR}/gflags/lib/libgflags.a
-  ${CMAKE_CURRENT_SOURCE_DIR}/gflags/include
-  # Not needed, since gflags is C++ only.
-  NO_C_COMPILER
-  # Don't register installation in ~/.cmake
-  CMAKE_ARGS -DREGISTER_INSTALL_PREFIX=OFF
-             -DBUILD_gflags_nothreads_LIB=OFF
-             -DGFLAGS_NO_FILENAMES=${GFLAGS_NO_FILENAMES})
-
 # Setup cppitertools
 import_header_library(cppitertools ${CMAKE_CURRENT_SOURCE_DIR})
 
 # Setup json
 import_header_library(json ${CMAKE_CURRENT_SOURCE_DIR})
 
-# Setup bzip2
-import_external_library(bzip2 STATIC
-    ${CMAKE_CURRENT_SOURCE_DIR}/bzip2/libbz2.a
-    ${CMAKE_CURRENT_SOURCE_DIR}/bzip2
-    # bzip2's Makefile has -g CFLAG which is redundant
-    CONFIGURE_COMMAND sed -i "s/-Wall -Winline -O2 -g/-Wall -Winline -O2/g" ${CMAKE_CURRENT_SOURCE_DIR}/bzip2/Makefile
-    BUILD_COMMAND make -C ${CMAKE_CURRENT_SOURCE_DIR}/bzip2
-                       CC=${CMAKE_C_COMPILER}
-                       CXX=${CMAKE_CXX_COMPILER}
-    INSTALL_COMMAND true)
-
-# Setup zlib
-import_external_library(zlib STATIC
-    ${CMAKE_CURRENT_SOURCE_DIR}/zlib/lib/libz.a
-    ${CMAKE_CURRENT_SOURCE_DIR}/zlib
-    CMAKE_ARGS -DCMAKE_SKIP_INSTALL_ALL_DEPENDENCY=true
-    BUILD_COMMAND $(MAKE) zlibstatic)
-
 # Setup RocksDB
 import_external_library(rocksdb STATIC
   ${CMAKE_CURRENT_SOURCE_DIR}/rocksdb/lib/librocksdb.a
   ${CMAKE_CURRENT_SOURCE_DIR}/rocksdb/include
-  DEPENDS gflags-proj
-  CMAKE_ARGS -Dgflags_DIR=${CMAKE_CURRENT_SOURCE_DIR}/gflags/lib/cmake/gflags
-             -DUSE_RTTI=ON
+  CMAKE_ARGS -DUSE_RTTI=ON
              -DWITH_TESTS=OFF
+             -DGFLAGS_NOTHREADS=OFF
              -DCMAKE_INSTALL_LIBDIR=lib
              -DCMAKE_SKIP_INSTALL_ALL_DEPENDENCY=true
   BUILD_COMMAND $(MAKE) rocksdb)
@@ -205,14 +177,82 @@ import_external_library(mgclient STATIC
   ${CMAKE_CURRENT_SOURCE_DIR}/mgclient/include
   CMAKE_ARGS -DCMAKE_C_COMPILER=${CMAKE_C_COMPILER}
              -DCMAKE_CXX_COMPILER=${CMAKE_CXX_COMPILER}
-             -DBUILD_TESTING=OFF)
+             -DBUILD_TESTING=OFF
+             -DBUILD_CPP_BINDINGS=ON)
 find_package(OpenSSL REQUIRED)
 target_link_libraries(mgclient INTERFACE ${OPENSSL_LIBRARIES})
 
-# Setup spdlog
-import_external_library(spdlog STATIC
-  ${CMAKE_CURRENT_SOURCE_DIR}/spdlog/${CMAKE_INSTALL_LIBDIR}/libspdlog.a
-  ${CMAKE_CURRENT_SOURCE_DIR}/spdlog/include
-  BUILD_COMMAND $(MAKE) spdlog)
+add_external_project(mgconsole
+  SOURCE_DIR ${CMAKE_CURRENT_SOURCE_DIR}/mgconsole
+  CMAKE_ARGS
+    -DCMAKE_INSTALL_PREFIX:PATH=${CMAKE_BINARY_DIR}
+  BUILD_COMMAND $(MAKE) mgconsole)
 
-include(jemalloc.cmake)
+add_custom_target(mgconsole DEPENDS mgconsole-proj)
+
+# Setup spdlog
+set(SPDLOG_FMT_EXTERNAL ON)
+FetchContent_Declare(spdlog
+  SOURCE_DIR ${CMAKE_CURRENT_SOURCE_DIR}/spdlog)
+
+FetchContent_MakeAvailable(spdlog)
+
+# Setup librdkafka.
+import_external_library(librdkafka STATIC
+  ${CMAKE_CURRENT_SOURCE_DIR}/librdkafka/lib/librdkafka.a
+  ${CMAKE_CURRENT_SOURCE_DIR}/librdkafka/include
+  CMAKE_ARGS -DRDKAFKA_BUILD_STATIC=ON
+             -DRDKAFKA_BUILD_EXAMPLES=OFF
+             -DRDKAFKA_BUILD_TESTS=OFF
+             -DWITH_ZSTD=OFF
+             -DENABLE_LZ4_EXT=OFF
+             -DCMAKE_INSTALL_LIBDIR=lib
+             -DWITH_SSL=ON
+             # If we want SASL, we need to install it on build machines
+             -DWITH_SASL=OFF)
+target_link_libraries(librdkafka INTERFACE ${OPENSSL_LIBRARIES} ZLIB::ZLIB)
+
+import_library(librdkafka++ STATIC
+  ${CMAKE_CURRENT_SOURCE_DIR}/librdkafka/lib/librdkafka++.a
+  ${CMAKE_CURRENT_SOURCE_DIR}/librdkafka/include
+)
+target_link_libraries(librdkafka++ INTERFACE librdkafka)
+
+set(PROTOBUF_ROOT ${CMAKE_CURRENT_SOURCE_DIR}/protobuf/lib)
+import_external_library(protobuf STATIC
+  ${PROTOBUF_ROOT}/lib/libprotobuf.a
+  ${PROTOBUF_ROOT}/include
+  BUILD_IN_SOURCE 1
+  CONFIGURE_COMMAND true)
+
+import_external_library(pulsar STATIC
+  ${CMAKE_CURRENT_SOURCE_DIR}/pulsar/pulsar-client-cpp/lib/libpulsarwithdeps.a
+  ${CMAKE_CURRENT_SOURCE_DIR}/pulsar/install/include
+  BUILD_IN_SOURCE 1
+  CONFIGURE_COMMAND cmake pulsar-client-cpp
+                            -DCMAKE_INSTALL_PREFIX=${CMAKE_CURRENT_SOURCE_DIR}/pulsar/install
+                            -DCMAKE_CXX_COMPILER=${CMAKE_CXX_COMPILER}
+                            -DCMAKE_C_COMPILER=${CMAKE_C_COMPILER}
+                            -DBUILD_DYNAMIC_LIB=OFF
+                            -DBUILD_STATIC_LIB=ON
+                            -DBUILD_TESTS=OFF
+                            -DLINK_STATIC=ON
+                            -DPROTOC_PATH=${PROTOBUF_ROOT}/bin/protoc
+                            -DBOOST_ROOT=${BOOST_ROOT}
+                            -DCMAKE_PREFIX_PATH=${PROTOBUF_ROOT}
+                            -DProtobuf_INCLUDE_DIRS=${PROTOBUF_ROOT}/include
+                            -DBUILD_PYTHON_WRAPPER=OFF
+                            -DBUILD_PERF_TOOLS=OFF
+                            -DUSE_LOG4CXX=OFF
+ BUILD_COMMAND $(MAKE) pulsarStaticWithDeps)
+add_dependencies(pulsar-proj protobuf)
+
+if (${MG_ARCH} STREQUAL "ARM64")
+  set(MG_LIBRDTSC_CMAKE_ARGS -DLIBRDTSC_ARCH_x86=OFF -DLIBRDTSC_ARCH_ARM64=ON)
+endif()
+
+import_external_library(librdtsc STATIC
+  ${CMAKE_CURRENT_SOURCE_DIR}/librdtsc/lib/librdtsc.a
+  ${CMAKE_CURRENT_SOURCE_DIR}/librdtsc/include
+  CMAKE_ARGS ${MG_LIBRDTSC_CMAKE_ARGS}
+  BUILD_COMMAND $(MAKE) rdtsc)

libs/antlr4.10.1.patch

@@ -0,0 +1,13 @@
+diff --git a/runtime/Cpp/runtime/CMakeLists.txt b/runtime/Cpp/runtime/CMakeLists.txt
+index baf46cac9..2e7756de8 100644
+--- a/runtime/Cpp/runtime/CMakeLists.txt
++++ b/runtime/Cpp/runtime/CMakeLists.txt
+@@ -134,7 +134,7 @@ set_target_properties(antlr4_static
+                                  ARCHIVE_OUTPUT_DIRECTORY ${LIB_OUTPUT_DIR}
+                                  COMPILE_FLAGS "${disabled_compile_warnings} ${extra_static_compile_flags}")
+
+-install(TARGETS antlr4_shared
++install(TARGETS antlr4_shared OPTIONAL
+         EXPORT antlr4-targets
+         ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR}
+         LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR}

libs/jemalloc.cmake

@@ -1,55 +0,0 @@
-set(JEMALLOC_DIR "${LIB_DIR}/jemalloc")
-
-set(JEMALLOC_SRCS
-    ${JEMALLOC_DIR}/src/arena.c
-    ${JEMALLOC_DIR}/src/background_thread.c
-    ${JEMALLOC_DIR}/src/base.c
-    ${JEMALLOC_DIR}/src/bin.c
-    ${JEMALLOC_DIR}/src/bitmap.c
-    ${JEMALLOC_DIR}/src/ckh.c
-    ${JEMALLOC_DIR}/src/ctl.c
-    ${JEMALLOC_DIR}/src/div.c
-    ${JEMALLOC_DIR}/src/extent.c
-    ${JEMALLOC_DIR}/src/extent_dss.c
-    ${JEMALLOC_DIR}/src/extent_mmap.c
-    ${JEMALLOC_DIR}/src/hash.c
-    ${JEMALLOC_DIR}/src/hook.c
-    ${JEMALLOC_DIR}/src/jemalloc.c
-    ${JEMALLOC_DIR}/src/large.c
-    ${JEMALLOC_DIR}/src/log.c
-    ${JEMALLOC_DIR}/src/malloc_io.c
-    ${JEMALLOC_DIR}/src/mutex.c
-    ${JEMALLOC_DIR}/src/mutex_pool.c
-    ${JEMALLOC_DIR}/src/nstime.c
-    ${JEMALLOC_DIR}/src/pages.c
-    ${JEMALLOC_DIR}/src/prng.c
-    ${JEMALLOC_DIR}/src/prof.c
-    ${JEMALLOC_DIR}/src/rtree.c
-    ${JEMALLOC_DIR}/src/sc.c
-    ${JEMALLOC_DIR}/src/stats.c
-    ${JEMALLOC_DIR}/src/sz.c
-    ${JEMALLOC_DIR}/src/tcache.c
-    ${JEMALLOC_DIR}/src/test_hooks.c
-    ${JEMALLOC_DIR}/src/ticker.c
-    ${JEMALLOC_DIR}/src/tsd.c
-    ${JEMALLOC_DIR}/src/witness.c
-    ${JEMALLOC_DIR}/src/safety_check.c
-)
-
-add_library(jemalloc ${JEMALLOC_SRCS})
-target_include_directories(jemalloc PUBLIC "${JEMALLOC_DIR}/include")
-
-find_package(Threads REQUIRED)
-target_link_libraries(jemalloc PUBLIC Threads::Threads)
-
-target_compile_definitions(jemalloc PRIVATE -DJEMALLOC_NO_PRIVATE_NAMESPACE)
-
-if (CMAKE_BUILD_TYPE STREQUAL "DEBUG")
-    target_compile_definitions(jemalloc PRIVATE -DJEMALLOC_DEBUG=1 -DJEMALLOC_PROF=1)
-endif()
-
-target_compile_options(jemalloc PRIVATE -Wno-redundant-decls)
-# for RTLD_NEXT
-target_compile_definitions(jemalloc PRIVATE _GNU_SOURCE)
-
-set_property(TARGET jemalloc APPEND PROPERTY INTERFACE_COMPILE_DEFINITIONS USE_JEMALLOC=1)

libs/librdtsc.patch

@@ -0,0 +1,29 @@
+diff --git a/CMakeLists.txt b/CMakeLists.txt
+index ee9b58c..31359a9 100644
+--- a/CMakeLists.txt
++++ b/CMakeLists.txt
+@@ -48,7 +48,7 @@ option(LIBRDTSC_USE_PMU     "Enables PMU usage on ARM platforms"        OFF)
+ # |          Library Build and Install Properties          |
+ # +--------------------------------------------------------+
+ 
+-add_library(rdtsc SHARED
++add_library(rdtsc
+     src/cycles.c
+     src/common_timer.c
+     src/timer.c
+@@ -72,15 +72,6 @@ target_include_directories(rdtsc
+   PUBLIC ${CMAKE_CURRENT_SOURCE_DIR}/include
+ )
+ 
+-# Install directory changes depending on build mode
+-if (CMAKE_BUILD_TYPE MATCHES "^[Dd]ebug")
+-    # During debug, the library will be installed into a local directory
+-    set(CMAKE_INSTALL_PREFIX ${CMAKE_CURRENT_BINARY_DIR}/_install CACHE PATH "" FORCE)
+-else ()
+-    # This will install in /usr/lib and /usr/include
+-    set(CMAKE_INSTALL_PREFIX /usr CACHE PATH "" FORCE)
+-endif ()
+-
+ # Specifying what to export when installing (GNUInstallDirs required)
+ install(TARGETS rdtsc
+         EXPORT librstsc-config

libs/rocksdb.patch

@@ -0,0 +1,21 @@
+diff --git a/CMakeLists.txt b/CMakeLists.txt
+index 6761929..6a369af 100644
+--- a/CMakeLists.txt
++++ b/CMakeLists.txt
+@@ -220,6 +220,7 @@ else()
+       set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -momit-leaf-frame-pointer")
+     endif()
+   endif()
++  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wno-deprecated-copy -Wno-unused-but-set-variable")
+ endif()
+ 
+ include(CheckCCompilerFlag)
+@@ -997,7 +998,7 @@ if(NOT WIN32 OR ROCKSDB_INSTALL_ON_WINDOWS)
+ 
+   if(ROCKSDB_BUILD_SHARED)
+     install(
+-      TARGETS ${ROCKSDB_SHARED_LIB}
++      TARGETS ${ROCKSDB_SHARED_LIB} OPTIONAL
+       EXPORT RocksDBTargets
+       COMPONENT runtime
+       ARCHIVE DESTINATION "${CMAKE_INSTALL_LIBDIR}"

libs/setup.sh

@@ -1,6 +1,7 @@
 #!/bin/bash -e
 
 # Download external dependencies.
+# Don't forget to add/update the license in release/third-party-licenses of added/updated libs!
 
 local_cache_host=${MGDEPS_CACHE_HOST_PORT:-mgdeps-cache:8000}
 working_dir="$( cd "$( dirname "${BASH_SOURCE[0]}" )" && pwd )"
@@ -13,39 +14,49 @@ clone () {
   local git_repo=$1
   local dir_name=$2
   local checkout_id=$3
-  shift 3
+  local shallow=$4
+  shift 4
   # Clone if there's no repo.
   if [[ ! -d "$dir_name" ]]; then
     echo "Cloning from $git_repo"
     # If the clone fails, it doesn't make sense to continue with the function
     # execution but the whole script should continue executing because we might
     # clone the same repo from a different source.
-    git clone "$git_repo" "$dir_name" || return 1
+
+    if [ "$shallow" = true ]; then
+      git clone --depth 1 --branch "$checkout_id" "$git_repo" "$dir_name" || return 1
+    else
+      git clone "$git_repo" "$dir_name" || return 1
+    fi
   fi
   pushd "$dir_name"
-  # Just fetch new commits from remote repository. Don't merge/pull them in, so
-  # that we don't clobber local modifications.
-  git fetch
   # Check whether we have any local changes which need to be preserved.
   local local_changes=true
   if git diff --no-ext-diff --quiet && git diff --no-ext-diff --cached --quiet; then
     local_changes=false
   fi
-  # Stash regardless of local_changes, so that a user gets a message on stdout.
-  git stash
-  # Checkout the primary commit (there's no need to pull/merge).
-  # The checkout fail should exit this script immediately because the target
-  # commit is not there and that will most likely create build-time errors.
-  git checkout "$checkout_id" || exit 1
-  # Apply any optional cherry pick fixes.
-  while [[ $# -ne 0 ]]; do
-    local cherry_pick_id=$1
-    shift
-    # The cherry-pick fail should exit this script immediately because the
-    # target commit is not there and that will most likely create build-time
-    # errors.
-    git cherry-pick -n "$cherry_pick_id" || exit 1
-  done
+
+  if [ "$shallow" = false ]; then
+    # Stash regardless of local_changes, so that a user gets a message on stdout.
+    git stash
+    # Just fetch new commits from remote repository. Don't merge/pull them in, so
+    # that we don't clobber local modifications.
+    git fetch
+    # Checkout the primary commit (there's no need to pull/merge).
+    # The checkout fail should exit this script immediately because the target
+    # commit is not there and that will most likely create build-time errors.
+    git checkout "$checkout_id" || exit 1
+    # Apply any optional cherry pick fixes.
+    while [[ $# -ne 0 ]]; do
+      local cherry_pick_id=$1
+      shift
+      # The cherry-pick fail should exit this script immediately because the
+      # target commit is not there and that will most likely create build-time
+      # errors.
+      git cherry-pick -n "$cherry_pick_id" || exit 1
+    done
+  fi
+
   # Reapply any local changes.
   if [[ $local_changes == true ]]; then
     git stash pop
@@ -69,12 +80,13 @@ repo_clone_try_double () {
     secondary_url="$2"
     folder_name="$3"
     ref="$4"
+    shallow="${5:-false}"
     echo "Cloning primary from $primary_url secondary from $secondary_url"
     if [ -z "$primary_url" ]; then echo "Primary should not be empty." && exit 1; fi
     if [ -z "$secondary_url" ]; then echo "Secondary should not be empty." && exit 1; fi
     if [ -z "$folder_name" ]; then echo "Clone folder should not be empty." && exit 1; fi
     if [ -z "$ref" ]; then echo "Git clone ref should not be empty." && exit 1; fi
-    clone "$primary_url" "$folder_name" "$ref" || clone "$secondary_url" "$folder_name" "$ref" || exit 1
+    clone "$primary_url" "$folder_name" "$ref" "$shallow" || clone "$secondary_url" "$folder_name" "$ref" "$shallow" || exit 1
     echo ""
 }
 
@@ -93,23 +105,23 @@ repo_clone_try_double () {
 # Download from primary_urls might fail because the cache is not installed.
 declare -A primary_urls=(
   ["antlr4-code"]="http://$local_cache_host/git/antlr4.git"
-  ["antlr4-generator"]="http://$local_cache_host/file/antlr-4.6-complete.jar"
+  ["antlr4-generator"]="http://$local_cache_host/file/antlr-4.10.1-complete.jar"
   ["cppitertools"]="http://$local_cache_host/git/cppitertools.git"
-  ["fmt"]="http://$local_cache_host/git/fmt.git"
   ["rapidcheck"]="http://$local_cache_host/git/rapidcheck.git"
   ["gbenchmark"]="http://$local_cache_host/git/benchmark.git"
   ["gtest"]="http://$local_cache_host/git/googletest.git"
-  ["gflags"]="http://$local_cache_host/git/gflags.git"
   ["libbcrypt"]="http://$local_cache_host/git/libbcrypt.git"
-  ["bzip2"]="http://$local_cache_host/git/bzip2.git"
-  ["zlib"]="http://$local_cache_host/git/zlib.git"
   ["rocksdb"]="http://$local_cache_host/git/rocksdb.git"
   ["mgclient"]="http://$local_cache_host/git/mgclient.git"
   ["pymgclient"]="http://$local_cache_host/git/pymgclient.git"
+  ["mgconsole"]="http://$local_cache_host/git/mgconsole.git"
   ["spdlog"]="http://$local_cache_host/git/spdlog"
-  ["jemalloc"]="http://$local_cache_host/git/jemalloc.git"
-  ["nlohmann"]="http://$local_cache_host/file/nlohmann/json/b3e5cb7f20dcc5c806e418df34324eca60d17d4e/single_include/nlohmann/json.hpp"
+  ["nlohmann"]="http://$local_cache_host/file/nlohmann/json/4f8fba14066156b73f1189a2b8bd568bde5284c5/single_include/nlohmann/json.hpp"
   ["neo4j"]="http://$local_cache_host/file/neo4j-community-3.2.3-unix.tar.gz"
+  ["librdkafka"]="http://$local_cache_host/git/librdkafka.git"
+  ["protobuf"]="http://$local_cache_host/git/protobuf.git"
+  ["pulsar"]="http://$local_cache_host/git/pulsar.git"
+  ["librdtsc"]="http://$local_cache_host/git/librdtsc.git"
 )
 
 # The goal of secondary urls is to have links to the "source of truth" of
@@ -118,58 +130,49 @@ declare -A primary_urls=(
 # should fail.
 declare -A secondary_urls=(
   ["antlr4-code"]="https://github.com/antlr/antlr4.git"
-  ["antlr4-generator"]="http://www.antlr.org/download/antlr-4.6-complete.jar"
+  ["antlr4-generator"]="https://www.antlr.org/download/antlr-4.10.1-complete.jar"
   ["cppitertools"]="https://github.com/ryanhaining/cppitertools.git"
-  ["fmt"]="https://github.com/fmtlib/fmt.git"
   ["rapidcheck"]="https://github.com/emil-e/rapidcheck.git"
   ["gbenchmark"]="https://github.com/google/benchmark.git"
   ["gtest"]="https://github.com/google/googletest.git"
-  ["gflags"]="https://github.com/memgraph/gflags.git"
   ["libbcrypt"]="https://github.com/rg3/libbcrypt"
-  ["bzip2"]="https://github.com/VFR-maniac/bzip2"
-  ["zlib"]="https://github.com/madler/zlib.git"
   ["rocksdb"]="https://github.com/facebook/rocksdb.git"
   ["mgclient"]="https://github.com/memgraph/mgclient.git"
   ["pymgclient"]="https://github.com/memgraph/pymgclient.git"
+  ["mgconsole"]="http://github.com/memgraph/mgconsole.git"
   ["spdlog"]="https://github.com/gabime/spdlog"
-  ["jemalloc"]="https://github.com/jemalloc/jemalloc.git"
-  ["nlohmann"]="https://raw.githubusercontent.com/nlohmann/json/b3e5cb7f20dcc5c806e418df34324eca60d17d4e/single_include/nlohmann/json.hpp"
+  ["nlohmann"]="https://raw.githubusercontent.com/nlohmann/json/4f8fba14066156b73f1189a2b8bd568bde5284c5/single_include/nlohmann/json.hpp"
   ["neo4j"]="https://s3-eu-west-1.amazonaws.com/deps.memgraph.io/neo4j-community-3.2.3-unix.tar.gz"
+  ["librdkafka"]="https://github.com/edenhill/librdkafka.git"
+  ["protobuf"]="https://github.com/protocolbuffers/protobuf.git"
+  ["pulsar"]="https://github.com/apache/pulsar.git"
+  ["librdtsc"]="https://github.com/gabrieleara/librdtsc.git"
 )
 
 # antlr
 file_get_try_double "${primary_urls[antlr4-generator]}" "${secondary_urls[antlr4-generator]}"
 
-antlr4_tag="aacd2a2c95816d8dc1c05814051d631bfec4cf3e" # v4.6
-repo_clone_try_double "${primary_urls[antlr4-code]}" "${secondary_urls[antlr4-code]}" "antlr4" "$antlr4_tag"
-# fix missing include
-sed -i 's/^#pragma once/#pragma once\n#include <functional>/' antlr4/runtime/Cpp/runtime/src/support/CPPUtils.h
-# remove shared library from install dependencies
-sed -i 's/install(TARGETS antlr4_shared/install(TARGETS antlr4_shared OPTIONAL/' antlr4/runtime/Cpp/runtime/CMakeLists.txt
+antlr4_tag="4.10.1" # v4.10.1
+repo_clone_try_double "${primary_urls[antlr4-code]}" "${secondary_urls[antlr4-code]}" "antlr4" "$antlr4_tag" true
+pushd antlr4
+git apply ../antlr4.10.1.patch
+popd
 
 # cppitertools v2.0 2019-12-23
 cppitertools_ref="cb3635456bdb531121b82b4d2e3afc7ae1f56d47"
 repo_clone_try_double "${primary_urls[cppitertools]}" "${secondary_urls[cppitertools]}" "cppitertools" "$cppitertools_ref"
 
-# fmt
-fmt_tag="7bdf0628b1276379886c7f6dda2cef2b3b374f0b" # (2020-11-25)
-repo_clone_try_double "${primary_urls[fmt]}" "${secondary_urls[fmt]}" "fmt" "$fmt_tag"
-
 # rapidcheck
 rapidcheck_tag="7bc7d302191a4f3d0bf005692677126136e02f60" # (2020-05-04)
 repo_clone_try_double "${primary_urls[rapidcheck]}" "${secondary_urls[rapidcheck]}" "rapidcheck" "$rapidcheck_tag"
 
 # google benchmark
-benchmark_tag="4f8bfeae470950ef005327973f15b0044eceaceb" # v1.1.0
-repo_clone_try_double "${primary_urls[gbenchmark]}" "${secondary_urls[gbenchmark]}" "benchmark" "$benchmark_tag"
+benchmark_tag="v1.6.0"
+repo_clone_try_double "${primary_urls[gbenchmark]}" "${secondary_urls[gbenchmark]}" "benchmark" "$benchmark_tag" true
 
 # google test
-googletest_tag="ec44c6c1675c25b9827aacd08c02433cccde7780" # v1.8.0
-repo_clone_try_double "${primary_urls[gtest]}" "${secondary_urls[gtest]}" "googletest" "$googletest_tag"
-
-# google flags
-gflags_tag="b37ceb03a0e56c9f15ce80409438a555f8a67b7c" # custom version (May 6, 2017)
-repo_clone_try_double "${primary_urls[gflags]}" "${secondary_urls[gflags]}" "gflags" "$gflags_tag"
+googletest_tag="release-1.8.0"
+repo_clone_try_double "${primary_urls[gtest]}" "${secondary_urls[gtest]}" "googletest" "$googletest_tag" true
 
 # libbcrypt
 libbcrypt_tag="8aa32ad94ebe06b76853b0767c910c9fbf7ccef4" # custom version (Dec 16, 2016)
@@ -189,21 +192,14 @@ cd json
 file_get_try_double "${primary_urls[nlohmann]}" "${secondary_urls[nlohmann]}"
 cd ..
 
-bzip2_tag="0405487e2b1de738e7f1c8afb50d19cf44e8d580"  # v1.0.6 (May 26, 2011)
-repo_clone_try_double "${primary_urls[bzip2]}" "${secondary_urls[bzip2]}" "bzip2" "$bzip2_tag"
-
-zlib_tag="cacf7f1d4e3d44d871b605da3b647f07d718623f" # v1.2.11.
-repo_clone_try_double "${primary_urls[zlib]}" "${secondary_urls[zlib]}" "zlib" "$zlib_tag"
-# remove shared library from install dependencies
-sed -i 's/install(TARGETS zlib zlibstatic/install(TARGETS zlibstatic/g' zlib/CMakeLists.txt
-
-rocksdb_tag="f3e33549c151f30ac4eb7c22356c6d0331f37652" # (2020-10-14)
-repo_clone_try_double "${primary_urls[rocksdb]}" "${secondary_urls[rocksdb]}" "rocksdb" "$rocksdb_tag"
-# remove shared library from install dependencies
-sed -i 's/TARGETS ${ROCKSDB_SHARED_LIB}/TARGETS ${ROCKSDB_SHARED_LIB} OPTIONAL/' rocksdb/CMakeLists.txt
+rocksdb_tag="v6.14.6" # (2020-10-14)
+repo_clone_try_double "${primary_urls[rocksdb]}" "${secondary_urls[rocksdb]}" "rocksdb" "$rocksdb_tag" true
+pushd rocksdb
+git apply ../rocksdb.patch
+popd
 
 # mgclient
-mgclient_tag="v1.2.0" # (2021-01-14)
+mgclient_tag="v1.4.0" # (2022-06-14)
 repo_clone_try_double "${primary_urls[mgclient]}" "${secondary_urls[mgclient]}" "mgclient" "$mgclient_tag"
 sed -i 's/\${CMAKE_INSTALL_LIBDIR}/lib/' mgclient/src/CMakeLists.txt
 
@@ -211,24 +207,34 @@ sed -i 's/\${CMAKE_INSTALL_LIBDIR}/lib/' mgclient/src/CMakeLists.txt
 pymgclient_tag="4f85c179e56302d46a1e3e2cf43509db65f062b3" # (2021-01-15)
 repo_clone_try_double "${primary_urls[pymgclient]}" "${secondary_urls[pymgclient]}" "pymgclient" "$pymgclient_tag"
 
-spdlog_tag="46d418164dd4cd9822cf8ca62a116a3f71569241" # (2020-12-01)
-repo_clone_try_double "${primary_urls[spdlog]}" "${secondary_urls[spdlog]}" "spdlog" "$spdlog_tag"
+# mgconsole
+mgconsole_tag="v1.1.0" # (2021-10-07)
+repo_clone_try_double "${primary_urls[mgconsole]}" "${secondary_urls[mgconsole]}" "mgconsole" "$mgconsole_tag" true
 
-jemalloc_tag="ea6b3e973b477b8061e0076bb257dbd7f3faa756" # (2021-02-11)
-repo_clone_try_double "${primary_urls[jemalloc]}" "${secondary_urls[jemalloc]}" "jemalloc" "$jemalloc_tag"
-pushd jemalloc
-# ThreadPool select job randomly, and there can be some threads that had been
-# performed some memory heavy task before and will be inactive for some time,
-# but until it will became active again, the memory will not be freed since by
-# default each thread has it's own arena, but there should be not more then
-# 4*CPU arenas (see opt.nareans description).
-#
-# By enabling percpu_arena number of arenas limited to number of CPUs and hence
-# this problem should go away.
-#
-# muzzy_decay_ms -- use MADV_FREE when available on newer Linuxes, to
-# avoid spurious latencies and additional work associated with
-# MADV_DONTNEED. See
-# https://github.com/ClickHouse/ClickHouse/issues/11121 for motivation.
-./autogen.sh --with-malloc-conf="percpu_arena:percpu,oversize_threshold:0,muzzy_decay_ms:5000,dirty_decay_ms:5000"
+spdlog_tag="v1.9.2" # (2021-08-12)
+repo_clone_try_double "${primary_urls[spdlog]}" "${secondary_urls[spdlog]}" "spdlog" "$spdlog_tag" true
+
+# librdkafka
+librdkafka_tag="v1.7.0" # (2021-05-06)
+repo_clone_try_double "${primary_urls[librdkafka]}" "${secondary_urls[librdkafka]}" "librdkafka" "$librdkafka_tag" true
+
+# protobuf
+protobuf_tag="v3.12.4"
+repo_clone_try_double "${primary_urls[protobuf]}" "${secondary_urls[protobuf]}" "protobuf" "$protobuf_tag" true
+pushd protobuf
+./autogen.sh && ./configure CC=clang CXX=clang++ --prefix=$(pwd)/lib
+popd
+
+#pulsar
+pulsar_tag="v2.8.1"
+repo_clone_try_double "${primary_urls[pulsar]}" "${secondary_urls[pulsar]}" "pulsar" "$pulsar_tag" true
+pushd pulsar
+git apply ../pulsar.patch
+popd
+
+#librdtsc
+librdtsc_tag="v0.3"
+repo_clone_try_double "${primary_urls[librdtsc]}" "${secondary_urls[librdtsc]}" "librdtsc" "$librdtsc_tag" true
+pushd librdtsc
+git apply ../librdtsc.patch
 popd

licenses/APL.txt

@@ -0,0 +1,201 @@
+Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright {}
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

licenses/BSL.txt

@@ -0,0 +1,84 @@
+MEMGRAPH
+BUSINESS SOURCE LICENSE (BSL) 1.1
+
+PARAMETERS
+
+LICENSOR:               MEMGRAPH LTD
+LICENSED WORK:          MEMGRAPH COMMUNITY EDITION (MCE) version 2.0
+ADDITIONAL USE GRANT:   You may use the Licensed Work in accordance with the
+                        terms of this License solely for any Authorised Purpose,
+                        provided that you may not use the Licensed Work for any
+                        Excluded Purpose.
+
+                        “Authorised Purpose” means any of the following,
+                        provided always that (a) you do not embed or otherwise
+                        distribute the Licensed Work to third parties; and (b)
+                        you do not provide third parties direct access to
+                        operate or control the Licensed Work as a standalone
+                        solution or service:
+                        1. for your internal business purposes;
+                        2. to integrate the Licensed Work with your own
+                        proprietary software, provided that your proprietary
+                        software adds a primary and significant functionality
+                        to the Licensed Work (the “Integrated Solution”);
+                        and/or
+                        3. to host the Integrated Solution and make it available
+                        to third parties on a ‘software-as-a-service’ or an
+                        equivalent distributed model.
+                        “Excluded Purpose” means any of the following:
+                        1. making the Licensed Work accessible to any third
+                        party outside of your organization as a standalone
+                        solution or service;
+                        2. hosting and making the Licensed Work available to
+                        third parties on a ‘database-as-a-service’ or any
+                        equivalent distributed model as a standalone solution or
+                        service; and/or
+                        3. using the Licensed Work to create a work or solution
+                        which competes (or might reasonably be expected to
+                        compete) with the Licensed Work.
+CHANGE DATE:            2026-20-09
+CHANGE LICENSE:         Apache License, Version 2.0
+
+For information about alternative licensing arrangements, please visit: https://memgraph.com/legal.
+The Business Source License (this document, or the “License”) is not an
+‘open source’ license. However, the Licensed Work will eventually be made
+available under an ‘open source’ license, as stated in this License.
+
+TERMS
+The Licensor hereby grants you the right to copy, modify, create derivative works, redistribute, and make non-production
+use of the Licensed Work. The Licensor may make an Additional Use Grant, above, permitting limited production use.
+Effective on the Change Date, or the fourth anniversary of the first publicly available distribution of a specific
+version of the Licensed Work under this License, whichever comes first, the Licensor hereby grants you rights under the
+terms of the Change License, and the rights granted in the paragraph above terminate. If your use of the Licensed Work
+does not comply with the requirements currently in effect as described in thisLicense, you must purchase a commercial
+license from the Licensor, its affiliated entities, or authorized resellers, or you must refrain from using the Licensed
+Work. All copies of the original and modified Licensed Work, and derivative works of the Licensed Work, are subject to
+this License. This License applies separately for each version of the Licensed Work and the Change Date may vary for
+each version of the Licensed Work released by Licensor. You must conspicuously display this License on each original or
+modified copy of the Licensed Work. If you receive the Licensed Work in original or modified form from a third party,
+the terms and conditions set forth in this License apply to your use of that work.Any use of the Licensed Work in
+violation of this License will automatically terminate your rights under this License for the current and all other
+versions of the Licensed Work. This License does not grant you any right in any trademark or logo of Licensor or its
+affiliates (provided that you may use a trademark or logo of Licensor as expressly required by this License).
+TO THE EXTENT PERMITTED BY APPLICABLE LAW, THE LICENSED WORK IS PROVIDED ON AN “AS IS” BASIS. LICENSOR HEREBY DISCLAIMS
+ALL WARRANTIES AND CONDITIONS, EXPRESS OR IMPLIED, INCLUDING (WITHOUT LIMITATION) WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE, NON-INFRINGEMENT, AND TITLE.
+MariaDB hereby grants you permission to use this License’s text to license your works, and to refer to it using the
+trademark ‘Business Source License’, as long as you comply with the Covenants of Licensor below.
+Covenants of Licensor
+In consideration of the right to use this License’s text and the ‘Business Source License’ name and trademark, Licensor
+covenants to MariaDB, and to all other recipients of the Licensed Work to be provided by Licensor:
+1.  To specify as the Change License the GPL Version 2.0 or any later version, or a license that is compatible with GPL
+    Version 2.0 or a later version, where “compatible” means that software provided under the Change License can be
+    included in a program with software provided under GPL Version 2.0 or a later version. Licensor may specify
+    additional Change Licenses without limitation.
+
+2.  To either: (a) specify an additional grant of rights to use that does not impose any additional restriction on the
+    right granted in this License, as the Additional Use Grant; or (b) insert the text “None”.
+
+3. To specify a Change Date.
+
+4. Not to modify this License in any other way.
+
+NOTICE
+License text copyright (c) 2017 MariaDB Corporation Ab, All Rights Reserved. ‘Business Source License’ is a trademark of MariaDB Corporation Ab.

licenses/MEL.txt

@@ -0,0 +1,464 @@
+MEMGRAPH
+ENTERPRISE LICENCE AGREEMENT
+
+
+Memgraph Limited is registered in England under registration 10195084 and has its registered office at Suite 4,
+Ironstone House, Ironstone Way, Brixworth, Northampton, NN6 9UD (“Memgraph”).
+
+
+Memgraph agrees to license and/or grant you (the “Customer”) access to the Software ( as defined below) and provide
+support and services to you only if you accept and agree to be bound by the terms and conditions in this Memgraph
+Enterprise Licence Agreement (the “Agreement”). By signing an Order Document (as defined below), which is subject to and
+part of this Agreement, installing and using the Software or by downloading a trial version of the Software, you agree
+to be bound by the terms of this Agreement.
+
+
+Memgraph Enterprise Trial Users: If you receive free of charge trial access to the Software, you are deemed a
+“Customer” for purposes of this Agreement, except that you are subject to the additional restrictions and limitations
+set forth in Section 3.2 below in respect of your use of such Software.
+
+
+1. DEFINITIONS.
+   1.1.  “Applicable Laws” means (i) all applicable laws, statutes and regulations, and (ii) regulatory policies,
+         guidelines and industry codes (in each case having the force of law), which apply to the provisions of the
+         Software and Services and this Agreement.
+   1.2.  “Confidential Information” means all information disclosed by a party (“Disclosing Party”) to the other party
+         (“Receiving Party”), whether orally or in writing, that is designated as confidential or that reasonably should
+         be understood to be confidential given the nature of the information and the circumstances of disclosure.
+         Customer’s Confidential Information includes Customer Data; Memgraph Confidential Information includes the
+         Software and Services; and Confidential Information of each party includes the terms and conditions of this
+         Agreement and all Orders (including pricing), as well as business and marketing plans, technology and technical
+         information, product plans and designs, and business processes disclosed by such party. However, Confidential
+         Information does not include any information that (i) is or becomes generally known to the public without
+         breach of any obligation owed to the Disclosing Party, (ii) was known to the Receiving Party prior to its
+         disclosure by the Disclosing Party without breach of any obligation owed to the Disclosing Party, (iii) is
+         received from a third party without breach of any obligation owed to the Disclosing Party, or (iv) was
+         independently developed by the Receiving Party.
+   1.3.  “Customer Data” means business information or other data loaded by or for Customer and/or processed by the
+         Software.
+   1.4.  “Data Protection Legislation” means all applicable data protection and privacy legislation in force from time
+         to time in the UK including the General Data Protection Regulation ((EU) 2016/679) as it forms part of UK law
+         by virtue of section 3 of the European Union (Withdrawal) Act 2018; the Data
+         Protection Act 2018; the Privacy and Electronic Communications Directive 2002/58/EC (as updated by Directive
+         2009/136/EC); and the Privacy and Electronic Communications Regulations 2003 (SI 2003/2426), in each case as
+         amended.
+   1.5.  “Derivate Work” means any modification or enhancement made by Customer to the Software, whether in source code,
+         binary executable, intermediate or other form.
+   1.6.  “Effective Date” means the date on which you execute this Agreement.
+   1.7.  “Order Document” or “Order” means, as applicable: (i) in the case of a Trial Licence, the Memgraph trial
+         registration form available on Memgraph’s website; or (ii) in any other case, an order form that is submitted
+         by or on behalf of Customer and executed by or on behalf of the parties referencing
+         this Agreement and that specifies the Software and/or Services ordered by Customer, as well as the specific
+         terms and conditions, for that particular transaction.
+   1.8.  “Services” means those services, including Support Services, which may be provided to Customer by Memgraph
+         pursuant to the terms of this Agreement and are expressly limited to those services directly related to
+         Customer’s use of the Software, and expressly exclude any other services.
+   1.9. “Software” means Memgraph’s proprietary downloadable graph database enterprise software known as Memgraph
+         Enterprise Edition (MEE) (“Enterprise Software”) and the associated technical documentation located at
+         https://docs.memgraph.com/ (“Documentation”), as well as software updates, upgrades, bug fixes, or modified
+         versions thereof that Memgraph licenses or provides to Customer directly or indirectly throughout the Subscription
+         Term. For the avoidance of doubt, for the purpose of this Agreement, the term Software excludes Memgraph’s
+         free-to-use software known as Memgraph Community Edition (MCE) which is licensed pursuant to separate terms
+         (including the Business Source Licence (BSL) or Apache 2.0) as indicated here: https://memgraph.com/legal.
+   1.10. “Subscription Term” means the fixed term, of not less than one (1) year, designated in an Order Document
+         beginning on the Effective Date and ending at the end of the period stated therein. If no expiration date is
+         specified in an Order Document, the Subscription Term shall be a one (1) year period (“Minimum Subscription
+         Term”). A “Subscription” is the binding, non-cancellable contract for the use of the Software for the
+         Subscription Term as set forth in an Order Document.
+   1.11. “Support” means the support and maintenance services, including any updates, upgrades, patches, enhancements
+         and bug fixes for the Software that may be provided to Customer by Memgraph pursuant to the terms of this
+         Agreement.
+   1.12. “Users” means employees and Contractors of Customer that Customer has permitted or authorized to access and use
+         of the Software on Customer’s behalf pursuant to the terms of this Agreement.
+
+2. ORDERS, DELIVERY; SUPPORT.
+   2.1.  Delivery. Customer shall access the Software from Memgraph’s website or online repository (as instructed by
+         Memgraph) after the Effective Date. Memgraph shall deliver to Customer the licence key necessary to unlock the
+         Software after Customer accepts an Order. Unless otherwise stated in an Order, Customer is solely responsible
+         for installing Software on Customer’s own computer equipment. In some instances, Customer’s purchasing
+         relationship exists solely between Customer and an authorised reseller of Memgraph’s Software and Services
+         (a “Reseller”), in which case Sections 5.1-5.3 (Fees and Payment) will be inapplicable to such Order(s), and
+         the Reseller shall be responsible for submitting Orders and the appropriate payment method therewith to
+         Memgraph. An Order is not binding until Memgraph accepts and countersigns the Order.
+   2.2.  Support. Memgraph will use commercially reasonable efforts to provide Support to Customer in accordance with
+         Memgraph’s then-current terms and conditions set forth at
+         https://download.memgraph.com/legal/memgraph-support-terms-and-conditions.pdf at the support tier stated in the
+         applicable Order. The Support terms and conditions are subject to change at Memgraph’s discretion; however,
+         Memgraph will not materially reduce the level of Support during a Subscription Term for which Fees have been
+         paid.
+
+3. LICENCE GRANTS; RESTRICTIONS AND PROPRIETARY RIGHTS.
+Customer’s licence and access rights and benefits, and Memgraph’s obligations to Customer, will vary depending on the
+product and the type of licence Memgraph is granting. If you purchased a licence to Memgraph Software, your licence will
+be subject to certain use and/or capacity restrictions, as identified on the applicable Order Document.
+   3.1.  Enterprise Software Licence. In consideration of the Fees paid hereunder and subject to the terms of this
+         Agreement and the applicable Order, Memgraph grants Customer a world-wide, non-exclusive, non-transferable,
+         non-sublicensable, and limited licence during the applicable Subscription Term, to download, access, install
+         and use the Enterprise Software up to the maximum capacity (“Licensed Capacity”), and subject to the usage
+         rules, specified in the applicable Order Document, and to use Documentation solely for Customer’s internal
+         business purposes in connection with the operation of the Enterprise Software.
+   3.2.  Enterprise Trial Licence. If the Customer downloads, accesses, installs or uses the Software under a trial
+         licence (“Trial Licence”), then Customer may use one (1) copy of the Software in accordance with the terms and
+         conditions of this Agreement for a thirty (30) day period, or such longer trial period represented by the
+         applicable licence key issued by or expressly authorised by Memgraph (the “Trial Period”). Trial Licences are
+         permitted solely for Customer’s evaluation use to determine whether to purchase a Subscription to the Software.
+         Customer may not use a Trial Licence for any other purpose. At the end of the Trial Period, the Trial Licence
+         will expire and this Agreement will terminate as to such Trial Licence and continue to apply to any subsequent
+         Subscription or use of the Software. If Customer decides not to obtain a Subscription upon expiration of the
+         Trial Period, it will promptly cease using and will delete the Software from its computer systems. Memgraph has
+         the right to terminate a Trial Licence at any time for any reason.
+   3.3.  Limited right to modify the Software. In consideration of the Fees paid hereunder and subject to the terms of
+         this Agreement and the applicable Order, Memgraph grants Customer a licence to: (i) create, compile and test
+         Derivative Works; (ii) use Derivative Works solely for Customer’s internal business purposes; and (iii)
+         distribute Derivative Works back to Memgraph for potential incorporation into Memgraph’s maintained code base
+         at its sole discretion.
+   3.4.  NO OBLIGATIONS. NOTWITHSTANDING ANYTHING TO THE CONTRARY IN THIS AGREEMENT OR IN ANY ORDER DOCUMENT, MEMGRAPH
+         WILL HAVE NO WARRANTY, INDEMNITY, SUPPORT, OR SERVICE LEVEL, OBLIGATIONS WITH RESPECT TO ANY ENTERPRISE TRIAL,
+         OR OTHER NO-CHARGE SOFTWARE (INCLUDING TOOLS AND UTILITIES) LICENCES.
+   3.5.  General Restrictions. Customer acknowledges that the Software, and its structure, organization, and source code,
+         constitute Memgraph’s and its suppliers’ valuable trade secrets, and that usage of the Software is subject to
+         the following restrictions:
+      3.5.1.   Restrictions. Customer agrees not to, and not to authorize any third party to: (i) allow access or use
+               of the Software by anyone other than its Users; (ii) distribute, embed, sell, rent, transfer, lease,
+               lend, sublicense, loan, assign, pledge, grant a security interest in, or otherwise make the Software
+               accessible or available to any third party; except to the limited extent expressly provided in Section
+               3.5.2, use the Software in any service-bureau, timesharing, outsourcing or similar arrangement; (iii)
+               subject only to the limited rights set out in Section 3.3, modify, adapt, transform, derive, disassemble,
+               decompile, reverse engineer or otherwise attempt to derive the structure, sequence or organization of,
+               the Software or any portion thereof; (iv) remove or alter product identification, copyright, trademark or
+               other proprietary markings contained in or on the Software; (v) conduct any competitive analysis, publish
+               or share with any third party any results of any technical evaluation or tests performed on the Software,
+               or disclose Software features, errors or bugs to a third party without Memgraph’s prior written consent;
+               or (vi) engage in any act designed to circumvent any restriction set forth in this Agreement, in the
+               Software, or in an Order, including but not limited to restrictions related to Licensed Capacity.
+      3.5.2.   Internal Use Licences; Users. The Software is licensed for Customer’s internal business use and not for
+               distribution or use by third parties. For clarity, however, Customer may make available to third parties
+               any Customer-hosted services or other Customer applications or services that make use of or incorporate
+               the Software, provided and solely to the extent that (i) Customer’s application or hosted service adds
+               primary and significant functionality to the Software, (ii) Customer does not embed or otherwise
+               distribute the Software to third parties (iii) Customer does not provide third parties direct access to
+               operate or control the Software itself; and (iv) Customer at all times remains in compliance with the
+               terms of the applicable licence grants under this Agreement. Subject to the terms and conditions of this
+               Agreement, in addition to Customer’s employees, Customer may permit its independent contractors and
+               consultants (“Contractors”) to serve as Users. Customer will remain responsible for compliance by each of
+               its Users (including but not limited to any Contractor Users) with all of the terms and conditions of
+               this Agreement, and any use of the Software by any Contractors must be for the sole benefit of Customer.
+   3.6.  Ownership; Reservation of Rights. This is an agreement for use of Memgraph Software and not an agreement for
+         sale. Customer acknowledges that it is obtaining only a limited right to use the Software on a licensed basis,
+         and that irrespective of any use of the words “purchase”, “sale” or like terms hereunder no ownership rights
+         are being conveyed to Customer. Customer agrees that Memgraph or its suppliers retain all right, title and
+         interest (including all patent, copyright, trade secret and other intellectual property rights) in and to the
+         Memgraph Software. Nothing in this Section shall be deemed as granting Memgraph ownership of Customer Data or
+         in any way impacting Customer’s ownership of Customer Data.
+   3.7.  Third Party Code. The Software may contain or be provided with components which are licensed from third
+         parties, including components subject to the terms and conditions of “open source” software licences
+         (“Open Source Software”). Open Source Software may be identified in the Software, Documentation, or in a list
+         of the Open Source Software provided to you upon your written request. To the extent required by the licence
+         that accompanies the Open Source Software, the terms of such licence will apply in lieu of the terms of this
+         Agreement with respect to such Open Source Software, including, without limitation, any provisions governing
+         access to source code, modification, or reverse engineering.
+   3.8.  IP Ownership. The Parties agree that, save as otherwise provided in this Agreement, neither party shall gain, by
+         virtue of this Agreement, any rights of ownership or any other interest, right or title of copyrights, patents,
+         trade secrets, trademarks, or any other intellectual property rights owned by the other Party. Any and all new
+         works developed in the course of performing obligations pursuant to this Agreement and all new inventions,
+         innovations or ideas developed by a Party in the course of performance of its activities under this Agreement,
+         will belong to that Party who develops the same. Notwithstanding anything to the contrary in this Section, the
+         Parties understand and agree that any and all proprietary materials developed by a Party prior to this
+         Agreement and any modifications, enhancements, improvements or inventions made to such proprietary materials
+         shall be owned by that Party, regardless of which Party prepared or developed such modifications, enhancements,
+         improvements or inventions.
+   3.9.  License-back of Derivate Works. If Customer elects, at its sole discretion, to distribute  Derivative Works
+         back to Memgraph for potential incorporation into Memgraph’s maintained code base, Customer grants Memgraph
+         (without any restrictions, limitations or requirement of remuneration) a worldwide, non-exclusive, fully
+         paid-up, royalty-free, perpetual, irrevocable, transferable and sublicensable licence to use, exploit, modify,
+         make derivative works of, commercialise, distribute and otherwise exploit such Derivative Works.
+
+
+4. CUSTOMER DATA; OBLIGATIONS OF CUSTOMER AND MEMGRAPH.
+   4.1.  Customer shall retain all of its rights, title, and interest in and to its intellectual property rights in
+         Customer Data. Customer grants to Memgraph a non-exclusive, worldwide, limited-term licence solely to host,
+         copy, transmit and display Customer Data as reasonably necessary for Memgraph to support Customer’s use of the
+         Software, to ensure the security of and to administrate the Software, and to deliver Services in accordance
+         with this Agreement or as otherwise outlined in https://memgraph.com/legal/privacy-policy/.
+   4.2.  Protection of Customer Data. Memgraph will maintain appropriate administrative, physical, and technical
+         safeguards, consistent with generally prevailing industry standards, for protection of the security,
+         confidentiality, and integrity of Customer Data, as described in the Documentation. Those safeguards will
+         include, but will not be limited to, measures for preventing access, use, modification, or disclosure of
+         Customer Data by Memgraph personnel, except as permitted by this Agreement.
+   4.3.  Personal data. Both parties will comply with all applicable requirements of the Data Protection Legislation.
+         This section 4.3 is in addition to, and does not relieve, remove or replace, a party’s obligations under the
+         Data Protection Legislation. Notwithstanding the foregoing, the parties acknowledge that, in the ordinary
+         course of providing the Services, Memgraph shall not process personal data (as defined in the Data Protection
+         Legislation) on behalf of the Customer. In the event that the Customer requires Memgraph to process personal
+         data on its behalf, it shall notify Memgraph and the parties shall execute such additional terms as necessary
+         to comply with applicable Data Protection Legislation.
+
+5. FEES AND PAYMENT.
+   5.1.  Fees. Customer will pay Memgraph the fees for the Licences and Services as set forth in the applicable Order (
+         “Fees”). Customer acknowledges and agrees that if Customer’s use of the Software exceeds the Licensed Capacity
+         set forth on the applicable Orders or otherwise requires the payment of additional fees (per the terms of this
+         Agreement), Customer shall be invoiced for such usage and Customer agrees to pay the additional fees in
+         accordance with this Section. Notwithstanding the terms of Section 5.4 below (Reconciliation), Customer
+         acknowledges and agrees that it is obligated to ensure that its Software usage does not exceed the Licensed Capacity
+         and to promptly notify Memgraph of any such excess usage no more than thirty (30) days from the last day of the
+         calendar month during which such excess usage occurred.
+   5.2.  Payment Terms. Except as otherwise specifically set forth on an Order Document, all fees are due and payable
+         within thirty days after the date of invoice. Renewal Fees for any renewal Subscription Term (if purchased by
+         Customer) will be due and payable within thirty (30) days of expiration of the then-current term. If Fees are
+         not paid when due, or in the event of other breach of this Agreement, Customer shall discontinue use of the
+         Software and Memgraph may suspend its performance, including its delivery of technical support of the Software
+         or other Services without further notice and without penalty. All Orders (including multi-year Subscriptions
+         with annual payment schedules) are non-cancellable and all amounts paid are non-refundable, unless otherwise
+         expressly set forth herein. Any invoiced amount not received by the due date will accrue late interest at the
+         rate of 1.5% of the outstanding balance per month, or the maximum rate permitted by applicable law, whichever
+         is lower.
+   5.3.  Taxes. Fees are exclusive of taxes. Customer will pay any sales, use, value added, duties, fees and other
+         governmental assessments or charges arising out of this Agreement and the transactions contemplated herein.
+         Customer will make all payments free and clear of, and without reduction for, any withholding taxes.
+   5.4.  Reconciliation. At Memgraph’s request from time to time, not exceeding once per quarter, Customer will provide
+         Memgraph with a report detailing its use of the Software, including its non-production and/or production use
+         and using the self-monitoring capabilities of the Software or other means, and Memgraph may inspect Customer’s
+         records related to such report not more frequently than annually to ensure payment of Fees. Any on-site review
+         will be conducted during regular business hours at Customer’s offices. The parties will use reasonable efforts
+         to promptly resolve any discrepancies between licensed usage and actual usage.
+
+6. APPLICABLE LAWS.
+   6.1.  Each Party shall perform this Agreement in accordance with all Applicable Laws. Without prejudice to the
+         foregoing, each Party shall:
+      6.1.1.   comply with all Applicable Laws relating to anti-bribery, anti-corruption, anti-slavery and human
+               trafficking, including the Bribery Act 2010 and the Modern Slavery Act 2015
+               (the “Relevant Requirements”);
+      6.1.2.   have and maintain in place throughout the Term its own policies and procedures, including adequate
+               procedures under the Bribery Act 2010, to ensure compliance with the Relevant Requirements, and will
+               enforce them where appropriate;
+      6.1.3.   (if not prohibited by law or regulation from doing so) promptly report to the other Party any request or
+               demand for any undue financial or other advantage of any kind received by the reporting Party in
+               connection with the performance of this Agreement; and
+      6.1.4.   (if not prohibited by law or regulation from doing so) notify the other Party (and email shall be
+               sufficient for this purpose) as soon as it becomes aware of any actual or suspected slavery or human
+               trafficking in a supply chain which has a connection with this Agreement.
+
+7. REPRESENTATIONS AND WARRANTIES.
+   7.1.  Mutual Representations and Warranties. Each Party represents and warrants to the other that: (i) it is a
+         corporation lawfully incorporated and validly existing pursuant to the laws of its place of incorporation;
+         (ii) it has all requisite power and authority, corporate or otherwise, to execute, deliver and perform its
+         obligations under this Agreement; and (iii) this Agreement constitutes its legal, valid and binding obligations
+         and may be enforced against it.
+   7.2. Limited Memgraph Warranty. Memgraph warrants that the Software, when used as permitted hereunder and in
+         accordance with the applicable Documentation, will operate in all material respects as described in the
+         applicable Documentation, and that the Services will be provided in a professional manner consistent with
+         industry standards.
+   7.3.  Limitations; Remedy. Memgraph does not warrant that the Software or the Services will be error-free,
+         uninterrupted or meet Customer’s specific requirements or that performance of the Services will be
+         uninterrupted. Memgraph will have no warranty obligation under Section 7.2 for Customer’s misuse or failure to
+         use the Software in accordance with its Documentation or this Agreement. Customer’s sole and exclusive remedy,
+         and Memgraph’s sole and exclusive obligation, for breach of warranty will be (i) during the thirty (30) day
+         period following initial Delivery of the Software under an Order, Memgraph’s correction of the program errors
+         that cause the breach of warranty, or if Memgraph cannot substantially correct such breach in a commercially
+         reasonable manner, a refund of the fees paid for the nonconforming Software (ii) during the remainder of the
+         relevant Subscription Term, Memgraph’s delivery of Support with respect to any such program errors. In the
+         event of a refund remedy, Customer’s licences and right to use the Software or receive Services will end. In
+         the event of any noticed breach of warranty with respect to Services, Memgraph’s sole and exclusive obligation
+         shall be the re-performance of the deficient Services.
+   7.4.  Disclaimer. THIS SECTION 7 IS A LIMITED WARRANTY AND, EXCEPT EXPRESSLY AS SET FORTH IN SECTION 7.2,
+         THE SOFTWARE, INCLUDING WITHOUT LIMITATION THE THIRD-PARTY CODE, AND ALL SERVICES ARE PROVIDED “AS IS”.
+         MEMGRAPH MAKES NO OTHER WARRANTIES OR REPRESENTATIONS, EXPRESS, IMPLIED, STATUTORY OR OTHERWISE, AND DISCLAIMS
+         ALL IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE, AND NON-INFRINGEMENT.
+
+8. INDEMNIFICATION.
+   8.1.  By Memgraph. Memgraph will defend against any action against Customer brought by a third party to the extent the
+         action is based on a claim that the Software infringes a third party’s patent, copyright or trademark
+         (a “Claim”) and indemnify Customer from the damages, liabilities, costs and expenses (including reasonable
+         attorneys’ fees) awarded against Customer or agreed in settlement by Customer resulting from such Claim. If
+         your use of the Software is (or in Memgraph’s opinion likely to be) enjoined, then Memgraph may, at its own
+         expense and at its option: (i) substitute substantially similar functionality for the Software which renders
+         it non-infringing; (ii) procure for Customer the right to continue to use the Software; or if (i) and (ii) are
+         not commercially reasonable, terminate this Agreement and refund Customer any prepaid, unused (pro-rated) Fees
+         for the duration of the then-current Subscription Term. The foregoing obligations of Memgraph will not apply:
+         (i) if the Software is modified by any party other than Memgraph, but solely to the extent the alleged
+         infringement is caused by such modification; (ii) if the Software is used in combination with other products or
+         processes not provided or authorized by Memgraph, but solely to the extent the alleged infringement is caused
+         by such combination; (iii) use of any version or release of Software other than the most current version or
+         release made available to Customer by Memgraph, if its use would have avoided the infringement; (iv) any
+         unauthorized use of the Software. THIS SECTION 8.1 SETS FORTH MEMGRAPH’S SOLE LIABILITY AND CUSTOMER’S SOLE
+         AND EXCLUSIVE REMEDY WITH RESPECT TO ANY CLAIM OF INTELLECTUAL PROPERTY INFRINGEMENT.
+   8.2.  By Customer. Customer will indemnify and hold Memgraph and its suppliers harmless against any claims,
+         liabilities, costs, and expenses (including reasonable attorneys’ fees) that Memgraph or its suppliers may
+         incur as a result of a third-party claim arising from or related to Customer Data, or misuse or unauthorised
+         use of the Software by Customer or any User.
+   8.3.  Conditions. All defence and indemnity obligations under Sections 8.1 and 8.2 are conditioned on the indemnitee
+         (i) giving the indemnitor written notice of the relevant claim within thirty (30) days after the indemnitee
+         receives notice of the Claim (or sooner if required by applicable law); (ii) reasonably cooperating with the
+         indemnitor, at the indemnitor’s expense, in the defence of the claim; and (iii) giving the indemnitor sole
+         control of the defence and any settlement negotiations. The indemnitee may participate in the defence at its
+         expense.
+
+9. LIMITATION OF LIABILITY.
+   9.1.  TO THE EXTENT PERMITTED BY LAW, NEITHER MEMGRAPH NOR CUSTOMER SHALL BE LIABLE TO THE OTHER OR ANY THIRD PARTY
+         FOR LOST PROFITS (WHETHER DIRECT OR INDIRECT) OR LOSS OF USE OR DATA, SUBSTITUTE GOODS OR SERVICES, OR FOR
+         INCIDENTAL, CONSEQUENTIAL, PUNITIVE, SPECIAL OR EXEMPLARY DAMAGES (INCLUDING DAMAGE TO BUSINESS, REPUTATION OR
+         GOODWILL), OR INDIRECT DAMAGES OF ANY TYPE HOWEVER CAUSED, WHETHER BY BREACH OF WARRANTY, BREACH OF CONTRACT,
+         IN TORT (INCLUDING NEGLIGENCE) OR ANY OTHER LEGAL OR EQUITABLE CAUSE OF ACTION EVEN IF SUCH PARTY HAS BEEN
+         ADVISED OF SUCH DAMAGES IN ADVANCE OR IF SUCH DAMAGES WERE FORESEEABLE.
+   9.2.  LIMITATIONS ON DIRECT DAMAGES. EXCEPT FOR ANY EXCLUDED CLAIMS AND ANY DAMAGES THAT CANNOT BE LIMITED UNDER
+         APPLICABLE LAW, IN NO EVENT WILL MEMGRAPH’S TOTAL AGGREGATE LIABILITY ARISING FROM OR RELATED TO THIS
+         AGREEMENT, EXCEED AN AMOUNT EQUAL TO THE TOTAL AMOUNT OF FEES PAID OR PAYABLE BY CUSTOMER TO MEMGRAPH UNDER
+         THIS AGREEMENT DURING THE TWELVE MONTHS PRECEDING THE CLAIM. THE FOREGOING LIMITATIONS SHALL NOT APPLY TO: (i)
+         PAYMENTS TO A THIRD PARTY ARISING FROM A PARTY’S OBLIGATIONS UNDER SECTION 8 (INDEMNIFICATION); (ii) BREACH BY
+         A PARTY OF SECTION 10 (CONFIDENTIAL INFORMATION), AND (iii) INFRINGEMENT BY A PARTY OF THE OTHER PARTY’S
+         INTELLECTUAL PROPERTY RIGHTS (COLLECTIVELY EXCLUSIONS (i)-(iii) ARE REFERRED TO AS THE “EXCLUDED CLAIMS”). WITH
+         RESPECT TO ANY EXCLUDED CLAIMS, MEMGRAPH’S TOTAL AGGREGATE LIABILITY SHALL IN NO EVENT EXCEED £1,000,000.
+   9.3.  Nothing in this Agreement excludes the liability of Memgraph for death or personal injury caused by the
+         Supplier’s negligence; or for fraud or fraudulent misrepresentation.
+
+10. CONFIDENTIALITY.
+   10.1. The Receiving Party will use the same degree of care that it uses to protect the confidentiality of its own
+         confidential information of like kind (but not less than reasonable care) to (i) not use any confidential
+         information of the Disclosing Party for any purpose outside the scope of this agreement and (ii) except as
+         otherwise authorized by the Disclosing Party in writing, limit access to confidential information of the
+         Disclosing Party to those of its and its affiliates’ employees and contractors who need that access for
+         purposes consistent with this agreement and who have signed confidentiality agreements with the receiving party
+         containing protections not materially less protective of the confidential information than those herein.
+         Neither party will disclose the terms of this agreement or any Orders to any third-party other than its
+         affiliates, legal counsel, and accountants without the other party’s prior written consent, provided that a
+         party that makes any such disclosure to its affiliate, legal counsel or accountants will remain responsible for
+         such affiliate’s, legal counsel’s, or accountant’s compliance with this “Confidentiality” section.
+   10.2. Compelled Disclosure. The Receiving Party may disclose confidential information of the Disclosing Party to the
+         extent compelled by law to do so, provided the Receiving Party gives the Disclosing Party prior notice of the
+         compelled disclosure (to the extent legally permitted) and reasonable assistance, at the Disclosing Party’s
+         cost, if the Disclosing Party wishes to contest the disclosure. If the receiving party is compelled by law to
+         disclose the Disclosing Party’s confidential information as part of a civil proceeding to which the Disclosing
+         Party is a party, and the Disclosing Party is not contesting the disclosure, the Disclosing Party will
+         reimburse the Receiving Party for its reasonable cost of complying and providing secure access to that
+         confidential information.
+
+
+11. TERMINATION.
+   11.1. Term. The term (“Term”) of this Agreement will commence on the Effective Date and continue until all
+         Subscriptions, licence terms and Orders expire, unless earlier terminated in accordance with this Section 11.
+   11.2. Termination for Cause. In the event of a material breach of this Agreement (excluding any breaches for which an
+         exclusive remedy is expressly provided), the non-breaching party may terminate this Agreement if such breach
+         is not cured within thirty (30) days after written notice thereof (except that for a breach of Section 3.5
+         (“General Restrictions”), there will be no cure period). For clarity, material breach of this Agreement
+         includes, but is not limited to, failure to timely pay amounts due hereunder, exceeding the scope of any
+         Licence granted hereunder (including the Licensed Capacity), violating the Licence restrictions, breach of
+         Section 6.1 and failing to protect the other party’s Confidential Information.
+   11.3. Without affecting any other right or remedy available to it, and to the fullest extent permitted by applicable
+         law, either party may terminate this Agreement with immediate effect by giving written notice to the other
+         party if the other party:
+      11.3.1.  suspends, or threatens to suspend, payment of its debts or is unable to pay its debts as they fall due or
+               admits inability to pay its debts or is deemed unable to pay its debts within the meaning of section 123
+               of the Insolvency Act 1986, as if the words “it is proved to the satisfaction of the court” did not
+               appear in sections 123(1)(e) or 123(2) of the Insolvency Act 1986; or
+      11.3.2.  the other party commences negotiations with all or any class of its creditors with a view to rescheduling
+               any of its debts, or makes a proposal for or enters into any compromise or arrangement with its creditors
+               other than for the sole purpose of a scheme for a solvent amalgamation of that other party with one or
+               more other companies or the solvent reconstruction of that other party; or
+      11.3.3.  a petition is filed, a notice is given, a resolution is passed, or an order is made, for or in connection
+               with the winding up of that other party other than for the sole purpose of a scheme for a solvent
+               amalgamation of that other party with one or more other companies or the solvent reconstruction of that
+               other party; or
+      11.3.4.  an application is made to court, or an order is made, for the appointment of an administrator, or if a
+               notice of intention to appoint an administrator is given or if an administrator is appointed, over the
+               other party; or
+      11.3.5.  the holder of a qualifying floating charge over the assets of that other party has become entitled to
+               appoint or has appointed an administrative receiver; or
+      11.3.6.  a person becomes entitled to appoint a receiver over the assets of the other party or a receiver is
+               appointed over the assets of the other party; or
+      11.3.7.  a creditor or encumbrancer of the other party attaches or takes possession of, or a distress, execution,
+               sequestration or other such process is levied or enforced on or sued against, the whole or any part of
+               the other party’s assets and such attachment or process is not discharged within 30 days; or
+      11.3.8.  any event occurs, or proceeding is taken, with respect to the other party in any jurisdiction to which
+               it is subject that has an effect equivalent or similar to any of the events mentioned in clause 11.3.1 to
+               clause 11.3.7 (inclusive); or
+      11.3.9.  the other party suspends or ceases, or threatens to suspend or cease, carrying on all or a substantial
+               part of its business.
+   11.4. Effect of Termination. Upon the termination of this Agreement: (i) all licences will terminate; (ii) Customer
+         will immediately discontinue all use of the affected Software  and erase all other tangible embodiments of
+         Memgraph Confidential Information in Customer’s possession or control, and promptly certify the same to
+         Memgraph; (iii) Memgraph may immediately cease providing the Services; (iv) (subject to this Section),
+         Memgraph will return or delete all tangible embodiments of Customer Confidential Information in Memgraph’s
+         possession or control; and (v) Sections 1 (“Definitions”), 3.5 (“General Restrictions”), 3.6 (“Ownership;
+         Reservation of Rights”), 5 (“Fees and Payment”), 7.3 (“Limitations”), 7.4 (“Disclaimer”), 8
+         (“Indemnification”), 9 (“Limitation of Liability”), 10 (“Confidentiality”), 11.4 (“Effect of Termination”),
+         and 12 (“Miscellaneous”) will survive. If a party’s file retention policies or a valid legal order provides
+         for backup or archival copies of files to be retained, such party will notify the other party of such policy
+         or order, protect the other party’s Confidential Information as required hereunder, and permanently erase,
+         delete, or destroy such Confidential Information as soon as permissible under such policy or order.
+
+12. MISCELLANEOUS.
+   12.1. Assignment. This Agreement will bind and inure to the benefit of each party’s permitted successors and assigns.
+         Memgraph may assign this Agreement to any affiliate or in connection with a merger, reorganization,
+         acquisition, or other transfer of all or substantially all of Memgraph’s assets or voting securities. Customer
+         may not assign or transfer this Agreement, in whole or in part, without Memgraph’s written consent except that
+         Customer may assign its rights and obligations under this Agreement, in whole but not in part, without
+         Memgraph’s written consent in connection with any merger, consolidation, sale of all or substantially all of
+         Customer’s assets or voting stock, or any other similar transaction provided that: (i) the assignee is not a
+         direct competitor of Memgraph; (ii) Customer provides prompt written notice of such assignment to Memgraph;
+         (iii) the assignee is capable of fully performing Customer’s obligations under this Agreement; and (iv) the
+         assignee agrees to be bound by the terms and conditions of this Agreement. Any attempt to transfer or assign
+         this Agreement without such written consent will be null and void.Force Majeure. Memgraph shall have no
+         liability to the Customer under this Agreement if it is prevented from or delayed in performing its obligations
+         under this Agreement, or from carrying on its business, by acts, events, omissions or accidents beyond its
+         reasonable control, including strikes, lock-outs or other industrial disputes (whether involving the workforce
+         of Memgraph or any other party), failure of a utility service or transport or telecommunications network, act
+         of God, war, pandemic, riot, civil commotion, malicious damage, compliance with any law or governmental order,
+         rule, regulation or direction, accident, breakdown of plant or machinery, fire, flood, storm or default of
+         suppliers or subcontractors, provided that the Customer is notified of such an event and its expected duration.
+   12.2. Governing Law. This Agreement and any dispute or claim arising out of or in connection with it or its subject
+         matter or formation (including non-contractual disputes or claims) shall be governed by and construed in
+         accordance with the law of England and Wales.
+   12.3. Jurisdiction. Each party irrevocably agrees that the courts of England and Wales shall have exclusive
+         jurisdiction to settle any dispute or claim arising out of or in connection with this Agreement or its subject
+         matter or formation (including non-contractual disputes or claims).
+   12.4. Severability; Waiver; Construction. If a court of competent jurisdiction adjudges any provision of this
+         Agreement to be invalid or unenforceable, the remaining provisions of this Agreement, if capable of substantial
+         performance, will continue in full force and effect without being impaired or invalidated in any way. The
+         parties agree to replace any invalid provision with a valid provision that most closely approximates the intent
+         and economic effect of the invalid provision. All waivers must be in writing. A party’s consent to, or waiver
+         of, enforcement of this Agreement on one occasion will not be deemed a waiver of any other provision or such
+         provision on any other occasion. In this Agreement, the word “including” means “including but not limited to.”
+         No presumption will operate in favour of or against any party as a result of its role in drafting this
+         Agreement.
+   12.5. Subcontractors. Memgraph may use the services of subcontractors in connection with its performance of this
+         Agreement, provided that Memgraph remains solely responsible for (i) compliance of any such subcontractor with
+         the terms of this Agreement and (ii) the overall performance of Memgraph as required under this Agreement.
+   12.6. Use of Aggregate Data. Customer agrees that Memgraph may collect, use and disclose quantitative data and
+         metadata derived from the use of the Software (i) for its own internal, statistical analysis, (ii) to develop
+         and improve the Software and (iii) to create and distribute reports and other materials regarding use of the
+         Software. For clarity, any such data collected, used, and disclosed will be in anonymized aggregate form only
+         and shall not identify Customer or its Users, or disclose any Customer Data.Independent Contractors. The
+         parties are independent contractors. No agency, partnership, franchise, joint venture, or employment
+         relationship is intended or created by this Agreement. Neither party has the power or authority to create or
+         assume any obligation, or make any representations or warranties, on behalf of the other party.
+   12.7. Publicity. Memgraph may, in conformity with Customer’s trademark usage guidelines, use Customer’s name and logo
+         in Memgraph’s sales and marketing materials, including in business presentations, Customer lists, and on
+         websites. Neither party will issue a press release regarding this Agreement without the other party’s prior
+         written consent. Neither party will disclose the terms of this Agreement to any third party, except as required
+         by law.
+   12.8. Notice. Any notice, consent, or waiver hereunder must be in writing, addressed to the attention of “Legal
+         Department” at the address set forth above, and delivered by personal delivery, reputable rapid courier, or
+         certified/registered mail, return receipt requested, and will be deemed given upon personal delivery, one (1)
+         day after deposit with an overnight domestic courier, two (2) days after deposit with an international courier,
+         or five (5) days after deposit in the certified or registered mail. A party may specify a new address by
+         providing notice to the other party in accordance with this Section.
+   12.9. Compliance with Law. Each party will comply with all applicable laws, regulations, and orders of any
+         governmental authority of competent jurisdiction in its performance under this Agreement, including but not
+         limited to those applicable to data collection and the privacy and security of personal information, including
+         trans-border data transfers and data breach notification requirements as required of each party by law.
+   12.10.Supremacy; Modification. This Agreement will prevail over any written instrument submitted by Customer; the
+         terms of any purchase order, acknowledgement, or similar document submitted by Customer to Memgraph will have
+         no effect. If the express terms of an Order Document conflict with this Agreement, the terms on the Order
+         Document will prevail, but only with respect to that Order Document. This Agreement cannot be varied or
+         supplemented by course of dealing or by usage of trade. All modifications or amendments to this Agreement must
+         be in writing and signed by both parties, except that subsequent renewals and purchases of additional Licensed
+         Capacity can be procured by payment against an issued invoice as set forth in Section 5 (“Fees and Payment”)
+         above.
+   12.11.No Third Party Beneficiaries. This Agreement is not intended and shall not be construed to give any third party
+         any interest or rights with respect to or in connection with any agreement or provision herein, except as
+         expressly provided for in this Agreement.
+   12.12.Entire Agreement. This Agreement in its original English text, sets forth the complete, exclusive, and final
+         agreement of the parties concerning the subject matter hereof, supersedes, replaces, and merges all prior and
+         contemporaneous agreements, communications, and understandings, both
+         written and oral, between them concerning the subject matter hereof. This Agreement may be executed in
+         counterparts.

licenses/third-party/antlr/LICENSE.txt

@@ -0,0 +1,52 @@
+[The "BSD 3-clause license"]
+Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+ 1. Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+ 2. Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+ 3. Neither the name of the copyright holder nor the names of its contributors
+    may be used to endorse or promote products derived from this software
+    without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+=====
+
+MIT License for codepointat.js from https://git.io/codepointat
+MIT License for fromcodepoint.js from https://git.io/vDW1m
+
+Copyright Mathias Bynens <https://mathiasbynens.be/>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

licenses/third-party/bzip2/LICENSE

@@ -0,0 +1,42 @@
+
+--------------------------------------------------------------------------
+
+This program, "bzip2", the associated library "libbzip2", and all
+documentation, are copyright (C) 1996-2010 Julian R Seward.  All
+rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+
+2. The origin of this software must not be misrepresented; you must 
+   not claim that you wrote the original software.  If you use this 
+   software in a product, an acknowledgment in the product 
+   documentation would be appreciated but is not required.
+
+3. Altered source versions must be plainly marked as such, and must
+   not be misrepresented as being the original software.
+
+4. The name of the author may not be used to endorse or promote 
+   products derived from this software without specific prior written 
+   permission.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
+OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
+DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
+GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+Julian Seward, jseward@bzip.org
+bzip2/libbzip2 version 1.0.6 of 6 September 2010
+
+--------------------------------------------------------------------------

licenses/third-party/cppitertools/LICENSE.md

@@ -0,0 +1,23 @@
+Copyright (c) 2013, Ryan Haining, Aaron Josephs, Google
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+  Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+  Redistributions in binary form must reproduce the above copyright notice, this
+  list of conditions and the following disclaimer in the documentation and/or
+  other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

licenses/third-party/fmt/LICENSE.rst

@@ -0,0 +1,27 @@
+Copyright (c) 2012 - present, Victor Zverovich
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+--- Optional exception to the license ---
+
+As an exception, if, as a result of your compiling your source code, portions
+of this Software are embedded into a machine-executable object form of such
+source code, you may redistribute such embedded portions in such object form
+without including the above copyright and permission notices.

licenses/third-party/gflags/COPYING.txt

@@ -0,0 +1,28 @@
+Copyright (c) 2006, Google Inc.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+    * Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+    * Neither the name of Google Inc. nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

licenses/third-party/jemalloc/COPYING

@@ -0,0 +1,27 @@
+Unless otherwise specified, files in the jemalloc source distribution are
+subject to the following license:
+--------------------------------------------------------------------------------
+Copyright (C) 2002-present Jason Evans <jasone@canonware.com>.
+All rights reserved.
+Copyright (C) 2007-2012 Mozilla Foundation.  All rights reserved.
+Copyright (C) 2009-present Facebook, Inc.  All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+1. Redistributions of source code must retain the above copyright notice(s),
+   this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright notice(s),
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) ``AS IS'' AND ANY EXPRESS
+OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
+EVENT SHALL THE COPYRIGHT HOLDER(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
+INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
+OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+--------------------------------------------------------------------------------

licenses/third-party/json/LICENSE.MIT

@@ -0,0 +1,21 @@
+MIT License 
+
+Copyright (c) 2013-2021 Niels Lohmann
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

licenses/third-party/libbcrypt/COPYING

@@ -0,0 +1,121 @@
+Creative Commons Legal Code
+
+CC0 1.0 Universal
+
+    CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
+    LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
+    ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
+    INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
+    REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
+    PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
+    THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
+    HEREUNDER.
+
+Statement of Purpose
+
+The laws of most jurisdictions throughout the world automatically confer
+exclusive Copyright and Related Rights (defined below) upon the creator
+and subsequent owner(s) (each and all, an "owner") of an original work of
+authorship and/or a database (each, a "Work").
+
+Certain owners wish to permanently relinquish those rights to a Work for
+the purpose of contributing to a commons of creative, cultural and
+scientific works ("Commons") that the public can reliably and without fear
+of later claims of infringement build upon, modify, incorporate in other
+works, reuse and redistribute as freely as possible in any form whatsoever
+and for any purposes, including without limitation commercial purposes.
+These owners may contribute to the Commons to promote the ideal of a free
+culture and the further production of creative, cultural and scientific
+works, or to gain reputation or greater distribution for their Work in
+part through the use and efforts of others.
+
+For these and/or other purposes and motivations, and without any
+expectation of additional consideration or compensation, the person
+associating CC0 with a Work (the "Affirmer"), to the extent that he or she
+is an owner of Copyright and Related Rights in the Work, voluntarily
+elects to apply CC0 to the Work and publicly distribute the Work under its
+terms, with knowledge of his or her Copyright and Related Rights in the
+Work and the meaning and intended legal effect of CC0 on those rights.
+
+1. Copyright and Related Rights. A Work made available under CC0 may be
+protected by copyright and related or neighboring rights ("Copyright and
+Related Rights"). Copyright and Related Rights include, but are not
+limited to, the following:
+
+  i. the right to reproduce, adapt, distribute, perform, display,
+     communicate, and translate a Work;
+ ii. moral rights retained by the original author(s) and/or performer(s);
+iii. publicity and privacy rights pertaining to a person's image or
+     likeness depicted in a Work;
+ iv. rights protecting against unfair competition in regards to a Work,
+     subject to the limitations in paragraph 4(a), below;
+  v. rights protecting the extraction, dissemination, use and reuse of data
+     in a Work;
+ vi. database rights (such as those arising under Directive 96/9/EC of the
+     European Parliament and of the Council of 11 March 1996 on the legal
+     protection of databases, and under any national implementation
+     thereof, including any amended or successor version of such
+     directive); and
+vii. other similar, equivalent or corresponding rights throughout the
+     world based on applicable law or treaty, and any national
+     implementations thereof.
+
+2. Waiver. To the greatest extent permitted by, but not in contravention
+of, applicable law, Affirmer hereby overtly, fully, permanently,
+irrevocably and unconditionally waives, abandons, and surrenders all of
+Affirmer's Copyright and Related Rights and associated claims and causes
+of action, whether now known or unknown (including existing as well as
+future claims and causes of action), in the Work (i) in all territories
+worldwide, (ii) for the maximum duration provided by applicable law or
+treaty (including future time extensions), (iii) in any current or future
+medium and for any number of copies, and (iv) for any purpose whatsoever,
+including without limitation commercial, advertising or promotional
+purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
+member of the public at large and to the detriment of Affirmer's heirs and
+successors, fully intending that such Waiver shall not be subject to
+revocation, rescission, cancellation, termination, or any other legal or
+equitable action to disrupt the quiet enjoyment of the Work by the public
+as contemplated by Affirmer's express Statement of Purpose.
+
+3. Public License Fallback. Should any part of the Waiver for any reason
+be judged legally invalid or ineffective under applicable law, then the
+Waiver shall be preserved to the maximum extent permitted taking into
+account Affirmer's express Statement of Purpose. In addition, to the
+extent the Waiver is so judged Affirmer hereby grants to each affected
+person a royalty-free, non transferable, non sublicensable, non exclusive,
+irrevocable and unconditional license to exercise Affirmer's Copyright and
+Related Rights in the Work (i) in all territories worldwide, (ii) for the
+maximum duration provided by applicable law or treaty (including future
+time extensions), (iii) in any current or future medium and for any number
+of copies, and (iv) for any purpose whatsoever, including without
+limitation commercial, advertising or promotional purposes (the
+"License"). The License shall be deemed effective as of the date CC0 was
+applied by Affirmer to the Work. Should any part of the License for any
+reason be judged legally invalid or ineffective under applicable law, such
+partial invalidity or ineffectiveness shall not invalidate the remainder
+of the License, and in such case Affirmer hereby affirms that he or she
+will not (i) exercise any of his or her remaining Copyright and Related
+Rights in the Work or (ii) assert any associated claims and causes of
+action with respect to the Work, in either case contrary to Affirmer's
+express Statement of Purpose.
+
+4. Limitations and Disclaimers.
+
+ a. No trademark or patent rights held by Affirmer are waived, abandoned,
+    surrendered, licensed or otherwise affected by this document.
+ b. Affirmer offers the Work as-is and makes no representations or
+    warranties of any kind concerning the Work, express, implied,
+    statutory or otherwise, including without limitation warranties of
+    title, merchantability, fitness for a particular purpose, non
+    infringement, or the absence of latent or other defects, accuracy, or
+    the present or absence of errors, whether or not discoverable, all to
+    the greatest extent permissible under applicable law.
+ c. Affirmer disclaims responsibility for clearing rights of other persons
+    that may apply to the Work or any use thereof, including without
+    limitation any person's Copyright and Related Rights in the Work.
+    Further, Affirmer disclaims responsibility for obtaining any necessary
+    consents, permissions or other rights required for any use of the
+    Work.
+ d. Affirmer understands and acknowledges that Creative Commons is not a
+    party to this document and has no duty or obligation with respect to
+    this CC0 or use of the Work.

licenses/third-party/librdkafka/LICENSES.txt

@@ -0,0 +1,366 @@
+LICENSE
+--------------------------------------------------------------
+librdkafka - Apache Kafka C driver library
+
+Copyright (c) 2012-2020, Magnus Edenhill
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice,
+   this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.
+
+
+LICENSE.crc32c
+--------------------------------------------------------------
+# For src/crc32c.c copied (with modifications) from
+# http://stackoverflow.com/a/17646775/1821055
+
+/* crc32c.c -- compute CRC-32C using the Intel crc32 instruction
+ * Copyright (C) 2013 Mark Adler
+ * Version 1.1  1 Aug 2013  Mark Adler
+ */
+
+/*
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the author be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+  Mark Adler
+  madler@alumni.caltech.edu
+ */
+
+
+LICENSE.fnv1a
+--------------------------------------------------------------
+parts of src/rdfnv1a.c: http://www.isthe.com/chongo/src/fnv/hash_32a.c
+
+
+Please do not copyright this code.  This code is in the public domain.
+
+LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
+INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
+EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
+CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
+USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+
+By:
+    chongo <Landon Curt Noll> /\oo/\
+    http://www.isthe.com/chongo/
+
+Share and Enjoy!	:-)
+
+
+LICENSE.hdrhistogram
+--------------------------------------------------------------
+This license covers src/rdhdrhistogram.c which is a C port of
+Coda Hale's Golang HdrHistogram https://github.com/codahale/hdrhistogram
+at revision 3a0bb77429bd3a61596f5e8a3172445844342120
+
+-----------------------------------------------------------------------------
+
+The MIT License (MIT)
+
+Copyright (c) 2014 Coda Hale
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE
+
+
+LICENSE.lz4
+--------------------------------------------------------------
+src/rdxxhash.[ch] src/lz4*.[ch]: git@github.com:lz4/lz4.git e2827775ee80d2ef985858727575df31fc60f1f3
+
+LZ4 Library
+Copyright (c) 2011-2016, Yann Collet
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice, this
+  list of conditions and the following disclaimer in the documentation and/or
+  other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+LICENSE.murmur2
+--------------------------------------------------------------
+parts of src/rdmurmur2.c: git@github.com:abrandoned/murmur2.git
+
+
+MurMurHash2 Library
+//-----------------------------------------------------------------------------
+// MurmurHash2 was written by Austin Appleby, and is placed in the public
+// domain. The author hereby disclaims copyright to this source code.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+
+LICENSE.pycrc
+--------------------------------------------------------------
+The following license applies to the files rdcrc32.c and rdcrc32.h which
+have been generated by the pycrc tool.
+============================================================================
+
+Copyright (c) 2006-2012, Thomas Pircher <tehpeh@gmx.net>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+
+
+LICENSE.queue
+--------------------------------------------------------------
+For sys/queue.h:
+
+ * Copyright (c) 1991, 1993
+ *	The Regents of the University of California.  All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 4. Neither the name of the University nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ *
+ *	@(#)queue.h	8.5 (Berkeley) 8/20/94
+ * $FreeBSD$
+
+LICENSE.regexp
+--------------------------------------------------------------
+regexp.c and regexp.h from https://github.com/ccxvii/minilibs sha 875c33568b5a4aa4fb3dd0c52ea98f7f0e5ca684
+
+"
+These libraries are in the public domain (or the equivalent where that is not possible). You can do anything you want with them. You have no legal obligation to do anything else, although I appreciate attribution.
+"
+
+
+LICENSE.snappy
+--------------------------------------------------------------
+######################################################################
+# LICENSE.snappy covers files: snappy.c, snappy.h, snappy_compat.h   #
+# originally retrieved from http://github.com/andikleen/snappy-c     #
+# git revision 8015f2d28739b9a6076ebaa6c53fe27bc238d219              #
+######################################################################
+
+The snappy-c code is under the same license as the original snappy source
+
+Copyright 2011 Intel Corporation All Rights Reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+    * Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+    * Neither the name of Intel Corporation nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+
+LICENSE.tinycthread
+--------------------------------------------------------------
+From https://github.com/tinycthread/tinycthread/README.txt c57166cd510ffb5022dd5f127489b131b61441b9
+
+License
+-------
+
+Copyright (c) 2012 Marcus Geelnard
+              2013-2014 Evan Nemerson
+
+This software is provided 'as-is', without any express or implied
+warranty. In no event will the authors be held liable for any damages
+arising from the use of this software.
+
+Permission is granted to anyone to use this software for any purpose,
+including commercial applications, and to alter it and redistribute it
+freely, subject to the following restrictions:
+
+    1. The origin of this software must not be misrepresented; you must not
+    claim that you wrote the original software. If you use this software
+    in a product, an acknowledgment in the product documentation would be
+    appreciated but is not required.
+
+    2. Altered source versions must be plainly marked as such, and must not be
+    misrepresented as being the original software.
+
+    3. This notice may not be removed or altered from any source
+    distribution.
+
+
+LICENSE.wingetopt
+--------------------------------------------------------------
+For the files wingetopt.c wingetopt.h downloaded from https://github.com/alex85k/wingetopt
+
+/*
+ * Copyright (c) 2002 Todd C. Miller <Todd.Miller@courtesan.com>
+ *
+ * Permission to use, copy, modify, and distribute this software for any
+ * purpose with or without fee is hereby granted, provided that the above
+ * copyright notice and this permission notice appear in all copies.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+ * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+ * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+ * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+ * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+ *
+ * Sponsored in part by the Defense Advanced Research Projects
+ * Agency (DARPA) and Air Force Research Laboratory, Air Force
+ * Materiel Command, USAF, under agreement number F39502-99-1-0512.
+ */
+/*-
+ * Copyright (c) 2000 The NetBSD Foundation, Inc.
+ * All rights reserved.
+ *
+ * This code is derived from software contributed to The NetBSD Foundation
+ * by Dieter Baron and Thomas Klausner.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
+ * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
+ * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
+ * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+

licenses/third-party/mgclient/LICENSE

@@ -0,0 +1,177 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS

licenses/third-party/mgconsole/LICENSE

@@ -0,0 +1,621 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS

licenses/third-party/replxx/LICENSE.md

@@ -0,0 +1,63 @@
+Copyright (c) 2017-2018, Marcin Konarski (amok at codestation.org)  
+Copyright (c) 2010, Salvatore Sanfilippo (antirez at gmail dot com)  
+Copyright (c) 2010, Pieter Noordhuis (pcnoordhuis at gmail dot com)
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+  * Redistributions of source code must retain the above copyright notice,
+    this list of conditions and the following disclaimer.
+  * Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+  * Neither the name of Redis nor the names of its contributors may be used
+    to endorse or promote products derived from this software without
+    specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.
+
+
+wcwidth.cpp
+===========
+
+Markus Kuhn -- 2007-05-26 (Unicode 5.0)
+
+Permission to use, copy, modify, and distribute this software
+for any purpose and without fee is hereby granted. The author
+disclaims all warranties with regard to this software.
+
+
+ConvertUTF.cpp
+==============
+
+Copyright 2001-2004 Unicode, Inc.
+
+Disclaimer
+
+This source code is provided as is by Unicode, Inc. No claims are
+made as to fitness for any particular purpose. No warranties of any
+kind are expressed or implied. The recipient agrees to determine
+applicability of information provided. If this file has been
+purchased on magnetic or optical media from Unicode, Inc., the
+sole remedy for any claim will be exchange of defective media
+within 90 days of receipt.
+
+Limitations on Rights to Redistribute This Code
+
+Unicode, Inc. hereby grants the right to freely use the information
+supplied in this file in the creation of products supporting the
+Unicode Standard, and to make copies of this file in any form
+for internal or external distribution as long as this notice
+remains attached.

licenses/third-party/rocksdb/LICENSE.Apache

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

licenses/third-party/rocksdb/LICENSE.leveldb

@@ -0,0 +1,29 @@
+This contains code that is from LevelDB, and that code is under the following license:
+
+Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+   * Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+   * Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+   * Neither the name of Google Inc. nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

licenses/third-party/spdlog/LICENSE

@@ -0,0 +1,26 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 Gabi Melman.                                       
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+
+-- NOTE: Third party dependency used by this software --
+This software depends on the fmt lib (MIT License),
+and users must comply to its license: https://github.com/fmtlib/fmt/blob/master/LICENSE.rst
+

licenses/third-party/zlib/README

@@ -0,0 +1,115 @@
+ZLIB DATA COMPRESSION LIBRARY
+
+zlib 1.2.11 is a general purpose data compression library.  All the code is
+thread safe.  The data format used by the zlib library is described by RFCs
+(Request for Comments) 1950 to 1952 in the files
+http://tools.ietf.org/html/rfc1950 (zlib format), rfc1951 (deflate format) and
+rfc1952 (gzip format).
+
+All functions of the compression library are documented in the file zlib.h
+(volunteer to write man pages welcome, contact zlib@gzip.org).  A usage example
+of the library is given in the file test/example.c which also tests that
+the library is working correctly.  Another example is given in the file
+test/minigzip.c.  The compression library itself is composed of all source
+files in the root directory.
+
+To compile all files and run the test program, follow the instructions given at
+the top of Makefile.in.  In short "./configure; make test", and if that goes
+well, "make install" should work for most flavors of Unix.  For Windows, use
+one of the special makefiles in win32/ or contrib/vstudio/ .  For VMS, use
+make_vms.com.
+
+Questions about zlib should be sent to <zlib@gzip.org>, or to Gilles Vollant
+<info@winimage.com> for the Windows DLL version.  The zlib home page is
+http://zlib.net/ .  Before reporting a problem, please check this site to
+verify that you have the latest version of zlib; otherwise get the latest
+version and check whether the problem still exists or not.
+
+PLEASE read the zlib FAQ http://zlib.net/zlib_faq.html before asking for help.
+
+Mark Nelson <markn@ieee.org> wrote an article about zlib for the Jan.  1997
+issue of Dr.  Dobb's Journal; a copy of the article is available at
+http://marknelson.us/1997/01/01/zlib-engine/ .
+
+The changes made in version 1.2.11 are documented in the file ChangeLog.
+
+Unsupported third party contributions are provided in directory contrib/ .
+
+zlib is available in Java using the java.util.zip package, documented at
+http://java.sun.com/developer/technicalArticles/Programming/compression/ .
+
+A Perl interface to zlib written by Paul Marquess <pmqs@cpan.org> is available
+at CPAN (Comprehensive Perl Archive Network) sites, including
+http://search.cpan.org/~pmqs/IO-Compress-Zlib/ .
+
+A Python interface to zlib written by A.M. Kuchling <amk@amk.ca> is
+available in Python 1.5 and later versions, see
+http://docs.python.org/library/zlib.html .
+
+zlib is built into tcl: http://wiki.tcl.tk/4610 .
+
+An experimental package to read and write files in .zip format, written on top
+of zlib by Gilles Vollant <info@winimage.com>, is available in the
+contrib/minizip directory of zlib.
+
+
+Notes for some targets:
+
+- For Windows DLL versions, please see win32/DLL_FAQ.txt
+
+- For 64-bit Irix, deflate.c must be compiled without any optimization. With
+  -O, one libpng test fails. The test works in 32 bit mode (with the -n32
+  compiler flag). The compiler bug has been reported to SGI.
+
+- zlib doesn't work with gcc 2.6.3 on a DEC 3000/300LX under OSF/1 2.1 it works
+  when compiled with cc.
+
+- On Digital Unix 4.0D (formely OSF/1) on AlphaServer, the cc option -std1 is
+  necessary to get gzprintf working correctly. This is done by configure.
+
+- zlib doesn't work on HP-UX 9.05 with some versions of /bin/cc. It works with
+  other compilers. Use "make test" to check your compiler.
+
+- gzdopen is not supported on RISCOS or BEOS.
+
+- For PalmOs, see http://palmzlib.sourceforge.net/
+
+
+Acknowledgments:
+
+  The deflate format used by zlib was defined by Phil Katz.  The deflate and
+  zlib specifications were written by L.  Peter Deutsch.  Thanks to all the
+  people who reported problems and suggested various improvements in zlib; they
+  are too numerous to cite here.
+
+Copyright notice:
+
+ (C) 1995-2017 Jean-loup Gailly and Mark Adler
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the authors be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+  Jean-loup Gailly        Mark Adler
+  jloup@gzip.org          madler@alumni.caltech.edu
+
+If you use the zlib library in a product, we would appreciate *not* receiving
+lengthy legal documents to sign.  The sources are provided for free but without
+warranty of any kind.  The library has been entirely written by Jean-loup
+Gailly and Mark Adler; it does not include third-party code.
+
+If you redistribute modified sources, we would appreciate that you include in
+the file ChangeLog history information documenting your changes.  Please read
+the FAQ for more information on the distribution of modified source versions.

query_modules/CMakeLists.txt

@@ -8,35 +8,41 @@ disallow_in_source_build()
 
 # Everything that is installed here, should be under the "query_modules" component.
 set(CMAKE_INSTALL_DEFAULT_COMPONENT_NAME "query_modules")
-
-add_library(example SHARED example.c)
-target_include_directories(example PRIVATE ${CMAKE_SOURCE_DIR}/include)
-target_compile_options(example PRIVATE -Wall)
-
-# Strip the library in release build.
 string(TOLOWER ${CMAKE_BUILD_TYPE} lower_build_type)
-if (lower_build_type STREQUAL "release")
-  add_custom_command(TARGET example POST_BUILD
-                     COMMAND strip -s $<TARGET_FILE:example>
-                     COMMENT "Stripping symbols and sections from example module")
-endif()
 
-install(PROGRAMS $<TARGET_FILE:example>
+add_library(example_c SHARED example.c)
+target_include_directories(example_c PRIVATE ${CMAKE_SOURCE_DIR}/include)
+target_compile_options(example_c PRIVATE -Wall)
+# Strip C example in release build.
+if (lower_build_type STREQUAL "release")
+  add_custom_command(TARGET example_c POST_BUILD
+                     COMMAND strip -s $<TARGET_FILE:example_c>
+                     COMMENT "Stripping symbols and sections from the C example module")
+endif()
+install(PROGRAMS $<TARGET_FILE:example_c>
         DESTINATION lib/memgraph/query_modules
-        RENAME example.so)
+        RENAME example_c.so)
 # Also install the source of the example, so user can read it.
 install(FILES example.c DESTINATION lib/memgraph/query_modules/src)
 
-# Install the Python example
-install(FILES example.py DESTINATION lib/memgraph/query_modules RENAME py_example.py)
+add_library(example_cpp SHARED example.cpp)
+target_include_directories(example_cpp PRIVATE ${CMAKE_SOURCE_DIR}/include)
+target_compile_options(example_cpp PRIVATE -Wall)
+# Strip C++ example in release build.
+if (lower_build_type STREQUAL "release")
+  add_custom_command(TARGET example_cpp POST_BUILD
+                     COMMAND strip -s $<TARGET_FILE:example_cpp>
+                     COMMENT "Stripping symbols and sections from the C++ example module")
+endif()
+install(PROGRAMS $<TARGET_FILE:example_cpp>
+        DESTINATION lib/memgraph/query_modules
+        RENAME example_cpp.so)
+# Also install the source of the example, so user can read it.
+install(FILES example.cpp DESTINATION lib/memgraph/query_modules/src)
 
-# Install the Python modules
+# Install the Python example and modules
+install(FILES example.py DESTINATION lib/memgraph/query_modules RENAME py_example.py)
 install(FILES graph_analyzer.py DESTINATION lib/memgraph/query_modules)
 install(FILES mgp_networkx.py DESTINATION lib/memgraph/query_modules)
 install(FILES nxalg.py DESTINATION lib/memgraph/query_modules)
 install(FILES wcc.py DESTINATION lib/memgraph/query_modules)
-
-if (MG_ENTERPRISE)
-  add_subdirectory(louvain)
-  add_subdirectory(connectivity)
-endif()

query_modules/connectivity/CMakeLists.txt

@@ -1,18 +0,0 @@
-set(MODULE src/connectivity_module.cpp)
-
-include_directories(src)
-
-add_library(connectivity SHARED ${MODULE})
-target_include_directories(connectivity PRIVATE ${CMAKE_SOURCE_DIR}/include)
-
-# Strip the library in release build.
-string(TOLOWER ${CMAKE_BUILD_TYPE} lower_build_type)
-if (lower_build_type STREQUAL "release")
-  add_custom_command(TARGET connectivity POST_BUILD
-                     COMMAND strip -s $<TARGET_FILE:connectivity>
-                     COMMENT "Stripping symbols and sections from connectivity module")
-endif()
-
-install(PROGRAMS $<TARGET_FILE:connectivity>
-        DESTINATION lib/memgraph/query_modules
-        RENAME connectivity.so)

query_modules/connectivity/src/connectivity_module.cpp

@@ -1,131 +0,0 @@
-#include "mg_procedure.h"
-
-#include <queue>
-#include <unordered_map>
-
-// Finds weakly connected components of a graph.
-// Time complexity: O(|V|+|E|)
-static void weak(const mgp_list *args, const mgp_graph *graph,
-                 mgp_result *result, mgp_memory *memory) {
-  std::unordered_map<int64_t, int64_t> vertex_component;
-  mgp_vertices_iterator *vertices_iterator =
-      mgp_graph_iter_vertices(graph, memory);
-  if (vertices_iterator == nullptr) {
-    mgp_result_set_error_msg(result, "Not enough memory");
-    return;
-  }
-
-  int64_t curr_component = 0;
-  for (const mgp_vertex *vertex = mgp_vertices_iterator_get(vertices_iterator);
-       vertex != nullptr;
-       vertex = mgp_vertices_iterator_next(vertices_iterator)) {
-    mgp_vertex_id vertex_id = mgp_vertex_get_id(vertex);
-    if (vertex_component.find(vertex_id.as_int) != vertex_component.end())
-      continue;
-
-    // run bfs from current vertex
-    std::queue<int64_t> q;
-    q.push(vertex_id.as_int);
-    vertex_component[vertex_id.as_int] = curr_component;
-    while (!q.empty()) {
-      mgp_vertex *v = mgp_graph_get_vertex_by_id(graph, {q.front()}, memory);
-      if (v == nullptr) {
-        mgp_vertices_iterator_destroy(vertices_iterator);
-        mgp_result_set_error_msg(result, "Not enough memory");
-        return;
-      }
-
-      q.pop();
-
-      // iterate over inbound edges
-      mgp_edges_iterator *edges_iterator = mgp_vertex_iter_in_edges(v, memory);
-      if (edges_iterator == nullptr) {
-        mgp_vertex_destroy(v);
-        mgp_vertices_iterator_destroy(vertices_iterator);
-        mgp_result_set_error_msg(result, "Not enough memory");
-        return;
-      }
-
-      for (const mgp_edge *edge = mgp_edges_iterator_get(edges_iterator);
-           edge != nullptr; edge = mgp_edges_iterator_next(edges_iterator)) {
-        mgp_vertex_id next_id = mgp_vertex_get_id(mgp_edge_get_from(edge));
-        if (vertex_component.find(next_id.as_int) != vertex_component.end())
-          continue;
-        vertex_component[next_id.as_int] = curr_component;
-        q.push(next_id.as_int);
-      }
-
-      // iterate over outbound edges
-      mgp_edges_iterator_destroy(edges_iterator);
-      edges_iterator = mgp_vertex_iter_out_edges(v, memory);
-      if (edges_iterator == nullptr) {
-        mgp_vertex_destroy(v);
-        mgp_vertices_iterator_destroy(vertices_iterator);
-        mgp_result_set_error_msg(result, "Not enough memory");
-        return;
-      }
-
-      for (const mgp_edge *edge = mgp_edges_iterator_get(edges_iterator);
-           edge != nullptr; edge = mgp_edges_iterator_next(edges_iterator)) {
-        mgp_vertex_id next_id = mgp_vertex_get_id(mgp_edge_get_to(edge));
-        if (vertex_component.find(next_id.as_int) != vertex_component.end())
-          continue;
-        vertex_component[next_id.as_int] = curr_component;
-        q.push(next_id.as_int);
-      }
-
-      mgp_vertex_destroy(v);
-      mgp_edges_iterator_destroy(edges_iterator);
-    }
-
-    ++curr_component;
-  }
-
-  mgp_vertices_iterator_destroy(vertices_iterator);
-
-  for (const auto &p : vertex_component) {
-    mgp_result_record *record = mgp_result_new_record(result);
-    if (record == nullptr) {
-      mgp_result_set_error_msg(result, "Not enough memory");
-      return;
-    }
-
-    mgp_value *mem_id_value = mgp_value_make_int(p.first, memory);
-    if (mem_id_value == nullptr) {
-      mgp_result_set_error_msg(result, "Not enough memory");
-      return;
-    }
-
-    mgp_value *comp_value = mgp_value_make_int(p.second, memory);
-    if (comp_value == nullptr) {
-      mgp_value_destroy(mem_id_value);
-      mgp_result_set_error_msg(result, "Not enough memory");
-      return;
-    }
-
-    int mem_id_inserted = mgp_result_record_insert(record, "id", mem_id_value);
-    int comp_inserted =
-        mgp_result_record_insert(record, "component", comp_value);
-
-    mgp_value_destroy(mem_id_value);
-    mgp_value_destroy(comp_value);
-
-    if (!mem_id_inserted || !comp_inserted) {
-      mgp_result_set_error_msg(result, "Not enough memory");
-      return;
-    }
-  }
-}
-
-extern "C" int mgp_init_module(struct mgp_module *module,
-                               struct mgp_memory *memory) {
-  struct mgp_proc *wcc_proc =
-      mgp_module_add_read_procedure(module, "weak", weak);
-  if (!mgp_proc_add_result(wcc_proc, "id", mgp_type_int())) return 1;
-  if (!mgp_proc_add_result(wcc_proc, "component", mgp_type_int())) return 1;
-  return 0;
-}
-
-extern "C" int mgp_shutdown_module() {
-  return 0;
-}

query_modules/example.c

@@ -16,61 +16,194 @@
 //   CALL example.procedure(1, 2) YIELD args, result;
 //   CALL example.procedure(1) YIELD args, result;
 // Naturally, you may pass in different arguments or yield less fields.
-static void procedure(const struct mgp_list *args,
-                      const struct mgp_graph *graph, struct mgp_result *result,
+static void procedure(struct mgp_list *args, struct mgp_graph *graph, struct mgp_result *result,
                       struct mgp_memory *memory) {
-  struct mgp_list *args_copy = mgp_list_make_empty(mgp_list_size(args), memory);
-  if (args_copy == NULL) goto error_memory;
-  for (size_t i = 0; i < mgp_list_size(args); ++i) {
-    int success = mgp_list_append(args_copy, mgp_list_at(args, i));
-    if (!success) goto error_free_list;
+  size_t args_size = 0;
+  if (mgp_list_size(args, &args_size) != MGP_ERROR_NO_ERROR) {
+    goto error_something_went_wrong;
+  }
+  struct mgp_list *args_copy = NULL;
+  if (mgp_list_make_empty(args_size, memory, &args_copy) != MGP_ERROR_NO_ERROR) {
+    goto error_something_went_wrong;
+  }
+  for (size_t i = 0; i < args_size; ++i) {
+    struct mgp_value *value = NULL;
+    if (mgp_list_at(args, i, &value) != MGP_ERROR_NO_ERROR) {
+      goto error_free_list;
+    }
+    if (mgp_list_append(args_copy, value) != MGP_ERROR_NO_ERROR) {
+      goto error_free_list;
+    }
+  }
+  struct mgp_result_record *record = NULL;
+  if (mgp_result_new_record(result, &record) != MGP_ERROR_NO_ERROR) {
+    goto error_free_list;
   }
-  struct mgp_result_record *record = mgp_result_new_record(result);
-  if (record == NULL) goto error_free_list;
   // Transfer ownership of args_copy to mgp_value.
-  struct mgp_value *args_value = mgp_value_make_list(args_copy);
-  if (args_value == NULL) goto error_free_list;
-  int args_inserted = mgp_result_record_insert(record, "args", args_value);
+  struct mgp_value *args_value = NULL;
+  if (mgp_value_make_list(args_copy, &args_value) != MGP_ERROR_NO_ERROR) {
+    goto error_free_list;
+  }
   // Release `args_value` and contained `args_copy`.
+  if (mgp_result_record_insert(record, "args", args_value) != MGP_ERROR_NO_ERROR) {
+    mgp_value_destroy(args_value);
+    goto error_something_went_wrong;
+  }
   mgp_value_destroy(args_value);
-  if (!args_inserted) goto error_memory;
-  struct mgp_value *hello_world_value =
-      mgp_value_make_string("Hello World!", memory);
-  if (hello_world_value == NULL) goto error_memory;
-  int result_inserted =
-      mgp_result_record_insert(record, "result", hello_world_value);
+  struct mgp_value *hello_world_value = NULL;
+  if (mgp_value_make_string("Hello World!", memory, &hello_world_value) != MGP_ERROR_NO_ERROR) {
+    goto error_something_went_wrong;
+  }
+  enum mgp_error insert_result = mgp_result_record_insert(record, "result", hello_world_value);
   mgp_value_destroy(hello_world_value);
-  if (!result_inserted) goto error_memory;
+  if (insert_result != MGP_ERROR_NO_ERROR) {
+    goto error_something_went_wrong;
+  }
   // We have successfully finished, so return without error reporting.
   return;
 
 error_free_list:
   mgp_list_destroy(args_copy);
-error_memory:
-  mgp_result_set_error_msg(result, "Not enough memory!");
+error_something_went_wrong:
+  // Best effort. If it fails, there is nothing we can do.
+  mgp_result_set_error_msg(result, "Something went wrong!");
+}
+
+int add_read_procedure(struct mgp_module *module, struct mgp_memory *memory) {
+  struct mgp_proc *proc = NULL;
+  if (mgp_module_add_read_procedure(module, "procedure", procedure, &proc) != MGP_ERROR_NO_ERROR) {
+    return 1;
+  }
+  struct mgp_type *any_type = NULL;
+  if (mgp_type_any(&any_type) != MGP_ERROR_NO_ERROR) {
+    return 1;
+  }
+  struct mgp_type *nullable_any_type = NULL;
+  if (mgp_type_nullable(any_type, &nullable_any_type) != MGP_ERROR_NO_ERROR) {
+    return 1;
+  }
+  if (mgp_proc_add_arg(proc, "required_arg", nullable_any_type) != MGP_ERROR_NO_ERROR) {
+    return 1;
+  }
+
+  struct mgp_value *null_value = NULL;
+  if (mgp_value_make_null(memory, &null_value) != MGP_ERROR_NO_ERROR) {
+    return 1;
+  }
+  if (mgp_proc_add_opt_arg(proc, "optional_arg", nullable_any_type, null_value) != MGP_ERROR_NO_ERROR) {
+    mgp_value_destroy(null_value);
+    return 1;
+  }
+  mgp_value_destroy(null_value);
+  struct mgp_type *string = NULL;
+  if (mgp_type_string(&string) != MGP_ERROR_NO_ERROR) {
+    return 1;
+  }
+  if (mgp_proc_add_result(proc, "result", string) != MGP_ERROR_NO_ERROR) {
+    return 1;
+  }
+  struct mgp_type *list_of_anything = NULL;
+  if (mgp_type_list(nullable_any_type, &list_of_anything) != MGP_ERROR_NO_ERROR) {
+    return 1;
+  }
+  if (mgp_proc_add_result(proc, "args", list_of_anything)) {
+    return 1;
+  }
+  return 0;
+}
+
+// This example procedure returns one field called `created_vertex`
+// which contains the newly created vertex.
+// In case of memory errors, this function will report them and finish
+// executing.
+//
+// The procedure can be invoked in openCypher using the following call:
+//   CALL example.write_procedure("property value") YIELD created_vertex;
+static void write_procedure(struct mgp_list *args, struct mgp_graph *graph, struct mgp_result *result,
+                            struct mgp_memory *memory) {
+  size_t args_size = 0;
+  if (mgp_list_size(args, &args_size) != MGP_ERROR_NO_ERROR) {
+    goto error_something_went_wrong;
+  }
+  if (args_size != 1) {
+    mgp_result_set_error_msg(result, "The procedure requires exactly one argument!");
+    return;
+  }
+
+  struct mgp_value *arg = NULL;
+  if (mgp_list_at(args, 0, &arg) != MGP_ERROR_NO_ERROR) {
+    goto error_something_went_wrong;
+  }
+
+  struct mgp_vertex *vertex = NULL;
+  if (mgp_graph_create_vertex(graph, memory, &vertex) != MGP_ERROR_NO_ERROR) {
+    goto error_something_went_wrong;
+  }
+
+  if (mgp_vertex_set_property(vertex, "new_property", arg) != MGP_ERROR_NO_ERROR) {
+    goto error_destroy_vertex;
+  }
+
+  struct mgp_value *vertex_value = NULL;
+  if (mgp_value_make_vertex(vertex, &vertex_value) != MGP_ERROR_NO_ERROR) {
+    goto error_destroy_vertex;
+  }
+
+  struct mgp_result_record *record = NULL;
+  if (mgp_result_new_record(result, &record) != MGP_ERROR_NO_ERROR) {
+    goto error_destroy_vertex_value;
+  }
+
+  if (mgp_result_record_insert(record, "created_vertex", vertex_value) != MGP_ERROR_NO_ERROR) {
+    goto error_destroy_vertex_value;
+  }
+  mgp_value_destroy(vertex_value);
+
   return;
+
+error_destroy_vertex:
+  mgp_vertex_destroy(vertex);
+  goto error_something_went_wrong;
+error_destroy_vertex_value:
+  mgp_value_destroy(vertex_value);
+error_something_went_wrong:
+  // Best effort. If it fails, there is nothing we can do.
+  mgp_result_set_error_msg(result, "Something went wrong!");
+}
+
+int add_write_procedure(struct mgp_module *module, struct mgp_memory *memory) {
+  struct mgp_proc *proc = NULL;
+  if (mgp_module_add_write_procedure(module, "write_procedure", write_procedure, &proc) != MGP_ERROR_NO_ERROR) {
+    return 1;
+  }
+  struct mgp_type *string_type = NULL;
+  if (mgp_type_string(&string_type) != MGP_ERROR_NO_ERROR) {
+    return 1;
+  }
+
+  if (mgp_proc_add_arg(proc, "required_arg", string_type) != MGP_ERROR_NO_ERROR) {
+    return 1;
+  }
+
+  struct mgp_type *node_type = NULL;
+  if (mgp_type_node(&node_type) != MGP_ERROR_NO_ERROR) {
+    return 1;
+  }
+  if (mgp_proc_add_result(proc, "created_vertex", node_type) != MGP_ERROR_NO_ERROR) {
+    return 1;
+  }
+  return 0;
 }
 
 // Each module needs to define mgp_init_module function.
 // Here you can register multiple procedures your module supports.
 int mgp_init_module(struct mgp_module *module, struct mgp_memory *memory) {
-  struct mgp_proc *proc =
-      mgp_module_add_read_procedure(module, "procedure", procedure);
-  if (!proc) return 1;
-  if (!mgp_proc_add_arg(proc, "required_arg",
-                        mgp_type_nullable(mgp_type_any())))
-    return 1;
-  struct mgp_value *null_value = mgp_value_make_null(memory);
-  if (!mgp_proc_add_opt_arg(proc, "optional_arg",
-                            mgp_type_nullable(mgp_type_any()), null_value)) {
-    mgp_value_destroy(null_value);
-    return 1;
+  if (add_read_procedure(module, memory) != 0) {
+    return -1;
+  }
+  if (add_write_procedure(module, memory) != 0) {
+    return -1;
   }
-  mgp_value_destroy(null_value);
-  if (!mgp_proc_add_result(proc, "result", mgp_type_string())) return 1;
-  if (!mgp_proc_add_result(proc, "args",
-                           mgp_type_list(mgp_type_nullable(mgp_type_any()))))
-    return 1;
   return 0;
 }
 

query_modules/example.cpp

@@ -0,0 +1,103 @@
+// Copyright 2022 Memgraph Ltd.
+//
+// Use of this software is governed by the Business Source License
+// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
+// License, and you may not use this file except in compliance with the Business Source License.
+//
+// As of the Change Date specified in that file, in accordance with
+// the Business Source License, use of this software will be governed
+// by the Apache License, Version 2.0, included in the file
+// licenses/APL.txt.
+
+#include <mgp.hpp>
+
+void ProcImpl(std::vector<mgp::Value> arguments, mgp::Graph graph, mgp::RecordFactory record_factory) {
+  auto record = record_factory.NewRecord();
+  record.Insert("out", true);
+}
+
+void SampleReadProc(mgp_list *args, mgp_graph *memgraph_graph, mgp_result *result, mgp_memory *memory) {
+  try {
+    mgp::memory = memory;
+
+    std::vector<mgp::Value> arguments;
+    for (size_t i = 0; i < mgp::list_size(args); i++) {
+      auto arg = mgp::Value(mgp::list_at(args, i));
+      arguments.push_back(arg);
+    }
+
+    ProcImpl(arguments, mgp::Graph(memgraph_graph), mgp::RecordFactory(result));
+  } catch (const std::exception &e) {
+    mgp::result_set_error_msg(result, e.what());
+    return;
+  }
+}
+
+void AddXNodes(mgp_list *args, mgp_graph *memgraph_graph, mgp_result *result, mgp_memory *memory) {
+  mgp::memory = memory;
+  auto graph = mgp::Graph(memgraph_graph);
+
+  std::vector<mgp::Value> arguments;
+  for (size_t i = 0; i < mgp::list_size(args); i++) {
+    auto arg = mgp::Value(mgp::list_at(args, i));
+    arguments.push_back(arg);
+  }
+
+  for (int i = 0; i < arguments[0].ValueInt(); i++) {
+    graph.CreateNode();
+  }
+}
+
+void Multiply(mgp_list *args, mgp_func_context *ctx, mgp_func_result *res, mgp_memory *memory) {
+  mgp::memory = memory;
+
+  std::vector<mgp::Value> arguments;
+  for (size_t i = 0; i < mgp::list_size(args); i++) {
+    auto arg = mgp::Value(mgp::list_at(args, i));
+    arguments.push_back(arg);
+  }
+
+  auto result = mgp::Result(res);
+
+  auto first = arguments[0].ValueInt();
+  auto second = arguments[1].ValueInt();
+
+  result.SetValue(first * second);
+}
+
+extern "C" int mgp_init_module(struct mgp_module *module, struct mgp_memory *memory) {
+  try {
+    mgp::memory = memory;
+
+    AddProcedure(SampleReadProc, "return_true", mgp::ProdecureType::Read,
+                 {mgp::Parameter("param_1", mgp::Type::Int), mgp::Parameter("param_2", mgp::Type::Double, 2.3)},
+                 {mgp::Return("out", mgp::Type::Bool)}, module, memory);
+  } catch (const std::exception &e) {
+    return 1;
+  }
+
+  try {
+    mgp::memory = memory;
+
+    mgp::AddProcedure(AddXNodes, "add_x_nodes", mgp::ProdecureType::Write, {mgp::Parameter("param_1", mgp::Type::Int)},
+                      {}, module, memory);
+
+  } catch (const std::exception &e) {
+    return 1;
+  }
+
+  try {
+    mgp::memory = memory;
+
+    mgp::AddFunction(Multiply, "multiply",
+                     {mgp::Parameter("int", mgp::Type::Int), mgp::Parameter("int", mgp::Type::Int, (int64_t)3)}, module,
+                     memory);
+
+  } catch (const std::exception &e) {
+    return 1;
+  }
+
+  return 0;
+}
+
+extern "C" int mgp_shutdown_module() { return 0; }

query_modules/example.py

@@ -14,7 +14,7 @@ def procedure(context: mgp.ProcCtx,
                               vertex_count=int,
                               avg_degree=mgp.Number,
                               props=mgp.Nullable[mgp.Map]):
-    '''
+    """
     This example procedure returns 4 fields.
 
       * `args` is a copy of arguments passed to the procedure.
@@ -31,7 +31,7 @@ def procedure(context: mgp.ProcCtx,
       MATCH (n) CALL example.procedure(n, 1) YIELD * RETURN *;
 
     Naturally, you may pass in different arguments or yield different fields.
-    '''
+    """
     # Create a properties map if we received an Edge, Vertex, or Path instance.
     props = None
     if isinstance(required_arg, (mgp.Edge, mgp.Vertex)):
@@ -53,3 +53,42 @@ def procedure(context: mgp.ProcCtx,
     # Multiple rows can be produced by returning an iterable of mgp.Record.
     return mgp.Record(args=args_copy, vertex_count=vertex_count,
                       avg_degree=avg_degree, props=props)
+
+
+@mgp.write_proc
+def write_procedure(context: mgp.ProcCtx,
+                    property_name: str,
+                    property_value: mgp.Nullable[mgp.Any]
+                    ) -> mgp.Record(created_vertex=mgp.Vertex):
+    """
+    This example procedure creates a new vertex with the specified property
+    and connects it to all existing vertex which has the same property with
+    the same name. It returns one field called `created_vertex` which
+    contains the newly created vertex.
+
+    Any errors can be reported by raising an Exception.
+
+    The procedure can be invoked in openCypher using the following calls:
+      - CALL example.write_procedure("property_name", "property_value")
+        YIELD created_vertex;
+      - MATCH (n) WHERE n.my_property IS NOT NULL
+        WITH n.my_property as property_value
+        CALL example.write_procedure("my_property", property_value)
+        YIELD created_vertex;
+
+    Naturally, you may pass in different arguments.
+    """
+    # Collect all the vertices that has the required property with the same
+    # value
+    vertices_to_connect = []
+    for v in context.graph.vertices:
+        if v.properties[property_name] == property_value:
+            vertices_to_connect.append(v)
+    # Create the new vertex and set its property
+    vertex = context.graph.create_vertex()
+    vertex.properties.set(property_name, property_value)
+    # Connect the new vertex to the other vertices
+    for v in vertices_to_connect:
+        context.graph.create_edge(vertex, v, mgp.EdgeType("HAS_SAME_VALUE"))
+
+    return mgp.Record(created_vertex=vertex)

query_modules/louvain/CMakeLists.txt

@@ -1,33 +0,0 @@
-set(MAIN src/main.cpp)
-set(MODULE src/louvain_module.cpp)
-set(SOURCES src/algorithms/louvain.cpp
-            src/data_structures/graph.cpp)
-
-include_directories(src)
-
-add_library(louvain-core STATIC ${SOURCES})
-set_target_properties(louvain-core PROPERTIES POSITION_INDEPENDENT_CODE ON)
-
-add_executable(louvain-main ${MAIN})
-target_link_libraries(louvain-main louvain-core)
-
-enable_testing()
-add_subdirectory(test)
-
-add_library(louvain SHARED ${MODULE})
-target_link_libraries(louvain louvain-core)
-target_include_directories(louvain PRIVATE ${CMAKE_SOURCE_DIR}/include)
-
-# Strip the library in release build.
-string(TOLOWER ${CMAKE_BUILD_TYPE} lower_build_type)
-if (lower_build_type STREQUAL "release")
-  add_custom_command(TARGET louvain POST_BUILD
-                     COMMAND strip -s $<TARGET_FILE:louvain>
-                     COMMENT "Stripping symbols and sections from louvain module")
-endif()
-
-if (NOT MG_COMMUNITY)
-  install(PROGRAMS $<TARGET_FILE:louvain>
-          DESTINATION lib/memgraph/query_modules
-          RENAME louvain.so)
-endif()

query_modules/louvain/src/algorithms/algorithms.hpp

@@ -1,18 +0,0 @@
-/// @file
-///
-/// The file contains function declarations of several community-detection
-/// graph algorithms.
-
-#pragma once
-
-#include "data_structures/graph.hpp"
-
-namespace algorithms {
-  /// Detects communities of an unidrected, weighted graph using the Louvain
-  /// algorithm. The algorithm attempts to maximze the modularity of a weighted
-  /// graph.
-  ///
-  /// @param graph pointer to an undirected, weighted graph which may contain
-  ///              self-loops.
-  void Louvain(comdata::Graph *graph);
-} // namespace algorithms

query_modules/louvain/src/algorithms/louvain.cpp

@@ -1,163 +0,0 @@
-#include "algorithms/algorithms.hpp"
-
-#include <algorithm>
-#include <map>
-#include <random>
-#include <unordered_map>
-
-namespace {
-
-void OptimizeLocally(comdata::Graph *graph) {
-  // We will consider local optimizations uniformly at random.
-  std::random_device rd;
-  std::mt19937 g(rd());
-  std::vector<uint32_t> p(graph->Size());
-  std::iota(p.begin(), p.end(), 0);
-  std::shuffle(p.begin(), p.end(), g);
-
-  // Modularity of a graph can be expressed as:
-  //
-  // Q = 1 / (2m) * sum_over_pairs_of_nodes[(Aij - ki * kj / 2m) * delta(ci, cj)]
-  //
-  // where m is the sum of all weights in the graph,
-  //       Aij is the weight on edge that connects i and j (i=j for a self-loop)
-  //       ki is the sum of weights incident to node i
-  //       ci is the community of node i
-  //       delta(a, b) is the Kronecker delta function.
-  //
-  // With some simple algebraic manipulations, we can transform the formula into:
-  //
-  // Q = sum_over_components[M * ((sum_over_pairs(Aij + M * ki * kj)))] =
-  //   = sum_over_components[M * (sum_over_pairs(Aij) + M * sum_over_nodes^2(ki))] =
-  //   = sum_over_components[M * (w_contrib(ci) + M * k_contrib^2(ci))]
-  //
-  // where M = 1 / (2m)
-  //
-  // Therefore, we could store for each community the following:
-  //    * Weight contribution (w_contrib)
-  //    * Weighted degree contribution (k_contrib)
-  //
-  // This allows us to efficiently remove a node from one community and insert
-  // it into a community of its neighbour without the need to recalculate
-  // modularity from scratch.
-
-  std::unordered_map<uint32_t, double> w_contrib;
-  std::unordered_map<uint32_t, double> k_contrib;
-
-  for (uint32_t node_id = 0; node_id < graph->Size(); ++node_id) {
-    k_contrib[graph->Community(node_id)] += graph->IncidentWeight(node_id);
-    for (const auto &neigh : graph->Neighbours(node_id)) {
-      uint32_t nxt_id = neigh.dest;
-      double w = neigh.weight;
-      if (graph->Community(node_id) == graph->Community(nxt_id))
-        w_contrib[graph->Community(node_id)] += w;
-    }
-  }
-
-  bool stable = false;
-  double total_w = graph->TotalWeight();
-
-  while (!stable) {
-    stable = true;
-    for (uint32_t node_id : p) {
-      std::unordered_map<uint32_t, double> sum_w;
-      double self_loop = 0;
-      sum_w[graph->Community(node_id)] = 0;
-      for (const auto &neigh : graph->Neighbours(node_id)) {
-        uint32_t nxt_id = neigh.dest;
-        double weight = neigh.weight;
-        if (nxt_id == node_id) {
-          self_loop += weight;
-          continue;
-        }
-        sum_w[graph->Community(nxt_id)] += weight;
-      }
-
-      uint32_t my_c = graph->Community(node_id);
-
-      uint32_t best_c = my_c;
-      double best_dq = 0;
-
-      for (const auto &p : sum_w) {
-        if (p.first == my_c) continue;
-        uint32_t nxt_c = p.first;
-        double dq = 0;
-
-        // contributions before swap (dq = d_after - d_before)
-        for (uint32_t c : {my_c, nxt_c})
-          dq -= w_contrib[c] - k_contrib[c] * k_contrib[c] / (2.0 * total_w);
-
-        // leave the current community
-        dq += (w_contrib[my_c] - 2.0 * sum_w[my_c] - self_loop) -
-              (k_contrib[my_c] - graph->IncidentWeight(node_id)) *
-                  (k_contrib[my_c] - graph->IncidentWeight(node_id)) /
-                  (2.0 * total_w);
-
-        // join a new community
-        dq += (w_contrib[nxt_c] + 2.0 * sum_w[nxt_c] + self_loop) -
-              (k_contrib[nxt_c] + graph->IncidentWeight(node_id)) *
-                  (k_contrib[nxt_c] + graph->IncidentWeight(node_id)) /
-                  (2.0 * total_w);
-
-        if (dq > best_dq) {
-          best_dq = dq;
-          best_c = nxt_c;
-        }
-      }
-
-      if (best_c != my_c) {
-        graph->SetCommunity(node_id, best_c);
-        w_contrib[my_c] -= 2.0 * sum_w[my_c] + self_loop;
-        k_contrib[my_c] -= graph->IncidentWeight(node_id);
-        w_contrib[best_c] += 2.0 * sum_w[best_c] + self_loop;
-        k_contrib[best_c] += graph->IncidentWeight(node_id);
-        stable = false;
-      }
-    }
-  }
-}
-
-} // anonymous namespace
-
-namespace algorithms {
-
-void Louvain(comdata::Graph *graph) {
-  OptimizeLocally(graph);
-
-  // Collapse the locally optimized graph.
-  uint32_t collapsed_nodes = graph->NormalizeCommunities();
-  if (collapsed_nodes == graph->Size()) return;
-  comdata::Graph collapsed_graph(collapsed_nodes);
-  std::map<std::pair<uint32_t, uint32_t>, double> collapsed_edges;
-
-  for (uint32_t node_id = 0; node_id < graph->Size(); ++node_id) {
-    std::unordered_map<uint32_t, double> edges;
-    for (const auto &neigh : graph->Neighbours(node_id)) {
-      uint32_t nxt_id = neigh.dest;
-      double weight = neigh.weight;
-      if (graph->Community(nxt_id) < graph->Community(node_id)) continue;
-      edges[graph->Community(nxt_id)] += weight;
-    }
-    for (const auto &neigh : edges) {
-      uint32_t a = std::min(graph->Community(node_id), neigh.first);
-      uint32_t b = std::max(graph->Community(node_id), neigh.first);
-      collapsed_edges[{a, b}] += neigh.second;
-    }
-  }
-
-  for (const auto &p : collapsed_edges)
-    collapsed_graph.AddEdge(p.first.first, p.first.second, p.second);
-
-  // Repeat until no local optimizations can be found.
-  Louvain(&collapsed_graph);
-
-  // Propagate results from collapsed graph.
-  for (uint32_t node_id = 0; node_id < graph->Size(); ++node_id) {
-    graph->SetCommunity(node_id,
-                        collapsed_graph.Community(graph->Community(node_id)));
-  }
-
-  graph->NormalizeCommunities();
-}
-
-} // namespace algorithms

query_modules/louvain/src/data_structures/graph.cpp

@@ -1,99 +0,0 @@
-#include "data_structures/graph.hpp"
-
-#include <exception>
-#include <numeric>
-#include <stdexcept>
-#include <unordered_map>
-#include <unordered_set>
-#include <vector>
-
-namespace comdata {
-
-Graph::Graph(uint32_t n_nodes) : n_nodes_(n_nodes), total_w_(0) {
-  adj_list_.resize(n_nodes, {});
-  inc_w_.resize(n_nodes, 0);
-
-  // each node starts as its own separate community.
-  community_.resize(n_nodes);
-  std::iota(community_.begin(), community_.end(), 0);
-}
-
-uint32_t Graph::Size() const { return n_nodes_; }
-
-uint32_t Graph::Community(uint32_t node) const { return community_.at(node); }
-
-void Graph::SetCommunity(uint32_t node, uint32_t c) { community_.at(node) = c; }
-
-uint32_t Graph::NormalizeCommunities() {
-  std::set<uint32_t> c_id(community_.begin(), community_.end());
-  std::unordered_map<uint32_t, uint32_t> cmap;
-  uint32_t id = 0;
-  for (uint32_t c : c_id) {
-    cmap[c] = id;
-    ++id;
-  }
-  for (uint32_t node_id = 0; node_id < n_nodes_; ++node_id)
-    community_[node_id] = cmap[community_[node_id]];
-  return id;
-}
-
-void Graph::AddEdge(uint32_t node1, uint32_t node2, double weight) {
-  if (node1 >= n_nodes_ || node2 >= n_nodes_)
-    throw std::out_of_range("Node index out of range");
-  if (weight <= 0) throw std::out_of_range("Weights must be positive");
-  if (edges_.find({node1, node2}) != edges_.end())
-    throw std::invalid_argument("Edge already exists");
-
-  edges_.emplace(node1, node2);
-  edges_.emplace(node2, node1);
-
-  total_w_ += weight;
-
-  adj_list_[node1].emplace_back(node2, weight);
-  inc_w_[node1] += weight;
-
-  if (node1 != node2) {
-    adj_list_[node2].emplace_back(node1, weight);
-    inc_w_[node2] += weight;
-  }
-}
-
-uint32_t Graph::Degree(uint32_t node) const {
-  return static_cast<uint32_t>(adj_list_.at(node).size());
-}
-
-double Graph::IncidentWeight(uint32_t node) const { return inc_w_.at(node); }
-
-double Graph::TotalWeight() const { return total_w_; }
-
-double Graph::Modularity() const {
-  double ret = 0;
-  // Since all weights should be positive, this implies that our graph has
-  // no edges.
-  if (total_w_ == 0) return 0;
-
-  std::unordered_map<uint32_t, double> weight_c;
-  std::unordered_map<uint32_t, double> degree_c;
-
-  for (uint32_t i = 0; i < n_nodes_; ++i) {
-    degree_c[Community(i)] += IncidentWeight(i);
-    for (const auto &neigh : adj_list_[i]) {
-      uint32_t j = neigh.dest;
-      double w = neigh.weight;
-      if (Community(i) != Community(j)) continue;
-      weight_c[Community(i)] += w;
-    }
-  }
-
-  for (const auto &p : degree_c)
-    ret += weight_c[p.first] - (p.second * p.second) / (2 * total_w_);
-
-  ret /= 2 * total_w_;
-  return ret;
-}
-
-const std::vector<Neighbour> &Graph::Neighbours(uint32_t node) const {
-  return adj_list_.at(node);
-}
-
-}  // namespace comdata

query_modules/louvain/src/data_structures/graph.hpp

@@ -1,125 +0,0 @@
-/// @file
-
-#pragma once
-
-#include <cstdint>
-#include <set>
-#include <vector>
-
-namespace comdata {
-
-struct Neighbour {
-  uint32_t dest;
-  double weight;
-  Neighbour(uint32_t d, double w) : dest(d), weight(w) {}
-};
-
-/// Class which models a weighted, undirected graph with necessary
-/// functionalities for community detection algorithms.
-class Graph {
-public:
-  /// Constructs a new graph with a given number of nodes and no edges between
-  /// them.
-  ///
-  /// The implementation assumes (and enforces) that all nodes
-  /// are indexed from 0 to n_nodes.
-  ///
-  /// @param n_nodes Number of nodes in the graph.
-  explicit Graph(uint32_t n_nodes);
-
-  /// @return number of nodes in the graph.
-  uint32_t Size() const;
-
-  /// Adds a bidirectional, weighted edge to the graph between the given
-  /// nodes. If both given nodes are the same, the method inserts a weighted
-  /// self-loop.
-  ///
-  /// There should be no edges between the given nodes when before invoking
-  /// this method.
-  ///
-  /// @param node1 index of an incident node.
-  /// @param node2 index of an incident node.
-  /// @param weight real value which represents the weight of the edge.
-  ///
-  /// @throw std::out_of_range
-  /// @throw std::invalid_argument
-  void AddEdge(uint32_t node1, uint32_t node2, double weight);
-
-  /// @param node index of node.
-  ///
-  /// @return community where the node belongs to.
-  ///
-  /// @throw std::out_of_range
-  uint32_t Community(uint32_t node) const;
-
-  /// Adds a given node to a given community.
-  ///
-  /// @param node index of node.
-  /// @param c community where the given node should go in.
-  ///
-  /// @throw std::out_of_range
-  void SetCommunity(uint32_t node, uint32_t c);
-
-  /// Normalizes the values of communities. More precisely, after invoking this
-  /// method communities will be indexed by successive integers starting from 0.
-  ///
-  /// Note: this method is computationally expensive and takes O(|V|)
-  ///       time, i.e., it traverses all nodes in the graph.
-  ///
-  /// @return number of communities in the graph
-  uint32_t NormalizeCommunities();
-
-  /// Returns the number of incident edges to a given node. Self-loops
-  /// contribute a single edge to the degree.
-  ///
-  /// @param node index of node.
-  ///
-  /// @return degree of given node.
-  ///
-  /// @throw std::out_of_range
-  uint32_t Degree(uint32_t node) const;
-
-  /// Returns the total weight of incident edges to a given node. Weight
-  /// of a self loop contributes once to the total sum.
-  ///
-  /// @param node index of node.
-  ///
-  /// @return total incident weight of a given node.
-  ///
-  /// @throw std::out_of_range
-  double IncidentWeight(uint32_t node) const;
-
-  /// @return total weight of all edges in a graph.
-  double TotalWeight() const;
-
-  /// Calculates the modularity of the graph which is defined as a real value
-  /// between -1 and 1 that measures the density of links inside communities
-  /// compared to links between communities.
-  ///
-  /// Note: this method is computationally expensive and takes O(|V| + |E|)
-  ///       time, i.e., it traverses the entire graph.
-  ///
-  /// @return modularity of the graph.
-  double Modularity() const;
-
-  /// Returns nodes adjacent to a given node.
-  ///
-  /// @param node index of node.
-  ///
-  /// @return list of neighbouring nodes.
-  ///
-  /// @throw std::out_of_range
-  const std::vector<Neighbour>& Neighbours(uint32_t node) const;
-
-private:
-  uint32_t n_nodes_;
-  double total_w_;
-
-  std::vector<std::vector<Neighbour>> adj_list_;
-  std::set<std::pair<uint32_t, uint32_t>> edges_;
-
-  std::vector<double> inc_w_;
-  std::vector<uint32_t> community_;
-};
-
-} // namespace comdata

query_modules/louvain/src/louvain_module.cpp

@@ -1,228 +0,0 @@
-#include "mg_procedure.h"
-
-#include <exception>
-#include <string>
-#include <unordered_map>
-
-#include "algorithms/algorithms.hpp"
-#include "data_structures/graph.hpp"
-
-namespace {
-
-std::optional<std::unordered_map<int64_t, uint32_t>> NormalizeVertexIds(
-    const mgp_graph *graph, mgp_result *result, mgp_memory *memory) {
-  std::unordered_map<int64_t, uint32_t> mem_to_louv_id;
-  mgp_vertices_iterator *vertices_iterator =
-      mgp_graph_iter_vertices(graph, memory);
-  if (vertices_iterator == nullptr) {
-    mgp_result_set_error_msg(result, "Not enough memory!");
-    return std::nullopt;
-  }
-
-  uint32_t louv_id = 0;
-  for (const mgp_vertex *vertex = mgp_vertices_iterator_get(vertices_iterator);
-       vertex != nullptr;
-       vertex = mgp_vertices_iterator_next(vertices_iterator)) {
-    mgp_vertex_id mem_id = mgp_vertex_get_id(vertex);
-    mem_to_louv_id[mem_id.as_int] = louv_id;
-    ++louv_id;
-  }
-
-  mgp_vertices_iterator_destroy(vertices_iterator);
-  return mem_to_louv_id;
-}
-
-std::optional<comdata::Graph> RunLouvain(
-    const mgp_graph *graph, mgp_result *result, mgp_memory *memory,
-    const std::unordered_map<int64_t, uint32_t> &mem_to_louv_id) {
-  comdata::Graph louvain_graph(mem_to_louv_id.size());
-  // Extract the graph structure
-  // TODO(ipaljak): consider filtering nodes and edges by labels.
-  for (const auto &p : mem_to_louv_id) {
-    mgp_vertex *vertex = mgp_graph_get_vertex_by_id(graph, {p.first}, memory);
-    if (!vertex) {
-      mgp_result_set_error_msg(result, "Not enough memory!");
-      return std::nullopt;
-    }
-
-    // iterate over inbound edges. This is enough because we will eventually
-    // iterate over outbound edges in another direction.
-    mgp_edges_iterator *edges_iterator =
-        mgp_vertex_iter_in_edges(vertex, memory);
-    if (edges_iterator == nullptr) {
-      mgp_vertex_destroy(vertex);
-      mgp_result_set_error_msg(result, "Not enough memory!");
-      return std::nullopt;
-    }
-
-    for (const mgp_edge *edge = mgp_edges_iterator_get(edges_iterator);
-         edge != nullptr; edge = mgp_edges_iterator_next(edges_iterator)) {
-      const mgp_vertex *next_vertex = mgp_edge_get_from(edge);
-      mgp_vertex_id next_mem_id = mgp_vertex_get_id(next_vertex);
-      uint32_t next_louv_id;
-      try {
-        next_louv_id = mem_to_louv_id.at(next_mem_id.as_int);
-      } catch (const std::exception &e) {
-        const auto msg = std::string("[Internal error] ") + e.what();
-        mgp_result_set_error_msg(result, msg.c_str());
-        return std::nullopt;
-      }
-
-      // retrieve edge weight (default to 1)
-      mgp_value *weight_prop = mgp_edge_get_property(edge, "weight", memory);
-      if (!weight_prop) {
-        mgp_vertex_destroy(vertex);
-        mgp_edges_iterator_destroy(edges_iterator);
-        mgp_result_set_error_msg(result, "Not enough memory");
-      }
-
-      double weight = 1;
-      if (mgp_value_is_double(weight_prop))
-        weight = mgp_value_get_double(weight_prop);
-      if (mgp_value_is_int(weight_prop))
-        weight = static_cast<double>(mgp_value_get_int(weight_prop));
-
-      mgp_value_destroy(weight_prop);
-
-      try {
-        louvain_graph.AddEdge(p.second, next_louv_id, weight);
-      } catch (const std::exception &e) {
-        mgp_vertex_destroy(vertex);
-        mgp_edges_iterator_destroy(edges_iterator);
-        mgp_result_set_error_msg(result, e.what());
-        return std::nullopt;
-      }
-    }
-
-    mgp_vertex_destroy(vertex);
-    mgp_edges_iterator_destroy(edges_iterator);
-  }
-
-  try {
-    algorithms::Louvain(&louvain_graph);
-  } catch (const std::exception &e) {
-    const auto msg = std::string("[Internal error] ") + e.what();
-    mgp_result_set_error_msg(result, msg.c_str());
-    return std::nullopt;
-  }
-
-  return louvain_graph;
-}
-
-void communities(const mgp_list *args, const mgp_graph *graph,
-                 mgp_result *result, mgp_memory *memory) {
-  try {
-    // Normalize vertex ids
-    auto mem_to_louv_id = NormalizeVertexIds(graph, result, memory);
-    if (!mem_to_louv_id) return;
-
-    // Run louvain
-    auto louvain_graph = RunLouvain(graph, result, memory, *mem_to_louv_id);
-    if (!louvain_graph) return;
-
-    // Return node ids and their corresponding communities.
-    for (const auto &p : *mem_to_louv_id) {
-      mgp_result_record *record = mgp_result_new_record(result);
-      if (record == nullptr) {
-        mgp_result_set_error_msg(result, "Not enough memory!");
-        return;
-      }
-
-      mgp_value *mem_id_value = mgp_value_make_int(p.first, memory);
-      if (mem_id_value == nullptr) {
-        mgp_result_set_error_msg(result, "Not enough memory!");
-        return;
-      }
-
-      mgp_value *com_value =
-          mgp_value_make_int(louvain_graph->Community(p.second), memory);
-      if (com_value == nullptr) {
-        mgp_value_destroy(mem_id_value);
-        mgp_result_set_error_msg(result, "Not enough memory!");
-        return;
-      }
-
-      int mem_id_inserted =
-          mgp_result_record_insert(record, "id", mem_id_value);
-      int com_inserted =
-          mgp_result_record_insert(record, "community", com_value);
-
-      mgp_value_destroy(mem_id_value);
-      mgp_value_destroy(com_value);
-
-      if (!mem_id_inserted || !com_inserted) {
-        mgp_result_set_error_msg(result, "Not enough memory!");
-        return;
-      }
-    }
-  } catch (const std::exception &e) {
-    mgp_result_set_error_msg(result, e.what());
-    return;
-  }
-}
-
-void modularity(const mgp_list *args, const mgp_graph *graph,
-                mgp_result *result, mgp_memory *memory) {
-  try {
-    // Normalize vertex ids
-    auto mem_to_louv_id = NormalizeVertexIds(graph, result, memory);
-    if (!mem_to_louv_id) return;
-
-    // Run louvain
-    auto louvain_graph = RunLouvain(graph, result, memory, *mem_to_louv_id);
-    if (!louvain_graph) return;
-
-    // Return graph modularity after Louvain
-    // TODO(ipaljak) - consider allowing the user to specify seed communities
-    // and
-    //                 yield modularity values both before and after running
-    //                 louvain.
-    mgp_result_record *record = mgp_result_new_record(result);
-    if (record == nullptr) {
-      mgp_result_set_error_msg(result, "Not enough memory!");
-      return;
-    }
-
-    mgp_value *modularity_value =
-        mgp_value_make_double(louvain_graph->Modularity(), memory);
-    if (modularity_value == nullptr) {
-      mgp_result_set_error_msg(result, "Not enough memory!");
-      return;
-    }
-
-    int value_inserted =
-        mgp_result_record_insert(record, "modularity", modularity_value);
-
-    mgp_value_destroy(modularity_value);
-
-    if (!value_inserted) {
-      mgp_result_set_error_msg(result, "Not enough memory!");
-      return;
-    }
-  } catch (const std::exception &e) {
-    mgp_result_set_error_msg(result, e.what());
-    return;
-  }
-}
-
-}  // namespace
-
-extern "C" int mgp_init_module(struct mgp_module *module,
-                               struct mgp_memory *memory) {
-  struct mgp_proc *community_proc =
-      mgp_module_add_read_procedure(module, "communities", communities);
-  if (!community_proc) return 1;
-  if (!mgp_proc_add_result(community_proc, "id", mgp_type_int())) return 1;
-  if (!mgp_proc_add_result(community_proc, "community", mgp_type_int()))
-    return 1;
-
-  struct mgp_proc *modularity_proc =
-      mgp_module_add_read_procedure(module, "modularity", modularity);
-  if (!modularity_proc) return 1;
-  if (!mgp_proc_add_result(modularity_proc, "modularity", mgp_type_float()))
-    return 1;
-
-  return 0;
-}
-
-extern "C" int mgp_shutdown_module() { return 0; }

query_modules/louvain/src/main.cpp

@@ -1,28 +0,0 @@
-#include <iostream>
-
-#include "algorithms/algorithms.hpp"
-#include "data_structures/graph.hpp"
-
-// A simple program that reads the graph from STDIN and
-// outputs the detected communities from louvain along with
-// its modularity measure on STDOUT.
-int main() {
-  int n;
-  int m;
-  std::cin >> n >> m;
-  comdata::Graph graph(n);
-  for (int i = 0; i < m; ++i) {
-    int a;
-    int b;
-    double c;
-    std::cin >> a >> b >> c;
-    graph.AddEdge(a, b, c);
-  }
-
-  algorithms::Louvain(&graph);
-
-  for (int i = 0; i < n; ++i)
-    std::cout << i << " " << graph.Community(i) << "\n";
-  std::cout << graph.Modularity() << "\n";
-  return 0;
-}

query_modules/louvain/test/.clang-tidy

@@ -1,80 +0,0 @@
----
-Checks: '*,
-         -android-*,
-         -cert-err58-cpp,
-         -cppcoreguidelines-avoid-c-arrays,
-         -cppcoreguidelines-avoid-goto,
-         -cppcoreguidelines-avoid-magic-numbers,
-         -cppcoreguidelines-macro-usage,
-         -cppcoreguidelines-no-malloc,
-         -cppcoreguidelines-non-private-member-variables-in-classes,
-         -cppcoreguidelines-owning-memory,
-         -cppcoreguidelines-pro-bounds-array-to-pointer-decay,
-         -cppcoreguidelines-pro-bounds-constant-array-index,
-         -cppcoreguidelines-pro-bounds-pointer-arithmetic,
-         -cppcoreguidelines-pro-type-member-init,
-         -cppcoreguidelines-pro-type-reinterpret-cast,
-         -cppcoreguidelines-pro-type-static-cast-downcast,
-         -cppcoreguidelines-pro-type-union-access,
-         -cppcoreguidelines-pro-type-vararg,
-         -cppcoreguidelines-special-member-functions,
-         -fuchsia-default-arguments,
-         -fuchsia-default-arguments-calls,
-         -fuchsia-default-arguments-declarations,
-         -fuchsia-overloaded-operator,
-         -fuchsia-statically-constructed-objects,
-         -fuchsia-trailing-return,
-         -fuchsia-virtual-inheritance,
-         -google-explicit-constructor,
-         -google-readability-*,
-         -hicpp-avoid-c-arrays,
-         -hicpp-avoid-goto,
-         -hicpp-braces-around-statements,
-         -hicpp-member-init,
-         -hicpp-no-array-decay,
-         -hicpp-no-assembler,
-         -hicpp-no-malloc,
-         -hicpp-special-member-functions,
-         -hicpp-use-equals-default,
-         -hicpp-vararg,
-         -llvm-header-guard,
-         -misc-non-private-member-variables-in-classes,
-         -misc-unused-parameters,
-         -modernize-avoid-c-arrays,
-         -modernize-concat-nested-namespaces,
-         -modernize-pass-by-value,
-         -modernize-use-equals-default,
-         -modernize-use-nodiscard,
-         -modernize-use-trailing-return-type,
-         -performance-unnecessary-value-param,
-         -readability-braces-around-statements,
-         -readability-else-after-return,
-         -readability-implicit-bool-conversion,
-         -readability-magic-numbers,
-         -readability-named-parameter'
-WarningsAsErrors: ''
-HeaderFilterRegex: ''
-AnalyzeTemporaryDtors: false
-FormatStyle:     none
-CheckOptions:
-  - key:             google-readability-braces-around-statements.ShortStatementLines
-    value:           '1'
-  - key:             google-readability-function-size.StatementThreshold
-    value:           '800'
-  - key:             google-readability-namespace-comments.ShortNamespaceLines
-    value:           '10'
-  - key:             google-readability-namespace-comments.SpacesBeforeComments
-    value:           '2'
-  - key:             modernize-loop-convert.MaxCopySize
-    value:           '16'
-  - key:             modernize-loop-convert.MinConfidence
-    value:           reasonable
-  - key:             modernize-loop-convert.NamingStyle
-    value:           CamelCase
-  - key:             modernize-pass-by-value.IncludeStyle
-    value:           llvm
-  - key:             modernize-replace-auto-ptr.IncludeStyle
-    value:           llvm
-  - key:             modernize-use-nullptr.NullMacros
-    value:           'NULL'
-...

query_modules/louvain/test/CMakeLists.txt

@@ -1,3 +0,0 @@
-include_directories(${GTEST_INCLUDE_DIR})
-
-add_subdirectory(unit)

query_modules/louvain/test/unit/CMakeLists.txt

@@ -1,28 +0,0 @@
-set(test_prefix louvain__unit__)
-
-add_custom_target(louvain__unit)
-
-add_library(louvain-test STATIC utils.cpp)
-set_target_properties(louvain-test PROPERTIES POSITION_INDEPENDENT_CODE ON)
-
-function(add_unit_test test_cpp)
-  # get exec name (remove extension from the abs path)
-  get_filename_component(exec_name ${test_cpp} NAME_WE)
-  set(target_name ${test_prefix}${exec_name})
-  add_executable(${target_name} ${test_cpp})
-  # OUTPUT_NAME sets the real name of a target when it is built and can be
-  # used to help create two targets of the same name even though CMake
-  # requires unique logical target names
-  set_target_properties(${target_name} PROPERTIES OUTPUT_NAME ${exec_name})
-  # TODO: this is a temporary workaround the test build warnings
-  target_compile_options(${target_name} PRIVATE -Wno-comment -Wno-sign-compare
-                                                -Wno-unused-variable)
-  target_link_libraries(${target_name} spdlog gflags gtest gtest_main Threads::Threads
-                                       louvain-core louvain-test)
-  # register test
-  add_test(${target_name} ${exec_name})
-  # add to unit target
-  add_dependencies(louvain__unit ${target_name})
-endfunction(add_unit_test)
-
-add_unit_test(graph.cpp)

query_modules/louvain/test/unit/graph.cpp

@@ -1,349 +0,0 @@
-#include <gtest/gtest.h>
-
-#include "data_structures/graph.hpp"
-#include "utils.hpp"
-
-// Checks if commmunities of nodes in graph correspond to a given community
-// vector.
-bool CommunityCheck(const comdata::Graph &graph,
-                    const std::vector<uint32_t> &c) {
-  if (graph.Size() != c.size()) return false;
-  for (uint32_t node_id = 0; node_id < graph.Size(); ++node_id)
-    if (graph.Community(node_id) != c[node_id]) return false;
-  return true;
-}
-
-// Checks if degrees of nodes in graph correspond to a given degree vector.
-bool DegreeCheck(const comdata::Graph &graph,
-                 const std::vector<uint32_t> &deg) {
-  if (graph.Size() != deg.size()) return false;
-  for (uint32_t node_id = 0; node_id < graph.Size(); ++node_id)
-    if (graph.Degree(node_id) != deg[node_id]) return false;
-  return true;
-}
-
-// Checks if incident weights of nodes in graph correspond to a given weight
-// vector.
-bool IncidentWeightCheck(const comdata::Graph &graph,
-                         const std::vector<double> &inc_w) {
-  if (graph.Size() != inc_w.size()) return false;
-  for (uint32_t node_id = 0; node_id < graph.Size(); ++node_id)
-    if (std::abs(graph.IncidentWeight(node_id) - inc_w[node_id]) > 1e-6)
-      return false;
-  return true;
-}
-
-// Sets communities of nodes in graph. Returns true on success.
-bool SetCommunities(comdata::Graph *graph, const std::vector<uint32_t> &c) {
-  if (graph->Size() != c.size()) return false;
-  for (uint32_t node_id = 0; node_id < graph->Size(); ++node_id)
-    graph->SetCommunity(node_id, c[node_id]);
-  return true;
-}
-
-TEST(Graph, Constructor) {
-  uint32_t nodes = 100;
-  comdata::Graph graph(nodes);
-  ASSERT_EQ(graph.Size(), nodes);
-  for (uint32_t node_id = 0; node_id < nodes; ++node_id) {
-    ASSERT_EQ(graph.IncidentWeight(node_id), 0);
-    ASSERT_EQ(graph.Community(node_id), node_id);
-  }
-}
-
-TEST(Graph, Size) {
-  comdata::Graph graph1 = GenRandomUnweightedGraph(0, 0);
-  comdata::Graph graph2 = GenRandomUnweightedGraph(42, 41);
-  comdata::Graph graph3 = GenRandomUnweightedGraph(100, 250);
-  ASSERT_EQ(graph1.Size(), 0);
-  ASSERT_EQ(graph2.Size(), 42);
-  ASSERT_EQ(graph3.Size(), 100);
-}
-
-TEST(Graph, Communities) {
-  comdata::Graph graph = GenRandomUnweightedGraph(100, 250);
-
-  for (int i = 0; i < 100; ++i) graph.SetCommunity(i, i % 5);
-  for (int i = 0; i < 100; ++i) ASSERT_EQ(graph.Community(i), i % 5);
-
-  // Try to set communities on non-existing nodes
-  EXPECT_THROW({ graph.SetCommunity(100, 2); }, std::out_of_range);
-  EXPECT_THROW({ graph.SetCommunity(150, 0); }, std::out_of_range);
-
-  // Try to get a the community of a non-existing node
-  EXPECT_THROW({ graph.Community(100); }, std::out_of_range);
-  EXPECT_THROW({ graph.Community(150); }, std::out_of_range);
-}
-
-TEST(Graph, CommunityNormalization) {
-  // Communities are already normalized.
-  comdata::Graph graph = GenRandomUnweightedGraph(5, 10);
-  std::vector<uint32_t> init_c = {0, 2, 1, 3, 4};
-  std::vector<uint32_t> final_c = {0, 2, 1, 3, 4};
-  ASSERT_TRUE(SetCommunities(&graph, init_c));
-  graph.NormalizeCommunities();
-  ASSERT_TRUE(CommunityCheck(graph, final_c));
-
-  // Each node in its own community.
-  graph = GenRandomUnweightedGraph(5, 10);
-  init_c = {20, 30, 10, 40, 50};
-  final_c = {1, 2, 0, 3, 4};
-  ASSERT_TRUE(SetCommunities(&graph, init_c));
-  graph.NormalizeCommunities();
-  ASSERT_TRUE(CommunityCheck(graph, final_c));
-
-  // Multiple nodes in the same community
-  graph = GenRandomUnweightedGraph(7, 10);
-  init_c = {13, 99, 13, 13, 1, 99, 1};
-  final_c = {1, 2, 1, 1, 0, 2, 0};
-  ASSERT_TRUE(SetCommunities(&graph, init_c));
-  graph.NormalizeCommunities();
-  ASSERT_TRUE(CommunityCheck(graph, final_c));
-}
-
-TEST(Graph, AddEdge) {
-  comdata::Graph graph = GenRandomUnweightedGraph(5, 0);
-
-  // Node out of bounds.
-  EXPECT_THROW({ graph.AddEdge(1, 5, 7); }, std::out_of_range);
-
-  // Repeated edge
-  graph.AddEdge(1, 2, 1);
-  EXPECT_THROW({ graph.AddEdge(1, 2, 7); }, std::invalid_argument);
-
-  // Non-positive edge weight
-  EXPECT_THROW({ graph.AddEdge(2, 3, -7); }, std::out_of_range);
-  EXPECT_THROW({ graph.AddEdge(3, 4, 0); }, std::out_of_range);
-}
-
-TEST(Graph, Degrees) {
-  // Graph without edges
-  comdata::Graph graph = GenRandomUnweightedGraph(5, 0);
-  std::vector<uint32_t> deg = {0, 0, 0, 0, 0};
-  ASSERT_TRUE(DegreeCheck(graph, deg));
-
-  // Chain
-  // (0)--(1)--(2)--(3)--(4)
-  graph = BuildGraph(5, {{0, 1, 1}, {1, 2, 1}, {2, 3, 1}, {3, 4, 1}});
-  deg = {1, 2, 2, 2, 1};
-  ASSERT_TRUE(DegreeCheck(graph, deg));
-
-  // Tree
-  //      (0)--(3)
-  //     /   \
-  //   (1)   (2)
-  //    |   /   \
-  //   (4) (5)  (6)
-  graph = BuildGraph(
-      7, {{0, 1, 1}, {0, 2, 1}, {0, 3, 1}, {1, 4, 1}, {2, 5, 1}, {2, 6, 1}});
-  deg = {3, 2, 3, 1, 1, 1, 1};
-  ASSERT_TRUE(DegreeCheck(graph, deg));
-
-  // Graph without self-loops
-  // (0)--(1)
-  //  | \  | \
-  //  |  \ |  \
-  // (2)--(3)-(4)
-  graph = BuildGraph(5, {{0, 1, 1},
-                         {0, 2, 1},
-                         {0, 3, 1},
-                         {1, 3, 1},
-                         {1, 4, 1},
-                         {2, 3, 1},
-                         {3, 4, 1}});
-  deg = {3, 3, 2, 4, 2};
-  ASSERT_TRUE(DegreeCheck(graph, deg));
-
-  // Graph with self loop [*nodes have self loops]
-  // (0)--(1*)
-  //  | \  | \
-  //  |  \ |  \
-  // (2*)--(3)-(4*)
-  graph = BuildGraph(5, {{0, 1, 1},
-                         {0, 2, 1},
-                         {0, 3, 1},
-                         {1, 3, 1},
-                         {1, 4, 1},
-                         {2, 3, 1},
-                         {3, 4, 1},
-                         {1, 1, 1},
-                         {2, 2, 2},
-                         {4, 4, 4}});
-  deg = {3, 4, 3, 4, 3};
-  ASSERT_TRUE(DegreeCheck(graph, deg));
-
-  // Try to get degree of non-existing nodes
-  EXPECT_THROW({ graph.Degree(5); }, std::out_of_range);
-  EXPECT_THROW({ graph.Degree(100); }, std::out_of_range);
-}
-
-TEST(Graph, Weights) {
-  // Graph without edges
-  comdata::Graph graph = GenRandomUnweightedGraph(5, 0);
-  std::vector<double> inc_w = {0, 0, 0, 0, 0};
-  ASSERT_TRUE(IncidentWeightCheck(graph, inc_w));
-  ASSERT_EQ(graph.TotalWeight(), 0);
-
-  // Chain
-  // (0)--(1)--(2)--(3)--(4)
-  graph = BuildGraph(5, {{0, 1, 0.1}, {1, 2, 0.5}, {2, 3, 2.3}, {3, 4, 4.2}});
-  inc_w = {0.1, 0.6, 2.8, 6.5, 4.2};
-  ASSERT_TRUE(IncidentWeightCheck(graph, inc_w));
-  ASSERT_NEAR(graph.TotalWeight(), 7.1, 1e-6);
-
-  // Tree
-  //      (0)--(3)
-  //     /   \
-  //   (1)   (2)
-  //    |   /   \
-  //   (4) (5)  (6)
-  graph = BuildGraph(7, {{0, 1, 1.3},
-                         {0, 2, 0.2},
-                         {0, 3, 1},
-                         {1, 4, 3.2},
-                         {2, 5, 4.2},
-                         {2, 6, 0.7}});
-  inc_w = {2.5, 4.5, 5.1, 1, 3.2, 4.2, 0.7};
-  ASSERT_TRUE(IncidentWeightCheck(graph, inc_w));
-  EXPECT_NEAR(graph.TotalWeight(), 10.6, 1e-6);
-
-  // Graph without self-loops
-  // (0)--(1)
-  //  | \  | \
-  //  |  \ |  \
-  // (2)--(3)-(4)
-  graph = BuildGraph(5, {{0, 1, 0.1},
-                         {0, 2, 0.2},
-                         {0, 3, 0.3},
-                         {1, 3, 0.4},
-                         {1, 4, 0.5},
-                         {2, 3, 0.6},
-                         {3, 4, 0.7}});
-  inc_w = {0.6, 1, 0.8, 2, 1.2};
-  ASSERT_TRUE(IncidentWeightCheck(graph, inc_w));
-  EXPECT_NEAR(graph.TotalWeight(), 2.8, 1e-6);
-
-  // Graph with self loop [*nodes have self loops]
-  // (0)--(1*)
-  //  | \  | \
-  //  |  \ |  \
-  // (2*)--(3)-(4*)
-  graph = BuildGraph(5, {{0, 1, 0.1},
-                         {0, 2, 0.2},
-                         {0, 3, 0.3},
-                         {1, 3, 0.4},
-                         {1, 4, 0.5},
-                         {2, 3, 0.6},
-                         {3, 4, 0.7},
-                         {1, 1, 0.8},
-                         {2, 2, 0.9},
-                         {4, 4, 1}});
-  inc_w = {0.6, 1.8, 1.7, 2, 2.2};
-  ASSERT_TRUE(IncidentWeightCheck(graph, inc_w));
-  EXPECT_NEAR(graph.TotalWeight(), 5.5, 1e-6);
-
-  // Try to get incident weight of non-existing node
-  EXPECT_THROW({ graph.IncidentWeight(5); }, std::out_of_range);
-  EXPECT_THROW({ graph.IncidentWeight(100); }, std::out_of_range);
-}
-
-TEST(Graph, Modularity) {
-  // Graph without edges
-  comdata::Graph graph = GenRandomUnweightedGraph(5, 0);
-  ASSERT_EQ(graph.Modularity(), 0);
-
-  // Chain
-  // (0)--(1)--(2)--(3)--(4)
-  graph = BuildGraph(5, {{0, 1, 0.1}, {1, 2, 0.5}, {2, 3, 2.3}, {3, 4, 4.2}});
-  std::vector<uint32_t> c = {0, 1, 1, 2, 2};
-  SetCommunities(&graph, c);
-  EXPECT_NEAR(graph.Modularity(), 0.036798254314620096, 1e-6);
-
-  // Tree
-  //      (0)--(3)
-  //     /   \
-  //   (1)   (2)
-  //    |   /   \
-  //   (4) (5)  (6)
-  graph = BuildGraph(7, {{0, 1, 1.3},
-                         {0, 2, 0.2},
-                         {0, 3, 1},
-                         {1, 4, 3.2},
-                         {2, 5, 4.2},
-                         {2, 6, 0.7}});
-  c = {0, 0, 1, 0, 0, 1, 2};
-  SetCommunities(&graph, c);
-  EXPECT_NEAR(graph.Modularity(), 0.4424617301530794, 1e-6);
-
-  // Graph without self-loops
-  // (0)--(1)
-  //  | \  | \
-  //  |  \ |  \
-  // (2)--(3)-(4)
-  graph = BuildGraph(5, {{0, 1, 0.1},
-                         {0, 2, 0.2},
-                         {0, 3, 0.3},
-                         {1, 3, 0.4},
-                         {1, 4, 0.5},
-                         {2, 3, 0.6},
-                         {3, 4, 0.7}});
-  c = {0, 1, 1, 1, 1};
-  SetCommunities(&graph, c);
-  EXPECT_NEAR(graph.Modularity(), -0.022959183673469507, 1e-6);
-
-  // Graph with self loop [*nodes have self loops]
-  // (0)--(1*)
-  //  | \  | \
-  //  |  \ |  \
-  // (2*)--(3)-(4*)
-  graph = BuildGraph(5, {{0, 1, 0.1},
-                         {0, 2, 0.2},
-                         {0, 3, 0.3},
-                         {1, 3, 0.4},
-                         {1, 4, 0.5},
-                         {2, 3, 0.6},
-                         {3, 4, 0.7},
-                         {1, 1, 0.8},
-                         {2, 2, 0.9},
-                         {4, 4, 1}});
-  c = {0, 0, 0, 0, 1};
-  SetCommunities(&graph, c);
-  EXPECT_NEAR(graph.Modularity(), 0.188842975206611, 1e-6);
-
-  // Neo4j example graph
-  // (0)--(1)---(3)--(4)
-  //   \  /       \ /
-  //    (2)       (5)
-  graph = BuildGraph(6, {{0, 1, 1},
-                         {1, 2, 1},
-                         {0, 2, 1},
-                         {1, 3, 1},
-                         {3, 5, 1},
-                         {5, 4, 1},
-                         {3, 4, 1}});
-  c = {0, 0, 0, 1, 1, 1};
-  SetCommunities(&graph, c);
-  EXPECT_NEAR(graph.Modularity(), 0.3571428571428571, 1e-6);
-
-  // Example graph from wikipedia
-  // (0)--(1)--(3)--(4)--(5)
-  //   \  /     |      \ /
-  //    (2)    (7)     (6)
-  //          /   \
-  //         (8)--(9)
-  graph = BuildGraph(10, {{0, 1, 1},
-                          {1, 2, 1},
-                          {0, 2, 1},
-                          {1, 3, 1},
-                          {3, 4, 1},
-                          {4, 5, 1},
-                          {5, 6, 1},
-                          {6, 4, 1},
-                          {3, 7, 1},
-                          {7, 8, 1},
-                          {7, 9, 1},
-                          {8, 9, 1}});
-  c = {0, 0, 0, 0, 1, 1, 1, 2, 2, 2};
-  SetCommunities(&graph, c);
-  EXPECT_NEAR(graph.Modularity(), 0.4896, 1e-4);
-}

query_modules/louvain/test/unit/utils.cpp

@@ -1,32 +0,0 @@
-#include "utils.hpp"
-
-#include <random>
-
-comdata::Graph BuildGraph(
-    uint32_t nodes, std::vector<std::tuple<uint32_t, uint32_t, double>> edges) {
-  comdata::Graph G(nodes);
-  for (auto &edge : edges)
-    G.AddEdge(std::get<0>(edge), std::get<1>(edge), std::get<2>(edge));
-  return G;
-}
-
-comdata::Graph GenRandomUnweightedGraph(uint32_t nodes, uint32_t edges) {
-  auto seed =
-      std::chrono::high_resolution_clock::now().time_since_epoch().count();
-  std::mt19937 rng(seed);
-  std::uniform_int_distribution<uint32_t> dist(0, nodes - 1);
-  std::set<std::tuple<uint32_t, uint32_t, double>> E;
-  for (uint32_t i = 0; i < edges; ++i) {
-    int u;
-    int v;
-    do {
-      u = dist(rng);
-      v = dist(rng);
-      if (u > v) std::swap(u, v);
-    } while (u == v || E.find({u, v, 1}) != E.end());
-    E.insert({u, v, 1});
-  }
-  return BuildGraph(nodes, std::vector<std::tuple<uint32_t, uint32_t, double>>(
-                               E.begin(), E.end()));
-}
-

query_modules/louvain/test/unit/utils.hpp

@@ -1,18 +0,0 @@
-#pragma once
-
-#include <chrono>
-#include <random>
-#include <set>
-#include <tuple>
-
-#include "data_structures/graph.hpp"
-
-/// Builds the graph from a given number of nodes and a list of edges.
-/// Nodes should be 0-indexed and each edge should be provided only once.
-comdata::Graph BuildGraph(
-    uint32_t nodes, std::vector<std::tuple<uint32_t, uint32_t, double>> edges);
-
-/// Generates random undirected graph with a given number of nodes and edges.
-/// The generated graph is not picked out of a uniform distribution. All weights
-/// are the same and equal to one.
-comdata::Graph GenRandomUnweightedGraph(uint32_t nodes, uint32_t edges);

release/CMakeLists.txt

@@ -1,12 +1,3 @@
-# Install the license file.
-if (MG_ENTERPRISE)
-  install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/LICENSE_ENTERPRISE.md
-          DESTINATION share/doc/memgraph RENAME copyright)
-else()
-  install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/LICENSE_COMMUNITY.md
-          DESTINATION share/doc/memgraph RENAME copyright)
-endif()
-
 # Install systemd service (must use absolute path).
 install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/memgraph.service
         DESTINATION /lib/systemd/system)
@@ -19,6 +10,14 @@ set(CPACK_PACKAGE_VENDOR "Memgraph Ltd.")
 set(CPACK_PACKAGE_DESCRIPTION_SUMMARY
     "High performance, in-memory, transactional graph database")
 
+# Setting arhitecture extension for deb packages
+set(MG_ARCH_EXTENSION_DEB "all")
+if (${MG_ARCH} STREQUAL "x86_64")
+    set(MG_ARCH_EXTENSION_DEB "amd64")
+elseif (${MG_ARCH} STREQUAL "ARM64")
+    set(MG_ARCH_EXTENSION_DEB  "arm64")
+endif()
+
 # DEB specific
 # Instead of using "name <email>" format, we use "email (name)" to prevent
 # errors due to full stop, '.' at the end of "Ltd". (See: RFC 822)
@@ -26,24 +25,14 @@ set(CPACK_DEBIAN_PACKAGE_MAINTAINER "tech@memgraph.com (Memgraph Ltd.)")
 set(CPACK_DEBIAN_PACKAGE_SECTION non-free/database)
 set(CPACK_DEBIAN_PACKAGE_HOMEPAGE https://memgraph.com)
 set(CPACK_DEBIAN_PACKAGE_VERSION "${MEMGRAPH_VERSION_DEB}")
-set(CPACK_DEBIAN_FILE_NAME "memgraph_${MEMGRAPH_VERSION_DEB}_amd64.deb")
-if (MG_ENTERPRISE)
-  set(CPACK_DEBIAN_PACKAGE_CONTROL_EXTRA
-      "${CMAKE_CURRENT_SOURCE_DIR}/debian/enterprise/conffiles;"
-      "${CMAKE_CURRENT_SOURCE_DIR}/debian/enterprise/copyright;"
-      "${CMAKE_CURRENT_SOURCE_DIR}/debian/preinst;"
-      "${CMAKE_CURRENT_SOURCE_DIR}/debian/prerm;"
-      "${CMAKE_CURRENT_SOURCE_DIR}/debian/postrm;"
-      "${CMAKE_CURRENT_SOURCE_DIR}/debian/postinst;")
-else()
-  set(CPACK_DEBIAN_PACKAGE_CONTROL_EXTRA
-      "${CMAKE_CURRENT_SOURCE_DIR}/debian/community/conffiles;"
-      "${CMAKE_CURRENT_SOURCE_DIR}/debian/community/copyright;"
-      "${CMAKE_CURRENT_SOURCE_DIR}/debian/preinst;"
-      "${CMAKE_CURRENT_SOURCE_DIR}/debian/prerm;"
-      "${CMAKE_CURRENT_SOURCE_DIR}/debian/postrm;"
-      "${CMAKE_CURRENT_SOURCE_DIR}/debian/postinst;")
-endif()
+set(CPACK_DEBIAN_FILE_NAME "memgraph_${MEMGRAPH_VERSION_DEB}_${MG_ARCH_EXTENSION_DEB}.deb")
+set(CPACK_DEBIAN_PACKAGE_CONTROL_EXTRA
+    "${CMAKE_CURRENT_SOURCE_DIR}/debian/conffiles;"
+    "${CMAKE_CURRENT_SOURCE_DIR}/debian/copyright;"
+    "${CMAKE_CURRENT_SOURCE_DIR}/debian/preinst;"
+    "${CMAKE_CURRENT_SOURCE_DIR}/debian/prerm;"
+    "${CMAKE_CURRENT_SOURCE_DIR}/debian/postrm;"
+    "${CMAKE_CURRENT_SOURCE_DIR}/debian/postinst;")
 set(CPACK_DEBIAN_PACKAGE_SHLIBDEPS ON)
 # Description formatting is important, summary must be followed with a newline and 1 space.
 set(CPACK_DEBIAN_PACKAGE_DESCRIPTION "${CPACK_PACKAGE_DESCRIPTION_SUMMARY}
@@ -52,30 +41,33 @@ set(CPACK_DEBIAN_PACKAGE_DESCRIPTION "${CPACK_PACKAGE_DESCRIPTION_SUMMARY}
  applications driver by real-time connected data.")
 # Add `openssl` package to dependencies list. Used to generate SSL certificates.
 # We also depend on `python3` because we embed it in Memgraph.
-set(CPACK_DEBIAN_PACKAGE_DEPENDS "openssl (>= 1.1.0), python3 (>= 3.5.0)")
+set(CPACK_DEBIAN_PACKAGE_DEPENDS "openssl (>= 1.1.0), python3 (>= 3.5.0), libstdc++6")
+
+# Setting arhitecture extension for rpm packages
+set(MG_ARCH_EXTENSION_RPM "noarch")
+if (${MG_ARCH} STREQUAL "x86_64")
+    set(MG_ARCH_EXTENSION_RPM "x86_64")
+elseif (${MG_ARCH} STREQUAL "ARM64")
+    set(MG_ARCH_EXTENSION_RPM  "aarch64")
+endif()
 
 # RPM specific
 set(CPACK_RPM_PACKAGE_URL https://memgraph.com)
 set(CPACK_RPM_PACKAGE_VERSION "${MEMGRAPH_VERSION_RPM}")
-set(CPACK_RPM_FILE_NAME "memgraph-${MEMGRAPH_VERSION_RPM}-1.x86_64.rpm")
+set(CPACK_RPM_FILE_NAME "memgraph-${MEMGRAPH_VERSION_RPM}-1.${MG_ARCH_EXTENSION_RPM}.rpm")
 set(CPACK_RPM_EXCLUDE_FROM_AUTO_FILELIST_ADDITION
   /var /var/lib /var/log /etc/logrotate.d
   /lib /lib/systemd /lib/systemd/system /lib/systemd/system/memgraph.service)
 set(CPACK_RPM_PACKAGE_REQUIRES_PRE "shadow-utils")
-if (MG_ENTERPRISE)
-  set(CPACK_RPM_USER_BINARY_SPECFILE "${CMAKE_CURRENT_SOURCE_DIR}/rpm/enterprise/memgraph.spec.in")
-  set(CPACK_RPM_PACKAGE_LICENSE "Memgraph Enterprise Trial License")
-else()
-  set(CPACK_RPM_USER_BINARY_SPECFILE "${CMAKE_CURRENT_SOURCE_DIR}/rpm/community/memgraph.spec.in")
-  set(CPACK_RPM_PACKAGE_LICENSE "Memgraph Community License")
-endif()
+set(CPACK_RPM_USER_BINARY_SPECFILE "${CMAKE_CURRENT_SOURCE_DIR}/rpm/memgraph.spec.in")
+set(CPACK_RPM_PACKAGE_LICENSE "Memgraph License")
 # Description formatting is important, no line must be greater than 80 characters.
 set(CPACK_RPM_PACKAGE_DESCRIPTION "Contains Memgraph, the graph database.
 It aims to deliver developers the speed, simplicity and scale required to build
 the next generation of applications driver by real-time connected data.")
 # Add `openssl` package to dependencies list. Used to generate SSL certificates.
 # We also depend on `python3` because we embed it in Memgraph.
-set(CPACK_RPM_PACKAGE_REQUIRES "openssl >= 1.0.0, curl >= 7.29.0, python3 >= 3.5.0")
+set(CPACK_RPM_PACKAGE_REQUIRES "openssl >= 1.0.0, curl >= 7.29.0, python3 >= 3.5.0, libstdc >= 6, logrotate")
 
 # All variables must be set before including.
 include(CPack)

release/LICENSE_COMMUNITY.md

@@ -1,98 +0,0 @@
-# Memgraph Community User License Agreement
-
-This License Agreement governs your use of the Memgraph Community Release (the
-"Software") and documentation ("Documentation").
-
-BY DOWNLOADING AND/OR ACCESSING THIS SOFTWARE, YOU ("LICENSEE") AGREE TO THESE
-TERMS.
-
-1. License Grant
-
-The Software and Documentation are provided to Licensee at no charge and are
-licensed, not sold to Licensee. No ownership of any part of the Software and
-Documentation is hereby transferred to Licensee. Subject to (i) the terms and
-conditions of this License Agreement, and (ii) any additional license
-restrictions and parameters contained on Licensor’s quotation, website, or
-order form, Licensor hereby grants Licensee a personal, non-assignable,
-non-transferable and non-exclusive license to install, access and use the
-Software (in object code form only) and Documentation for Licensee’s internal
-business purposes (including for use in a production environment) only. All
-rights relating to the Software and Documentation that are not expressly
-licensed in this License Agreement, whether now existing or which may hereafter
-come into existence are reserved for Licensor. Licensee shall not remove,
-obscure, or alter any proprietary rights notices (including without limitation
-copyright and trademark notices), which may be affixed to or contained within
-the Software or Documentation.
-
-Licensor may terminate this License Agreement with immediate effect upon
-written notice to the Licensee. Upon termination Licensee shall delete all
-electronic copies of all or any part of the Software and/or the Documentation
-resident in its systems or elsewhere.
-
-2. Restrictions
-
-Licensee will not, directly or indirectly, (a) copy the Software or
-Documentation in any manner or for any purpose; (b) install, access or use any
-component of the Software or Documentation for any purpose not expressly
-granted in Section 1 above; (c) resell, distribute, publicly display or
-publicly perform the Software or Documentation or any component thereof, by
-transfer, lease, loan or any other means, or make it available for use by
-others in any time-sharing, service bureau or similar arrangement; (d)
-disassemble, decrypt, extract, reverse engineer or reverse compile the
-Software, or otherwise attempt to discover the source code, confidential
-algorithms or techniques incorporated in the Software; (e) export the Software
-or Documentation in violation of any applicable laws or regulations; (f)
-modify, translate, adapt, or create derivative works from the Software or
-Documentation; (g) circumvent, disable or otherwise interfere with
-security-related features of the Software or Documentation; (h) use the
-Software or Documentation for any illegal purpose, in any manner that is
-inconsistent with the terms of this License Agreement, or to engage in illegal
-activity; (i) remove or alter any trademark, logo, copyright or other
-proprietary notices, legends, symbols or labels on, or embedded in, the
-Software or Documentation; or (j) provide access to the Software or
-Documentation to third parties.
-
-3. Warranty Disclaimer
-
-THE SOFTWARE AND DOCUMENTATION ARE PROVIDED "AS IS" AND LICENSOR MAKES NO
-WARRANTIES, EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
-WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE OR NON
-INFRINGEMENT OF THIRD PARTIES’ INTELLECTUAL PROPERTY RIGHTS OR OTHER
-PROPRIETARY RIGHTS. NEITHER THIS LICENSE AGREEMENT NOR ANY DOCUMENTATION
-FURNISHED UNDER IT IS INTENDED TO EXPRESS OR IMPLY ANY WARRANTY THAT THE
-OPERATION OF THE SOFTWARE WILL BE UNINTERRUPTED, TIMELY, OR ERROR-FREE.
-
-4. Limitation of Liability
-
-Licensor shall not in any circumstances be liable, whether in tort (including
-for negligence or breach of statutory duty howsoever arising), contract,
-misrepresentation (whether innocent or negligent) or otherwise for: loss of
-profits, loss of business, depletion of goodwill or similar losses, loss of
-anticipated savings, loss of goods, loss or corruption of data or computer
-downtime, or any special, indirect, consequential or pure economic loss, costs,
-damages, charges or expenses.
-
-Licensor's total aggregate liability in contract, tort (including without
-limitation negligence or breach of statutory duty howsoever arising),
-misrepresentation (whether innocent or negligent), restitution or otherwise,
-arising in connection with the performance or contemplated performance of this
-License Agreement shall in all circumstances be limited to GBP10.00 (ten pounds
-sterling).
-
-Nothing in this License Agreement shall limit Licensor’s liability in the case
-of death or personal injury caused by negligence, fraud, or fraudulent
-misrepresentation, or where it otherwise cannot be limited by law.
-
-5. Technical Data
-
-Licensor may collect and use technical information (such as usage patterns)
-gathered when the Licensee downloads and uses the Software.  This is generally
-statistical data which does not identify an identified or identifiable
-individual.  It may also include Licensee’s IP address which is personal data
-and is processed in accordance with our Privacy Policy. We only use this
-technical information to improve our products.
-
-6. Law and Jurisdiction
-
-This License Agreement is governed by the laws of England and is subject to the
-non-exclusive jurisdiction of the courts of England.

release/LICENSE_ENTERPRISE.md

@@ -1,671 +0,0 @@
-# Memgraph Enterprise - Software Subscription Agreement
-
-Memgraph Limited is registered in England under registration 10195084 and has
-its registered office at Suite 4, Ironstone House, Ironstone Way, Brixworth,
-Northampton, NN6 9UD ("Memgraph").
-
-Memgraph agrees to license and/or grant you (the "Customer") access to the
-Software, as defined below and provide support and services to you only if you
-accept and agree to be bound by the terms and conditions in this Software
-Subscription Agreement (the "Agreement").  By signing an Order Document (as
-defined below), which is subject to and part of this Agreement, installing and
-using the Software or by downloading a trial version of the Software, you agree
-to be bound by the terms of this Agreement.
-
-Memgraph Enterprise Trial Users: If you receive free of charge trial access to
-the Software, you are deemed a "Customer" for purposes of this Agreement except
-that you are subject to the additional restrictions and limitations set forth
-in Section 3.2 below as to such Software.
-
-## 1. DEFINITIONS.
-
-1.1. "Applicable Laws" means (i) all applicable laws, statutes and regulations,
-and (ii) regulatory policies, guidelines and industry codes (in each case
-having the force of law), which apply to the provisions of the Software and
-Services and this Agreement.
-
-1.2. "Confidential Information" means all information disclosed
-by a party ("Disclosing Party") to the other party ("Receiving Party"), whether
-orally or in writing, that is designated as confidential or that reasonably
-should be understood to be confidential given the nature of the information and
-the circumstances of disclosure. Customer's Confidential Information includes
-Customer Data; Memgraph Confidential Information includes the Software and
-Services; and Confidential Information of each party includes the terms and
-conditions of this Agreement and all Orders (including pricing), as well as
-business and marketing plans, technology and technical information, product
-plans and designs, and business processes disclosed by such party. However,
-Confidential Information does not include any information that (i) is or
-becomes generally known to the public without breach of any obligation owed to
-the Disclosing Party, (ii) was known to the Receiving Party prior to its
-disclosure by the Disclosing Party without breach of any obligation owed to the
-Disclosing Party, (iii) is received from a third party without breach of any
-obligation owed to the Disclosing Party, or (iv) was independently developed by
-the Receiving Party.
-
-1.3. "Customer Data" means business information or other data loaded by or for
-Customer and/or processed by the Software.
-
-1.4. "Data Protection Legislation" means all applicable data protection and
-privacy legislation in force from time to time in the UK including the General
-Data Protection Regulation ((EU) 2016/679); the Data Protection Act 2018; the
-Privacy and Electronic Communications Directive 2002/58/EC (as updated by
-Directive 2009/136/EC) and the Privacy and Electronic Communications
-Regulations 2003 (SI 2003/2426) as amended.
-
-1.5. "Order Document" or "Order" means an order on the Memgraph form of
-provisioning document that is submitted by or on behalf of Customer, and
-executed by or on behalf of the parties referencing this Agreement and that
-specifies the Software and/or Services ordered by Customer, as well as the
-specific terms and conditions, for that particular transaction.
-
-1.6. "Services" means those services, including Support Services, which may be
-provided to Customer by Memgraph pursuant to the terms of this Agreement and
-are expressly limited to those services directly related to Customer's use of
-the Software, and expressly exclude any other services.
-
-1.7. "Software" means the Memgraph proprietary downloadable graph database
-enterprise software ("Enterprise Software") and the associated technical
-documentation located at https://docs.memgraph.com/ ("Documentation"), as well
-as software updates, upgrades, bug fixes, or modified versions thereof that
-Memgraph licenses or provides to Customer directly or indirectly throughout the
-Subscription Term.
-
-1.8. "Subscription Term" means the fixed term, of not less than one (1) year,
-designated in an Order Document beginning on the Effective Date and ending at
-the end of the period stated therein. If no expiration date is specified in an
-Order Document, the Subscription Term shall be a one (1) year period ("Minimum
-Subscription Term"). A "Subscription" is the binding, non-cancellable contract
-for the use of the Software for the Subscription Term as set forth in an Order
-Document.
-
-1.9. "Support" means the support and maintenance services, including any
-updates, upgrades, patches, enhancements and bug fixes for the Software that
-may be provided to Customer by Memgraph pursuant to the terms of this
-Agreement.
-
-1.10. "Users" means employees and Contractors of Customer that Customer has
-permitted or authorized to access and use of the Software on Customer's behalf
-pursuant to the terms of this Agreement.
-
-## 2. ORDERS, DELIVERY; SUPPORT.
-
-2.1. Delivery. Memgraph will promptly deliver the Software after it accepts an
-Order and Customer issues a purchase order referencing such Order. Unless
-otherwise stated in an Order, Customer is solely responsible for installing
-Software on Customer's own computer equipment. In some instances, Customer's
-purchasing relationship exists solely between Customer and an authorised
-reseller of Memgraph's Software and Services (a "Reseller"), in which case
-Sections 5.1-5.3 (Fees and Payment) will be inapplicable to such Order(s), and
-the Reseller shall be responsible for submitting Orders and the appropriate
-payment method therewith to Memgraph. An Order is not binding until Memgraph
-accepts and countersigns the Order.
-
-2.2 Support. Memgraph will use commercially reasonable efforts to provide
-Support to Customer in accordance with Memgraph's then-current terms and
-conditions set forth at
-https://download.memgraph.com/legal/memgraph-support-terms-and-conditions.pdf
-at the support tier stated in the applicable Order. The Support terms and
-conditions are subject to change at Memgraph's discretion; however, Memgraph
-will not materially reduce the level of Support during a Subscription Term for
-which Fees have been paid.
-
-## 3. LICENCE GRANTS; RESTRICTIONS AND PROPRIETARY RIGHTS.
-
-Customer's licence and access rights and benefits and Memgraph's obligations to
-Customer will vary depending on the product and the type of licence Memgraph is
-granting. If you purchased a licence to Memgraph Software, your licence will be
-subject to certain use and/or capacity restrictions, as identified on the
-applicable Order Document.
-
-3.1. Enterprise Software Licence. In consideration of the Fees paid hereunder
-and subject to the terms of this Agreement and the applicable Order, Memgraph
-grants Customer a world-wide, non-exclusive, non-transferable,
-non-sublicenseable, and limited licence during the applicable Subscription
-Term, to install, and use the Enterprise Software up to the maximum capacity
-("Licensed Capacity"), and subject to the usage rules, specified in the
-applicable Order Document, and to use Documentation solely for Customer's
-internal business purposes in connection with operation of the Enterprise
-Software.
-
-3.2. Enterprise Trial Licence. If the Customer downloads, accesses, or uses the
-Software under a trial licence ("Trial Licence"), then Customer may use one (1)
-copy of the Software in accordance with the terms and conditions of this
-Agreement for a thirty (30) day period, or such longer trial period represented
-by the applicable licence key issued by or expressly authorised by Memgraph
-(the "Trial Period"). Trial Licences are permitted solely for Customer's
-evaluation use to determine whether to purchase a Subscription to the Software.
-Customer may not use a Trial Licence for any other purpose. At the end of the
-Trial Period, the Trial Licence will expire (and this Agreement will terminate
-as to such Licence and continue to apply to any subsequent Subscription or use
-of the Software; if Customer decides not to obtain a Subscription upon
-expiration of the Trial Period, it will promptly cease using and will delete
-the Software from its computer systems. Memgraph has the right to terminate a
-Trial Licence at any time for any reason.
-
-3.3. NO OBLIGATIONS. NOTWITHSTANDING ANYTHING TO THE CONTRARY IN THIS AGREEMENT
-OR IN ANY ORDER DOCUMENT, MEMGRAPH WILL HAVE NO WARRANTY, INDEMNITY, SUPPORT,
-OR SERVICE LEVEL, OBLIGATIONS WITH RESPECT TO ANY ENTERPRISE TRIAL, OR OTHER
-NO-CHARGE SOFTWARE (INCLUDING TOOLS AND UTILITIES) LICENCES.
-
-3.4. General Restrictions. Customer acknowledges that the Software, and its
-structure, organization, and source code, constitute Memgraph's and its
-suppliers' valuable trade secrets, and that usage of the Software is subject to
-the following restrictions:
-
-3.4.1. Restrictions. Customer agrees not to, and not to authorize any third
-party to: (i) allow access or use of the Software by anyone other than its
-Users; (ii) distribute, embed, sell, rent, transfer, lease, lend, sublicense,
-loan, assign, pledge, grant a security interest in, or otherwise make the
-Software accessible or available to any third party; except to the limited
-extent expressly provided in Section 3.4.2, use the Software in any
-service-bureau, timesharing, outsourcing or similar arrangement; or (iii)
-disassemble, decompile, reverse engineer or otherwise attempt to derive the
-structure, sequence or organization of source code or APIs; (iv) remove or
-alter product identification, copyright, trademark or other proprietary
-markings contained in or on the Software; (v) modify, adapt, recast, transform
-or otherwise prepare a derivative work of the Software or portion thereof; (vi)
-conduct any competitive analysis, publish or share with any third party any
-results of any technical evaluation or tests performed on the Software, or
-disclose Software features, errors or bugs to a third party without Memgraph's
-prior written consent; or (vii) engage in any act designed to circumvent any
-restriction set forth in this Agreement, in the Software, or in an Order,
-including but not limited to restrictions related to Licensed Capacity.
-
-3.4.2. Internal Use Licences; Users. The Software is licensed for Customer's
-internal business use and not for distribution or use by third parties. For
-clarity, however, Customer may make available to third parties any
-Customer-hosted services or other Customer applications or services that make
-use of or incorporate the Software, provided and solely to the extent that (i)
-Customer's application or hosted service adds primary and significant
-functionality to the Software, (ii) Customer does not embed or otherwise
-distribute the Software to third parties, (iii) Customer does not provide third
-parties direct access to operate or control the Software itself; and (iv)
-Customer at all times remains in compliance with the terms of the applicable
-licence grants under this Agreement. Subject to the terms and conditions of
-this Agreement, in addition to Customer's employees, Customer may permit its
-independent contractors and consultants ("Contractors") to serve as Users.
-Customer will remain responsible for compliance by each of its Users (including
-but not limited to any Contractor Users) with all of the terms and conditions
-of this Agreement, and any use of the Software by any Contractors must be for
-the sole benefit of Customer.
-
-3.5. Ownership; Reservation of Rights. This is an agreement for use of Memgraph
-Software and not an agreement for sale. Customer acknowledges that it is
-obtaining only a limited right to use the Software on a licensed basis, and
-that irrespective of any use of the words "purchase", "sale" or like terms
-hereunder no ownership rights are being conveyed to Customer. Customer agrees
-that Memgraph or its suppliers retain all right, title and interest (including
-all patent, copyright, trade secret and other intellectual property rights) in
-and to the Memgraph Software. Nothing in this Section shall be deemed as
-granting Memgraph ownership of Customer Data or in any way impacting Customer's
-ownership of Customer Data.
-
-3.6. Third Party Code. The Software may contain or be provided with components
-which are licensed from third parties, including components subject to the
-terms and conditions of "open source" software licences ("Open Source
-Software"). Open Source Software may be identified in the Software,
-Documentation, or in a list of the Open Source Software provided to you upon
-your written request. To the extent required by the licence that accompanies
-the Open Source Software, the terms of such licence will apply in lieu of the
-terms of this Agreement with respect to such Open Source Software, including,
-without limitation, any provisions governing access to source code,
-modification, or reverse engineering.
-
-3.7. IP Ownership. The Parties agree that neither party shall gain, by virtue
-of this Agreement, any rights of ownership or any other interest, right or
-title of copyrights, patents, trade secrets, trademarks, or any other
-intellectual property rights owned by the other Party. Any and all new works
-developed in the course of performing obligations pursuant to this Agreement
-and all new inventions, innovations or ideas developed by a Party in the course
-of performance of its activities under this Agreement, will belong to that
-Party who develops the same. Notwithstanding anything to the contrary in this
-Section, the Parties understand and agree that any and all proprietary
-materials developed by a Party prior to this Agreement and any modifications,
-enhancements, improvements or inventions made to such proprietary materials
-shall be owned by that Party, regardless of which Party prepared or developed
-such modifications, enhancements, improvements or inventions.
-
-## 4. CUSTOMER DATA; OBLIGATIONS OF CUSTOMER AND MEMGRAPH.
-
-4.1. Customer shall retain all of its rights, title, and interest in and to its
-intellectual property rights in Customer Data. Customer grants to Memgraph a
-non-exclusive, worldwide, limited-term licence solely to host, copy, transmit
-and display Customer Data as reasonably necessary for Memgraph to support
-Customer's use of the Software, to ensure the security of and to administrate
-the Software, and to deliver Services in accordance with this Agreement or as
-otherwise outlined in https://memgraph.com/legal/privacy-policy/.
-
-4.2. Protection of Customer Data. Memgraph will maintain appropriate
-administrative, physical, and technical safeguards, consistent with generally
-prevailing industry standards, for protection of the security, confidentiality,
-and integrity of Customer Data, as described in the Documentation. Those
-safeguards will include, but will not be limited to, measures for preventing
-access, use, modification, or disclosure of Customer Data by Memgraph
-personnel, except as permitted by this Agreement.
-
-4.3. Personal data. Both parties will comply with all applicable requirements
-of the Data Protection Legislation. This section 4 is in addition to, and does
-not relieve, remove or replace, a party's obligations under the Data Protection
-Legislation. Notwithstanding the foregoing, the parties acknowledge that, in
-the ordinary course of providing the Services, Memgraph shall not process
-personal data (as defined in the Data Protection Legislation) on behalf of the
-Customer. In the event that the Customer requires Memgraph to process personal
-data on its behalf, it shall notify Memgraph and the parties shall execute such
-terms as necessary under applicable law.
-
-## 5. FEES AND PAYMENT.
-
-5.1. Fees. Customer will pay Memgraph the fees for the Licences and Services as
-set forth in the applicable Order ("Fees"). Customer acknowledges and agrees
-that if Customer's use of the Software exceeds the Licensed Capacity set forth
-on the applicable Orders or otherwise requires the payment of additional fees
-(per the terms of this Agreement), Customer shall be invoiced for such usage
-and Customer agrees to pay the additional fees in accordance with this Section.
-Notwithstanding the terms of Section 5.4 below (Reconciliation), Customer
-acknowledges and agrees that it is obligated to ensure that its Software usage
-does not exceed the Licensed Capacity and to promptly notify Memgraph of any
-such excess usage no more than thirty (30) days from the last day of the
-calendar month during which such excess usage occurred.
-
-5.2. Payment Terms. Except as otherwise specifically set forth on an Order
-Document, all fees are due and payable within thirty days after the date of
-invoice. Renewal Fees for any renewal Subscription Term (if purchased by
-Customer) will be due and payable within thirty (30) days of expiration of the
-then-current term. If Fees are not paid when due, or in the event of other
-breach of this Agreement, Customer shall discontinue use of the Software and
-Memgraph may suspend its performance, including its delivery of technical
-support of the Software or other Services without further notice and without
-penalty. All Orders (including multi-year Subscriptions with annual payment
-schedules) are non-cancellable and all amounts paid are non-refundable, unless
-otherwise expressly set forth herein. Any invoiced amount not received by the
-due date will accrue late interest at the rate of 1.5% of the outstanding
-balance per month, or the maximum rate permitted by applicable law, whichever
-is lower.
-
-5.3. Taxes. Fees are exclusive of taxes. Customer will pay any sales, use,
-value added, duties, fees and other governmental assessments or charges arising
-out of this Agreement and the transactions contemplated herein. Customer will
-make all payments free and clear of, and without reduction for, any withholding
-taxes.
-
-5.4. Reconciliation. At Memgraph's request from time to time, not exceeding
-once per quarter, Customer will provide Memgraph with a report detailing its
-use of the Software, including its non-production and/or production use and
-using the self-monitoring capabilities of the Software or other means, and
-Memgraph may inspect Customer's records related to such report not more
-frequently than annually to ensure payment of Fees. Any on-site review will be
-conducted during regular business hours at Customer's offices. The parties will
-use reasonable good faith efforts to promptly resolve any discrepancies between
-licensed usage and actual usage.
-
-## 6. APPLICABLE LAWS.
-
-6.1. Each Party shall perform this Agreement in accordance with all Applicable
-Laws. Without prejudice to the foregoing, each Party shall:
-
-6.1.1. comply with all Applicable Laws relating to anti-bribery,
-anti-corruption, anti-slavery and human trafficking, including the Bribery Act
-2010 and the Modern Slavery Act 2015 (the "Relevant Requirements");
-
-6.1.2. have and maintain in place throughout the Term its own policies and
-procedures, including adequate procedures under the Bribery Act 2010, to ensure
-compliance with the Relevant Requirements, and will enforce them where
-appropriate;
-
-6.1.3. (if not prohibited by law or regulation from doing so) promptly report
-to the other Party any request or demand for any undue financial or other
-advantage of any kind received by the reporting Party in connection with the
-performance of this Agreement; and
-
-6.1.4. (if not prohibited by law or regulation from doing so) notify the other
-Party (and email shall be sufficient for this purpose) as soon as it becomes
-aware of any actual or suspected slavery or human trafficking in a supply chain
-which has a connection with this Agreement.
-
-## 7. REPRESENTATIONS AND WARRANTIES.
-
-7.1. Mutual Representations and Warranties. Each Party represents and warrants
-to the other that: (i) it is a corporation lawfully incorporated and validly
-existing pursuant to the laws of its place of incorporation; (ii) it has all
-requisite power and authority, corporate or otherwise, to execute, deliver and
-perform its obligations under this Agreement; and (iii) this Agreement
-constitutes its legal, valid and binding obligations and may be enforced
-against it.
-
-7.2. Limited Memgraph Warranty; Remedies. Memgraph warrants that the Software,
-when used as permitted hereunder, will operate in all material respects as
-described in the applicable Documentation, and that Services will be provided
-in a professional manner consistent with industry standards.
-
-7.3. Limitations; Remedy. Memgraph does not warrant that the Software or the
-Services will be error-free, uninterrupted or meet Customer's specific
-requirements or that performance of the Services will be uninterrupted.
-Memgraph will have no warranty obligation under Section 7.2 for Customer's
-misuse or failure to use the Software in accordance with its Documentation or
-this Agreement. Customer's sole and exclusive remedy, and Memgraph's sole and
-exclusive obligation, for breach of warranty will be (i) during the thirty (30)
-day period following initial Delivery of the Software under an Order,
-Memgraph's correction of the program errors that cause the breach of warranty,
-or if Memgraph cannot substantially correct such breach in a commercially
-reasonable manner, a refund of the fees paid for the nonconforming Software
-(ii) during the remainder of the relevant Subscription Term, Memgraph's
-delivery of Support with respect to any such program errors. In the event of a
-refund remedy, Customer's licences and right to use the Software or receive
-Services will end. In the event of any noticed breach of warranty with respect
-to Services, Memgraph's sole and exclusive obligation shall be the
-re-performance of the deficient Services.
-
-7.4. Disclaimer. THIS SECTION 7 IS A LIMITED WARRANTY AND, EXCEPT EXPRESSLY AS
-SET FORTH IN SECTION 7.2, THE SOFTWARE, INCLUDING WITHOUT LIMITATION THE
-THIRD-PARTY CODE, AND ALL SERVICES ARE PROVIDED "AS IS". MEMGRAPH MAKES NO
-OTHER WARRANTIES OR REPRESENTATIONS, EXPRESS, IMPLIED, STATUTORY OR OTHERWISE,
-AND DISCLAIMS ALL IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
-PARTICULAR PURPOSE, TITLE, AND NON-INFRINGEMENT.
-
-## 8. INDEMNIFICATION.
-
-8.1. By Memgraph. Memgraph will defend against any action against Customer
-brought by a third party to the extent the action is based on a claim that the
-Software infringes a third party's patent, copyright or trademark (a "Claim")
-and indemnify Customer from the damages, liabilities, costs and expenses
-(including reasonable attorneys' fees) awarded against Customer or agreed in
-settlement by Customer resulting from such Claim. If your use of the Software
-is (or in Memgraph's opinion likely to be) enjoined, then Memgraph may, at its
-own expense and at its option: (i) substitute substantially similar
-functionality for the Software which renders it non-infringing; (ii) procure
-for Customer the right to continue to use the Software; or if (i) and (ii) are
-not commercially reasonable, terminate this Agreement and refund Customer any
-prepaid, unused (pro-rated) Fees for the duration of the then-current
-Subscription Term. The foregoing obligations of Memgraph will not apply: (i) if
-the Software is modified by any party other than Memgraph, but solely to the
-extent the alleged infringement is caused by such modification; (ii) if the
-Software is used in combination with other products or processes not provided
-or authorized by Memgraph, but solely to the extent the alleged infringement is
-caused by such combination; (iii) use of any version or release of Software
-other than the most current version or release made available to Customer by
-Memgraph, if its use would have avoided the infringement; (iv) any unauthorized
-use of the Software. THIS SECTION 8.1 SETS FORTH MEMGRAPH'S SOLE LIABILITY AND
-CUSTOMER'S SOLE AND EXCLUSIVE REMEDY WITH RESPECT TO ANY CLAIM OF INTELLECTUAL
-PROPERTY INFRINGEMENT.
-
-8.2. By Customer. Customer will indemnify and hold Memgraph and its suppliers
-harmless against any claims, liabilities, costs, and expenses (including
-reasonable attorneys' fees) that Memgraph or its suppliers may incur as a
-result of a third-party claim arising from or related to Customer Data, or
-misuse or unauthorised use of the Software by Customer or any User.
-
-8.3. Conditions. All defence and indemnity obligations under Sections 8.1 and
-8.2 are conditioned on the indemnitee (i) giving the indemnitor written notice
-of the relevant claim within thirty (30) days after the indemnitee receives
-notice of the Claim (or sooner if required by applicable law); (ii) reasonably
-cooperating with the indemnitor, at the indemnitor's expense, in the defence of
-the claim; and (iii) giving the indemnitor sole control of the defence and any
-settlement negotiations. The indemnitee may participate in the defence at its
-expense.
-
-## 9. LIMITATION OF LIABILITY.
-
-9.1. TO THE EXTENT PERMITTED BY LAW, NEITHER MEMGRAPH NOR CUSTOMER SHALL BE
-LIABLE TO THE OTHER OR ANY THIRD PARTY FOR LOST PROFITS (WHETHER DIRECT OR
-INDIRECT) OR LOSS OF USE OR DATA, SUBSTITUTE GOODS OR SERVICES, OR FOR
-INCIDENTAL, CONSEQUENTIAL, PUNITIVE, SPECIAL OR EXEMPLARY DAMAGES (INCLUDING
-DAMAGE TO BUSINESS, REPUTATION OR GOODWILL), OR INDIRECT DAMAGES OF ANY TYPE
-HOWEVER CAUSED, WHETHER BY BREACH OF WARRANTY, BREACH OF CONTRACT, IN TORT
-(INCLUDING NEGLIGENCE) OR ANY OTHER LEGAL OR EQUITABLE CAUSE OF ACTION EVEN IF
-SUCH PARTY HAS BEEN ADVISED OF SUCH DAMAGES IN ADVANCE OR IF SUCH DAMAGES WERE
-FORESEEABLE.
-
-9.2. LIMITATIONS ON DIRECT DAMAGES. EXCEPT FOR ANY EXCLUDED CLAIMS AND ANY
-DAMAGES THAT CANNOT BE LIMITED UNDER APPLICABLE LAW, IN NO EVENT WILL
-MEMGRAPH'S TOTAL AGGREGATE LIABILITY ARISING FROM OR RELATED TO THIS AGREEMENT,
-EXCEED AN AMOUNT EQUAL TO THE TOTAL AMOUNT OF FEES PAID OR PAYABLE BY CUSTOMER
-TO MEMGRAPH UNDER THIS AGREEMENT DURING THE TWELVE MONTHS PRECEDING THE CLAIM.
-THE FOREGOING LIMITATIONS SHALL NOT APPLY TO: (i) PAYMENTS TO A THIRD PARTY
-ARISING FROM A PARTY'S OBLIGATIONS UNDER SECTION 8 (INDEMNIFICATION); (ii)
-BREACH BY A PARTY OF SECTION 10 (CONFIDENTIAL INFORMATION), AND (iii)
-INFRINGEMENT BY A PARTY OF THE OTHER PARTY'S INTELLECTUAL PROPERTY RIGHTS
-(COLLECTIVELY EXCLUSIONS (i)-(iii) ARE REFERRED TO AS THE "EXCLUDED CLAIMS").
-WITH RESPECT TO ANY EXCLUDED CLAIMS, MEMGRAPH'S TOTAL AGGREGATE LIABILITY SHALL
-IN NO EVENT EXCEED £1,000,000.
-
-9.3. Nothing in this Agreement excludes the liability of Memgraph for death or
-personal injury caused by the Supplier's negligence; or for fraud or fraudulent
-misrepresentation.
-
-## 10. CONFIDENTIALITY.
-
-10.1. The Receiving Party will use the same degree of care that it uses to
-protect the confidentiality of its own confidential information of like kind
-(but not less than reasonable care) to (i) not use any confidential information
-of the Disclosing Party for any purpose outside the scope of this agreement and
-(ii) except as otherwise authorized by the Disclosing Party in writing, limit
-access to confidential information of the Disclosing Party to those of its and
-its affiliates' employees and contractors who need that access for purposes
-consistent with this agreement and who have signed confidentiality agreements
-with the receiving party containing protections not materially less protective
-of the confidential information than those herein. Neither party will disclose
-the terms of this agreement or any Orders to any third-party other than its
-affiliates, legal counsel, and accountants without the other party's prior
-written consent, provided that a party that makes any such disclosure to its
-affiliate, legal counsel or accountants will remain responsible for such
-affiliate's, legal counsel's, or accountant's compliance with this
-"confidentiality" section.
-
-10.2. Compelled Disclosure. The Receiving Party may disclose confidential
-information of the Disclosing Party to the extent compelled by law to do so,
-provided the Receiving Party gives the Disclosing Party prior notice of the
-compelled disclosure (to the extent legally permitted) and reasonable
-assistance, at the Disclosing Party's cost, if the Disclosing Party wishes to
-contest the disclosure. If the receiving party is compelled by law to disclose
-the Disclosing Party's confidential information as part of a civil proceeding
-to which the Disclosing Party is a party, and the Disclosing Party is not
-contesting the disclosure, the Disclosing Party will reimburse the Receiving
-Party for its reasonable cost of complying and providing secure access to that
-confidential information.
-
-## 11. TERMINATION.
-
-11.1. Term. The term ("Term") of this Agreement will commence on the Effective
-Date and continue until all Subscriptions, licence terms and Orders expire,
-unless earlier terminated in accordance with this Section 11.
-
-11.2. Termination for Cause. In the event of a material breach of this
-Agreement (excluding any breaches for which an exclusive remedy is expressly
-provided), the non-breaching party may terminate this Agreement if such breach
-is not cured within thirty (30) days after written notice thereof (except that
-for a breach of Section 3.4 ("General Restrictions"), there will be no cure
-period). For clarity, material breach of this Agreement includes, but is not
-limited to, failure to timely pay amounts due hereunder, exceeding the scope of
-any Licence granted hereunder (including the Licensed Capacity), violating the
-Licence restrictions, breach of Section 6.1 and failing to protect the other
-party's Confidential Information.
-
-11.3. Without affecting any other right or remedy available to it, either party
-may terminate this Agreement with immediate effect by giving written notice to
-the other party if the other party:
-
-11.3.1. suspends, or threatens to suspend, payment of its debts or is unable to
-pay its debts as they fall due or admits inability to pay its debts or is
-deemed unable to pay its debts within the meaning of section 123 of the
-Insolvency Act 1986, as if the words "it is proved to the satisfaction of the
-court" did not appear in sections 123(1)(e) or 123(2) of the Insolvency Act
-1986; or
-
-11.3.2. the other party commences negotiations with all or any class of its
-creditors with a view to rescheduling any of its debts, or makes a proposal for
-or enters into any compromise or arrangement with its creditors other than for
-the sole purpose of a scheme for a solvent amalgamation of that other party
-with one or more other companies or the solvent reconstruction of that other
-party; or
-
-11.3.3. a petition is filed, a notice is given, a resolution is passed, or an
-order is made, for or in connection with the winding up of that other party
-other than for the sole purpose of a scheme for a solvent amalgamation of that
-other party with one or more other companies or the solvent reconstruction of
-that other party; or
-
-11.3.4. an application is made to court, or an order is made, for the
-appointment of an administrator, or if a notice of intention to appoint an
-administrator is given or if an administrator is appointed, over the other
-party; or
-
-11.3.5. the holder of a qualifying floating charge over the assets of that
-other party has become entitled to appoint or has appointed an administrative
-receiver; or
-
-11.3.6. a person becomes entitled to appoint a receiver over the assets of the
-other party or a receiver is appointed over the assets of the other party; or
-
-11.3.7. a creditor or encumbrancer of the other party attaches or takes
-possession of, or a distress, execution, sequestration or other such process is
-levied or enforced on or sued against, the whole or any part of the other
-party's assets and such attachment or process is not discharged within 30 days;
-or
-
-11.3.8. any event occurs, or proceeding is taken, with respect to the other
-party in any jurisdiction to which it is subject that has an effect equivalent
-or similar to any of the events mentioned in clause 11.3.1 to clause 11.3.7
-(inclusive); or
-
-11.3.9. the other party suspends or ceases, or threatens to suspend or cease,
-carrying on all or a substantial part of its business.
-
-11.4. Effect of Termination. Upon the termination of this Agreement: (i) all
-licences will terminate; (ii) Customer will immediately discontinue all use of
-the affected Software, erase all full and partial copies of the Software and
-(subject to this Section) all other tangible embodiments of Memgraph
-Confidential Information in Customer's possession or control, and promptly
-certify the same to Memgraph; (iii) Memgraph may immediately cease providing
-the Services; (iv) (subject to this Section), Memgraph will return or delete
-all tangible embodiments of Customer Confidential Information in Memgraph's
-possession or control; and (v) Sections 1 ("Definitions"), 3.4 ("General
-Restrictions"), 3.5 ("Ownership; Reservation of Rights"), 5 ("Fees and
-Payment"), 7.3 ("Limitations"), 7.4 ("Disclaimer"), 8 ("Indemnification"), 9
-("Limitation of Liability"), 10 ("Confidentiality"), 11.4 ("Effect of
-Termination"), and 12 ("Miscellaneous") will survive. If a party's file
-retention policies or a valid legal order provides for backup or archival
-copies of files to be retained, such party will notify the other party of such
-policy or order, protect the other party's Confidential Information as required
-hereunder, and permanently erase, delete, or destroy such Confidential
-Information as soon as permissible under such policy or order.
-
-## 12. MISCELLANEOUS.
-
-12.1. Assignment. This Agreement will bind and inure to the benefit of each
-party's permitted successors and assigns. Memgraph may assign this Agreement to
-any affiliate or in connection with a merger, reorganization, acquisition, or
-other transfer of all or substantially all of Memgraph's assets or voting
-securities. Customer may not assign or transfer this Agreement, in whole or in
-part, without Memgraph's written consent except that Customer may assign its
-rights and obligations under this Agreement, in whole but not in part, without
-Memgraph's written consent in connection with any merger, consolidation, sale
-of all or substantially all of Customer's assets or voting stock, or any other
-similar transaction provided that: (i) the assignee is not a direct competitor
-of Memgraph; (ii) Customer provides prompt written notice of such assignment to
-Memgraph; (iii) the assignee is capable of fully performing Customer's
-obligations under this Agreement; and (iv) the assignee agrees to be bound by
-the terms and conditions of this Agreement. Any attempt to transfer or assign
-this Agreement without such written consent will be null and void.
-
-12.2. Force Majeure. Memgraph shall have no liability to the Customer under
-this Agreement if it is prevented from or delayed in performing its obligations
-under this Agreement, or from carrying on its business, by acts, events,
-omissions or accidents beyond its reasonable control, including strikes,
-lock-outs or other industrial disputes (whether involving the workforce of
-Memgraph or any other party), failure of a utility service or transport or
-telecommunications network, act of God, war, pandemic, riot, civil commotion,
-malicious damage, compliance with any law or governmental order, rule,
-regulation or direction, accident, breakdown of plant or machinery, fire,
-flood, storm or default of suppliers or subcontractors, provided that the
-Customer is notified of such an event and its expected duration.
-
-12.3. Governing Law. This Agreement and any dispute or claim arising out of or
-in connection with it or its subject matter or formation (including
-non-contractual disputes or claims) shall be governed by and construed in
-accordance with the law of England and Wales.
-
-12.4. Jurisdiction. Each party irrevocably agrees that the courts of England
-and Wales shall have exclusive jurisdiction to settle any dispute or claim
-arising out of or in connection with this Agreement or its subject matter or
-formation (including non-contractual disputes or claims).
-
-12.5. Severability; Waiver; Construction. If a court of competent jurisdiction
-adjudges any provision of this Agreement to be invalid or unenforceable, the
-remaining provisions of this Agreement, if capable of substantial performance,
-will continue in full force and effect without being impaired or invalidated in
-any way. The parties agree to replace any invalid provision with a valid
-provision that most closely approximates the intent and economic effect of the
-invalid provision. All waivers must be in writing. A party's consent to, or
-waiver of, enforcement of this Agreement on one occasion will not be deemed a
-waiver of any other provision or such provision on any other occasion. In this
-Agreement, the word "including" means "including but not limited to." No
-presumption will operate in favour of or against any party as a result of its
-role in drafting this Agreement.
-
-12.6. Subcontractors. Memgraph may use the services of subcontractors in
-connection with its performance of this Agreement, provided that Memgraph
-remains solely responsible for (i) compliance of any such subcontractor with
-the terms of this Agreement and (ii) the overall performance of Memgraph as
-required under this Agreement.
-
-12.7. Use of Aggregate Data. Customer agrees that Memgraph may collect, use and
-disclose quantitative data and metadata derived from the use of the Software
-(i) for its own internal, statistical analysis, (ii) to develop and improve the
-Software and (iii) to create and distribute reports and other materials
-regarding use of the Software. For clarity, any such data collected, used, and
-disclosed will be in anonymized aggregate form only and shall not identify
-Customer or its Users, or disclose any Customer Data.
-
-12.8. Independent Contractors. The parties are independent contractors. No
-agency, partnership, franchise, joint venture, or employment relationship is
-intended or created by this Agreement. Neither party has the power or authority
-to create or assume any obligation, or make any representations or warranties,
-on behalf of the other party.
-
-12.9. Publicity. Memgraph may, in conformity with Customer's trademark usage
-guidelines, use Customer's name and logo in Memgraph's sales and marketing
-materials, including in business presentations, Customer lists, and on
-websites. Neither party will issue a press release regarding this Agreement
-without the other party's prior written consent. Neither party will disclose
-the terms of this Agreement to any third party, except as required by law.
-
-12.10. Notice. Any notice, consent, or waiver hereunder must be in writing,
-addressed to the attention of "Legal Department" at the address set forth
-above, and delivered by personal delivery, reputable rapid courier, or
-certified/registered mail, return receipt requested, and will be deemed given
-upon personal delivery, one (1) day after deposit with an overnight domestic
-courier, two (2) days after deposit with an international courier, or five (5)
-days after deposit in the certified or registered mail. A party may specify a
-new address by providing notice to the other party in accordance with this
-Section.
-
-12.11. Compliance with Law. Each party will comply with all applicable laws,
-regulations, and orders of any governmental authority of competent jurisdiction
-in its performance under this Agreement, including but not limited to those
-applicable to data collection and the privacy and security of personal
-information, including trans-border data transfers and data breach notification
-requirements as required of each party by law.
-
-12.12. Supremacy; Modification. This Agreement will prevail over any written
-instrument submitted by Customer; the terms of any purchase order,
-acknowledgement, or similar document submitted by Customer to Memgraph will
-have no effect. If the express terms of an Order Document conflict with this
-Agreement, the terms on the Order Document will prevail, but only with respect
-to that Order Document. This Agreement cannot be varied or supplemented by
-course of dealing or by usage of trade. All modifications or amendments to this
-Agreement must be in writing and signed by both parties, except that subsequent
-renewals and purchases of additional Licensed Capacity can be procured by
-payment against an issued invoice as set forth in Section 5 ("Fees and
-payment") above.
-
-12.13. No Third Party Beneficiaries. This Agreement is not intended and shall
-not be construed to give any third party any interest or rights with respect to
-or in connection with any agreement or provision herein, except as expressly
-provided for in this Agreement.
-
-12.14. Entire Agreement. This Agreement in its original English text, sets
-forth the complete, exclusive, and final agreement of the parties concerning
-the subject matter hereof, supersedes, replaces, and merges all prior and
-contemporaneous agreements, communications, and understandings, both written
-and oral, between them concerning the subject matter hereof. This Agreement may
-be executed in counterparts.

release/README.md

@@ -1,4 +0,0 @@
-# Memgraph Release
-
-Please continue in
-[Notion](https://www.notion.so/memgraph/Release-621733518c82456ebc119d2a025b5dd3).

release/arch-pkg/package_arch

@@ -1,7 +1,7 @@
 #!/bin/bash -e
 
 function print_help () {
-    echo "Usage: $0 MEMGPRAH_PACKAGE.tar.gz"
+    echo "Usage: $0 MEMGRAPH_PACKAGE.tar.gz"
     echo "Optional arguments:"
     echo -e "  -h|--help           Print help."
 }

release/arm64/build_env.dockerfile

@@ -0,0 +1,19 @@
+FROM dokken/centos-stream-9
+
+ARG env_folder
+ARG toolchain_version
+
+COPY ${env_folder} /env_folder
+
+RUN yum update && yum install -y curl git
+
+RUN /${env_folder}/os/centos-9.sh install MEMGRAPH_BUILD_DEPS
+RUN /${env_folder}/os/centos-9.sh install TOOLCHAIN_RUN_DEPS
+
+RUN rm -rf /env_folder
+
+RUN yum clean all
+
+RUN curl https://s3.eu-west-1.amazonaws.com/deps.memgraph.io/${toolchain_version}/${toolchain_version}-binaries-centos-9-arm64.tar.gz -o /tmp/toolchain.tar.gz \
+  && tar xvzf /tmp/toolchain.tar.gz -C /opt \
+  && rm /tmp/toolchain.tar.gz

release/arm64/build_env.sh

@@ -0,0 +1,5 @@
+#!/bin/bash
+
+cp -r ../../environment env_folder
+docker build -f build_env.dockerfile --build-arg env_folder=env_folder --build-arg toolchain_version=toolchain-v4 -t mg_build_env .
+rm -rf env_folder