Issues in Embedding QLever

[raphael10-collab]

My objective is to use QLever as Embedded DB.

Building phase:

 (base) raphy@raohy:~/qlever$ cmake -B build

-- The C compiler identification is GNU 13.3.0
-- The CXX compiler identification is GNU 13.3.0
-- Detecting C compiler ABI info
-- Detecting C compiler ABI info - done
-- Check for working C compiler: /usr/bin/cc - skipped
-- Detecting C compile features
-- Detecting C compile features - done
-- Detecting CXX compiler ABI info
-- Detecting CXX compiler ABI info - done
-- Check for working CXX compiler: /usr/bin/c++ - skipped
-- Detecting CXX compile features
-- Detecting CXX compile features - done
-- Performing Test CMAKE_HAVE_LIBC_PTHREAD
-- Performing Test CMAKE_HAVE_LIBC_PTHREAD - Success
-- Found Threads: TRUE
-- Found ICU: /usr/local/include (found suitable version "72.1", minimum required is "60") found components: uc i18n
-- Found PkgConfig: /usr/bin/pkg-config (found version "1.8.1")
-- Checking for module 'jemalloc'
--   Found jemalloc, version 0.0.0_0
-- Found OpenSSL: /usr/lib/x86_64-linux-gnu/libcrypto.so (found version "3.0.13")
-- Performing Test ABSL_INTERNAL_AT_LEAST_CXX17
-- Performing Test ABSL_INTERNAL_AT_LEAST_CXX17 - Success
-- Performing Test ABSL_INTERNAL_AT_LEAST_CXX20
-- Performing Test ABSL_INTERNAL_AT_LEAST_CXX20 - Success
CMake Deprecation Warning at build/_deps/fsst-src/CMakeLists.txt:1 (cmake_minimum_required):
  Compatibility with CMake < 3.10 will be removed from a future version of
  CMake.

  Update the VERSION argument <min> value.  Or, use the <min>...<max> syntax
  to tell CMake that the project requires at least <min> but has been updated
  to work with policies introduced by <max> or earlier.


-- Performing Test COMPILER_SUPPORTS_MARCH_NATIVE
-- Performing Test COMPILER_SUPPORTS_MARCH_NATIVE - Success
-- The following REQUIRED packages have been found:

 * ICU (required version >= 60)
 * boost_iostreams (required version == 1.83.0)
 * boost_program_options (required version == 1.83.0)
 * boost_url (required version == 1.83.0)
 * boost_headers (required version == 1.83.0)
 * boost_container (required version == 1.83.0)
 * Boost (required version >= 1.81)
 * OpenSSL
 * Threads

-- The following features have been disabled:

 * SHARED_LIBS, builds shared libraries instead of static.
 * PYTHON, provides python interface to S2
 * S2_USE_SYSTEM_INCLUDES, Silence warnings in s2 headers by marking them as SYSTEM includes.

-- Using the multi-header code from /home/raphy/qlever/build/_deps/nlohmann-json-src/include/
CMake Warning at build/_deps/antlr-src/runtime/Cpp/CMakeLists.txt:12 (message):
  Build type not set, falling back to Release mode.

   To specify build type use:
   -DCMAKE_BUILD_TYPE=<mode> where <mode> is Debug or Release.


-- Building without demo. To enable demo build use: -DWITH_DEMO=True
CMake Deprecation Warning at build/_deps/range-v3-src/CMakeLists.txt:8 (cmake_minimum_required):
  Compatibility with CMake < 3.10 will be removed from a future version of
  CMake.

  Update the VERSION argument <min> value.  Or, use the <min>...<max> syntax
  to tell CMake that the project requires at least <min> but has been updated
  to work with policies introduced by <max> or earlier.


-- Found Git: /usr/bin/git (found version "2.43.0")
-- [range-v3]: C++ std=2a
-- Performing Test RANGES_HAS_CXXSTD
-- Performing Test RANGES_HAS_CXXSTD - Success
-- Performing Test RANGES_HAS_WALL
-- Performing Test RANGES_HAS_WALL - Success
-- Performing Test RANGES_HAS_WEXTRA
-- Performing Test RANGES_HAS_WEXTRA - Success
-- Performing Test RANGES_HAS_WERROR
-- Performing Test RANGES_HAS_WERROR - Success
-- Performing Test RANGES_HAS_FDIAGNOSTIC_SHOW_TEMPLATE_TREE
-- Performing Test RANGES_HAS_FDIAGNOSTIC_SHOW_TEMPLATE_TREE - Success
-- Performing Test RANGES_HAS_FTEMPLATE_BACKTRACE_LIMIT
-- Performing Test RANGES_HAS_FTEMPLATE_BACKTRACE_LIMIT - Success
-- Performing Test RANGES_HAS_FMACRO_BACKTRACE_LIMIT
-- Performing Test RANGES_HAS_FMACRO_BACKTRACE_LIMIT - Failed
-- Performing Test RANGES_HAS_OMIT_FRAME_POINTER
-- Performing Test RANGES_HAS_OMIT_FRAME_POINTER - Success
-- Performing Test RANGES_HAS_OFAST
-- Performing Test RANGES_HAS_OFAST - Success
-- Performing Test RANGES_HAS_STRICT_ALIASING
-- Performing Test RANGES_HAS_STRICT_ALIASING - Success
-- Performing Test RANGES_HAS_STRICT_VTABLE_POINTERS
-- Performing Test RANGES_HAS_STRICT_VTABLE_POINTERS - Failed
-- Performing Test RANGES_HAS_FAST_MATH
-- Performing Test RANGES_HAS_FAST_MATH - Success
-- Performing Test RANGES_HAS_VECTORIZE
-- Performing Test RANGES_HAS_VECTORIZE - Failed
-- Performing Test RANGES_HAS_SIZED_DEALLOCATION
-- Performing Test RANGES_HAS_SIZED_DEALLOCATION - Success
-- Performing Test RANGES_HAS_MARCH_NATIVE
-- Performing Test RANGES_HAS_MARCH_NATIVE - Success
-- Performing Test RANGES_HAS_MTUNE_NATIVE
-- Performing Test RANGES_HAS_MTUNE_NATIVE - Success
-- Performing Test RANGE_V3_ALIGNED_NEW_PROBE
-- Performing Test RANGE_V3_ALIGNED_NEW_PROBE - Success
-- Performing Test RANGE_V3_HAS_FCONCEPTS
-- Performing Test RANGE_V3_HAS_FCONCEPTS - Success
CMake Deprecation Warning at build/_deps/spatialjoin-src/CMakeLists.txt:1 (cmake_minimum_required):
  Compatibility with CMake < 3.10 will be removed from a future version of
  CMake.

  Update the VERSION argument <min> value.  Or, use the <min>...<max> syntax
  to tell CMake that the project requires at least <min> but has been updated
  to work with policies introduced by <max> or earlier.


-- Found BZip2: /usr/lib/x86_64-linux-gnu/libbz2.so (found version "1.0.8")
-- Looking for BZ2_bzCompressInit
-- Looking for BZ2_bzCompressInit - found
-- Found ZLIB: /usr/lib/x86_64-linux-gnu/libz.so (found version "1.3")
-- ---
-- CXX_FLAGS are :   -Wall -Wextra
-- CXX_FLAGS_RELEASE are : -O3 -DNDEBUG -O3
-- CXX_FLAGS_DEBUG are : -g
-- IMPORTANT: Make sure you have selected the desired CMAKE_BUILD_TYPE
-- CMAKE_BUILD_TYPE is Release
-- ---
-- The tests are split over multiple binaries
-- Configuring done (29.4s)
-- Generating done (2.0s)
-- Build files have been written to: /home/raphy/qlever/build
(base) raphy@raohy:~/qlever$

Compilation phase:

(base) raphy@raohy:~/qlever$ cmake --build build/ -j7

[ 98%] Linking CXX executable SpatialJoinPrefilterTest
[ 98%] Built target SpatialJoinPrefilterTest
[ 98%] Building CXX object test/engine/CMakeFiles/StripColumnsTest.dir/StripColumnsTest.cpp.o
[ 98%] Linking CXX executable DescribeTest
[ 98%] Built target DescribeTest
[ 98%] Building CXX object test/engine/CMakeFiles/NamedResultCacheTest.dir/NamedResultCacheTest.cpp.o
[ 98%] Linking CXX executable SpatialJoinAlgorithmsTest
[ 98%] Built target SpatialJoinAlgorithmsTest
[ 98%] Building CXX object test/engine/CMakeFiles/TestExplicitIdTableOperation.dir/TestExplicitIdTableOperation.cpp.o
[ 98%] Linking CXX executable ExistsJoinTest
[ 98%] Built target ExistsJoinTest
[ 98%] Building CXX object test/engine/idTable/CMakeFiles/CompressedExternalIdTableTest.dir/CompressedExternalIdTableTest.cpp.o
[ 98%] Linking CXX executable NeutralOptionalTest
[ 98%] Linking CXX executable GroupConcatExpressionTest
[ 98%] Built target NeutralOptionalTest
[ 98%] Building CXX object test/parser/CMakeFiles/ParallelBufferTest.dir/ParallelBufferTest.cpp.o
[ 98%] Built target GroupConcatExpressionTest
[ 98%] Building CXX object test/parser/CMakeFiles/LiteralOrIriTest.dir/LiteralOrIriTest.cpp.o
[ 98%] Linking CXX executable ParallelBufferTest
[ 98%] Built target ParallelBufferTest
[ 98%] Building CXX object test/parser/CMakeFiles/PayloadVariablesTest.dir/PayloadVariablesTest.cpp.o
[ 98%] Linking CXX executable StripColumnsTest
[ 98%] Built target StripColumnsTest
[ 98%] Building CXX object test/parser/CMakeFiles/QuadTest.dir/QuadTest.cpp.o
[ 98%] Linking CXX executable OptionalJoinTest
[ 98%] Linking CXX executable NamedResultCacheTest
[ 98%] Built target OptionalJoinTest
[ 98%] Building CXX object test/parser/CMakeFiles/BlankNodeExpressionTest.dir/BlankNodeExpressionTest.cpp.o
[ 98%] Built target NamedResultCacheTest
[ 98%] Building CXX object test/parser/CMakeFiles/PropertyPathTest.dir/PropertyPathTest.cpp.o
[ 98%] Linking CXX executable TestExplicitIdTableOperation
[ 98%] Built target TestExplicitIdTableOperation
[ 98%] Building CXX object test/parser/CMakeFiles/UpdateTriplesTest.dir/UpdateTriplesTest.cpp.o
[ 98%] Linking CXX executable PayloadVariablesTest
[ 98%] Built target PayloadVariablesTest
[ 98%] Building CXX object test/parser/CMakeFiles/NamedCachedResultTest.dir/NamedCachedResultTest.cpp.o
[ 98%] Linking CXX executable PropertyPathTest
[ 98%] Built target PropertyPathTest
[ 98%] Building CXX object test/parser/CMakeFiles/SparqlAntlrParserTest.dir/SparqlAntlrParserTest.cpp.o
[ 98%] Linking CXX executable LiteralOrIriTest
[ 98%] Built target LiteralOrIriTest
[ 98%] Building CXX object test/parser/CMakeFiles/SparqlAntlrParserUpdateTest.dir/SparqlAntlrParserUpdateTest.cpp.o
[ 98%] Linking CXX executable UpdateTriplesTest
[ 98%] Built target UpdateTriplesTest
[ 98%] Building CXX object test/parser/CMakeFiles/SparqlAntlrParserExpressionTest.dir/SparqlAntlrParserExpressionTest.cpp.o
[ 98%] Linking CXX executable BlankNodeExpressionTest
[ 98%] Linking CXX executable NamedCachedResultTest
[ 98%] Built target BlankNodeExpressionTest
[ 99%] Building CXX object test/parser/data/CMakeFiles/GraphTermTest.dir/GraphTermTest.cpp.o
[ 99%] Built target NamedCachedResultTest
[ 99%] Building CXX object test/index/CMakeFiles/PatternCreatorTest.dir/PatternCreatorTest.cpp.o
[ 99%] Linking CXX executable CompressedExternalIdTableTest
[ 99%] Built target CompressedExternalIdTableTest
[ 99%] Building CXX object test/index/CMakeFiles/ScanSpecificationTest.dir/ScanSpecificationTest.cpp.o
[ 99%] Linking CXX executable QuadTest
[ 99%] Built target QuadTest
[ 99%] Building CXX object test/index/vocabulary/CMakeFiles/CompressedVocabularyTest.dir/CompressedVocabularyTest.cpp.o
[ 99%] Linking CXX executable GraphTermTest
[ 99%] Built target GraphTermTest
[ 99%] Building CXX object test/index/vocabulary/CMakeFiles/GeoVocabularyTest.dir/GeoVocabularyTest.cpp.o
[ 99%] Linking CXX executable ScanSpecificationTest
[ 99%] Built target ScanSpecificationTest
[ 99%] Building CXX object test/index/vocabulary/CMakeFiles/SplitVocabularyTest.dir/SplitVocabularyTest.cpp.o
[100%] Linking CXX executable PatternCreatorTest
[100%] Built target PatternCreatorTest
[100%] Building CXX object test/joinAlgorithms/CMakeFiles/JoinColumnMappingTest.dir/JoinColumnMappingTest.cpp.o
[100%] Linking CXX executable GeoVocabularyTest
[100%] Built target GeoVocabularyTest
[100%] Building CXX object CMakeFiles/ServerMain.dir/src/ServerMain.cpp.o
[100%] Linking CXX executable SplitVocabularyTest
[100%] Built target SplitVocabularyTest
[100%] Linking CXX executable CompressedVocabularyTest
[100%] Built target CompressedVocabularyTest
[100%] Linking CXX executable SparqlAntlrParserUpdateTest
[100%] Built target SparqlAntlrParserUpdateTest
[100%] Linking CXX executable JoinColumnMappingTest
[100%] Built target JoinColumnMappingTest
[100%] Linking CXX executable SparqlAntlrParserExpressionTest
[100%] Built target SparqlAntlrParserExpressionTest
[100%] Linking CXX executable ServerMain
[100%] Built target ServerMain
[100%] Linking CXX executable SparqlAntlrParserTest
[100%] Built target SparqlAntlrParserTest
(base) raphy@raohy:~/qlever$ 

Copied into my project folder the include subfolder of QLever :

(base) raphy@raohy:~/qlever/build$ cp -a _deps/ bin/ lib/ IndexBuilderMain LibQLeverExample PrintIndexVersionMain ServerMain spatialjoin VocabularyMergerMain src/ /home/raphy/Grasp/src/QLever

(base) raphy@raohy:~/qlever/build$ cp -a _deps/ bin/ lib/ IndexBuilderMain LibQLeverExample PrintIndexVersionMain ServerMain spatialjoin VocabularyMergerMain /home/raphy/Grasp/src/QLever

(base) raphy@raohy:~/qlever$ cp -a src /home/raphy/Grasp/src/QLever/

(base) raphy@raohy:~/qlever/build/_deps/range-v3-src/include$ cp -a concepts/ meta/ range/ std /home/raphy/Grasp/src/QLever/src

(base) raphy@raohy:~/qlever/build/_deps/ctre-src/include$ cp -a * /home/raphy/Grasp/src/QLever/src/

(base) raphy@raohy:~/qlever/build/_deps/fsst-src$ cp -i *.h /home/raphy/Grasp/src/QLever/src
(base) raphy@raohy:~/qlever/build/_deps/fsst-src$ cp -i *.cpp /home/raphy/Grasp/src/QLever/src
(base) raphy@raohy:~/qlever/build/_deps/fsst-src$ cp -a paper/ /home/raphy/Grasp/src/QLever/src

(base) raphy@raohy:~/qlever/build/_deps/spatialjoin-src/src$ cp -a spatialjoin/ /home/raphy/Grasp/src/QLever/src/

(base) raphy@raohy:~/qlever/build/_deps/re2-src$ cp -a re2/ /home/raphy/Grasp/src/QLever/src/

(base) raphy@raohy:~/qlever/build/_deps/s2-src/src$ cp -a s2 /home/raphy/Grasp/src/QLever/src

I've put in a different subfolder /src/triple/store the files Qlever.h and Qlever.cpp of this example: https://github.com/ad-freiburg/qlever/tree/master/src/libqlever :

Grasp/src/triplestore$ ls -lah
total 28K
drwxrwxr-x  2 raphy raphy 4,0K ott 22 15:24 .
drwxrwxr-x 84 raphy raphy 4,0K ott 22 14:30 ..
-rw-rw-r--  1 raphy raphy 7,8K ott 22 14:36 Qlever.cpp
-rw-rw-r--  1 raphy raphy 9,6K ott 22 14:26 Qlever.h

Compiling I get a bunch of compilation errors:

compilationerrors.txt

In Grasp/CMakeLists.txt :

cmake_minimum_required(VERSION 3.15...3.31)

set(CMAKE_CXX_STANDARD 20)
set(CMAKE_CXX_STANDARD_REQUIRED ON)

target_link_directories(${PROJECT_NAME} PUBLIC
    ./src/QLever/lib
)

target_include_directories(${PROJECT_NAME} PUBLIC
    ./src/QLever/src
)

target_link_libraries (${PROJECT_NAME} PUBLIC
    qlever
    engine
    util
    index
    parser
    absl::strings
)

Other Info:

OS: Ubuntu 24.04

gcc (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0

During compilation phase:

    (base) raphy@raohy:~$ free -m
                         total        used        free      shared  buff/cache   available
    Mem:           32038       12165       13067          49        7310       19873
    Swap:            975         850         125

[raphael10-collab]

I created a brand new public github repo to test QLever as Embedded Database:

CppPrjWithQlever : https://github.com/raphael10-collab/CppPrjWithQLever

(base) raphy@raohy:~/CppPrjWithQLever$ cmake -B build -Wno-dev
-- The C compiler identification is GNU 13.3.0
-- The CXX compiler identification is GNU 13.3.0
-- Detecting C compiler ABI info
-- Detecting C compiler ABI info - done
-- Check for working C compiler: /usr/bin/cc - skipped
-- Detecting C compile features
-- Detecting C compile features - done
-- Detecting CXX compiler ABI info
-- Detecting CXX compiler ABI info - done
-- Check for working CXX compiler: /usr/bin/c++ - skipped
-- Detecting CXX compile features
-- Detecting CXX compile features - done
Cloning into 'qlever-src'...
HEAD is now at 228a5ce8 Merge branch 'lazy-minus' into lazy-exists-join-and-minus
-- Performing Test CMAKE_HAVE_LIBC_PTHREAD
-- Performing Test CMAKE_HAVE_LIBC_PTHREAD - Success
-- Found Threads: TRUE
-- Found ICU: /usr/local/include (found suitable version "72.1", minimum required is "60") found components: uc i18n
-- Found PkgConfig: /usr/bin/pkg-config (found version "1.8.1")
-- Checking for module 'jemalloc'
--   Found jemalloc, version 0.0.0_0
-- Found OpenSSL: /usr/lib/x86_64-linux-gnu/libcrypto.so (found version "3.0.13")
-- Performing Test ABSL_INTERNAL_AT_LEAST_CXX17
-- Performing Test ABSL_INTERNAL_AT_LEAST_CXX17 - Success
-- Performing Test ABSL_INTERNAL_AT_LEAST_CXX20
-- Performing Test ABSL_INTERNAL_AT_LEAST_CXX20 - Success
-- Performing Test COMPILER_SUPPORTS_MARCH_NATIVE
-- Performing Test COMPILER_SUPPORTS_MARCH_NATIVE - Success
-- The following REQUIRED packages have been found:

 * ICU (required version >= 60)
 * boost_iostreams (required version == 1.83.0)
 * boost_program_options (required version == 1.83.0)
 * boost_headers (required version == 1.83.0)
 * boost_url (required version == 1.83.0)
 * Boost (required version >= 1.81)
 * OpenSSL
 * Threads

-- The following features have been disabled:

 * SHARED_LIBS, builds shared libraries instead of static.
 * PYTHON, provides python interface to S2
 * S2_USE_SYSTEM_INCLUDES, Silence warnings in s2 headers by marking them as SYSTEM includes.

-- Using the multi-header code from /home/raphy/CppPrjWithQLever/build/_deps/nlohmann-json-src/include/
CMake Warning at build/_deps/antlr-src/runtime/Cpp/CMakeLists.txt:12 (message):
  Build type not set, falling back to Release mode.

   To specify build type use:
   -DCMAKE_BUILD_TYPE=<mode> where <mode> is Debug or Release.


-- Building without demo. To enable demo build use: -DWITH_DEMO=True
-- Found Git: /usr/bin/git (found version "2.43.0")
-- [range-v3]: C++ std=2a
-- Performing Test RANGES_HAS_CXXSTD
-- Performing Test RANGES_HAS_CXXSTD - Success
-- Performing Test RANGES_HAS_WALL
-- Performing Test RANGES_HAS_WALL - Success
-- Performing Test RANGES_HAS_WEXTRA
-- Performing Test RANGES_HAS_WEXTRA - Success
-- Performing Test RANGES_HAS_WERROR
-- Performing Test RANGES_HAS_WERROR - Success
-- Performing Test RANGES_HAS_FDIAGNOSTIC_SHOW_TEMPLATE_TREE
-- Performing Test RANGES_HAS_FDIAGNOSTIC_SHOW_TEMPLATE_TREE - Success
-- Performing Test RANGES_HAS_FTEMPLATE_BACKTRACE_LIMIT
-- Performing Test RANGES_HAS_FTEMPLATE_BACKTRACE_LIMIT - Success
-- Performing Test RANGES_HAS_FMACRO_BACKTRACE_LIMIT
-- Performing Test RANGES_HAS_FMACRO_BACKTRACE_LIMIT - Failed
-- Performing Test RANGES_HAS_OMIT_FRAME_POINTER
-- Performing Test RANGES_HAS_OMIT_FRAME_POINTER - Success
-- Performing Test RANGES_HAS_OFAST
-- Performing Test RANGES_HAS_OFAST - Success
-- Performing Test RANGES_HAS_STRICT_ALIASING
-- Performing Test RANGES_HAS_STRICT_ALIASING - Success
-- Performing Test RANGES_HAS_STRICT_VTABLE_POINTERS
-- Performing Test RANGES_HAS_STRICT_VTABLE_POINTERS - Failed
-- Performing Test RANGES_HAS_FAST_MATH
-- Performing Test RANGES_HAS_FAST_MATH - Success
-- Performing Test RANGES_HAS_VECTORIZE
-- Performing Test RANGES_HAS_VECTORIZE - Failed
-- Performing Test RANGES_HAS_SIZED_DEALLOCATION
-- Performing Test RANGES_HAS_SIZED_DEALLOCATION - Success
-- Performing Test RANGES_HAS_MARCH_NATIVE
-- Performing Test RANGES_HAS_MARCH_NATIVE - Success
-- Performing Test RANGES_HAS_MTUNE_NATIVE
-- Performing Test RANGES_HAS_MTUNE_NATIVE - Success
-- Performing Test RANGE_V3_ALIGNED_NEW_PROBE
-- Performing Test RANGE_V3_ALIGNED_NEW_PROBE - Success
-- Performing Test RANGE_V3_HAS_FCONCEPTS
-- Performing Test RANGE_V3_HAS_FCONCEPTS - Success
-- Found BZip2: /usr/lib/x86_64-linux-gnu/libbz2.so (found version "1.0.8")
-- Looking for BZ2_bzCompressInit
-- Looking for BZ2_bzCompressInit - found
-- Found ZLIB: /usr/lib/x86_64-linux-gnu/libz.so (found version "1.3")
-- ---
-- CXX_FLAGS are :   -Wall -Wextra 
-- CXX_FLAGS_RELEASE are : -O3 -DNDEBUG -O3
-- CXX_FLAGS_DEBUG are : -g
-- IMPORTANT: Make sure you have selected the desired CMAKE_BUILD_TYPE
-- CMAKE_BUILD_TYPE is Release
-- ---
-- The tests are split over multiple binaries
-- Configuring done (35.1s)
-- Generating done (1.8s)
-- Build files have been written to: /home/raphy/CppPrjWithQLever/build
(base) raphy@raohy:~/CppPrjWithQLever$ 

In the compilation phase I get this kind of errors:

(base) raphy@raohy:~/CppPrjWithQLever$ cmake --build build/
[  0%] Building CXX object CMakeFiles/CppPrjWithQLever.dir/src/LibQLeverExample.cpp.o
In file included from /home/raphy/CppPrjWithQLever/./src/util/MemorySize/MemorySize.h:19,
                 from /home/raphy/CppPrjWithQLever/src/libqlever/Qlever.h:10,
                 from /home/raphy/CppPrjWithQLever/src/LibQLeverExample.cpp:9:
/home/raphy/CppPrjWithQLever/./src/backports/algorithm.h:48:22: error: ‘views’ is not a namespace-name
   48 | using namespace std::views;
      |                      ^~~~~
In file included from /home/raphy/CppPrjWithQLever/./src/util/MemorySize/MemorySize.h:25:
/home/raphy/CppPrjWithQLever/./src/util/ConstexprUtils.h: In function ‘constexpr std::array<_Tp, _Nm> ad_utility::integerToArray(Int, Int)’:
/home/raphy/CppPrjWithQLever/./src/util/ConstexprUtils.h:216:36: error: ‘reverse’ is not a member of ‘ql::views’
  216 |   for (auto& el : res | ql::views::reverse) {
      |                                    ^~~~~~~
/home/raphy/CppPrjWithQLever/./src/util/ConstexprUtils.h:216:36: note: suggested alternatives:
In file included from /usr/include/c++/13/algorithm:73,
                 from /home/raphy/CppPrjWithQLever/./src/absl/strings/str_cat.h:90,
                 from /home/raphy/CppPrjWithQLever/./src/util/MemorySize/MemorySize.h:11:
/usr/include/c++/13/pstl/glue_algorithm_defs.h:249:1: note:   ‘std::reverse’
  249 | reverse(_ExecutionPolicy&& __exec, _BidirectionalIterator __first, _BidirectionalIterator __last);
      | ^~~~~~~
In file included from /home/raphy/CppPrjWithQLever/./src/range/v3/action/action.hpp:19,
                 from /home/raphy/CppPrjWithQLever/./src/range/v3/action.hpp:17,
                 from /home/raphy/CppPrjWithQLever/./src/range/v3/all.hpp:17,
                 from /home/raphy/CppPrjWithQLever/./src/backports/algorithm.h:10:
/home/raphy/CppPrjWithQLever/./src/meta/meta.hpp:3000:11: note:   ‘meta::reverse’
 3000 |     using reverse = _t<detail::reverse_<L>>;
      |           ^~~~~~~
In file included from /home/raphy/CppPrjWithQLever/./src/range/v3/range_fwd.hpp:25,
                 from /home/raphy/CppPrjWithQLever/./src/range/v3/action/action.hpp:21:
/home/raphy/CppPrjWithQLever/./src/range/v3/algorithm/reverse.hpp:80:21: note:   ‘ranges::reverse’
   80 |     RANGES_FUNC_END(reverse)
      |                     ^~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/algorithm/reverse.hpp:80:5: note: in expansion of macro ‘RANGES_FUNC_END’
   80 |     RANGES_FUNC_END(reverse)
      |     ^~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:63:
/usr/include/c++/13/bits/ranges_algo.h:1292:33: note:   ‘std::ranges::reverse’
 1292 |   inline constexpr __reverse_fn reverse{};
      |                                 ^~~~~~~
/home/raphy/CppPrjWithQLever/./src/meta/meta.hpp:3007:15: note:   ‘meta::lazy::reverse’
 3007 |         using reverse = defer<reverse, L>;
      |               ^~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/view/reverse.hpp:166:58: note:   ‘ranges::views::reverse’
  166 |         RANGES_INLINE_VARIABLE(view_closure<reverse_fn>, reverse)
      |                                                          ^~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/action/reverse.hpp:48:60: note:   ‘ranges::actions::reverse’
   48 |         RANGES_INLINE_VARIABLE(action_closure<reverse_fn>, reverse)
      |                                                            ^~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/algorithm/reverse.hpp:80:21: note:   ‘ranges::reverse’
   80 |     RANGES_FUNC_END(reverse)
      |                     ^~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/algorithm/reverse.hpp:80:5: note: in expansion of macro ‘RANGES_FUNC_END’
   80 |     RANGES_FUNC_END(reverse)
      |     ^~~~~~~~~~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/view/reverse.hpp:166:58: note:   ‘ranges::views::reverse’
  166 |         RANGES_INLINE_VARIABLE(view_closure<reverse_fn>, reverse)
      |                                                          ^~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
In file included from /home/raphy/CppPrjWithQLever/./src/engine/Result.h:15,
                 from /home/raphy/CppPrjWithQLever/./src/engine/QueryExecutionContext.h:14,
                 from /home/raphy/CppPrjWithQLever/./src/engine/Operation.h:14,
                 from /home/raphy/CppPrjWithQLever/./src/engine/ExplicitIdTableOperation.h:11,
                 from /home/raphy/CppPrjWithQLever/./src/engine/NamedResultCache.h:10,
                 from /home/raphy/CppPrjWithQLever/src/libqlever/Qlever.h:17:
/home/raphy/CppPrjWithQLever/./src/engine/LocalVocab.h: In member function ‘void LocalVocab::mergeWith(const R&)’:
/home/raphy/CppPrjWithQLever/./src/engine/LocalVocab.h:122:22: error: ‘filter’ has not been declared in ‘ql::views’
  122 |     using ql::views::filter;
      |                      ^~~~~~
/home/raphy/CppPrjWithQLever/./src/engine/LocalVocab.h:134:39: error: there are no arguments to ‘filter’ that depend on a template parameter, so a declaration of ‘filter’ must be available [-fpermissive]
  134 |     for (const auto& vocab : vocabs | filter(std::not_fn(&LocalVocab::empty))) {
      |                                       ^~~~~~
/home/raphy/CppPrjWithQLever/./src/engine/LocalVocab.h:134:39: note: (if you use ‘-fpermissive’, G++ will accept your code, but allowing the use of an undeclared name is deprecated)
/home/raphy/CppPrjWithQLever/./src/engine/LocalVocab.h:146:20: error: ‘transform’ is not a member of ‘ql::views’
  146 |         ql::views::transform([](const LocalVocab& vocab) -> const auto& {
      |                    ^~~~~~~~~
/home/raphy/CppPrjWithQLever/./src/engine/LocalVocab.h:146:20: note: suggested alternatives:
/usr/include/c++/13/pstl/glue_algorithm_defs.h:162:1: note:   ‘std::transform’
  162 | transform(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
      | ^~~~~~~~~
/home/raphy/CppPrjWithQLever/./src/meta/meta.hpp:1854:11: note:   ‘meta::transform’
 1854 |     using transform = _t<detail::transform_<Args...>>;
      |           ^~~~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/algorithm/transform.hpp:207:21: note:   ‘ranges::transform’
  207 |     RANGES_FUNC_END(transform)
      |                     ^~~~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/algorithm/transform.hpp:207:5: note: in expansion of macro ‘RANGES_FUNC_END’
  207 |     RANGES_FUNC_END(transform)
      |     ^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/ranges_algo.h:772:35: note:   ‘std::ranges::transform’
  772 |   inline constexpr __transform_fn transform{};
      |                                   ^~~~~~~~~
/home/raphy/CppPrjWithQLever/./src/meta/meta.hpp:1865:15: note:   ‘meta::lazy::transform’
 1865 |         using transform = defer<transform, Args...>;
      |               ^~~~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/view/transform.hpp:594:46: note:   ‘ranges::views::transform’
  594 |         RANGES_INLINE_VARIABLE(transform_fn, transform)
      |                                              ^~~~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/action/transform.hpp:58:46: note:   ‘ranges::actions::transform’
   58 |         RANGES_INLINE_VARIABLE(transform_fn, transform)
      |                                              ^~~~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/algorithm/transform.hpp:207:21: note:   ‘ranges::transform’
  207 |     RANGES_FUNC_END(transform)
      |                     ^~~~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/algorithm/transform.hpp:207:5: note: in expansion of macro ‘RANGES_FUNC_END’
  207 |     RANGES_FUNC_END(transform)
      |     ^~~~~~~~~~~~~~~
In file included from /usr/include/boost/hana/basic_tuple.hpp:27,
                 from /usr/include/boost/hana/tuple.hpp:16,
                 from /home/raphy/CppPrjWithQLever/./src/util/ConstexprMap.h:8,
                 from /home/raphy/CppPrjWithQLever/./src/util/MemorySize/MemorySize.h:24:
/usr/include/boost/hana/fwd/transform.hpp:53:54: note:   ‘boost::hana::transform’
   53 |     BOOST_HANA_INLINE_VARIABLE constexpr transform_t transform{};
      |                                                      ^~~~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/view/transform.hpp:594:46: note:   ‘ranges::views::transform’
  594 |         RANGES_INLINE_VARIABLE(transform_fn, transform)
      |                                              ^~~~~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
In file included from /home/raphy/CppPrjWithQLever/./src/engine/idTable/IdTable.h:28,
                 from /home/raphy/CppPrjWithQLever/./src/engine/Result.h:17:
/home/raphy/CppPrjWithQLever/./src/util/Views.h: In function ‘ad_utility::InputRangeTypeErased<BlockType> ad_utility::uniqueBlockView(SortedBlockView)’:
/home/raphy/CppPrjWithQLever/./src/util/Views.h:124:25: error: ‘filter’ is not a member of ‘ql::views’
  124 |     decltype(ql::views::filter(view_,
      |                         ^~~~~~
/home/raphy/CppPrjWithQLever/./src/util/Views.h:124:25: note: suggested alternatives:
/home/raphy/CppPrjWithQLever/./src/meta/meta.hpp:2820:11: note:   ‘meta::filter’
 2820 |     using filter = join<transform<L, detail::filter_<Pred>>>;
      |           ^~~~~~
/home/raphy/CppPrjWithQLever/./src/meta/meta.hpp:2827:15: note:   ‘meta::lazy::filter’
 2827 |         using filter = defer<filter, L, Fn>;
      |               ^~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/view/filter.hpp:150:43: note:   ‘ranges::views::filter’
  150 |         RANGES_INLINE_VARIABLE(filter_fn, filter)
      |                                           ^~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/view/filter.hpp:157:68: note:   ‘ranges::cpp20::views::filter’
  157 |             RANGES_INLINE_VARIABLE(ranges::views::cpp20_filter_fn, filter)
      |                                                                    ^~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
/home/raphy/CppPrjWithQLever/./src/util/Views.h:124:25: error: ‘filter’ is not a member of ‘ql::views’
  124 |     decltype(ql::views::filter(view_,
      |                         ^~~~~~
/home/raphy/CppPrjWithQLever/./src/util/Views.h:124:25: note: suggested alternatives:
/home/raphy/CppPrjWithQLever/./src/meta/meta.hpp:2820:11: note:   ‘meta::filter’
 2820 |     using filter = join<transform<L, detail::filter_<Pred>>>;
      |           ^~~~~~
/home/raphy/CppPrjWithQLever/./src/meta/meta.hpp:2827:15: note:   ‘meta::lazy::filter’
 2827 |         using filter = defer<filter, L, Fn>;
      |               ^~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/view/filter.hpp:150:43: note:   ‘ranges::views::filter’
  150 |         RANGES_INLINE_VARIABLE(filter_fn, filter)
      |                                           ^~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/view/filter.hpp:157:68: note:   ‘ranges::cpp20::views::filter’
  157 |             RANGES_INLINE_VARIABLE(ranges::views::cpp20_filter_fn, filter)
      |                                                                    ^~~~~~
/home/raphy/CppPrjWithQLever/./src/range/v3/detail/config.hpp:579:27: note: in definition of macro ‘RANGES_INLINE_VARIABLE’
  579 |     inline constexpr type name{};          \
      |                           ^~~~
/home/raphy/CppPrjWithQLever/./src/util/Views.h:126:31: error: no match for call to ‘(const std::ranges::__cust_access::_Begin) (int&)’
  126 |     decltype(ql::ranges::begin(nonEmptyView_)) iter_;
      |              ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/string_view:48,
                 from /usr/include/c++/13/bits/basic_string.h:47,
                 from /usr/include/c++/13/string:54,
                 from /usr/include/c++/13/bits/locale_classes.h:40,
                 from /usr/include/c++/13/bits/ios_base.h:41,
                 from /usr/include/c++/13/ios:44,
                 from /usr/include/c++/13/ostream:40,
                 from /usr/include/c++/13/iostream:41,
                 from /home/raphy/CppPrjWithQLever/src/LibQLeverExample.cpp:7:
/usr/include/c++/13/bits/ranges_base.h:115:9: note: candidate: ‘template<class _Tp>  requires (__maybe_borrowed_range<_Tp>) && ((is_array_v<typename std::remove_reference<_Tp>::type>) || (__member_begin<_Tp>) || (__adl_begin<_Tp>)) constexpr auto std::ranges::__cust_access::_Begin::operator()(_Tp&&) const’
  115 |         operator()[[nodiscard]](_Tp&& __t) const noexcept(_S_noexcept<_Tp&>())
      |         ^~~~~~~~
/usr/include/c++/13/bits/ranges_base.h:115:9: note:   template argument deduction/substitution failed:
/usr/include/c++/13/bits/ranges_base.h:115:9: note: constraints not satisfied
/home/raphy/CppPrjWithQLever/./src/util/Views.h: In substitution of ‘template<class _Tp>  requires (__maybe_borrowed_range<_Tp>) && ((is_array_v<typename std::remove_reference<_Tp>::type>) || (__member_begin<_Tp>) || (__adl_begin<_Tp>)) constexpr auto std::ranges::__cust_access::_Begin::operator()(_Tp&&) const [with _Tp = int&]’:
/home/raphy/CppPrjWithQLever/./src/util/Views.h:126:31:   required from here
/usr/include/c++/13/bits/ranges_base.h:115:2:   required by the constraints of ‘template<class _Tp>  requires (__maybe_borrowed_range<_Tp>) && ((is_array_v<typename std::remove_reference<_Tp>::type>) || (__member_begin<_Tp>) || (__adl_begin<_Tp>)) constexpr auto std::ranges::__cust_access::_Begin::operator()(_Tp&&) const’
/usr/include/c++/13/bits/ranges_base.h:113:11: note: no operand of the disjunction is satisfied
  112 |         requires is_array_v<remove_reference_t<_Tp>> || __member_begin<_Tp>
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  113 |           || __adl_begin<_Tp>
      |           ^~~~~~~~~~~~~~~~~~~
cc1plus: note: set ‘-fconcepts-diagnostics-depth=’ to at least 2 for more detail
/home/raphy/CppPrjWithQLever/./src/util/Views.h:126:31: error: no match for call to ‘(const std::ranges::__cust_access::_Begin) (int&)’
  126 |     decltype(ql::ranges::begin(nonEmptyView_)) iter_;

@RobinTF @hannahbast Can you please have a look at the repo I on purpose created to debug these errors: https://github.com/raphael10-collab/CppPrjWithQLever.git ?

Thank you in advance

[RobinTF]

@raphael10-collab I think your setup is unnecessarily complicated. It seems like you're pulling in all dependencies manually (in addition to using CMake), which is probably the reason the code fails for you. Please have a look at the documentation of FetchContent. Using that you should ideally be able to just define QLever as a dependency for your project and all the dependencies get downloaded automatically (and those that don't need to be installed via the package manager of your linux distro).

[raphael10-collab]

I've been using CMakeLists.txt and its FetchContent ,for example zlib, dlib, graaflib, usearch (just to name a few), and only for QLever I'm experiencing such issues

The following FetchContent s work just fine : they fetch the library and its dependencies :

zlib :

FetchContent_Declare(
    zlib
    URL https://github.com/madler/zlib/archive/refs/tags/v1.3.1.tar.gz
    DOWNLOAD_EXTRACT_TIMESTAMP FALSE
    FIND_PACKAGE_ARGS
)

dlib :

FetchContent_Declare(
    dlib
    URL https://github.com/davisking/dlib/archive/refs/tags/v20.0.tar.gz
    DOWNLOAD_EXTRACT_TIMESTAMP FALSE
    FIND_PACKAGE_ARGS
)
FetchContent_MakeAvailable(dlib)

graaflib :

FetchContent_Declare(
        graaflib
        GIT_REPOSITORY https://github.com/bobluppes/graaf.git
        GIT_TAG main
)
FetchContent_MakeAvailable(graaflib)

usearch :

FetchContent_Declare(
    usearch
    URL https://github.com/unum-cloud/USearch/archive/refs/tags/v2.21.1.tar.gz
    DOWNLOAD_EXTRACT_TIMESTAMP FALSE
    FIND_PACKAGE_ARGS
)
FetchContent_MakeAvailable(usearch)

What is wrong with :

FetchContent_Declare(
    qlever
    GIT_REPOSITORY https://github.com/ad-freiburg/qlever.git
    GIT_TAG iswc-69
)
FetchContent_MakeAvailable(qlever)

?

@RobinTF can you please give me a simple plain, working, CMakeLists.txt which fetches QLever and its dependencies?

[hannahbast]

@raphael10-collab I am not quite sure I understand your problem. QLever's CMakeList.txt already does compile LibQleverExample.cpp and that does work in all our GitHub workflows. Does that work for you, too?

[raphael10-collab]

@hannahbast no. it does not work for me.

What's wrong with this FetchContent :

FetchContent_Declare(
    qlever
    GIT_REPOSITORY https://github.com/ad-freiburg/qlever.git
    GIT_TAG iswc-69
)
FetchContent_MakeAvailable(qlever)


target_link_libraries (${PROJECT_NAME} PUBLIC
    qlever
)

being similar to the following, working fine, FetchContent's :

zlib :

FetchContent_Declare(
    zlib
    URL https://github.com/madler/zlib/archive/refs/tags/v1.3.1.tar.gz
    DOWNLOAD_EXTRACT_TIMESTAMP FALSE
    FIND_PACKAGE_ARGS
)

dlib :

FetchContent_Declare(
    dlib
    URL https://github.com/davisking/dlib/archive/refs/tags/v20.0.tar.gz
    DOWNLOAD_EXTRACT_TIMESTAMP FALSE
    FIND_PACKAGE_ARGS
)
FetchContent_MakeAvailable(dlib)

graaflib :

FetchContent_Declare(
        graaflib
        GIT_REPOSITORY https://github.com/bobluppes/graaf.git
        GIT_TAG main
)
FetchContent_MakeAvailable(graaflib)

usearch :

FetchContent_Declare(
    usearch
    URL https://github.com/unum-cloud/USearch/archive/refs/tags/v2.21.1.tar.gz
    DOWNLOAD_EXTRACT_TIMESTAMP FALSE
    FIND_PACKAGE_ARGS
)
FetchContent_MakeAvailable(usearch)

and :

target_link_libraries (${PROJECT_NAME} PUBLIC
    dlib
    Graaf::Graaf
    usearch
)

?

[hannahbast]

@raphael10-collab It's kind of hard to debug what you are doing on your machine when you are doing something else. Have you tried the exact sequence of commands from the Dockerfile:

mkdir build && cd build
cmake -DCMAKE_BUILD_TYPE=Release -DLOGLEVEL=INFO -DUSE_PARALLEL=true -D_NO_TIMING_TESTS=ON -GNinja ..
ninja

[RobinTF]

@raphael10-collab I believe your FetchContent is fine, but I don't get why you put all the other stuff in there. You don't need to copy our code into your src folder. FetchContent does already fetch it for you and now you have it twice, and your local variant does not build

[raphael10-collab]

@hannahbast

I had to add -DCMAKE_POLICY_VERSION_MINIMUM=3.5 :

(base) raphy@raohy:~/CppPrjWithQLever/build$ cmake -DCMAKE_BUILD_TYPE=Release -DLOGLEVEL=INFO -DUSE_PARALLEL=true -D_NO_TIMING_TESTS=ON -DCMAKE_POLICY_VERSION_MINIMUM=3.5 -GNinja ..
-- The C compiler identification is GNU 13.3.0
-- The CXX compiler identification is GNU 13.3.0
-- Detecting C compiler ABI info
-- Detecting C compiler ABI info - done
-- Check for working C compiler: /usr/bin/cc - skipped
-- Detecting C compile features
-- Detecting C compile features - done
-- Detecting CXX compiler ABI info
-- Detecting CXX compiler ABI info - done
-- Check for working CXX compiler: /usr/bin/c++ - skipped
-- Detecting CXX compile features
-- Detecting CXX compile features - done
Cloning into 'qlever-src'...
HEAD is now at 228a5ce8 Merge branch 'lazy-minus' into lazy-exists-join-and-minus
-- Performing Test CMAKE_HAVE_LIBC_PTHREAD
-- Performing Test CMAKE_HAVE_LIBC_PTHREAD - Success
-- Found Threads: TRUE
-- Found ICU: /usr/local/include (found suitable version "72.1", minimum required is "60") found components: uc i18n
-- Found PkgConfig: /usr/bin/pkg-config (found version "1.8.1")
-- Checking for module 'jemalloc'
--   Found jemalloc, version 5.3.0_0
-- Found OpenSSL: /usr/lib/x86_64-linux-gnu/libcrypto.so (found version "3.0.13")
-- Found OpenMP_C: -fopenmp (found version "4.5")
-- Found OpenMP_CXX: -fopenmp (found version "4.5")
-- Found OpenMP: TRUE (found version "4.5")
-- Performing Test ABSL_INTERNAL_AT_LEAST_CXX17
-- Performing Test ABSL_INTERNAL_AT_LEAST_CXX17 - Success
-- Performing Test ABSL_INTERNAL_AT_LEAST_CXX20
-- Performing Test ABSL_INTERNAL_AT_LEAST_CXX20 - Success
CMake Deprecation Warning at build/_deps/fsst-src/CMakeLists.txt:1 (cmake_minimum_required):
  Compatibility with CMake < 3.10 will be removed from a future version of
  CMake.

  Update the VERSION argument <min> value.  Or, use the <min>...<max> syntax
  to tell CMake that the project requires at least <min> but has been updated
  to work with policies introduced by <max> or earlier.


-- Performing Test COMPILER_SUPPORTS_MARCH_NATIVE
-- Performing Test COMPILER_SUPPORTS_MARCH_NATIVE - Success
-- The following REQUIRED packages have been found:

 * ICU (required version >= 60)
 * boost_iostreams (required version == 1.83.0)
 * boost_program_options (required version == 1.83.0)
 * boost_headers (required version == 1.83.0)
 * boost_url (required version == 1.83.0)
 * Boost (required version >= 1.81)
 * OpenSSL
 * Threads

-- The following features have been disabled:

 * SHARED_LIBS, builds shared libraries instead of static.
 * PYTHON, provides python interface to S2
 * S2_USE_SYSTEM_INCLUDES, Silence warnings in s2 headers by marking them as SYSTEM includes.

-- Using the multi-header code from /home/raphy/CppPrjWithQLever/build/_deps/nlohmann-json-src/include/
-- Building without demo. To enable demo build use: -DWITH_DEMO=True
CMake Deprecation Warning at build/_deps/range-v3-src/CMakeLists.txt:8 (cmake_minimum_required):
  Compatibility with CMake < 3.10 will be removed from a future version of
  CMake.

  Update the VERSION argument <min> value.  Or, use the <min>...<max> syntax
  to tell CMake that the project requires at least <min> but has been updated
  to work with policies introduced by <max> or earlier.


-- Found Git: /usr/bin/git (found version "2.43.0")
-- [range-v3]: C++ std=2a
-- Performing Test RANGES_HAS_CXXSTD
-- Performing Test RANGES_HAS_CXXSTD - Success
-- Performing Test RANGES_HAS_WALL
-- Performing Test RANGES_HAS_WALL - Success
-- Performing Test RANGES_HAS_WEXTRA
-- Performing Test RANGES_HAS_WEXTRA - Success
-- Performing Test RANGES_HAS_WERROR
-- Performing Test RANGES_HAS_WERROR - Success
-- Performing Test RANGES_HAS_FDIAGNOSTIC_SHOW_TEMPLATE_TREE
-- Performing Test RANGES_HAS_FDIAGNOSTIC_SHOW_TEMPLATE_TREE - Success
-- Performing Test RANGES_HAS_FTEMPLATE_BACKTRACE_LIMIT
-- Performing Test RANGES_HAS_FTEMPLATE_BACKTRACE_LIMIT - Success
-- Performing Test RANGES_HAS_FMACRO_BACKTRACE_LIMIT
-- Performing Test RANGES_HAS_FMACRO_BACKTRACE_LIMIT - Failed
-- Performing Test RANGES_HAS_OMIT_FRAME_POINTER
-- Performing Test RANGES_HAS_OMIT_FRAME_POINTER - Success
-- Performing Test RANGES_HAS_OFAST
-- Performing Test RANGES_HAS_OFAST - Success
-- Performing Test RANGES_HAS_STRICT_ALIASING
-- Performing Test RANGES_HAS_STRICT_ALIASING - Success
-- Performing Test RANGES_HAS_STRICT_VTABLE_POINTERS
-- Performing Test RANGES_HAS_STRICT_VTABLE_POINTERS - Failed
-- Performing Test RANGES_HAS_FAST_MATH
-- Performing Test RANGES_HAS_FAST_MATH - Success
-- Performing Test RANGES_HAS_VECTORIZE
-- Performing Test RANGES_HAS_VECTORIZE - Failed
-- Performing Test RANGES_HAS_SIZED_DEALLOCATION
-- Performing Test RANGES_HAS_SIZED_DEALLOCATION - Success
-- Performing Test RANGES_HAS_MARCH_NATIVE
-- Performing Test RANGES_HAS_MARCH_NATIVE - Success
-- Performing Test RANGES_HAS_MTUNE_NATIVE
-- Performing Test RANGES_HAS_MTUNE_NATIVE - Success
-- Performing Test RANGE_V3_ALIGNED_NEW_PROBE
-- Performing Test RANGE_V3_ALIGNED_NEW_PROBE - Success
-- Performing Test RANGE_V3_HAS_FCONCEPTS
-- Performing Test RANGE_V3_HAS_FCONCEPTS - Success
CMake Deprecation Warning at build/_deps/spatialjoin-src/CMakeLists.txt:1 (cmake_minimum_required):
  Compatibility with CMake < 3.10 will be removed from a future version of
  CMake.

  Update the VERSION argument <min> value.  Or, use the <min>...<max> syntax
  to tell CMake that the project requires at least <min> but has been updated
  to work with policies introduced by <max> or earlier.


-- Found BZip2: /usr/lib/x86_64-linux-gnu/libbz2.so (found version "1.0.8")
-- Looking for BZ2_bzCompressInit
-- Looking for BZ2_bzCompressInit - found
-- Found ZLIB: /usr/lib/x86_64-linux-gnu/libz.so (found version "1.3")
-- ---
-- CXX_FLAGS are :   -Wall -Wextra  -fopenmp
-- CXX_FLAGS_RELEASE are : -O3 -DNDEBUG -O3
-- CXX_FLAGS_DEBUG are : -g
-- IMPORTANT: Make sure you have selected the desired CMAKE_BUILD_TYPE
-- CMAKE_BUILD_TYPE is Release
-- ---
-- The tests are split over multiple binaries
-- Configuring done (32.2s)
-- Generating done (1.5s)
-- Build files have been written to: /home/raphy/CppPrjWithQLever/build
(base) raphy@raohy:~/CppPrjWithQLever/build$ 

And then ninja fails :

(base) raphy@raohy:~/CppPrjWithQLever/build$ ninja
[574/1146] Building CXX object _deps/qlever-build/src/engine/CMakeFiles/engine.dir/Engine.cpp.o
In file included from /usr/include/c++/13/functional:65,
                 from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/meta/type_traits.h:39,
                 from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/base/internal/nullability_impl.h:22,
                 from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/base/nullability.h:153,
                 from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/algorithm/container.h:55,
                 from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/flat_hash_map.h:38,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/util/HashMap.h:9,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-build/src/engine/CMakeFiles/engine.dir/cmake_pch.hxx:5,
                 from <command-line>:
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 1>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 1>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘_ZN14__gnu_parallel20__parallel_partitionIN10ad_utility25IteratorForAccessOperatorIN18columnBasedIdTable7IdTableI7ValueIdLi1ESt6vectorIS5_NS1_22default_init_allocatorIS5_NS1_18AllocatorWithLimitIS5_EEEEELNS3_6IsViewE1EEENSD_14IteratorHelperINS3_16RowReferenceImpl32RowReferenceWithRestrictedAccessISD_LNS1_7IsConstE1EEEEELSH_1ENS3_3RowIS5_Li1EEENS3_12RowReferenceISD_LSH_1EEEEENS_11__binder2ndIZN6Engine4sortER7IdTableRKS6_ImSaImEEEUlRKT_RKT0_E_SL_SL_bEEEENSt15iterator_traitsISX_E15difference_typeESX_SX_S10_t._omp_fn.0’ at /usr/include/c++/13/parallel/partition.h:169:22:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘columnBasedIdTable::Row<ValueId, 1> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
In file included from /usr/include/c++/13/parallel/quicksort.h:36,
                 from /usr/include/c++/13/parallel/sort.h:48,
                 from /usr/include/c++/13/parallel/algo.h:45,
                 from /usr/include/c++/13/parallel/algorithm:37,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/global/Constants.h:242,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/global/ValueId.h:17,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/util/BlankNodeManager.h:12,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/LocalVocab.h:21,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Result.h:16,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/QueryExecutionContext.h:13,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Operation.h:13,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-build/src/engine/CMakeFiles/engine.dir/cmake_pch.hxx:6:
/usr/include/c++/13/parallel/partition.h: In function ‘_ZN14__gnu_parallel20__parallel_partitionIN10ad_utility25IteratorForAccessOperatorIN18columnBasedIdTable7IdTableI7ValueIdLi1ESt6vectorIS5_NS1_22default_init_allocatorIS5_NS1_18AllocatorWithLimitIS5_EEEEELNS3_6IsViewE1EEENSD_14IteratorHelperINS3_16RowReferenceImpl32RowReferenceWithRestrictedAccessISD_LNS1_7IsConstE1EEEEELSH_1ENS3_3RowIS5_Li1EEENS3_12RowReferenceISD_LSH_1EEEEENS_11__binder2ndIZN6Engine4sortER7IdTableRKS6_ImSaImEEEUlRKT_RKT0_E_SL_SL_bEEEENSt15iterator_traitsISX_E15difference_typeESX_SX_S10_t._omp_fn.0’:
/usr/include/c++/13/parallel/partition.h:169:36: note: object ‘<anonymous>’ of size 8
  169 |                       while (__pred(__begin[__thread_left])
      |                              ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 1>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 1>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘_ZN14__gnu_parallel20__parallel_partitionIN10ad_utility25IteratorForAccessOperatorIN18columnBasedIdTable7IdTableI7ValueIdLi1ESt6vectorIS5_NS1_22default_init_allocatorIS5_NS1_18AllocatorWithLimitIS5_EEEEELNS3_6IsViewE1EEENSD_14IteratorHelperINS3_16RowReferenceImpl32RowReferenceWithRestrictedAccessISD_LNS1_7IsConstE1EEEEELSH_1ENS3_3RowIS5_Li1EEENS3_12RowReferenceISD_LSH_1EEEEENS_11__binder2ndIZN6Engine4sortER7IdTableRKS6_ImSaImEEEUlRKT_RKT0_E_SL_SL_bEEEENSt15iterator_traitsISX_E15difference_typeESX_SX_S10_t._omp_fn.0’ at /usr/include/c++/13/parallel/partition.h:172:23:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘columnBasedIdTable::Row<ValueId, 1> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘_ZN14__gnu_parallel20__parallel_partitionIN10ad_utility25IteratorForAccessOperatorIN18columnBasedIdTable7IdTableI7ValueIdLi1ESt6vectorIS5_NS1_22default_init_allocatorIS5_NS1_18AllocatorWithLimitIS5_EEEEELNS3_6IsViewE1EEENSD_14IteratorHelperINS3_16RowReferenceImpl32RowReferenceWithRestrictedAccessISD_LNS1_7IsConstE1EEEEELSH_1ENS3_3RowIS5_Li1EEENS3_12RowReferenceISD_LSH_1EEEEENS_11__binder2ndIZN6Engine4sortER7IdTableRKS6_ImSaImEEEUlRKT_RKT0_E_SL_SL_bEEEENSt15iterator_traitsISX_E15difference_typeESX_SX_S10_t._omp_fn.0’:
/usr/include/c++/13/parallel/partition.h:172:37: note: object ‘<anonymous>’ of size 8
  172 |                       while (!__pred(__begin[__thread_right])
      |                               ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 3>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 3>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘_ZN14__gnu_parallel20__parallel_partitionIN10ad_utility25IteratorForAccessOperatorIN18columnBasedIdTable7IdTableI7ValueIdLi3ESt6vectorIS5_NS1_22default_init_allocatorIS5_NS1_18AllocatorWithLimitIS5_EEEEELNS3_6IsViewE1EEENSD_14IteratorHelperINS3_16RowReferenceImpl32RowReferenceWithRestrictedAccessISD_LNS1_7IsConstE1EEEEELSH_1ENS3_3RowIS5_Li3EEENS3_12RowReferenceISD_LSH_1EEEEENS_11__binder2ndIZN6Engine4sortER7IdTableRKS6_ImSaImEEEUlRKT_RKT0_E_SL_SL_bEEEENSt15iterator_traitsISX_E15difference_typeESX_SX_S10_t._omp_fn.0’ at /usr/include/c++/13/parallel/partition.h:169:22:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘columnBasedIdTable::Row<ValueId, 3> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘_ZN14__gnu_parallel20__parallel_partitionIN10ad_utility25IteratorForAccessOperatorIN18columnBasedIdTable7IdTableI7ValueIdLi3ESt6vectorIS5_NS1_22default_init_allocatorIS5_NS1_18AllocatorWithLimitIS5_EEEEELNS3_6IsViewE1EEENSD_14IteratorHelperINS3_16RowReferenceImpl32RowReferenceWithRestrictedAccessISD_LNS1_7IsConstE1EEEEELSH_1ENS3_3RowIS5_Li3EEENS3_12RowReferenceISD_LSH_1EEEEENS_11__binder2ndIZN6Engine4sortER7IdTableRKS6_ImSaImEEEUlRKT_RKT0_E_SL_SL_bEEEENSt15iterator_traitsISX_E15difference_typeESX_SX_S10_t._omp_fn.0’:
/usr/include/c++/13/parallel/partition.h:169:36: note: object ‘<anonymous>’ of size 24
  169 |                       while (__pred(__begin[__thread_left])
      |                              ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 3>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 3>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘_ZN14__gnu_parallel20__parallel_partitionIN10ad_utility25IteratorForAccessOperatorIN18columnBasedIdTable7IdTableI7ValueIdLi3ESt6vectorIS5_NS1_22default_init_allocatorIS5_NS1_18AllocatorWithLimitIS5_EEEEELNS3_6IsViewE1EEENSD_14IteratorHelperINS3_16RowReferenceImpl32RowReferenceWithRestrictedAccessISD_LNS1_7IsConstE1EEEEELSH_1ENS3_3RowIS5_Li3EEENS3_12RowReferenceISD_LSH_1EEEEENS_11__binder2ndIZN6Engine4sortER7IdTableRKS6_ImSaImEEEUlRKT_RKT0_E_SL_SL_bEEEENSt15iterator_traitsISX_E15difference_typeESX_SX_S10_t._omp_fn.0’ at /usr/include/c++/13/parallel/partition.h:172:23:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘columnBasedIdTable::Row<ValueId, 3> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘_ZN14__gnu_parallel20__parallel_partitionIN10ad_utility25IteratorForAccessOperatorIN18columnBasedIdTable7IdTableI7ValueIdLi3ESt6vectorIS5_NS1_22default_init_allocatorIS5_NS1_18AllocatorWithLimitIS5_EEEEELNS3_6IsViewE1EEENSD_14IteratorHelperINS3_16RowReferenceImpl32RowReferenceWithRestrictedAccessISD_LNS1_7IsConstE1EEEEELSH_1ENS3_3RowIS5_Li3EEENS3_12RowReferenceISD_LSH_1EEEEENS_11__binder2ndIZN6Engine4sortER7IdTableRKS6_ImSaImEEEUlRKT_RKT0_E_SL_SL_bEEEENSt15iterator_traitsISX_E15difference_typeESX_SX_S10_t._omp_fn.0’:
/usr/include/c++/13/parallel/partition.h:172:37: note: object ‘<anonymous>’ of size 24
  172 |                       while (!__pred(__begin[__thread_right])
      |                               ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 2>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 2>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘_ZN14__gnu_parallel20__parallel_partitionIN10ad_utility25IteratorForAccessOperatorIN18columnBasedIdTable7IdTableI7ValueIdLi2ESt6vectorIS5_NS1_22default_init_allocatorIS5_NS1_18AllocatorWithLimitIS5_EEEEELNS3_6IsViewE1EEENSD_14IteratorHelperINS3_16RowReferenceImpl32RowReferenceWithRestrictedAccessISD_LNS1_7IsConstE1EEEEELSH_1ENS3_3RowIS5_Li2EEENS3_12RowReferenceISD_LSH_1EEEEENS_11__binder2ndIZN6Engine4sortER7IdTableRKS6_ImSaImEEEUlRKT_RKT0_E_SL_SL_bEEEENSt15iterator_traitsISX_E15difference_typeESX_SX_S10_t._omp_fn.0’ at /usr/include/c++/13/parallel/partition.h:169:22:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘columnBasedIdTable::Row<ValueId, 2> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘_ZN14__gnu_parallel20__parallel_partitionIN10ad_utility25IteratorForAccessOperatorIN18columnBasedIdTable7IdTableI7ValueIdLi2ESt6vectorIS5_NS1_22default_init_allocatorIS5_NS1_18AllocatorWithLimitIS5_EEEEELNS3_6IsViewE1EEENSD_14IteratorHelperINS3_16RowReferenceImpl32RowReferenceWithRestrictedAccessISD_LNS1_7IsConstE1EEEEELSH_1ENS3_3RowIS5_Li2EEENS3_12RowReferenceISD_LSH_1EEEEENS_11__binder2ndIZN6Engine4sortER7IdTableRKS6_ImSaImEEEUlRKT_RKT0_E_SL_SL_bEEEENSt15iterator_traitsISX_E15difference_typeESX_SX_S10_t._omp_fn.0’:
/usr/include/c++/13/parallel/partition.h:169:36: note: object ‘<anonymous>’ of size 16
  169 |                       while (__pred(__begin[__thread_left])
      |                              ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 2>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 2>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘_ZN14__gnu_parallel20__parallel_partitionIN10ad_utility25IteratorForAccessOperatorIN18columnBasedIdTable7IdTableI7ValueIdLi2ESt6vectorIS5_NS1_22default_init_allocatorIS5_NS1_18AllocatorWithLimitIS5_EEEEELNS3_6IsViewE1EEENSD_14IteratorHelperINS3_16RowReferenceImpl32RowReferenceWithRestrictedAccessISD_LNS1_7IsConstE1EEEEELSH_1ENS3_3RowIS5_Li2EEENS3_12RowReferenceISD_LSH_1EEEEENS_11__binder2ndIZN6Engine4sortER7IdTableRKS6_ImSaImEEEUlRKT_RKT0_E_SL_SL_bEEEENSt15iterator_traitsISX_E15difference_typeESX_SX_S10_t._omp_fn.0’ at /usr/include/c++/13/parallel/partition.h:172:23:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘columnBasedIdTable::Row<ValueId, 2> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘_ZN14__gnu_parallel20__parallel_partitionIN10ad_utility25IteratorForAccessOperatorIN18columnBasedIdTable7IdTableI7ValueIdLi2ESt6vectorIS5_NS1_22default_init_allocatorIS5_NS1_18AllocatorWithLimitIS5_EEEEELNS3_6IsViewE1EEENSD_14IteratorHelperINS3_16RowReferenceImpl32RowReferenceWithRestrictedAccessISD_LNS1_7IsConstE1EEEEELSH_1ENS3_3RowIS5_Li2EEENS3_12RowReferenceISD_LSH_1EEEEENS_11__binder2ndIZN6Engine4sortER7IdTableRKS6_ImSaImEEEUlRKT_RKT0_E_SL_SL_bEEEENSt15iterator_traitsISX_E15difference_typeESX_SX_S10_t._omp_fn.0’:
/usr/include/c++/13/parallel/partition.h:172:37: note: object ‘<anonymous>’ of size 16
  172 |                       while (!__pred(__begin[__thread_right])
      |                               ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:25,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 1>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 1>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::Row<ValueId, 1>, bool>]’ at /usr/include/c++/13/parallel/partition.h:293:19:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘__gnu_parallel::__binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::Row<ValueId, 1>, bool> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::Row<ValueId, 1>, bool>]’:
/usr/include/c++/13/parallel/partition.h:57:37: note: at offset 16 into object ‘__pred’ of size 24
   57 |                          _Predicate __pred, _ThreadIndex __num_threads)
      |                          ~~~~~~~~~~~^~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 1>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 1>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::Row<ValueId, 1>, bool>]’ at /usr/include/c++/13/parallel/partition.h:293:19:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘columnBasedIdTable::Row<ValueId, 1> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::Row<ValueId, 1>, bool>]’:
/usr/include/c++/13/parallel/partition.h:293:26: note: object ‘<anonymous>’ of size 8
  293 |             while (__pred(__begin[__final_left])
      |                    ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:25,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 1>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 1>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::Row<ValueId, 1>, bool>]’ at /usr/include/c++/13/parallel/partition.h:298:20:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘__gnu_parallel::__binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::Row<ValueId, 1>, bool> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::Row<ValueId, 1>, bool>]’:
/usr/include/c++/13/parallel/partition.h:57:37: note: at offset 16 into object ‘__pred’ of size 24
   57 |                          _Predicate __pred, _ThreadIndex __num_threads)
      |                          ~~~~~~~~~~~^~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 1>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 1>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::Row<ValueId, 1>, bool>]’ at /usr/include/c++/13/parallel/partition.h:298:20:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘columnBasedIdTable::Row<ValueId, 1> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::Row<ValueId, 1>, bool>]’:
/usr/include/c++/13/parallel/partition.h:298:27: note: object ‘<anonymous>’ of size 8
  298 |             while (!__pred(__begin[__final_right])
      |                     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘bool __gnu_parallel::_Lexicographic<_T1, _T2, _Compare>::operator()(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) const [with _T1 = columnBasedIdTable::Row<ValueId, 1>; _T2 = long int; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:67:20,
    inlined from ‘constexpr bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>; _Iterator = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Compare = __gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/predefined_ops.h:240:23,
    inlined from ‘constexpr void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1799:20,
    inlined from ‘constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1827:36:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘std::__iterator_traits<__gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >, void>::value_type [1]’ {aka ‘std::pair<columnBasedIdTable::Row<ValueId, 1>, long int> [1]’} [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
In file included from /usr/include/c++/13/algorithm:61,
                 from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/algorithm/container.h:43:
/usr/include/c++/13/bits/stl_algo.h: In function ‘constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’:
/usr/include/c++/13/bits/stl_algo.h:1796:9: note: object ‘__val’ of size 16
 1796 |         __val = _GLIBCXX_MOVE(*__last);
      |         ^~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:25,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘bool __gnu_parallel::_Lexicographic<_T1, _T2, _Compare>::operator()(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) const [with _T1 = columnBasedIdTable::Row<ValueId, 1>; _T2 = long int; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:70:20,
    inlined from ‘constexpr bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>; _Iterator = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Compare = __gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/predefined_ops.h:240:23,
    inlined from ‘constexpr void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1799:20,
    inlined from ‘constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1827:36:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘std::__iterator_traits<__gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >, void>::value_type [1]’ {aka ‘std::pair<columnBasedIdTable::Row<ValueId, 1>, long int> [1]’} [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/bits/stl_algo.h: In function ‘constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’:
/usr/include/c++/13/bits/stl_algo.h:1796:9: note: object ‘__val’ of size 16
 1796 |         __val = _GLIBCXX_MOVE(*__last);
      |         ^~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘bool __gnu_parallel::_Lexicographic<_T1, _T2, _Compare>::operator()(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) const [with _T1 = columnBasedIdTable::Row<ValueId, 2>; _T2 = long int; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:67:20,
    inlined from ‘constexpr bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Iterator = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/predefined_ops.h:240:23,
    inlined from ‘constexpr void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1799:20,
    inlined from ‘constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1827:36:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘std::__iterator_traits<__gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >, void>::value_type [1]’ {aka ‘std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> [1]’} [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/bits/stl_algo.h: In function ‘constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’:
/usr/include/c++/13/bits/stl_algo.h:1796:9: note: object ‘__val’ of size 24
 1796 |         __val = _GLIBCXX_MOVE(*__last);
      |         ^~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:25,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘bool __gnu_parallel::_Lexicographic<_T1, _T2, _Compare>::operator()(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) const [with _T1 = columnBasedIdTable::Row<ValueId, 2>; _T2 = long int; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:70:20,
    inlined from ‘constexpr bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Iterator = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/predefined_ops.h:240:23,
    inlined from ‘constexpr void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1799:20,
    inlined from ‘constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1827:36:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘std::__iterator_traits<__gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >, void>::value_type [1]’ {aka ‘std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> [1]’} [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/bits/stl_algo.h: In function ‘constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’:
/usr/include/c++/13/bits/stl_algo.h:1796:9: note: object ‘__val’ of size 24
 1796 |         __val = _GLIBCXX_MOVE(*__last);
      |         ^~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:25,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 3>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 3>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::Row<ValueId, 3>, bool>]’ at /usr/include/c++/13/parallel/partition.h:293:19:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘__gnu_parallel::__binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::Row<ValueId, 3>, bool> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::Row<ValueId, 3>, bool>]’:
/usr/include/c++/13/parallel/partition.h:57:37: note: at offset 16 into object ‘__pred’ of size 40
   57 |                          _Predicate __pred, _ThreadIndex __num_threads)
      |                          ~~~~~~~~~~~^~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 3>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 3>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::Row<ValueId, 3>, bool>]’ at /usr/include/c++/13/parallel/partition.h:293:19:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘columnBasedIdTable::Row<ValueId, 3> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::Row<ValueId, 3>, bool>]’:
/usr/include/c++/13/parallel/partition.h:293:26: note: object ‘<anonymous>’ of size 24
  293 |             while (__pred(__begin[__final_left])
      |                    ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:25,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 3>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 3>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::Row<ValueId, 3>, bool>]’ at /usr/include/c++/13/parallel/partition.h:298:20:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘__gnu_parallel::__binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::Row<ValueId, 3>, bool> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::Row<ValueId, 3>, bool>]’:
/usr/include/c++/13/parallel/partition.h:57:37: note: at offset 16 into object ‘__pred’ of size 40
   57 |                          _Predicate __pred, _ThreadIndex __num_threads)
      |                          ~~~~~~~~~~~^~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 3>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 3>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::Row<ValueId, 3>, bool>]’ at /usr/include/c++/13/parallel/partition.h:298:20:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘columnBasedIdTable::Row<ValueId, 3> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 3, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 3>, columnBasedIdTable::Row<ValueId, 3>, bool>]’:
/usr/include/c++/13/parallel/partition.h:298:27: note: object ‘<anonymous>’ of size 24
  298 |             while (!__pred(__begin[__final_right])
      |                     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:25,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 2>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 2>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::Row<ValueId, 2>, bool>]’ at /usr/include/c++/13/parallel/partition.h:293:19:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘__gnu_parallel::__binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::Row<ValueId, 2>, bool> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::Row<ValueId, 2>, bool>]’:
/usr/include/c++/13/parallel/partition.h:57:37: note: at offset 16 into object ‘__pred’ of size 32
   57 |                          _Predicate __pred, _ThreadIndex __num_threads)
      |                          ~~~~~~~~~~~^~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 2>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 2>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::Row<ValueId, 2>, bool>]’ at /usr/include/c++/13/parallel/partition.h:293:19:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘columnBasedIdTable::Row<ValueId, 2> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::Row<ValueId, 2>, bool>]’:
/usr/include/c++/13/parallel/partition.h:293:26: note: object ‘<anonymous>’ of size 16
  293 |             while (__pred(__begin[__final_left])
      |                    ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:25,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 2>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 2>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::Row<ValueId, 2>, bool>]’ at /usr/include/c++/13/parallel/partition.h:298:20:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘__gnu_parallel::__binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::Row<ValueId, 2>, bool> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::Row<ValueId, 2>, bool>]’:
/usr/include/c++/13/parallel/partition.h:57:37: note: at offset 16 into object ‘__pred’ of size 32
   57 |                          _Predicate __pred, _ThreadIndex __num_threads)
      |                          ~~~~~~~~~~~^~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘_ResultType __gnu_parallel::__binder2nd<_Operation, _FirstArgumentType, _SecondArgumentType, _ResultType>::operator()(const _FirstArgumentType&) const [with _Operation = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _FirstArgumentType = columnBasedIdTable::Row<ValueId, 2>; _SecondArgumentType = columnBasedIdTable::Row<ValueId, 2>; _ResultType = bool]’ at /usr/include/c++/13/parallel/base.h:233:21,
    inlined from ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::Row<ValueId, 2>, bool>]’ at /usr/include/c++/13/parallel/partition.h:298:20:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘columnBasedIdTable::Row<ValueId, 2> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/partition.h: In function ‘typename std::iterator_traits<_Iterator>::difference_type __gnu_parallel::__parallel_partition(_RAIter, _RAIter, _Predicate, _ThreadIndex) [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Predicate = __binder2nd<Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::Row<ValueId, 2>, bool>]’:
/usr/include/c++/13/parallel/partition.h:298:27: note: object ‘<anonymous>’ of size 16
  298 |             while (!__pred(__begin[__final_right])
      |                     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:25,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘bool __gnu_parallel::_Lexicographic<_T1, _T2, _Compare>::operator()(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) const [with _T1 = columnBasedIdTable::Row<ValueId, 2>; _T2 = long int; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:67:20,
    inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Value = std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/predefined_ops.h:196:23,
    inlined from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:140:48,
    inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:247:23:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
In file included from /usr/include/c++/13/bits/stl_algo.h:61:
/usr/include/c++/13/bits/stl_heap.h: In function ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: object ‘__value’ of size 24
  224 |     __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
      |     ^~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:25,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘bool __gnu_parallel::_Lexicographic<_T1, _T2, _Compare>::operator()(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) const [with _T1 = columnBasedIdTable::Row<ValueId, 1>; _T2 = long int; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:67:20,
    inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Value = std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>; _Compare = __gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/predefined_ops.h:196:23,
    inlined from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 1>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:140:48,
    inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 1>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:247:23:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘std::pair<columnBasedIdTable::Row<ValueId, 1>, long int> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/bits/stl_heap.h: In function ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 1>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: object ‘__value’ of size 16
  224 |     __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
      |     ^~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:25,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘bool __gnu_parallel::_Lexicographic<_T1, _T2, _Compare>::operator()(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) const [with _T1 = columnBasedIdTable::Row<ValueId, 1>; _T2 = long int; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:67:20,
    inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Value = std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>; _Compare = __gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/predefined_ops.h:196:23,
    inlined from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 1>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:140:48,
    inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 1>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:247:23,
    inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:264:25,
    inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:425:19,
    inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1911:23,
    inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1926:27:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘std::pair<columnBasedIdTable::Row<ValueId, 1>, long int> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/bits/stl_algo.h: In function ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: object ‘__value’ of size 16
 1918 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:25,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘bool __gnu_parallel::_Lexicographic<_T1, _T2, _Compare>::operator()(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) const [with _T1 = columnBasedIdTable::Row<ValueId, 2>; _T2 = long int; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:67:20,
    inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Value = std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/predefined_ops.h:196:23,
    inlined from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:140:48,
    inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:247:23,
    inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:356:22,
    inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1635:23,
    inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1910:25,
    inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1926:27:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/bits/stl_algo.h: In function ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: object ‘__value’ of size 24
 1918 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘bool __gnu_parallel::_Lexicographic<_T1, _T2, _Compare>::operator()(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) const [with _T1 = columnBasedIdTable::Row<ValueId, 2>; _T2 = long int; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:70:20,
    inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Value = std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/predefined_ops.h:196:23,
    inlined from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:140:48,
    inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:247:23,
    inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:356:22,
    inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1635:23,
    inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1910:25,
    inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1926:27:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/bits/stl_algo.h: In function ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: object ‘__value’ of size 24
 1918 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:25,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘bool __gnu_parallel::_Lexicographic<_T1, _T2, _Compare>::operator()(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) const [with _T1 = columnBasedIdTable::Row<ValueId, 2>; _T2 = long int; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:67:20,
    inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Value = std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/predefined_ops.h:196:23,
    inlined from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:140:48,
    inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:247:23,
    inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:264:25,
    inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:425:19,
    inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1911:23,
    inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_algo.h:1926:27:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/bits/stl_algo.h: In function ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_Lexicographic<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: object ‘__value’ of size 24
 1918 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘bool __gnu_parallel::_LexicographicReverse<_T1, _T2, _Compare>::operator()(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) const [with _T1 = columnBasedIdTable::Row<ValueId, 1>; _T2 = long int; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:92:20,
    inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Value = std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>; _Compare = __gnu_parallel::_LexicographicReverse<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/predefined_ops.h:196:23,
    inlined from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 1>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<__gnu_parallel::_LexicographicReverse<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:140:48,
    inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 1>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_LexicographicReverse<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:247:23,
    inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_LexicographicReverse<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:264:25,
    inlined from ‘constexpr void std::pop_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 1>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 1>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 1>, long int> > > >; _Compare = __gnu_parallel::_LexicographicReverse<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/stl_heap.h:333:19,
    inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::pop() [with _Tp = std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>; _Sequence = std::vector<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 1>, long int> > >; _Compare = __gnu_parallel::_LexicographicReverse<columnBasedIdTable::Row<ValueId, 1>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/stl_queue.h:776:15,
    inlined from ‘void __gnu_parallel::multiseq_partition(_RanSeqs, _RanSeqs, _RankType, _RankIterator, _Compare) [with _RanSeqs = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 1>*, columnBasedIdTable::Row<ValueId, 1>*>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 1>*, columnBasedIdTable::Row<ValueId, 1>*>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 1>*, columnBasedIdTable::Row<ValueId, 1>*> > > >; _RankType = long int; _RankIterator = __gnu_cxx::__normal_iterator<columnBasedIdTable::Row<ValueId, 1>**, std::vector<columnBasedIdTable::Row<ValueId, 1>*, std::allocator<columnBasedIdTable::Row<ValueId, 1>*> > >; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:286:27,
    inlined from ‘void __gnu_parallel::_SplitConsistently<true, _RAIter, _Compare, _SortingPlacesIterator>::operator()(__gnu_parallel::_ThreadIndex, __gnu_parallel::_PMWMSSortingData<_RAIter>*, _Compare&, typename std::iterator_traits<_Iter>::difference_type) const [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _SortingPlacesIterator = columnBasedIdTable::Row<ValueId, 1>*]’ at /usr/include/c++/13/parallel/multiway_mergesort.h:153:22,
    inlined from ‘void __gnu_parallel::parallel_sort_mwms_pu(_PMWMSSortingData<_RAIter>*, _Compare&) [with bool __stable = false; bool __exact = true; _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiway_mergesort.h:348:9:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘std::pair<columnBasedIdTable::Row<ValueId, 1>, long int> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
In file included from /usr/include/c++/13/parallel/sort.h:44:
/usr/include/c++/13/parallel/multiway_mergesort.h: In function ‘void __gnu_parallel::parallel_sort_mwms_pu(_PMWMSSortingData<_RAIter>*, _Compare&) [with bool __stable = false; bool __exact = true; _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 1>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 1, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’:
/usr/include/c++/13/parallel/multiway_mergesort.h:308:5: note: object ‘__value’ of size 16
  308 |     parallel_sort_mwms_pu(_PMWMSSortingData<_RAIter>* __sd,
      |     ^~~~~~~~~~~~~~~~~~~~~
In member function ‘constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = ValueId; long unsigned int _Nm = 4]’,
    inlined from ‘const T& columnBasedIdTable::Row<T, NumColumns>::operator[](size_t) const [with T = ValueId; int NumColumns = 4]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/idTable/IdTableRow.h:70:53,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 4>; auto:157 = columnBasedIdTable::Row<ValueId, 4>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:30:20,
    inlined from ‘Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> [with auto:156 = columnBasedIdTable::Row<ValueId, 1>; auto:157 = columnBasedIdTable::Row<ValueId, 1>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/Engine.cpp:27:23,
    inlined from ‘bool __gnu_parallel::_LexicographicReverse<_T1, _T2, _Compare>::operator()(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) const [with _T1 = columnBasedIdTable::Row<ValueId, 2>; _T2 = long int; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:92:20,
    inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Value = std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_parallel::_LexicographicReverse<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/predefined_ops.h:196:23,
    inlined from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<__gnu_parallel::_LexicographicReverse<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:140:48,
    inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Distance = long int; _Tp = pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_LexicographicReverse<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:247:23,
    inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<__gnu_parallel::_LexicographicReverse<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> > >]’ at /usr/include/c++/13/bits/stl_heap.h:264:25,
    inlined from ‘constexpr void std::pop_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<columnBasedIdTable::Row<ValueId, 2>, long int>*, vector<pair<columnBasedIdTable::Row<ValueId, 2>, long int>, allocator<pair<columnBasedIdTable::Row<ValueId, 2>, long int> > > >; _Compare = __gnu_parallel::_LexicographicReverse<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/stl_heap.h:333:19,
    inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::pop() [with _Tp = std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>; _Sequence = std::vector<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> > >; _Compare = __gnu_parallel::_LexicographicReverse<columnBasedIdTable::Row<ValueId, 2>, long int, Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)> >]’ at /usr/include/c++/13/bits/stl_queue.h:776:15,
    inlined from ‘void __gnu_parallel::multiseq_partition(_RanSeqs, _RanSeqs, _RankType, _RankIterator, _Compare) [with _RanSeqs = __gnu_cxx::__normal_iterator<std::pair<columnBasedIdTable::Row<ValueId, 2>*, columnBasedIdTable::Row<ValueId, 2>*>*, std::vector<std::pair<columnBasedIdTable::Row<ValueId, 2>*, columnBasedIdTable::Row<ValueId, 2>*>, std::allocator<std::pair<columnBasedIdTable::Row<ValueId, 2>*, columnBasedIdTable::Row<ValueId, 2>*> > > >; _RankType = long int; _RankIterator = __gnu_cxx::__normal_iterator<columnBasedIdTable::Row<ValueId, 2>**, std::vector<columnBasedIdTable::Row<ValueId, 2>*, std::allocator<columnBasedIdTable::Row<ValueId, 2>*> > >; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiseq_selection.h:286:27,
    inlined from ‘void __gnu_parallel::_SplitConsistently<true, _RAIter, _Compare, _SortingPlacesIterator>::operator()(__gnu_parallel::_ThreadIndex, __gnu_parallel::_PMWMSSortingData<_RAIter>*, _Compare&, typename std::iterator_traits<_Iter>::difference_type) const [with _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>; _SortingPlacesIterator = columnBasedIdTable::Row<ValueId, 2>*]’ at /usr/include/c++/13/parallel/multiway_mergesort.h:153:22,
    inlined from ‘void __gnu_parallel::parallel_sort_mwms_pu(_PMWMSSortingData<_RAIter>*, _Compare&) [with bool __stable = false; bool __exact = true; _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’ at /usr/include/c++/13/parallel/multiway_mergesort.h:348:9:
/usr/include/c++/13/array:213:24: warning: array subscript ‘const std::array<ValueId, 4>[0]’ is partly outside array bounds of ‘std::pair<columnBasedIdTable::Row<ValueId, 2>, long int> [1]’ [-Warray-bounds=]
  213 |         return _M_elems[__n];
      |                ~~~~~~~~^
/usr/include/c++/13/parallel/multiway_mergesort.h: In function ‘void __gnu_parallel::parallel_sort_mwms_pu(_PMWMSSortingData<_RAIter>*, _Compare&) [with bool __stable = false; bool __exact = true; _RAIter = ad_utility::IteratorForAccessOperator<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>::IteratorHelper<columnBasedIdTable::RowReferenceImpl::RowReferenceWithRestrictedAccess<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >, ad_utility::IsConst::False, columnBasedIdTable::Row<ValueId, 2>, columnBasedIdTable::RowReference<columnBasedIdTable::IdTable<ValueId, 2, std::vector<ValueId, ad_utility::default_init_allocator<ValueId, ad_utility::AllocatorWithLimit<ValueId> > >, columnBasedIdTable::IsView::False>, ad_utility::IsConst::False> >; _Compare = Engine::sort(IdTable&, const std::vector<long unsigned int>&)::<lambda(const auto:156&, const auto:157&)>]’:
/usr/include/c++/13/parallel/multiway_mergesort.h:308:5: note: object ‘__value’ of size 24
  308 |     parallel_sort_mwms_pu(_PMWMSSortingData<_RAIter>* __sd,
      |     ^~~~~~~~~~~~~~~~~~~~~
[585/1146] Building CXX object _deps/qlever-build/src/engine/CMakeFiles/engine.dir/TextIndexScanForWord.cpp.o
In file included from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_map.h:26,
                 from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/flat_hash_map.h:42,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/util/HashMap.h:9,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-build/src/engine/CMakeFiles/engine.dir/cmake_pch.hxx:5,
                 from <command-line>:
In member function ‘absl::container_internal::MaybeInitializedPtr absl::container_internal::HeapOrSoo::slot_array() const’,
    inlined from ‘void* absl::container_internal::CommonFields::slot_array() const’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:1340:60,
    inlined from ‘absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::slot_type* absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::slot_array() const [with Policy = absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>; Hash = absl::hash_internal::Hash<Variable>; Eq = std::equal_to<Variable>; Alloc = std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> >]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:3983:55,
    inlined from ‘void absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::destroy_slots() [with Policy = absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>; Hash = absl::hash_internal::Hash<Variable>; Eq = std::equal_to<Variable>; Alloc = std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> >]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:3484:25,
    inlined from ‘void absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::destructor_impl() [with Policy = absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>; Hash = absl::hash_internal::Hash<Variable>; Eq = std::equal_to<Variable>; Alloc = std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> >]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:3508:18,
    inlined from ‘absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::~raw_hash_set() [with Policy = absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>; Hash = absl::hash_internal::Hash<Variable>; Eq = std::equal_to<Variable>; Alloc = std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> >]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:2792:36,
    inlined from ‘absl::container_internal::raw_hash_map<absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>, absl::hash_internal::Hash<Variable>, std::equal_to<Variable>, std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> > >::~raw_hash_map()’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_map.h:33:7,
    inlined from ‘absl::flat_hash_map<Variable, ColumnIndexAndTypeInfo>::~flat_hash_map()’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/flat_hash_map.h:124:7,
    inlined from ‘void TextIndexScanForWord::setVariableToColumnMap()’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/TextIndexScanForWord.cpp:55:30:
/home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:1288:5: warning: ‘<unnamed>.absl::flat_hash_map<Variable, ColumnIndexAndTypeInfo, absl::hash_internal::Hash<Variable>, std::equal_to<Variable>, std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> > >::<unnamed>.absl::container_internal::raw_hash_map<absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>, absl::hash_internal::Hash<Variable>, std::equal_to<Variable>, std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> > >::<unnamed>.absl::container_internal::raw_hash_set<absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>, absl::hash_internal::Hash<Variable>, std::equal_to<Variable>, std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> > >::settings_.absl::container_internal::CompressedTuple<absl::container_internal::CommonFields, absl::hash_internal::Hash<Variable>, std::equal_to<Variable>, std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> > >::<unnamed>.absl::container_internal::internal_compressed_tuple::CompressedTupleImpl<absl::container_internal::CompressedTuple<absl::container_internal::CommonFields, absl::hash_internal::Hash<Variable>, std::equal_to<Variable>, std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> > >, std::integer_sequence<long unsigned int, 0, 1, 2, 3>, true>::<unnamed>.absl::container_internal::internal_compressed_tuple::Storage<absl::container_internal::CommonFields, 0, false>::value.absl::container_internal::CommonFields::heap_or_soo_.absl::container_internal::HeapOrSoo::heap.absl::container_internal::HeapPtrs::slot_array.absl::container_internal::MaybeInitializedPtr::p’ may be used uninitialized [-Wmaybe-uninitialized]
 1288 |     ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(heap.slot_array);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/TextIndexScanForWord.cpp: In member function ‘void TextIndexScanForWord::setVariableToColumnMap()’:
/home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/TextIndexScanForWord.cpp:55:50: note: ‘<anonymous>’ declared here
   55 |   config_.variableColumns_ = VariableToColumnMap{};
      |                                                  ^
[587/1146] Building CXX object _deps/qlever-build/src/engine/CMakeFiles/engine.dir/TextIndexScanForEntity.cpp.o
In file included from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_map.h:26,
                 from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/flat_hash_map.h:42,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/util/HashMap.h:9,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-build/src/engine/CMakeFiles/engine.dir/cmake_pch.hxx:5,
                 from <command-line>:
In member function ‘absl::container_internal::MaybeInitializedPtr absl::container_internal::HeapOrSoo::slot_array() const’,
    inlined from ‘void* absl::container_internal::CommonFields::slot_array() const’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:1340:60,
    inlined from ‘absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::slot_type* absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::slot_array() const [with Policy = absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>; Hash = absl::hash_internal::Hash<Variable>; Eq = std::equal_to<Variable>; Alloc = std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> >]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:3983:55,
    inlined from ‘void absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::destroy_slots() [with Policy = absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>; Hash = absl::hash_internal::Hash<Variable>; Eq = std::equal_to<Variable>; Alloc = std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> >]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:3484:25,
    inlined from ‘void absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::destructor_impl() [with Policy = absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>; Hash = absl::hash_internal::Hash<Variable>; Eq = std::equal_to<Variable>; Alloc = std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> >]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:3508:18,
    inlined from ‘absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::~raw_hash_set() [with Policy = absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>; Hash = absl::hash_internal::Hash<Variable>; Eq = std::equal_to<Variable>; Alloc = std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> >]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:2792:36,
    inlined from ‘absl::container_internal::raw_hash_map<absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>, absl::hash_internal::Hash<Variable>, std::equal_to<Variable>, std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> > >::~raw_hash_map()’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_map.h:33:7,
    inlined from ‘absl::flat_hash_map<Variable, ColumnIndexAndTypeInfo>::~flat_hash_map()’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/flat_hash_map.h:124:7,
    inlined from ‘void TextIndexScanForEntity::setVariableToColumnMap()’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/TextIndexScanForEntity.cpp:68:30:
/home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:1288:5: warning: ‘<unnamed>.absl::flat_hash_map<Variable, ColumnIndexAndTypeInfo, absl::hash_internal::Hash<Variable>, std::equal_to<Variable>, std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> > >::<unnamed>.absl::container_internal::raw_hash_map<absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>, absl::hash_internal::Hash<Variable>, std::equal_to<Variable>, std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> > >::<unnamed>.absl::container_internal::raw_hash_set<absl::container_internal::FlatHashMapPolicy<Variable, ColumnIndexAndTypeInfo>, absl::hash_internal::Hash<Variable>, std::equal_to<Variable>, std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> > >::settings_.absl::container_internal::CompressedTuple<absl::container_internal::CommonFields, absl::hash_internal::Hash<Variable>, std::equal_to<Variable>, std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> > >::<unnamed>.absl::container_internal::internal_compressed_tuple::CompressedTupleImpl<absl::container_internal::CompressedTuple<absl::container_internal::CommonFields, absl::hash_internal::Hash<Variable>, std::equal_to<Variable>, std::allocator<std::pair<const Variable, ColumnIndexAndTypeInfo> > >, std::integer_sequence<long unsigned int, 0, 1, 2, 3>, true>::<unnamed>.absl::container_internal::internal_compressed_tuple::Storage<absl::container_internal::CommonFields, 0, false>::value.absl::container_internal::CommonFields::heap_or_soo_.absl::container_internal::HeapOrSoo::heap.absl::container_internal::HeapPtrs::slot_array.absl::container_internal::MaybeInitializedPtr::p’ may be used uninitialized [-Wmaybe-uninitialized]
 1288 |     ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(heap.slot_array);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/TextIndexScanForEntity.cpp: In member function ‘void TextIndexScanForEntity::setVariableToColumnMap()’:
/home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/TextIndexScanForEntity.cpp:68:50: note: ‘<anonymous>’ declared here
   68 |   config_.variableColumns_ = VariableToColumnMap{};
      |                                                  ^
[602/1146] Building CXX object _deps/qlever-build/src/engine/CMakeFiles/engine.dir/SpatialJoin.cpp.o
In file included from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:4283,
                 from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/core.h:5,
                 from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/Misc.h:32,
                 from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/geo/Geo.h:21,
                 from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/spatialjoin/BoxIds.h:9,
                 from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/spatialjoin/GeometryCache.h:15,
                 from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/spatialjoin/Sweeper.h:29,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/SpatialJoinAlgorithms.h:10,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/SpatialJoin.cpp:24:
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h: In instantiation of ‘fmt::v11::detail::thousands_sep_result<Char> fmt::v11::detail::thousands_sep_impl(locale_ref) [with Char = wchar_t]’:
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:1289:37:   required from here
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h:111:10: warning: possibly dangling reference to a temporary [-Wdangling-reference]
  111 |   auto&& facet = use_facet<numpunct<Char>>(loc.get<locale>());
      |          ^~~~~
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h:111:43: note: the temporary was destroyed at the end of the full expression ‘std::use_facet<__cxx11::numpunct<wchar_t> >(fmt::v11::detail::locale_ref::get() const [with Locale = std::locale]())’
  111 |   auto&& facet = use_facet<numpunct<Char>>(loc.get<locale>());
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h: In instantiation of ‘fmt::v11::detail::thousands_sep_result<Char> fmt::v11::detail::thousands_sep_impl(locale_ref) [with Char = char]’:
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:1284:41:   required from ‘fmt::v11::detail::thousands_sep_result<Char> fmt::v11::detail::thousands_sep(locale_ref) [with Char = char]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:2002:35:   required from ‘fmt::v11::detail::digit_grouping<Char>::digit_grouping(fmt::v11::detail::locale_ref, bool) [with Char = char]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:2550:21:   required from ‘constexpr OutputIt fmt::v11::detail::do_write_float(OutputIt, const DecimalFP&, const fmt::v11::format_specs&, fmt::v11::sign, locale_ref) [with Char = char; OutputIt = fmt::v11::basic_appender<char>; DecimalFP = dragonbox::decimal_fp<float>; Grouping = digit_grouping<char>]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:2613:32:   required from ‘constexpr OutputIt fmt::v11::detail::write_float(OutputIt, const DecimalFP&, const fmt::v11::format_specs&, fmt::v11::sign, locale_ref) [with Char = char; OutputIt = fmt::v11::basic_appender<char>; DecimalFP = dragonbox::decimal_fp<float>]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:3523:27:   required from ‘constexpr OutputIt fmt::v11::detail::write(OutputIt, T) [with Char = char; OutputIt = fmt::v11::basic_appender<char>; T = float; typename std::enable_if<is_fast_float<T>::value, int>::type <anonymous> = 0]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:3620:16:   required from ‘void fmt::v11::detail::default_arg_formatter<Char>::operator()(T) [with T = float; typename std::enable_if<std::integral_constant<bool, (std::is_same<T, int>::value || 1)>::value, int>::type <anonymous> = 0; Char = char]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/base.h:2454:52:   required from ‘constexpr decltype (vis(0)) fmt::v11::basic_format_arg<Context>::visit(Visitor&&) const [with Visitor = fmt::v11::detail::default_arg_formatter<char>; Context = fmt::v11::context; decltype (vis(0)) = void]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h:1454:29:   required from here
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h:111:10: warning: possibly dangling reference to a temporary [-Wdangling-reference]
  111 |   auto&& facet = use_facet<numpunct<Char>>(loc.get<locale>());
      |          ^~~~~
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h:111:43: note: the temporary was destroyed at the end of the full expression ‘std::use_facet<__cxx11::numpunct<char> >(fmt::v11::detail::locale_ref::get() const [with Locale = std::locale]())’
  111 |   auto&& facet = use_facet<numpunct<Char>>(loc.get<locale>());
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
[620/1146] Generating FileThatNeverExists.cpp, CompilationInfo.cpp
-- DATETIME_OF_COMPILATION is "mar 4 nov 2025, 09:15:46, CET"
-- GIT_HASH is "a4626c07b924b617a29ec3661dc5333a74053745"

[653/1146] Building CXX object _deps/qlever-build/src/parser/CMakeFiles/parser.dir/SparqlParserHelpers.cpp.o
In file included from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_map.h:26,
                 from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/flat_hash_map.h:42,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/util/HashMap.h:9,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/VariableToColumnMap.h:10,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/SparqlExpressionPimpl.h:11,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/SparqlExpression.h:12,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/LiteralExpression.h:10,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/AggregateExpression.h:10,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-build/src/parser/CMakeFiles/parser.dir/cmake_pch.hxx:5,
                 from <command-line>:
In member function ‘absl::container_internal::MaybeInitializedPtr absl::container_internal::HeapOrSoo::slot_array() const’,
    inlined from ‘void* absl::container_internal::CommonFields::slot_array() const’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:1340:60,
    inlined from ‘absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::slot_type* absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::slot_array() const [with Policy = absl::container_internal::FlatHashMapPolicy<std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >; Hash = absl::container_internal::StringHash; Eq = absl::container_internal::StringEq; Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> > >]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:3983:55,
    inlined from ‘void absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::destroy_slots() [with Policy = absl::container_internal::FlatHashMapPolicy<std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >; Hash = absl::container_internal::StringHash; Eq = absl::container_internal::StringEq; Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> > >]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:3484:25,
    inlined from ‘void absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::destructor_impl() [with Policy = absl::container_internal::FlatHashMapPolicy<std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >; Hash = absl::container_internal::StringHash; Eq = absl::container_internal::StringEq; Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> > >]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:3508:18,
    inlined from ‘absl::container_internal::raw_hash_set<Policy, Hash, Eq, Alloc>::~raw_hash_set() [with Policy = absl::container_internal::FlatHashMapPolicy<std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >; Hash = absl::container_internal::StringHash; Eq = absl::container_internal::StringEq; Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> > >]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:2792:36,
    inlined from ‘absl::container_internal::raw_hash_map<absl::container_internal::FlatHashMapPolicy<std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >, absl::container_internal::StringHash, absl::container_internal::StringEq, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> > > >::~raw_hash_map()’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_map.h:33:7,
    inlined from ‘absl::flat_hash_map<std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >::~flat_hash_map()’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/flat_hash_map.h:124:7,
    inlined from ‘sparqlParserHelpers::ParserAndVisitor::ParserAndVisitor(std::string, std::optional<parsedQuery::DatasetClauses>, SparqlQleverVisitor::DisableSomeChecksOnlyForTesting)’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/parser/SparqlParserHelpers.cpp:23:7:
/home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/raw_hash_set.h:1288:5: warning: ‘<unnamed>.absl::flat_hash_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, absl::container_internal::StringHash, absl::container_internal::StringEq, std::allocator<std::pair<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >::<unnamed>.absl::container_internal::raw_hash_map<absl::container_internal::FlatHashMapPolicy<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, absl::container_internal::StringHash, absl::container_internal::StringEq, std::allocator<std::pair<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >::<unnamed>.absl::container_internal::raw_hash_set<absl::container_internal::FlatHashMapPolicy<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, absl::container_internal::StringHash, absl::container_internal::StringEq, std::allocator<std::pair<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >::settings_.absl::container_internal::CompressedTuple<absl::container_internal::CommonFields, absl::container_internal::StringHash, absl::container_internal::StringEq, std::allocator<std::pair<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >::<unnamed>.absl::container_internal::internal_compressed_tuple::CompressedTupleImpl<absl::container_internal::CompressedTuple<absl::container_internal::CommonFields, absl::container_internal::StringHash, absl::container_internal::StringEq, std::allocator<std::pair<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, std::integer_sequence<long unsigned int, 0, 1, 2, 3>, true>::<unnamed>.absl::container_internal::internal_compressed_tuple::Storage<absl::container_internal::CommonFields, 0, false>::value.absl::container_internal::CommonFields::heap_or_soo_.absl::container_internal::HeapOrSoo::heap.absl::container_internal::HeapPtrs::slot_array.absl::container_internal::MaybeInitializedPtr::p’ may be used uninitialized [-Wmaybe-uninitialized]
 1288 |     ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(heap.slot_array);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/parser/SparqlParserHelpers.cpp: In constructor ‘sparqlParserHelpers::ParserAndVisitor::ParserAndVisitor(std::string, std::optional<parsedQuery::DatasetClauses>, SparqlQleverVisitor::DisableSomeChecksOnlyForTesting)’:
/home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/parser/SparqlParserHelpers.cpp:23:7: note: ‘<anonymous>’ declared here
   23 |       visitor_{{}, std::move(datasetClauses), disableSomeChecks} {
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[676/1146] Building CXX object CMakeFiles/CppPrjWithQLever.dir/src/LibQLeverExample.cpp.o
FAILED: CMakeFiles/CppPrjWithQLever.dir/src/LibQLeverExample.cpp.o 
/usr/bin/c++   -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/CppPrjWithQLever.dir/src/LibQLeverExample.cpp.o -MF CMakeFiles/CppPrjWithQLever.dir/src/LibQLeverExample.cpp.o.d -o CMakeFiles/CppPrjWithQLever.dir/src/LibQLeverExample.cpp.o -c /home/raphy/CppPrjWithQLever/src/LibQLeverExample.cpp
In file included from /home/raphy/CppPrjWithQLever/src/LibQLeverExample.cpp:9:
/home/raphy/CppPrjWithQLever/src/libqlever/Qlever.h:10:10: fatal error: util/MemorySize/MemorySize.h: No such file or directory
   10 | #include <util/MemorySize/MemorySize.h>
      |          ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
compilation terminated.
[678/1146] Building CXX object _deps/qlever-build/src/engine/CMakeFiles/engine.dir/SpatialJoinAlgorithms.cpp.o
In file included from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:4283,
                 from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/core.h:5,
                 from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/Misc.h:32,
                 from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/geo/Geo.h:21,
                 from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/spatialjoin/BoxIds.h:9,
                 from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/spatialjoin/GeometryCache.h:15,
                 from /home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/spatialjoin/Sweeper.h:29,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/SpatialJoinAlgorithms.h:10,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/SpatialJoinAlgorithms.cpp:7:
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h: In instantiation of ‘fmt::v11::detail::thousands_sep_result<Char> fmt::v11::detail::thousands_sep_impl(locale_ref) [with Char = wchar_t]’:
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:1289:37:   required from here
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h:111:10: warning: possibly dangling reference to a temporary [-Wdangling-reference]
  111 |   auto&& facet = use_facet<numpunct<Char>>(loc.get<locale>());
      |          ^~~~~
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h:111:43: note: the temporary was destroyed at the end of the full expression ‘std::use_facet<__cxx11::numpunct<wchar_t> >(fmt::v11::detail::locale_ref::get() const [with Locale = std::locale]())’
  111 |   auto&& facet = use_facet<numpunct<Char>>(loc.get<locale>());
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h: In instantiation of ‘fmt::v11::detail::thousands_sep_result<Char> fmt::v11::detail::thousands_sep_impl(locale_ref) [with Char = char]’:
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:1284:41:   required from ‘fmt::v11::detail::thousands_sep_result<Char> fmt::v11::detail::thousands_sep(locale_ref) [with Char = char]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:2002:35:   required from ‘fmt::v11::detail::digit_grouping<Char>::digit_grouping(fmt::v11::detail::locale_ref, bool) [with Char = char]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:2550:21:   required from ‘constexpr OutputIt fmt::v11::detail::do_write_float(OutputIt, const DecimalFP&, const fmt::v11::format_specs&, fmt::v11::sign, locale_ref) [with Char = char; OutputIt = fmt::v11::basic_appender<char>; DecimalFP = dragonbox::decimal_fp<float>; Grouping = digit_grouping<char>]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:2613:32:   required from ‘constexpr OutputIt fmt::v11::detail::write_float(OutputIt, const DecimalFP&, const fmt::v11::format_specs&, fmt::v11::sign, locale_ref) [with Char = char; OutputIt = fmt::v11::basic_appender<char>; DecimalFP = dragonbox::decimal_fp<float>]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:3523:27:   required from ‘constexpr OutputIt fmt::v11::detail::write(OutputIt, T) [with Char = char; OutputIt = fmt::v11::basic_appender<char>; T = float; typename std::enable_if<is_fast_float<T>::value, int>::type <anonymous> = 0]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format.h:3620:16:   required from ‘void fmt::v11::detail::default_arg_formatter<Char>::operator()(T) [with T = float; typename std::enable_if<std::integral_constant<bool, (std::is_same<T, int>::value || 1)>::value, int>::type <anonymous> = 0; Char = char]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/base.h:2454:52:   required from ‘constexpr decltype (vis(0)) fmt::v11::basic_format_arg<Context>::visit(Visitor&&) const [with Visitor = fmt::v11::detail::default_arg_formatter<char>; Context = fmt::v11::context; decltype (vis(0)) = void]’
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h:1454:29:   required from here
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h:111:10: warning: possibly dangling reference to a temporary [-Wdangling-reference]
  111 |   auto&& facet = use_facet<numpunct<Char>>(loc.get<locale>());
      |          ^~~~~
/home/raphy/CppPrjWithQLever/build/_deps/spatialjoin-src/src/util/3rdparty/fmt/format-inl.h:111:43: note: the temporary was destroyed at the end of the full expression ‘std::use_facet<__cxx11::numpunct<char> >(fmt::v11::detail::locale_ref::get() const [with Locale = std::locale]())’
  111 |   auto&& facet = use_facet<numpunct<Char>>(loc.get<locale>());
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
In file included from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/inlined_vector.h:53,
                 from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/strings/cord.h:80,
                 from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/hash_function_defaults.h:58,
                 from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/hash_container_defaults.h:19,
                 from /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/flat_hash_map.h:40,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/util/HashMap.h:9,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-build/src/engine/CMakeFiles/engine.dir/cmake_pch.hxx:5,
                 from <command-line>:
In member function ‘void absl::inlined_vector_internal::Storage<T, N, A>::MemcpyFrom(const absl::inlined_vector_internal::Storage<T, N, A>&) [with T = S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry; long unsigned int N = 16; A = std::allocator<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry>]’,
    inlined from ‘void absl::InlinedVector<T, N, A>::MoveAssignment(MemcpyPolicy, absl::InlinedVector<T, N, A>&&) [with T = S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry; long unsigned int N = 16; A = std::allocator<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry>]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/inlined_vector.h:869:24,
    inlined from ‘absl::InlinedVector<T, N, A>& absl::InlinedVector<T, N, A>::operator=(absl::InlinedVector<T, N, A>&&) [with T = S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry; long unsigned int N = 16; A = std::allocator<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry>]’ at /home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/inlined_vector.h:548:21,
    inlined from ‘std::priority_queue<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry, absl::InlinedVector<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry, 16, std::allocator<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry> >, std::less<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry> >& std::priority_queue<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry, absl::InlinedVector<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry, 16, std::allocator<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry> >, std::less<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry> >::operator=(std::priority_queue<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry, absl::InlinedVector<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry, 16, std::allocator<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry> >, std::less<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry> >&&)’ at /usr/include/c++/13/bits/stl_queue.h:498:11,
    inlined from ‘void S2ClosestPointQueryBase<Distance, Data>::FindClosestPointsOptimized() [with Distance = S2MinDistance; Data = long unsigned int]’ at /home/raphy/CppPrjWithQLever/build/_deps/s2-src/src/s2/s2closest_point_query_base.h:559:14:
/home/raphy/CppPrjWithQLever/build/_deps/abseil-src/absl/container/internal/inlined_vector.h:522:5: warning: ‘<unnamed>.std::priority_queue<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry, absl::InlinedVector<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry, 16, std::allocator<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry> >, std::less<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry> >::c.absl::InlinedVector<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry, 16, std::allocator<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry> >::storage_.absl::inlined_vector_internal::Storage<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry, 16, std::allocator<S2ClosestPointQueryBase<S2MinDistance, long unsigned int>::QueueEntry> >::data_’ may be used uninitialized [-Wmaybe-uninitialized]
  522 |     data_ = other_storage.data_;
      |     ^~~~~
In file included from /home/raphy/CppPrjWithQLever/build/_deps/s2-src/src/s2/s2closest_point_query.h:29,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/SpatialJoinAlgorithms.cpp:9:
/home/raphy/CppPrjWithQLever/build/_deps/s2-src/src/s2/s2closest_point_query_base.h: In member function ‘void S2ClosestPointQueryBase<Distance, Data>::FindClosestPointsOptimized() [with Distance = S2MinDistance; Data = long unsigned int]’:
/home/raphy/CppPrjWithQLever/build/_deps/s2-src/src/s2/s2closest_point_query_base.h:559:16: note: ‘<anonymous>’ declared here
  559 |       queue_ = CellQueue();  // Clear any remaining entries.
      |                ^~~~~~~~~~~
[682/1146] Building CXX object _deps/qlever-build/src/parser/CMakeFiles/parser.dir/sparqlParser/SparqlQleverVisitor.cpp.o
In file included from /usr/include/c++/13/format:47,
                 from /usr/include/c++/13/bits/chrono_io.h:39,
                 from /usr/include/c++/13/chrono:3370,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/global/Constants.h:10,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/global/ValueId.h:17,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/global/Id.h:10,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/VariableToColumnMap.h:8,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/SparqlExpressionPimpl.h:11,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/SparqlExpression.h:12,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/LiteralExpression.h:10,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/AggregateExpression.h:10,
                 from /home/raphy/CppPrjWithQLever/build/_deps/qlever-build/src/parser/CMakeFiles/parser.dir/cmake_pch.hxx:5,
                 from <command-line>:
In constructor ‘constexpr std::__detail::__variant::_Uninitialized<_Type, true>::_Uninitialized(std::in_place_index_t<0>, _Args&& ...) [with _Args = {ValueId}; _Type = ValueId]’,
    inlined from ‘constexpr std::__detail::__variant::_Variadic_union<_First, _Rest ...>::_Variadic_union(std::in_place_index_t<0>, _Args&& ...) [with _Args = {ValueId}; _First = ValueId; _Rest = {LocalVocabEntry}]’ at /usr/include/c++/13/variant:411:4,
    inlined from ‘constexpr void std::_Construct(_Tp*, _Args&& ...) [with _Tp = __detail::__variant::_Variadic_union<ValueId, LocalVocabEntry>; _Args = {const in_place_index_t<0>&, ValueId}]’ at /usr/include/c++/13/bits/stl_construct.h:119:7,
    inlined from ‘std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>&&)::<lambda(auto:22&&, auto:23)> mutable [with auto:22 = ValueId; auto:23 = std::integral_constant<long unsigned int, 0>]’ at /usr/include/c++/13/variant:632:23,
    inlined from ‘constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = __detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>&&)::<lambda(auto:22&&, auto:23)>; _Args = {ValueId, integral_constant<long unsigned int, 0>}]’ at /usr/include/c++/13/bits/invoke.h:61:36,
    inlined from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = __detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>&&)::<lambda(auto:22&&, auto:23)>; _Args = {ValueId, integral_constant<long unsigned int, 0>}]’ at /usr/include/c++/13/bits/invoke.h:96:40,
    inlined from ‘static constexpr decltype(auto) std::__detail::__variant::__gen_vtable_impl<std::__detail::__variant::_Multi_array<_Result_type (*)(_Visitor, _Variants ...)>, std::integer_sequence<long unsigned int, __indices ...> >::__visit_invoke(_Visitor&&, _Variants ...) [with _Result_type = std::__detail::__variant::__variant_idx_cookie; _Visitor = std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>&&)::<lambda(auto:22&&, auto:23)>&&; _Variants = {std::variant<ValueId, LocalVocabEntry>&&}; long unsigned int ...__indices = {0}]’ at /usr/include/c++/13/variant:1049:17,
    inlined from ‘constexpr decltype(auto) std::__do_visit(_Visitor&&, _Variants&& ...) [with _Result_type = __detail::__variant::__variant_idx_cookie; _Visitor = __detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>&&)::<lambda(auto:22&&, auto:23)>; _Variants = {variant<ValueId, LocalVocabEntry>}]’ at /usr/include/c++/13/variant:1815:5,
    inlined from ‘constexpr void std::__detail::__variant::__raw_idx_visit(_Visitor&&, _Variants&& ...) [with _Visitor = _Move_ctor_base<false, ValueId, LocalVocabEntry>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>&&)::<lambda(auto:22&&, auto:23)>; _Variants = {std::variant<ValueId, LocalVocabEntry>}]’ at /usr/include/c++/13/variant:183:44,
    inlined from ‘constexpr std::__detail::__variant::_Move_ctor_base<<anonymous>, _Types>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<<anonymous>, _Types>&&) [with bool <anonymous> = false; _Types = {ValueId, LocalVocabEntry}]’ at /usr/include/c++/13/variant:627:28,
    inlined from ‘constexpr std::__detail::__variant::_Copy_assign_base<<anonymous>, _Types>::_Copy_assign_base(std::__detail::__variant::_Copy_assign_base<<anonymous>, _Types>&&) [with bool <anonymous> = false; _Types = {ValueId, LocalVocabEntry}]’ at /usr/include/c++/13/variant:692:7,
    inlined from ‘constexpr std::__detail::__variant::_Move_assign_base<<anonymous>, _Types>::_Move_assign_base(std::__detail::__variant::_Move_assign_base<<anonymous>, _Types>&&) [with bool <anonymous> = false; _Types = {ValueId, LocalVocabEntry}]’ at /usr/include/c++/13/variant:746:7,
    inlined from ‘constexpr std::__detail::__variant::_Variant_base<_Types>::_Variant_base(std::__detail::__variant::_Variant_base<_Types>&&) [with _Types = {ValueId, LocalVocabEntry}]’ at /usr/include/c++/13/variant:777:7,
    inlined from ‘constexpr std::variant<_Types>::variant(std::variant<_Types>&&) [with _Types = {ValueId, LocalVocabEntry}]’ at /usr/include/c++/13/variant:1429:7,
    inlined from ‘constexpr decltype (::new(void*(0)) _Tp) std::construct_at(_Tp*, _Args&& ...) [with _Tp = variant<ValueId, LocalVocabEntry>; _Args = {variant<ValueId, LocalVocabEntry>}]’ at /usr/include/c++/13/bits/stl_construct.h:97:14,
    inlined from ‘static constexpr std::_Require<std::__and_<std::__not_<typename std::allocator_traits< <template-parameter-1-1> >::__construct_helper<_Tp, _Args>::type>, std::is_constructible<_Tp, _Args ...> > > std::allocator_traits< <template-parameter-1-1> >::_S_construct(_Alloc&, _Tp*, _Args&& ...) [with _Tp = std::variant<ValueId, LocalVocabEntry>; _Args = {std::variant<ValueId, LocalVocabEntry>}; _Alloc = ad_utility::AllocatorWithLimit<std::variant<ValueId, LocalVocabEntry> >]’ at /usr/include/c++/13/bits/alloc_traits.h:278:21,
    inlined from ‘static constexpr decltype (std::allocator_traits< <template-parameter-1-1> >::_S_construct(__a, __p, (forward<_Args>)(std::allocator_traits< <template-parameter-1-1> >::construct::__args)...)) std::allocator_traits< <template-parameter-1-1> >::construct(_Alloc&, _Tp*, _Args&& ...) [with _Tp = std::variant<ValueId, LocalVocabEntry>; _Args = {std::variant<ValueId, LocalVocabEntry>}; _Alloc = ad_utility::AllocatorWithLimit<std::variant<ValueId, LocalVocabEntry> >]’ at /usr/include/c++/13/bits/alloc_traits.h:379:16,
    inlined from ‘constexpr std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::variant<ValueId, LocalVocabEntry>}; _Tp = std::variant<ValueId, LocalVocabEntry>; _Alloc = ad_utility::AllocatorWithLimit<std::variant<ValueId, LocalVocabEntry> >]’ at /usr/include/c++/13/bits/vector.tcc:117:30,
    inlined from ‘constexpr void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::variant<ValueId, LocalVocabEntry>; _Alloc = ad_utility::AllocatorWithLimit<std::variant<ValueId, LocalVocabEntry> >]’ at /usr/include/c++/13/bits/stl_vector.h:1299:21,
    inlined from ‘sparqlExpression::detail::uuidExpression::UuidExpressionImpl<<lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(std::string_view)>(), <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()>::evaluate(sparqlExpression::EvaluationContext*) const::<lambda(size_t)>’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/UuidExpressions.h:61:55,
    inlined from ‘constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const sparqlExpression::detail::uuidExpression::UuidExpressionImpl<<lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(string_view)>(), <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()>::evaluate(sparqlExpression::EvaluationContext*) const::<lambda(size_t)>&; _Args = {long unsigned int&}]’ at /usr/include/c++/13/bits/invoke.h:61:36,
    inlined from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const sparqlExpression::detail::uuidExpression::UuidExpressionImpl<<lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(string_view)>(), <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()>::evaluate(sparqlExpression::EvaluationContext*) const::<lambda(size_t)>&; _Args = {long unsigned int&}]’ at /usr/include/c++/13/bits/invoke.h:96:40,
    inlined from ‘constexpr std::invoke_result_t<_Fn, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = const sparqlExpression::detail::uuidExpression::UuidExpressionImpl<<lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(string_view)>(), <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()>::evaluate(sparqlExpression::EvaluationContext*) const::<lambda(size_t)>&; _Args = {long unsigned int&}]’ at /usr/include/c++/13/functional:113:27,
    inlined from ‘void ad_utility::chunkedForLoop(std::size_t, std::size_t, const Action&, const ChunkOpT&) [with long unsigned int CHUNK_SIZE = 1000; Action = sparqlExpression::detail::uuidExpression::UuidExpressionImpl<<lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(std::string_view)>(), <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()>::evaluate(sparqlExpression::EvaluationContext*) const::<lambda(size_t)>; ChunkOpT = sparqlExpression::detail::uuidExpression::UuidExpressionImpl<<lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(std::string_view)>(), <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()>::evaluate(sparqlExpression::EvaluationContext*) const::<lambda()>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/util/ChunkedForLoop.h:63:20,
    inlined from ‘sparqlExpression::ExpressionResult sparqlExpression::detail::uuidExpression::UuidExpressionImpl<FuncConv, FuncKey>::evaluate(sparqlExpression::EvaluationContext*) const [with auto FuncConv = <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(std::string_view)>(); auto FuncKey = <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/UuidExpressions.h:59:37:
/usr/include/c++/13/variant:224:11: warning: ‘*(ValueId*)((char*)&<unnamed> + offsetof(std::value_type, std::variant<ValueId, LocalVocabEntry>::<unnamed>.std::__detail::__variant::_Variant_base<ValueId, LocalVocabEntry>::<unnamed>.std::__detail::__variant::_Move_assign_base<false, ValueId, LocalVocabEntry>::<unnamed>.std::__detail::__variant::_Copy_assign_base<false, ValueId, LocalVocabEntry>::<unnamed>.std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>::<unnamed>.std::__detail::__variant::_Copy_ctor_base<false, ValueId, LocalVocabEntry>::<unnamed>.std::__detail::__variant::_Variant_storage<false, ValueId, LocalVocabEntry>::_M_u))’ may be used uninitialized [-Wmaybe-uninitialized]
  224 |         : _M_storage(std::forward<_Args>(__args)...)
      |           ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/parser/sparqlParser/SparqlQleverVisitor.cpp:29:
/home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/UuidExpressions.h: In member function ‘sparqlExpression::ExpressionResult sparqlExpression::detail::uuidExpression::UuidExpressionImpl<FuncConv, FuncKey>::evaluate(sparqlExpression::EvaluationContext*) const [with auto FuncConv = <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(std::string_view)>(); auto FuncKey = <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()]’:
/home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/UuidExpressions.h:61:55: note: ‘<anonymous>’ declared here
   61 |         [&result, &uuidGen](size_t) { result.push_back(FuncConv(uuidGen())); },
      |                                       ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
In constructor ‘constexpr std::__detail::__variant::_Uninitialized<_Type, true>::_Uninitialized(std::in_place_index_t<0>, _Args&& ...) [with _Args = {ValueId}; _Type = ValueId]’,
    inlined from ‘constexpr std::__detail::__variant::_Variadic_union<_First, _Rest ...>::_Variadic_union(std::in_place_index_t<0>, _Args&& ...) [with _Args = {ValueId}; _First = ValueId; _Rest = {LocalVocabEntry}]’ at /usr/include/c++/13/variant:411:4,
    inlined from ‘constexpr void std::_Construct(_Tp*, _Args&& ...) [with _Tp = __detail::__variant::_Variadic_union<ValueId, LocalVocabEntry>; _Args = {const in_place_index_t<0>&, ValueId}]’ at /usr/include/c++/13/bits/stl_construct.h:119:7,
    inlined from ‘std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>&&)::<lambda(auto:22&&, auto:23)> mutable [with auto:22 = ValueId; auto:23 = std::integral_constant<long unsigned int, 0>]’ at /usr/include/c++/13/variant:632:23,
    inlined from ‘constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = __detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>&&)::<lambda(auto:22&&, auto:23)>; _Args = {ValueId, integral_constant<long unsigned int, 0>}]’ at /usr/include/c++/13/bits/invoke.h:61:36,
    inlined from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = __detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>&&)::<lambda(auto:22&&, auto:23)>; _Args = {ValueId, integral_constant<long unsigned int, 0>}]’ at /usr/include/c++/13/bits/invoke.h:96:40,
    inlined from ‘static constexpr decltype(auto) std::__detail::__variant::__gen_vtable_impl<std::__detail::__variant::_Multi_array<_Result_type (*)(_Visitor, _Variants ...)>, std::integer_sequence<long unsigned int, __indices ...> >::__visit_invoke(_Visitor&&, _Variants ...) [with _Result_type = std::__detail::__variant::__variant_idx_cookie; _Visitor = std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>&&)::<lambda(auto:22&&, auto:23)>&&; _Variants = {std::variant<ValueId, LocalVocabEntry>&&}; long unsigned int ...__indices = {0}]’ at /usr/include/c++/13/variant:1049:17,
    inlined from ‘constexpr decltype(auto) std::__do_visit(_Visitor&&, _Variants&& ...) [with _Result_type = __detail::__variant::__variant_idx_cookie; _Visitor = __detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>&&)::<lambda(auto:22&&, auto:23)>; _Variants = {variant<ValueId, LocalVocabEntry>}]’ at /usr/include/c++/13/variant:1815:5,
    inlined from ‘constexpr void std::__detail::__variant::__raw_idx_visit(_Visitor&&, _Variants&& ...) [with _Visitor = _Move_ctor_base<false, ValueId, LocalVocabEntry>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>&&)::<lambda(auto:22&&, auto:23)>; _Variants = {std::variant<ValueId, LocalVocabEntry>}]’ at /usr/include/c++/13/variant:183:44,
    inlined from ‘constexpr std::__detail::__variant::_Move_ctor_base<<anonymous>, _Types>::_Move_ctor_base(std::__detail::__variant::_Move_ctor_base<<anonymous>, _Types>&&) [with bool <anonymous> = false; _Types = {ValueId, LocalVocabEntry}]’ at /usr/include/c++/13/variant:627:28,
    inlined from ‘constexpr std::__detail::__variant::_Copy_assign_base<<anonymous>, _Types>::_Copy_assign_base(std::__detail::__variant::_Copy_assign_base<<anonymous>, _Types>&&) [with bool <anonymous> = false; _Types = {ValueId, LocalVocabEntry}]’ at /usr/include/c++/13/variant:692:7,
    inlined from ‘constexpr std::__detail::__variant::_Move_assign_base<<anonymous>, _Types>::_Move_assign_base(std::__detail::__variant::_Move_assign_base<<anonymous>, _Types>&&) [with bool <anonymous> = false; _Types = {ValueId, LocalVocabEntry}]’ at /usr/include/c++/13/variant:746:7,
    inlined from ‘constexpr std::__detail::__variant::_Variant_base<_Types>::_Variant_base(std::__detail::__variant::_Variant_base<_Types>&&) [with _Types = {ValueId, LocalVocabEntry}]’ at /usr/include/c++/13/variant:777:7,
    inlined from ‘constexpr std::variant<_Types>::variant(std::variant<_Types>&&) [with _Types = {ValueId, LocalVocabEntry}]’ at /usr/include/c++/13/variant:1429:7,
    inlined from ‘constexpr decltype (::new(void*(0)) _Tp) std::construct_at(_Tp*, _Args&& ...) [with _Tp = variant<ValueId, LocalVocabEntry>; _Args = {variant<ValueId, LocalVocabEntry>}]’ at /usr/include/c++/13/bits/stl_construct.h:97:14,
    inlined from ‘static constexpr std::_Require<std::__and_<std::__not_<typename std::allocator_traits< <template-parameter-1-1> >::__construct_helper<_Tp, _Args>::type>, std::is_constructible<_Tp, _Args ...> > > std::allocator_traits< <template-parameter-1-1> >::_S_construct(_Alloc&, _Tp*, _Args&& ...) [with _Tp = std::variant<ValueId, LocalVocabEntry>; _Args = {std::variant<ValueId, LocalVocabEntry>}; _Alloc = ad_utility::AllocatorWithLimit<std::variant<ValueId, LocalVocabEntry> >]’ at /usr/include/c++/13/bits/alloc_traits.h:278:21,
    inlined from ‘static constexpr decltype (std::allocator_traits< <template-parameter-1-1> >::_S_construct(__a, __p, (forward<_Args>)(std::allocator_traits< <template-parameter-1-1> >::construct::__args)...)) std::allocator_traits< <template-parameter-1-1> >::construct(_Alloc&, _Tp*, _Args&& ...) [with _Tp = std::variant<ValueId, LocalVocabEntry>; _Args = {std::variant<ValueId, LocalVocabEntry>}; _Alloc = ad_utility::AllocatorWithLimit<std::variant<ValueId, LocalVocabEntry> >]’ at /usr/include/c++/13/bits/alloc_traits.h:379:16,
    inlined from ‘constexpr std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::variant<ValueId, LocalVocabEntry>}; _Tp = std::variant<ValueId, LocalVocabEntry>; _Alloc = ad_utility::AllocatorWithLimit<std::variant<ValueId, LocalVocabEntry> >]’ at /usr/include/c++/13/bits/vector.tcc:117:30,
    inlined from ‘constexpr void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::variant<ValueId, LocalVocabEntry>; _Alloc = ad_utility::AllocatorWithLimit<std::variant<ValueId, LocalVocabEntry> >]’ at /usr/include/c++/13/bits/stl_vector.h:1299:21,
    inlined from ‘sparqlExpression::detail::uuidExpression::UuidExpressionImpl<<lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(std::string_view)>(), <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()>::evaluate(sparqlExpression::EvaluationContext*) const::<lambda(size_t)>’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/UuidExpressions.h:61:55,
    inlined from ‘constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const sparqlExpression::detail::uuidExpression::UuidExpressionImpl<<lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(string_view)>(), <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()>::evaluate(sparqlExpression::EvaluationContext*) const::<lambda(size_t)>&; _Args = {long unsigned int&}]’ at /usr/include/c++/13/bits/invoke.h:61:36,
    inlined from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const sparqlExpression::detail::uuidExpression::UuidExpressionImpl<<lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(string_view)>(), <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()>::evaluate(sparqlExpression::EvaluationContext*) const::<lambda(size_t)>&; _Args = {long unsigned int&}]’ at /usr/include/c++/13/bits/invoke.h:96:40,
    inlined from ‘constexpr std::invoke_result_t<_Fn, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = const sparqlExpression::detail::uuidExpression::UuidExpressionImpl<<lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(string_view)>(), <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()>::evaluate(sparqlExpression::EvaluationContext*) const::<lambda(size_t)>&; _Args = {long unsigned int&}]’ at /usr/include/c++/13/functional:113:27,
    inlined from ‘void ad_utility::chunkedForLoop(std::size_t, std::size_t, const Action&, const ChunkOpT&) [with long unsigned int CHUNK_SIZE = 1000; Action = sparqlExpression::detail::uuidExpression::UuidExpressionImpl<<lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(std::string_view)>(), <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()>::evaluate(sparqlExpression::EvaluationContext*) const::<lambda(size_t)>; ChunkOpT = sparqlExpression::detail::uuidExpression::UuidExpressionImpl<<lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(std::string_view)>(), <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()>::evaluate(sparqlExpression::EvaluationContext*) const::<lambda()>]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/util/ChunkedForLoop.h:63:20,
    inlined from ‘sparqlExpression::ExpressionResult sparqlExpression::detail::uuidExpression::UuidExpressionImpl<FuncConv, FuncKey>::evaluate(sparqlExpression::EvaluationContext*) const [with auto FuncConv = <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(std::string_view)>(); auto FuncKey = <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()]’ at /home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/UuidExpressions.h:59:37:
/usr/include/c++/13/variant:224:11: warning: ‘*(ValueId*)((char*)&<unnamed> + offsetof(std::value_type, std::variant<ValueId, LocalVocabEntry>::<unnamed>.std::__detail::__variant::_Variant_base<ValueId, LocalVocabEntry>::<unnamed>.std::__detail::__variant::_Move_assign_base<false, ValueId, LocalVocabEntry>::<unnamed>.std::__detail::__variant::_Copy_assign_base<false, ValueId, LocalVocabEntry>::<unnamed>.std::__detail::__variant::_Move_ctor_base<false, ValueId, LocalVocabEntry>::<unnamed>.std::__detail::__variant::_Copy_ctor_base<false, ValueId, LocalVocabEntry>::<unnamed>.std::__detail::__variant::_Variant_storage<false, ValueId, LocalVocabEntry>::_M_u))’ may be used uninitialized [-Wmaybe-uninitialized]
  224 |         : _M_storage(std::forward<_Args>(__args)...)
      |           ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/UuidExpressions.h: In member function ‘sparqlExpression::ExpressionResult sparqlExpression::detail::uuidExpression::UuidExpressionImpl<FuncConv, FuncKey>::evaluate(sparqlExpression::EvaluationContext*) const [with auto FuncConv = <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(std::string_view)>(); auto FuncKey = <lambda closure object>sparqlExpression::detail::uuidExpression::<lambda(int64_t)>()]’:
/home/raphy/CppPrjWithQLever/build/_deps/qlever-src/src/engine/sparqlExpressions/UuidExpressions.h:61:55: note: ‘<anonymous>’ declared here
   61 |         [&result, &uuidGen](size_t) { result.push_back(FuncConv(uuidGen())); },
      |                                       ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
[685/1146] Building CXX object _deps/qlever-build/test/util/CMakeFiles/testUtil.dir/IdTableHelpers.cpp.o
ninja: build stopped: subcommand failed.
(base) raphy@raohy:~/CppPrjWithQLever/build$ 

What's wrong with this CMakeLists.txt file :

cmake_minimum_required(VERSION 3.15...4.2)

project(CppPrjWithQLever)

set(CMAKE_CXX_STANDARD 20)
set(CMAKE_CXX_STANDARD_REQUIRED ON)

include(FetchContent)

FetchContent_Declare(
    qlever
    GIT_REPOSITORY https://github.com/ad-freiburg/qlever.git
    GIT_TAG iswc-69
)
FetchContent_MakeAvailable(qlever)

add_executable(${PROJECT_NAME}
    ./src/LibQLeverExample.cpp
    ./src/Qlever.cpp
)

target_link_libraries (${PROJECT_NAME} PUBLIC
    qlever
)

and with the two steps I've taken :

(base) raphy@raohy:~/CppPrjWithQLever/build$ cmake -DCMAKE_BUILD_TYPE=Release -DLOGLEVEL=INFO -DUSE_PARALLEL=true -D_NO_TIMING_TESTS=ON -DCMAKE_POLICY_VERSION_MINIMUM=3.5 -GNinja ..


(base) raphy@raohy:~/CppPrjWithQLever/build$ ninja

?

[hannahbast]

@raphael10-collab You seem to be using a different installation. Have you executed the installation commands from the Dockerfile:

sudo apt-get update && sudo apt-get install -y wget
wget https://apt.kitware.com/kitware-archive.sh && chmod +x kitware-archive.sh && sudo ./kitware-archive.sh
sudo apt-get update && sudo apt-get install -y build-essential cmake libicu-dev tzdata pkg-config uuid-runtime uuid-dev git libjemalloc-dev ninja-build libzstd-dev libssl-dev libboost1.83-dev libboost-program-options1.83-dev libboost-iostreams1.83-dev libboost-url1.83-dev libboost-container1.83-dev

And what operating system are you on.

Please don't post the whole output. Try to extract the relevant stuff. We are humans with a small context window.

[RobinTF]

@raphael10-collab If I create a new empty directory with the only contents being a CMakeLists.txt with the following content:

cmake_minimum_required(VERSION 3.27)

project(CppPrjWithQLever)

set(CMAKE_CXX_STANDARD 20)
set(CMAKE_CXX_STANDARD_REQUIRED ON)

include(FetchContent)

FetchContent_Declare(
    qlever
    GIT_REPOSITORY https://github.com/ad-freiburg/qlever.git
    GIT_TAG iswc-69
)
FetchContent_MakeAvailable(qlever)

and then I run

cmake -B . -DCMAKE_BUILD_TYPE=Release && cmake --build . --config Release -j 4

then it works just fine. No need to add_executable and target_include_directories which you are using.

[raphael10-collab]

@hannahbast @RobinTF

(base) raphy@raohy:~$ sudo apt-get update && sudo apt-get install -y wget

Ign:31 http://security.ubuntu.com/ubuntu jammy-security i386 Contents (deb)                                  
Get:65 http://security.ubuntu.com/ubuntu jammy-security amd64 Contents (deb) [244 MB]                        
Get:31 http://security.ubuntu.com/ubuntu jammy-security i386 Contents (deb) [108 MB]                         
Fetched 1.028 MB in 19min 52s (862 kB/s)                                                                     
Reading package lists... Done
[sudo] password for raphy: 
Reading package lists... Done
Building dependency tree... Done
Reading state information... Done
wget is already the newest version (1.21.4-1ubuntu4.1).


(base) raphy@raohy:~$ wget https://apt.kitware.com/kitware-archive.sh && chmod +x kitware-archive.sh && sudo ./kitware-archive.sh
--2025-11-04 10:33:42--  https://apt.kitware.com/kitware-archive.sh
Resolving apt.kitware.com (apt.kitware.com)... 66.194.253.25
Connecting to apt.kitware.com (apt.kitware.com)|66.194.253.25|:443... connected.
HTTP request sent, awaiting response... 200 OK
Length: 1929 (1,9K) [text/x-sh]
Saving to: ‘kitware-archive.sh’


Unpacking kitware-archive-keyring (2025.06.23) ...
Setting up kitware-archive-keyring (2025.06.23) ...



(base) raphy@raohy:~$ sudo apt-get update && sudo apt-get install -y build-essential cmake libicu-dev tzdata pkg-config uuid-runtime uuid-dev git libjemalloc-dev ninja-build libzstd-dev libssl-dev libboost1.83-dev libboost-program-options1.83-dev libboost-iostreams1.83-dev libboost-url1.83-dev libboost-container1.83-dev

build-essential is already the newest version (12.10ubuntu1).
libicu-dev is already the newest version (74.2-1ubuntu3.1).
tzdata is already the newest version (2025b-0ubuntu0.24.04.1).
tzdata set to manually installed.
pkg-config is already the newest version (1.8.1-2build1).
uuid-runtime is already the newest version (2.39.3-9ubuntu6.3).
uuid-dev is already the newest version (2.39.3-9ubuntu6.3).
git is already the newest version (1:2.43.0-1ubuntu7.3).
libjemalloc-dev is already the newest version (5.3.0-2build1).
ninja-build is already the newest version (1.11.1-2).
libzstd-dev is already the newest version (1.5.5+dfsg2-2build1.1).
libssl-dev is already the newest version (3.0.13-0ubuntu3.6).
libssl-dev set to manually installed.
libboost1.83-dev is already the newest version (1.83.0-2.1ubuntu3.1).
libboost-program-options1.83-dev is already the newest version (1.83.0-2.1ubuntu3.1).
libboost-program-options1.83-dev set to manually installed.
libboost-iostreams1.83-dev is already the newest version (1.83.0-2.1ubuntu3.1).
libboost-iostreams1.83-dev set to manually installed.
libboost-url1.83-dev is already the newest version (1.83.0-2.1ubuntu3.1).
libboost-url1.83-dev set to manually installed.
libboost-container1.83-dev is already the newest version (1.83.0-2.1ubuntu3.1).
libboost-container1.83-dev set to manually installed.
The following packages were automatically installed and are no longer required:
  gir1.2-javascriptcoregtk-4.1 libjavascriptcoregtk-4.1-0 libjavascriptcoregtk-4.1-dev libnghttp2-dev librhash0 libsoup-3.0-dev libsysprof-capture-4-dev
Use 'sudo apt autoremove' to remove them.
The following additional packages will be installed:
  cmake-data
Suggested packages:
  cmake-doc
The following packages will be upgraded:
  cmake cmake-data
2 upgraded, 0 newly installed, 0 to remove and 30 not upgraded.
Need to get 15,3 MB of archives.
After this operation, 598 kB of additional disk space will be used.
Get:1 https://apt.kitware.com/ubuntu noble/main amd64 cmake amd64 4.1.2-0kitware1ubuntu24.04.1 [12,8 MB]
Get:2 https://apt.kitware.com/ubuntu noble/main amd64 cmake-data all 4.1.2-0kitware1ubuntu24.04.1 [2.452 kB]
Fetched 15,3 MB in 3s (5.892 kB/s)    
(Reading database ... 376563 files and directories currently installed.)
Preparing to unpack .../cmake_4.1.2-0kitware1ubuntu24.04.1_amd64.deb ...
Unpacking cmake (4.1.2-0kitware1ubuntu24.04.1) over (3.28.3-1build7) ...
Preparing to unpack .../cmake-data_4.1.2-0kitware1ubuntu24.04.1_all.deb ...
Unpacking cmake-data (4.1.2-0kitware1ubuntu24.04.1) over (3.28.3-1build7) ...
Setting up cmake-data (4.1.2-0kitware1ubuntu24.04.1) ...
Setting up cmake (4.1.2-0kitware1ubuntu24.04.1) ...
Processing triggers for man-db (2.12.0-4build2) ...

With this CMakeLists.txt file :

cmake_minimum_required(VERSION 3.27)

project(CppPrjWithQLever)

set(CMAKE_CXX_STANDARD 20)
set(CMAKE_CXX_STANDARD_REQUIRED ON)

include(FetchContent)


FetchContent_Declare(
    qlever
    GIT_REPOSITORY https://github.com/ad-freiburg/qlever.git
    GIT_TAG iswc-69
)
FetchContent_MakeAvailable(qlever)

add_executable(${PROJECT_NAME}
    ./src/LibQLeverExample.cpp
    ./src/Qlever.cpp
)

with just cmake -B . -DCMAKE_BUILD_TYPE=Release && cmake --build . --config Release -j 4 I get this error message:

CMake Error at _deps/fsst-src/CMakeLists.txt:1 (cmake_minimum_required):
  Compatibility with CMake < 3.5 has been removed from CMake.

  Update the VERSION argument <min> value.  Or, use the <min>...<max> syntax
  to tell CMake that the project requires at least <min> but has been updated
  to work with policies introduced by <max> or earlier.

  Or, add -DCMAKE_POLICY_VERSION_MINIMUM=3.5 to try configuring anyway.

Adding -DCMAKE_POLICY_VERSION_MINIMUM=3.5 :

(base) raphy@raohy:~/CppPrjWithQLever$ cmake -B . -DCMAKE_BUILD_TYPE=Release -DCMAKE_POLICY_VERSION_MINIMUM=3.5 && cmake --build . --config Release -j 4
CMake Deprecation Warning at _deps/fsst-src/CMakeLists.txt:1 (cmake_minimum_required):
  Compatibility with CMake < 3.10 will be removed from a future version of
  CMake.

  Update the VERSION argument <min> value.  Or, use the <min>...<max> syntax
  to tell CMake that the project requires at least <min> but has been updated
  to work with policies introduced by <max> or earlier.


-- Performing Test COMPILER_SUPPORTS_MARCH_NATIVE
-- Performing Test COMPILER_SUPPORTS_MARCH_NATIVE - Success
-- The following REQUIRED packages have been found:

 * ICU (required version >= 60)
 * boost_iostreams (required version == 1.83.0)
 * boost_program_options (required version == 1.83.0)
 * boost_headers (required version == 1.83.0)
 * boost_url (required version == 1.83.0)
 * Boost (required version >= 1.81)
 * OpenSSL
 * Threads

-- The following features have been disabled:

 * SHARED_LIBS, builds shared libraries instead of static.
 * PYTHON, provides python interface to S2
 * S2_USE_SYSTEM_INCLUDES, Silence warnings in s2 headers by marking them as SYSTEM includes.

-- Using the multi-header code from /home/raphy/CppPrjWithQLever/_deps/nlohmann-json-src/include/
-- Building without demo. To enable demo build use: -DWITH_DEMO=True
CMake Deprecation Warning at _deps/range-v3-src/CMakeLists.txt:8 (cmake_minimum_required):
  Compatibility with CMake < 3.10 will be removed from a future version of
  CMake.

  Update the VERSION argument <min> value.  Or, use the <min>...<max> syntax
  to tell CMake that the project requires at least <min> but has been updated
  to work with policies introduced by <max> or earlier.


-- Found Git: /usr/bin/git (found version "2.43.0")
-- [range-v3]: C++ std=2a
-- Performing Test RANGES_HAS_CXXSTD
-- Performing Test RANGES_HAS_CXXSTD - Success
-- Performing Test RANGES_HAS_WALL
-- Performing Test RANGES_HAS_WALL - Success
-- Performing Test RANGES_HAS_WEXTRA
-- Performing Test RANGES_HAS_WEXTRA - Success
-- Performing Test RANGES_HAS_WERROR
-- Performing Test RANGES_HAS_WERROR - Success
-- Performing Test RANGES_HAS_FDIAGNOSTIC_SHOW_TEMPLATE_TREE
-- Performing Test RANGES_HAS_FDIAGNOSTIC_SHOW_TEMPLATE_TREE - Success
-- Performing Test RANGES_HAS_FTEMPLATE_BACKTRACE_LIMIT
-- Performing Test RANGES_HAS_FTEMPLATE_BACKTRACE_LIMIT - Success
-- Performing Test RANGES_HAS_FMACRO_BACKTRACE_LIMIT
-- Performing Test RANGES_HAS_FMACRO_BACKTRACE_LIMIT - Failed
-- Performing Test RANGES_HAS_OMIT_FRAME_POINTER
-- Performing Test RANGES_HAS_OMIT_FRAME_POINTER - Success
-- Performing Test RANGES_HAS_OFAST
-- Performing Test RANGES_HAS_OFAST - Success
-- Performing Test RANGES_HAS_STRICT_ALIASING
-- Performing Test RANGES_HAS_STRICT_ALIASING - Success
-- Performing Test RANGES_HAS_STRICT_VTABLE_POINTERS
-- Performing Test RANGES_HAS_STRICT_VTABLE_POINTERS - Failed
-- Performing Test RANGES_HAS_FAST_MATH
-- Performing Test RANGES_HAS_FAST_MATH - Success
-- Performing Test RANGES_HAS_VECTORIZE
-- Performing Test RANGES_HAS_VECTORIZE - Failed
-- Performing Test RANGES_HAS_SIZED_DEALLOCATION
-- Performing Test RANGES_HAS_SIZED_DEALLOCATION - Success
-- Performing Test RANGES_HAS_MARCH_NATIVE
-- Performing Test RANGES_HAS_MARCH_NATIVE - Success
-- Performing Test RANGES_HAS_MTUNE_NATIVE
-- Performing Test RANGES_HAS_MTUNE_NATIVE - Success
-- Performing Test RANGE_V3_ALIGNED_NEW_PROBE
-- Performing Test RANGE_V3_ALIGNED_NEW_PROBE - Success
-- Performing Test RANGE_V3_HAS_FCONCEPTS
-- Performing Test RANGE_V3_HAS_FCONCEPTS - Success
CMake Deprecation Warning at _deps/spatialjoin-src/CMakeLists.txt:1 (cmake_minimum_required):
  Compatibility with CMake < 3.10 will be removed from a future version of
  CMake.

  Update the VERSION argument <min> value.  Or, use the <min>...<max> syntax
  to tell CMake that the project requires at least <min> but has been updated
  to work with policies introduced by <max> or earlier.


-- Found BZip2: /usr/lib/x86_64-linux-gnu/libbz2.so (found version "1.0.8")
-- Looking for BZ2_bzCompressInit
-- Looking for BZ2_bzCompressInit - found
-- Found ZLIB: /usr/lib/x86_64-linux-gnu/libz.so (found version "1.3")
-- ---
-- CXX_FLAGS are :   -Wall -Wextra 
-- CXX_FLAGS_RELEASE are : -O3 -DNDEBUG -O3
-- CXX_FLAGS_DEBUG are : -g
-- IMPORTANT: Make sure you have selected the desired CMAKE_BUILD_TYPE
-- CMAKE_BUILD_TYPE is Release
-- ---
-- The tests are split over multiple binaries
-- Configuring done (17.3s)
-- Generating done (2.0s)
-- Build files have been written to: /home/raphy/CppPrjWithQLever
[  0%] Building CXX object _deps/abseil-build/absl/base/CMakeFiles/log_severity.dir/log_severity.cc.o
[  0%] Building CXX object _deps/abseil-build/absl/base/CMakeFiles/spinlock_wait.dir/internal/spinlock_wait.cc.o
[  0%] Building CXX object CMakeFiles/CppPrjWithQLever.dir/src/LibQLeverExample.cpp.o
[  0%] Building CXX object _deps/abseil-build/absl/base/CMakeFiles/strerror.dir/internal/strerror.cc.o
In file included from /home/raphy/CppPrjWithQLever/src/LibQLeverExample.cpp:9:
/home/raphy/CppPrjWithQLever/src/libqlever/Qlever.h:10:10: fatal error: util/MemorySize/MemorySize.h: No such file or directory
   10 | #include <util/MemorySize/MemorySize.h>
      |          ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
compilation terminated.
gmake[2]: *** [CMakeFiles/CppPrjWithQLever.dir/build.make:79: CMakeFiles/CppPrjWithQLever.dir/src/LibQLeverExample.cpp.o] Error 1
gmake[1]: *** [CMakeFiles/Makefile2:2335: CMakeFiles/CppPrjWithQLever.dir/all] Error 2
gmake[1]: *** Waiting for unfinished jobs....
[  0%] Linking CXX static library ../../../../lib/libabsl_spinlock_wait.a
[  0%] Built target spinlock_wait
[  1%] Linking CXX static library ../../../../lib/libabsl_strerror.a
[  1%] Built target strerror
[  1%] Linking CXX static library ../../../../lib/libabsl_log_severity.a
[  1%] Built target log_severity
gmake: *** [Makefile:156: all] Error 2