Set version to 1.5.0

.clang-tidy

@@ -1,6 +1,5 @@
 ---
 Checks: '*,
-         -altera-struct-pack-align,
          -android-*,
          -cert-err58-cpp,
          -cppcoreguidelines-avoid-c-arrays,
@@ -27,7 +26,6 @@ Checks: '*,
          -fuchsia-virtual-inheritance,
          -google-explicit-constructor,
          -google-readability-*,
-         -google-runtime-references,
          -hicpp-avoid-c-arrays,
          -hicpp-avoid-goto,
          -hicpp-braces-around-statements,
@@ -36,14 +34,13 @@ 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,
@@ -53,7 +50,6 @@ 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,

.github/pull_request_template.md

@@ -1,9 +0,0 @@
-[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
-
-[master < Task] PR
-- [ ] Check, and update documentation if necessary
-- [ ] Update [changelog](https://docs.memgraph.com/memgraph/changelog)

.github/workflows/daily_banchmark.yaml

@@ -1,68 +0,0 @@
-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
-
-    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-v3/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: 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 }}"
-
-      - 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 }}"

.github/workflows/diff.yaml

@@ -5,8 +5,7 @@ on:
     paths-ignore:
       - 'docs/**'
       - '**/*.md'
-      - '.clang-format'
-      - 'CODEOWNERS'
+      - '.clang-*'
 
 jobs:
   community_build:
@@ -26,7 +25,7 @@ jobs:
       - name: Build community binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -39,7 +38,7 @@ jobs:
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run unit tests.
           cd build
@@ -53,7 +52,7 @@ jobs:
       - name: Create community DEB package
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           cd build
 
@@ -88,7 +87,7 @@ jobs:
       - name: Build combined ASAN, UBSAN and coverage binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -100,7 +99,7 @@ jobs:
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run unit tests. It is restricted to 2 threads intentionally, because higher concurrency makes the timing related tests unstable.
           cd build
@@ -109,7 +108,7 @@ jobs:
       - name: Compute code coverage
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Compute code coverage.
           cd tools/github
@@ -127,7 +126,7 @@ jobs:
 
       - name: Run clang-tidy
         run: |
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/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
@@ -152,7 +151,7 @@ jobs:
       - name: Build debug binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -165,7 +164,7 @@ jobs:
       - name: Run leftover CTest tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run leftover CTest tests (all except unit and benchmark tests).
           cd build
@@ -197,7 +196,7 @@ jobs:
       - name: Run cppcheck and clang-format
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run cppcheck and clang-format.
           cd tools/github
@@ -226,7 +225,7 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -277,7 +276,7 @@ jobs:
       - name: Create enterprise DEB package
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           cd build
 
@@ -322,7 +321,7 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -361,12 +360,12 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
 
-          # Build only memgraph release binaries.
+          # Build only memgraph release binarie.
           cd build
           cmake -DCMAKE_BUILD_TYPE=release ..
           make -j$THREADS

.github/workflows/full_clang_tidy.yaml

@@ -21,7 +21,7 @@ jobs:
       - name: Build debug binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -34,10 +34,10 @@ jobs:
 
       - name: Run clang-tidy
         run: |
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/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-v3/bin/clang-tidy "$PWD/src/*" |
+          ./tools/github/clang-tidy/run-clang-tidy.py -p build -j $THREADS -clang-tidy-binary=/opt/toolchain-v2/bin/clang-tidy "$PWD/src/*" |
             tee ./build/full_clang_tidy_output.txt
 
       - name: Summarize clang-tidy results

.github/workflows/release_centos8.yaml

@@ -24,7 +24,7 @@ jobs:
       - name: Build community binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -37,7 +37,7 @@ jobs:
       - name: Create community RPM package
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           cd build
 
@@ -59,7 +59,7 @@ jobs:
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run unit tests.
           cd build
@@ -92,7 +92,7 @@ jobs:
       - name: Build coverage binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -105,7 +105,7 @@ jobs:
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run unit tests.
           cd build
@@ -114,7 +114,7 @@ jobs:
       - name: Compute code coverage
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Compute code coverage.
           cd tools/github
@@ -147,7 +147,7 @@ jobs:
       - name: Build debug binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -160,7 +160,7 @@ jobs:
       - name: Run leftover CTest tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run leftover CTest tests (all except unit and benchmark tests).
           cd build
@@ -192,7 +192,7 @@ jobs:
       - name: Run cppcheck and clang-format
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run cppcheck and clang-format.
           cd tools/github
@@ -222,7 +222,7 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -235,7 +235,7 @@ jobs:
       - name: Create enterprise RPM package
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           cd build
 
@@ -257,7 +257,7 @@ jobs:
       - name: Run micro benchmark tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run micro benchmark tests.
           cd build

.github/workflows/release_debian10.yaml

@@ -24,7 +24,7 @@ jobs:
       - name: Build community binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -37,7 +37,7 @@ jobs:
       - name: Create community DEB package
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           cd build
 
@@ -58,7 +58,7 @@ jobs:
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run unit tests.
           cd build
@@ -91,7 +91,7 @@ jobs:
       - name: Build coverage binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -104,7 +104,7 @@ jobs:
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run unit tests.
           cd build
@@ -113,7 +113,7 @@ jobs:
       - name: Compute code coverage
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Compute code coverage.
           cd tools/github
@@ -146,7 +146,7 @@ jobs:
       - name: Build debug binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -159,7 +159,7 @@ jobs:
       - name: Run leftover CTest tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run leftover CTest tests (all except unit and benchmark tests).
           cd build
@@ -191,7 +191,7 @@ jobs:
       - name: Run cppcheck and clang-format
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run cppcheck and clang-format.
           cd tools/github
@@ -221,7 +221,7 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -234,7 +234,7 @@ jobs:
       - name: Create enterprise DEB package
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           cd build
 
@@ -255,7 +255,7 @@ jobs:
       - name: Run micro benchmark tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run micro benchmark tests.
           cd build
@@ -345,7 +345,7 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init

.github/workflows/release_ubuntu2004.yaml

@@ -24,7 +24,7 @@ jobs:
       - name: Build community binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -37,7 +37,7 @@ jobs:
       - name: Create community DEB package
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           cd build
 
@@ -58,7 +58,7 @@ jobs:
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run unit tests.
           cd build
@@ -91,7 +91,7 @@ jobs:
       - name: Build coverage binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -104,7 +104,7 @@ jobs:
       - name: Run unit tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run unit tests.
           cd build
@@ -113,7 +113,7 @@ jobs:
       - name: Compute code coverage
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Compute code coverage.
           cd tools/github
@@ -146,7 +146,7 @@ jobs:
       - name: Build debug binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -159,7 +159,7 @@ jobs:
       - name: Run leftover CTest tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run leftover CTest tests (all except unit and benchmark tests).
           cd build
@@ -191,7 +191,7 @@ jobs:
       - name: Run cppcheck and clang-format
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run cppcheck and clang-format.
           cd tools/github
@@ -221,7 +221,7 @@ jobs:
       - name: Build release binaries
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Initialize dependencies.
           ./init
@@ -234,7 +234,7 @@ jobs:
       - name: Create enterprise DEB package
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           cd build
 
@@ -255,7 +255,7 @@ jobs:
       - name: Run micro benchmark tests
         run: |
           # Activate toolchain.
-          source /opt/toolchain-v3/activate
+          source /opt/toolchain-v2/activate
 
           # Run micro benchmark tests.
           cd build

CHANGELOG.md

@@ -1,5 +1,496 @@
-Change Log for all versions of Memgraph can be found on-line at
-https://docs.memgraph.com/memgraph/changelog
+# Change Log
 
-All the updates to the Change Log can be made in the following repository:
-https://github.com/memgraph/docs
+## v1.5.0
+
+### Major Feature and Improvements
+
+* Added triggers.
+* Replaced mg_client with mgconsole
+
+### 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.
+* Fixed permission issues for `LOAD CSV`, `FREE MEMORY`, `LOCK DATA DIRECTORY`,
+  and replication queries.
+
+## 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.

CMakeLists.txt

@@ -53,7 +53,7 @@ option(MG_ENTERPRISE "Build Memgraph Enterprise Edition" ON)
 # Set the current version here to override the automatic version detection. The
 # version must be specified as `X.Y.Z`. Primarily used when building new patch
 # versions.
-set(MEMGRAPH_OVERRIDE_VERSION "")
+set(MEMGRAPH_OVERRIDE_VERSION "1.5.0")
 
 # Custom suffix that this version should have. The suffix can be any arbitrary
 # string. Primarily used when building a version for a specific customer.

CODEOWNERS

@@ -1 +1,4 @@
-* @gitbuda @antonio2368 @antaljanosbenjamin @kostasrim @jbajic
+/docs/ @gitbuda
+/src/communication/ @antonio2368
+/src/query/ @the-joksim
+/src/storage/ @antonio2368

config/flags.yaml

@@ -85,15 +85,7 @@ modifications:
 
   - name: "memory_limit"
     value: "0"
-    override: true
-
-  - name: "isolation_level"
-    value: "SNAPSHOT_ISOLATION"
-    override: true
-
-  - name: "allow_load_csv"
-    value: "true"
-    override: false
+    override: true 
 
 undocumented:
   - "flag_file"

environment/os/centos-8.sh

@@ -111,7 +111,7 @@ install() {
         # 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://mirror.centos.org/centos/8/PowerTools/x86_64/os/Packages/libbabeltrace-devel-1.5.4-3.el8.x86_64.rpm
+                dnf install -y http://repo.okay.com.mx/centos/8/x86_64/release/libbabeltrace-devel-1.5.4-2.el8.x86_64.rpm
             fi
             continue
         fi

environment/toolchain/v3.sh

@@ -14,20 +14,19 @@ DISTRO="$(operating_system)"
 TOOLCHAIN_VERSION=3
 
 # package versions used
-GCC_VERSION=11.1.0
-BINUTILS_VERSION=2.36.1
+GCC_VERSION=10.2.0
+BINUTILS_VERSION=2.35.1
 case "$DISTRO" in
     centos-7) # because GDB >= 9 does NOT compile with readline6.
         GDB_VERSION=8.3
     ;;
     *)
-        GDB_VERSION=10.2
+        GDB_VERSION=10.1
     ;;
 esac
-CMAKE_VERSION=3.20.5
-CPPCHECK_VERSION=2.4.1
-LLVM_VERSION=12.0.1rc4
-LLVM_VERSION_LONG=12.0.1-rc4
+CMAKE_VERSION=3.18.4
+CPPCHECK_VERSION=2.2
+LLVM_VERSION=11.0.0
 SWIG_VERSION=4.0.2 # used only for LLVM compilation
 
 # Check for the dependencies.
@@ -85,12 +84,11 @@ 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
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION/llvm-$LLVM_VERSION.src.tar.xz
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION/clang-$LLVM_VERSION.src.tar.xz
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION/lld-$LLVM_VERSION.src.tar.xz
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION/clang-tools-extra-$LLVM_VERSION.src.tar.xz
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION/compiler-rt-$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
@@ -103,7 +101,6 @@ fi
 # 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
@@ -111,7 +108,7 @@ 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 --keyserver $KEYSERVER --recv-keys 0x3AB00996FC26A641
 $GPG --verify gcc-$GCC_VERSION.tar.gz.sig gcc-$GCC_VERSION.tar.gz
 # verify binutils
 if [ ! -f binutils-$BINUTILS_VERSION.tar.gz.sig ]; then
@@ -138,21 +135,19 @@ 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
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION/llvm-$LLVM_VERSION.src.tar.xz.sig
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION/clang-$LLVM_VERSION.src.tar.xz.sig
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION/lld-$LLVM_VERSION.src.tar.xz.sig
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION/clang-tools-extra-$LLVM_VERSION.src.tar.xz.sig
+    wget https://github.com/llvm/llvm-project/releases/download/llvmorg-$LLVM_VERSION/compiler-rt-$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 --keyserver $KEYSERVER --recv-keys 0x345AD05D
 $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
@@ -350,9 +345,6 @@ if [ ! -f $PREFIX/bin/cppcheck ]; then
     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++ \
@@ -401,8 +393,6 @@ if [ ! -f $PREFIX/bin/clang ]; then
     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

include/mgp.py

@@ -190,8 +190,7 @@ class Edge:
 
     def __init__(self, edge):
         if not isinstance(edge, _mgp.Edge):
-            raise TypeError(
-                "Expected '_mgp.Edge', got '{}'".format(type(edge)))
+            raise TypeError("Expected '_mgp.Edge', got '{}'".format(type(edge)))
         self._edge = edge
 
     def __deepcopy__(self, memo):
@@ -269,8 +268,7 @@ class Vertex:
 
     def __init__(self, vertex):
         if not isinstance(vertex, _mgp.Vertex):
-            raise TypeError(
-                "Expected '_mgp.Vertex', got '{}'".format(type(vertex)))
+            raise TypeError("Expected '_mgp.Vertex', got '{}'".format(type(vertex)))
         self._vertex = vertex
 
     def __deepcopy__(self, memo):
@@ -406,8 +404,7 @@ class Path:
         passed in edge is invalid.
         '''
         if not isinstance(edge, Edge):
-            raise TypeError(
-                "Expected '_mgp.Edge', got '{}'".format(type(edge)))
+            raise TypeError("Expected '_mgp.Edge', got '{}'".format(type(edge)))
         if not self.is_valid() or not edge.is_valid():
             raise InvalidContextError()
         self._path.expand(edge._edge)
@@ -457,8 +454,7 @@ class Vertices:
 
     def __init__(self, graph):
         if not isinstance(graph, _mgp.Graph):
-            raise TypeError(
-                "Expected '_mgp.Graph', got '{}'".format(type(graph)))
+            raise TypeError("Expected '_mgp.Graph', got '{}'".format(type(graph)))
         self._graph = graph
         self._len = None
 
@@ -503,8 +499,7 @@ class Graph:
 
     def __init__(self, graph):
         if not isinstance(graph, _mgp.Graph):
-            raise TypeError(
-                "Expected '_mgp.Graph', got '{}'".format(type(graph)))
+            raise TypeError("Expected '_mgp.Graph', got '{}'".format(type(graph)))
         self._graph = graph
 
     def __deepcopy__(self, memo):
@@ -562,8 +557,7 @@ class ProcCtx:
 
     def __init__(self, graph):
         if not isinstance(graph, _mgp.Graph):
-            raise TypeError(
-                "Expected '_mgp.Graph', got '{}'".format(type(graph)))
+            raise TypeError("Expected '_mgp.Graph', got '{}'".format(type(graph)))
         self._graph = Graph(graph)
 
     def is_valid(self) -> bool:
@@ -633,11 +627,8 @@ def _typing_to_cypher_type(type_):
         if complex_type == typing.Union:
             # If we have a Union with NoneType inside, it means we are building
             # a nullable type.
-            # isinstance doesn't work here because subscripted generics cannot
-            # be used with class and instance checks. type comparison should be
-            # fine because subclasses are not used.
-            if type(None) in type_args:
-                types = tuple(t for t in type_args if t is not type(None))  # noqa E721
+            if isinstance(None, type_args):
+                types = tuple(t for t in type_args if not isinstance(None, t))
                 if len(types) == 1:
                     type_arg, = types
                 else:
@@ -682,13 +673,11 @@ def _typing_to_cypher_type(type_):
                 type_args_as_str = parse_type_args(type_as_str)
                 none_type_as_str = type(None).__name__
                 if none_type_as_str in type_args_as_str:
-                    types = tuple(
-                        t for t in type_args_as_str if t != none_type_as_str)
+                    types = tuple(t for t in type_args_as_str if t != none_type_as_str)
                     if len(types) == 1:
                         type_arg_as_str, = types
                     else:
-                        type_arg_as_str = 'typing.Union[' + \
-                            ', '.join(types) + ']'
+                        type_arg_as_str = 'typing.Union[' + ', '.join(types) + ']'
                     simple_type = get_simple_type(type_arg_as_str)
                     if simple_type is not None:
                         return _mgp.type_nullable(simple_type)
@@ -722,19 +711,6 @@ class Deprecated:
         self.field_type = type_
 
 
-def raise_if_does_not_meet_requirements(func: typing.Callable[..., Record]):
-    if not callable(func):
-        raise TypeError("Expected a callable object, got an instance of '{}'"
-                        .format(type(func)))
-    if inspect.iscoroutinefunction(func):
-        raise TypeError("Callable must not be 'async def' function")
-    if sys.version_info >= (3, 6):
-        if inspect.isasyncgenfunction(func):
-            raise TypeError("Callable must not be 'async def' function")
-    if inspect.isgeneratorfunction(func):
-        raise NotImplementedError("Generator functions are not supported")
-
-
 def read_proc(func: typing.Callable[..., Record]):
     '''
     Register `func` as a a read-only procedure of the current module.
@@ -775,7 +751,16 @@ def read_proc(func: typing.Callable[..., Record]):
       CALL example.procedure(1) YIELD args, result;
     Naturally, you may pass in different arguments or yield less fields.
     '''
-    raise_if_does_not_meet_requirements(func)
+    if not callable(func):
+        raise TypeError("Expected a callable object, got an instance of '{}'"
+                        .format(type(func)))
+    if inspect.iscoroutinefunction(func):
+        raise TypeError("Callable must not be 'async def' function")
+    if sys.version_info >= (3, 6):
+        if inspect.isasyncgenfunction(func):
+            raise TypeError("Callable must not be 'async def' function")
+    if inspect.isgeneratorfunction(func):
+        raise NotImplementedError("Generator functions are not supported")
     sig = inspect.signature(func)
     params = tuple(sig.parameters.values())
     if params and params[0].annotation is ProcCtx:
@@ -811,133 +796,3 @@ def read_proc(func: typing.Callable[..., Record]):
             else:
                 mgp_proc.add_result(name, _typing_to_cypher_type(type_))
     return func
-
-
-class InvalidMessageError(Exception):
-    '''Signals using a message instance outside of the registered transformation.'''
-    pass
-
-
-class Message:
-    '''Represents a message from a stream.'''
-    __slots__ = ('_message',)
-
-    def __init__(self, message):
-        if not isinstance(message, _mgp.Message):
-            raise TypeError(
-                "Expected '_mgp.Message', got '{}'".format(type(message)))
-        self._message = message
-
-    def __deepcopy__(self, memo):
-        # This is the same as the shallow copy, because we want to share the
-        # underlying C struct. Besides, it doesn't make much sense to actually
-        # copy _mgp.Messages as that always references all the messages.
-        return Message(self._message)
-
-    def is_valid(self) -> bool:
-        '''Return True if `self` is in valid context and may be used.'''
-        return self._message.is_valid()
-
-    def payload(self) -> bytes:
-        if not self.is_valid():
-            raise InvalidMessageError()
-        return self._message.payload()
-
-    def topic_name(self) -> str:
-        if not self.is_valid():
-            raise InvalidMessageError()
-        return self._message.topic_name()
-
-    def key(self) -> bytes:
-        if not self.is_valid():
-            raise InvalidMessageError()
-        return self._message.key()
-
-    def timestamp(self) -> int:
-        if not self.is_valid():
-            raise InvalidMessageError()
-        return self._message.timestamp()
-
-
-class InvalidMessagesError(Exception):
-    '''Signals using a messages instance outside of the registered transformation.'''
-    pass
-
-
-class Messages:
-    '''Represents a list of messages from a stream.'''
-    __slots__ = ('_messages',)
-
-    def __init__(self, messages):
-        if not isinstance(messages, _mgp.Messages):
-            raise TypeError(
-                "Expected '_mgp.Messages', got '{}'".format(type(messages)))
-        self._messages = messages
-
-    def __deepcopy__(self, memo):
-        # This is the same as the shallow copy, because we want to share the
-        # underlying C struct. Besides, it doesn't make much sense to actually
-        # copy _mgp.Messages as that always references all the messages.
-        return Messages(self._messages)
-
-    def is_valid(self) -> bool:
-        '''Return True if `self` is in valid context and may be used.'''
-        return self._messages.is_valid()
-
-    def message_at(self, id: int) -> Message:
-        '''Raise InvalidMessagesError if context is invalid.'''
-        if not self.is_valid():
-            raise InvalidMessagesError()
-        return Message(self._messages.message_at(id))
-
-    def total_messages(self) -> int:
-        '''Raise InvalidContextError if context is invalid.'''
-        if not self.is_valid():
-            raise InvalidMessagesError()
-        return self._messages.total_messages()
-
-
-class TransCtx:
-    '''Context of a transformation being executed.
-
-    Access to a TransCtx is only valid during a single execution of a transformation.
-    You should not globally store a TransCtx instance.
-    '''
-    __slots__ = ('_graph')
-
-    def __init__(self, graph):
-        if not isinstance(graph, _mgp.Graph):
-            raise TypeError(
-                "Expected '_mgp.Graph', got '{}'".format(type(graph)))
-        self._graph = Graph(graph)
-
-    def is_valid(self) -> bool:
-        return self._graph.is_valid()
-
-    @property
-    def graph(self) -> Graph:
-        '''Raise InvalidContextError if context is invalid.'''
-        if not self.is_valid():
-            raise InvalidContextError()
-        return self._graph
-
-
-def transformation(func: typing.Callable[..., Record]):
-    raise_if_does_not_meet_requirements(func)
-    sig = inspect.signature(func)
-    params = tuple(sig.parameters.values())
-    if not params or not params[0].annotation is Messages:
-        if not len(params) == 2 or not params[1].annotation is Messages:
-            raise NotImplementedError(
-                "Valid signatures for transformations are (TransCtx, Messages) or (Messages)")
-    if params[0].annotation is TransCtx:
-        @functools.wraps(func)
-        def wrapper(graph, messages):
-            return func(TransCtx(graph), messages)
-        _mgp._MODULE.add_transformation(wrapper)
-    else:
-        @functools.wraps(func)
-        def wrapper(graph, messages):
-            return func(messages)
-        _mgp._MODULE.add_transformation(wrapper)
-    return func

libs/CMakeLists.txt

@@ -91,9 +91,11 @@ 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
   BUILD_COMMAND $(MAKE) antlr4_static
-  INSTALL_COMMAND $(MAKE) install)
+  # 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)
 
 # Setup google benchmark.
 import_external_library(benchmark STATIC
@@ -222,22 +224,3 @@ import_external_library(spdlog STATIC
   BUILD_COMMAND $(MAKE) spdlog)
 
 include(jemalloc.cmake)
-
-# 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
-             -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)
-
-import_library(librdkafka++ STATIC
-  ${CMAKE_CURRENT_SOURCE_DIR}/librdkafka/lib/librdkafka++.a
-  ${CMAKE_CURRENT_SOURCE_DIR}/librdkafka/include
-)
-target_link_libraries(librdkafka++ INTERFACE librdkafka)

libs/setup.sh

@@ -1,7 +1,6 @@
 #!/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 )"
@@ -94,7 +93,7 @@ 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.9.2-complete.jar"
+  ["antlr4-generator"]="http://$local_cache_host/file/antlr-4.6-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"
@@ -112,7 +111,6 @@ declare -A primary_urls=(
   ["jemalloc"]="http://$local_cache_host/git/jemalloc.git"
   ["nlohmann"]="http://$local_cache_host/file/nlohmann/json/b3e5cb7f20dcc5c806e418df34324eca60d17d4e/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"
 )
 
 # The goal of secondary urls is to have links to the "source of truth" of
@@ -121,7 +119,7 @@ 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.9.2-complete.jar"
+  ["antlr4-generator"]="http://www.antlr.org/download/antlr-4.6-complete.jar"
   ["cppitertools"]="https://github.com/ryanhaining/cppitertools.git"
   ["fmt"]="https://github.com/fmtlib/fmt.git"
   ["rapidcheck"]="https://github.com/emil-e/rapidcheck.git"
@@ -139,22 +137,17 @@ declare -A secondary_urls=(
   ["jemalloc"]="https://github.com/jemalloc/jemalloc.git"
   ["nlohmann"]="https://raw.githubusercontent.com/nlohmann/json/b3e5cb7f20dcc5c806e418df34324eca60d17d4e/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"
 )
 
 # antlr
 file_get_try_double "${primary_urls[antlr4-generator]}" "${secondary_urls[antlr4-generator]}"
 
-antlr4_tag="5e5b6d35b4183fd330102c40947b95c4b5c6abb5" # v4.9.2
+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
-# fix issue https://github.com/antlr/antlr4/issues/3194 - should update Antlr commit once the PR related to the issue gets merged
-sed -i 's/std::is_nothrow_copy_constructible/std::is_copy_constructible/' antlr4/runtime/Cpp/runtime/src/support/Any.h
-# replace the utf8cpp version which is used because the older one uses gtest that doesn't 
-# compile with the newer compilers because of uninitialized variable
-# the newer utf8cpp switched to ftest
-sed -i 's/v3.1.1/v3.2.1/' antlr4/runtime/Cpp/runtime/CMakeLists.txt
 
 # cppitertools v2.0 2019-12-23
 cppitertools_ref="cb3635456bdb531121b82b4d2e3afc7ae1f56d47"
@@ -245,7 +238,3 @@ pushd jemalloc
 # 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"
 popd
-
-# librdkafka
-librdkafka_tag="v1.7.0" # (2021-05-06)
-repo_clone_try_double "${primary_urls[librdkafka]}" "${secondary_urls[librdkafka]}" "librdkafka" "$librdkafka_tag"

query_modules/CMakeLists.txt

@@ -35,3 +35,8 @@ 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

@@ -0,0 +1,18 @@
+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

@@ -0,0 +1,131 @@
+#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,101 +16,61 @@
 //   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(const struct mgp_list *args,
+                      const 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;
-  }
-  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) {
-    const 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_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;
   }
+  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 = NULL;
-  if (mgp_value_make_list(args_copy, &args_value) != MGP_ERROR_NO_ERROR) {
-    goto error_free_list;
-  }
+  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);
   // 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);
-  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);
+  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);
   mgp_value_destroy(hello_world_value);
-  if (insert_result != MGP_ERROR_NO_ERROR) {
-    goto error_something_went_wrong;
-  }
+  if (!result_inserted) goto error_memory;
   // We have successfully finished, so return without error reporting.
   return;
 
 error_free_list:
   mgp_list_destroy(args_copy);
-error_something_went_wrong:
-  mgp_result_set_error_msg(result, "Something went wrong!");
+error_memory:
+  mgp_result_set_error_msg(result, "Not enough memory!");
   return;
 }
 
 // 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 = NULL;
-  if (mgp_module_add_read_procedure(module, "procedure", procedure, &proc) != MGP_ERROR_NO_ERROR) {
+  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;
-  }
-  const struct mgp_type *any_type = NULL;
-  if (mgp_type_any(&any_type) != MGP_ERROR_NO_ERROR) {
-    return 1;
-  }
-  const 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) {
+  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;
   }
   mgp_value_destroy(null_value);
-  const struct mgp_type *string = NULL;
-  if (mgp_type_string(&string) != MGP_ERROR_NO_ERROR) {
+  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;
-  }
-  if (mgp_proc_add_result(proc, "result", string) != MGP_ERROR_NO_ERROR) {
-    return 1;
-  }
-  const 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;
 }
 

query_modules/louvain/CMakeLists.txt

@@ -0,0 +1,33 @@
+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

@@ -0,0 +1,18 @@
+/// @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

@@ -0,0 +1,163 @@
+#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

@@ -0,0 +1,99 @@
+#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

@@ -0,0 +1,125 @@
+/// @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

@@ -0,0 +1,228 @@
+#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

@@ -0,0 +1,28 @@
+#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

@@ -0,0 +1,80 @@
+---
+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

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

query_modules/louvain/test/unit/CMakeLists.txt

@@ -0,0 +1,28 @@
+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

@@ -0,0 +1,349 @@
+#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

@@ -0,0 +1,32 @@
+#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

@@ -0,0 +1,18 @@
+#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

@@ -7,9 +7,6 @@ else()
           DESTINATION share/doc/memgraph RENAME copyright)
 endif()
 
-install(DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR}/third-party-licenses
-        DESTINATION share/doc/memgraph)
-
 # Install systemd service (must use absolute path).
 install(FILES ${CMAKE_CURRENT_SOURCE_DIR}/memgraph.service
         DESTINATION /lib/systemd/system)

release/docker/memgraph_community.dockerfile

@@ -4,8 +4,8 @@ FROM debian:buster
 ARG deb_release
 
 RUN apt-get update && apt-get install -y \
-  openssl libcurl4 libssl1.1 python3 libpython3.7 python3-pip \
-  --no-install-recommends \
+    openssl libcurl4 libssl1.1 python3 libpython3.7 python3-pip \
+    --no-install-recommends \
   && rm -rf /var/lib/apt/lists/* /tmp/* /var/tmp/*
 
 RUN pip3 install networkx==2.4 numpy==1.19.2 scipy==1.5.2
@@ -17,6 +17,11 @@ RUN dpkg -i ${deb_release}
 
 # Memgraph listens for Bolt Protocol on this port by default.
 EXPOSE 7687
+# Snapshots and logging volumes
+VOLUME /var/log/memgraph
+VOLUME /var/lib/memgraph
+# Configuration volume
+VOLUME /etc/memgraph
 
 USER memgraph
 WORKDIR /usr/lib/memgraph

release/docker/memgraph_enterprise.dockerfile

@@ -4,8 +4,8 @@ FROM debian:buster
 ARG deb_release
 
 RUN apt-get update && apt-get install -y \
-  openssl libcurl4 libssl1.1 libseccomp2 python3 libpython3.7 python3-pip \
-  --no-install-recommends \
+    openssl libcurl4 libssl1.1 libseccomp2 python3 libpython3.7 python3-pip \
+    --no-install-recommends \
   && rm -rf /var/lib/apt/lists/* /tmp/* /var/tmp/*
 
 RUN pip3 install networkx==2.4 numpy==1.19.2 scipy==1.5.2
@@ -17,6 +17,11 @@ RUN dpkg -i ${deb_release}
 
 # Memgraph listens for Bolt Protocol on this port by default.
 EXPOSE 7687
+# Snapshots and logging volumes
+VOLUME /var/log/memgraph
+VOLUME /var/lib/memgraph
+# Configuration volume
+VOLUME /etc/memgraph
 
 USER memgraph
 WORKDIR /usr/lib/memgraph

release/package/centos-7/Dockerfile

@@ -1,14 +1,12 @@
 FROM centos:7
 
-ARG TOOLCHAIN_VERSION
-
 RUN yum -y update \
     && yum install -y wget git
 # Do NOT be smart here and clean the cache because the container is used in the
 # stateful context.
 
-RUN wget -q https://s3-eu-west-1.amazonaws.com/deps.memgraph.io/${TOOLCHAIN_VERSION}/${TOOLCHAIN_VERSION}-binaries-centos-7.tar.gz \
-    -O ${TOOLCHAIN_VERSION}-binaries-centos-7.tar.gz \
-    && tar xzvf ${TOOLCHAIN_VERSION}-binaries-centos-7.tar.gz -C /opt
+RUN wget -q https://s3-eu-west-1.amazonaws.com/deps.memgraph.io/toolchain-v2/toolchain-v2-binaries-centos-7.tar.gz \
+         -O toolchain-v2-binaries-centos-7.tar.gz \
+    && tar xzvf toolchain-v2-binaries-centos-7.tar.gz -C /opt
 
 ENTRYPOINT ["sleep", "infinity"]

release/package/centos-8/Dockerfile

@@ -1,14 +1,12 @@
 FROM centos:8
 
-ARG TOOLCHAIN_VERSION
-
 RUN dnf -y update \
     && dnf install -y wget git
 # Do NOT be smart here and clean the cache because the container is used in the
 # stateful context.
 
-RUN wget -q https://s3-eu-west-1.amazonaws.com/deps.memgraph.io/${TOOLCHAIN_VERSION}/${TOOLCHAIN_VERSION}-binaries-centos-8.tar.gz \
-    -O ${TOOLCHAIN_VERSION}-binaries-centos-8.tar.gz \
-    && tar xzvf ${TOOLCHAIN_VERSION}-binaries-centos-8.tar.gz -C /opt
+RUN wget -q https://s3-eu-west-1.amazonaws.com/deps.memgraph.io/toolchain-v2/toolchain-v2-binaries-centos-8.tar.gz \
+         -O toolchain-v2-binaries-centos-8.tar.gz \
+    && tar xzvf toolchain-v2-binaries-centos-8.tar.gz -C /opt
 
 ENTRYPOINT ["sleep", "infinity"]

release/package/debian-10/Dockerfile

@@ -1,7 +1,5 @@
 FROM debian:10
 
-ARG TOOLCHAIN_VERSION
-
 # Stops tzdata interactive configuration.
 ENV DEBIAN_FRONTEND=noninteractive
 
@@ -10,8 +8,8 @@ RUN apt update && apt install -y \
 # Do NOT be smart here and clean the cache because the container is used in the
 # stateful context.
 
-RUN wget -q https://s3-eu-west-1.amazonaws.com/deps.memgraph.io/${TOOLCHAIN_VERSION}/${TOOLCHAIN_VERSION}-binaries-debian-10.tar.gz \
-    -O ${TOOLCHAIN_VERSION}-binaries-debian-10.tar.gz \
-    && tar xzvf ${TOOLCHAIN_VERSION}-binaries-debian-10.tar.gz -C /opt
+RUN wget -q https://s3-eu-west-1.amazonaws.com/deps.memgraph.io/toolchain-v2/toolchain-v2-binaries-debian-10.tar.gz \
+         -O toolchain-v2-binaries-debian-10.tar.gz \
+    && tar xzvf toolchain-v2-binaries-debian-10.tar.gz -C /opt
 
 ENTRYPOINT ["sleep", "infinity"]

release/package/debian-9/Dockerfile

@@ -1,7 +1,5 @@
 FROM debian:9
 
-ARG TOOLCHAIN_VERSION
-
 # Stops tzdata interactive configuration.
 ENV DEBIAN_FRONTEND=noninteractive
 
@@ -10,8 +8,8 @@ RUN apt update && apt install -y \
 # Do NOT be smart here and clean the cache because the container is used in the
 # stateful context.
 
-RUN wget -q https://s3-eu-west-1.amazonaws.com/deps.memgraph.io/${TOOLCHAIN_VERSION}/${TOOLCHAIN_VERSION}-binaries-debian-9.tar.gz \
-    -O ${TOOLCHAIN_VERSION}-binaries-debian-9.tar.gz \
-    && tar xzvf ${TOOLCHAIN_VERSION}-binaries-debian-9.tar.gz -C /opt
+RUN wget -q https://s3-eu-west-1.amazonaws.com/deps.memgraph.io/toolchain-v2/toolchain-v2-binaries-debian-9.tar.gz \
+         -O toolchain-v2-binaries-debian-9.tar.gz \
+    && tar xzvf toolchain-v2-binaries-debian-9.tar.gz -C /opt
 
 ENTRYPOINT ["sleep", "infinity"]

release/package/run.sh

@@ -6,8 +6,7 @@ SCRIPT_DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" && pwd )"
 SUPPORTED_OFFERING=(community enterprise)
 SUPPORTED_OS=(centos-7 centos-8 debian-9 debian-10 ubuntu-18.04 ubuntu-20.04)
 PROJECT_ROOT="$SCRIPT_DIR/../.."
-TOOLCHAIN_VERSION="toolchain-v3"
-ACTIVATE_TOOLCHAIN="source /opt/${TOOLCHAIN_VERSION}/activate"
+ACTIVATE_TOOLCHAIN="source /opt/toolchain-v2/activate"
 HOST_OUTPUT_DIR="$PROJECT_ROOT/build/output"
 
 print_help () {
@@ -95,7 +94,7 @@ make_package () {
 case "$1" in
     init)
         cd "$SCRIPT_DIR"
-        docker-compose build --build-arg TOOLCHAIN_VERSION="${TOOLCHAIN_VERSION}"
+        docker-compose build
         docker-compose up -d
     ;;
 

release/package/ubuntu-18.04/Dockerfile

@@ -1,7 +1,5 @@
 FROM ubuntu:18.04
 
-ARG TOOLCHAIN_VERSION
-
 # Stops tzdata interactive configuration.
 ENV DEBIAN_FRONTEND=noninteractive
 
@@ -10,8 +8,8 @@ RUN apt update && apt install -y \
 # Do NOT be smart here and clean the cache because the container is used in the
 # stateful context.
 
-RUN wget -q https://s3-eu-west-1.amazonaws.com/deps.memgraph.io/${TOOLCHAIN_VERSION}/${TOOLCHAIN_VERSION}-binaries-ubuntu-18.04.tar.gz \
-    -O ${TOOLCHAIN_VERSION}-binaries-ubuntu-18.04.tar.gz \
-    && tar xzvf ${TOOLCHAIN_VERSION}-binaries-ubuntu-18.04.tar.gz -C /opt
+RUN wget -q https://s3-eu-west-1.amazonaws.com/deps.memgraph.io/toolchain-v2/toolchain-v2-binaries-ubuntu-18.04.tar.gz \
+         -O toolchain-v2-binaries-ubuntu-18.04.tar.gz \
+    && tar xzvf toolchain-v2-binaries-ubuntu-18.04.tar.gz -C /opt
 
 ENTRYPOINT ["sleep", "infinity"]

release/package/ubuntu-20.04/Dockerfile

@@ -1,7 +1,5 @@
 FROM ubuntu:20.04
 
-ARG TOOLCHAIN_VERSION
-
 # Stops tzdata interactive configuration.
 ENV DEBIAN_FRONTEND=noninteractive
 
@@ -10,8 +8,8 @@ RUN apt update && apt install -y \
 # Do NOT be smart here and clean the cache because the container is used in the
 # stateful context.
 
-RUN wget -q https://s3-eu-west-1.amazonaws.com/deps.memgraph.io/${TOOLCHAIN_VERSION}/${TOOLCHAIN_VERSION}-binaries-ubuntu-20.04.tar.gz \
-    -O ${TOOLCHAIN_VERSION}-binaries-ubuntu-20.04.tar.gz \
-    && tar xzvf ${TOOLCHAIN_VERSION}-binaries-ubuntu-20.04.tar.gz -C /opt
+RUN wget -q https://s3-eu-west-1.amazonaws.com/deps.memgraph.io/toolchain-v2/toolchain-v2-binaries-ubuntu-20.04.tar.gz \
+         -O toolchain-v2-binaries-ubuntu-20.04.tar.gz \
+    && tar xzvf toolchain-v2-binaries-ubuntu-20.04.tar.gz -C /opt
 
 ENTRYPOINT ["sleep", "infinity"]

release/third-party-licenses/antlr/LICENSE.txt

@@ -1,52 +0,0 @@
-[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.

release/third-party-licenses/bzip2/LICENSE

@@ -1,42 +0,0 @@
-
---------------------------------------------------------------------------
-
-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
-
---------------------------------------------------------------------------

release/third-party-licenses/cppitertools/LICENSE.md

@@ -1,23 +0,0 @@
-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.

release/third-party-licenses/fmt/LICENSE.rst

@@ -1,27 +0,0 @@
-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.

release/third-party-licenses/gflags/COPYING.txt

@@ -1,28 +0,0 @@
-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.

release/third-party-licenses/jemalloc/COPYING

@@ -1,27 +0,0 @@
-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.
---------------------------------------------------------------------------------

release/third-party-licenses/json/LICENSE.MIT

@@ -1,21 +0,0 @@
-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.

release/third-party-licenses/libbcrypt/COPYING

@@ -1,121 +0,0 @@
-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.

release/third-party-licenses/librdkafka/LICENSES.txt

@@ -1,366 +0,0 @@
-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.
- */
-
-

release/third-party-licenses/mgclient/LICENSE

@@ -1,177 +0,0 @@
-
-                                 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

release/third-party-licenses/mgconsole/LICENSE

@@ -1,621 +0,0 @@
-                    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

release/third-party-licenses/replxx/LICENSE.md

@@ -1,63 +0,0 @@
-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.

release/third-party-licenses/rocksdb/LICENSE.Apache

@@ -1,202 +0,0 @@
-
-                                 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.

release/third-party-licenses/rocksdb/LICENSE.leveldb

@@ -1,29 +0,0 @@
-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.

release/third-party-licenses/spdlog/LICENSE

@@ -1,26 +0,0 @@
-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
-

release/third-party-licenses/zlib/README

@@ -1,115 +0,0 @@
-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.

src/CMakeLists.txt

@@ -9,7 +9,6 @@ add_subdirectory(kvstore)
 add_subdirectory(telemetry)
 add_subdirectory(communication)
 add_subdirectory(storage/v2)
-add_subdirectory(integrations)
 add_subdirectory(query)
 add_subdirectory(slk)
 add_subdirectory(rpc)

src/auth/auth.cpp

@@ -144,7 +144,7 @@ std::optional<User> Auth::Authenticate(const std::string &username, const std::s
   }
 }
 
-std::optional<User> Auth::GetUser(const std::string &username_orig) const {
+std::optional<User> Auth::GetUser(const std::string &username_orig) {
   auto username = utils::ToLowerCase(username_orig);
   auto existing_user = storage_.Get(kUserPrefix + username);
   if (!existing_user) return std::nullopt;
@@ -170,9 +170,9 @@ std::optional<User> Auth::GetUser(const std::string &username_orig) const {
 
 void Auth::SaveUser(const User &user) {
   bool success = false;
-  if (const auto *role = user.role(); role != nullptr) {
-    success = storage_.PutMultiple(
-        {{kUserPrefix + user.username(), user.Serialize().dump()}, {kLinkPrefix + user.username(), role->rolename()}});
+  if (user.role()) {
+    success = storage_.PutMultiple({{kUserPrefix + user.username(), user.Serialize().dump()},
+                                    {kLinkPrefix + user.username(), user.role()->rolename()}});
   } else {
     success = storage_.PutAndDeleteMultiple({{kUserPrefix + user.username(), user.Serialize().dump()}},
                                             {kLinkPrefix + user.username()});
@@ -203,7 +203,7 @@ bool Auth::RemoveUser(const std::string &username_orig) {
   return true;
 }
 
-std::vector<auth::User> Auth::AllUsers() const {
+std::vector<auth::User> Auth::AllUsers() {
   std::vector<auth::User> ret;
   for (auto it = storage_.begin(kUserPrefix); it != storage_.end(kUserPrefix); ++it) {
     auto username = it->first.substr(kUserPrefix.size());
@@ -216,9 +216,9 @@ std::vector<auth::User> Auth::AllUsers() const {
   return ret;
 }
 
-bool Auth::HasUsers() const { return storage_.begin(kUserPrefix) != storage_.end(kUserPrefix); }
+bool Auth::HasUsers() { return storage_.begin(kUserPrefix) != storage_.end(kUserPrefix); }
 
-std::optional<Role> Auth::GetRole(const std::string &rolename_orig) const {
+std::optional<Role> Auth::GetRole(const std::string &rolename_orig) {
   auto rolename = utils::ToLowerCase(rolename_orig);
   auto existing_role = storage_.Get(kRolePrefix + rolename);
   if (!existing_role) return std::nullopt;
@@ -265,7 +265,7 @@ bool Auth::RemoveRole(const std::string &rolename_orig) {
   return true;
 }
 
-std::vector<auth::Role> Auth::AllRoles() const {
+std::vector<auth::Role> Auth::AllRoles() {
   std::vector<auth::Role> ret;
   for (auto it = storage_.begin(kRolePrefix); it != storage_.end(kRolePrefix); ++it) {
     auto rolename = it->first.substr(kRolePrefix.size());
@@ -280,7 +280,7 @@ std::vector<auth::Role> Auth::AllRoles() const {
   return ret;
 }
 
-std::vector<auth::User> Auth::AllUsersForRole(const std::string &rolename_orig) const {
+std::vector<auth::User> Auth::AllUsersForRole(const std::string &rolename_orig) {
   auto rolename = utils::ToLowerCase(rolename_orig);
   std::vector<auth::User> ret;
   for (auto it = storage_.begin(kLinkPrefix); it != storage_.end(kLinkPrefix); ++it) {
@@ -299,4 +299,6 @@ std::vector<auth::User> Auth::AllUsersForRole(const std::string &rolename_orig)
   return ret;
 }
 
+std::mutex &Auth::WithLock() { return lock_; }
+
 }  // namespace auth

src/auth/auth.hpp

@@ -14,7 +14,8 @@ namespace auth {
 /**
  * This class serves as the main Authentication/Authorization storage.
  * It provides functions for managing Users, Roles and Permissions.
- * NOTE: The non-const functions in this class aren't thread safe.
+ * NOTE: The functions in this class aren't thread safe. Use the `WithLock` lock
+ * if you want to have safe modifications of the storage.
  * TODO (mferencevic): Disable user/role modification functions when they are
  * being managed by the auth module.
  */
@@ -41,7 +42,7 @@ class Auth final {
    * @return a user when the user exists, nullopt otherwise
    * @throw AuthException if unable to load user data.
    */
-  std::optional<User> GetUser(const std::string &username) const;
+  std::optional<User> GetUser(const std::string &username);
 
   /**
    * Saves a user object to the storage.
@@ -80,14 +81,14 @@ class Auth final {
    * @return a list of users
    * @throw AuthException if unable to load user data.
    */
-  std::vector<User> AllUsers() const;
+  std::vector<User> AllUsers();
 
   /**
    * Returns whether there are users in the storage.
    *
    * @return `true` if the storage contains any users, `false` otherwise
    */
-  bool HasUsers() const;
+  bool HasUsers();
 
   /**
    * Gets a role from the storage.
@@ -97,7 +98,7 @@ class Auth final {
    * @return a role when the role exists, nullopt otherwise
    * @throw AuthException if unable to load role data.
    */
-  std::optional<Role> GetRole(const std::string &rolename) const;
+  std::optional<Role> GetRole(const std::string &rolename);
 
   /**
    * Saves a role object to the storage.
@@ -135,7 +136,7 @@ class Auth final {
    * @return a list of roles
    * @throw AuthException if unable to load role data.
    */
-  std::vector<Role> AllRoles() const;
+  std::vector<Role> AllRoles();
 
   /**
    * Gets all users for a role from the storage.
@@ -145,13 +146,21 @@ class Auth final {
    * @return a list of roles
    * @throw AuthException if unable to load user data.
    */
-  std::vector<User> AllUsersForRole(const std::string &rolename) const;
+  std::vector<User> AllUsersForRole(const std::string &rolename);
+
+  /**
+   * Returns a reference to the lock that should be used for all operations that
+   * require more than one interaction with this class.
+   */
+  std::mutex &WithLock();
 
  private:
-  // Even though the `kvstore::KVStore` class is guaranteed to be thread-safe,
-  // Auth is not thread-safe because modifying users and roles might require
-  // more than one operation on the storage.
   kvstore::KVStore storage_;
   auth::Module module_;
+  // Even though the `kvstore::KVStore` class is guaranteed to be thread-safe we
+  // use a mutex to lock all operations on the `User` and `Role` storage because
+  // some operations on the users and/or roles may require more than one
+  // operation on the storage.
+  std::mutex lock_;
 };
 }  // namespace auth

src/auth/models.cpp

@@ -41,20 +41,16 @@ std::string PermissionToString(Permission permission) {
       return "DUMP";
     case Permission::REPLICATION:
       return "REPLICATION";
-    case Permission::DURABILITY:
-      return "DURABILITY";
+    case Permission::LOCK_PATH:
+      return "LOCK_PATH";
     case Permission::READ_FILE:
       return "READ_FILE";
     case Permission::FREE_MEMORY:
       return "FREE_MEMORY";
     case Permission::TRIGGER:
       return "TRIGGER";
-    case Permission::CONFIG:
-      return "CONFIG";
     case Permission::AUTH:
       return "AUTH";
-    case Permission::STREAM:
-      return "STREAM";
   }
 }
 
@@ -216,7 +212,7 @@ void User::SetRole(const Role &role) { role_.emplace(role); }
 
 void User::ClearRole() { role_ = std::nullopt; }
 
-Permissions User::GetPermissions() const {
+const Permissions User::GetPermissions() const {
   if (role_) {
     return Permissions(permissions_.grants() | role_->permissions().grants(),
                        permissions_.denies() | role_->permissions().denies());
@@ -229,12 +225,7 @@ const std::string &User::username() const { return username_; }
 const Permissions &User::permissions() const { return permissions_; }
 Permissions &User::permissions() { return permissions_; }
 
-const Role *User::role() const {
-  if (role_.has_value()) {
-    return &role_.value();
-  }
-  return nullptr;
-}
+std::optional<Role> User::role() const { return role_; }
 
 nlohmann::json User::Serialize() const {
   nlohmann::json data = nlohmann::json::object();

src/auth/models.hpp

@@ -22,23 +22,20 @@ enum class Permission : uint64_t {
   CONSTRAINT  = 1U << 8U,
   DUMP        = 1U << 9U,
   REPLICATION = 1U << 10U,
-  DURABILITY  = 1U << 11U,
+  LOCK_PATH   = 1U << 11U,
   READ_FILE   = 1U << 12U,
   FREE_MEMORY = 1U << 13U,
   TRIGGER     = 1U << 14U,
-  CONFIG      = 1U << 15U,
-  AUTH        = 1U << 16U,
-  STREAM      = 1U << 17U
+  AUTH        = 1U << 16U
 };
 // clang-format on
 
 // Constant list of all available permissions.
-const std::vector<Permission> kPermissionsAll = {Permission::MATCH,      Permission::CREATE,    Permission::MERGE,
-                                                 Permission::DELETE,     Permission::SET,       Permission::REMOVE,
-                                                 Permission::INDEX,      Permission::STATS,     Permission::CONSTRAINT,
-                                                 Permission::DUMP,       Permission::AUTH,      Permission::REPLICATION,
-                                                 Permission::DURABILITY, Permission::READ_FILE, Permission::FREE_MEMORY,
-                                                 Permission::TRIGGER,    Permission::CONFIG,    Permission::STREAM};
+const std::vector<Permission> kPermissionsAll = {
+    Permission::MATCH,      Permission::CREATE,    Permission::MERGE,       Permission::DELETE,
+    Permission::SET,        Permission::REMOVE,    Permission::INDEX,       Permission::STATS,
+    Permission::CONSTRAINT, Permission::DUMP,      Permission::AUTH,        Permission::REPLICATION,
+    Permission::LOCK_PATH,  Permission::READ_FILE, Permission::FREE_MEMORY, Permission::TRIGGER};
 
 // Function that converts a permission to its string representation.
 std::string PermissionToString(Permission permission);
@@ -127,14 +124,14 @@ class User final {
 
   void ClearRole();
 
-  Permissions GetPermissions() const;
+  const Permissions GetPermissions() const;
 
   const std::string &username() const;
 
   const Permissions &permissions() const;
   Permissions &permissions();
 
-  const Role *role() const;
+  std::optional<Role> role() const;
 
   nlohmann::json Serialize() const;
 

src/glue/auth.cpp

@@ -26,20 +26,16 @@ auth::Permission PrivilegeToPermission(query::AuthQuery::Privilege privilege) {
       return auth::Permission::DUMP;
     case query::AuthQuery::Privilege::REPLICATION:
       return auth::Permission::REPLICATION;
-    case query::AuthQuery::Privilege::DURABILITY:
-      return auth::Permission::DURABILITY;
+    case query::AuthQuery::Privilege::LOCK_PATH:
+      return auth::Permission::LOCK_PATH;
     case query::AuthQuery::Privilege::READ_FILE:
       return auth::Permission::READ_FILE;
     case query::AuthQuery::Privilege::FREE_MEMORY:
       return auth::Permission::FREE_MEMORY;
     case query::AuthQuery::Privilege::TRIGGER:
       return auth::Permission::TRIGGER;
-    case query::AuthQuery::Privilege::CONFIG:
-      return auth::Permission::CONFIG;
     case query::AuthQuery::Privilege::AUTH:
       return auth::Permission::AUTH;
-    case query::AuthQuery::Privilege::STREAM:
-      return auth::Permission::STREAM;
   }
 }
 }  // namespace glue

src/integrations/CMakeLists.txt

@@ -1 +0,0 @@
-add_subdirectory(kafka)

src/integrations/kafka/CMakeLists.txt

@@ -1,6 +0,0 @@
-set(integrations_kafka_src_files
-    consumer.cpp
-)
-
-add_library(mg-integrations-kafka STATIC ${integrations_kafka_src_files})
-target_link_libraries(mg-integrations-kafka mg-utils librdkafka++ librdkafka Threads::Threads)

src/integrations/kafka/consumer.cpp

@@ -1,350 +0,0 @@
-#include "integrations/kafka/consumer.hpp"
-
-#include <algorithm>
-#include <chrono>
-#include <iterator>
-#include <memory>
-#include <unordered_set>
-
-#include <librdkafka/rdkafkacpp.h>
-#include <spdlog/spdlog.h>
-#include "integrations/kafka/exceptions.hpp"
-#include "utils/exceptions.hpp"
-#include "utils/logging.hpp"
-#include "utils/on_scope_exit.hpp"
-#include "utils/thread.hpp"
-
-namespace integrations::kafka {
-
-constexpr std::chrono::milliseconds kDefaultBatchInterval{100};
-constexpr int64_t kDefaultBatchSize = 1000;
-constexpr int64_t kDefaultCheckBatchLimit = 1;
-constexpr std::chrono::milliseconds kDefaultCheckTimeout{30000};
-constexpr std::chrono::milliseconds kMinimumInterval{1};
-constexpr int64_t kMinimumSize{1};
-
-namespace {
-utils::BasicResult<std::string, std::vector<Message>> GetBatch(RdKafka::KafkaConsumer &consumer,
-                                                               const ConsumerInfo &info,
-                                                               std::atomic<bool> &is_running) {
-  std::vector<Message> batch{};
-
-  int64_t batch_size = info.batch_size.value_or(kDefaultBatchSize);
-  batch.reserve(batch_size);
-
-  auto remaining_timeout_in_ms = info.batch_interval.value_or(kDefaultBatchInterval).count();
-  auto start = std::chrono::steady_clock::now();
-
-  bool run_batch = true;
-  for (int64_t i = 0; remaining_timeout_in_ms > 0 && i < batch_size && is_running.load(); ++i) {
-    std::unique_ptr<RdKafka::Message> msg(consumer.consume(remaining_timeout_in_ms));
-    switch (msg->err()) {
-      case RdKafka::ERR__TIMED_OUT:
-        run_batch = false;
-        break;
-
-      case RdKafka::ERR_NO_ERROR:
-        batch.emplace_back(std::move(msg));
-        break;
-      case RdKafka::ERR__MAX_POLL_EXCEEDED:
-        // max.poll.interval.ms reached between two calls of poll, just continue
-        spdlog::info("Consumer {} reached the max.poll.interval.ms.", info.consumer_name);
-        break;
-      default:
-        auto error = msg->errstr();
-        spdlog::warn("Unexpected error while consuming message in consumer {}, error: {} (code {})!",
-                     info.consumer_name, msg->errstr(), msg->err());
-        return {std::move(error)};
-    }
-
-    if (!run_batch) {
-      break;
-    }
-
-    auto now = std::chrono::steady_clock::now();
-    auto took = std::chrono::duration_cast<std::chrono::milliseconds>(now - start);
-    remaining_timeout_in_ms = remaining_timeout_in_ms - took.count();
-    start = now;
-  }
-
-  return {std::move(batch)};
-}
-}  // namespace
-
-Message::Message(std::unique_ptr<RdKafka::Message> &&message) : message_{std::move(message)} {
-  // Because of these asserts, the message can be safely accessed in the member function functions, because it cannot
-  // be null and always points to a valid message (not to a wrapped error)
-  MG_ASSERT(message_.get() != nullptr, "Kafka message cannot be null!");
-  MG_ASSERT(message_->err() == 0 && message_->c_ptr() != nullptr, "Invalid kafka message!");
-};
-
-std::span<const char> Message::Key() const {
-  const auto *c_message = message_->c_ptr();
-  return {static_cast<const char *>(c_message->key), c_message->key_len};
-}
-
-std::string_view Message::TopicName() const {
-  const auto *c_message = message_->c_ptr();
-  return c_message->rkt == nullptr ? std::string_view{} : rd_kafka_topic_name(c_message->rkt);
-}
-
-std::span<const char> Message::Payload() const {
-  const auto *c_message = message_->c_ptr();
-  return {static_cast<const char *>(c_message->payload), c_message->len};
-}
-
-int64_t Message::Timestamp() const {
-  const auto *c_message = message_->c_ptr();
-  return rd_kafka_message_timestamp(c_message, nullptr);
-}
-
-Consumer::Consumer(const std::string &bootstrap_servers, ConsumerInfo info, ConsumerFunction consumer_function)
-    : info_{std::move(info)}, consumer_function_(std::move(consumer_function)) {
-  MG_ASSERT(consumer_function_, "Empty consumer function for Kafka consumer");
-  // NOLINTNEXTLINE (modernize-use-nullptr)
-  if (info.batch_interval.value_or(kMinimumInterval) < kMinimumInterval) {
-    throw ConsumerFailedToInitializeException(info_.consumer_name, "Batch interval has to be positive!");
-  }
-  if (info.batch_size.value_or(kMinimumSize) < kMinimumSize) {
-    throw ConsumerFailedToInitializeException(info_.consumer_name, "Batch size has to be positive!");
-  }
-
-  std::unique_ptr<RdKafka::Conf> conf(RdKafka::Conf::create(RdKafka::Conf::CONF_GLOBAL));
-  if (conf == nullptr) {
-    throw ConsumerFailedToInitializeException(info_.consumer_name, "Couldn't create Kafka configuration!");
-  }
-
-  std::string error;
-
-  if (conf->set("event_cb", this, error) != RdKafka::Conf::CONF_OK) {
-    throw ConsumerFailedToInitializeException(info_.consumer_name, error);
-  }
-
-  if (conf->set("enable.partition.eof", "false", error) != RdKafka::Conf::CONF_OK) {
-    throw ConsumerFailedToInitializeException(info_.consumer_name, error);
-  }
-
-  if (conf->set("enable.auto.commit", "false", error) != RdKafka::Conf::CONF_OK) {
-    throw ConsumerFailedToInitializeException(info_.consumer_name, error);
-  }
-
-  if (conf->set("bootstrap.servers", bootstrap_servers, error) != RdKafka::Conf::CONF_OK) {
-    throw ConsumerFailedToInitializeException(info_.consumer_name, error);
-  }
-
-  if (conf->set("group.id", info_.consumer_group, error) != RdKafka::Conf::CONF_OK) {
-    throw ConsumerFailedToInitializeException(info_.consumer_name, error);
-  }
-
-  consumer_ = std::unique_ptr<RdKafka::KafkaConsumer, std::function<void(RdKafka::KafkaConsumer *)>>(
-      RdKafka::KafkaConsumer::create(conf.get(), error), [this](auto *consumer) {
-        this->StopConsuming();
-        consumer->close();
-        delete consumer;
-      });
-
-  if (consumer_ == nullptr) {
-    throw ConsumerFailedToInitializeException(info_.consumer_name, error);
-  }
-
-  RdKafka::Metadata *raw_metadata = nullptr;
-  if (const auto err = consumer_->metadata(true, nullptr, &raw_metadata, 1000); err != RdKafka::ERR_NO_ERROR) {
-    delete raw_metadata;
-    throw ConsumerFailedToInitializeException(info_.consumer_name, RdKafka::err2str(err));
-  }
-  std::unique_ptr<RdKafka::Metadata> metadata(raw_metadata);
-
-  std::unordered_set<std::string> topic_names_from_metadata{};
-  std::transform(metadata->topics()->begin(), metadata->topics()->end(),
-                 std::inserter(topic_names_from_metadata, topic_names_from_metadata.begin()),
-                 [](const auto topic_metadata) { return topic_metadata->topic(); });
-
-  for (const auto &topic_name : info_.topics) {
-    if (!topic_names_from_metadata.contains(topic_name)) {
-      throw TopicNotFoundException(info_.consumer_name, topic_name);
-    }
-  }
-
-  if (const auto err = consumer_->subscribe(info_.topics); err != RdKafka::ERR_NO_ERROR) {
-    throw ConsumerFailedToInitializeException(info_.consumer_name, RdKafka::err2str(err));
-  }
-}
-
-Consumer::~Consumer() {
-  StopIfRunning();
-  consumer_->close();
-  RdKafka::TopicPartition::destroy(last_assignment_);
-}
-
-void Consumer::Start() {
-  if (is_running_) {
-    throw ConsumerRunningException(info_.consumer_name);
-  }
-
-  StartConsuming();
-}
-
-void Consumer::StartIfStopped() {
-  if (!is_running_) {
-    StartConsuming();
-  }
-}
-
-void Consumer::Stop() {
-  if (!is_running_) {
-    throw ConsumerStoppedException(info_.consumer_name);
-  }
-
-  StopConsuming();
-}
-
-void Consumer::StopIfRunning() {
-  if (is_running_) {
-    StopConsuming();
-  }
-  if (thread_.joinable()) {
-    thread_.join();
-  }
-}
-
-void Consumer::Check(std::optional<std::chrono::milliseconds> timeout, std::optional<int64_t> limit_batches,
-                     const ConsumerFunction &check_consumer_function) const {
-  // NOLINTNEXTLINE (modernize-use-nullptr)
-  if (timeout.value_or(kMinimumInterval) < kMinimumInterval) {
-    throw ConsumerCheckFailedException(info_.consumer_name, "Timeout has to be positive!");
-  }
-  if (limit_batches.value_or(kMinimumSize) < kMinimumSize) {
-    throw ConsumerCheckFailedException(info_.consumer_name, "Batch limit has to be positive!");
-  }
-  // The implementation of this function is questionable: it is const qualified, though it changes the inner state of
-  // KafkaConsumer. Though it changes the inner state, it saves the current assignment for future Check/Start calls to
-  // restore the current state, so the changes made by this function shouldn't be visible for the users of the class. It
-  // also passes a non const reference of KafkaConsumer to GetBatch function. That means the object is bitwise const
-  // (KafkaConsumer is stored in unique_ptr) and internally mostly synchronized. Mostly, because as Start/Stop requires
-  // exclusive access to consumer, so we don't have to deal with simultaneous calls to those functions. The only concern
-  // in this function is to prevent executing this function on multiple threads simultaneously.
-  if (is_running_.exchange(true)) {
-    throw ConsumerRunningException(info_.consumer_name);
-  }
-  utils::OnScopeExit restore_is_running([this] { is_running_.store(false); });
-
-  if (last_assignment_.empty()) {
-    if (const auto err = consumer_->assignment(last_assignment_); err != RdKafka::ERR_NO_ERROR) {
-      spdlog::warn("Saving the commited offset of consumer {} failed: {}", info_.consumer_name, RdKafka::err2str(err));
-      throw ConsumerCheckFailedException(info_.consumer_name,
-                                         fmt::format("Couldn't save commited offsets: '{}'", RdKafka::err2str(err)));
-    }
-  } else {
-    if (const auto err = consumer_->assign(last_assignment_); err != RdKafka::ERR_NO_ERROR) {
-      throw ConsumerCheckFailedException(info_.consumer_name,
-                                         fmt::format("Couldn't restore commited offsets: '{}'", RdKafka::err2str(err)));
-    }
-  }
-
-  const auto num_of_batches = limit_batches.value_or(kDefaultCheckBatchLimit);
-  const auto timeout_to_use = timeout.value_or(kDefaultCheckTimeout);
-  const auto start = std::chrono::steady_clock::now();
-  for (int64_t i = 0; i < num_of_batches;) {
-    const auto now = std::chrono::steady_clock::now();
-    // NOLINTNEXTLINE (modernize-use-nullptr)
-    if (now - start >= timeout_to_use) {
-      throw ConsumerCheckFailedException(info_.consumer_name, "timeout reached");
-    }
-    auto maybe_batch = GetBatch(*consumer_, info_, is_running_);
-
-    if (maybe_batch.HasError()) {
-      throw ConsumerCheckFailedException(info_.consumer_name, maybe_batch.GetError());
-    }
-
-    const auto &batch = maybe_batch.GetValue();
-
-    if (batch.empty()) {
-      continue;
-    }
-    ++i;
-
-    try {
-      check_consumer_function(batch);
-    } catch (const std::exception &e) {
-      spdlog::warn("Kafka consumer {} check failed with error {}", info_.consumer_name, e.what());
-      throw ConsumerCheckFailedException(info_.consumer_name, e.what());
-    }
-  }
-}
-
-bool Consumer::IsRunning() const { return is_running_; }
-
-const ConsumerInfo &Consumer::Info() const { return info_; }
-
-void Consumer::event_cb(RdKafka::Event &event) {
-  switch (event.type()) {
-    case RdKafka::Event::Type::EVENT_ERROR:
-      spdlog::warn("Kafka consumer {} received an error: {}", info_.consumer_name, RdKafka::err2str(event.err()));
-      break;
-    case RdKafka::Event::Type::EVENT_STATS:
-    case RdKafka::Event::Type::EVENT_LOG:
-    case RdKafka::Event::Type::EVENT_THROTTLE:
-      break;
-  }
-}
-
-void Consumer::StartConsuming() {
-  MG_ASSERT(!is_running_, "Cannot start already running consumer!");
-
-  if (thread_.joinable()) {
-    // This can happen if the thread just finished its last batch, already set is_running_ to false and currently
-    // shutting down.
-    thread_.join();
-  };
-
-  is_running_.store(true);
-
-  if (!last_assignment_.empty()) {
-    if (const auto err = consumer_->assign(last_assignment_); err != RdKafka::ERR_NO_ERROR) {
-      throw ConsumerStartFailedException(info_.consumer_name,
-                                         fmt::format("Couldn't restore commited offsets: '{}'", RdKafka::err2str(err)));
-    }
-    RdKafka::TopicPartition::destroy(last_assignment_);
-  }
-
-  thread_ = std::thread([this] {
-    constexpr auto kMaxThreadNameSize = utils::GetMaxThreadNameSize();
-    const auto full_thread_name = "Cons#" + info_.consumer_name;
-
-    utils::ThreadSetName(full_thread_name.substr(0, kMaxThreadNameSize));
-
-    while (is_running_) {
-      auto maybe_batch = GetBatch(*consumer_, info_, is_running_);
-      if (maybe_batch.HasError()) {
-        spdlog::warn("Error happened in consumer {} while fetching messages: {}!", info_.consumer_name,
-                     maybe_batch.GetError());
-        break;
-      }
-      const auto &batch = maybe_batch.GetValue();
-
-      if (batch.empty()) continue;
-
-      spdlog::info("Kafka consumer {} is processing a batch", info_.consumer_name);
-
-      try {
-        consumer_function_(batch);
-        if (const auto err = consumer_->commitSync(); err != RdKafka::ERR_NO_ERROR) {
-          spdlog::warn("Committing offset of consumer {} failed: {}", info_.consumer_name, RdKafka::err2str(err));
-          break;
-        }
-      } catch (const std::exception &e) {
-        spdlog::warn("Error happened in consumer {} while processing a batch: {}!", info_.consumer_name, e.what());
-        break;
-      }
-      spdlog::info("Kafka consumer {} finished processing", info_.consumer_name);
-    }
-    is_running_.store(false);
-  });
-}
-
-void Consumer::StopConsuming() {
-  is_running_.store(false);
-  if (thread_.joinable()) thread_.join();
-}
-
-}  // namespace integrations::kafka

src/integrations/kafka/consumer.hpp

@@ -1,146 +0,0 @@
-#pragma once
-
-#include <atomic>
-#include <chrono>
-#include <functional>
-#include <memory>
-#include <optional>
-#include <span>
-#include <thread>
-#include <utility>
-#include <vector>
-
-#include <librdkafka/rdkafka.h>
-#include <librdkafka/rdkafkacpp.h>
-#include "utils/result.hpp"
-
-namespace integrations::kafka {
-
-/// Wraps the message returned from librdkafka.
-///
-/// The interface of RdKafka::Message is far from ideal, so this class provides a modern C++ wrapper to it. Some of the
-/// problems of RdKafka::Message:
-/// - First and foremost, RdKafka::Message might wrap a received message, or an error if something goes wrong during
-///   polling. That means some of the getters cannot be called or return rubbish data when it contains an error. Message
-///   ensures that the wrapped RdKafka::Message contains a valid message, and not some error.
-/// - The topic_name is returned as a string, but the key is returned as a pointer to a string, because it is cached.
-///   To unify them Message returns them as string_view without copying them, using the underlying C API.
-/// - The payload is returned as void*, so it is better to cast it to char* as soon as possible. Returning the payload
-///   as std::span also provides a more idiomatic way to communicate a byte array than returning a raw pointer and a
-///   size.
-class Message final {
- public:
-  explicit Message(std::unique_ptr<RdKafka::Message> &&message);
-  Message(Message &&) = default;
-  Message &operator=(Message &&) = default;
-  ~Message() = default;
-
-  Message(const Message &) = delete;
-  Message &operator=(const Message &) = delete;
-
-  /// Returns the key of the message, might be empty.
-  std::span<const char> Key() const;
-
-  /// Returns the name of the topic, might be empty.
-  std::string_view TopicName() const;
-
-  /// Returns the payload.
-  std::span<const char> Payload() const;
-
-  /// Returns the timestamp of the message.
-  ///
-  /// The timestamp is the number of milliseconds since the epoch (UTC), or 0 if not available.
-  ///
-  /// The timestamp might have different semantics based on the configuration of the Kafka cluster. It can be the time
-  /// of message creation or appendage to the log. Currently the Kafka integration doesn't support connections to
-  /// multiple clusters, the semantics can be figured out from the configuration of the cluster, so the transformations
-  /// can be implemented knowing that.
-  int64_t Timestamp() const;
-
- private:
-  std::unique_ptr<RdKafka::Message> message_;
-};
-
-using ConsumerFunction = std::function<void(const std::vector<Message> &)>;
-
-/// ConsumerInfo holds all the information necessary to create a Consumer.
-struct ConsumerInfo {
-  std::string consumer_name;
-  std::vector<std::string> topics;
-  std::string consumer_group;
-  std::optional<std::chrono::milliseconds> batch_interval;
-  std::optional<int64_t> batch_size;
-};
-
-/// Memgraphs Kafka consumer wrapper.
-///
-/// Consumer wraps around librdkafka Consumer so it's easier to use it.
-/// It extends RdKafka::EventCb in order to listen to error events.
-class Consumer final : public RdKafka::EventCb {
- public:
-  /// Creates a new consumer with the given parameters.
-  ///
-  /// @throws ConsumerFailedToInitializeException if the consumer can't connect
-  ///         to the Kafka endpoint.
-  Consumer(const std::string &bootstrap_servers, ConsumerInfo info, ConsumerFunction consumer_function);
-  ~Consumer() override;
-
-  Consumer(const Consumer &other) = delete;
-  Consumer(Consumer &&other) noexcept = delete;
-  Consumer &operator=(const Consumer &other) = delete;
-  Consumer &operator=(Consumer &&other) = delete;
-
-  /// Starts consuming messages.
-  ///
-  /// This method will start a new thread which will poll all the topics for messages.
-  ///
-  /// @throws ConsumerRunningException if the consumer is already running
-  void Start();
-
-  /// Starts consuming messages if it is not started already.
-  ///
-  void StartIfStopped();
-
-  /// Stops consuming messages.
-  ///
-  /// @throws ConsumerStoppedException if the consumer is already stopped
-  void Stop();
-
-  /// Stops consuming messages if it is not stopped alread.
-  void StopIfRunning();
-
-  /// Performs a synchronous dry-run.
-  ///
-  /// This function doesn't have any persistent effect on the consumer. The messages are fetched synchronously, so the
-  /// function returns only when the test run is done, unlike Start, which returns after starting a thread.
-  ///
-  /// @param limit_batches the consumer will only test the given number of batches. If not present, a default value is
-  ///                      used.
-  /// @param check_consumer_function a function to feed the received messages in, only used during this dry-run.
-  ///
-  /// @throws ConsumerRunningException if the consumer is alredy running.
-  /// @throws ConsumerCheckFailedException if check isn't successful.
-  void Check(std::optional<std::chrono::milliseconds> timeout, std::optional<int64_t> limit_batches,
-             const ConsumerFunction &check_consumer_function) const;
-
-  /// Returns true if the consumer is actively consuming messages.
-  bool IsRunning() const;
-
-  const ConsumerInfo &Info() const;
-
- private:
-  void event_cb(RdKafka::Event &event) override;
-
-  void StartConsuming();
-
-  void StopConsuming();
-
-  ConsumerInfo info_;
-  ConsumerFunction consumer_function_;
-  mutable std::atomic<bool> is_running_{false};
-  mutable std::vector<RdKafka::TopicPartition *> last_assignment_;  // Protected by is_running_
-  std::optional<int64_t> limit_batches_{std::nullopt};
-  std::unique_ptr<RdKafka::KafkaConsumer, std::function<void(RdKafka::KafkaConsumer *)>> consumer_;
-  std::thread thread_;
-};
-}  // namespace integrations::kafka

src/integrations/kafka/exceptions.hpp

@@ -1,47 +0,0 @@
-#pragma once
-
-#include <string>
-
-#include "utils/exceptions.hpp"
-
-namespace integrations::kafka {
-class KafkaStreamException : public utils::BasicException {
-  using utils::BasicException::BasicException;
-};
-
-class ConsumerFailedToInitializeException : public KafkaStreamException {
- public:
-  ConsumerFailedToInitializeException(const std::string &consumer_name, const std::string &error)
-      : KafkaStreamException("Failed to initialize Kafka consumer {} : {}", consumer_name, error) {}
-};
-
-class ConsumerRunningException : public KafkaStreamException {
- public:
-  explicit ConsumerRunningException(const std::string &consumer_name)
-      : KafkaStreamException("Kafka consumer {} is already running", consumer_name) {}
-};
-
-class ConsumerStoppedException : public KafkaStreamException {
- public:
-  explicit ConsumerStoppedException(const std::string &consumer_name)
-      : KafkaStreamException("Kafka consumer {} is already stopped", consumer_name) {}
-};
-
-class ConsumerCheckFailedException : public KafkaStreamException {
- public:
-  explicit ConsumerCheckFailedException(const std::string &consumer_name, const std::string &error)
-      : KafkaStreamException("Kafka consumer {} check failed: {}", consumer_name, error) {}
-};
-
-class ConsumerStartFailedException : public KafkaStreamException {
- public:
-  explicit ConsumerStartFailedException(const std::string &consumer_name, const std::string &error)
-      : KafkaStreamException("Starting Kafka consumer {} failed: {}", consumer_name, error) {}
-};
-
-class TopicNotFoundException : public KafkaStreamException {
- public:
-  TopicNotFoundException(const std::string &consumer_name, const std::string &topic_name)
-      : KafkaStreamException("Kafka consumer {} cannot find topic {}", consumer_name, topic_name) {}
-};
-}  // namespace integrations::kafka

src/kvstore/kvstore.cpp

@@ -144,7 +144,7 @@ bool KVStore::iterator::IsValid() { return pimpl_->it != nullptr; }
 
 // TODO(ipaljak) The complexity of the size function should be at most
 //               logarithmic.
-size_t KVStore::Size(const std::string &prefix) const {
+size_t KVStore::Size(const std::string &prefix) {
   size_t size = 0;
   for (auto it = this->begin(prefix); it != this->end(prefix); ++it) ++size;
   return size;

src/kvstore/kvstore.hpp

@@ -126,7 +126,7 @@ class KVStore final {
    *
    * @return - number of stored pairs.
    */
-  size_t Size(const std::string &prefix = "") const;
+  size_t Size(const std::string &prefix = "");
 
   /**
    * Compact the underlying storage for the key range [begin_prefix,
@@ -186,9 +186,9 @@ class KVStore final {
     std::unique_ptr<impl> pimpl_;
   };
 
-  iterator begin(const std::string &prefix = "") const { return iterator(this, prefix); }
+  iterator begin(const std::string &prefix = "") { return iterator(this, prefix); }
 
-  iterator end(const std::string &prefix = "") const { return iterator(this, prefix, true); }
+  iterator end(const std::string &prefix = "") { return iterator(this, prefix, true); }
 
  private:
   struct impl;

src/py/py.hpp

@@ -29,8 +29,8 @@ class EnsureGIL final {
   PyGILState_STATE gil_state_;
 
  public:
-  EnsureGIL() noexcept : gil_state_(PyGILState_Ensure()) {}
-  ~EnsureGIL() noexcept { PyGILState_Release(gil_state_); }
+  EnsureGIL() : gil_state_(PyGILState_Ensure()) {}
+  ~EnsureGIL() { PyGILState_Release(gil_state_); }
   EnsureGIL(const EnsureGIL &) = delete;
   EnsureGIL(EnsureGIL &&) = delete;
   EnsureGIL &operator=(const EnsureGIL &) = delete;

src/query/CMakeLists.txt

@@ -32,7 +32,6 @@ set(mg_query_sources
     procedure/module.cpp
     procedure/py_module.cpp
     serialization/property_value.cpp
-    streams.cpp
     trigger.cpp
     trigger_context.cpp
     typed_value.cpp)
@@ -41,7 +40,7 @@ add_library(mg-query STATIC ${mg_query_sources})
 add_dependencies(mg-query generate_lcp_query)
 target_include_directories(mg-query PUBLIC ${CMAKE_SOURCE_DIR}/include)
 target_link_libraries(mg-query dl cppitertools)
-target_link_libraries(mg-query mg-integrations-kafka mg-storage-v2 mg-utils mg-kvstore)
+target_link_libraries(mg-query mg-storage-v2 mg-utils mg-kvstore)
 if("${MG_PYTHON_VERSION}" STREQUAL "")
     find_package(Python3 3.5 REQUIRED COMPONENTS Development)
 else()
@@ -73,7 +72,7 @@ add_custom_command(
     OUTPUT ${antlr_opencypher_generated_src} ${antlr_opencypher_generated_include}
     COMMAND ${CMAKE_COMMAND} -E make_directory ${opencypher_generated}
     COMMAND
-        java -jar ${CMAKE_SOURCE_DIR}/libs/antlr-4.9.2-complete.jar
+        java -jar ${CMAKE_SOURCE_DIR}/libs/antlr-4.6-complete.jar
             -Dlanguage=Cpp -visitor -package antlropencypher
             -o ${opencypher_generated}
             ${opencypher_lexer_grammar} ${opencypher_parser_grammar}

src/query/auth_checker.hpp

@@ -1,18 +0,0 @@
-#pragma once
-
-#include "query/frontend/ast/ast.hpp"
-
-namespace query {
-class AuthChecker {
- public:
-  virtual bool IsUserAuthorized(const std::optional<std::string> &username,
-                                const std::vector<query::AuthQuery::Privilege> &privileges) const = 0;
-};
-
-class AllowEverythingAuthChecker final : public query::AuthChecker {
-  bool IsUserAuthorized(const std::optional<std::string> &username,
-                        const std::vector<query::AuthQuery::Privilege> &privileges) const override {
-    return true;
-  }
-};
-}  // namespace query

src/query/common.hpp

@@ -4,7 +4,6 @@
 #include <concepts>
 #include <cstdint>
 #include <string>
-#include <string_view>
 
 #include "query/db_accessor.hpp"
 #include "query/exceptions.hpp"
@@ -22,10 +21,6 @@ namespace impl {
 bool TypedValueCompare(const TypedValue &a, const TypedValue &b);
 }  // namespace impl
 
-constexpr inline std::string_view kSerializationErrorMessage{
-    "Cannot resolve conflicting transactions. You can retry this transaction when the conflicting transaction is "
-    "finished."};
-
 /// Custom Comparator type for comparing vectors of TypedValues.
 ///
 /// Does lexicographical ordering of elements based on the above
@@ -71,7 +66,8 @@ inline void ExpectType(const Symbol &symbol, const TypedValue &value, TypedValue
 template <typename T>
 concept AccessorWithSetProperty = requires(T accessor, const storage::PropertyId key,
                                            const storage::PropertyValue new_value) {
-  { accessor.SetProperty(key, new_value) } -> std::same_as<storage::Result<storage::PropertyValue>>;
+  { accessor.SetProperty(key, new_value) }
+  ->std::same_as<storage::Result<storage::PropertyValue>>;
 };
 
 /// Set a property `value` mapped with given `key` on a `record`.
@@ -84,7 +80,7 @@ storage::PropertyValue PropsSetChecked(T *record, const storage::PropertyId &key
     if (maybe_old_value.HasError()) {
       switch (maybe_old_value.GetError()) {
         case storage::Error::SERIALIZATION_ERROR:
-          throw QueryRuntimeException(kSerializationErrorMessage);
+          throw QueryRuntimeException("Can't serialize due to concurrent operations.");
         case storage::Error::DELETED_OBJECT:
           throw QueryRuntimeException("Trying to set properties on a deleted object.");
         case storage::Error::PROPERTIES_DISABLED:

src/query/config.hpp

@@ -1,12 +0,0 @@
-#pragma once
-
-namespace query {
-struct InterpreterConfig {
-  struct Query {
-    bool allow_load_csv{true};
-  } query;
-
-  // The default execution timeout is 10 minutes.
-  double execution_timeout_sec{600.0};
-};
-}  // namespace query

src/query/context.hpp

@@ -1,13 +1,11 @@
 #pragma once
 
-#include <type_traits>
-
 #include "query/common.hpp"
 #include "query/frontend/semantic/symbol_table.hpp"
 #include "query/parameters.hpp"
 #include "query/plan/profile.hpp"
 #include "query/trigger.hpp"
-#include "utils/async_timer.hpp"
+#include "utils/tsc.hpp"
 
 namespace query {
 
@@ -52,25 +50,20 @@ struct ExecutionContext {
   DbAccessor *db_accessor{nullptr};
   SymbolTable symbol_table;
   EvaluationContext evaluation_context;
+  utils::TSCTimer execution_tsc_timer;
+  double max_execution_time_sec{0.0};
   std::atomic<bool> *is_shutting_down{nullptr};
   bool is_profile_query{false};
   std::chrono::duration<double> profile_execution_time;
   plan::ProfilingStats stats;
   plan::ProfilingStats *stats_root{nullptr};
   TriggerContextCollector *trigger_context_collector{nullptr};
-  utils::AsyncTimer timer;
 };
 
-static_assert(std::is_move_assignable_v<ExecutionContext>, "ExecutionContext must be move assignable!");
-static_assert(std::is_move_constructible_v<ExecutionContext>, "ExecutionContext must be move constructible!");
-
-inline bool MustAbort(const ExecutionContext &context) noexcept {
-  return (context.is_shutting_down != nullptr && context.is_shutting_down->load(std::memory_order_acquire)) ||
-         context.timer.IsExpired();
-}
-
-inline plan::ProfilingStatsWithTotalTime GetStatsWithTotalTime(const ExecutionContext &context) {
-  return plan::ProfilingStatsWithTotalTime{context.stats, context.profile_execution_time};
+inline bool MustAbort(const ExecutionContext &context) {
+  return (context.is_shutting_down && context.is_shutting_down->load(std::memory_order_acquire)) ||
+         (context.max_execution_time_sec > 0 &&
+          context.execution_tsc_timer.Elapsed() >= context.max_execution_time_sec);
 }
 
 }  // namespace query

src/query/cypher_query_interpreter.cpp

@@ -10,8 +10,7 @@ namespace query {
 CachedPlan::CachedPlan(std::unique_ptr<LogicalPlan> plan) : plan_(std::move(plan)) {}
 
 ParsedQuery ParseQuery(const std::string &query_string, const std::map<std::string, storage::PropertyValue> &params,
-                       utils::SkipList<QueryCacheEntry> *cache, utils::SpinLock *antlr_lock,
-                       const InterpreterConfig::Query &query_config) {
+                       utils::SkipList<QueryCacheEntry> *cache, utils::SpinLock *antlr_lock) {
   // Strip the query for caching purposes. The process of stripping a query
   // "normalizes" it by replacing any literals with new parameters. This
   // results in just the *structure* of the query being taken into account for
@@ -75,11 +74,7 @@ ParsedQuery ParseQuery(const std::string &query_string, const std::map<std::stri
 
     visitor.visit(parser->tree());
 
-    if (visitor.GetQueryInfo().has_load_csv && !query_config.allow_load_csv) {
-      throw utils::BasicException("Load CSV not allowed on this instance because it was disabled by a config.");
-    }
-
-    if (visitor.GetQueryInfo().is_cacheable) {
+    if (visitor.IsCacheable()) {
       CachedQuery cached_query{std::move(ast_storage), visitor.query(), query::GetRequiredPrivileges(visitor.query())};
       it = accessor.insert({hash, std::move(cached_query)}).first;
 

src/query/cypher_query_interpreter.hpp

@@ -11,7 +11,6 @@
 // the compilation to fail.
 #include "query/plan/planner.hpp"
 //////////////////////////////////////////////////////
-#include "query/config.hpp"
 #include "query/frontend/ast/cypher_main_visitor.hpp"
 #include "query/frontend/opencypher/parser.hpp"
 #include "query/frontend/semantic/required_privileges.hpp"
@@ -110,8 +109,7 @@ struct ParsedQuery {
 };
 
 ParsedQuery ParseQuery(const std::string &query_string, const std::map<std::string, storage::PropertyValue> &params,
-                       utils::SkipList<QueryCacheEntry> *cache, utils::SpinLock *antlr_lock,
-                       const InterpreterConfig::Query &query_config);
+                       utils::SkipList<QueryCacheEntry> *cache, utils::SpinLock *antlr_lock);
 
 class SingleNodeLogicalPlan final : public LogicalPlan {
  public:

src/query/db_accessor.hpp

@@ -73,11 +73,11 @@ class EdgeAccessor final {
 
   int64_t CypherId() const { return impl_.Gid().AsInt(); }
 
-  storage::Gid Gid() const noexcept { return impl_.Gid(); }
+  auto Gid() const { return impl_.Gid(); }
 
-  bool operator==(const EdgeAccessor &e) const noexcept { return impl_ == e.impl_; }
+  bool operator==(const EdgeAccessor &e) const { return impl_ == e.impl_; }
 
-  bool operator!=(const EdgeAccessor &e) const noexcept { return !(*this == e); }
+  bool operator!=(const EdgeAccessor &e) const { return !(*this == e); }
 };
 
 class VertexAccessor final {
@@ -87,7 +87,7 @@ class VertexAccessor final {
   static EdgeAccessor MakeEdgeAccessor(const storage::EdgeAccessor impl) { return EdgeAccessor(impl); }
 
  public:
-  explicit VertexAccessor(storage::VertexAccessor impl) : impl_(impl) {}
+  explicit VertexAccessor(storage::VertexAccessor impl) : impl_(std::move(impl)) {}
 
   bool IsVisible(storage::View view) const { return impl_.IsVisible(view); }
 
@@ -158,14 +158,11 @@ class VertexAccessor final {
 
   int64_t CypherId() const { return impl_.Gid().AsInt(); }
 
-  storage::Gid Gid() const noexcept { return impl_.Gid(); }
+  auto Gid() const { return impl_.Gid(); }
 
-  bool operator==(const VertexAccessor &v) const noexcept {
-    static_assert(noexcept(impl_ == v.impl_));
-    return impl_ == v.impl_;
-  }
+  bool operator==(const VertexAccessor &v) const { return impl_ == v.impl_; }
 
-  bool operator!=(const VertexAccessor &v) const noexcept { return !(*this == v); }
+  bool operator!=(const VertexAccessor &v) const { return !(*this == v); }
 };
 
 inline VertexAccessor EdgeAccessor::To() const { return VertexAccessor(impl_.ToVertex()); }

src/query/discard_value_stream.hpp

@@ -1,13 +0,0 @@
-#pragma once
-
-#include <vector>
-
-#include "query/typed_value.hpp"
-
-namespace query {
-struct DiscardValueResultStream final {
-  void Result(const std::vector<query::TypedValue> & /*values*/) {
-    // do nothing
-  }
-};
-}  // namespace query

src/query/exceptions.hpp

@@ -141,6 +141,11 @@ class UserModificationInMulticommandTxException : public QueryException {
       : QueryException("Authentication clause not allowed in multicommand transactions.") {}
 };
 
+class StreamClauseInMulticommandTxException : public QueryException {
+ public:
+  StreamClauseInMulticommandTxException() : QueryException("Stream clause not allowed in multicommand transactions.") {}
+};
+
 class InvalidArgumentsException : public QueryException {
  public:
   InvalidArgumentsException(const std::string &argument_name, const std::string &message)
@@ -170,22 +175,4 @@ class TriggerModificationInMulticommandTxException : public QueryException {
   TriggerModificationInMulticommandTxException()
       : QueryException("Trigger queries not allowed in multicommand transactions.") {}
 };
-
-class StreamQueryInMulticommandTxException : public QueryException {
- public:
-  StreamQueryInMulticommandTxException()
-      : QueryException("Stream queries are not allowed in multicommand transactions.") {}
-};
-
-class IsolationLevelModificationInMulticommandTxException : public QueryException {
- public:
-  IsolationLevelModificationInMulticommandTxException()
-      : QueryException("Isolation level cannot be modified in multicommand transactions.") {}
-};
-
-class CreateSnapshotInMulticommandTxException final : public QueryException {
- public:
-  CreateSnapshotInMulticommandTxException()
-      : QueryException("Snapshot cannot be created in multicommand transactions.") {}
-};
 }  // namespace query

src/query/frontend/ast/ast.lcp

@@ -3,7 +3,6 @@
 
 #include <memory>
 #include <unordered_map>
-#include <variant>
 #include <vector>
 
 #include "query/frontend/ast/ast_visitor.hpp"
@@ -1238,19 +1237,6 @@ cpp<#
   (:clone :ignore-other-base-classes t)
   (:type-info :ignore-other-base-classes t))
 
-(defun clone-variant-properties (source destination)
-  #>cpp
-    if (const auto *properties = std::get_if<std::unordered_map<PropertyIx, Expression *>>(&${source})) {
-      auto &new_obj_properties = std::get<std::unordered_map<PropertyIx, Expression *>>(${destination});
-      for (const auto &[property, value_expression] : *properties) {
-        PropertyIx key = storage->GetPropertyIx(property.name);
-        new_obj_properties[key] = value_expression->Clone(storage);
-      }
-    } else {
-      ${destination} = std::get<ParameterLookup *>(${source})->Clone(storage);
-    }
-  cpp<#)
-
 (lcp:define-class node-atom (pattern-atom)
   ((labels "std::vector<LabelIx>" :scope :public
            :slk-load (lambda (member)
@@ -1263,22 +1249,20 @@ cpp<#
                       }
                       cpp<#)
            :clone (clone-name-ix-vector "Label"))
-   (properties "std::variant<std::unordered_map<PropertyIx, Expression *>, ParameterLookup*>"
-              :clone #'clone-variant-properties
-              :scope :public))
+   (properties "std::unordered_map<PropertyIx, Expression *>"
+               :slk-save #'slk-save-property-map
+               :slk-load #'slk-load-property-map
+               :clone #'clone-property-map
+               :scope :public))
   (:public
     #>cpp
     bool Accept(HierarchicalTreeVisitor &visitor) override {
       if (visitor.PreVisit(*this)) {
-        if (auto* properties = std::get_if<std::unordered_map<PropertyIx, Expression *>>(&properties_)) {
-          bool cont = identifier_->Accept(visitor);
-          for (auto &property : *properties) {
-            if (cont) {
-              cont = property.second->Accept(visitor);
-            }
+        bool cont = identifier_->Accept(visitor);
+        for (auto &property : properties_) {
+          if (cont) {
+            cont = property.second->Accept(visitor);
           }
-        } else {
-          std::get<ParameterLookup*>(properties_)->Accept(visitor);
         }
       }
       return visitor.PostVisit(*this);
@@ -1309,11 +1293,11 @@ cpp<#
                           }
                           cpp<#)
                :clone (clone-name-ix-vector "EdgeType"))
-   (properties "std::variant<std::unordered_map<PropertyIx, Expression *>, ParameterLookup*>"
+   (properties "std::unordered_map<PropertyIx, Expression *>"
                :scope :public
                :slk-save #'slk-save-property-map
                :slk-load #'slk-load-property-map
-               :clone #'clone-variant-properties)
+               :clone #'clone-property-map)
    (lower-bound "Expression *" :initval "nullptr" :scope :public
                 :slk-save #'slk-save-ast-pointer
                 :slk-load (slk-load-ast-pointer "Expression")
@@ -1365,14 +1349,10 @@ cpp<#
     bool Accept(HierarchicalTreeVisitor &visitor) override {
       if (visitor.PreVisit(*this)) {
         bool cont = identifier_->Accept(visitor);
-        if (auto *properties = std::get_if<std::unordered_map<query::PropertyIx, query::Expression *>>(&properties_)) {
-          for (auto &property : *properties) {
-            if (cont) {
-              cont = property.second->Accept(visitor);
-            }
+        for (auto &property : properties_) {
+          if (cont) {
+            cont = property.second->Accept(visitor);
           }
-        } else {
-          std::get<ParameterLookup *>(properties_)->Accept(visitor);
         }
         if (cont && lower_bound_) {
           cont = lower_bound_->Accept(visitor);
@@ -2213,7 +2193,7 @@ cpp<#
       (:serialize))
     (lcp:define-enum privilege
         (create delete match merge set remove index stats auth constraint
-         dump replication durability read_file free_memory trigger config stream)
+         dump replication lock_path read_file free_memory trigger)
       (:serialize))
     #>cpp
     AuthQuery() = default;
@@ -2251,9 +2231,8 @@ const std::vector<AuthQuery::Privilege> kPrivilegesAll = {
     AuthQuery::Privilege::CONSTRAINT, AuthQuery::Privilege::DUMP,
     AuthQuery::Privilege::REPLICATION,
     AuthQuery::Privilege::READ_FILE,
-    AuthQuery::Privilege::DURABILITY,
-    AuthQuery::Privilege::FREE_MEMORY, AuthQuery::Privilege::TRIGGER,
-    AuthQuery::Privilege::CONFIG,      AuthQuery::Privilege::STREAM};
+    AuthQuery::Privilege::LOCK_PATH,
+    AuthQuery::Privilege::FREE_MEMORY, AuthQuery::Privilege::TRIGGER};
 cpp<#
 
 (lcp:define-class info-query (query)
@@ -2330,9 +2309,7 @@ cpp<#
    (socket_address "Expression *" :initval "nullptr" :scope :public
              :slk-save #'slk-save-ast-pointer
              :slk-load (slk-load-ast-pointer "Expression"))
-   (port "Expression *" :initval "nullptr" :scope :public
-             :slk-save #'slk-save-ast-pointer
-             :slk-load (slk-load-ast-pointer "Expression"))
+   (port "Expression *" :initval "nullptr" :scope :public)
    (sync_mode "SyncMode" :scope :public)
    (timeout "Expression *" :initval "nullptr" :scope :public
              :slk-save #'slk-save-ast-pointer
@@ -2455,70 +2432,4 @@ cpp<#
   (:serialize (:slk))
   (:clone))
 
-(lcp:define-class isolation-level-query (query)
-  ((isolation_level "IsolationLevel" :scope :public)
-   (isolation_level_scope "IsolationLevelScope" :scope :public))
-
-  (:public
-    (lcp:define-enum isolation-level
-        (snapshot-isolation read-committed read-uncommitted)
-      (:serialize))
-    (lcp:define-enum isolation-level-scope
-        (next session global)
-      (:serialize))
-    #>cpp
-    IsolationLevelQuery() = default;
-
-    DEFVISITABLE(QueryVisitor<void>);
-    cpp<#)
-  (:private
-    #>cpp
-    friend class AstStorage;
-    cpp<#)
-  (:serialize (:slk))
-  (:clone))
-
-(lcp:define-class create-snapshot-query (query) ()
-  (:public
-    #>cpp
-    DEFVISITABLE(QueryVisitor<void>);
-    cpp<#)
-  (:serialize (:slk))
-  (:clone))
-
-(lcp:define-class stream-query (query)
-  ((action "Action" :scope :public)
-   (stream_name "std::string" :scope :public)
-   (topic_names "std::vector<std::string>" :scope :public)
-   (transform_name "std::string" :scope :public)
-   (consumer_group "std::string" :scope :public)
-   (batch_interval "Expression *" :initval "nullptr" :scope :public
-             :slk-save #'slk-save-ast-pointer
-             :slk-load (slk-load-ast-pointer "Expression"))
-   (batch_size "Expression *" :initval "nullptr" :scope :public
-             :slk-save #'slk-save-ast-pointer
-             :slk-load (slk-load-ast-pointer "Expression"))
-   (batch_limit "Expression *" :initval "nullptr" :scope :public
-             :slk-save #'slk-save-ast-pointer
-             :slk-load (slk-load-ast-pointer "Expression"))
-   (timeout "Expression *" :initval "nullptr" :scope :public
-             :slk-save #'slk-save-ast-pointer
-             :slk-load (slk-load-ast-pointer "Expression")))
-
-  (:public
-    (lcp:define-enum action
-        (create-stream drop-stream start-stream stop-stream start-all-streams stop-all-streams show-streams check-stream)
-      (:serialize))
-    #>cpp
-    StreamQuery() = default;
-
-    DEFVISITABLE(QueryVisitor<void>);
-    cpp<#)
-  (:private
-    #>cpp
-    friend class AstStorage;
-    cpp<#)
-  (:serialize (:slk))
-  (:clone))
-
 (lcp:pop-namespace) ;; namespace query

src/query/frontend/ast/ast_visitor.hpp

@@ -77,9 +77,6 @@ class LockPathQuery;
 class LoadCsv;
 class FreeMemoryQuery;
 class TriggerQuery;
-class IsolationLevelQuery;
-class CreateSnapshotQuery;
-class StreamQuery;
 
 using TreeCompositeVisitor = ::utils::CompositeVisitor<
     SingleQuery, CypherUnion, NamedExpression, OrOperator, XorOperator, AndOperator, NotOperator, AdditionOperator,
@@ -111,9 +108,8 @@ class ExpressionVisitor
           None, ParameterLookup, Identifier, PrimitiveLiteral, RegexMatch> {};
 
 template <class TResult>
-class QueryVisitor
-    : public ::utils::Visitor<TResult, CypherQuery, ExplainQuery, ProfileQuery, IndexQuery, AuthQuery, InfoQuery,
-                              ConstraintQuery, DumpQuery, ReplicationQuery, LockPathQuery, FreeMemoryQuery,
-                              TriggerQuery, IsolationLevelQuery, CreateSnapshotQuery, StreamQuery> {};
+class QueryVisitor : public ::utils::Visitor<TResult, CypherQuery, ExplainQuery, ProfileQuery, IndexQuery, AuthQuery,
+                                             InfoQuery, ConstraintQuery, DumpQuery, ReplicationQuery, LockPathQuery,
+                                             FreeMemoryQuery, TriggerQuery> {};
 
 }  // namespace query

src/query/frontend/ast/cypher_main_visitor.cpp

@@ -7,7 +7,6 @@
 // of the same name, EOF.
 // This hides the definition of the macro which causes
 // the compilation to fail.
-#include "query/frontend/ast/ast_visitor.hpp"
 #include "query/procedure/module.hpp"
 //////////////////////////////////////////////////////
 #include "query/frontend/ast/cypher_main_visitor.hpp"
@@ -16,13 +15,11 @@
 #include <climits>
 #include <codecvt>
 #include <cstring>
-#include <iterator>
 #include <limits>
 #include <string>
 #include <tuple>
 #include <unordered_map>
 #include <utility>
-#include <variant>
 #include <vector>
 
 #include "query/exceptions.hpp"
@@ -56,29 +53,6 @@ std::optional<std::pair<query::Expression *, size_t>> VisitMemoryLimit(
 
   return std::make_pair(memory_limit, memory_scale);
 }
-
-std::string JoinTokens(const auto &tokens, const auto &string_projection, const auto &separator) {
-  std::vector<std::string> tokens_string;
-  tokens_string.reserve(tokens.size());
-  for (auto *token : tokens) {
-    tokens_string.emplace_back(string_projection(token));
-  }
-  return utils::Join(tokens_string, separator);
-}
-
-std::string JoinSymbolicNames(antlr4::tree::ParseTreeVisitor *visitor,
-                              const std::vector<MemgraphCypher::SymbolicNameContext *> symbolicNames,
-                              const std::string &separator = ".") {
-  return JoinTokens(
-      symbolicNames, [&](auto *token) { return token->accept(visitor).template as<std::string>(); }, separator);
-}
-
-std::string JoinSymbolicNamesWithDotsAndMinus(antlr4::tree::ParseTreeVisitor &visitor,
-                                              MemgraphCypher::SymbolicNameWithDotsAndMinusContext &ctx) {
-  return JoinTokens(
-      ctx.symbolicNameWithMinus(), [&](auto *token) { return JoinSymbolicNames(&visitor, token->symbolicName(), "-"); },
-      ".");
-}
 }  // namespace
 
 antlrcpp::Any CypherMainVisitor::visitExplainQuery(MemgraphCypher::ExplainQueryContext *ctx) {
@@ -320,8 +294,6 @@ antlrcpp::Any CypherMainVisitor::visitLockPathQuery(MemgraphCypher::LockPathQuer
 }
 
 antlrcpp::Any CypherMainVisitor::visitLoadCsv(MemgraphCypher::LoadCsvContext *ctx) {
-  query_info_.has_load_csv = true;
-
   auto *load_csv = storage_->Create<LoadCsv>();
   // handle file name
   if (ctx->csvFile()->literal()->StringLiteral()) {
@@ -359,7 +331,6 @@ antlrcpp::Any CypherMainVisitor::visitLoadCsv(MemgraphCypher::LoadCsvContext *ct
 
   // handle row variable
   load_csv->row_var_ = storage_->Create<Identifier>(ctx->rowVar()->variable()->accept(this).as<std::string>());
-
   return load_csv;
 }
 
@@ -441,140 +412,6 @@ antlrcpp::Any CypherMainVisitor::visitShowTriggers(MemgraphCypher::ShowTriggersC
   return trigger_query;
 }
 
-antlrcpp::Any CypherMainVisitor::visitIsolationLevelQuery(MemgraphCypher::IsolationLevelQueryContext *ctx) {
-  auto *isolation_level_query = storage_->Create<IsolationLevelQuery>();
-
-  isolation_level_query->isolation_level_scope_ = [scope = ctx->isolationLevelScope()]() {
-    if (scope->GLOBAL()) {
-      return IsolationLevelQuery::IsolationLevelScope::GLOBAL;
-    }
-    if (scope->SESSION()) {
-      return IsolationLevelQuery::IsolationLevelScope::SESSION;
-    }
-    return IsolationLevelQuery::IsolationLevelScope::NEXT;
-  }();
-
-  isolation_level_query->isolation_level_ = [level = ctx->isolationLevel()]() {
-    if (level->SNAPSHOT()) {
-      return IsolationLevelQuery::IsolationLevel::SNAPSHOT_ISOLATION;
-    }
-    if (level->COMMITTED()) {
-      return IsolationLevelQuery::IsolationLevel::READ_COMMITTED;
-    }
-    return IsolationLevelQuery::IsolationLevel::READ_UNCOMMITTED;
-  }();
-
-  query_ = isolation_level_query;
-  return isolation_level_query;
-}
-
-antlrcpp::Any CypherMainVisitor::visitCreateSnapshotQuery(MemgraphCypher::CreateSnapshotQueryContext *ctx) {
-  query_ = storage_->Create<CreateSnapshotQuery>();
-  return query_;
-}
-
-antlrcpp::Any CypherMainVisitor::visitStreamQuery(MemgraphCypher::StreamQueryContext *ctx) {
-  MG_ASSERT(ctx->children.size() == 1, "StreamQuery should have exactly one child!");
-  auto *stream_query = ctx->children[0]->accept(this).as<StreamQuery *>();
-  query_ = stream_query;
-  return stream_query;
-}
-
-antlrcpp::Any CypherMainVisitor::visitCreateStream(MemgraphCypher::CreateStreamContext *ctx) {
-  auto *stream_query = storage_->Create<StreamQuery>();
-  stream_query->action_ = StreamQuery::Action::CREATE_STREAM;
-  stream_query->stream_name_ = ctx->streamName()->symbolicName()->accept(this).as<std::string>();
-
-  auto *topic_names_ctx = ctx->topicNames();
-  MG_ASSERT(topic_names_ctx != nullptr);
-  auto topic_names = topic_names_ctx->symbolicNameWithDotsAndMinus();
-  MG_ASSERT(!topic_names.empty());
-  stream_query->topic_names_.reserve(topic_names.size());
-  std::transform(topic_names.begin(), topic_names.end(), std::back_inserter(stream_query->topic_names_),
-                 [this](auto *topic_name) { return JoinSymbolicNamesWithDotsAndMinus(*this, *topic_name); });
-
-  stream_query->transform_name_ = JoinSymbolicNames(this, ctx->transformationName->symbolicName());
-
-  if (ctx->CONSUMER_GROUP()) {
-    stream_query->consumer_group_ = JoinSymbolicNamesWithDotsAndMinus(*this, *ctx->consumerGroup);
-  }
-
-  if (ctx->BATCH_INTERVAL()) {
-    if (!ctx->batchInterval->numberLiteral() || !ctx->batchInterval->numberLiteral()->integerLiteral()) {
-      throw SemanticException("Batch interval should be an integer literal!");
-    }
-    stream_query->batch_interval_ = ctx->batchInterval->accept(this);
-  }
-
-  if (ctx->BATCH_SIZE()) {
-    if (!ctx->batchSize->numberLiteral() || !ctx->batchSize->numberLiteral()->integerLiteral()) {
-      throw SemanticException("Batch size should be an integer literal!");
-    }
-    stream_query->batch_size_ = ctx->batchSize->accept(this);
-  }
-
-  return stream_query;
-}
-
-antlrcpp::Any CypherMainVisitor::visitDropStream(MemgraphCypher::DropStreamContext *ctx) {
-  auto *stream_query = storage_->Create<StreamQuery>();
-  stream_query->action_ = StreamQuery::Action::DROP_STREAM;
-  stream_query->stream_name_ = ctx->streamName()->symbolicName()->accept(this).as<std::string>();
-  return stream_query;
-}
-
-antlrcpp::Any CypherMainVisitor::visitStartStream(MemgraphCypher::StartStreamContext *ctx) {
-  auto *stream_query = storage_->Create<StreamQuery>();
-  stream_query->action_ = StreamQuery::Action::START_STREAM;
-  stream_query->stream_name_ = ctx->streamName()->symbolicName()->accept(this).as<std::string>();
-  return stream_query;
-}
-
-antlrcpp::Any CypherMainVisitor::visitStartAllStreams(MemgraphCypher::StartAllStreamsContext *ctx) {
-  auto *stream_query = storage_->Create<StreamQuery>();
-  stream_query->action_ = StreamQuery::Action::START_ALL_STREAMS;
-  return stream_query;
-}
-
-antlrcpp::Any CypherMainVisitor::visitStopStream(MemgraphCypher::StopStreamContext *ctx) {
-  auto *stream_query = storage_->Create<StreamQuery>();
-  stream_query->action_ = StreamQuery::Action::STOP_STREAM;
-  stream_query->stream_name_ = ctx->streamName()->symbolicName()->accept(this).as<std::string>();
-  return stream_query;
-}
-
-antlrcpp::Any CypherMainVisitor::visitStopAllStreams(MemgraphCypher::StopAllStreamsContext *ctx) {
-  auto *stream_query = storage_->Create<StreamQuery>();
-  stream_query->action_ = StreamQuery::Action::STOP_ALL_STREAMS;
-  return stream_query;
-}
-
-antlrcpp::Any CypherMainVisitor::visitShowStreams(MemgraphCypher::ShowStreamsContext *ctx) {
-  auto *stream_query = storage_->Create<StreamQuery>();
-  stream_query->action_ = StreamQuery::Action::SHOW_STREAMS;
-  return stream_query;
-}
-
-antlrcpp::Any CypherMainVisitor::visitCheckStream(MemgraphCypher::CheckStreamContext *ctx) {
-  auto *stream_query = storage_->Create<StreamQuery>();
-  stream_query->action_ = StreamQuery::Action::CHECK_STREAM;
-  stream_query->stream_name_ = ctx->streamName()->symbolicName()->accept(this).as<std::string>();
-
-  if (ctx->BATCH_LIMIT()) {
-    if (!ctx->batchLimit->numberLiteral() || !ctx->batchLimit->numberLiteral()->integerLiteral()) {
-      throw SemanticException("Batch limit should be an integer literal!");
-    }
-    stream_query->batch_limit_ = ctx->batchLimit->accept(this);
-  }
-  if (ctx->TIMEOUT()) {
-    if (!ctx->timeout->numberLiteral() || !ctx->timeout->numberLiteral()->integerLiteral()) {
-      throw SemanticException("Timeout should be an integer literal!");
-    }
-    stream_query->timeout_ = ctx->timeout->accept(this);
-  }
-  return stream_query;
-}
-
 antlrcpp::Any CypherMainVisitor::visitCypherUnion(MemgraphCypher::CypherUnionContext *ctx) {
   bool distinct = !ctx->ALL();
   auto *cypher_union = storage_->Create<CypherUnion>(distinct);
@@ -740,11 +577,16 @@ antlrcpp::Any CypherMainVisitor::visitCallProcedure(MemgraphCypher::CallProcedur
   // If a user recompiles and reloads the procedure with different result
   // names, because of the cache, old result names will be expected while the
   // procedure will return results mapped to new names.
-  query_info_.is_cacheable = false;
+  is_cacheable_ = false;
 
   auto *call_proc = storage_->Create<CallProcedure>();
   MG_ASSERT(!ctx->procedureName()->symbolicName().empty());
-  call_proc->procedure_name_ = JoinSymbolicNames(this, ctx->procedureName()->symbolicName());
+  std::vector<std::string> procedure_subnames;
+  procedure_subnames.reserve(ctx->procedureName()->symbolicName().size());
+  for (auto *subname : ctx->procedureName()->symbolicName()) {
+    procedure_subnames.emplace_back(subname->accept(this).as<std::string>());
+  }
+  utils::Join(&call_proc->procedure_name_, procedure_subnames, ".");
   call_proc->arguments_.reserve(ctx->expression().size());
   for (auto *expr : ctx->expression()) {
     call_proc->arguments_.push_back(expr->accept(this));
@@ -998,12 +840,10 @@ antlrcpp::Any CypherMainVisitor::visitPrivilege(MemgraphCypher::PrivilegeContext
   if (ctx->CONSTRAINT()) return AuthQuery::Privilege::CONSTRAINT;
   if (ctx->DUMP()) return AuthQuery::Privilege::DUMP;
   if (ctx->REPLICATION()) return AuthQuery::Privilege::REPLICATION;
+  if (ctx->LOCK_PATH()) return AuthQuery::Privilege::LOCK_PATH;
   if (ctx->READ_FILE()) return AuthQuery::Privilege::READ_FILE;
   if (ctx->FREE_MEMORY()) return AuthQuery::Privilege::FREE_MEMORY;
   if (ctx->TRIGGER()) return AuthQuery::Privilege::TRIGGER;
-  if (ctx->CONFIG()) return AuthQuery::Privilege::CONFIG;
-  if (ctx->DURABILITY()) return AuthQuery::Privilege::DURABILITY;
-  if (ctx->STREAM()) return AuthQuery::Privilege::STREAM;
   LOG_FATAL("Should not get here - unknown privilege!");
 }
 
@@ -1113,12 +953,7 @@ antlrcpp::Any CypherMainVisitor::visitNodePattern(MemgraphCypher::NodePatternCon
     node->labels_ = ctx->nodeLabels()->accept(this).as<std::vector<LabelIx>>();
   }
   if (ctx->properties()) {
-    // This can return either properties or parameters
-    if (ctx->properties()->mapLiteral()) {
-      node->properties_ = ctx->properties()->accept(this).as<std::unordered_map<PropertyIx, Expression *>>();
-    } else {
-      node->properties_ = ctx->properties()->accept(this).as<ParameterLookup *>();
-    }
+    node->properties_ = ctx->properties()->accept(this).as<std::unordered_map<PropertyIx, Expression *>>();
   }
   return node;
 }
@@ -1132,12 +967,15 @@ antlrcpp::Any CypherMainVisitor::visitNodeLabels(MemgraphCypher::NodeLabelsConte
 }
 
 antlrcpp::Any CypherMainVisitor::visitProperties(MemgraphCypher::PropertiesContext *ctx) {
-  if (ctx->mapLiteral()) {
-    return ctx->mapLiteral()->accept(this);
+  if (!ctx->mapLiteral()) {
+    // If child is not mapLiteral that means child is params. At the moment
+    // we don't support properties to be a param because we can generate
+    // better logical plan if we have an information about properties at
+    // compile time.
+    // TODO: implement other clauses.
+    throw utils::NotYetImplemented("property parameters");
   }
-  // If child is not mapLiteral that means child is params.
-  MG_ASSERT(ctx->parameter());
-  return ctx->parameter()->accept(this);
+  return ctx->mapLiteral()->accept(this);
 }
 
 antlrcpp::Any CypherMainVisitor::visitMapLiteral(MemgraphCypher::MapLiteralContext *ctx) {
@@ -1336,12 +1174,7 @@ antlrcpp::Any CypherMainVisitor::visitRelationshipPattern(MemgraphCypher::Relati
     case 0:
       break;
     case 1: {
-      if (properties[0]->mapLiteral()) {
-        edge->properties_ = properties[0]->accept(this).as<std::unordered_map<PropertyIx, Expression *>>();
-        break;
-      }
-      MG_ASSERT(properties[0]->parameter());
-      edge->properties_ = properties[0]->accept(this).as<ParameterLookup *>();
+      edge->properties_ = properties[0]->accept(this).as<std::unordered_map<PropertyIx, Expression *>>();
       break;
     }
     default:

src/query/frontend/ast/cypher_main_visitor.hpp

@@ -238,61 +238,6 @@ class CypherMainVisitor : public antlropencypher::MemgraphCypherBaseVisitor {
    */
   antlrcpp::Any visitShowTriggers(MemgraphCypher::ShowTriggersContext *ctx) override;
 
-  /**
-   * @return IsolationLevelQuery*
-   */
-  antlrcpp::Any visitIsolationLevelQuery(MemgraphCypher::IsolationLevelQueryContext *ctx) override;
-
-  /**
-   * @return CreateSnapshotQuery*
-   */
-  antlrcpp::Any visitCreateSnapshotQuery(MemgraphCypher::CreateSnapshotQueryContext *ctx) override;
-
-  /**
-   * @return StreamQuery*
-   */
-  antlrcpp::Any visitStreamQuery(MemgraphCypher::StreamQueryContext *ctx) override;
-
-  /**
-   * @return StreamQuery*
-   */
-  antlrcpp::Any visitCreateStream(MemgraphCypher::CreateStreamContext *ctx) override;
-
-  /**
-   * @return StreamQuery*
-   */
-  antlrcpp::Any visitDropStream(MemgraphCypher::DropStreamContext *ctx) override;
-
-  /**
-   * @return StreamQuery*
-   */
-  antlrcpp::Any visitStartStream(MemgraphCypher::StartStreamContext *ctx) override;
-
-  /**
-   * @return StreamQuery*
-   */
-  antlrcpp::Any visitStartAllStreams(MemgraphCypher::StartAllStreamsContext *ctx) override;
-
-  /**
-   * @return StreamQuery*
-   */
-  antlrcpp::Any visitStopStream(MemgraphCypher::StopStreamContext *ctx) override;
-
-  /**
-   * @return StreamQuery*
-   */
-  antlrcpp::Any visitStopAllStreams(MemgraphCypher::StopAllStreamsContext *ctx) override;
-
-  /**
-   * @return StreamQuery*
-   */
-  antlrcpp::Any visitShowStreams(MemgraphCypher::ShowStreamsContext *ctx) override;
-
-  /**
-   * @return StreamQuery*
-   */
-  antlrcpp::Any visitCheckStream(MemgraphCypher::CheckStreamContext *ctx) override;
-
   /**
    * @return CypherUnion*
    */
@@ -778,12 +723,7 @@ class CypherMainVisitor : public antlropencypher::MemgraphCypherBaseVisitor {
   Query *query() { return query_; }
   const static std::string kAnonPrefix;
 
-  struct QueryInfo {
-    bool is_cacheable{true};
-    bool has_load_csv{false};
-  };
-
-  const auto &GetQueryInfo() const { return query_info_; }
+  bool IsCacheable() const { return is_cacheable_; }
 
  private:
   LabelIx AddLabel(const std::string &name);
@@ -803,7 +743,7 @@ class CypherMainVisitor : public antlropencypher::MemgraphCypherBaseVisitor {
   // return.
   bool in_with_ = false;
 
-  QueryInfo query_info_;
+  bool is_cacheable_ = true;
 };
 }  // namespace frontend
 }  // namespace query

src/query/frontend/opencypher/grammar/MemgraphCypher.g4

@@ -12,17 +12,10 @@ memgraphCypherKeyword : cypherKeyword
                       | ASYNC
                       | AUTH
                       | BAD
-                      | BATCH_INTERVAL
-                      | BATCH_LIMIT
-                      | BATCH_SIZE
                       | BEFORE
-                      | CHECK
                       | CLEAR
-                      | COMMIT
-                      | COMMITTED
-                      | CONFIG
-                      | CONSUMER_GROUP
                       | CSV
+                      | COMMIT
                       | DATA
                       | DELIMITER
                       | DATABASE
@@ -33,22 +26,17 @@ memgraphCypherKeyword : cypherKeyword
                       | FOR
                       | FREE
                       | FROM
-                      | GLOBAL
                       | GRANT
                       | HEADER
                       | IDENTIFIED
-                      | ISOLATION
-                      | LEVEL
                       | LOAD
                       | LOCK
                       | MAIN
                       | MODE
-                      | NEXT
                       | NO
                       | PASSWORD
                       | PORT
                       | PRIVILEGES
-                      | READ
                       | REGISTER
                       | REPLICA
                       | REPLICAS
@@ -57,21 +45,12 @@ memgraphCypherKeyword : cypherKeyword
                       | ROLE
                       | ROLES
                       | QUOTE
-                      | SESSION
-                      | SNAPSHOT
-                      | START
                       | STATS
-                      | STREAM
-                      | STREAMS
                       | SYNC
-                      | TIMEOUT
-                      | TO
-                      | TOPICS
-                      | TRANSACTION
-                      | TRANSFORM
                       | TRIGGER
                       | TRIGGERS
-                      | UNCOMMITTED
+                      | TIMEOUT
+                      | TO
                       | UNLOCK
                       | UPDATE
                       | USER
@@ -95,9 +74,6 @@ query : cypherQuery
       | lockPathQuery
       | freeMemoryQuery
       | triggerQuery
-      | isolationLevelQuery
-      | createSnapshotQuery
-      | streamQuery
       ;
 
 authQuery : createRole
@@ -142,16 +118,6 @@ clause : cypherMatch
        | loadCsv
        ;
 
-streamQuery : checkStream
-            | createStream
-            | dropStream
-            | startStream
-            | startAllStreams
-            | stopStream
-            | stopAllStreams
-            | showStreams
-            ;
-
 loadCsv : LOAD CSV FROM csvFile ( WITH | NO ) HEADER
          ( IGNORE BAD ) ?
          ( DELIMITER delimiter ) ?
@@ -205,12 +171,10 @@ privilege : CREATE
           | CONSTRAINT
           | DUMP
           | REPLICATION
+          | LOCK_PATH
           | READ_FILE
           | FREE_MEMORY
           | TRIGGER
-          | CONFIG
-          | DURABILITY
-          | STREAM
           ;
 
 privilegeList : privilege ( ',' privilege )* ;
@@ -258,40 +222,3 @@ createTrigger : CREATE TRIGGER triggerName ( ON ( emptyVertex | emptyEdge ) ? (
 dropTrigger : DROP TRIGGER triggerName ;
 
 showTriggers : SHOW TRIGGERS ;
-
-isolationLevel : SNAPSHOT ISOLATION | READ COMMITTED | READ UNCOMMITTED ;
-
-isolationLevelScope : GLOBAL | SESSION | NEXT ;
-
-isolationLevelQuery : SET isolationLevelScope TRANSACTION ISOLATION LEVEL isolationLevel ;
-
-createSnapshotQuery : CREATE SNAPSHOT ;
-
-streamName : symbolicName ;
-
-symbolicNameWithMinus : symbolicName ( MINUS symbolicName )* ;
-
-symbolicNameWithDotsAndMinus: symbolicNameWithMinus ( DOT symbolicNameWithMinus )* ;
-
-topicNames : symbolicNameWithDotsAndMinus ( COMMA symbolicNameWithDotsAndMinus )* ;
-
-createStream : CREATE STREAM streamName
-               TOPICS topicNames
-               TRANSFORM transformationName=procedureName
-               ( CONSUMER_GROUP consumerGroup=symbolicNameWithDotsAndMinus ) ?
-               ( BATCH_INTERVAL batchInterval=literal ) ?
-               ( BATCH_SIZE batchSize=literal ) ? ;
-
-dropStream : DROP STREAM streamName ;
-
-startStream : START STREAM streamName ;
-
-startAllStreams : START ALL STREAMS ;
-
-stopStream : STOP STREAM streamName ;
-
-stopAllStreams : STOP ALL STREAMS ;
-
-showStreams : SHOW STREAMS ;
-
-checkStream : CHECK STREAM streamName ( BATCH_LIMIT batchLimit=literal ) ? ( TIMEOUT timeout=literal ) ? ;

src/query/frontend/opencypher/grammar/MemgraphCypherLexer.g4

@@ -17,16 +17,9 @@ ALTER          : A L T E R ;
 ASYNC          : A S Y N C ;
 AUTH           : A U T H ;
 BAD            : B A D ;
-BATCH_INTERVAL : B A T C H UNDERSCORE I N T E R V A L ;
-BATCH_LIMIT    : B A T C H UNDERSCORE L I M I T ;
-BATCH_SIZE     : B A T C H UNDERSCORE S I Z E ;
 BEFORE         : B E F O R E ;
-CHECK          : C H E C K ;
 CLEAR          : C L E A R ;
 COMMIT         : C O M M I T ;
-COMMITTED      : C O M M I T T E D ;
-CONFIG         : C O N F I G ;
-CONSUMER_GROUP : C O N S U M E R UNDERSCORE G R O U P ;
 CSV            : C S V ;
 DATA           : D A T A ;
 DELIMITER      : D E L I M I T E R ;
@@ -35,30 +28,25 @@ DENY           : D E N Y ;
 DIRECTORY      : D I R E C T O R Y ;
 DROP           : D R O P ;
 DUMP           : D U M P ;
-DURABILITY     : D U R A B I L I T Y ;
 EXECUTE        : E X E C U T E ;
 FOR            : F O R ;
 FREE           : F R E E ;
 FREE_MEMORY    : F R E E UNDERSCORE M E M O R Y ;
 FROM           : F R O M ;
-GLOBAL         : G L O B A L ;
 GRANT          : G R A N T ;
 GRANTS         : G R A N T S ;
 HEADER         : H E A D E R ;
 IDENTIFIED     : I D E N T I F I E D ;
 IGNORE         : I G N O R E ;
-ISOLATION      : I S O L A T I O N ;
-LEVEL          : L E V E L ;
 LOAD           : L O A D ;
 LOCK           : L O C K ;
+LOCK_PATH      : L O C K UNDERSCORE P A T H ;
 MAIN           : M A I N ;
 MODE           : M O D E ;
-NEXT           : N E X T ;
 NO             : N O ;
 PASSWORD       : P A S S W O R D ;
 PORT           : P O R T ;
 PRIVILEGES     : P R I V I L E G E S ;
-READ           : R E A D ;
 READ_FILE      : R E A D UNDERSCORE F I L E ;
 REGISTER       : R E G I S T E R ;
 REPLICA        : R E P L I C A ;
@@ -68,22 +56,12 @@ REVOKE         : R E V O K E ;
 ROLE           : R O L E ;
 ROLES          : R O L E S ;
 QUOTE          : Q U O T E ;
-SESSION        : S E S S I O N ;
-SNAPSHOT       : S N A P S H O T ;
-START          : S T A R T ;
 STATS          : S T A T S ;
-STOP           : S T O P ;
-STREAM         : S T R E A M ;
-STREAMS        : S T R E A M S ;
 SYNC           : S Y N C ;
 TIMEOUT        : T I M E O U T ;
 TO             : T O ;
-TOPICS         : T O P I C S;
-TRANSACTION    : T R A N S A C T I O N ;
-TRANSFORM      : T R A N S F O R M ;
 TRIGGER        : T R I G G E R ;
 TRIGGERS       : T R I G G E R S ;
-UNCOMMITTED    : U N C O M M I T T E D ;
 UNLOCK         : U N L O C K ;
 UPDATE         : U P D A T E ;
 USER           : U S E R ;

src/query/frontend/opencypher/parser.hpp

@@ -35,7 +35,7 @@ class Parser {
 
  private:
   class FirstMessageErrorListener : public antlr4::BaseErrorListener {
-    void syntaxError(antlr4::Recognizer *, antlr4::Token *, size_t line, size_t position, const std::string &message,
+    void syntaxError(antlr4::IRecognizer *, antlr4::Token *, size_t line, size_t position, const std::string &message,
                      std::exception_ptr) override {
       if (error_.empty()) {
         error_ = "line " + std::to_string(line) + ":" + std::to_string(position + 1) + " " + message;
@@ -48,7 +48,7 @@ class Parser {
 
   FirstMessageErrorListener error_listener_;
   std::string query_;
-  antlr4::ANTLRInputStream input_{query_};
+  antlr4::ANTLRInputStream input_{query_.c_str()};
   antlropencypher::MemgraphCypherLexer lexer_{&input_};
   antlr4::CommonTokenStream tokens_{&lexer_};
 

src/query/frontend/semantic/required_privileges.cpp

@@ -49,20 +49,14 @@ class PrivilegeExtractor : public QueryVisitor<void>, public HierarchicalTreeVis
 
   void Visit(DumpQuery &dump_query) override { AddPrivilege(AuthQuery::Privilege::DUMP); }
 
-  void Visit(LockPathQuery &lock_path_query) override { AddPrivilege(AuthQuery::Privilege::DURABILITY); }
+  void Visit(LockPathQuery &lock_path_query) override { AddPrivilege(AuthQuery::Privilege::LOCK_PATH); }
 
   void Visit(FreeMemoryQuery &free_memory_query) override { AddPrivilege(AuthQuery::Privilege::FREE_MEMORY); }
 
   void Visit(TriggerQuery &trigger_query) override { AddPrivilege(AuthQuery::Privilege::TRIGGER); }
 
-  void Visit(StreamQuery &stream_query) override { AddPrivilege(AuthQuery::Privilege::STREAM); }
-
   void Visit(ReplicationQuery &replication_query) override { AddPrivilege(AuthQuery::Privilege::REPLICATION); }
 
-  void Visit(IsolationLevelQuery &isolation_level_query) override { AddPrivilege(AuthQuery::Privilege::CONFIG); }
-
-  void Visit(CreateSnapshotQuery &create_snapshot_query) override { AddPrivilege(AuthQuery::Privilege::DURABILITY); }
-
   bool PreVisit(Create & /*unused*/) override {
     AddPrivilege(AuthQuery::Privilege::CREATE);
     return false;

src/query/frontend/semantic/symbol_generator.cpp

@@ -6,10 +6,7 @@
 
 #include <optional>
 #include <unordered_set>
-#include <variant>
 
-#include "query/frontend/ast/ast.hpp"
-#include "query/frontend/ast/ast_visitor.hpp"
 #include "utils/algorithm.hpp"
 #include "utils/logging.hpp"
 
@@ -405,33 +402,19 @@ bool SymbolGenerator::PostVisit(Pattern &) {
 }
 
 bool SymbolGenerator::PreVisit(NodeAtom &node_atom) {
-  auto check_node_semantic = [&node_atom, this](const bool props_or_labels) {
-    const auto &node_name = node_atom.identifier_->name_;
-    if ((scope_.in_create || scope_.in_merge) && props_or_labels && HasSymbol(node_name)) {
-      throw SemanticException("Cannot create node '" + node_name +
-                              "' with labels or properties, because it is already declared.");
-    }
-    scope_.in_pattern_atom_identifier = true;
-    node_atom.identifier_->Accept(*this);
-    scope_.in_pattern_atom_identifier = false;
-  };
-
   scope_.in_node_atom = true;
-  if (auto *properties = std::get_if<std::unordered_map<PropertyIx, Expression *>>(&node_atom.properties_)) {
-    bool props_or_labels = !properties->empty() || !node_atom.labels_.empty();
-
-    check_node_semantic(props_or_labels);
-    for (auto kv : *properties) {
-      kv.second->Accept(*this);
-    }
-
-    return false;
+  bool props_or_labels = !node_atom.properties_.empty() || !node_atom.labels_.empty();
+  const auto &node_name = node_atom.identifier_->name_;
+  if ((scope_.in_create || scope_.in_merge) && props_or_labels && HasSymbol(node_name)) {
+    throw SemanticException("Cannot create node '" + node_name +
+                            "' with labels or properties, because it is already declared.");
   }
-  auto &properties_parameter = std::get<ParameterLookup *>(node_atom.properties_);
-  bool props_or_labels = !properties_parameter || !node_atom.labels_.empty();
-
-  check_node_semantic(props_or_labels);
-  properties_parameter->Accept(*this);
+  for (auto kv : node_atom.properties_) {
+    kv.second->Accept(*this);
+  }
+  scope_.in_pattern_atom_identifier = true;
+  node_atom.identifier_->Accept(*this);
+  scope_.in_pattern_atom_identifier = false;
   return false;
 }
 
@@ -461,12 +444,8 @@ bool SymbolGenerator::PreVisit(EdgeAtom &edge_atom) {
           "edge.");
     }
   }
-  if (auto *properties = std::get_if<std::unordered_map<PropertyIx, Expression *>>(&edge_atom.properties_)) {
-    for (auto kv : *properties) {
-      kv.second->Accept(*this);
-    }
-  } else {
-    std::get<ParameterLookup *>(edge_atom.properties_)->Accept(*this);
+  for (auto kv : edge_atom.properties_) {
+    kv.second->Accept(*this);
   }
   if (edge_atom.IsVariable()) {
     scope_.in_edge_range = true;

src/query/frontend/stripped_lexer_constants.hpp

@@ -78,60 +78,18 @@ class Trie {
 
 const int kBitsetSize = 65536;
 
-const trie::Trie kKeywords = {"union",       "all",
-                              "optional",    "match",
-                              "unwind",      "as",
-                              "merge",       "on",
-                              "create",      "set",
-                              "detach",      "delete",
-                              "remove",      "with",
-                              "distinct",    "return",
-                              "order",       "by",
-                              "skip",        "limit",
-                              "ascending",   "asc",
-                              "descending",  "desc",
-                              "where",       "or",
-                              "xor",         "and",
-                              "not",         "in",
-                              "starts",      "ends",
-                              "contains",    "is",
-                              "null",        "case",
-                              "when",        "then",
-                              "else",        "end",
-                              "count",       "filter",
-                              "extract",     "any",
-                              "none",        "single",
-                              "true",        "false",
-                              "reduce",      "coalesce",
-                              "user",        "password",
-                              "alter",       "drop",
-                              "show",        "stats",
-                              "unique",      "explain",
-                              "profile",     "storage",
-                              "index",       "info",
-                              "exists",      "assert",
-                              "constraint",  "node",
-                              "key",         "dump",
-                              "database",    "call",
-                              "yield",       "memory",
-                              "mb",          "kb",
-                              "unlimited",   "free",
-                              "procedure",   "query",
-                              "free_memory", "read_file",
-                              "lock_path",   "after",
-                              "before",      "execute",
-                              "transaction", "trigger",
-                              "triggers",    "update",
-                              "comitted",    "uncomitted",
-                              "global",      "isolation",
-                              "level",       "next",
-                              "read",        "session",
-                              "snapshot",    "transaction",
-                              "batch_limit", "batch_interval",
-                              "batch_size",  "consumer_group",
-                              "start",       "stream",
-                              "streams",     "transform",
-                              "topics",      "check"};
+const trie::Trie kKeywords = {
+    "union",      "all",      "optional",  "match",    "unwind",      "as",      "merge",       "on",
+    "create",     "set",      "detach",    "delete",   "remove",      "with",    "distinct",    "return",
+    "order",      "by",       "skip",      "limit",    "ascending",   "asc",     "descending",  "desc",
+    "where",      "or",       "xor",       "and",      "not",         "in",      "starts",      "ends",
+    "contains",   "is",       "null",      "case",     "when",        "then",    "else",        "end",
+    "count",      "filter",   "extract",   "any",      "none",        "single",  "true",        "false",
+    "reduce",     "coalesce", "user",      "password", "alter",       "drop",    "show",        "stats",
+    "unique",     "explain",  "profile",   "storage",  "index",       "info",    "exists",      "assert",
+    "constraint", "node",     "key",       "dump",     "database",    "call",    "yield",       "memory",
+    "mb",         "kb",       "unlimited", "free",     "procedure",   "query",   "free_memory", "read_file",
+    "lock_path",  "after",    "before",    "execute",  "transaction", "trigger", "triggers",    "update"};
 
 // Unicode codepoints that are allowed at the start of the unescaped name.
 const std::bitset<kBitsetSize> kUnescapedNameAllowedStarts(

src/query/interpreter.cpp

@@ -1,14 +1,11 @@
 #include "query/interpreter.hpp"
 
 #include <atomic>
-#include <chrono>
 #include <limits>
-#include <optional>
 
 #include "glue/communication.hpp"
 #include "query/constants.hpp"
 #include "query/context.hpp"
-#include "query/cypher_query_interpreter.hpp"
 #include "query/db_accessor.hpp"
 #include "query/dump.hpp"
 #include "query/exceptions.hpp"
@@ -44,9 +41,6 @@ extern Event ReadWriteQuery;
 
 extern const Event LabelIndexCreated;
 extern const Event LabelPropertyIndexCreated;
-
-extern const Event StreamsCreated;
-extern const Event TriggersCreated;
 }  // namespace EventCounter
 
 namespace query {
@@ -78,18 +72,6 @@ TypedValue EvaluateOptionalExpression(Expression *expression, ExpressionEvaluato
   return expression ? expression->Accept(*eval) : TypedValue();
 }
 
-template <typename TResult>
-std::optional<TResult> GetOptionalValue(query::Expression *expression, ExpressionEvaluator &evaluator) {
-  if (expression != nullptr) {
-    auto int_value = expression->Accept(evaluator);
-    MG_ASSERT(int_value.IsNull() || int_value.IsInt());
-    if (int_value.IsInt()) {
-      return TResult{int_value.ValueInt()};
-    }
-  }
-  return {};
-};
-
 class ReplQueryHandler final : public query::ReplicationQueryHandler {
  public:
   explicit ReplQueryHandler(storage::Storage *db) : db_(db) {}
@@ -464,147 +446,6 @@ Callback HandleReplicationQuery(ReplicationQuery *repl_query, const Parameters &
   }
 }
 
-std::optional<std::string> StringPointerToOptional(const std::string *str) {
-  return str == nullptr ? std::nullopt : std::make_optional(*str);
-}
-
-Callback HandleStreamQuery(StreamQuery *stream_query, const Parameters &parameters,
-                           InterpreterContext *interpreter_context, DbAccessor *db_accessor,
-                           const std::string *username) {
-  Frame frame(0);
-  SymbolTable symbol_table;
-  EvaluationContext evaluation_context;
-  // TODO: MemoryResource for EvaluationContext, it should probably be passed as
-  // the argument to Callback.
-  evaluation_context.timestamp =
-      std::chrono::duration_cast<std::chrono::milliseconds>(std::chrono::system_clock::now().time_since_epoch())
-          .count();
-  evaluation_context.parameters = parameters;
-  ExpressionEvaluator evaluator(&frame, symbol_table, evaluation_context, db_accessor, storage::View::OLD);
-
-  Callback callback;
-  switch (stream_query->action_) {
-    case StreamQuery::Action::CREATE_STREAM: {
-      EventCounter::IncrementCounter(EventCounter::StreamsCreated);
-      constexpr std::string_view kDefaultConsumerGroup = "mg_consumer";
-      std::string consumer_group{stream_query->consumer_group_.empty() ? kDefaultConsumerGroup
-                                                                       : stream_query->consumer_group_};
-
-      callback.fn =
-          [interpreter_context, stream_name = stream_query->stream_name_, topic_names = stream_query->topic_names_,
-           consumer_group = std::move(consumer_group),
-           batch_interval = GetOptionalValue<std::chrono::milliseconds>(stream_query->batch_interval_, evaluator),
-           batch_size = GetOptionalValue<int64_t>(stream_query->batch_size_, evaluator),
-           transformation_name = stream_query->transform_name_, owner = StringPointerToOptional(username)]() mutable {
-            interpreter_context->streams.Create(stream_name,
-                                                query::StreamInfo{.topics = std::move(topic_names),
-                                                                  .consumer_group = std::move(consumer_group),
-                                                                  .batch_interval = batch_interval,
-                                                                  .batch_size = batch_size,
-                                                                  .transformation_name = std::move(transformation_name),
-                                                                  .owner = std::move(owner)});
-            return std::vector<std::vector<TypedValue>>{};
-          };
-      return callback;
-    }
-    case StreamQuery::Action::START_STREAM: {
-      callback.fn = [interpreter_context, stream_name = stream_query->stream_name_]() {
-        interpreter_context->streams.Start(stream_name);
-        return std::vector<std::vector<TypedValue>>{};
-      };
-      return callback;
-    }
-    case StreamQuery::Action::START_ALL_STREAMS: {
-      callback.fn = [interpreter_context]() {
-        interpreter_context->streams.StartAll();
-        return std::vector<std::vector<TypedValue>>{};
-      };
-      return callback;
-    }
-    case StreamQuery::Action::STOP_STREAM: {
-      callback.fn = [interpreter_context, stream_name = stream_query->stream_name_]() {
-        interpreter_context->streams.Stop(stream_name);
-        return std::vector<std::vector<TypedValue>>{};
-      };
-      return callback;
-    }
-    case StreamQuery::Action::STOP_ALL_STREAMS: {
-      callback.fn = [interpreter_context]() {
-        interpreter_context->streams.StopAll();
-        return std::vector<std::vector<TypedValue>>{};
-      };
-      return callback;
-    }
-    case StreamQuery::Action::DROP_STREAM: {
-      callback.fn = [interpreter_context, stream_name = stream_query->stream_name_]() {
-        interpreter_context->streams.Drop(stream_name);
-        return std::vector<std::vector<TypedValue>>{};
-      };
-      return callback;
-    }
-    case StreamQuery::Action::SHOW_STREAMS: {
-      callback.header = {"name",  "topics",    "consumer_group", "batch_interval", "batch_size", "transformation_name",
-                         "owner", "is running"};
-      callback.fn = [interpreter_context]() {
-        auto streams_status = interpreter_context->streams.GetStreamInfo();
-        std::vector<std::vector<TypedValue>> results;
-        results.reserve(streams_status.size());
-        auto topics_as_typed_topics = [](const auto &topics) {
-          std::vector<TypedValue> typed_topics;
-          typed_topics.reserve(topics.size());
-          for (const auto &elem : topics) {
-            typed_topics.emplace_back(elem);
-          }
-          return typed_topics;
-        };
-
-        auto stream_info_as_typed_stream_info_emplace_in = [topics_as_typed_topics](auto &typed_status,
-                                                                                    const auto &stream_info) {
-          typed_status.emplace_back(topics_as_typed_topics(stream_info.topics));
-          typed_status.emplace_back(stream_info.consumer_group);
-          if (stream_info.batch_interval.has_value()) {
-            typed_status.emplace_back(stream_info.batch_interval->count());
-          } else {
-            typed_status.emplace_back();
-          }
-          if (stream_info.batch_size.has_value()) {
-            typed_status.emplace_back(*stream_info.batch_size);
-          } else {
-            typed_status.emplace_back();
-          }
-          typed_status.emplace_back(stream_info.transformation_name);
-          if (stream_info.owner.has_value()) {
-            typed_status.emplace_back(*stream_info.owner);
-          } else {
-            typed_status.emplace_back();
-          }
-        };
-
-        for (const auto &status : streams_status) {
-          std::vector<TypedValue> typed_status;
-          typed_status.reserve(7);
-          typed_status.emplace_back(status.name);
-          stream_info_as_typed_stream_info_emplace_in(typed_status, status.info);
-          typed_status.emplace_back(status.is_running);
-          results.push_back(std::move(typed_status));
-        }
-
-        return results;
-      };
-      return callback;
-    }
-    case StreamQuery::Action::CHECK_STREAM: {
-      callback.header = {"query", "parameters"};
-      callback.fn = [interpreter_context, stream_name = stream_query->stream_name_,
-                     timeout = GetOptionalValue<std::chrono::milliseconds>(stream_query->timeout_, evaluator),
-                     batch_limit = GetOptionalValue<int64_t>(stream_query->batch_limit_, evaluator)]() mutable {
-        return interpreter_context->streams.Check(stream_name, timeout, batch_limit);
-      };
-      return callback;
-    }
-  }
-}
-
 // Struct for lazy pulling from a vector
 struct PullPlanVector {
   explicit PullPlanVector(std::vector<std::vector<TypedValue>> values) : values_(std::move(values)) {}
@@ -632,9 +473,9 @@ struct PullPlan {
                     DbAccessor *dba, InterpreterContext *interpreter_context, utils::MemoryResource *execution_memory,
                     TriggerContextCollector *trigger_context_collector = nullptr,
                     std::optional<size_t> memory_limit = {});
-  std::optional<plan::ProfilingStatsWithTotalTime> Pull(AnyStream *stream, std::optional<int> n,
-                                                        const std::vector<Symbol> &output_symbols,
-                                                        std::map<std::string, TypedValue> *summary);
+  std::optional<ExecutionContext> Pull(AnyStream *stream, std::optional<int> n,
+                                       const std::vector<Symbol> &output_symbols,
+                                       std::map<std::string, TypedValue> *summary);
 
  private:
   std::shared_ptr<CachedPlan> plan_ = nullptr;
@@ -672,17 +513,16 @@ PullPlan::PullPlan(const std::shared_ptr<CachedPlan> plan, const Parameters &par
   ctx_.evaluation_context.parameters = parameters;
   ctx_.evaluation_context.properties = NamesToProperties(plan->ast_storage().properties_, dba);
   ctx_.evaluation_context.labels = NamesToLabels(plan->ast_storage().labels_, dba);
-  if (interpreter_context->config.execution_timeout_sec > 0) {
-    ctx_.timer = utils::AsyncTimer{interpreter_context->config.execution_timeout_sec};
-  }
+  ctx_.execution_tsc_timer = utils::TSCTimer(interpreter_context->tsc_frequency);
+  ctx_.max_execution_time_sec = interpreter_context->execution_timeout_sec;
   ctx_.is_shutting_down = &interpreter_context->is_shutting_down;
   ctx_.is_profile_query = is_profile_query;
   ctx_.trigger_context_collector = trigger_context_collector;
 }
 
-std::optional<plan::ProfilingStatsWithTotalTime> PullPlan::Pull(AnyStream *stream, std::optional<int> n,
-                                                                const std::vector<Symbol> &output_symbols,
-                                                                std::map<std::string, TypedValue> *summary) {
+std::optional<ExecutionContext> PullPlan::Pull(AnyStream *stream, std::optional<int> n,
+                                               const std::vector<Symbol> &output_symbols,
+                                               std::map<std::string, TypedValue> *summary) {
   // Set up temporary memory for a single Pull. Initial memory comes from the
   // stack. 256 KiB should fit on the stack and should be more than enough for a
   // single `Pull`.
@@ -755,18 +595,17 @@ std::optional<plan::ProfilingStatsWithTotalTime> PullPlan::Pull(AnyStream *strea
   summary->insert_or_assign("plan_execution_time", execution_time_.count());
   cursor_->Shutdown();
   ctx_.profile_execution_time = execution_time_;
-  return GetStatsWithTotalTime(ctx_);
+  return std::move(ctx_);
 }
 
 using RWType = plan::ReadWriteTypeChecker::RWType;
 }  // namespace
 
-InterpreterContext::InterpreterContext(storage::Storage *db, const InterpreterConfig config,
-                                       const std::filesystem::path &data_directory, std::string kafka_bootstrap_servers)
-    : db(db),
-      trigger_store(data_directory / "triggers"),
-      config(config),
-      streams{this, std::move(kafka_bootstrap_servers), data_directory / "streams"} {}
+InterpreterContext::InterpreterContext(storage::Storage *db, const std::filesystem::path &data_directory) : db(db) {
+  auto storage_accessor = db->Access();
+  DbAccessor dba{&storage_accessor};
+  trigger_store.emplace(data_directory / "triggers", &ast_cache, &dba, &antlr_lock);
+}
 
 Interpreter::Interpreter(InterpreterContext *interpreter_context) : interpreter_context_(interpreter_context) {
   MG_ASSERT(interpreter_context_, "Interpreter context must not be NULL");
@@ -783,12 +622,11 @@ PreparedQuery Interpreter::PrepareTransactionQuery(std::string_view query_upper)
       in_explicit_transaction_ = true;
       expect_rollback_ = false;
 
-      db_accessor_ =
-          std::make_unique<storage::Storage::Accessor>(interpreter_context_->db->Access(GetIsolationLevelOverride()));
+      db_accessor_ = std::make_unique<storage::Storage::Accessor>(interpreter_context_->db->Access());
       execution_db_accessor_.emplace(db_accessor_.get());
 
-      if (interpreter_context_->trigger_store.HasTriggers()) {
-        trigger_context_collector_.emplace(interpreter_context_->trigger_store.GetEventTypes());
+      if (interpreter_context_->trigger_store->HasTriggers()) {
+        trigger_context_collector_.emplace(interpreter_context_->trigger_store->GetEventTypes());
       }
     };
   } else if (query_upper == "COMMIT") {
@@ -902,7 +740,7 @@ PreparedQuery PrepareExplainQuery(ParsedQuery parsed_query, std::map<std::string
   // full query string) when given just the inner query to execute.
   ParsedQuery parsed_inner_query =
       ParseQuery(parsed_query.query_string.substr(kExplainQueryStart.size()), parsed_query.user_parameters,
-                 &interpreter_context->ast_cache, &interpreter_context->antlr_lock, interpreter_context->config.query);
+                 &interpreter_context->ast_cache, &interpreter_context->antlr_lock);
 
   auto *cypher_query = utils::Downcast<CypherQuery>(parsed_inner_query.query);
   MG_ASSERT(cypher_query, "Cypher grammar should not allow other queries in EXPLAIN");
@@ -969,7 +807,7 @@ PreparedQuery PrepareProfileQuery(ParsedQuery parsed_query, bool in_explicit_tra
   // full query string) when given just the inner query to execute.
   ParsedQuery parsed_inner_query =
       ParseQuery(parsed_query.query_string.substr(kProfileQueryStart.size()), parsed_query.user_parameters,
-                 &interpreter_context->ast_cache, &interpreter_context->antlr_lock, interpreter_context->config.query);
+                 &interpreter_context->ast_cache, &interpreter_context->antlr_lock);
 
   auto *cypher_query = utils::Downcast<CypherQuery>(parsed_inner_query.query);
   MG_ASSERT(cypher_query, "Cypher grammar should not allow other queries in PROFILE");
@@ -989,33 +827,32 @@ PreparedQuery PrepareProfileQuery(ParsedQuery parsed_query, bool in_explicit_tra
   auto rw_type_checker = plan::ReadWriteTypeChecker();
   rw_type_checker.InferRWType(const_cast<plan::LogicalOperator &>(cypher_query_plan->plan()));
 
-  return PreparedQuery{{"OPERATOR", "ACTUAL HITS", "RELATIVE TIME", "ABSOLUTE TIME"},
-                       std::move(parsed_query.required_privileges),
-                       [plan = std::move(cypher_query_plan), parameters = std::move(parsed_inner_query.parameters),
-                        summary, dba, interpreter_context, execution_memory, memory_limit,
-                        // We want to execute the query we are profiling lazily, so we delay
-                        // the construction of the corresponding context.
-                        stats_and_total_time = std::optional<plan::ProfilingStatsWithTotalTime>{},
-                        pull_plan = std::shared_ptr<PullPlanVector>(nullptr)](
-                           AnyStream *stream, std::optional<int> n) mutable -> std::optional<QueryHandlerResult> {
-                         // No output symbols are given so that nothing is streamed.
-                         if (!stats_and_total_time) {
-                           stats_and_total_time = PullPlan(plan, parameters, true, dba, interpreter_context,
-                                                           execution_memory, nullptr, memory_limit)
-                                                      .Pull(stream, {}, {}, summary);
-                           pull_plan = std::make_shared<PullPlanVector>(ProfilingStatsToTable(*stats_and_total_time));
-                         }
+  return PreparedQuery{
+      {"OPERATOR", "ACTUAL HITS", "RELATIVE TIME", "ABSOLUTE TIME"},
+      std::move(parsed_query.required_privileges),
+      [plan = std::move(cypher_query_plan), parameters = std::move(parsed_inner_query.parameters), summary, dba,
+       interpreter_context, execution_memory, memory_limit,
+       // We want to execute the query we are profiling lazily, so we delay
+       // the construction of the corresponding context.
+       ctx = std::optional<ExecutionContext>{}, pull_plan = std::shared_ptr<PullPlanVector>(nullptr)](
+          AnyStream *stream, std::optional<int> n) mutable -> std::optional<QueryHandlerResult> {
+        // No output symbols are given so that nothing is streamed.
+        if (!ctx) {
+          ctx = PullPlan(plan, parameters, true, dba, interpreter_context, execution_memory, nullptr, memory_limit)
+                    .Pull(stream, {}, {}, summary);
+          pull_plan = std::make_shared<PullPlanVector>(ProfilingStatsToTable(ctx->stats, ctx->profile_execution_time));
+        }
 
-                         MG_ASSERT(stats_and_total_time, "Failed to execute the query!");
+        MG_ASSERT(ctx, "Failed to execute the query!");
 
-                         if (pull_plan->Pull(stream, n)) {
-                           summary->insert_or_assign("profile", ProfilingStatsToJson(*stats_and_total_time).dump());
-                           return QueryHandlerResult::ABORT;
-                         }
+        if (pull_plan->Pull(stream, n)) {
+          summary->insert_or_assign("profile", ProfilingStatsToJson(ctx->stats, ctx->profile_execution_time).dump());
+          return QueryHandlerResult::ABORT;
+        }
 
-                         return std::nullopt;
-                       },
-                       rw_type_checker.type};
+        return std::nullopt;
+      },
+      rw_type_checker.type};
 }
 
 PreparedQuery PrepareDumpQuery(ParsedQuery parsed_query, std::map<std::string, TypedValue> *summary, DbAccessor *dba,
@@ -1244,17 +1081,16 @@ TriggerEventType ToTriggerEventType(const TriggerQuery::EventType event_type) {
 
 Callback CreateTrigger(TriggerQuery *trigger_query,
                        const std::map<std::string, storage::PropertyValue> &user_parameters,
-                       InterpreterContext *interpreter_context, DbAccessor *dba, std::optional<std::string> owner) {
+                       InterpreterContext *interpreter_context, DbAccessor *dba) {
   return {
       {},
       [trigger_name = std::move(trigger_query->trigger_name_), trigger_statement = std::move(trigger_query->statement_),
        event_type = trigger_query->event_type_, before_commit = trigger_query->before_commit_, interpreter_context, dba,
-       user_parameters, owner = std::move(owner)]() mutable -> std::vector<std::vector<TypedValue>> {
-        interpreter_context->trigger_store.AddTrigger(
-            std::move(trigger_name), trigger_statement, user_parameters, ToTriggerEventType(event_type),
+       user_parameters]() -> std::vector<std::vector<TypedValue>> {
+        interpreter_context->trigger_store->AddTrigger(
+            trigger_name, trigger_statement, user_parameters, ToTriggerEventType(event_type),
             before_commit ? TriggerPhase::BEFORE_COMMIT : TriggerPhase::AFTER_COMMIT, &interpreter_context->ast_cache,
-            dba, &interpreter_context->antlr_lock, interpreter_context->config.query, std::move(owner),
-            interpreter_context->auth_checker);
+            dba, &interpreter_context->antlr_lock);
         return {};
       }};
 }
@@ -1263,15 +1099,15 @@ Callback DropTrigger(TriggerQuery *trigger_query, InterpreterContext *interprete
   return {{},
           [trigger_name = std::move(trigger_query->trigger_name_),
            interpreter_context]() -> std::vector<std::vector<TypedValue>> {
-            interpreter_context->trigger_store.DropTrigger(trigger_name);
+            interpreter_context->trigger_store->DropTrigger(trigger_name);
             return {};
           }};
 }
 
 Callback ShowTriggers(InterpreterContext *interpreter_context) {
-  return {{"trigger name", "statement", "event type", "phase", "owner"}, [interpreter_context] {
+  return {{"trigger name", "statement", "event type", "phase"}, [interpreter_context] {
             std::vector<std::vector<TypedValue>> results;
-            auto trigger_infos = interpreter_context->trigger_store.GetTriggerInfo();
+            auto trigger_infos = interpreter_context->trigger_store->GetTriggerInfo();
             results.reserve(trigger_infos.size());
             for (auto &trigger_info : trigger_infos) {
               std::vector<TypedValue> typed_trigger_info;
@@ -1281,9 +1117,6 @@ Callback ShowTriggers(InterpreterContext *interpreter_context) {
               typed_trigger_info.emplace_back(TriggerEventTypeToString(trigger_info.event_type));
               typed_trigger_info.emplace_back(trigger_info.phase == TriggerPhase::BEFORE_COMMIT ? "BEFORE COMMIT"
                                                                                                 : "AFTER COMMIT");
-              typed_trigger_info.emplace_back(trigger_info.owner.has_value() ? TypedValue{*trigger_info.owner}
-                                                                             : TypedValue{});
-
               results.push_back(std::move(typed_trigger_info));
             }
 
@@ -1293,8 +1126,7 @@ Callback ShowTriggers(InterpreterContext *interpreter_context) {
 
 PreparedQuery PrepareTriggerQuery(ParsedQuery parsed_query, const bool in_explicit_transaction,
                                   InterpreterContext *interpreter_context, DbAccessor *dba,
-                                  const std::map<std::string, storage::PropertyValue> &user_parameters,
-                                  const std::string *username) {
+                                  const std::map<std::string, storage::PropertyValue> &user_parameters) {
   if (in_explicit_transaction) {
     throw TriggerModificationInMulticommandTxException();
   }
@@ -1302,12 +1134,10 @@ PreparedQuery PrepareTriggerQuery(ParsedQuery parsed_query, const bool in_explic
   auto *trigger_query = utils::Downcast<TriggerQuery>(parsed_query.query);
   MG_ASSERT(trigger_query);
 
-  auto callback = [trigger_query, interpreter_context, dba, &user_parameters,
-                   owner = StringPointerToOptional(username)]() mutable {
+  auto callback = [trigger_query, interpreter_context, dba, &user_parameters] {
     switch (trigger_query->action_) {
       case TriggerQuery::Action::CREATE_TRIGGER:
-        EventCounter::IncrementCounter(EventCounter::TriggersCreated);
-        return CreateTrigger(trigger_query, user_parameters, interpreter_context, dba, std::move(owner));
+        return CreateTrigger(trigger_query, user_parameters, interpreter_context, dba);
       case TriggerQuery::Action::DROP_TRIGGER:
         return DropTrigger(trigger_query, interpreter_context);
       case TriggerQuery::Action::SHOW_TRIGGERS:
@@ -1332,101 +1162,6 @@ PreparedQuery PrepareTriggerQuery(ParsedQuery parsed_query, const bool in_explic
   // NOLINTNEXTLINE(clang-analyzer-cplusplus.NewDeleteLeaks)
 }
 
-PreparedQuery PrepareStreamQuery(ParsedQuery parsed_query, const bool in_explicit_transaction,
-                                 InterpreterContext *interpreter_context, DbAccessor *dba,
-                                 const std::map<std::string, storage::PropertyValue> &user_parameters,
-                                 const std::string *username) {
-  if (in_explicit_transaction) {
-    throw StreamQueryInMulticommandTxException();
-  }
-
-  auto *stream_query = utils::Downcast<StreamQuery>(parsed_query.query);
-  MG_ASSERT(stream_query);
-  auto callback = HandleStreamQuery(stream_query, parsed_query.parameters, interpreter_context, dba, username);
-
-  return PreparedQuery{std::move(callback.header), std::move(parsed_query.required_privileges),
-                       [callback_fn = std::move(callback.fn), pull_plan = std::shared_ptr<PullPlanVector>{nullptr}](
-                           AnyStream *stream, std::optional<int> n) mutable -> std::optional<QueryHandlerResult> {
-                         if (UNLIKELY(!pull_plan)) {
-                           pull_plan = std::make_shared<PullPlanVector>(callback_fn());
-                         }
-
-                         if (pull_plan->Pull(stream, n)) {
-                           return QueryHandlerResult::COMMIT;
-                         }
-                         return std::nullopt;
-                       },
-                       RWType::NONE};
-  // False positive report for the std::make_shared above
-  // NOLINTNEXTLINE(clang-analyzer-cplusplus.NewDeleteLeaks)
-}
-
-constexpr auto ToStorageIsolationLevel(const IsolationLevelQuery::IsolationLevel isolation_level) noexcept {
-  switch (isolation_level) {
-    case IsolationLevelQuery::IsolationLevel::SNAPSHOT_ISOLATION:
-      return storage::IsolationLevel::SNAPSHOT_ISOLATION;
-    case IsolationLevelQuery::IsolationLevel::READ_COMMITTED:
-      return storage::IsolationLevel::READ_COMMITTED;
-    case IsolationLevelQuery::IsolationLevel::READ_UNCOMMITTED:
-      return storage::IsolationLevel::READ_UNCOMMITTED;
-  }
-}
-
-PreparedQuery PrepareIsolationLevelQuery(ParsedQuery parsed_query, const bool in_explicit_transaction,
-                                         InterpreterContext *interpreter_context, Interpreter *interpreter) {
-  if (in_explicit_transaction) {
-    throw IsolationLevelModificationInMulticommandTxException();
-  }
-
-  auto *isolation_level_query = utils::Downcast<IsolationLevelQuery>(parsed_query.query);
-  MG_ASSERT(isolation_level_query);
-
-  const auto isolation_level = ToStorageIsolationLevel(isolation_level_query->isolation_level_);
-
-  auto callback = [isolation_level_query, isolation_level, interpreter_context,
-                   interpreter]() -> std::function<void()> {
-    switch (isolation_level_query->isolation_level_scope_) {
-      case IsolationLevelQuery::IsolationLevelScope::GLOBAL:
-        return [interpreter_context, isolation_level] { interpreter_context->db->SetIsolationLevel(isolation_level); };
-      case IsolationLevelQuery::IsolationLevelScope::SESSION:
-        return [interpreter, isolation_level] { interpreter->SetSessionIsolationLevel(isolation_level); };
-      case IsolationLevelQuery::IsolationLevelScope::NEXT:
-        return [interpreter, isolation_level] { interpreter->SetNextTransactionIsolationLevel(isolation_level); };
-    }
-  }();
-
-  return PreparedQuery{
-      {},
-      std::move(parsed_query.required_privileges),
-      [callback = std::move(callback)](AnyStream *stream, std::optional<int> n) -> std::optional<QueryHandlerResult> {
-        callback();
-        return QueryHandlerResult::COMMIT;
-      },
-      RWType::NONE};
-}
-
-PreparedQuery PrepareCreateSnapshotQuery(ParsedQuery parsed_query, bool in_explicit_transaction,
-                                         InterpreterContext *interpreter_context) {
-  if (in_explicit_transaction) {
-    throw CreateSnapshotInMulticommandTxException();
-  }
-
-  return PreparedQuery{
-      {},
-      std::move(parsed_query.required_privileges),
-      [interpreter_context](AnyStream *stream, std::optional<int> n) -> std::optional<QueryHandlerResult> {
-        if (auto maybe_error = interpreter_context->db->CreateSnapshot(); maybe_error.HasError()) {
-          switch (maybe_error.GetError()) {
-            case storage::Storage::CreateSnapshotError::DisabledForReplica:
-              throw utils::BasicException(
-                  "Failed to create a snapshot. Replica instances are not allowed to create them.");
-          }
-        }
-        return QueryHandlerResult::COMMIT;
-      },
-      RWType::NONE};
-}
-
 PreparedQuery PrepareInfoQuery(ParsedQuery parsed_query, bool in_explicit_transaction,
                                std::map<std::string, TypedValue> *summary, InterpreterContext *interpreter_context,
                                storage::Storage *db, utils::MemoryResource *execution_memory) {
@@ -1671,8 +1406,7 @@ void Interpreter::RollbackTransaction() {
 }
 
 Interpreter::PrepareResult Interpreter::Prepare(const std::string &query_string,
-                                                const std::map<std::string, storage::PropertyValue> &params,
-                                                const std::string *username) {
+                                                const std::map<std::string, storage::PropertyValue> &params) {
   if (!in_explicit_transaction_) {
     query_executions_.clear();
   }
@@ -1709,8 +1443,8 @@ Interpreter::PrepareResult Interpreter::Prepare(const std::string &query_string,
     query_execution->summary["cost_estimate"] = 0.0;
 
     utils::Timer parsing_timer;
-    ParsedQuery parsed_query = ParseQuery(query_string, params, &interpreter_context_->ast_cache,
-                                          &interpreter_context_->antlr_lock, interpreter_context_->config.query);
+    ParsedQuery parsed_query =
+        ParseQuery(query_string, params, &interpreter_context_->ast_cache, &interpreter_context_->antlr_lock);
     query_execution->summary["parsing_time"] = parsing_timer.Elapsed().count();
 
     // Some queries require an active transaction in order to be prepared.
@@ -1718,12 +1452,11 @@ Interpreter::PrepareResult Interpreter::Prepare(const std::string &query_string,
         (utils::Downcast<CypherQuery>(parsed_query.query) || utils::Downcast<ExplainQuery>(parsed_query.query) ||
          utils::Downcast<ProfileQuery>(parsed_query.query) || utils::Downcast<DumpQuery>(parsed_query.query) ||
          utils::Downcast<TriggerQuery>(parsed_query.query))) {
-      db_accessor_ =
-          std::make_unique<storage::Storage::Accessor>(interpreter_context_->db->Access(GetIsolationLevelOverride()));
+      db_accessor_ = std::make_unique<storage::Storage::Accessor>(interpreter_context_->db->Access());
       execution_db_accessor_.emplace(db_accessor_.get());
 
-      if (utils::Downcast<CypherQuery>(parsed_query.query) && interpreter_context_->trigger_store.HasTriggers()) {
-        trigger_context_collector_.emplace(interpreter_context_->trigger_store.GetEventTypes());
+      if (utils::Downcast<CypherQuery>(parsed_query.query) && interpreter_context_->trigger_store->HasTriggers()) {
+        trigger_context_collector_.emplace(interpreter_context_->trigger_store->GetEventTypes());
       }
     }
 
@@ -1769,16 +1502,7 @@ Interpreter::PrepareResult Interpreter::Prepare(const std::string &query_string,
       prepared_query = PrepareFreeMemoryQuery(std::move(parsed_query), in_explicit_transaction_, interpreter_context_);
     } else if (utils::Downcast<TriggerQuery>(parsed_query.query)) {
       prepared_query = PrepareTriggerQuery(std::move(parsed_query), in_explicit_transaction_, interpreter_context_,
-                                           &*execution_db_accessor_, params, username);
-    } else if (utils::Downcast<StreamQuery>(parsed_query.query)) {
-      prepared_query = PrepareStreamQuery(std::move(parsed_query), in_explicit_transaction_, interpreter_context_,
-                                          &*execution_db_accessor_, params, username);
-    } else if (utils::Downcast<IsolationLevelQuery>(parsed_query.query)) {
-      prepared_query =
-          PrepareIsolationLevelQuery(std::move(parsed_query), in_explicit_transaction_, interpreter_context_, this);
-    } else if (utils::Downcast<CreateSnapshotQuery>(parsed_query.query)) {
-      prepared_query =
-          PrepareCreateSnapshotQuery(std::move(parsed_query), in_explicit_transaction_, interpreter_context_);
+                                           &*execution_db_accessor_, params);
     } else {
       LOG_FATAL("Should not get here -- unknown query type!");
     }
@@ -1829,8 +1553,9 @@ void RunTriggersIndividually(const utils::SkipList<Trigger> &triggers, Interpret
 
     trigger_context.AdaptForAccessor(&db_accessor);
     try {
-      trigger.Execute(&db_accessor, &execution_memory, interpreter_context->config.execution_timeout_sec,
-                      &interpreter_context->is_shutting_down, trigger_context, interpreter_context->auth_checker);
+      trigger.Execute(&db_accessor, &execution_memory, *interpreter_context->tsc_frequency,
+                      interpreter_context->execution_timeout_sec, &interpreter_context->is_shutting_down,
+                      trigger_context);
     } catch (const utils::BasicException &exception) {
       spdlog::warn("Trigger '{}' failed with exception:\n{}", trigger.Name(), exception.what());
       db_accessor.Abort();
@@ -1880,12 +1605,13 @@ void Interpreter::Commit() {
 
   if (trigger_context) {
     // Run the triggers
-    for (const auto &trigger : interpreter_context_->trigger_store.BeforeCommitTriggers().access()) {
+    for (const auto &trigger : interpreter_context_->trigger_store->BeforeCommitTriggers().access()) {
       utils::MonotonicBufferResource execution_memory{kExecutionMemoryBlockSize};
       AdvanceCommand();
       try {
-        trigger.Execute(&*execution_db_accessor_, &execution_memory, interpreter_context_->config.execution_timeout_sec,
-                        &interpreter_context_->is_shutting_down, *trigger_context, interpreter_context_->auth_checker);
+        trigger.Execute(&*execution_db_accessor_, &execution_memory, *interpreter_context_->tsc_frequency,
+                        interpreter_context_->execution_timeout_sec, &interpreter_context_->is_shutting_down,
+                        *trigger_context);
       } catch (const utils::BasicException &e) {
         throw utils::BasicException(
             fmt::format("Trigger '{}' caused the transaction to fail.\nException: {}", trigger.Name(), e.what()));
@@ -1932,11 +1658,11 @@ void Interpreter::Commit() {
   // probably will schedule its after commit triggers, because the other transactions that want to commit are still
   // waiting for commiting or one of them just started commiting its changes.
   // This means the ordered execution of after commit triggers are not guaranteed.
-  if (trigger_context && interpreter_context_->trigger_store.AfterCommitTriggers().size() > 0) {
+  if (trigger_context && interpreter_context_->trigger_store->AfterCommitTriggers().size() > 0) {
     interpreter_context_->after_commit_trigger_pool.AddTask(
         [trigger_context = std::move(*trigger_context), interpreter_context = this->interpreter_context_,
          user_transaction = std::shared_ptr(std::move(db_accessor_))]() mutable {
-          RunTriggersIndividually(interpreter_context->trigger_store.AfterCommitTriggers(), interpreter_context,
+          RunTriggersIndividually(interpreter_context->trigger_store->AfterCommitTriggers(), interpreter_context,
                                   std::move(trigger_context));
           user_transaction->FinalizeTransaction();
           SPDLOG_DEBUG("Finished executing after commit triggers");  // NOLINT(bugprone-lambda-function-name)
@@ -1964,22 +1690,4 @@ void Interpreter::AbortCommand(std::unique_ptr<QueryExecution> *query_execution)
   }
 }
 
-std::optional<storage::IsolationLevel> Interpreter::GetIsolationLevelOverride() {
-  if (next_transaction_isolation_level) {
-    const auto isolation_level = *next_transaction_isolation_level;
-    next_transaction_isolation_level.reset();
-    return isolation_level;
-  }
-
-  return interpreter_isolation_level;
-}
-
-void Interpreter::SetNextTransactionIsolationLevel(const storage::IsolationLevel isolation_level) {
-  next_transaction_isolation_level.emplace(isolation_level);
-}
-
-void Interpreter::SetSessionIsolationLevel(const storage::IsolationLevel isolation_level) {
-  interpreter_isolation_level.emplace(isolation_level);
-}
-
 }  // namespace query

src/query/interpreter.hpp

@@ -2,8 +2,6 @@
 
 #include <gflags/gflags.h>
 
-#include "query/auth_checker.hpp"
-#include "query/config.hpp"
 #include "query/context.hpp"
 #include "query/cypher_query_interpreter.hpp"
 #include "query/db_accessor.hpp"
@@ -15,10 +13,8 @@
 #include "query/plan/operator.hpp"
 #include "query/plan/read_write_type_checker.hpp"
 #include "query/stream.hpp"
-#include "query/streams.hpp"
 #include "query/trigger.hpp"
 #include "query/typed_value.hpp"
-#include "storage/v2/isolation_level.hpp"
 #include "utils/event_counter.hpp"
 #include "utils/logging.hpp"
 #include "utils/memory.hpp"
@@ -151,8 +147,7 @@ struct PreparedQuery {
  * been passed to an `Interpreter` instance.
  */
 struct InterpreterContext {
-  explicit InterpreterContext(storage::Storage *db, InterpreterConfig config,
-                              const std::filesystem::path &data_directory, std::string kafka_bootstrap_servers);
+  explicit InterpreterContext(storage::Storage *db, const std::filesystem::path &data_directory);
 
   storage::Storage *db;
 
@@ -165,25 +160,27 @@ struct InterpreterContext {
   utils::SpinLock antlr_lock;
   std::optional<double> tsc_frequency{utils::GetTSCFrequency()};
   std::atomic<bool> is_shutting_down{false};
+  // The default execution timeout is 3 minutes.
+  double execution_timeout_sec{180.0};
 
   AuthQueryHandler *auth{nullptr};
-  query::AuthChecker *auth_checker{nullptr};
 
   utils::SkipList<QueryCacheEntry> ast_cache;
   utils::SkipList<PlanCacheEntry> plan_cache;
 
-  TriggerStore trigger_store;
+  std::optional<TriggerStore> trigger_store;
   utils::ThreadPool after_commit_trigger_pool{1};
-
-  const InterpreterConfig config;
-
-  query::Streams streams;
 };
 
 /// Function that is used to tell all active interpreters that they should stop
 /// their ongoing execution.
 inline void Shutdown(InterpreterContext *context) { context->is_shutting_down.store(true, std::memory_order_release); }
 
+/// Function used to set the maximum execution timeout in seconds.
+inline void SetExecutionTimeout(InterpreterContext *context, double timeout) {
+  context->execution_timeout_sec = timeout;
+}
+
 class Interpreter final {
  public:
   explicit Interpreter(InterpreterContext *interpreter_context);
@@ -207,8 +204,7 @@ class Interpreter final {
    *
    * @throw query::QueryException
    */
-  PrepareResult Prepare(const std::string &query, const std::map<std::string, storage::PropertyValue> &params,
-                        const std::string *username);
+  PrepareResult Prepare(const std::string &query, const std::map<std::string, storage::PropertyValue> &params);
 
   /**
    * Execute the last prepared query and stream *all* of the results into the
@@ -258,9 +254,6 @@ class Interpreter final {
 
   void RollbackTransaction();
 
-  void SetNextTransactionIsolationLevel(storage::IsolationLevel isolation_level);
-  void SetSessionIsolationLevel(storage::IsolationLevel isolation_level);
-
   /**
    * Abort the current multicommand transaction.
    */
@@ -313,14 +306,10 @@ class Interpreter final {
   bool in_explicit_transaction_{false};
   bool expect_rollback_{false};
 
-  std::optional<storage::IsolationLevel> interpreter_isolation_level;
-  std::optional<storage::IsolationLevel> next_transaction_isolation_level;
-
   PreparedQuery PrepareTransactionQuery(std::string_view query_upper);
   void Commit();
   void AdvanceCommand();
   void AbortCommand(std::unique_ptr<QueryExecution> *query_execution);
-  std::optional<storage::IsolationLevel> GetIsolationLevelOverride();
 
   size_t ActiveQueryExecutions() {
     return std::count_if(query_executions_.begin(), query_executions_.end(),

src/query/plan/operator.cpp

@@ -166,7 +166,7 @@ VertexAccessor &CreateLocalVertex(const NodeCreationInfo &node_info, Frame *fram
     if (maybe_error.HasError()) {
       switch (maybe_error.GetError()) {
         case storage::Error::SERIALIZATION_ERROR:
-          throw QueryRuntimeException(kSerializationErrorMessage);
+          throw QueryRuntimeException("Can't serialize due to concurrent operations.");
         case storage::Error::DELETED_OBJECT:
           throw QueryRuntimeException("Trying to set a label on a deleted node.");
         case storage::Error::VERTEX_HAS_EDGES:
@@ -182,18 +182,7 @@ VertexAccessor &CreateLocalVertex(const NodeCreationInfo &node_info, Frame *fram
                                 storage::View::NEW);
   // TODO: PropsSetChecked allocates a PropertyValue, make it use context.memory
   // when we update PropertyValue with custom allocator.
-  if (const auto *node_info_properties = std::get_if<PropertiesMapList>(&node_info.properties)) {
-    for (const auto &[key, value_expression] : *node_info_properties) {
-      PropsSetChecked(&new_node, key, value_expression->Accept(evaluator));
-    }
-  } else {
-    auto property_map = evaluator.Visit(*std::get<ParameterLookup *>(node_info.properties));
-    for (const auto &[key, value] : property_map.ValueMap()) {
-      auto property_id = dba.NameToProperty(key);
-      PropsSetChecked(&new_node, property_id, value);
-    }
-  }
-
+  for (auto &kv : node_info.properties) PropsSetChecked(&new_node, kv.first, kv.second->Accept(evaluator));
   (*frame)[node_info.symbol] = new_node;
   return (*frame)[node_info.symbol].ValueVertex();
 }
@@ -266,23 +255,12 @@ EdgeAccessor CreateEdge(const EdgeCreationInfo &edge_info, DbAccessor *dba, Vert
   auto maybe_edge = dba->InsertEdge(from, to, edge_info.edge_type);
   if (maybe_edge.HasValue()) {
     auto &edge = *maybe_edge;
-    if (const auto *properties = std::get_if<PropertiesMapList>(&edge_info.properties)) {
-      for (const auto &[key, value_expression] : *properties) {
-        PropsSetChecked(&edge, key, value_expression->Accept(*evaluator));
-      }
-    } else {
-      auto property_map = evaluator->Visit(*std::get<ParameterLookup *>(edge_info.properties));
-      for (const auto &[key, value] : property_map.ValueMap()) {
-        auto property_id = dba->NameToProperty(key);
-        PropsSetChecked(&edge, property_id, value);
-      }
-    }
-
+    for (auto kv : edge_info.properties) PropsSetChecked(&edge, kv.first, kv.second->Accept(*evaluator));
     (*frame)[edge_info.symbol] = edge;
   } else {
     switch (maybe_edge.GetError()) {
       case storage::Error::SERIALIZATION_ERROR:
-        throw QueryRuntimeException(kSerializationErrorMessage);
+        throw QueryRuntimeException("Can't serialize due to concurrent operations.");
       case storage::Error::DELETED_OBJECT:
         throw QueryRuntimeException("Trying to create an edge on a deleted node.");
       case storage::Error::VERTEX_HAS_EDGES:
@@ -1861,7 +1839,7 @@ bool Delete::DeleteCursor::Pull(Frame &frame, ExecutionContext &context) {
       if (maybe_value.HasError()) {
         switch (maybe_value.GetError()) {
           case storage::Error::SERIALIZATION_ERROR:
-            throw QueryRuntimeException(kSerializationErrorMessage);
+            throw QueryRuntimeException("Can't serialize due to concurrent operations.");
           case storage::Error::DELETED_OBJECT:
           case storage::Error::VERTEX_HAS_EDGES:
           case storage::Error::PROPERTIES_DISABLED:
@@ -1887,7 +1865,7 @@ bool Delete::DeleteCursor::Pull(Frame &frame, ExecutionContext &context) {
           if (res.HasError()) {
             switch (res.GetError()) {
               case storage::Error::SERIALIZATION_ERROR:
-                throw QueryRuntimeException(kSerializationErrorMessage);
+                throw QueryRuntimeException("Can't serialize due to concurrent operations.");
               case storage::Error::DELETED_OBJECT:
               case storage::Error::VERTEX_HAS_EDGES:
               case storage::Error::PROPERTIES_DISABLED:
@@ -1907,7 +1885,7 @@ bool Delete::DeleteCursor::Pull(Frame &frame, ExecutionContext &context) {
           if (res.HasError()) {
             switch (res.GetError()) {
               case storage::Error::SERIALIZATION_ERROR:
-                throw QueryRuntimeException(kSerializationErrorMessage);
+                throw QueryRuntimeException("Can't serialize due to concurrent operations.");
               case storage::Error::VERTEX_HAS_EDGES:
                 throw RemoveAttachedVertexException();
               case storage::Error::DELETED_OBJECT:
@@ -2035,8 +2013,9 @@ namespace {
 template <typename T>
 concept AccessorWithProperties = requires(T value, storage::PropertyId property_id,
                                           storage::PropertyValue property_value) {
-  { value.ClearProperties() } -> std::same_as<storage::Result<std::map<storage::PropertyId, storage::PropertyValue>>>;
-  { value.SetProperty(property_id, property_value) };
+  { value.ClearProperties() }
+  ->std::same_as<storage::Result<std::map<storage::PropertyId, storage::PropertyValue>>>;
+  {value.SetProperty(property_id, property_value)};
 };
 
 /// Helper function that sets the given values on either a Vertex or an Edge.
@@ -2057,7 +2036,7 @@ void SetPropertiesOnRecord(TRecordAccessor *record, const TypedValue &rhs, SetPr
         case storage::Error::DELETED_OBJECT:
           throw QueryRuntimeException("Trying to set properties on a deleted graph element.");
         case storage::Error::SERIALIZATION_ERROR:
-          throw QueryRuntimeException(kSerializationErrorMessage);
+          throw QueryRuntimeException("Can't serialize due to concurrent operations.");
         case storage::Error::PROPERTIES_DISABLED:
           throw QueryRuntimeException("Can't set property because properties on edges are disabled.");
         case storage::Error::VERTEX_HAS_EDGES:
@@ -2113,7 +2092,7 @@ void SetPropertiesOnRecord(TRecordAccessor *record, const TypedValue &rhs, SetPr
           case storage::Error::DELETED_OBJECT:
             throw QueryRuntimeException("Trying to set properties on a deleted graph element.");
           case storage::Error::SERIALIZATION_ERROR:
-            throw QueryRuntimeException(kSerializationErrorMessage);
+            throw QueryRuntimeException("Can't serialize due to concurrent operations.");
           case storage::Error::PROPERTIES_DISABLED:
             throw QueryRuntimeException("Can't set property because properties on edges are disabled.");
           case storage::Error::VERTEX_HAS_EDGES:
@@ -2228,7 +2207,7 @@ bool SetLabels::SetLabelsCursor::Pull(Frame &frame, ExecutionContext &context) {
     if (maybe_value.HasError()) {
       switch (maybe_value.GetError()) {
         case storage::Error::SERIALIZATION_ERROR:
-          throw QueryRuntimeException(kSerializationErrorMessage);
+          throw QueryRuntimeException("Can't serialize due to concurrent operations.");
         case storage::Error::DELETED_OBJECT:
           throw QueryRuntimeException("Trying to set a label on a deleted node.");
         case storage::Error::VERTEX_HAS_EDGES:
@@ -2286,7 +2265,7 @@ bool RemoveProperty::RemovePropertyCursor::Pull(Frame &frame, ExecutionContext &
         case storage::Error::DELETED_OBJECT:
           throw QueryRuntimeException("Trying to remove a property on a deleted graph element.");
         case storage::Error::SERIALIZATION_ERROR:
-          throw QueryRuntimeException(kSerializationErrorMessage);
+          throw QueryRuntimeException("Can't serialize due to concurrent operations.");
         case storage::Error::PROPERTIES_DISABLED:
           throw QueryRuntimeException(
               "Can't remove property because properties on edges are "
@@ -2357,7 +2336,7 @@ bool RemoveLabels::RemoveLabelsCursor::Pull(Frame &frame, ExecutionContext &cont
     if (maybe_value.HasError()) {
       switch (maybe_value.GetError()) {
         case storage::Error::SERIALIZATION_ERROR:
-          throw QueryRuntimeException(kSerializationErrorMessage);
+          throw QueryRuntimeException("Can't serialize due to concurrent operations.");
         case storage::Error::DELETED_OBJECT:
           throw QueryRuntimeException("Trying to remove labels from a deleted node.");
         case storage::Error::VERTEX_HAS_EDGES:
@@ -3623,7 +3602,7 @@ std::unordered_map<std::string, int64_t> CallProcedure::GetAndResetCounters() {
 namespace {
 
 void CallCustomProcedure(const std::string_view &fully_qualified_procedure_name, const mgp_proc &proc,
-                         const std::vector<Expression *> &args, mgp_graph &graph, ExpressionEvaluator *evaluator,
+                         const std::vector<Expression *> &args, const mgp_graph &graph, ExpressionEvaluator *evaluator,
                          utils::MemoryResource *memory, std::optional<size_t> memory_limit, mgp_result *result) {
   static_assert(std::uses_allocator_v<mgp_value, utils::Allocator<mgp_value>>,
                 "Expected mgp_value to use custom allocator and makes STL "
@@ -3755,7 +3734,6 @@ class CallProcedureCursor : public Cursor {
       mgp_graph graph{context.db_accessor, graph_view, &context};
       CallCustomProcedure(self_->procedure_name_, *proc, self_->arguments_, graph, &evaluator, memory, memory_limit,
                           &result_);
-
       // Reset result_.signature to nullptr, because outside of this scope we
       // will no longer hold a lock on the `module`. If someone were to reload
       // it, the pointer would be invalid.
@@ -3782,7 +3760,7 @@ class CallProcedureCursor : public Cursor {
       std::string_view field_name(self_->result_fields_[i]);
       auto result_it = values.find(field_name);
       if (result_it == values.end()) {
-        throw QueryRuntimeException("Procedure '{}' did not yield a record with '{}' field.", self_->procedure_name_,
+        throw QueryRuntimeException("Procedure '{}' does not yield a record with '{}' field.", self_->procedure_name_,
                                     field_name);
       }
       frame[self_->result_symbols_[i]] = result_it->second;

src/query/plan/operator.lcp

@@ -8,7 +8,6 @@
 #include <unordered_map>
 #include <unordered_set>
 #include <utility>
-#include <variant>
 #include <vector>
 
 #include "query/common.hpp"
@@ -292,17 +291,16 @@ can serve as inputs to others and thus a sequence of operations is formed.")
   cpp<#)
 
 (lcp:define-class once (logical-operator)
-  ((symbols "std::vector<Symbol>" :scope :public))
+  ()
   (:documentation
    "A logical operator whose Cursor returns true on the first Pull
 and false on every following Pull.")
   (:public
    #>cpp
-   Once(std::vector<Symbol> symbols = {}) : symbols_{std::move(symbols)} {}
    DEFVISITABLE(HierarchicalLogicalOperatorVisitor);
    UniqueCursorPtr MakeCursor(utils::MemoryResource *) const override;
    std::vector<Symbol> ModifiedSymbols(const SymbolTable &) const override {
-     return symbols_;
+     return {};
    }
 
    bool HasSingleInput() const override;
@@ -349,54 +347,15 @@ and false on every following Pull.")
   }
   cpp<#)
 
-(defun clone-variant-properties (source destination)
-  #>cpp
-    if (const auto *props = std::get_if<PropertiesMapList>(&${source})) {
-      auto &destination_props = std::get<PropertiesMapList>(${destination});
-      destination_props.resize(props->size());
-      for (auto i0 = 0; i0 < props->size(); ++i0) {
-        {
-          storage::PropertyId first1 = (*props)[i0].first;
-          Expression *second2;
-          second2 = (*props)[i0].second ? (*props)[i0].second->Clone(storage) : nullptr;
-          destination_props[i0] = std::make_pair(std::move(first1), std::move(second2));
-        }
-      }
-    } else {
-      ${destination} = std::get<ParameterLookup *>(${source})->Clone(storage);
-    }
-  cpp<#)
-
-#>cpp
-using PropertiesMapList = std::vector<std::pair<storage::PropertyId, Expression *>>;
-cpp<#
-
 (lcp:define-struct node-creation-info ()
   ((symbol "Symbol")
    (labels "std::vector<storage::LabelId>")
-   (properties "std::variant<PropertiesMapList, ParameterLookup *>"
+   (properties "std::vector<std::pair<storage::PropertyId, Expression *>>"
                :slk-save #'slk-save-properties
-               :slk-load #'slk-load-properties
-               :clone #'clone-variant-properties))
+               :slk-load #'slk-load-properties))
   (:serialize (:slk :save-args '((helper "query::plan::LogicalOperator::SaveHelper *"))
                     :load-args '((helper "query::plan::LogicalOperator::SlkLoadHelper *"))))
-  (:clone :args '((storage "AstStorage *")))
-  (:public
-   #>cpp
-  NodeCreationInfo() = default;
-
-  NodeCreationInfo(
-      Symbol symbol, std::vector<storage::LabelId> labels,
-      std::variant<PropertiesMapList, ParameterLookup *> properties)
-      : symbol{std::move(symbol)}, labels{std::move(labels)}, properties{std::move(properties)} {};
-
-  NodeCreationInfo(Symbol symbol, std::vector<storage::LabelId> labels,
-                    PropertiesMapList properties)
-      : symbol{std::move(symbol)}, labels{std::move(labels)}, properties{std::move(properties)} {};
-
-  NodeCreationInfo(Symbol symbol, std::vector<storage::LabelId> labels, ParameterLookup* properties)
-      : symbol{std::move(symbol)}, labels{std::move(labels)}, properties{properties} {};
-  cpp<#))
+  (:clone :args '((storage "AstStorage *"))))
 
 (lcp:define-class create-node (logical-operator)
   ((input "std::shared_ptr<LogicalOperator>" :scope :public
@@ -415,7 +374,7 @@ cpp<#
    "Operator for creating a node.
 
 This op is used both for creating a single node (`CREATE` statement without
-a preceding `MATCH`), or multiple nodes (`MATCH ... CREATE` or
+a preceeding `MATCH`), or multiple nodes (`MATCH ... CREATE` or
 `CREATE (), () ...`).
 
 @sa CreateExpand")
@@ -461,31 +420,14 @@ a preceding `MATCH`), or multiple nodes (`MATCH ... CREATE` or
 
 (lcp:define-struct edge-creation-info ()
   ((symbol "Symbol")
-   (properties "std::variant<PropertiesMapList, ParameterLookup *>"
+   (properties "std::vector<std::pair<storage::PropertyId, Expression *>>"
                :slk-save #'slk-save-properties
-               :slk-load #'slk-load-properties
-               :clone #'clone-variant-properties)
+               :slk-load #'slk-load-properties)
    (edge-type "::storage::EdgeTypeId")
    (direction "::EdgeAtom::Direction" :initval "EdgeAtom::Direction::BOTH"))
   (:serialize (:slk :save-args '((helper "query::plan::LogicalOperator::SaveHelper *"))
                     :load-args '((helper "query::plan::LogicalOperator::SlkLoadHelper *"))))
-  (:clone :args '((storage "AstStorage *")))
-  (:public
-   #>cpp
-    EdgeCreationInfo() = default;
-
-    EdgeCreationInfo(Symbol symbol, std::variant<PropertiesMapList, ParameterLookup *> properties,
-      storage::EdgeTypeId edge_type, EdgeAtom::Direction direction)
-    : symbol{std::move(symbol)}, properties{std::move(properties)}, edge_type{edge_type}, direction{direction} {};
-
-    EdgeCreationInfo(Symbol symbol, PropertiesMapList properties,
-      storage::EdgeTypeId edge_type, EdgeAtom::Direction direction)
-    : symbol{std::move(symbol)}, properties{std::move(properties)}, edge_type{edge_type}, direction{direction} {};
-
-    EdgeCreationInfo(Symbol symbol, ParameterLookup* properties,
-      storage::EdgeTypeId edge_type, EdgeAtom::Direction direction)
-    : symbol{std::move(symbol)}, properties{properties}, edge_type{edge_type}, direction{direction} {};
-  cpp<#))
+  (:clone :args '((storage "AstStorage *"))))
 
 (lcp:define-class create-expand (logical-operator)
   ((node-info "NodeCreationInfo" :scope :public